text
stringlengths 1
22.8M
|
|---|
```c
/*
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the project nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/* \summary: Multi-Protocol Label Switching (MPLS) printer */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <netdissect-stdinc.h>
#include "netdissect.h"
#include "extract.h"
#include "mpls.h"
static const char *mpls_labelname[] = {
/*0*/ "IPv4 explicit NULL", "router alert", "IPv6 explicit NULL",
"implicit NULL", "rsvd",
/*5*/ "rsvd", "rsvd", "rsvd", "rsvd", "rsvd",
/*10*/ "rsvd", "rsvd", "rsvd", "rsvd", "rsvd",
/*15*/ "rsvd",
};
enum mpls_packet_type {
PT_UNKNOWN,
PT_IPV4,
PT_IPV6,
PT_OSI
};
/*
* RFC3032: MPLS label stack encoding
*/
void
mpls_print(netdissect_options *ndo, const u_char *bp, u_int length)
{
const u_char *p;
uint32_t label_entry;
uint16_t label_stack_depth = 0;
enum mpls_packet_type pt = PT_UNKNOWN;
p = bp;
ND_PRINT((ndo, "MPLS"));
do {
ND_TCHECK2(*p, sizeof(label_entry));
if (length < sizeof(label_entry)) {
ND_PRINT((ndo, "[|MPLS], length %u", length));
return;
}
label_entry = EXTRACT_32BITS(p);
ND_PRINT((ndo, "%s(label %u",
(label_stack_depth && ndo->ndo_vflag) ? "\n\t" : " ",
MPLS_LABEL(label_entry)));
label_stack_depth++;
if (ndo->ndo_vflag &&
MPLS_LABEL(label_entry) < sizeof(mpls_labelname) / sizeof(mpls_labelname[0]))
ND_PRINT((ndo, " (%s)", mpls_labelname[MPLS_LABEL(label_entry)]));
ND_PRINT((ndo, ", exp %u", MPLS_EXP(label_entry)));
if (MPLS_STACK(label_entry))
ND_PRINT((ndo, ", [S]"));
ND_PRINT((ndo, ", ttl %u)", MPLS_TTL(label_entry)));
p += sizeof(label_entry);
length -= sizeof(label_entry);
} while (!MPLS_STACK(label_entry));
/*
* Try to figure out the packet type.
*/
switch (MPLS_LABEL(label_entry)) {
case 0: /* IPv4 explicit NULL label */
case 3: /* IPv4 implicit NULL label */
pt = PT_IPV4;
break;
case 2: /* IPv6 explicit NULL label */
pt = PT_IPV6;
break;
default:
/*
* Generally there's no indication of protocol in MPLS label
* encoding.
*
* However, draft-hsmit-isis-aal5mux-00.txt describes a
* technique for encapsulating IS-IS and IP traffic on the
* same ATM virtual circuit; you look at the first payload
* byte to determine the network layer protocol, based on
* the fact that
*
* 1) the first byte of an IP header is 0x45-0x4f
* for IPv4 and 0x60-0x6f for IPv6;
*
* 2) the first byte of an OSI CLNP packet is 0x81,
* the first byte of an OSI ES-IS packet is 0x82,
* and the first byte of an OSI IS-IS packet is
* 0x83;
*
* so the network layer protocol can be inferred from the
* first byte of the packet, if the protocol is one of the
* ones listed above.
*
* Cisco sends control-plane traffic MPLS-encapsulated in
* this fashion.
*/
ND_TCHECK(*p);
if (length < 1) {
/* nothing to print */
return;
}
switch(*p) {
case 0x45:
case 0x46:
case 0x47:
case 0x48:
case 0x49:
case 0x4a:
case 0x4b:
case 0x4c:
case 0x4d:
case 0x4e:
case 0x4f:
pt = PT_IPV4;
break;
case 0x60:
case 0x61:
case 0x62:
case 0x63:
case 0x64:
case 0x65:
case 0x66:
case 0x67:
case 0x68:
case 0x69:
case 0x6a:
case 0x6b:
case 0x6c:
case 0x6d:
case 0x6e:
case 0x6f:
pt = PT_IPV6;
break;
case 0x81:
case 0x82:
case 0x83:
pt = PT_OSI;
break;
default:
/* ok bail out - we did not figure out what it is*/
break;
}
}
/*
* Print the payload.
*/
if (pt == PT_UNKNOWN) {
if (!ndo->ndo_suppress_default_print)
ND_DEFAULTPRINT(p, length);
return;
}
ND_PRINT((ndo, ndo->ndo_vflag ? "\n\t" : " "));
switch (pt) {
case PT_IPV4:
ip_print(ndo, p, length);
break;
case PT_IPV6:
ip6_print(ndo, p, length);
break;
case PT_OSI:
isoclns_print(ndo, p, length);
break;
default:
break;
}
return;
trunc:
ND_PRINT((ndo, "[|MPLS]"));
}
/*
* Local Variables:
* c-style: whitesmith
* c-basic-offset: 8
* End:
*/
```
|
Spanish Train and Other Stories is the second album by Chris de Burgh, released by A&M Records in 1975.
Releases in some markets, like in North America, used different cover art from those in Europe. Rather than the simple white-on-black text of the European releases, the North American releases depicted an image of a distant train moving along under an evening sky.
Ban in South Africa
The title track is a story about a train carrying the souls of the dead to the Underworld. God and Lucifer are playing Poker – gambling with the souls. Lucifer cheats and wins the game. The song finishes with the stanza:
The song was deemed blasphemous in South Africa, and a ban was ordered. A&M records sued to get the ban overturned – the suit was eventually successful. However, while the suit was in progress, A&M released the album under the title Lonely Sky and Other Stories (without "Spanish Train"). This album is considered a collector's item today – copies are extremely rare. Perversely, the ban only applied to the LP record, so the cassette issue of "Spanish Train" was always freely available.
Track listing
All songs written by Chris de Burgh.
"Spanish Train" – 5:00
"Lonely Sky" – 3:52
"This Song For You" – 4:14
"Patricia the Stripper" – 3:30
"A Spaceman Came Travelling" – 5:10
"I'm Going Home" – 3:34
"The Painter" – 4:20
"Old Friend" – 3:40
"The Tower" – 5:22
"Just Another Poor Boy" – 4:46
Personnel
Chris de Burgh – lead and all backing vocals, acoustic guitars, acoustic piano (3, 9)
Ray Glynn – electric guitars
Tony Reeves – bass guitar, string bass (5)
Chris Laurence – string bass
Tony Hymas – keyboards
David Hentschel – ARP synthesizer (5), synthesizer arrangements (5)
Ken Freeman – string synthesizer
Phillip Goodhand-Tait – harmonium
Chris Mercer – saxophone (7)
Mick Eves – saxophone (7)
Barry de Souza – drums
Lennox Laington – percussion
The Strings, Choir, Recorders and Ocarinas on "The Tower" and "Lonely Sky" were arranged by Robert Kirby who also arranged the brass for "Old Friend" and "This Song For You".
Richard Hewson arranged the strings and brass for "Just Another Poor Boy" and "Spanish Train".
Production
Producer and Engineer – Robin Geoffrey Cable
Assistant Engineers – Mark Dobson, Ian Major and John Kelly.
Mixed at Scorpio and AIR Studios (London, UK).
Mastered by Denis "BilBo" Blackham at Master Room (London, UK).
Front and Back Illustrations – Bill Imhoff
Inside Photography – Clive Arrowsmith
Art Direction – Fabio Nicoli
Design – Junie Osaki
Chart positions
References
External links
The official Chris de Burgh site
Album site on cd-lexikon.de (German)
Chris de Burgh albums
1975 albums
Albums arranged by Robert Kirby
A&M Records albums
|
```kotlin
package mega.privacy.android.data.repository
import com.google.common.truth.Truth.assertThat
import com.google.gson.Gson
import kotlinx.coroutines.ExperimentalCoroutinesApi
import kotlinx.coroutines.flow.firstOrNull
import kotlinx.coroutines.flow.flowOf
import kotlinx.coroutines.test.UnconfinedTestDispatcher
import kotlinx.coroutines.test.runTest
import mega.privacy.android.data.database.DatabaseHandler
import mega.privacy.android.data.gateway.FileGateway
import mega.privacy.android.data.gateway.MegaLocalRoomGateway
import mega.privacy.android.data.gateway.api.MegaApiFolderGateway
import mega.privacy.android.data.gateway.api.MegaApiGateway
import mega.privacy.android.data.gateway.preferences.AppPreferencesGateway
import mega.privacy.android.data.gateway.preferences.MediaPlayerPreferencesGateway
import mega.privacy.android.data.mapper.SortOrderIntMapper
import mega.privacy.android.data.mapper.audios.TypedAudioNodeMapper
import mega.privacy.android.data.mapper.mediaplayer.RepeatToggleModeMapper
import mega.privacy.android.data.mapper.mediaplayer.SubtitleFileInfoMapper
import mega.privacy.android.data.mapper.node.FileNodeMapper
import mega.privacy.android.data.mapper.search.MegaSearchFilterMapper
import mega.privacy.android.data.mapper.videos.TypedVideoNodeMapper
import mega.privacy.android.domain.entity.SortOrder
import mega.privacy.android.domain.entity.mediaplayer.PlaybackInformation
import mega.privacy.android.domain.entity.mediaplayer.RepeatToggleMode
import mega.privacy.android.domain.entity.node.FileNode
import mega.privacy.android.domain.entity.node.NodeId
import mega.privacy.android.domain.entity.node.TypedAudioNode
import mega.privacy.android.domain.entity.node.TypedVideoNode
import mega.privacy.android.domain.entity.search.SearchCategory
import mega.privacy.android.domain.entity.search.SearchTarget
import mega.privacy.android.domain.repository.MediaPlayerRepository
import nz.mega.sdk.MegaCancelToken
import nz.mega.sdk.MegaNode
import nz.mega.sdk.MegaSearchFilter
import org.junit.jupiter.api.BeforeAll
import org.junit.jupiter.api.BeforeEach
import org.junit.jupiter.api.Test
import org.junit.jupiter.api.TestInstance
import org.junit.jupiter.params.ParameterizedTest
import org.junit.jupiter.params.provider.Arguments
import org.junit.jupiter.params.provider.MethodSource
import org.mockito.kotlin.any
import org.mockito.kotlin.anyOrNull
import org.mockito.kotlin.doReturn
import org.mockito.kotlin.mock
import org.mockito.kotlin.reset
import org.mockito.kotlin.verify
import org.mockito.kotlin.whenever
import java.util.stream.Stream
@OptIn(ExperimentalCoroutinesApi::class)
@TestInstance(TestInstance.Lifecycle.PER_CLASS)
class DefaultMediaPlayerRepositoryTest {
private lateinit var underTest: MediaPlayerRepository
private val megaApi = mock<MegaApiGateway>()
private val megaApiFolder = mock<MegaApiFolderGateway>()
private val dbHandler = mock<DatabaseHandler>()
private val fileGateway = mock<FileGateway>()
private val sortOrderIntMapper = mock<SortOrderIntMapper>()
private val appPreferencesGateway = mock<AppPreferencesGateway>()
private val subtitleFileInfoMapper = mock<SubtitleFileInfoMapper>()
private val mediaPlayerPreferencesGateway = mock<MediaPlayerPreferencesGateway>()
private val megaLocalRoomGateway = mock<MegaLocalRoomGateway>()
private val fileNodeMapper = mock<FileNodeMapper>()
private val typedAudioNodeMapper = mock<TypedAudioNodeMapper>()
private val typedVideoNodeMapper = mock<TypedVideoNodeMapper>()
private val cancelTokenProvider = mock<CancelTokenProvider>()
private val searchFilterMapper = mock<MegaSearchFilterMapper>()
private val expectedHandle = 100L
private val expectedMediaId: Long = 1234567
private val expectedTotalDuration: Long = 200000
private val expectedCurrentPosition: Long = 16000
@BeforeAll
fun initialise() {
underTest = DefaultMediaPlayerRepository(
megaApi = megaApi,
megaApiFolder = megaApiFolder,
megaLocalRoomGateway = megaLocalRoomGateway,
dbHandler = dbHandler,
fileNodeMapper = fileNodeMapper,
typedAudioNodeMapper = typedAudioNodeMapper,
typedVideoNodeMapper = typedVideoNodeMapper,
fileGateway = fileGateway,
sortOrderIntMapper = sortOrderIntMapper,
appPreferencesGateway = appPreferencesGateway,
ioDispatcher = UnconfinedTestDispatcher(),
subtitleFileInfoMapper = subtitleFileInfoMapper,
mediaPlayerPreferencesGateway = mediaPlayerPreferencesGateway,
repeatToggleModeMapper = RepeatToggleModeMapper(),
searchFilterMapper = searchFilterMapper,
cancelTokenProvider = cancelTokenProvider
)
}
@BeforeEach
fun resetMocks() {
reset(
megaApi,
megaApiFolder,
dbHandler,
fileGateway,
sortOrderIntMapper,
appPreferencesGateway,
subtitleFileInfoMapper,
mediaPlayerPreferencesGateway,
fileNodeMapper,
typedAudioNodeMapper,
typedVideoNodeMapper,
megaLocalRoomGateway
)
}
@Test
fun `test that get local link for folder link using MegaApi`() = runTest {
val node = mock<MegaNode>()
val expectedLocalLink = "local link"
whenever(megaApiFolder.getMegaNodeByHandle(expectedHandle)).thenReturn(node)
whenever(megaApiFolder.authorizeNode(node)).thenReturn(node)
whenever(megaApi.httpServerGetLocalLink(any())).thenReturn(expectedLocalLink)
val actual = underTest.getLocalLinkForFolderLinkFromMegaApi(expectedHandle)
assertThat(actual).isEqualTo(expectedLocalLink)
}
@Test
fun `test that get local link for folder link using MegaApiFolder`() = runTest {
val node = mock<MegaNode>()
val expectedLocalLink = "local link"
whenever(megaApiFolder.getMegaNodeByHandle(expectedHandle)).thenReturn(node)
whenever(megaApiFolder.authorizeNode(node)).thenReturn(node)
whenever(megaApiFolder.httpServerGetLocalLink(any())).thenReturn(expectedLocalLink)
val actual = underTest.getLocalLinkForFolderLinkFromMegaApiFolder(expectedHandle)
assertThat(actual).isEqualTo(expectedLocalLink)
}
@Test
fun `test that get local link from mega api`() = runTest {
val expectedLocalLink = "local link"
whenever(megaApi.getMegaNodeByHandle(expectedHandle)).thenReturn(mock())
whenever(megaApi.httpServerGetLocalLink(any())).thenReturn(expectedLocalLink)
val actual = underTest.getLocalLinkFromMegaApi(expectedHandle)
assertThat(actual).isEqualTo(expectedLocalLink)
}
@Test
fun `test that updatePlayback information that there is no local data`() = runTest {
val expectedPlaybackInfo = createPlaybackInformation()
underTest.updatePlaybackInformation(expectedPlaybackInfo)
whenever(
appPreferencesGateway.monitorString(
anyOrNull(),
anyOrNull()
)
).thenReturn(flowOf("{}"))
val actual = underTest.monitorPlaybackTimes().firstOrNull()
assertThat(actual?.get(expectedMediaId)?.mediaId).isEqualTo(expectedMediaId)
assertThat(actual?.get(expectedMediaId)?.totalDuration).isEqualTo(expectedTotalDuration)
assertThat(actual?.get(expectedMediaId)?.currentPosition).isEqualTo(expectedCurrentPosition)
}
@Test
fun `test that monitorPlaybackTimes`() = runTest {
val expectedPlaybackInfo = createPlaybackInformation()
whenever(
appPreferencesGateway.monitorString(
anyOrNull(),
anyOrNull()
)
).thenReturn(
flowOf(
Gson().toJson(
mapOf(
Pair(
expectedMediaId,
expectedPlaybackInfo
)
)
)
)
)
val actual = underTest.monitorPlaybackTimes().firstOrNull()
assertThat(actual?.get(expectedMediaId)?.mediaId).isEqualTo(expectedMediaId)
assertThat(actual?.get(expectedMediaId)?.totalDuration).isEqualTo(expectedTotalDuration)
assertThat(actual?.get(expectedMediaId)?.currentPosition).isEqualTo(expectedCurrentPosition)
}
@Test
fun `test that deletePlaybackInformation that playbackInfoMap doesn't include deleted item even local data includes it`() =
runTest {
val expectedPlaybackInfo = createPlaybackInformation()
val expectedDeleteMediaId: Long = 7654321
val expectedDeleteTotalDuration: Long = 300000
val expectedDeleteCurrentPosition: Long = 20000
val expectedDeletePlaybackInfo = PlaybackInformation(
expectedDeleteMediaId,
expectedDeleteTotalDuration,
expectedDeleteCurrentPosition
)
val expectedPlaybackInfoMap = mapOf(
Pair(expectedMediaId, expectedPlaybackInfo),
Pair(expectedDeleteMediaId, expectedDeletePlaybackInfo)
)
underTest.updatePlaybackInformation(expectedPlaybackInfo)
underTest.updatePlaybackInformation(expectedDeletePlaybackInfo)
underTest.deletePlaybackInformation(expectedDeleteMediaId)
whenever(appPreferencesGateway.monitorString(anyOrNull(), anyOrNull())).thenReturn(
flowOf(
Gson().toJson(expectedPlaybackInfoMap)
)
)
val actual = underTest.monitorPlaybackTimes().firstOrNull()
assertThat(actual?.containsKey(expectedDeleteMediaId)).isFalse()
}
@ParameterizedTest(name = "when audio repeatMode is {0}, the result of monitorAudioRepeatMode is {1}")
@MethodSource("provideRepeatModeParameters")
fun `test that the result of monitorAudioRepeatMode functions are correct`(
repeatMode: Int,
repeatToggleMode: RepeatToggleMode,
) =
runTest {
whenever(mediaPlayerPreferencesGateway.monitorAudioRepeatMode()).thenReturn(
flowOf(
repeatMode
)
)
assertThat(
underTest.monitorAudioRepeatMode().firstOrNull()
).isEqualTo(repeatToggleMode)
}
@ParameterizedTest(name = "when video repeatMode is {0}, the result of monitorVideoRepeatMode is {1}")
@MethodSource("provideRepeatModeParameters")
fun `test that the result of monitorVideoRepeatMode functions are correct`(
repeatMode: Int,
repeatToggleMode: RepeatToggleMode,
) = runTest {
whenever(mediaPlayerPreferencesGateway.monitorVideoRepeatMode()).thenReturn(
flowOf(
repeatMode
)
)
assertThat(
underTest.monitorVideoRepeatMode().firstOrNull()
).isEqualTo(repeatToggleMode)
}
@Test
fun `test that getAudioNodes returns list of audio nodes`() = runTest {
setUpMocksForGettingVideOrAudioNode(isVideo = false)
val actual = underTest.getAudioNodes(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideoNodes returns list of video nodes`() = runTest {
setUpMocksForGettingVideOrAudioNode(isVideo = true)
val actual = underTest.getVideoNodes(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getAudioNodesByParentHandle returns list of audio nodes`() = runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = false,
parentId = NodeId(expectedHandle)
)
val actual =
underTest.getAudioNodesByParentHandle(expectedHandle, SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideoNodesByParentHandle by parent handle returns list of video nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = true,
parentId = NodeId(expectedHandle)
)
val actual =
underTest.getVideoNodesByParentHandle(expectedHandle, SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getAudiosByParentHandleFromMegaApiFolder returns list of audio nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = false,
parentId = NodeId(expectedHandle)
)
val actual =
underTest.getAudiosByParentHandleFromMegaApiFolder(
expectedHandle,
SortOrder.ORDER_DEFAULT_DESC
)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideosByParentHandleFromMegaApiFolder by parent handle returns list of video nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = true,
parentId = NodeId(expectedHandle)
)
val actual =
underTest.getVideosByParentHandleFromMegaApiFolder(
expectedHandle,
SortOrder.ORDER_DEFAULT_DESC
)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getAudioNodesFromPublicLinks returns list of audio nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = false,
target = SearchTarget.LINKS_SHARE,
)
val actual = underTest.getAudioNodesFromPublicLinks(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideoNodesFromPublicLinks returns list of video nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = true,
target = SearchTarget.LINKS_SHARE,
)
val actual = underTest.getVideoNodesFromPublicLinks(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
private suspend fun setUpMocksForGettingVideOrAudioNode(
isVideo: Boolean,
target: SearchTarget = SearchTarget.ROOT_NODES,
parentId: NodeId? = null,
) {
val query = ""
val searchCategory = if (isVideo) SearchCategory.VIDEO else SearchCategory.AUDIO
val token = mock<MegaCancelToken>()
val filter = mock<MegaSearchFilter>()
val megaNode = mock<MegaNode> {
on { handle } doReturn expectedHandle
on { duration } doReturn 100
}
val fileNode = mock<FileNode>()
val typedVideoNode = mock<TypedVideoNode> {
on { id } doReturn NodeId(expectedHandle)
}
val typedAudioNode = mock<TypedAudioNode> {
on { id } doReturn NodeId(expectedHandle)
}
val expectedNodes = listOf(megaNode)
whenever(cancelTokenProvider.getOrCreateCancelToken()).thenReturn(token)
whenever(
searchFilterMapper(
searchQuery = query,
parentHandle = parentId,
searchTarget = target,
searchCategory = searchCategory
)
).thenReturn(filter)
whenever(
megaApi.searchWithFilter(
filter,
sortOrderIntMapper(SortOrder.ORDER_DEFAULT_DESC),
token
)
).thenReturn(expectedNodes)
whenever(
megaApi.getChildren(
filter,
sortOrderIntMapper(SortOrder.ORDER_DEFAULT_DESC),
token
)
).thenReturn(expectedNodes)
whenever(
megaApiFolder.search(
filter,
sortOrderIntMapper(SortOrder.ORDER_DEFAULT_DESC),
token
)
).thenReturn(expectedNodes)
whenever(
megaApiFolder.getChildren(
filter,
sortOrderIntMapper(SortOrder.ORDER_DEFAULT_DESC),
token
)
).thenReturn(expectedNodes)
whenever(fileNodeMapper(megaNode, false, null)).thenReturn(fileNode)
whenever(typedVideoNodeMapper(fileNode, 100)).thenReturn(typedVideoNode)
whenever(typedAudioNodeMapper(fileNode, 100)).thenReturn(typedAudioNode)
}
@Test
fun `test that getAudioNodesFromInShares returns list of audio nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = false,
target = SearchTarget.INCOMING_SHARE
)
val actual = underTest.getAudioNodesFromInShares(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideoNodesFromInShares returns list of video nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = true,
target = SearchTarget.INCOMING_SHARE
)
val actual = underTest.getVideoNodesFromInShares(SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getAudioNodesFromOutShares returns list of audio nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = false,
parentId = NodeId(expectedHandle),
target = SearchTarget.OUTGOING_SHARE
)
val actual =
underTest.getAudioNodesFromOutShares(expectedHandle, SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that getVideoNodesFromOutShares returns list of video nodes`() =
runTest {
setUpMocksForGettingVideOrAudioNode(
isVideo = true,
parentId = NodeId(expectedHandle),
target = SearchTarget.OUTGOING_SHARE
)
val actual =
underTest.getVideoNodesFromOutShares(expectedHandle, SortOrder.ORDER_DEFAULT_DESC)
assertThat(actual).isNotEmpty()
assertThat(actual[0].id.longValue).isEqualTo(expectedHandle)
}
@Test
fun `test that megaApiHttpServerStop invokes repository function`() = runTest {
underTest.megaApiHttpServerStop()
verify(megaApi).httpServerStop()
}
@Test
fun `test that megaApiFolderHttpServerStop invokes repository function`() = runTest {
underTest.megaApiFolderHttpServerStop()
verify(megaApiFolder).httpServerStop()
}
@Test
fun `test that megaApiHttpServerStart invokes repository function`() = runTest {
underTest.megaApiHttpServerStart()
verify(megaApi).httpServerStart()
}
@Test
fun `test that megaApiFolderHttpServerStart invokes repository function`() = runTest {
underTest.megaApiFolderHttpServerStart()
verify(megaApiFolder).httpServerStart()
}
@Test
fun `test that megaApiHttpServerIsRunning invokes repository function`() = runTest {
underTest.megaApiHttpServerIsRunning()
verify(megaApi).httpServerIsRunning()
}
@Test
fun `test that megaApiFolderHttpServerIsRunning invokes repository function`() = runTest {
underTest.megaApiFolderHttpServerIsRunning()
verify(megaApiFolder).httpServerIsRunning()
}
@Test
fun `test that megaApiHttpServerSetMaxBufferSize invokes repository function`() = runTest {
val bufferSize = 100
underTest.megaApiHttpServerSetMaxBufferSize(bufferSize)
verify(megaApi).httpServerSetMaxBufferSize(bufferSize)
}
@Test
fun `test that megaApiFolderHttpServerSetMaxBufferSize invokes repository function`() =
runTest {
val bufferSize = 100
underTest.megaApiFolderHttpServerSetMaxBufferSize(bufferSize)
verify(megaApiFolder).httpServerSetMaxBufferSize(bufferSize)
}
/**
* Provides parameters for the test that the result of monitorAudioRepeatMode
*
* The parameters:
* 1. Int value of repeat mode
* 2. RepeatToggleMode
*/
private fun provideRepeatModeParameters() = Stream.of(
Arguments.of(RepeatToggleMode.REPEAT_ALL.ordinal, RepeatToggleMode.REPEAT_ALL),
Arguments.of(RepeatToggleMode.REPEAT_NONE.ordinal, RepeatToggleMode.REPEAT_NONE),
Arguments.of(RepeatToggleMode.REPEAT_ONE.ordinal, RepeatToggleMode.REPEAT_ONE),
)
private fun createPlaybackInformation() = PlaybackInformation(
mediaId = expectedMediaId,
totalDuration = expectedTotalDuration,
currentPosition = expectedCurrentPosition
)
}
```
|
```smalltalk
using Arch.Data.DbEngine.Configuration;
using System;
using System.Collections.Generic;
namespace Arch.Data.DbEngine.Sharding
{
class ShardingStrategyFactory
{
public static readonly ShardingStrategyFactory Instance = new ShardingStrategyFactory();
private ShardingStrategyFactory() { }
/// <summary>
/// get shard strategy object via shard config
/// </summary>
/// <param name="element"></param>
/// <returns></returns>
public IShardingStrategy GetShardingStrategy(DatabaseSetElement element)
{
String shardingStrategy = element.ShardingStrategy;
if (String.IsNullOrEmpty(shardingStrategy))
return null;
var shardconfs = shardingStrategy.Split(';');
var config = new Dictionary<String, String>();
foreach (var shardcnfg in shardconfs)
{
var param = shardcnfg.Split('=');
if (param.Length != 2)
throw new ArgumentException("Sharding parameters invalid.");
//will fix key issue(ignore case in the future)
config.Add(param[0].Trim(), param[1].Trim());
}
String classname;
if (!config.TryGetValue("class", out classname))
throw new ArgumentException("Strategy invalid.");
Type type = Type.GetType(classname);
if (type == null)
throw new ArgumentException("Strategy invalid.");
try
{
var resultStrategy = Activator.CreateInstance(type) as IShardingStrategy;
if (resultStrategy == null)
{
throw new DalException("Strategy {0} didn't implement IShardingStrategy", classname);
}
else
{
resultStrategy.SetShardConfig(config, element);
return resultStrategy;
}
}
catch (Exception ex)
{
throw new DalException("Strategy invalid.", ex);
}
}
}
}
```
|
Henrik Sørgård Solberg (born April 15, 1987 in Trondheim) is a Norwegian ice hockey defenceman currently playing for the Stavanger Oilers of the Norwegian GET-ligaen.
Playing career
Solberg made his professional debut with Lillehammer IK during the 2005–06 season, while in his last year at NTG High School (Norges Toppidrettsgymnas) in Lillehammer.
After graduating from NTG, he went back home to Trondheim to play for Trondheim Ishockeyklubb, where he played for two seasons.
On March 3, 2008, after years of financial struggle, Trondheim Ishockeyklubb was discontinued.
On April 22, 2008, Solberg signed a two-year deal with the Stavanger Oilers.
International play
He has participated at the 2010 IIHF World Championship, the 2012 IIHF World Championship and the 2013 IIHF World Championship as a member of the Norway men's national ice hockey team.
On January 7, 2014, he was named to Team Norway's official 2014 Winter Olympics roster.
Career statistics
Regular season and playoffs
International
References
External links
1987 births
Living people
Norwegian ice hockey defencemen
Olympic ice hockey players for Norway
Ice hockey players at the 2014 Winter Olympics
Lillehammer IK players
Stavanger Oilers players
Trondheim Black Panthers players
Sportspeople from Trondheim
|
```go
package apm
import (
"fmt"
"strconv"
"github.com/newrelic/newrelic-client-go/internal/http"
)
// Deployment represents information about a New Relic application deployment.
type Deployment struct {
Links *DeploymentLinks `json:"links,omitempty"`
ID int `json:"id,omitempty"`
Revision string `json:"revision"`
Changelog string `json:"changelog,omitempty"`
Description string `json:"description,omitempty"`
User string `json:"user,omitempty"`
Timestamp string `json:"timestamp,omitempty"`
}
// DeploymentLinks contain the application ID for the deployment.
type DeploymentLinks struct {
ApplicationID int `json:"application,omitempty"`
}
// ListDeployments returns deployments for an application.
func (a *APM) ListDeployments(applicationID int) ([]*Deployment, error) {
deployments := []*Deployment{}
nextURL := a.config.Region().RestURL("applications", strconv.Itoa(applicationID), "deployments.json")
for nextURL != "" {
response := deploymentsResponse{}
req, err := a.client.NewRequest("GET", nextURL, nil, nil, &response)
if err != nil {
return nil, err
}
req.SetAuthStrategy(&http.PersonalAPIKeyCapableV2Authorizer{})
resp, err := a.client.Do(req)
if err != nil {
return nil, err
}
deployments = append(deployments, response.Deployments...)
paging := a.pager.Parse(resp)
nextURL = paging.Next
}
return deployments, nil
}
// CreateDeployment creates a deployment marker for an application.
func (a *APM) CreateDeployment(applicationID int, deployment Deployment) (*Deployment, error) {
reqBody := deploymentRequestBody{
Deployment: deployment,
}
resp := deploymentResponse{}
url := a.config.Region().RestURL("applications", strconv.Itoa(applicationID), "deployments.json")
req, err := a.client.NewRequest("POST", url, nil, &reqBody, &resp)
if err != nil {
return nil, err
}
req.SetAuthStrategy(&http.PersonalAPIKeyCapableV2Authorizer{})
_, err = a.client.Do(req)
if err != nil {
return nil, err
}
return &resp.Deployment, nil
}
// DeleteDeployment deletes a deployment marker for an application.
func (a *APM) DeleteDeployment(applicationID int, deploymentID int) (*Deployment, error) {
resp := deploymentResponse{}
url := a.config.Region().RestURL("applications", strconv.Itoa(applicationID), "deployments", fmt.Sprintf("%d.json", deploymentID))
req, err := a.client.NewRequest("DELETE", url, nil, nil, &resp)
if err != nil {
return nil, err
}
req.SetAuthStrategy(&http.PersonalAPIKeyCapableV2Authorizer{})
_, err = a.client.Do(req)
if err != nil {
return nil, err
}
return &resp.Deployment, nil
}
type deploymentsResponse struct {
Deployments []*Deployment `json:"deployments,omitempty"`
}
type deploymentResponse struct {
Deployment Deployment `json:"deployment,omitempty"`
}
type deploymentRequestBody struct {
Deployment Deployment `json:"deployment,omitempty"`
}
```
|
```objective-c
/* Automatically generated by configure - do not modify! */
#ifndef FFMPEG_CONFIG_H
#define FFMPEG_CONFIG_H
#define FFMPEG_CONFIGURATION "--disable-everything --disable-all --disable-doc --disable-htmlpages --disable-manpages --disable-podpages --disable-txtpages --disable-static --enable-avcodec --enable-avformat --enable-avutil --enable-fft --enable-rdft --enable-static --disable-bzlib --disable-error-resilience --disable-iconv --disable-lzo --disable-network --disable-schannel --disable-sdl --disable-symver --disable-xlib --disable-zlib --disable-securetransport --disable-d3d11va --disable-dxva2 --disable-vaapi --disable-vda --disable-vdpau --disable-videotoolbox --enable-decoder=vorbis --enable-decoder='pcm_u8,pcm_s16le,pcm_s24le,pcm_s32le,pcm_f32le' --enable-decoder='pcm_s16be,pcm_s24be,pcm_mulaw,pcm_alaw' --enable-demuxer='ogg,matroska,wav' --enable-parser='opus,vorbis' --optflags='\"-O2\"' --enable-decoder='theora,vp8' --enable-parser='vp3,vp8' --disable-asm --disable-inline-asm --enable-pic --enable-decoder='aac,h264,mp3' --enable-demuxer='aac,mp3,mov' --enable-parser='aac,h264,mpegaudio' --enable-lto"
#define FFMPEG_LICENSE "LGPL version 2.1 or later"
#define CONFIG_THIS_YEAR 2016
#define FFMPEG_DATADIR "/usr/local/share/ffmpeg"
#define AVCONV_DATADIR "/usr/local/share/ffmpeg"
#define CC_IDENT "gcc 4.8 (Ubuntu 4.8.4-2ubuntu1~14.04)"
#define av_restrict restrict
#define EXTERN_PREFIX ""
#define EXTERN_ASM
#define BUILDSUF ""
#define SLIBSUF ".so"
#define HAVE_MMX2 HAVE_MMXEXT
#define SWS_MAX_FILTER_SIZE 256
#define ARCH_AARCH64 0
#define ARCH_ALPHA 0
#define ARCH_ARM 0
#define ARCH_AVR32 0
#define ARCH_AVR32_AP 0
#define ARCH_AVR32_UC 0
#define ARCH_BFIN 0
#define ARCH_IA64 0
#define ARCH_M68K 0
#define ARCH_MIPS 0
#define ARCH_MIPS64 0
#define ARCH_PARISC 0
#define ARCH_PPC 0
#define ARCH_PPC64 0
#define ARCH_S390 0
#define ARCH_SH4 0
#define ARCH_SPARC 0
#define ARCH_SPARC64 0
#define ARCH_TILEGX 0
#define ARCH_TILEPRO 0
#define ARCH_TOMI 0
#define ARCH_X86 0
#define ARCH_X86_32 0
#define ARCH_X86_64 0
#define HAVE_ARMV5TE 0
#define HAVE_ARMV6 0
#define HAVE_ARMV6T2 0
#define HAVE_ARMV8 0
#define HAVE_NEON 0
#define HAVE_VFP 0
#define HAVE_VFPV3 0
#define HAVE_SETEND 0
#define HAVE_ALTIVEC 0
#define HAVE_DCBZL 0
#define HAVE_LDBRX 0
#define HAVE_POWER8 0
#define HAVE_PPC4XX 0
#define HAVE_VSX 0
#define HAVE_AESNI 0
#define HAVE_AMD3DNOW 0
#define HAVE_AMD3DNOWEXT 0
#define HAVE_AVX 0
#define HAVE_AVX2 0
#define HAVE_FMA3 0
#define HAVE_FMA4 0
#define HAVE_MMX 0
#define HAVE_MMXEXT 0
#define HAVE_SSE 0
#define HAVE_SSE2 0
#define HAVE_SSE3 0
#define HAVE_SSE4 0
#define HAVE_SSE42 0
#define HAVE_SSSE3 0
#define HAVE_XOP 0
#define HAVE_CPUNOP 0
#define HAVE_I686 0
#define HAVE_MIPSFPU 0
#define HAVE_MIPS32R2 0
#define HAVE_MIPS64R2 0
#define HAVE_MIPS32R6 0
#define HAVE_MIPS64R6 0
#define HAVE_MIPSDSP 0
#define HAVE_MIPSDSPR2 0
#define HAVE_MSA 0
#define HAVE_LOONGSON2 0
#define HAVE_LOONGSON3 0
#define HAVE_MMI 0
#define HAVE_ARMV5TE_EXTERNAL 0
#define HAVE_ARMV6_EXTERNAL 0
#define HAVE_ARMV6T2_EXTERNAL 0
#define HAVE_ARMV8_EXTERNAL 0
#define HAVE_NEON_EXTERNAL 0
#define HAVE_VFP_EXTERNAL 0
#define HAVE_VFPV3_EXTERNAL 0
#define HAVE_SETEND_EXTERNAL 0
#define HAVE_ALTIVEC_EXTERNAL 0
#define HAVE_DCBZL_EXTERNAL 0
#define HAVE_LDBRX_EXTERNAL 0
#define HAVE_POWER8_EXTERNAL 0
#define HAVE_PPC4XX_EXTERNAL 0
#define HAVE_VSX_EXTERNAL 0
#define HAVE_AESNI_EXTERNAL 0
#define HAVE_AMD3DNOW_EXTERNAL 0
#define HAVE_AMD3DNOWEXT_EXTERNAL 0
#define HAVE_AVX_EXTERNAL 0
#define HAVE_AVX2_EXTERNAL 0
#define HAVE_FMA3_EXTERNAL 0
#define HAVE_FMA4_EXTERNAL 0
#define HAVE_MMX_EXTERNAL 0
#define HAVE_MMXEXT_EXTERNAL 0
#define HAVE_SSE_EXTERNAL 0
#define HAVE_SSE2_EXTERNAL 0
#define HAVE_SSE3_EXTERNAL 0
#define HAVE_SSE4_EXTERNAL 0
#define HAVE_SSE42_EXTERNAL 0
#define HAVE_SSSE3_EXTERNAL 0
#define HAVE_XOP_EXTERNAL 0
#define HAVE_CPUNOP_EXTERNAL 0
#define HAVE_I686_EXTERNAL 0
#define HAVE_MIPSFPU_EXTERNAL 0
#define HAVE_MIPS32R2_EXTERNAL 0
#define HAVE_MIPS64R2_EXTERNAL 0
#define HAVE_MIPS32R6_EXTERNAL 0
#define HAVE_MIPS64R6_EXTERNAL 0
#define HAVE_MIPSDSP_EXTERNAL 0
#define HAVE_MIPSDSPR2_EXTERNAL 0
#define HAVE_MSA_EXTERNAL 0
#define HAVE_LOONGSON2_EXTERNAL 0
#define HAVE_LOONGSON3_EXTERNAL 0
#define HAVE_MMI_EXTERNAL 0
#define HAVE_ARMV5TE_INLINE 0
#define HAVE_ARMV6_INLINE 0
#define HAVE_ARMV6T2_INLINE 0
#define HAVE_ARMV8_INLINE 0
#define HAVE_NEON_INLINE 0
#define HAVE_VFP_INLINE 0
#define HAVE_VFPV3_INLINE 0
#define HAVE_SETEND_INLINE 0
#define HAVE_ALTIVEC_INLINE 0
#define HAVE_DCBZL_INLINE 0
#define HAVE_LDBRX_INLINE 0
#define HAVE_POWER8_INLINE 0
#define HAVE_PPC4XX_INLINE 0
#define HAVE_VSX_INLINE 0
#define HAVE_AESNI_INLINE 0
#define HAVE_AMD3DNOW_INLINE 0
#define HAVE_AMD3DNOWEXT_INLINE 0
#define HAVE_AVX_INLINE 0
#define HAVE_AVX2_INLINE 0
#define HAVE_FMA3_INLINE 0
#define HAVE_FMA4_INLINE 0
#define HAVE_MMX_INLINE 0
#define HAVE_MMXEXT_INLINE 0
#define HAVE_SSE_INLINE 0
#define HAVE_SSE2_INLINE 0
#define HAVE_SSE3_INLINE 0
#define HAVE_SSE4_INLINE 0
#define HAVE_SSE42_INLINE 0
#define HAVE_SSSE3_INLINE 0
#define HAVE_XOP_INLINE 0
#define HAVE_CPUNOP_INLINE 0
#define HAVE_I686_INLINE 0
#define HAVE_MIPSFPU_INLINE 0
#define HAVE_MIPS32R2_INLINE 0
#define HAVE_MIPS64R2_INLINE 0
#define HAVE_MIPS32R6_INLINE 0
#define HAVE_MIPS64R6_INLINE 0
#define HAVE_MIPSDSP_INLINE 0
#define HAVE_MIPSDSPR2_INLINE 0
#define HAVE_MSA_INLINE 0
#define HAVE_LOONGSON2_INLINE 0
#define HAVE_LOONGSON3_INLINE 0
#define HAVE_MMI_INLINE 0
#define HAVE_ALIGNED_STACK 0
#define HAVE_FAST_64BIT 0
#define HAVE_FAST_CLZ 0
#define HAVE_FAST_CMOV 0
#define HAVE_LOCAL_ALIGNED_8 1
#define HAVE_LOCAL_ALIGNED_16 1
#define HAVE_LOCAL_ALIGNED_32 1
#define HAVE_SIMD_ALIGN_16 0
#define HAVE_ATOMICS_GCC 1
#define HAVE_ATOMICS_SUNCC 0
#define HAVE_ATOMICS_WIN32 0
#define HAVE_ATOMIC_CAS_PTR 0
#define HAVE_ATOMIC_COMPARE_EXCHANGE 1
#define HAVE_MACHINE_RW_BARRIER 0
#define HAVE_MEMORYBARRIER 0
#define HAVE_MM_EMPTY 1
#define HAVE_RDTSC 0
#define HAVE_SARESTART 1
#define HAVE_SYNC_VAL_COMPARE_AND_SWAP 1
#define HAVE_CABS 1
#define HAVE_CEXP 1
#define HAVE_INLINE_ASM 0
#define HAVE_SYMVER 0
#define HAVE_YASM 0
#define HAVE_BIGENDIAN 0
#define HAVE_FAST_UNALIGNED 0
#define HAVE_INCOMPATIBLE_LIBAV_ABI 0
#define HAVE_ALSA_ASOUNDLIB_H 0
#define HAVE_ALTIVEC_H 0
#define HAVE_ARPA_INET_H 0
#define HAVE_ASM_TYPES_H 1
#define HAVE_CDIO_PARANOIA_H 0
#define HAVE_CDIO_PARANOIA_PARANOIA_H 0
#define HAVE_DEV_BKTR_IOCTL_BT848_H 0
#define HAVE_DEV_BKTR_IOCTL_METEOR_H 0
#define HAVE_DEV_IC_BT8XX_H 0
#define HAVE_DEV_VIDEO_BKTR_IOCTL_BT848_H 0
#define HAVE_DEV_VIDEO_METEOR_IOCTL_METEOR_H 0
#define HAVE_DIRECT_H 0
#define HAVE_DIRENT_H 1
#define HAVE_DLFCN_H 1
#define HAVE_D3D11_H 0
#define HAVE_DXVA_H 0
#define HAVE_ES2_GL_H 0
#define HAVE_GSM_H 0
#define HAVE_IO_H 0
#define HAVE_MACH_MACH_TIME_H 0
#define HAVE_MACHINE_IOCTL_BT848_H 0
#define HAVE_MACHINE_IOCTL_METEOR_H 0
#define HAVE_MALLOC_H 1
#define HAVE_OPENJPEG_2_1_OPENJPEG_H 0
#define HAVE_OPENJPEG_2_0_OPENJPEG_H 0
#define HAVE_OPENJPEG_1_5_OPENJPEG_H 0
#define HAVE_OPENGL_GL3_H 0
#define HAVE_POLL_H 1
#define HAVE_SNDIO_H 0
#define HAVE_SOUNDCARD_H 0
#define HAVE_SYS_MMAN_H 1
#define HAVE_SYS_PARAM_H 1
#define HAVE_SYS_RESOURCE_H 1
#define HAVE_SYS_SELECT_H 1
#define HAVE_SYS_SOUNDCARD_H 1
#define HAVE_SYS_TIME_H 1
#define HAVE_SYS_UN_H 1
#define HAVE_SYS_VIDEOIO_H 0
#define HAVE_TERMIOS_H 1
#define HAVE_UDPLITE_H 0
#define HAVE_UNISTD_H 1
#define HAVE_VALGRIND_VALGRIND_H 0
#define HAVE_WINDOWS_H 0
#define HAVE_WINSOCK2_H 0
#define HAVE_INTRINSICS_NEON 0
#define HAVE_ATANF 1
#define HAVE_ATAN2F 1
#define HAVE_CBRT 1
#define HAVE_CBRTF 1
#define HAVE_COPYSIGN 1
#define HAVE_COSF 1
#define HAVE_ERF 1
#define HAVE_EXP2 1
#define HAVE_EXP2F 1
#define HAVE_EXPF 1
#define HAVE_HYPOT 1
#define HAVE_ISINF 1
#define HAVE_ISNAN 1
#define HAVE_LDEXPF 1
#define HAVE_LLRINT 1
#define HAVE_LLRINTF 1
#define HAVE_LOG2 1
#define HAVE_LOG2F 1
#define HAVE_LOG10F 1
#define HAVE_LRINT 1
#define HAVE_LRINTF 1
#define HAVE_POWF 1
#define HAVE_RINT 1
#define HAVE_ROUND 1
#define HAVE_ROUNDF 1
#define HAVE_SINF 1
#define HAVE_TRUNC 1
#define HAVE_TRUNCF 1
#define HAVE_ACCESS 1
#define HAVE_ALIGNED_MALLOC 0
#define HAVE_ARC4RANDOM 0
#define HAVE_CLOCK_GETTIME 1
#define HAVE_CLOSESOCKET 0
#define HAVE_COMMANDLINETOARGVW 0
#define HAVE_COTASKMEMFREE 0
#define HAVE_CRYPTGENRANDOM 0
#define HAVE_DLOPEN 1
#define HAVE_FCNTL 1
#define HAVE_FLT_LIM 1
#define HAVE_FORK 1
#define HAVE_GETADDRINFO 0
#define HAVE_GETHRTIME 0
#define HAVE_GETOPT 1
#define HAVE_GETPROCESSAFFINITYMASK 0
#define HAVE_GETPROCESSMEMORYINFO 0
#define HAVE_GETPROCESSTIMES 0
#define HAVE_GETRUSAGE 1
#define HAVE_GETSYSTEMTIMEASFILETIME 0
#define HAVE_GETTIMEOFDAY 1
#define HAVE_GLOB 1
#define HAVE_GLXGETPROCADDRESS 0
#define HAVE_GMTIME_R 1
#define HAVE_INET_ATON 0
#define HAVE_ISATTY 1
#define HAVE_JACK_PORT_GET_LATENCY_RANGE 0
#define HAVE_KBHIT 0
#define HAVE_LOCALTIME_R 1
#define HAVE_LSTAT 1
#define HAVE_LZO1X_999_COMPRESS 0
#define HAVE_MACH_ABSOLUTE_TIME 0
#define HAVE_MAPVIEWOFFILE 0
#define HAVE_MEMALIGN 1
#define HAVE_MKSTEMP 1
#define HAVE_MMAP 1
#define HAVE_MPROTECT 1
#define HAVE_NANOSLEEP 1
#define HAVE_PEEKNAMEDPIPE 0
#define HAVE_POSIX_MEMALIGN 1
#define HAVE_PTHREAD_CANCEL 1
#define HAVE_SCHED_GETAFFINITY 1
#define HAVE_SETCONSOLETEXTATTRIBUTE 0
#define HAVE_SETCONSOLECTRLHANDLER 0
#define HAVE_SETMODE 0
#define HAVE_SETRLIMIT 1
#define HAVE_SLEEP 0
#define HAVE_STRERROR_R 1
#define HAVE_SYSCONF 1
#define HAVE_SYSCTL 1
#define HAVE_USLEEP 1
#define HAVE_UTGETOSTYPEFROMSTRING 0
#define HAVE_VIRTUALALLOC 0
#define HAVE_WGLGETPROCADDRESS 0
#define HAVE_PTHREADS 1
#define HAVE_OS2THREADS 0
#define HAVE_W32THREADS 0
#define HAVE_AS_DN_DIRECTIVE 0
#define HAVE_AS_FUNC 0
#define HAVE_AS_OBJECT_ARCH 0
#define HAVE_ASM_MOD_Q 0
#define HAVE_ATTRIBUTE_MAY_ALIAS 1
#define HAVE_ATTRIBUTE_PACKED 1
#define HAVE_EBP_AVAILABLE 1
#define HAVE_EBX_AVAILABLE 1
#define HAVE_GNU_AS 0
#define HAVE_GNU_WINDRES 0
#define HAVE_IBM_ASM 0
#define HAVE_INLINE_ASM_LABELS 1
#define HAVE_INLINE_ASM_NONLOCAL_LABELS 1
#define HAVE_INLINE_ASM_DIRECT_SYMBOL_REFS 0
#define HAVE_PRAGMA_DEPRECATED 1
#define HAVE_RSYNC_CONTIMEOUT 1
#define HAVE_SYMVER_ASM_LABEL 0
#define HAVE_SYMVER_GNU_ASM 1
#define HAVE_VFP_ARGS 0
#define HAVE_XFORM_ASM 0
#define HAVE_XMM_CLOBBERS 1
#define HAVE_CONDITION_VARIABLE_PTR 0
#define HAVE_SOCKLEN_T 0
#define HAVE_STRUCT_ADDRINFO 0
#define HAVE_STRUCT_GROUP_SOURCE_REQ 0
#define HAVE_STRUCT_IP_MREQ_SOURCE 0
#define HAVE_STRUCT_IPV6_MREQ 0
#define HAVE_STRUCT_POLLFD 0
#define HAVE_STRUCT_RUSAGE_RU_MAXRSS 1
#define HAVE_STRUCT_SCTP_EVENT_SUBSCRIBE 0
#define HAVE_STRUCT_SOCKADDR_IN6 0
#define HAVE_STRUCT_SOCKADDR_SA_LEN 0
#define HAVE_STRUCT_SOCKADDR_STORAGE 0
#define HAVE_STRUCT_STAT_ST_MTIM_TV_NSEC 1
#define HAVE_STRUCT_V4L2_FRMIVALENUM_DISCRETE 1
#define HAVE_ATOMICS_NATIVE 1
#define HAVE_DOS_PATHS 0
#define HAVE_DXVA2API_COBJ 0
#define HAVE_DXVA2_LIB 0
#define HAVE_WINRT 0
#define HAVE_LIBC_MSVCRT 0
#define HAVE_LIBDC1394_1 0
#define HAVE_LIBDC1394_2 0
#define HAVE_MAKEINFO 1
#define HAVE_MAKEINFO_HTML 1
#define HAVE_PERL 1
#define HAVE_POD2MAN 1
#define HAVE_SDL 0
#define HAVE_SECTION_DATA_REL_RO 1
#define HAVE_TEXI2HTML 0
#define HAVE_THREADS 1
#define HAVE_VAAPI_X11 0
#define HAVE_VDPAU_X11 0
#define HAVE_XLIB 0
#define CONFIG_BSFS 0
#define CONFIG_DECODERS 1
#define CONFIG_ENCODERS 0
#define CONFIG_HWACCELS 0
#define CONFIG_PARSERS 1
#define CONFIG_INDEVS 0
#define CONFIG_OUTDEVS 0
#define CONFIG_FILTERS 0
#define CONFIG_DEMUXERS 1
#define CONFIG_MUXERS 0
#define CONFIG_PROTOCOLS 0
#define CONFIG_DOC 0
#define CONFIG_HTMLPAGES 0
#define CONFIG_MANPAGES 0
#define CONFIG_PODPAGES 0
#define CONFIG_TXTPAGES 0
#define CONFIG_AVIO_READING_EXAMPLE 1
#define CONFIG_AVIO_DIR_CMD_EXAMPLE 1
#define CONFIG_DECODING_ENCODING_EXAMPLE 1
#define CONFIG_DEMUXING_DECODING_EXAMPLE 1
#define CONFIG_EXTRACT_MVS_EXAMPLE 1
#define CONFIG_FILTER_AUDIO_EXAMPLE 0
#define CONFIG_FILTERING_AUDIO_EXAMPLE 0
#define CONFIG_FILTERING_VIDEO_EXAMPLE 0
#define CONFIG_METADATA_EXAMPLE 1
#define CONFIG_MUXING_EXAMPLE 0
#define CONFIG_QSVDEC_EXAMPLE 0
#define CONFIG_REMUXING_EXAMPLE 1
#define CONFIG_RESAMPLING_AUDIO_EXAMPLE 0
#define CONFIG_SCALING_VIDEO_EXAMPLE 0
#define CONFIG_TRANSCODE_AAC_EXAMPLE 0
#define CONFIG_TRANSCODING_EXAMPLE 0
#define CONFIG_AVISYNTH 0
#define CONFIG_BZLIB 0
#define CONFIG_CHROMAPRINT 0
#define CONFIG_CRYSTALHD 0
#define CONFIG_DECKLINK 0
#define CONFIG_FREI0R 0
#define CONFIG_GCRYPT 0
#define CONFIG_GMP 0
#define CONFIG_GNUTLS 0
#define CONFIG_ICONV 0
#define CONFIG_LADSPA 0
#define CONFIG_LIBAACPLUS 0
#define CONFIG_LIBASS 0
#define CONFIG_LIBBLURAY 0
#define CONFIG_LIBBS2B 0
#define CONFIG_LIBCACA 0
#define CONFIG_LIBCDIO 0
#define CONFIG_LIBCELT 0
#define CONFIG_LIBDC1394 0
#define CONFIG_LIBDCADEC 0
#define CONFIG_LIBFAAC 0
#define CONFIG_LIBFDK_AAC 0
#define CONFIG_LIBFLITE 0
#define CONFIG_LIBFONTCONFIG 0
#define CONFIG_LIBFREETYPE 0
#define CONFIG_LIBFRIBIDI 0
#define CONFIG_LIBGME 0
#define CONFIG_LIBGSM 0
#define CONFIG_LIBIEC61883 0
#define CONFIG_LIBILBC 0
#define CONFIG_LIBKVAZAAR 0
#define CONFIG_LIBMFX 0
#define CONFIG_LIBMODPLUG 0
#define CONFIG_LIBMP3LAME 0
#define CONFIG_LIBNUT 0
#define CONFIG_LIBOPENCORE_AMRNB 0
#define CONFIG_LIBOPENCORE_AMRWB 0
#define CONFIG_LIBOPENCV 0
#define CONFIG_LIBOPENH264 0
#define CONFIG_LIBOPENJPEG 0
#define CONFIG_LIBOPUS 0
#define CONFIG_LIBPULSE 0
#define CONFIG_LIBQUVI 0
#define CONFIG_LIBRTMP 0
#define CONFIG_LIBRUBBERBAND 0
#define CONFIG_LIBSCHROEDINGER 0
#define CONFIG_LIBSHINE 0
#define CONFIG_LIBSMBCLIENT 0
#define CONFIG_LIBSNAPPY 0
#define CONFIG_LIBSOXR 0
#define CONFIG_LIBSPEEX 0
#define CONFIG_LIBSSH 0
#define CONFIG_LIBTESSERACT 0
#define CONFIG_LIBTHEORA 0
#define CONFIG_LIBTWOLAME 0
#define CONFIG_LIBUTVIDEO 0
#define CONFIG_LIBV4L2 0
#define CONFIG_LIBVIDSTAB 0
#define CONFIG_LIBVO_AACENC 0
#define CONFIG_LIBVO_AMRWBENC 0
#define CONFIG_LIBVORBIS 0
#define CONFIG_LIBVPX 0
#define CONFIG_LIBWAVPACK 0
#define CONFIG_LIBWEBP 0
#define CONFIG_LIBX264 0
#define CONFIG_LIBX265 0
#define CONFIG_LIBXAVS 0
#define CONFIG_LIBXCB 1
#define CONFIG_LIBXCB_SHM 1
#define CONFIG_LIBXCB_SHAPE 1
#define CONFIG_LIBXCB_XFIXES 1
#define CONFIG_LIBXVID 0
#define CONFIG_LIBZIMG 0
#define CONFIG_LIBZMQ 0
#define CONFIG_LIBZVBI 0
#define CONFIG_LZMA 0
#define CONFIG_MMAL 0
#define CONFIG_NETCDF 0
#define CONFIG_NVENC 0
#define CONFIG_OPENAL 0
#define CONFIG_OPENCL 0
#define CONFIG_OPENGL 0
#define CONFIG_OPENSSL 0
#define CONFIG_SCHANNEL 0
#define CONFIG_SDL 0
#define CONFIG_SECURETRANSPORT 0
#define CONFIG_X11GRAB 0
#define CONFIG_XLIB 0
#define CONFIG_ZLIB 0
#define CONFIG_FTRAPV 0
#define CONFIG_GRAY 0
#define CONFIG_HARDCODED_TABLES 0
#define CONFIG_RUNTIME_CPUDETECT 1
#define CONFIG_SAFE_BITSTREAM_READER 1
#define CONFIG_SHARED 0
#define CONFIG_SMALL 0
#define CONFIG_STATIC 1
#define CONFIG_SWSCALE_ALPHA 1
#define CONFIG_D3D11VA 0
#define CONFIG_DXVA2 0
#define CONFIG_VAAPI 0
#define CONFIG_VDA 0
#define CONFIG_VDPAU 0
#define CONFIG_VIDEOTOOLBOX 0
#define CONFIG_XVMC 0
#define CONFIG_GPL 0
#define CONFIG_NONFREE 0
#define CONFIG_VERSION3 0
#define CONFIG_AVCODEC 1
#define CONFIG_AVDEVICE 0
#define CONFIG_AVFILTER 0
#define CONFIG_AVFORMAT 1
#define CONFIG_AVRESAMPLE 0
#define CONFIG_AVUTIL 1
#define CONFIG_POSTPROC 0
#define CONFIG_SWRESAMPLE 0
#define CONFIG_SWSCALE 0
#define CONFIG_FFPLAY 0
#define CONFIG_FFPROBE 0
#define CONFIG_FFSERVER 0
#define CONFIG_FFMPEG 0
#define CONFIG_DCT 1
#define CONFIG_DWT 0
#define CONFIG_ERROR_RESILIENCE 0
#define CONFIG_FAAN 1
#define CONFIG_FAST_UNALIGNED 0
#define CONFIG_FFT 1
#define CONFIG_LSP 0
#define CONFIG_LZO 0
#define CONFIG_MDCT 1
#define CONFIG_PIXELUTILS 0
#define CONFIG_NETWORK 0
#define CONFIG_RDFT 1
#define CONFIG_FONTCONFIG 0
#define CONFIG_INCOMPATIBLE_LIBAV_ABI 0
#define CONFIG_MEMALIGN_HACK 0
#define CONFIG_MEMORY_POISONING 0
#define CONFIG_NEON_CLOBBER_TEST 0
#define CONFIG_PIC 1
#define CONFIG_POD2MAN 1
#define CONFIG_RAISE_MAJOR 0
#define CONFIG_THUMB 0
#define CONFIG_VALGRIND_BACKTRACE 0
#define CONFIG_XMM_CLOBBER_TEST 0
#define CONFIG_AANDCTTABLES 0
#define CONFIG_AC3DSP 0
#define CONFIG_AUDIO_FRAME_QUEUE 0
#define CONFIG_AUDIODSP 0
#define CONFIG_BLOCKDSP 0
#define CONFIG_BSWAPDSP 0
#define CONFIG_CABAC 1
#define CONFIG_DIRAC_PARSE 1
#define CONFIG_DVPROFILE 0
#define CONFIG_EXIF 0
#define CONFIG_FAANDCT 0
#define CONFIG_FAANIDCT 0
#define CONFIG_FDCTDSP 0
#define CONFIG_FLACDSP 0
#define CONFIG_FMTCONVERT 0
#define CONFIG_FRAME_THREAD_ENCODER 0
#define CONFIG_G722DSP 0
#define CONFIG_GOLOMB 1
#define CONFIG_GPLV3 0
#define CONFIG_H263DSP 0
#define CONFIG_H264CHROMA 1
#define CONFIG_H264DSP 1
#define CONFIG_H264PRED 1
#define CONFIG_H264QPEL 1
#define CONFIG_HPELDSP 1
#define CONFIG_HUFFMAN 0
#define CONFIG_HUFFYUVDSP 0
#define CONFIG_HUFFYUVENCDSP 0
#define CONFIG_IDCTDSP 0
#define CONFIG_IIRFILTER 0
#define CONFIG_IMDCT15 1
#define CONFIG_INTRAX8 0
#define CONFIG_IVIDSP 0
#define CONFIG_JPEGTABLES 0
#define CONFIG_LIBX262 0
#define CONFIG_LGPLV3 0
#define CONFIG_LLAUDDSP 0
#define CONFIG_LLVIDDSP 0
#define CONFIG_LPC 0
#define CONFIG_LZF 0
#define CONFIG_ME_CMP 0
#define CONFIG_MPEG_ER 0
#define CONFIG_MPEGAUDIO 1
#define CONFIG_MPEGAUDIODSP 1
#define CONFIG_MPEGVIDEO 0
#define CONFIG_MPEGVIDEOENC 0
#define CONFIG_MSS34DSP 0
#define CONFIG_PIXBLOCKDSP 0
#define CONFIG_QPELDSP 0
#define CONFIG_QSV 0
#define CONFIG_QSVDEC 0
#define CONFIG_QSVENC 0
#define CONFIG_RANGECODER 0
#define CONFIG_RIFFDEC 1
#define CONFIG_RIFFENC 0
#define CONFIG_RTPDEC 0
#define CONFIG_RTPENC_CHAIN 0
#define CONFIG_RV34DSP 0
#define CONFIG_SINEWIN 1
#define CONFIG_SNAPPY 0
#define CONFIG_STARTCODE 1
#define CONFIG_TEXTUREDSP 0
#define CONFIG_TEXTUREDSPENC 0
#define CONFIG_TPELDSP 0
#define CONFIG_VIDEODSP 1
#define CONFIG_VP3DSP 1
#define CONFIG_VP56DSP 0
#define CONFIG_VP8DSP 1
#define CONFIG_WMA_FREQS 0
#define CONFIG_WMV2DSP 0
#define CONFIG_AAC_ADTSTOASC_BSF 0
#define CONFIG_CHOMP_BSF 0
#define CONFIG_DUMP_EXTRADATA_BSF 0
#define CONFIG_H264_MP4TOANNEXB_BSF 0
#define CONFIG_HEVC_MP4TOANNEXB_BSF 0
#define CONFIG_IMX_DUMP_HEADER_BSF 0
#define CONFIG_MJPEG2JPEG_BSF 0
#define CONFIG_MJPEGA_DUMP_HEADER_BSF 0
#define CONFIG_MP3_HEADER_DECOMPRESS_BSF 0
#define CONFIG_MPEG4_UNPACK_BFRAMES_BSF 0
#define CONFIG_MOV2TEXTSUB_BSF 0
#define CONFIG_NOISE_BSF 0
#define CONFIG_REMOVE_EXTRADATA_BSF 0
#define CONFIG_TEXT2MOVSUB_BSF 0
#define CONFIG_AASC_DECODER 0
#define CONFIG_AIC_DECODER 0
#define CONFIG_ALIAS_PIX_DECODER 0
#define CONFIG_AMV_DECODER 0
#define CONFIG_ANM_DECODER 0
#define CONFIG_ANSI_DECODER 0
#define CONFIG_APNG_DECODER 0
#define CONFIG_ASV1_DECODER 0
#define CONFIG_ASV2_DECODER 0
#define CONFIG_AURA_DECODER 0
#define CONFIG_AURA2_DECODER 0
#define CONFIG_AVRP_DECODER 0
#define CONFIG_AVRN_DECODER 0
#define CONFIG_AVS_DECODER 0
#define CONFIG_AVUI_DECODER 0
#define CONFIG_AYUV_DECODER 0
#define CONFIG_BETHSOFTVID_DECODER 0
#define CONFIG_BFI_DECODER 0
#define CONFIG_BINK_DECODER 0
#define CONFIG_BMP_DECODER 0
#define CONFIG_BMV_VIDEO_DECODER 0
#define CONFIG_BRENDER_PIX_DECODER 0
#define CONFIG_C93_DECODER 0
#define CONFIG_CAVS_DECODER 0
#define CONFIG_CDGRAPHICS_DECODER 0
#define CONFIG_CDXL_DECODER 0
#define CONFIG_CINEPAK_DECODER 0
#define CONFIG_CLJR_DECODER 0
#define CONFIG_CLLC_DECODER 0
#define CONFIG_COMFORTNOISE_DECODER 0
#define CONFIG_CPIA_DECODER 0
#define CONFIG_CSCD_DECODER 0
#define CONFIG_CYUV_DECODER 0
#define CONFIG_DDS_DECODER 0
#define CONFIG_DFA_DECODER 0
#define CONFIG_DIRAC_DECODER 0
#define CONFIG_DNXHD_DECODER 0
#define CONFIG_DPX_DECODER 0
#define CONFIG_DSICINVIDEO_DECODER 0
#define CONFIG_DVVIDEO_DECODER 0
#define CONFIG_DXA_DECODER 0
#define CONFIG_DXTORY_DECODER 0
#define CONFIG_DXV_DECODER 0
#define CONFIG_EACMV_DECODER 0
#define CONFIG_EAMAD_DECODER 0
#define CONFIG_EATGQ_DECODER 0
#define CONFIG_EATGV_DECODER 0
#define CONFIG_EATQI_DECODER 0
#define CONFIG_EIGHTBPS_DECODER 0
#define CONFIG_EIGHTSVX_EXP_DECODER 0
#define CONFIG_EIGHTSVX_FIB_DECODER 0
#define CONFIG_ESCAPE124_DECODER 0
#define CONFIG_ESCAPE130_DECODER 0
#define CONFIG_EXR_DECODER 0
#define CONFIG_FFV1_DECODER 0
#define CONFIG_FFVHUFF_DECODER 0
#define CONFIG_FIC_DECODER 0
#define CONFIG_FLASHSV_DECODER 0
#define CONFIG_FLASHSV2_DECODER 0
#define CONFIG_FLIC_DECODER 0
#define CONFIG_FLV_DECODER 0
#define CONFIG_FOURXM_DECODER 0
#define CONFIG_FRAPS_DECODER 0
#define CONFIG_FRWU_DECODER 0
#define CONFIG_G2M_DECODER 0
#define CONFIG_GIF_DECODER 0
#define CONFIG_H261_DECODER 0
#define CONFIG_H263_DECODER 0
#define CONFIG_H263I_DECODER 0
#define CONFIG_H263P_DECODER 0
#define CONFIG_H264_DECODER 1
#define CONFIG_H264_CRYSTALHD_DECODER 0
#define CONFIG_H264_MMAL_DECODER 0
#define CONFIG_H264_QSV_DECODER 0
#define CONFIG_H264_VDA_DECODER 0
#define CONFIG_H264_VDPAU_DECODER 0
#define CONFIG_HAP_DECODER 0
#define CONFIG_HEVC_DECODER 0
#define CONFIG_HEVC_QSV_DECODER 0
#define CONFIG_HNM4_VIDEO_DECODER 0
#define CONFIG_HQ_HQA_DECODER 0
#define CONFIG_HQX_DECODER 0
#define CONFIG_HUFFYUV_DECODER 0
#define CONFIG_IDCIN_DECODER 0
#define CONFIG_IFF_ILBM_DECODER 0
#define CONFIG_INDEO2_DECODER 0
#define CONFIG_INDEO3_DECODER 0
#define CONFIG_INDEO4_DECODER 0
#define CONFIG_INDEO5_DECODER 0
#define CONFIG_INTERPLAY_VIDEO_DECODER 0
#define CONFIG_JPEG2000_DECODER 0
#define CONFIG_JPEGLS_DECODER 0
#define CONFIG_JV_DECODER 0
#define CONFIG_KGV1_DECODER 0
#define CONFIG_KMVC_DECODER 0
#define CONFIG_LAGARITH_DECODER 0
#define CONFIG_LOCO_DECODER 0
#define CONFIG_MDEC_DECODER 0
#define CONFIG_MIMIC_DECODER 0
#define CONFIG_MJPEG_DECODER 0
#define CONFIG_MJPEGB_DECODER 0
#define CONFIG_MMVIDEO_DECODER 0
#define CONFIG_MOTIONPIXELS_DECODER 0
#define CONFIG_MPEG_XVMC_DECODER 0
#define CONFIG_MPEG1VIDEO_DECODER 0
#define CONFIG_MPEG2VIDEO_DECODER 0
#define CONFIG_MPEG4_DECODER 0
#define CONFIG_MPEG4_CRYSTALHD_DECODER 0
#define CONFIG_MPEG4_VDPAU_DECODER 0
#define CONFIG_MPEGVIDEO_DECODER 0
#define CONFIG_MPEG_VDPAU_DECODER 0
#define CONFIG_MPEG1_VDPAU_DECODER 0
#define CONFIG_MPEG2_MMAL_DECODER 0
#define CONFIG_MPEG2_CRYSTALHD_DECODER 0
#define CONFIG_MPEG2_QSV_DECODER 0
#define CONFIG_MSA1_DECODER 0
#define CONFIG_MSMPEG4_CRYSTALHD_DECODER 0
#define CONFIG_MSMPEG4V1_DECODER 0
#define CONFIG_MSMPEG4V2_DECODER 0
#define CONFIG_MSMPEG4V3_DECODER 0
#define CONFIG_MSRLE_DECODER 0
#define CONFIG_MSS1_DECODER 0
#define CONFIG_MSS2_DECODER 0
#define CONFIG_MSVIDEO1_DECODER 0
#define CONFIG_MSZH_DECODER 0
#define CONFIG_MTS2_DECODER 0
#define CONFIG_MVC1_DECODER 0
#define CONFIG_MVC2_DECODER 0
#define CONFIG_MXPEG_DECODER 0
#define CONFIG_NUV_DECODER 0
#define CONFIG_PAF_VIDEO_DECODER 0
#define CONFIG_PAM_DECODER 0
#define CONFIG_PBM_DECODER 0
#define CONFIG_PCX_DECODER 0
#define CONFIG_PGM_DECODER 0
#define CONFIG_PGMYUV_DECODER 0
#define CONFIG_PICTOR_DECODER 0
#define CONFIG_PNG_DECODER 0
#define CONFIG_PPM_DECODER 0
#define CONFIG_PRORES_DECODER 0
#define CONFIG_PRORES_LGPL_DECODER 0
#define CONFIG_PTX_DECODER 0
#define CONFIG_QDRAW_DECODER 0
#define CONFIG_QPEG_DECODER 0
#define CONFIG_QTRLE_DECODER 0
#define CONFIG_R10K_DECODER 0
#define CONFIG_R210_DECODER 0
#define CONFIG_RAWVIDEO_DECODER 0
#define CONFIG_RL2_DECODER 0
#define CONFIG_ROQ_DECODER 0
#define CONFIG_RPZA_DECODER 0
#define CONFIG_RSCC_DECODER 0
#define CONFIG_RV10_DECODER 0
#define CONFIG_RV20_DECODER 0
#define CONFIG_RV30_DECODER 0
#define CONFIG_RV40_DECODER 0
#define CONFIG_S302M_DECODER 0
#define CONFIG_SANM_DECODER 0
#define CONFIG_SCREENPRESSO_DECODER 0
#define CONFIG_SDX2_DPCM_DECODER 0
#define CONFIG_SGI_DECODER 0
#define CONFIG_SGIRLE_DECODER 0
#define CONFIG_SMACKER_DECODER 0
#define CONFIG_SMC_DECODER 0
#define CONFIG_SMVJPEG_DECODER 0
#define CONFIG_SNOW_DECODER 0
#define CONFIG_SP5X_DECODER 0
#define CONFIG_SUNRAST_DECODER 0
#define CONFIG_SVQ1_DECODER 0
#define CONFIG_SVQ3_DECODER 0
#define CONFIG_TARGA_DECODER 0
#define CONFIG_TARGA_Y216_DECODER 0
#define CONFIG_TDSC_DECODER 0
#define CONFIG_THEORA_DECODER 1
#define CONFIG_THP_DECODER 0
#define CONFIG_TIERTEXSEQVIDEO_DECODER 0
#define CONFIG_TIFF_DECODER 0
#define CONFIG_TMV_DECODER 0
#define CONFIG_TRUEMOTION1_DECODER 0
#define CONFIG_TRUEMOTION2_DECODER 0
#define CONFIG_TSCC_DECODER 0
#define CONFIG_TSCC2_DECODER 0
#define CONFIG_TXD_DECODER 0
#define CONFIG_ULTI_DECODER 0
#define CONFIG_UTVIDEO_DECODER 0
#define CONFIG_V210_DECODER 0
#define CONFIG_V210X_DECODER 0
#define CONFIG_V308_DECODER 0
#define CONFIG_V408_DECODER 0
#define CONFIG_V410_DECODER 0
#define CONFIG_VB_DECODER 0
#define CONFIG_VBLE_DECODER 0
#define CONFIG_VC1_DECODER 0
#define CONFIG_VC1_CRYSTALHD_DECODER 0
#define CONFIG_VC1_VDPAU_DECODER 0
#define CONFIG_VC1IMAGE_DECODER 0
#define CONFIG_VC1_MMAL_DECODER 0
#define CONFIG_VC1_QSV_DECODER 0
#define CONFIG_VCR1_DECODER 0
#define CONFIG_VMDVIDEO_DECODER 0
#define CONFIG_VMNC_DECODER 0
#define CONFIG_VP3_DECODER 1
#define CONFIG_VP5_DECODER 0
#define CONFIG_VP6_DECODER 0
#define CONFIG_VP6A_DECODER 0
#define CONFIG_VP6F_DECODER 0
#define CONFIG_VP7_DECODER 0
#define CONFIG_VP8_DECODER 1
#define CONFIG_VP9_DECODER 0
#define CONFIG_VQA_DECODER 0
#define CONFIG_WEBP_DECODER 0
#define CONFIG_WMV1_DECODER 0
#define CONFIG_WMV2_DECODER 0
#define CONFIG_WMV3_DECODER 0
#define CONFIG_WMV3_CRYSTALHD_DECODER 0
#define CONFIG_WMV3_VDPAU_DECODER 0
#define CONFIG_WMV3IMAGE_DECODER 0
#define CONFIG_WNV1_DECODER 0
#define CONFIG_XAN_WC3_DECODER 0
#define CONFIG_XAN_WC4_DECODER 0
#define CONFIG_XBM_DECODER 0
#define CONFIG_XFACE_DECODER 0
#define CONFIG_XL_DECODER 0
#define CONFIG_XWD_DECODER 0
#define CONFIG_Y41P_DECODER 0
#define CONFIG_YOP_DECODER 0
#define CONFIG_YUV4_DECODER 0
#define CONFIG_ZERO12V_DECODER 0
#define CONFIG_ZEROCODEC_DECODER 0
#define CONFIG_ZLIB_DECODER 0
#define CONFIG_ZMBV_DECODER 0
#define CONFIG_AAC_DECODER 1
#define CONFIG_AAC_FIXED_DECODER 0
#define CONFIG_AAC_LATM_DECODER 0
#define CONFIG_AC3_DECODER 0
#define CONFIG_AC3_FIXED_DECODER 0
#define CONFIG_ALAC_DECODER 0
#define CONFIG_ALS_DECODER 0
#define CONFIG_AMRNB_DECODER 0
#define CONFIG_AMRWB_DECODER 0
#define CONFIG_APE_DECODER 0
#define CONFIG_ATRAC1_DECODER 0
#define CONFIG_ATRAC3_DECODER 0
#define CONFIG_ATRAC3P_DECODER 0
#define CONFIG_BINKAUDIO_DCT_DECODER 0
#define CONFIG_BINKAUDIO_RDFT_DECODER 0
#define CONFIG_BMV_AUDIO_DECODER 0
#define CONFIG_COOK_DECODER 0
#define CONFIG_DCA_DECODER 0
#define CONFIG_DSD_LSBF_DECODER 0
#define CONFIG_DSD_MSBF_DECODER 0
#define CONFIG_DSD_LSBF_PLANAR_DECODER 0
#define CONFIG_DSD_MSBF_PLANAR_DECODER 0
#define CONFIG_DSICINAUDIO_DECODER 0
#define CONFIG_DSS_SP_DECODER 0
#define CONFIG_EAC3_DECODER 0
#define CONFIG_EVRC_DECODER 0
#define CONFIG_FFWAVESYNTH_DECODER 0
#define CONFIG_FLAC_DECODER 0
#define CONFIG_G723_1_DECODER 0
#define CONFIG_G729_DECODER 0
#define CONFIG_GSM_DECODER 0
#define CONFIG_GSM_MS_DECODER 0
#define CONFIG_IAC_DECODER 0
#define CONFIG_IMC_DECODER 0
#define CONFIG_INTERPLAY_ACM_DECODER 0
#define CONFIG_MACE3_DECODER 0
#define CONFIG_MACE6_DECODER 0
#define CONFIG_METASOUND_DECODER 0
#define CONFIG_MLP_DECODER 0
#define CONFIG_MP1_DECODER 0
#define CONFIG_MP1FLOAT_DECODER 0
#define CONFIG_MP2_DECODER 0
#define CONFIG_MP2FLOAT_DECODER 0
#define CONFIG_MP3_DECODER 1
#define CONFIG_MP3FLOAT_DECODER 0
#define CONFIG_MP3ADU_DECODER 0
#define CONFIG_MP3ADUFLOAT_DECODER 0
#define CONFIG_MP3ON4_DECODER 0
#define CONFIG_MP3ON4FLOAT_DECODER 0
#define CONFIG_MPC7_DECODER 0
#define CONFIG_MPC8_DECODER 0
#define CONFIG_NELLYMOSER_DECODER 0
#define CONFIG_ON2AVC_DECODER 0
#define CONFIG_OPUS_DECODER 0
#define CONFIG_PAF_AUDIO_DECODER 0
#define CONFIG_QCELP_DECODER 0
#define CONFIG_QDM2_DECODER 0
#define CONFIG_RA_144_DECODER 0
#define CONFIG_RA_288_DECODER 0
#define CONFIG_RALF_DECODER 0
#define CONFIG_SHORTEN_DECODER 0
#define CONFIG_SIPR_DECODER 0
#define CONFIG_SMACKAUD_DECODER 0
#define CONFIG_SONIC_DECODER 0
#define CONFIG_TAK_DECODER 0
#define CONFIG_TRUEHD_DECODER 0
#define CONFIG_TRUESPEECH_DECODER 0
#define CONFIG_TTA_DECODER 0
#define CONFIG_TWINVQ_DECODER 0
#define CONFIG_VMDAUDIO_DECODER 0
#define CONFIG_VORBIS_DECODER 1
#define CONFIG_WAVPACK_DECODER 0
#define CONFIG_WMALOSSLESS_DECODER 0
#define CONFIG_WMAPRO_DECODER 0
#define CONFIG_WMAV1_DECODER 0
#define CONFIG_WMAV2_DECODER 0
#define CONFIG_WMAVOICE_DECODER 0
#define CONFIG_WS_SND1_DECODER 0
#define CONFIG_XMA1_DECODER 0
#define CONFIG_XMA2_DECODER 0
#define CONFIG_PCM_ALAW_DECODER 1
#define CONFIG_PCM_BLURAY_DECODER 0
#define CONFIG_PCM_DVD_DECODER 0
#define CONFIG_PCM_F32BE_DECODER 0
#define CONFIG_PCM_F32LE_DECODER 1
#define CONFIG_PCM_F64BE_DECODER 0
#define CONFIG_PCM_F64LE_DECODER 0
#define CONFIG_PCM_LXF_DECODER 0
#define CONFIG_PCM_MULAW_DECODER 1
#define CONFIG_PCM_S8_DECODER 0
#define CONFIG_PCM_S8_PLANAR_DECODER 0
#define CONFIG_PCM_S16BE_DECODER 1
#define CONFIG_PCM_S16BE_PLANAR_DECODER 0
#define CONFIG_PCM_S16LE_DECODER 1
#define CONFIG_PCM_S16LE_PLANAR_DECODER 0
#define CONFIG_PCM_S24BE_DECODER 1
#define CONFIG_PCM_S24DAUD_DECODER 0
#define CONFIG_PCM_S24LE_DECODER 1
#define CONFIG_PCM_S24LE_PLANAR_DECODER 0
#define CONFIG_PCM_S32BE_DECODER 0
#define CONFIG_PCM_S32LE_DECODER 1
#define CONFIG_PCM_S32LE_PLANAR_DECODER 0
#define CONFIG_PCM_U8_DECODER 1
#define CONFIG_PCM_U16BE_DECODER 0
#define CONFIG_PCM_U16LE_DECODER 0
#define CONFIG_PCM_U24BE_DECODER 0
#define CONFIG_PCM_U24LE_DECODER 0
#define CONFIG_PCM_U32BE_DECODER 0
#define CONFIG_PCM_U32LE_DECODER 0
#define CONFIG_PCM_ZORK_DECODER 0
#define CONFIG_INTERPLAY_DPCM_DECODER 0
#define CONFIG_ROQ_DPCM_DECODER 0
#define CONFIG_SOL_DPCM_DECODER 0
#define CONFIG_XAN_DPCM_DECODER 0
#define CONFIG_ADPCM_4XM_DECODER 0
#define CONFIG_ADPCM_ADX_DECODER 0
#define CONFIG_ADPCM_AFC_DECODER 0
#define CONFIG_ADPCM_AICA_DECODER 0
#define CONFIG_ADPCM_CT_DECODER 0
#define CONFIG_ADPCM_DTK_DECODER 0
#define CONFIG_ADPCM_EA_DECODER 0
#define CONFIG_ADPCM_EA_MAXIS_XA_DECODER 0
#define CONFIG_ADPCM_EA_R1_DECODER 0
#define CONFIG_ADPCM_EA_R2_DECODER 0
#define CONFIG_ADPCM_EA_R3_DECODER 0
#define CONFIG_ADPCM_EA_XAS_DECODER 0
#define CONFIG_ADPCM_G722_DECODER 0
#define CONFIG_ADPCM_G726_DECODER 0
#define CONFIG_ADPCM_G726LE_DECODER 0
#define CONFIG_ADPCM_IMA_AMV_DECODER 0
#define CONFIG_ADPCM_IMA_APC_DECODER 0
#define CONFIG_ADPCM_IMA_DK3_DECODER 0
#define CONFIG_ADPCM_IMA_DK4_DECODER 0
#define CONFIG_ADPCM_IMA_EA_EACS_DECODER 0
#define CONFIG_ADPCM_IMA_EA_SEAD_DECODER 0
#define CONFIG_ADPCM_IMA_ISS_DECODER 0
#define CONFIG_ADPCM_IMA_OKI_DECODER 0
#define CONFIG_ADPCM_IMA_QT_DECODER 0
#define CONFIG_ADPCM_IMA_RAD_DECODER 0
#define CONFIG_ADPCM_IMA_SMJPEG_DECODER 0
#define CONFIG_ADPCM_IMA_WAV_DECODER 0
#define CONFIG_ADPCM_IMA_WS_DECODER 0
#define CONFIG_ADPCM_MS_DECODER 0
#define CONFIG_ADPCM_PSX_DECODER 0
#define CONFIG_ADPCM_SBPRO_2_DECODER 0
#define CONFIG_ADPCM_SBPRO_3_DECODER 0
#define CONFIG_ADPCM_SBPRO_4_DECODER 0
#define CONFIG_ADPCM_SWF_DECODER 0
#define CONFIG_ADPCM_THP_DECODER 0
#define CONFIG_ADPCM_THP_LE_DECODER 0
#define CONFIG_ADPCM_VIMA_DECODER 0
#define CONFIG_ADPCM_XA_DECODER 0
#define CONFIG_ADPCM_YAMAHA_DECODER 0
#define CONFIG_SSA_DECODER 0
#define CONFIG_ASS_DECODER 0
#define CONFIG_CCAPTION_DECODER 0
#define CONFIG_DVBSUB_DECODER 0
#define CONFIG_DVDSUB_DECODER 0
#define CONFIG_JACOSUB_DECODER 0
#define CONFIG_MICRODVD_DECODER 0
#define CONFIG_MOVTEXT_DECODER 0
#define CONFIG_MPL2_DECODER 0
#define CONFIG_PGSSUB_DECODER 0
#define CONFIG_PJS_DECODER 0
#define CONFIG_REALTEXT_DECODER 0
#define CONFIG_SAMI_DECODER 0
#define CONFIG_SRT_DECODER 0
#define CONFIG_STL_DECODER 0
#define CONFIG_SUBRIP_DECODER 0
#define CONFIG_SUBVIEWER_DECODER 0
#define CONFIG_SUBVIEWER1_DECODER 0
#define CONFIG_TEXT_DECODER 0
#define CONFIG_VPLAYER_DECODER 0
#define CONFIG_WEBVTT_DECODER 0
#define CONFIG_XSUB_DECODER 0
#define CONFIG_LIBCELT_DECODER 0
#define CONFIG_LIBDCADEC_DECODER 0
#define CONFIG_LIBFDK_AAC_DECODER 0
#define CONFIG_LIBGSM_DECODER 0
#define CONFIG_LIBGSM_MS_DECODER 0
#define CONFIG_LIBILBC_DECODER 0
#define CONFIG_LIBOPENCORE_AMRNB_DECODER 0
#define CONFIG_LIBOPENCORE_AMRWB_DECODER 0
#define CONFIG_LIBOPENJPEG_DECODER 0
#define CONFIG_LIBOPUS_DECODER 0
#define CONFIG_LIBSCHROEDINGER_DECODER 0
#define CONFIG_LIBSPEEX_DECODER 0
#define CONFIG_LIBUTVIDEO_DECODER 0
#define CONFIG_LIBVORBIS_DECODER 0
#define CONFIG_LIBVPX_VP8_DECODER 0
#define CONFIG_LIBVPX_VP9_DECODER 0
#define CONFIG_LIBZVBI_TELETEXT_DECODER 0
#define CONFIG_BINTEXT_DECODER 0
#define CONFIG_XBIN_DECODER 0
#define CONFIG_IDF_DECODER 0
#define CONFIG_AA_DEMUXER 0
#define CONFIG_AAC_DEMUXER 1
#define CONFIG_AC3_DEMUXER 0
#define CONFIG_ACM_DEMUXER 0
#define CONFIG_ACT_DEMUXER 0
#define CONFIG_ADF_DEMUXER 0
#define CONFIG_ADP_DEMUXER 0
#define CONFIG_ADS_DEMUXER 0
#define CONFIG_ADX_DEMUXER 0
#define CONFIG_AEA_DEMUXER 0
#define CONFIG_AFC_DEMUXER 0
#define CONFIG_AIFF_DEMUXER 0
#define CONFIG_AMR_DEMUXER 0
#define CONFIG_ANM_DEMUXER 0
#define CONFIG_APC_DEMUXER 0
#define CONFIG_APE_DEMUXER 0
#define CONFIG_APNG_DEMUXER 0
#define CONFIG_AQTITLE_DEMUXER 0
#define CONFIG_ASF_DEMUXER 0
#define CONFIG_ASF_O_DEMUXER 0
#define CONFIG_ASS_DEMUXER 0
#define CONFIG_AST_DEMUXER 0
#define CONFIG_AU_DEMUXER 0
#define CONFIG_AVI_DEMUXER 0
#define CONFIG_AVISYNTH_DEMUXER 0
#define CONFIG_AVR_DEMUXER 0
#define CONFIG_AVS_DEMUXER 0
#define CONFIG_BETHSOFTVID_DEMUXER 0
#define CONFIG_BFI_DEMUXER 0
#define CONFIG_BINTEXT_DEMUXER 0
#define CONFIG_BINK_DEMUXER 0
#define CONFIG_BIT_DEMUXER 0
#define CONFIG_BMV_DEMUXER 0
#define CONFIG_BFSTM_DEMUXER 0
#define CONFIG_BRSTM_DEMUXER 0
#define CONFIG_BOA_DEMUXER 0
#define CONFIG_C93_DEMUXER 0
#define CONFIG_CAF_DEMUXER 0
#define CONFIG_CAVSVIDEO_DEMUXER 0
#define CONFIG_CDG_DEMUXER 0
#define CONFIG_CDXL_DEMUXER 0
#define CONFIG_CINE_DEMUXER 0
#define CONFIG_CONCAT_DEMUXER 0
#define CONFIG_DATA_DEMUXER 0
#define CONFIG_DAUD_DEMUXER 0
#define CONFIG_DCSTR_DEMUXER 0
#define CONFIG_DFA_DEMUXER 0
#define CONFIG_DIRAC_DEMUXER 0
#define CONFIG_DNXHD_DEMUXER 0
#define CONFIG_DSF_DEMUXER 0
#define CONFIG_DSICIN_DEMUXER 0
#define CONFIG_DSS_DEMUXER 0
#define CONFIG_DTS_DEMUXER 0
#define CONFIG_DTSHD_DEMUXER 0
#define CONFIG_DV_DEMUXER 0
#define CONFIG_DVBSUB_DEMUXER 0
#define CONFIG_DXA_DEMUXER 0
#define CONFIG_EA_DEMUXER 0
#define CONFIG_EA_CDATA_DEMUXER 0
#define CONFIG_EAC3_DEMUXER 0
#define CONFIG_EPAF_DEMUXER 0
#define CONFIG_FFM_DEMUXER 0
#define CONFIG_FFMETADATA_DEMUXER 0
#define CONFIG_FILMSTRIP_DEMUXER 0
#define CONFIG_FLAC_DEMUXER 0
#define CONFIG_FLIC_DEMUXER 0
#define CONFIG_FLV_DEMUXER 0
#define CONFIG_LIVE_FLV_DEMUXER 0
#define CONFIG_FOURXM_DEMUXER 0
#define CONFIG_FRM_DEMUXER 0
#define CONFIG_FSB_DEMUXER 0
#define CONFIG_G722_DEMUXER 0
#define CONFIG_G723_1_DEMUXER 0
#define CONFIG_G729_DEMUXER 0
#define CONFIG_GENH_DEMUXER 0
#define CONFIG_GIF_DEMUXER 0
#define CONFIG_GSM_DEMUXER 0
#define CONFIG_GXF_DEMUXER 0
#define CONFIG_H261_DEMUXER 0
#define CONFIG_H263_DEMUXER 0
#define CONFIG_H264_DEMUXER 0
#define CONFIG_HEVC_DEMUXER 0
#define CONFIG_HLS_DEMUXER 0
#define CONFIG_HNM_DEMUXER 0
#define CONFIG_ICO_DEMUXER 0
#define CONFIG_IDCIN_DEMUXER 0
#define CONFIG_IDF_DEMUXER 0
#define CONFIG_IFF_DEMUXER 0
#define CONFIG_ILBC_DEMUXER 0
#define CONFIG_IMAGE2_DEMUXER 0
#define CONFIG_IMAGE2PIPE_DEMUXER 0
#define CONFIG_IMAGE2_ALIAS_PIX_DEMUXER 0
#define CONFIG_IMAGE2_BRENDER_PIX_DEMUXER 0
#define CONFIG_INGENIENT_DEMUXER 0
#define CONFIG_IPMOVIE_DEMUXER 0
#define CONFIG_IRCAM_DEMUXER 0
#define CONFIG_ISS_DEMUXER 0
#define CONFIG_IV8_DEMUXER 0
#define CONFIG_IVF_DEMUXER 0
#define CONFIG_IVR_DEMUXER 0
#define CONFIG_JACOSUB_DEMUXER 0
#define CONFIG_JV_DEMUXER 0
#define CONFIG_LMLM4_DEMUXER 0
#define CONFIG_LOAS_DEMUXER 0
#define CONFIG_LRC_DEMUXER 0
#define CONFIG_LVF_DEMUXER 0
#define CONFIG_LXF_DEMUXER 0
#define CONFIG_M4V_DEMUXER 0
#define CONFIG_MATROSKA_DEMUXER 1
#define CONFIG_MGSTS_DEMUXER 0
#define CONFIG_MICRODVD_DEMUXER 0
#define CONFIG_MJPEG_DEMUXER 0
#define CONFIG_MLP_DEMUXER 0
#define CONFIG_MLV_DEMUXER 0
#define CONFIG_MM_DEMUXER 0
#define CONFIG_MMF_DEMUXER 0
#define CONFIG_MOV_DEMUXER 1
#define CONFIG_MP3_DEMUXER 1
#define CONFIG_MPC_DEMUXER 0
#define CONFIG_MPC8_DEMUXER 0
#define CONFIG_MPEGPS_DEMUXER 0
#define CONFIG_MPEGTS_DEMUXER 0
#define CONFIG_MPEGTSRAW_DEMUXER 0
#define CONFIG_MPEGVIDEO_DEMUXER 0
#define CONFIG_MPJPEG_DEMUXER 0
#define CONFIG_MPL2_DEMUXER 0
#define CONFIG_MPSUB_DEMUXER 0
#define CONFIG_MSF_DEMUXER 0
#define CONFIG_MSNWC_TCP_DEMUXER 0
#define CONFIG_MTV_DEMUXER 0
#define CONFIG_MV_DEMUXER 0
#define CONFIG_MVI_DEMUXER 0
#define CONFIG_MXF_DEMUXER 0
#define CONFIG_MXG_DEMUXER 0
#define CONFIG_NC_DEMUXER 0
#define CONFIG_NISTSPHERE_DEMUXER 0
#define CONFIG_NSV_DEMUXER 0
#define CONFIG_NUT_DEMUXER 0
#define CONFIG_NUV_DEMUXER 0
#define CONFIG_OGG_DEMUXER 1
#define CONFIG_OMA_DEMUXER 0
#define CONFIG_PAF_DEMUXER 0
#define CONFIG_PCM_ALAW_DEMUXER 0
#define CONFIG_PCM_MULAW_DEMUXER 0
#define CONFIG_PCM_F64BE_DEMUXER 0
#define CONFIG_PCM_F64LE_DEMUXER 0
#define CONFIG_PCM_F32BE_DEMUXER 0
#define CONFIG_PCM_F32LE_DEMUXER 0
#define CONFIG_PCM_S32BE_DEMUXER 0
#define CONFIG_PCM_S32LE_DEMUXER 0
#define CONFIG_PCM_S24BE_DEMUXER 0
#define CONFIG_PCM_S24LE_DEMUXER 0
#define CONFIG_PCM_S16BE_DEMUXER 0
#define CONFIG_PCM_S16LE_DEMUXER 0
#define CONFIG_PCM_S8_DEMUXER 0
#define CONFIG_PCM_U32BE_DEMUXER 0
#define CONFIG_PCM_U32LE_DEMUXER 0
#define CONFIG_PCM_U24BE_DEMUXER 0
#define CONFIG_PCM_U24LE_DEMUXER 0
#define CONFIG_PCM_U16BE_DEMUXER 0
#define CONFIG_PCM_U16LE_DEMUXER 0
#define CONFIG_PCM_U8_DEMUXER 0
#define CONFIG_PJS_DEMUXER 0
#define CONFIG_PMP_DEMUXER 0
#define CONFIG_PVA_DEMUXER 0
#define CONFIG_PVF_DEMUXER 0
#define CONFIG_QCP_DEMUXER 0
#define CONFIG_R3D_DEMUXER 0
#define CONFIG_RAWVIDEO_DEMUXER 0
#define CONFIG_REALTEXT_DEMUXER 0
#define CONFIG_REDSPARK_DEMUXER 0
#define CONFIG_RL2_DEMUXER 0
#define CONFIG_RM_DEMUXER 0
#define CONFIG_ROQ_DEMUXER 0
#define CONFIG_RPL_DEMUXER 0
#define CONFIG_RSD_DEMUXER 0
#define CONFIG_RSO_DEMUXER 0
#define CONFIG_RTP_DEMUXER 0
#define CONFIG_RTSP_DEMUXER 0
#define CONFIG_SAMI_DEMUXER 0
#define CONFIG_SAP_DEMUXER 0
#define CONFIG_SBG_DEMUXER 0
#define CONFIG_SDP_DEMUXER 0
#define CONFIG_SDR2_DEMUXER 0
#define CONFIG_SEGAFILM_DEMUXER 0
#define CONFIG_SHORTEN_DEMUXER 0
#define CONFIG_SIFF_DEMUXER 0
#define CONFIG_SLN_DEMUXER 0
#define CONFIG_SMACKER_DEMUXER 0
#define CONFIG_SMJPEG_DEMUXER 0
#define CONFIG_SMUSH_DEMUXER 0
#define CONFIG_SOL_DEMUXER 0
#define CONFIG_SOX_DEMUXER 0
#define CONFIG_SPDIF_DEMUXER 0
#define CONFIG_SRT_DEMUXER 0
#define CONFIG_STR_DEMUXER 0
#define CONFIG_STL_DEMUXER 0
#define CONFIG_SUBVIEWER1_DEMUXER 0
#define CONFIG_SUBVIEWER_DEMUXER 0
#define CONFIG_SUP_DEMUXER 0
#define CONFIG_SVAG_DEMUXER 0
#define CONFIG_SWF_DEMUXER 0
#define CONFIG_TAK_DEMUXER 0
#define CONFIG_TEDCAPTIONS_DEMUXER 0
#define CONFIG_THP_DEMUXER 0
#define CONFIG_THREEDOSTR_DEMUXER 0
#define CONFIG_TIERTEXSEQ_DEMUXER 0
#define CONFIG_TMV_DEMUXER 0
#define CONFIG_TRUEHD_DEMUXER 0
#define CONFIG_TTA_DEMUXER 0
#define CONFIG_TXD_DEMUXER 0
#define CONFIG_TTY_DEMUXER 0
#define CONFIG_V210_DEMUXER 0
#define CONFIG_V210X_DEMUXER 0
#define CONFIG_VAG_DEMUXER 0
#define CONFIG_VC1_DEMUXER 0
#define CONFIG_VC1T_DEMUXER 0
#define CONFIG_VIVO_DEMUXER 0
#define CONFIG_VMD_DEMUXER 0
#define CONFIG_VOBSUB_DEMUXER 0
#define CONFIG_VOC_DEMUXER 0
#define CONFIG_VPK_DEMUXER 0
#define CONFIG_VPLAYER_DEMUXER 0
#define CONFIG_VQF_DEMUXER 0
#define CONFIG_W64_DEMUXER 0
#define CONFIG_WAV_DEMUXER 1
#define CONFIG_WC3_DEMUXER 0
#define CONFIG_WEBM_DASH_MANIFEST_DEMUXER 0
#define CONFIG_WEBVTT_DEMUXER 0
#define CONFIG_WSAUD_DEMUXER 0
#define CONFIG_WSVQA_DEMUXER 0
#define CONFIG_WTV_DEMUXER 0
#define CONFIG_WVE_DEMUXER 0
#define CONFIG_WV_DEMUXER 0
#define CONFIG_XA_DEMUXER 0
#define CONFIG_XBIN_DEMUXER 0
#define CONFIG_XMV_DEMUXER 0
#define CONFIG_XVAG_DEMUXER 0
#define CONFIG_XWMA_DEMUXER 0
#define CONFIG_YOP_DEMUXER 0
#define CONFIG_YUV4MPEGPIPE_DEMUXER 0
#define CONFIG_IMAGE_BMP_PIPE_DEMUXER 0
#define CONFIG_IMAGE_DDS_PIPE_DEMUXER 0
#define CONFIG_IMAGE_DPX_PIPE_DEMUXER 0
#define CONFIG_IMAGE_EXR_PIPE_DEMUXER 0
#define CONFIG_IMAGE_J2K_PIPE_DEMUXER 0
#define CONFIG_IMAGE_JPEG_PIPE_DEMUXER 0
#define CONFIG_IMAGE_JPEGLS_PIPE_DEMUXER 0
#define CONFIG_IMAGE_PICTOR_PIPE_DEMUXER 0
#define CONFIG_IMAGE_PNG_PIPE_DEMUXER 0
#define CONFIG_IMAGE_QDRAW_PIPE_DEMUXER 0
#define CONFIG_IMAGE_SGI_PIPE_DEMUXER 0
#define CONFIG_IMAGE_SUNRAST_PIPE_DEMUXER 0
#define CONFIG_IMAGE_TIFF_PIPE_DEMUXER 0
#define CONFIG_IMAGE_WEBP_PIPE_DEMUXER 0
#define CONFIG_LIBGME_DEMUXER 0
#define CONFIG_LIBMODPLUG_DEMUXER 0
#define CONFIG_LIBNUT_DEMUXER 0
#define CONFIG_LIBQUVI_DEMUXER 0
#define CONFIG_A64MULTI_ENCODER 0
#define CONFIG_A64MULTI5_ENCODER 0
#define CONFIG_ALIAS_PIX_ENCODER 0
#define CONFIG_AMV_ENCODER 0
#define CONFIG_APNG_ENCODER 0
#define CONFIG_ASV1_ENCODER 0
#define CONFIG_ASV2_ENCODER 0
#define CONFIG_AVRP_ENCODER 0
#define CONFIG_AVUI_ENCODER 0
#define CONFIG_AYUV_ENCODER 0
#define CONFIG_BMP_ENCODER 0
#define CONFIG_CINEPAK_ENCODER 0
#define CONFIG_CLJR_ENCODER 0
#define CONFIG_COMFORTNOISE_ENCODER 0
#define CONFIG_DNXHD_ENCODER 0
#define CONFIG_DPX_ENCODER 0
#define CONFIG_DVVIDEO_ENCODER 0
#define CONFIG_FFV1_ENCODER 0
#define CONFIG_FFVHUFF_ENCODER 0
#define CONFIG_FLASHSV_ENCODER 0
#define CONFIG_FLASHSV2_ENCODER 0
#define CONFIG_FLV_ENCODER 0
#define CONFIG_GIF_ENCODER 0
#define CONFIG_H261_ENCODER 0
#define CONFIG_H263_ENCODER 0
#define CONFIG_H263P_ENCODER 0
#define CONFIG_HAP_ENCODER 0
#define CONFIG_HUFFYUV_ENCODER 0
#define CONFIG_JPEG2000_ENCODER 0
#define CONFIG_JPEGLS_ENCODER 0
#define CONFIG_LJPEG_ENCODER 0
#define CONFIG_MJPEG_ENCODER 0
#define CONFIG_MPEG1VIDEO_ENCODER 0
#define CONFIG_MPEG2VIDEO_ENCODER 0
#define CONFIG_MPEG4_ENCODER 0
#define CONFIG_MSMPEG4V2_ENCODER 0
#define CONFIG_MSMPEG4V3_ENCODER 0
#define CONFIG_MSVIDEO1_ENCODER 0
#define CONFIG_PAM_ENCODER 0
#define CONFIG_PBM_ENCODER 0
#define CONFIG_PCX_ENCODER 0
#define CONFIG_PGM_ENCODER 0
#define CONFIG_PGMYUV_ENCODER 0
#define CONFIG_PNG_ENCODER 0
#define CONFIG_PPM_ENCODER 0
#define CONFIG_PRORES_ENCODER 0
#define CONFIG_PRORES_AW_ENCODER 0
#define CONFIG_PRORES_KS_ENCODER 0
#define CONFIG_QTRLE_ENCODER 0
#define CONFIG_R10K_ENCODER 0
#define CONFIG_R210_ENCODER 0
#define CONFIG_RAWVIDEO_ENCODER 0
#define CONFIG_ROQ_ENCODER 0
#define CONFIG_RV10_ENCODER 0
#define CONFIG_RV20_ENCODER 0
#define CONFIG_S302M_ENCODER 0
#define CONFIG_SGI_ENCODER 0
#define CONFIG_SNOW_ENCODER 0
#define CONFIG_SUNRAST_ENCODER 0
#define CONFIG_SVQ1_ENCODER 0
#define CONFIG_TARGA_ENCODER 0
#define CONFIG_TIFF_ENCODER 0
#define CONFIG_UTVIDEO_ENCODER 0
#define CONFIG_V210_ENCODER 0
#define CONFIG_V308_ENCODER 0
#define CONFIG_V408_ENCODER 0
#define CONFIG_V410_ENCODER 0
#define CONFIG_WRAPPED_AVFRAME_ENCODER 0
#define CONFIG_WMV1_ENCODER 0
#define CONFIG_WMV2_ENCODER 0
#define CONFIG_XBM_ENCODER 0
#define CONFIG_XFACE_ENCODER 0
#define CONFIG_XWD_ENCODER 0
#define CONFIG_Y41P_ENCODER 0
#define CONFIG_YUV4_ENCODER 0
#define CONFIG_ZLIB_ENCODER 0
#define CONFIG_ZMBV_ENCODER 0
#define CONFIG_AAC_ENCODER 0
#define CONFIG_AC3_ENCODER 0
#define CONFIG_AC3_FIXED_ENCODER 0
#define CONFIG_ALAC_ENCODER 0
#define CONFIG_DCA_ENCODER 0
#define CONFIG_EAC3_ENCODER 0
#define CONFIG_FLAC_ENCODER 0
#define CONFIG_G723_1_ENCODER 0
#define CONFIG_MP2_ENCODER 0
#define CONFIG_MP2FIXED_ENCODER 0
#define CONFIG_NELLYMOSER_ENCODER 0
#define CONFIG_RA_144_ENCODER 0
#define CONFIG_SONIC_ENCODER 0
#define CONFIG_SONIC_LS_ENCODER 0
#define CONFIG_TTA_ENCODER 0
#define CONFIG_VORBIS_ENCODER 0
#define CONFIG_WAVPACK_ENCODER 0
#define CONFIG_WMAV1_ENCODER 0
#define CONFIG_WMAV2_ENCODER 0
#define CONFIG_PCM_ALAW_ENCODER 0
#define CONFIG_PCM_F32BE_ENCODER 0
#define CONFIG_PCM_F32LE_ENCODER 0
#define CONFIG_PCM_F64BE_ENCODER 0
#define CONFIG_PCM_F64LE_ENCODER 0
#define CONFIG_PCM_MULAW_ENCODER 0
#define CONFIG_PCM_S8_ENCODER 0
#define CONFIG_PCM_S8_PLANAR_ENCODER 0
#define CONFIG_PCM_S16BE_ENCODER 0
#define CONFIG_PCM_S16BE_PLANAR_ENCODER 0
#define CONFIG_PCM_S16LE_ENCODER 0
#define CONFIG_PCM_S16LE_PLANAR_ENCODER 0
#define CONFIG_PCM_S24BE_ENCODER 0
#define CONFIG_PCM_S24DAUD_ENCODER 0
#define CONFIG_PCM_S24LE_ENCODER 0
#define CONFIG_PCM_S24LE_PLANAR_ENCODER 0
#define CONFIG_PCM_S32BE_ENCODER 0
#define CONFIG_PCM_S32LE_ENCODER 0
#define CONFIG_PCM_S32LE_PLANAR_ENCODER 0
#define CONFIG_PCM_U8_ENCODER 0
#define CONFIG_PCM_U16BE_ENCODER 0
#define CONFIG_PCM_U16LE_ENCODER 0
#define CONFIG_PCM_U24BE_ENCODER 0
#define CONFIG_PCM_U24LE_ENCODER 0
#define CONFIG_PCM_U32BE_ENCODER 0
#define CONFIG_PCM_U32LE_ENCODER 0
#define CONFIG_ROQ_DPCM_ENCODER 0
#define CONFIG_ADPCM_ADX_ENCODER 0
#define CONFIG_ADPCM_G722_ENCODER 0
#define CONFIG_ADPCM_G726_ENCODER 0
#define CONFIG_ADPCM_IMA_QT_ENCODER 0
#define CONFIG_ADPCM_IMA_WAV_ENCODER 0
#define CONFIG_ADPCM_MS_ENCODER 0
#define CONFIG_ADPCM_SWF_ENCODER 0
#define CONFIG_ADPCM_YAMAHA_ENCODER 0
#define CONFIG_SSA_ENCODER 0
#define CONFIG_ASS_ENCODER 0
#define CONFIG_DVBSUB_ENCODER 0
#define CONFIG_DVDSUB_ENCODER 0
#define CONFIG_MOVTEXT_ENCODER 0
#define CONFIG_SRT_ENCODER 0
#define CONFIG_SUBRIP_ENCODER 0
#define CONFIG_TEXT_ENCODER 0
#define CONFIG_WEBVTT_ENCODER 0
#define CONFIG_XSUB_ENCODER 0
#define CONFIG_LIBFAAC_ENCODER 0
#define CONFIG_LIBFDK_AAC_ENCODER 0
#define CONFIG_LIBGSM_ENCODER 0
#define CONFIG_LIBGSM_MS_ENCODER 0
#define CONFIG_LIBILBC_ENCODER 0
#define CONFIG_LIBMP3LAME_ENCODER 0
#define CONFIG_LIBOPENCORE_AMRNB_ENCODER 0
#define CONFIG_LIBOPENJPEG_ENCODER 0
#define CONFIG_LIBOPUS_ENCODER 0
#define CONFIG_LIBSCHROEDINGER_ENCODER 0
#define CONFIG_LIBSHINE_ENCODER 0
#define CONFIG_LIBSPEEX_ENCODER 0
#define CONFIG_LIBTHEORA_ENCODER 0
#define CONFIG_LIBTWOLAME_ENCODER 0
#define CONFIG_LIBUTVIDEO_ENCODER 0
#define CONFIG_LIBVO_AACENC_ENCODER 0
#define CONFIG_LIBVO_AMRWBENC_ENCODER 0
#define CONFIG_LIBVORBIS_ENCODER 0
#define CONFIG_LIBVPX_VP8_ENCODER 0
#define CONFIG_LIBVPX_VP9_ENCODER 0
#define CONFIG_LIBWAVPACK_ENCODER 0
#define CONFIG_LIBWEBP_ANIM_ENCODER 0
#define CONFIG_LIBWEBP_ENCODER 0
#define CONFIG_LIBX262_ENCODER 0
#define CONFIG_LIBX264_ENCODER 0
#define CONFIG_LIBX264RGB_ENCODER 0
#define CONFIG_LIBX265_ENCODER 0
#define CONFIG_LIBXAVS_ENCODER 0
#define CONFIG_LIBXVID_ENCODER 0
#define CONFIG_LIBAACPLUS_ENCODER 0
#define CONFIG_LIBOPENH264_ENCODER 0
#define CONFIG_H264_QSV_ENCODER 0
#define CONFIG_NVENC_ENCODER 0
#define CONFIG_NVENC_H264_ENCODER 0
#define CONFIG_NVENC_HEVC_ENCODER 0
#define CONFIG_HEVC_QSV_ENCODER 0
#define CONFIG_LIBKVAZAAR_ENCODER 0
#define CONFIG_MPEG2_QSV_ENCODER 0
#define CONFIG_ACOMPRESSOR_FILTER 0
#define CONFIG_ACROSSFADE_FILTER 0
#define CONFIG_ADELAY_FILTER 0
#define CONFIG_AECHO_FILTER 0
#define CONFIG_AEMPHASIS_FILTER 0
#define CONFIG_AEVAL_FILTER 0
#define CONFIG_AFADE_FILTER 0
#define CONFIG_AFORMAT_FILTER 0
#define CONFIG_AGATE_FILTER 0
#define CONFIG_AINTERLEAVE_FILTER 0
#define CONFIG_ALIMITER_FILTER 0
#define CONFIG_ALLPASS_FILTER 0
#define CONFIG_AMERGE_FILTER 0
#define CONFIG_AMIX_FILTER 0
#define CONFIG_ANEQUALIZER_FILTER 0
#define CONFIG_ANULL_FILTER 0
#define CONFIG_APAD_FILTER 0
#define CONFIG_APERMS_FILTER 0
#define CONFIG_APHASER_FILTER 0
#define CONFIG_APULSATOR_FILTER 0
#define CONFIG_AREALTIME_FILTER 0
#define CONFIG_ARESAMPLE_FILTER 0
#define CONFIG_AREVERSE_FILTER 0
#define CONFIG_ASELECT_FILTER 0
#define CONFIG_ASENDCMD_FILTER 0
#define CONFIG_ASETNSAMPLES_FILTER 0
#define CONFIG_ASETPTS_FILTER 0
#define CONFIG_ASETRATE_FILTER 0
#define CONFIG_ASETTB_FILTER 0
#define CONFIG_ASHOWINFO_FILTER 0
#define CONFIG_ASPLIT_FILTER 0
#define CONFIG_ASTATS_FILTER 0
#define CONFIG_ASYNCTS_FILTER 0
#define CONFIG_ATEMPO_FILTER 0
#define CONFIG_ATRIM_FILTER 0
#define CONFIG_AZMQ_FILTER 0
#define CONFIG_BANDPASS_FILTER 0
#define CONFIG_BANDREJECT_FILTER 0
#define CONFIG_BASS_FILTER 0
#define CONFIG_BIQUAD_FILTER 0
#define CONFIG_BS2B_FILTER 0
#define CONFIG_CHANNELMAP_FILTER 0
#define CONFIG_CHANNELSPLIT_FILTER 0
#define CONFIG_CHORUS_FILTER 0
#define CONFIG_COMPAND_FILTER 0
#define CONFIG_COMPENSATIONDELAY_FILTER 0
#define CONFIG_DCSHIFT_FILTER 0
#define CONFIG_DYNAUDNORM_FILTER 0
#define CONFIG_EARWAX_FILTER 0
#define CONFIG_EBUR128_FILTER 0
#define CONFIG_EQUALIZER_FILTER 0
#define CONFIG_EXTRASTEREO_FILTER 0
#define CONFIG_FLANGER_FILTER 0
#define CONFIG_HIGHPASS_FILTER 0
#define CONFIG_JOIN_FILTER 0
#define CONFIG_LADSPA_FILTER 0
#define CONFIG_LOWPASS_FILTER 0
#define CONFIG_PAN_FILTER 0
#define CONFIG_REPLAYGAIN_FILTER 0
#define CONFIG_RESAMPLE_FILTER 0
#define CONFIG_RUBBERBAND_FILTER 0
#define CONFIG_SIDECHAINCOMPRESS_FILTER 0
#define CONFIG_SIDECHAINGATE_FILTER 0
#define CONFIG_SILENCEDETECT_FILTER 0
#define CONFIG_SILENCEREMOVE_FILTER 0
#define CONFIG_SOFALIZER_FILTER 0
#define CONFIG_STEREOTOOLS_FILTER 0
#define CONFIG_STEREOWIDEN_FILTER 0
#define CONFIG_TREBLE_FILTER 0
#define CONFIG_TREMOLO_FILTER 0
#define CONFIG_VIBRATO_FILTER 0
#define CONFIG_VOLUME_FILTER 0
#define CONFIG_VOLUMEDETECT_FILTER 0
#define CONFIG_AEVALSRC_FILTER 0
#define CONFIG_ANOISESRC_FILTER 0
#define CONFIG_ANULLSRC_FILTER 0
#define CONFIG_FLITE_FILTER 0
#define CONFIG_SINE_FILTER 0
#define CONFIG_ANULLSINK_FILTER 0
#define CONFIG_ALPHAEXTRACT_FILTER 0
#define CONFIG_ALPHAMERGE_FILTER 0
#define CONFIG_ATADENOISE_FILTER 0
#define CONFIG_ASS_FILTER 0
#define CONFIG_BBOX_FILTER 0
#define CONFIG_BLACKDETECT_FILTER 0
#define CONFIG_BLACKFRAME_FILTER 0
#define CONFIG_BLEND_FILTER 0
#define CONFIG_BOXBLUR_FILTER 0
#define CONFIG_CHROMAKEY_FILTER 0
#define CONFIG_CODECVIEW_FILTER 0
#define CONFIG_COLORBALANCE_FILTER 0
#define CONFIG_COLORCHANNELMIXER_FILTER 0
#define CONFIG_COLORKEY_FILTER 0
#define CONFIG_COLORLEVELS_FILTER 0
#define CONFIG_COLORMATRIX_FILTER 0
#define CONFIG_COPY_FILTER 0
#define CONFIG_COVER_RECT_FILTER 0
#define CONFIG_CROP_FILTER 0
#define CONFIG_CROPDETECT_FILTER 0
#define CONFIG_CURVES_FILTER 0
#define CONFIG_DCTDNOIZ_FILTER 0
#define CONFIG_DEBAND_FILTER 0
#define CONFIG_DECIMATE_FILTER 0
#define CONFIG_DEFLATE_FILTER 0
#define CONFIG_DEJUDDER_FILTER 0
#define CONFIG_DELOGO_FILTER 0
#define CONFIG_DESHAKE_FILTER 0
#define CONFIG_DETELECINE_FILTER 0
#define CONFIG_DILATION_FILTER 0
#define CONFIG_DISPLACE_FILTER 0
#define CONFIG_DRAWBOX_FILTER 0
#define CONFIG_DRAWGRAPH_FILTER 0
#define CONFIG_DRAWGRID_FILTER 0
#define CONFIG_DRAWTEXT_FILTER 0
#define CONFIG_EDGEDETECT_FILTER 0
#define CONFIG_ELBG_FILTER 0
#define CONFIG_EQ_FILTER 0
#define CONFIG_EROSION_FILTER 0
#define CONFIG_EXTRACTPLANES_FILTER 0
#define CONFIG_FADE_FILTER 0
#define CONFIG_FFTFILT_FILTER 0
#define CONFIG_FIELD_FILTER 0
#define CONFIG_FIELDMATCH_FILTER 0
#define CONFIG_FIELDORDER_FILTER 0
#define CONFIG_FIND_RECT_FILTER 0
#define CONFIG_FORMAT_FILTER 0
#define CONFIG_FPS_FILTER 0
#define CONFIG_FRAMEPACK_FILTER 0
#define CONFIG_FRAMERATE_FILTER 0
#define CONFIG_FRAMESTEP_FILTER 0
#define CONFIG_FREI0R_FILTER 0
#define CONFIG_FSPP_FILTER 0
#define CONFIG_GEQ_FILTER 0
#define CONFIG_GRADFUN_FILTER 0
#define CONFIG_HALDCLUT_FILTER 0
#define CONFIG_HFLIP_FILTER 0
#define CONFIG_HISTEQ_FILTER 0
#define CONFIG_HISTOGRAM_FILTER 0
#define CONFIG_HQDN3D_FILTER 0
#define CONFIG_HQX_FILTER 0
#define CONFIG_HSTACK_FILTER 0
#define CONFIG_HUE_FILTER 0
#define CONFIG_IDET_FILTER 0
#define CONFIG_IL_FILTER 0
#define CONFIG_INFLATE_FILTER 0
#define CONFIG_INTERLACE_FILTER 0
#define CONFIG_INTERLEAVE_FILTER 0
#define CONFIG_KERNDEINT_FILTER 0
#define CONFIG_LENSCORRECTION_FILTER 0
#define CONFIG_LUT3D_FILTER 0
#define CONFIG_LUT_FILTER 0
#define CONFIG_LUTRGB_FILTER 0
#define CONFIG_LUTYUV_FILTER 0
#define CONFIG_MASKEDMERGE_FILTER 0
#define CONFIG_MCDEINT_FILTER 0
#define CONFIG_MERGEPLANES_FILTER 0
#define CONFIG_MPDECIMATE_FILTER 0
#define CONFIG_NEGATE_FILTER 0
#define CONFIG_NOFORMAT_FILTER 0
#define CONFIG_NOISE_FILTER 0
#define CONFIG_NULL_FILTER 0
#define CONFIG_OCR_FILTER 0
#define CONFIG_OCV_FILTER 0
#define CONFIG_OVERLAY_FILTER 0
#define CONFIG_OWDENOISE_FILTER 0
#define CONFIG_PAD_FILTER 0
#define CONFIG_PALETTEGEN_FILTER 0
#define CONFIG_PALETTEUSE_FILTER 0
#define CONFIG_PERMS_FILTER 0
#define CONFIG_PERSPECTIVE_FILTER 0
#define CONFIG_PHASE_FILTER 0
#define CONFIG_PIXDESCTEST_FILTER 0
#define CONFIG_PP_FILTER 0
#define CONFIG_PP7_FILTER 0
#define CONFIG_PSNR_FILTER 0
#define CONFIG_PULLUP_FILTER 0
#define CONFIG_QP_FILTER 0
#define CONFIG_RANDOM_FILTER 0
#define CONFIG_REALTIME_FILTER 0
#define CONFIG_REMOVEGRAIN_FILTER 0
#define CONFIG_REMOVELOGO_FILTER 0
#define CONFIG_REPEATFIELDS_FILTER 0
#define CONFIG_REVERSE_FILTER 0
#define CONFIG_ROTATE_FILTER 0
#define CONFIG_SAB_FILTER 0
#define CONFIG_SCALE_FILTER 0
#define CONFIG_SCALE2REF_FILTER 0
#define CONFIG_SELECT_FILTER 0
#define CONFIG_SELECTIVECOLOR_FILTER 0
#define CONFIG_SENDCMD_FILTER 0
#define CONFIG_SEPARATEFIELDS_FILTER 0
#define CONFIG_SETDAR_FILTER 0
#define CONFIG_SETFIELD_FILTER 0
#define CONFIG_SETPTS_FILTER 0
#define CONFIG_SETSAR_FILTER 0
#define CONFIG_SETTB_FILTER 0
#define CONFIG_SHOWINFO_FILTER 0
#define CONFIG_SHOWPALETTE_FILTER 0
#define CONFIG_SHUFFLEFRAMES_FILTER 0
#define CONFIG_SHUFFLEPLANES_FILTER 0
#define CONFIG_SIGNALSTATS_FILTER 0
#define CONFIG_SMARTBLUR_FILTER 0
#define CONFIG_SPLIT_FILTER 0
#define CONFIG_SPP_FILTER 0
#define CONFIG_SSIM_FILTER 0
#define CONFIG_STEREO3D_FILTER 0
#define CONFIG_SUBTITLES_FILTER 0
#define CONFIG_SUPER2XSAI_FILTER 0
#define CONFIG_SWAPUV_FILTER 0
#define CONFIG_TBLEND_FILTER 0
#define CONFIG_TELECINE_FILTER 0
#define CONFIG_THUMBNAIL_FILTER 0
#define CONFIG_TILE_FILTER 0
#define CONFIG_TINTERLACE_FILTER 0
#define CONFIG_TRANSPOSE_FILTER 0
#define CONFIG_TRIM_FILTER 0
#define CONFIG_UNSHARP_FILTER 0
#define CONFIG_USPP_FILTER 0
#define CONFIG_VECTORSCOPE_FILTER 0
#define CONFIG_VFLIP_FILTER 0
#define CONFIG_VIDSTABDETECT_FILTER 0
#define CONFIG_VIDSTABTRANSFORM_FILTER 0
#define CONFIG_VIGNETTE_FILTER 0
#define CONFIG_VSTACK_FILTER 0
#define CONFIG_W3FDIF_FILTER 0
#define CONFIG_WAVEFORM_FILTER 0
#define CONFIG_XBR_FILTER 0
#define CONFIG_YADIF_FILTER 0
#define CONFIG_ZMQ_FILTER 0
#define CONFIG_ZOOMPAN_FILTER 0
#define CONFIG_ZSCALE_FILTER 0
#define CONFIG_ALLRGB_FILTER 0
#define CONFIG_ALLYUV_FILTER 0
#define CONFIG_CELLAUTO_FILTER 0
#define CONFIG_COLOR_FILTER 0
#define CONFIG_FREI0R_SRC_FILTER 0
#define CONFIG_HALDCLUTSRC_FILTER 0
#define CONFIG_LIFE_FILTER 0
#define CONFIG_MANDELBROT_FILTER 0
#define CONFIG_MPTESTSRC_FILTER 0
#define CONFIG_NULLSRC_FILTER 0
#define CONFIG_RGBTESTSRC_FILTER 0
#define CONFIG_SMPTEBARS_FILTER 0
#define CONFIG_SMPTEHDBARS_FILTER 0
#define CONFIG_TESTSRC_FILTER 0
#define CONFIG_TESTSRC2_FILTER 0
#define CONFIG_NULLSINK_FILTER 0
#define CONFIG_ADRAWGRAPH_FILTER 0
#define CONFIG_APHASEMETER_FILTER 0
#define CONFIG_AVECTORSCOPE_FILTER 0
#define CONFIG_CONCAT_FILTER 0
#define CONFIG_SHOWCQT_FILTER 0
#define CONFIG_SHOWFREQS_FILTER 0
#define CONFIG_SHOWSPECTRUM_FILTER 0
#define CONFIG_SHOWSPECTRUMPIC_FILTER 0
#define CONFIG_SHOWVOLUME_FILTER 0
#define CONFIG_SHOWWAVES_FILTER 0
#define CONFIG_SHOWWAVESPIC_FILTER 0
#define CONFIG_AMOVIE_FILTER 0
#define CONFIG_MOVIE_FILTER 0
#define CONFIG_H263_VAAPI_HWACCEL 0
#define CONFIG_H263_VIDEOTOOLBOX_HWACCEL 0
#define CONFIG_H264_D3D11VA_HWACCEL 0
#define CONFIG_H264_DXVA2_HWACCEL 0
#define CONFIG_H264_MMAL_HWACCEL 0
#define CONFIG_H264_QSV_HWACCEL 0
#define CONFIG_H264_VAAPI_HWACCEL 0
#define CONFIG_H264_VDA_HWACCEL 0
#define CONFIG_H264_VDA_OLD_HWACCEL 0
#define CONFIG_H264_VDPAU_HWACCEL 0
#define CONFIG_H264_VIDEOTOOLBOX_HWACCEL 0
#define CONFIG_HEVC_D3D11VA_HWACCEL 0
#define CONFIG_HEVC_DXVA2_HWACCEL 0
#define CONFIG_HEVC_QSV_HWACCEL 0
#define CONFIG_HEVC_VAAPI_HWACCEL 0
#define CONFIG_HEVC_VDPAU_HWACCEL 0
#define CONFIG_MPEG1_XVMC_HWACCEL 0
#define CONFIG_MPEG1_VDPAU_HWACCEL 0
#define CONFIG_MPEG1_VIDEOTOOLBOX_HWACCEL 0
#define CONFIG_MPEG2_XVMC_HWACCEL 0
#define CONFIG_MPEG2_D3D11VA_HWACCEL 0
#define CONFIG_MPEG2_DXVA2_HWACCEL 0
#define CONFIG_MPEG2_MMAL_HWACCEL 0
#define CONFIG_MPEG2_QSV_HWACCEL 0
#define CONFIG_MPEG2_VAAPI_HWACCEL 0
#define CONFIG_MPEG2_VDPAU_HWACCEL 0
#define CONFIG_MPEG2_VIDEOTOOLBOX_HWACCEL 0
#define CONFIG_MPEG4_VAAPI_HWACCEL 0
#define CONFIG_MPEG4_VDPAU_HWACCEL 0
#define CONFIG_MPEG4_VIDEOTOOLBOX_HWACCEL 0
#define CONFIG_VC1_D3D11VA_HWACCEL 0
#define CONFIG_VC1_DXVA2_HWACCEL 0
#define CONFIG_VC1_VAAPI_HWACCEL 0
#define CONFIG_VC1_VDPAU_HWACCEL 0
#define CONFIG_VC1_MMAL_HWACCEL 0
#define CONFIG_VC1_QSV_HWACCEL 0
#define CONFIG_VP9_D3D11VA_HWACCEL 0
#define CONFIG_VP9_DXVA2_HWACCEL 0
#define CONFIG_VP9_VAAPI_HWACCEL 0
#define CONFIG_WMV3_D3D11VA_HWACCEL 0
#define CONFIG_WMV3_DXVA2_HWACCEL 0
#define CONFIG_WMV3_VAAPI_HWACCEL 0
#define CONFIG_WMV3_VDPAU_HWACCEL 0
#define CONFIG_ALSA_INDEV 0
#define CONFIG_AVFOUNDATION_INDEV 0
#define CONFIG_BKTR_INDEV 0
#define CONFIG_DECKLINK_INDEV 0
#define CONFIG_DSHOW_INDEV 0
#define CONFIG_DV1394_INDEV 0
#define CONFIG_FBDEV_INDEV 0
#define CONFIG_GDIGRAB_INDEV 0
#define CONFIG_IEC61883_INDEV 0
#define CONFIG_JACK_INDEV 0
#define CONFIG_LAVFI_INDEV 0
#define CONFIG_OPENAL_INDEV 0
#define CONFIG_OSS_INDEV 0
#define CONFIG_PULSE_INDEV 0
#define CONFIG_QTKIT_INDEV 0
#define CONFIG_SNDIO_INDEV 0
#define CONFIG_V4L2_INDEV 0
#define CONFIG_VFWCAP_INDEV 0
#define CONFIG_X11GRAB_INDEV 0
#define CONFIG_X11GRAB_XCB_INDEV 0
#define CONFIG_LIBCDIO_INDEV 0
#define CONFIG_LIBDC1394_INDEV 0
#define CONFIG_A64_MUXER 0
#define CONFIG_AC3_MUXER 0
#define CONFIG_ADTS_MUXER 0
#define CONFIG_ADX_MUXER 0
#define CONFIG_AIFF_MUXER 0
#define CONFIG_AMR_MUXER 0
#define CONFIG_APNG_MUXER 0
#define CONFIG_ASF_MUXER 0
#define CONFIG_ASS_MUXER 0
#define CONFIG_AST_MUXER 0
#define CONFIG_ASF_STREAM_MUXER 0
#define CONFIG_AU_MUXER 0
#define CONFIG_AVI_MUXER 0
#define CONFIG_AVM2_MUXER 0
#define CONFIG_BIT_MUXER 0
#define CONFIG_CAF_MUXER 0
#define CONFIG_CAVSVIDEO_MUXER 0
#define CONFIG_CRC_MUXER 0
#define CONFIG_DASH_MUXER 0
#define CONFIG_DATA_MUXER 0
#define CONFIG_DAUD_MUXER 0
#define CONFIG_DIRAC_MUXER 0
#define CONFIG_DNXHD_MUXER 0
#define CONFIG_DTS_MUXER 0
#define CONFIG_DV_MUXER 0
#define CONFIG_EAC3_MUXER 0
#define CONFIG_F4V_MUXER 0
#define CONFIG_FFM_MUXER 0
#define CONFIG_FFMETADATA_MUXER 0
#define CONFIG_FILMSTRIP_MUXER 0
#define CONFIG_FLAC_MUXER 0
#define CONFIG_FLV_MUXER 0
#define CONFIG_FRAMECRC_MUXER 0
#define CONFIG_FRAMEMD5_MUXER 0
#define CONFIG_G722_MUXER 0
#define CONFIG_G723_1_MUXER 0
#define CONFIG_GIF_MUXER 0
#define CONFIG_GXF_MUXER 0
#define CONFIG_H261_MUXER 0
#define CONFIG_H263_MUXER 0
#define CONFIG_H264_MUXER 0
#define CONFIG_HDS_MUXER 0
#define CONFIG_HEVC_MUXER 0
#define CONFIG_HLS_MUXER 0
#define CONFIG_ICO_MUXER 0
#define CONFIG_ILBC_MUXER 0
#define CONFIG_IMAGE2_MUXER 0
#define CONFIG_IMAGE2PIPE_MUXER 0
#define CONFIG_IPOD_MUXER 0
#define CONFIG_IRCAM_MUXER 0
#define CONFIG_ISMV_MUXER 0
#define CONFIG_IVF_MUXER 0
#define CONFIG_JACOSUB_MUXER 0
#define CONFIG_LATM_MUXER 0
#define CONFIG_LRC_MUXER 0
#define CONFIG_M4V_MUXER 0
#define CONFIG_MD5_MUXER 0
#define CONFIG_MATROSKA_MUXER 0
#define CONFIG_MATROSKA_AUDIO_MUXER 0
#define CONFIG_MICRODVD_MUXER 0
#define CONFIG_MJPEG_MUXER 0
#define CONFIG_MLP_MUXER 0
#define CONFIG_MMF_MUXER 0
#define CONFIG_MOV_MUXER 0
#define CONFIG_MP2_MUXER 0
#define CONFIG_MP3_MUXER 0
#define CONFIG_MP4_MUXER 0
#define CONFIG_MPEG1SYSTEM_MUXER 0
#define CONFIG_MPEG1VCD_MUXER 0
#define CONFIG_MPEG1VIDEO_MUXER 0
#define CONFIG_MPEG2DVD_MUXER 0
#define CONFIG_MPEG2SVCD_MUXER 0
#define CONFIG_MPEG2VIDEO_MUXER 0
#define CONFIG_MPEG2VOB_MUXER 0
#define CONFIG_MPEGTS_MUXER 0
#define CONFIG_MPJPEG_MUXER 0
#define CONFIG_MXF_MUXER 0
#define CONFIG_MXF_D10_MUXER 0
#define CONFIG_MXF_OPATOM_MUXER 0
#define CONFIG_NULL_MUXER 0
#define CONFIG_NUT_MUXER 0
#define CONFIG_OGA_MUXER 0
#define CONFIG_OGG_MUXER 0
#define CONFIG_OMA_MUXER 0
#define CONFIG_OPUS_MUXER 0
#define CONFIG_PCM_ALAW_MUXER 0
#define CONFIG_PCM_MULAW_MUXER 0
#define CONFIG_PCM_F64BE_MUXER 0
#define CONFIG_PCM_F64LE_MUXER 0
#define CONFIG_PCM_F32BE_MUXER 0
#define CONFIG_PCM_F32LE_MUXER 0
#define CONFIG_PCM_S32BE_MUXER 0
#define CONFIG_PCM_S32LE_MUXER 0
#define CONFIG_PCM_S24BE_MUXER 0
#define CONFIG_PCM_S24LE_MUXER 0
#define CONFIG_PCM_S16BE_MUXER 0
#define CONFIG_PCM_S16LE_MUXER 0
#define CONFIG_PCM_S8_MUXER 0
#define CONFIG_PCM_U32BE_MUXER 0
#define CONFIG_PCM_U32LE_MUXER 0
#define CONFIG_PCM_U24BE_MUXER 0
#define CONFIG_PCM_U24LE_MUXER 0
#define CONFIG_PCM_U16BE_MUXER 0
#define CONFIG_PCM_U16LE_MUXER 0
#define CONFIG_PCM_U8_MUXER 0
#define CONFIG_PSP_MUXER 0
#define CONFIG_RAWVIDEO_MUXER 0
#define CONFIG_RM_MUXER 0
#define CONFIG_ROQ_MUXER 0
#define CONFIG_RSO_MUXER 0
#define CONFIG_RTP_MUXER 0
#define CONFIG_RTP_MPEGTS_MUXER 0
#define CONFIG_RTSP_MUXER 0
#define CONFIG_SAP_MUXER 0
#define CONFIG_SEGMENT_MUXER 0
#define CONFIG_STREAM_SEGMENT_MUXER 0
#define CONFIG_SINGLEJPEG_MUXER 0
#define CONFIG_SMJPEG_MUXER 0
#define CONFIG_SMOOTHSTREAMING_MUXER 0
#define CONFIG_SOX_MUXER 0
#define CONFIG_SPX_MUXER 0
#define CONFIG_SPDIF_MUXER 0
#define CONFIG_SRT_MUXER 0
#define CONFIG_SWF_MUXER 0
#define CONFIG_TEE_MUXER 0
#define CONFIG_TG2_MUXER 0
#define CONFIG_TGP_MUXER 0
#define CONFIG_MKVTIMESTAMP_V2_MUXER 0
#define CONFIG_TRUEHD_MUXER 0
#define CONFIG_UNCODEDFRAMECRC_MUXER 0
#define CONFIG_VC1_MUXER 0
#define CONFIG_VC1T_MUXER 0
#define CONFIG_VOC_MUXER 0
#define CONFIG_W64_MUXER 0
#define CONFIG_WAV_MUXER 0
#define CONFIG_WEBM_MUXER 0
#define CONFIG_WEBM_DASH_MANIFEST_MUXER 0
#define CONFIG_WEBM_CHUNK_MUXER 0
#define CONFIG_WEBP_MUXER 0
#define CONFIG_WEBVTT_MUXER 0
#define CONFIG_WTV_MUXER 0
#define CONFIG_WV_MUXER 0
#define CONFIG_YUV4MPEGPIPE_MUXER 0
#define CONFIG_CHROMAPRINT_MUXER 0
#define CONFIG_LIBNUT_MUXER 0
#define CONFIG_ALSA_OUTDEV 0
#define CONFIG_CACA_OUTDEV 0
#define CONFIG_DECKLINK_OUTDEV 0
#define CONFIG_FBDEV_OUTDEV 0
#define CONFIG_OPENGL_OUTDEV 0
#define CONFIG_OSS_OUTDEV 0
#define CONFIG_PULSE_OUTDEV 0
#define CONFIG_SDL_OUTDEV 0
#define CONFIG_SNDIO_OUTDEV 0
#define CONFIG_V4L2_OUTDEV 0
#define CONFIG_XV_OUTDEV 0
#define CONFIG_AAC_PARSER 1
#define CONFIG_AAC_LATM_PARSER 0
#define CONFIG_AC3_PARSER 0
#define CONFIG_ADX_PARSER 0
#define CONFIG_BMP_PARSER 0
#define CONFIG_CAVSVIDEO_PARSER 0
#define CONFIG_COOK_PARSER 0
#define CONFIG_DCA_PARSER 0
#define CONFIG_DIRAC_PARSER 0
#define CONFIG_DNXHD_PARSER 0
#define CONFIG_DPX_PARSER 0
#define CONFIG_DVBSUB_PARSER 0
#define CONFIG_DVDSUB_PARSER 0
#define CONFIG_DVD_NAV_PARSER 0
#define CONFIG_FLAC_PARSER 0
#define CONFIG_G729_PARSER 0
#define CONFIG_GSM_PARSER 0
#define CONFIG_H261_PARSER 0
#define CONFIG_H263_PARSER 0
#define CONFIG_H264_PARSER 1
#define CONFIG_HEVC_PARSER 0
#define CONFIG_MJPEG_PARSER 0
#define CONFIG_MLP_PARSER 0
#define CONFIG_MPEG4VIDEO_PARSER 0
#define CONFIG_MPEGAUDIO_PARSER 1
#define CONFIG_MPEGVIDEO_PARSER 0
#define CONFIG_OPUS_PARSER 1
#define CONFIG_PNG_PARSER 0
#define CONFIG_PNM_PARSER 0
#define CONFIG_RV30_PARSER 0
#define CONFIG_RV40_PARSER 0
#define CONFIG_TAK_PARSER 0
#define CONFIG_VC1_PARSER 0
#define CONFIG_VORBIS_PARSER 1
#define CONFIG_VP3_PARSER 1
#define CONFIG_VP8_PARSER 1
#define CONFIG_VP9_PARSER 0
#define CONFIG_ASYNC_PROTOCOL 0
#define CONFIG_BLURAY_PROTOCOL 0
#define CONFIG_CACHE_PROTOCOL 0
#define CONFIG_CONCAT_PROTOCOL 0
#define CONFIG_CRYPTO_PROTOCOL 0
#define CONFIG_DATA_PROTOCOL 0
#define CONFIG_FFRTMPCRYPT_PROTOCOL 0
#define CONFIG_FFRTMPHTTP_PROTOCOL 0
#define CONFIG_FILE_PROTOCOL 0
#define CONFIG_FTP_PROTOCOL 0
#define CONFIG_GOPHER_PROTOCOL 0
#define CONFIG_HLS_PROTOCOL 0
#define CONFIG_HTTP_PROTOCOL 0
#define CONFIG_HTTPPROXY_PROTOCOL 0
#define CONFIG_HTTPS_PROTOCOL 0
#define CONFIG_ICECAST_PROTOCOL 0
#define CONFIG_MMSH_PROTOCOL 0
#define CONFIG_MMST_PROTOCOL 0
#define CONFIG_MD5_PROTOCOL 0
#define CONFIG_PIPE_PROTOCOL 0
#define CONFIG_RTMP_PROTOCOL 0
#define CONFIG_RTMPE_PROTOCOL 0
#define CONFIG_RTMPS_PROTOCOL 0
#define CONFIG_RTMPT_PROTOCOL 0
#define CONFIG_RTMPTE_PROTOCOL 0
#define CONFIG_RTMPTS_PROTOCOL 0
#define CONFIG_RTP_PROTOCOL 0
#define CONFIG_SCTP_PROTOCOL 0
#define CONFIG_SRTP_PROTOCOL 0
#define CONFIG_SUBFILE_PROTOCOL 0
#define CONFIG_TCP_PROTOCOL 0
#define CONFIG_TLS_SCHANNEL_PROTOCOL 0
#define CONFIG_TLS_SECURETRANSPORT_PROTOCOL 0
#define CONFIG_TLS_GNUTLS_PROTOCOL 0
#define CONFIG_TLS_OPENSSL_PROTOCOL 0
#define CONFIG_UDP_PROTOCOL 0
#define CONFIG_UDPLITE_PROTOCOL 0
#define CONFIG_UNIX_PROTOCOL 0
#define CONFIG_LIBRTMP_PROTOCOL 0
#define CONFIG_LIBRTMPE_PROTOCOL 0
#define CONFIG_LIBRTMPS_PROTOCOL 0
#define CONFIG_LIBRTMPT_PROTOCOL 0
#define CONFIG_LIBRTMPTE_PROTOCOL 0
#define CONFIG_LIBSSH_PROTOCOL 0
#define CONFIG_LIBSMBCLIENT_PROTOCOL 0
#endif /* FFMPEG_CONFIG_H */
```
|
```objective-c
//
//
// path_to_url
//
// Unless required by applicable law or agreed to in writing, software
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#pragma once
#ifdef __cplusplus
extern "C" {
#endif
#define SOC_TOUCH_SHIELD_CHANNEL (14) /*!< The waterproof function includes a shielded channel (TOUCH_PAD_NUM14) */
#define SOC_TOUCH_DENOISE_CHANNEL (0) /*!< T0 is an internal channel that does not have a corresponding external GPIO.
T0 will work simultaneously with the measured channel Tn. Finally, the actual
measured value of Tn is the value after subtracting lower bits of T0. */
#ifdef __cplusplus
}
#endif
```
|
```kotlin
package com.apollographql.ijplugin.navigation
import com.apollographql.ijplugin.telemetry.TelemetryEvent
import com.apollographql.ijplugin.telemetry.telemetryService
import com.intellij.navigation.ItemPresentation
import com.intellij.navigation.NavigationItem
import com.intellij.platform.backend.navigation.NavigationRequest
import com.intellij.pom.Navigatable
import com.intellij.psi.PsiElement
import javax.swing.Icon
private class LogNavigationPsiElement(
private val wrapped: PsiElement,
private val telemetryEvent: () -> TelemetryEvent,
) : PsiElement by wrapped, NavigationItem, Navigatable {
private var hasLogged = false
override fun equals(other: Any?): Boolean = wrapped == other
override fun hashCode(): Int = wrapped.hashCode()
override fun toString(): String = wrapped.toString()
override fun getName(): String? {
return (wrapped as? NavigationItem)?.name
}
override fun getPresentation(): ItemPresentation {
return (wrapped as? NavigationItem)?.presentation ?: object : ItemPresentation {
// We don't want the presentation to be too wide: fallback to the first line of text, truncated to 80 characters
override fun getPresentableText(): String? = wrapped.text.split('\n').firstOrNull()?.take(80)
override fun getIcon(unused: Boolean): Icon? = null
}
}
@Suppress("UnstableApiUsage")
override fun navigationRequest(): NavigationRequest? {
logTelemetryEvent()
return (wrapped as? Navigatable)?.navigationRequest()
}
override fun navigate(requestFocus: Boolean) {
(wrapped as? Navigatable)?.navigate(requestFocus)
}
override fun canNavigate(): Boolean {
return (wrapped as? Navigatable)?.canNavigate() ?: false
}
override fun canNavigateToSource(): Boolean {
return (wrapped as? Navigatable)?.canNavigateToSource() ?: false
}
private fun logTelemetryEvent() {
if (!hasLogged) {
hasLogged = true
wrapped.project.telemetryService.logEvent(telemetryEvent())
}
}
}
fun PsiElement.logNavigation(telemetryEvent: () -> TelemetryEvent): PsiElement {
return LogNavigationPsiElement(this, telemetryEvent)
}
```
|
Aloyse Raths (June 5, 1921 – December 17, 2009) was a high member of the Luxembourgish Resistance during World War II.
He was born in Bissen and attended primary school there, later attending the Athénée in Luxembourg City, and the Lycée classique in Diekirch. He then attended the teacher training college in Ettelbrück from 1937, and became a primary school teacher in Moestroff in 1941. In October 1940 he founded the Lëtzebuerger Legio'n (Luxembourg Legion), which a year later merged with a group of Scouts to become the Letzeburger Vollekslegio'n (Luxembourg People's Legion). Raths hid refugees and Resistance members from the authorities, helped them to escape to France and provided fake documents for them. He also coordinated the espionage activities of the LVL.
He was arrested on 19 February 1942 and dismissed from his teaching post, but was released due to lack of evidence on 14 July 1942. He participated in organising the general strike, and in 1943 was made to join the Reichsarbeitsdienst, and then the Wehrmacht. At the Eastern Front, he was again arrested in November 1943 and brought back to Luxembourg, where he managed to escape from custody. Until the liberation, he lived in hiding and was active in the Resistance.
When the war ended he returned to teaching, in Bissen, Kleinbettingen, Luxembourg and Cessange. From 1962 to 1970 he was a teacher at the Grand Duke's court, and until 1986 at the ISERP, the teacher training college. From 1975 to 1986 he also taught at the "Cours universitaires“.
After the war, he was a member of the Ligue vun de politesche Prisonnéier an Deportéierten or LPPD (League of political prisoners and deportees), the organisation of resistance members after World War II, and editor of their newspaper, Rappel. From 1967 to 2004, he was the president of the CNR, the Conseil national de la résistance. He additionally published many works on the resistance in Luxembourg.
Publications
Raths, Aloyse: Années néfastes pour le Grand-Duché 1940-1945 – Unheilvolle Jahre für Luxemburg; LPPD / Éditions du Rappel; Print: Imprimerie centrale, January 2009.
Several of his works on the Luxembourgish resistance were published in Rappel, which he also edited.
References
Further reading
Hoffmann, Serge: Le mouvement de résistance LVL au Luxembourg, Archives nationales, 2004, 158 pages. (in French)
Muller, Carlo: Luxemburg im 2. Weltkrieg, Geschichte für die Primärschule, Luxembourg, 1997. (in German)
1921 births
2009 deaths
Luxembourg Resistance members
Luxembourgian schoolteachers
People from Mersch (canton)
Alumni of the Athénée de Luxembourg
Reich Labour Service members
German Army personnel of World War II
|
The Rich List is an Australian game show which is based on the format initially created for transmission in the United Kingdom created by 12 Yard called Who Dares Wins (not to be confused with the stunt and dare show of the same name). The game consists of two teams who name as many items relating to a topic as they can while competing against each other for a no-limit cash prize. For its first season, it was shown on Monday nights at 7:30 pm on the Seven Network but moved to Saturday nights in the same timeslot for the second season, before being put on hiatus and returning to its original season-one timeslot.
The show premiered in its regular Monday timeslot on 29 January 2007 at 7:30 pm and continued with a special episode on 30 January to give people a chance to watch the show who opted to watch Steve Irwin's last documentary Ocean's Deadliest which went up against The Rich List on Monday the 29th on the rival station, the Nine Network. The show is recorded at the Melbourne Central City Studios. This version follows the basic rules of other versions of the show.
The program is hosted by the Deal or No Deal host Andrew O'Keefe. The pilot episode was taped on 18 October 2006. The show began taping episodes for air on 11 December 2006.
The first series of The Rich List ended on 25 June 2007, after a season of steady consistent ratings of 1.1 to 1.3 million viewers. A second series began airing 24 May 2008, although just 721,000 viewers tuned into the season premiere episode, placing the Seven Network fourth out of five in its timeslot. After the second episode rated 715,000 viewers, the Seven Network initially pulled The Rich List from the schedule, but it returned from hiatus a few months later on 3 November 2008. The Rich List has been put back on hiatus from 14 January 2009; no new episodes have been produced since then.
The voice-over introducing the show is Marcus Irvine, notable for being the voice of past game show The Weakest Link.
Gameplay
The Gameplay is similar to the format used in the United States (although, despite the fact that an entire series was filmed with Eamonn Holmes as host, it has never been aired). It consists of two rounds. A best of three no money amount lists followed by "The Rich List" where a team can win $250,000 for completing each list with 15 answers. There is no limit to how many "Rich Lists" a team can partially or fully complete and therefore, teams are capable of winning an unlimited amount of money.
Best of three lists
Two teams of two players, one of which are the champions from the previous episode and the other are a new pair of challengers, are presented to the audience. The two teams, who have not met before the show, are placed in separate soundproof isolation booths, with audio that is turned on or off by the host. He announces the category for the list, such as "Wimbledon Men's Singles champions" or "Squares from a Monopoly board" then asks the challengers to place a bid on the number of items they must name to win the list. The host switches the audio on and off between the booths as the bidding continues. Note that if players do not feel they can bid higher than their opponents' bid, they can choose to bluff their bids (as the opponent side cannot hear the team's conversations) in an attempt to pressure the opponents to raise their bid further. The host turns both audios on when one team has challenged the other to fulfill the bid.
The challenged team must list in a row as many items as their bid in order to win the list. If the team makes one mistake along the way, the list is awarded to their opponents.
The first team to win two lists has won the best of three and goes on to play "The Rich List".
Tiebreaker
If each team wins one list apiece, a sudden death tiebreaker is played. The host gives the category, both booths are switched on, and the teams alternate their answers. In order to win the list and the best of three, one team must give an incorrect answer while the other team gives a correct answer. In case if both teams fail to name an item on the same turn, both teams get another chance to name another item. Should that fail, another tiebreaker list will be used to break the tie.
The Rich List
The winning team moves on to play "The Rich List" where Andrew gives the team a new category and the chance to supply up to 15 correct answers. Winnings increase after every third correct answer is given, according to the following table.
If a wrong answer is given at any time, the team loses all accumulated money they won from that "Rich List", but all winnings from previous "Rich Lists" that the team may have completed are safe. After every third answer, they can choose to stop playing, winning all the money accumulated from the current "Rich List" or play on, until the team lists all fifteen answers, therefore winning $250,000. Regardless of the outcome, the team then returns to the isolated soundproof booths to play the game again against a new pair of opponents. Only a loss when playing "The Best of three lists" can eliminate teams from the show.
Errors
Many lists in the show are known to have mistakes or inaccurate information in them. The list about countries adopting the euro contained a country called "Holland", which is in fact a region of the Netherlands. There have also been other mistakes in lists such as "Island Nations" where the list included nations that share the land territory of the island with other nation-states, and "Top 20 countries with the most land area". A list of nation's common names beginning with B listed Bermuda, which is a British Overseas Territory, and Britain, which is the name of the island on which the United Kingdom, except Ireland, is situated. A list of countries beginning with A also accepted America, as it "is the way most Australians would say it", despite the country in question actually being called the United States of America. The term 'country' was replaced with Sovereign States to avoid such confusion or partial duplication.
Ratings
The show's premiere on 29 January placed fourth in daily ratings and second in its timeslot Ocean's Deadliest on Nine Network, which aired at the same time as The Rich List, attracted about 250,000 more. However, the show performed better in the next episode. Despite attracting less viewers than 1 vs. 100 in the first few weeks, the show attracted 40,000 more viewers on 5 March.
The show is usually in the top 20 most watched programs each week according to ratings measuring company OzTAM.
Today Tonight aired a feature article on the Rich List and interviewed two contestants, Bec and a guy who named at least 15 British Prime Ministers. They won $250,000 but couldn't get the money until the episode was actually shown.
List of episodes
Season 1 (2007)
Season 2 (2008–2009)
References
External links
2000s Australian game shows
Seven Network original programming
2007 Australian television series debuts
2009 Australian television series endings
English-language television shows
Television series by ITV Studios
|
Kiewit Corporation is an American privately held construction company based in Omaha, Nebraska founded in 1884. In 2021, it was ranked 243rd on the Fortune 500. Privately held, it is one of the largest construction and engineering organizations in North America. It is an employee-owned company.
History
The company was founded in 1884 as Kiewit Brothers Masonry Contractors by Peter and Andrew Kiewit, who were of Dutch descent. Their father, John Kiewit, emigrated from The Hague in 1857, where he learned the trade of brickmaking. John Kiewit established a brickyard in Omaha, Nebraska where his sons worked and learned the skills for their masonry business. Early projects included the seven-story Lincoln Hotel in Lincoln as stonemasons and the Bekins warehouse as general contractor. It is an employee-owned company.
The original brothers dissolved their partnership in 1904 and the founding Peter Kiewit continued as a sole proprietorship. In 1912, two of his sons, Ralph and George Kiewit, joined their father as partners in the firm. One of their constructions was the Omaha Fire Department Hose Company No. 4 building, erected in 1913. When the founding Peter Kiewit died in 1914, his son Ralph led the company. George and Ralph Kiewit left the company.
The founder's youngest son, Peter Kiewit Jr., joined the firm in 1919. He led the firm from 1924 until his death in 1979. Peter Jr. turned the firm into one of the largest construction companies in the world. He was also very active in the Omaha area, including leadership of the Knights of Ak-Sar-Ben.
In 1931, Peter Kiewit incorporated the company as Peter Kiewit Sons’ Co. The firm began building transportation projects during the Great Depression.
Walter Scott was also a key figure in the growth of Kiewit. Scott was initially hired to work on the tower project at the Nebraska State Capitol and spent the remainder of his career at Kiewit becoming chief engineer.
Notable projects
Throughout the 1920s the company built several historic buildings around Nebraska including the Livestock Exchange Building (1926), the Lincoln station (Nebraska, 1926–2012), the Nebraska State Capitol Tower (1927), Joslyn Art Museum (1928), and Union Station (Omaha)(1929).
Between 1951 and 1966, Kiewit built Thule Air Base for the U.S. military in Thule, Greenland. Located on the northwest coast of Greenland, the base features a 10,000 foot runway.
In 1969, Kiewit began construction of the 63rd Street tunnel between Manhattan and Queens. The initial project was part of a $2 billion program to improve the New York City Transit Authority and Long Island Railroad facilities in New York City.
Between 1980 and 1985, the company built the mile-long $750 million Fort McHenry Tunnel in Baltimore Harbor.
In the 1990s, Kiewit was part of a joint venture to build the $517 million T-Mobile Park in Seattle, home of the Seattle Mariners baseball team. The project was completed in 1999.
Kiewit Infrastructure South is part of the team constructing the 11.5 mile and six-station extension of Washington Metro in Washington D.C.
In 2001, Kiewit Offshore began construction of an off-shore drill platform fabrication facility at their 555 acre facility outside Corpus Christi, Texas. This site is home to the 13,000 ton Heavy Lifting Device [Crane] - the largest on-shore lifting device in the western hemisphere. It stands 550 feet tall and uses 23 miles of 2 5/8" cable. It took 11 months to build and is used approximately once per year.
In 2022, Kiewit broke ground on the largest (at the time) US PV and storage project utilizing Ojjo foundations, ATI racking and Maxeon bi-facial modules. This 967 MW (DC) project is located 45 minutes north of Las Vegas, NV.
Leadership
Rick Lanoha is the current chief executive officer of Kiewit Corporation. His predecessors include Peter Kiewit, Bob Wilson, Walter Scott Jr. Ken Stinson and Bruce E. Grewcock. Prior to Grewcock's retirement, on January 1, 2020, Lanoha had served as president and chief operating officer since 2016 and was elected to Kiewit's board of directors in 2009.
Walter Scott, Jr. was first elected to the Peter Kiewit Sons' Incorporated board in 1964.
In 1979, he was elected president. When Peter Kiewit died later that same year, Scott was selected to succeed him as chairman.
Expansions
In 1963, Peter Kiewit bought the Omaha World-Herald to keep it locally owned. Under the terms of his will, the employees bought the paper in 1979.
Starting in 1985 (Kiewit built MFS in the early 1990s; Level 3 was built in the 1997 to 1999 circa), Kiewit also constructed a nationwide fiber optic network. This network was later spun off as Level 3 Communications, which became the formal successor corporation to the original Peter Kiewit Sons'.
They have a training facility called Kiewit University in its new Omaha, Nebraska campus that trains employees from throughout the US.
Other companies
Continental Fire Sprinkler of Omaha, Nebraska
Aero Automatic Sprinkler Company of Phoenix, Arizona
Jet Pipe Industries of Phoenix, Arizona
General Construction Company (Now a part of Kiewit Bridge and Marine) of Poulsbo, Washington
InEight, Inc (formerly Hard Dollar Corporation) of Scottsdale, Arizona
Mass. Electric Construction Co. – Industrial Group (MEC) of Boston, Massachusetts
Mass. Electric Construction Co. – Transportation Group (MEC) of Dallas, Texas
The Industrial Co. (TIC) of Englewood, Colorado
Cherne Contracting Corporation of Minneapolis, Minnesota
Midwest Aviation of Omaha, Nebraska
Weeks Marine of Cranford, New Jersey (Acquired January 3rd 2023)
References
External links
Construction and civil engineering companies established in 1884
Companies based in Omaha, Nebraska
Privately held companies of the United States
Construction and civil engineering companies of the United States
Employee-owned companies of the United States
Privately held companies based in Nebraska
1884 establishments in Nebraska
American companies established in 1884
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var randu = require( '@stdlib/random/base/randu' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pkg = require( './../package.json' ).name;
var copysign = require( './../lib' );
// MAIN //
bench( pkg, function benchmark( b ) {
var x;
var y;
var z;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
x = ( randu()*1.0e7 ) - 5.0e6;
y = ( randu()*1.0e7 ) - 5.0e6;
z = copysign( x, y );
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( z ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
});
```
|
Scorpaena sumptuosa, the western red scorpionfish, western red rockcod, western red scorpioncod or western scorpionfish, is a venomous species of marine ray-finned fish belonging to the family Scorpaenidae, the scorpionfishes. It is found in Western Australia.
Taxonomy
Scorpaena sumptuosa was first formally described in 1875 by the French naturalist François-Louis Laporte, comte de Castelnau with the type locality given as Fremantle in Western Australia. The specific name sumptuosa means "magificent" in Latin, Castelnau did not explain this but it may refer to the deep red colour of this species.
Description
Scorpaena sumptuosa is distinguished from most other species of Scorpaena found in the Indo-Pacific by its maxillary ridge, very deep occipital pit, thickened skin with many pores near the lateral line and covering the spine on the operculum and the presence of two pairs of slender tentacles on the front off the lower jaw. There are 16 fin rays in the pectoral fin. It is closely related to the ghost scorpionfish (Scorpaena gasta) but is larger, has fewer tentacles on the flanks and more variable in colour. This species reaches a maximum total length of . This is a deep-bodied species with an obvious hump on the shoulder. Tentacles cover the body with the effect of disrupting the outline of the body to provide camouflage and the eyes are high on the head. It is a mottled red to brown colour marked with two wide vertical bands on the body, these extend onto the fins.
Distribution and habitat
Scorpaena sumptuosa is endemic to Western Australia where it occurs from the Shark Bay in the north to Albany in the south. It is found on coastal reefs in depths down to .
Biology
Scorpaena sumptuosa is an ambush predator, they lie motionless for lengthy periods, among corals, algae and benthic invertebrates and use their prehensile mouths to suck in prey which comes in range. They are protected by venom bearing spines which can deliver a painful sting.
Notes
References
sumptuosa
Venomous fish
Marine fish of Western Australia
Fish described in 1875
Taxa named by François-Louis Laporte, comte de Castelnau
|
Richard Myers (April 7, 1930 – June 24, 2011) was an American Major League Baseball player. Listed at 5' 6", 150 lb., Myers batted and threw right-handed. He was born in Sacramento, California.
Myers had a nine-year minor league career as a shortstop before joining the Chicago Cubs during the season, appearing in four games as a pinch runner and pinch hitter.
In his only MLB at-bat on April 29, 1956, against the Cincinnati Redlegs at Crosley Field, Myers pinch hit for Cub pitcher Vito Valentinetti and grounded out to shortstop Roy McMillan against Cincinnati starting pitcher Art Fowler. As a pinch runner, he appeared in three other games but failed to score a run.
His 1948–1956 minor league career largely took place with his hometown Sacramento Solons of the Pacific Coast League, where he spent all or part of seven of his nine professional seasons. Myers posted a .261 batting average with 45 home runs in 937 games and a .964 fielding percentage at shortstop.
Following his retirement, Myers worked for the city of Sacramento as a street maintenance supervisor. In 2006 Myers moved to Yreka, California, where he died at the age of 81 following complications from a fall.
References
External links
Major League Baseball shortstops
Chicago Cubs players
Los Angeles Angels (minor league) players
Sacramento Solons players
Salem Senators players
Twin Falls Cowboys players
Wenatchee Chiefs players
Baseball players from Sacramento, California
1930 births
2011 deaths
Sportspeople from Siskiyou County, California
Accidental deaths from falls
Accidental deaths in California
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef V8_HEAP_SCAVENGE_JOB_H_
#define V8_HEAP_SCAVENGE_JOB_H_
#include "src/tasks/cancelable-task.h"
namespace v8 {
namespace internal {
class Heap;
class Isolate;
// The scavenge job uses platform tasks to perform a young generation
// Scavenge garbage collection. The job posts a foreground task.
class ScavengeJob {
public:
ScavengeJob() V8_NOEXCEPT = default;
void ScheduleTaskIfNeeded(Heap* heap);
static size_t YoungGenerationTaskTriggerSize(Heap* heap);
private:
class Task;
static bool YoungGenerationSizeTaskTriggerReached(Heap* heap);
void set_task_pending(bool value) { task_pending_ = value; }
bool task_pending_ = false;
};
} // namespace internal
} // namespace v8
#endif // V8_HEAP_SCAVENGE_JOB_H_
```
|
```c++
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/builtins/builtins-utils-inl.h"
#include "src/builtins/builtins.h"
#include "src/code-factory.h"
#include "src/counters.h"
#include "src/heap/heap-inl.h" // For ToBoolean. TODO(jkummerow): Drop.
#include "src/keys.h"
#include "src/lookup.h"
#include "src/message-template.h"
#include "src/objects-inl.h"
#include "src/property-descriptor.h"
namespace v8 {
namespace internal {
// your_sha256_hash-------------
// ES6 section 19.1 Object Objects
// ES6 section 19.1.3.4 Object.prototype.propertyIsEnumerable ( V )
BUILTIN(ObjectPrototypePropertyIsEnumerable) {
HandleScope scope(isolate);
Handle<JSReceiver> object;
Handle<Name> name;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, name, Object::ToName(isolate, args.atOrUndefined(isolate, 1)));
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, object, Object::ToObject(isolate, args.receiver()));
Maybe<PropertyAttributes> maybe =
JSReceiver::GetOwnPropertyAttributes(object, name);
if (maybe.IsNothing()) return ReadOnlyRoots(isolate).exception();
if (maybe.FromJust() == ABSENT) return ReadOnlyRoots(isolate).false_value();
return isolate->heap()->ToBoolean((maybe.FromJust() & DONT_ENUM) == 0);
}
// ES6 section 19.1.2.3 Object.defineProperties
BUILTIN(ObjectDefineProperties) {
HandleScope scope(isolate);
DCHECK_EQ(3, args.length());
Handle<Object> target = args.at(1);
Handle<Object> properties = args.at(2);
RETURN_RESULT_OR_FAILURE(
isolate, JSReceiver::DefineProperties(isolate, target, properties));
}
// ES6 section 19.1.2.4 Object.defineProperty
BUILTIN(ObjectDefineProperty) {
HandleScope scope(isolate);
DCHECK_EQ(4, args.length());
Handle<Object> target = args.at(1);
Handle<Object> key = args.at(2);
Handle<Object> attributes = args.at(3);
return JSReceiver::DefineProperty(isolate, target, key, attributes);
}
namespace {
template <AccessorComponent which_accessor>
Object ObjectDefineAccessor(Isolate* isolate, Handle<Object> object,
Handle<Object> name, Handle<Object> accessor) {
// 1. Let O be ? ToObject(this value).
Handle<JSReceiver> receiver;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, receiver,
Object::ToObject(isolate, object));
// 2. If IsCallable(getter) is false, throw a TypeError exception.
if (!accessor->IsCallable()) {
MessageTemplate message =
which_accessor == ACCESSOR_GETTER
? MessageTemplate::kObjectGetterExpectingFunction
: MessageTemplate::kObjectSetterExpectingFunction;
THROW_NEW_ERROR_RETURN_FAILURE(isolate, NewTypeError(message));
}
// 3. Let desc be PropertyDescriptor{[[Get]]: getter, [[Enumerable]]: true,
// [[Configurable]]: true}.
PropertyDescriptor desc;
if (which_accessor == ACCESSOR_GETTER) {
desc.set_get(accessor);
} else {
DCHECK(which_accessor == ACCESSOR_SETTER);
desc.set_set(accessor);
}
desc.set_enumerable(true);
desc.set_configurable(true);
// 4. Let key be ? ToPropertyKey(P).
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, name,
Object::ToPropertyKey(isolate, name));
// 5. Perform ? DefinePropertyOrThrow(O, key, desc).
// To preserve legacy behavior, we ignore errors silently rather than
// throwing an exception.
Maybe<bool> success = JSReceiver::DefineOwnProperty(
isolate, receiver, name, &desc, Just(kThrowOnError));
MAYBE_RETURN(success, ReadOnlyRoots(isolate).exception());
if (!success.FromJust()) {
isolate->CountUsage(v8::Isolate::kDefineGetterOrSetterWouldThrow);
}
// 6. Return undefined.
return ReadOnlyRoots(isolate).undefined_value();
}
Object ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
Handle<Object> key, AccessorComponent component) {
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, object,
Object::ToObject(isolate, object));
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, key,
Object::ToPropertyKey(isolate, key));
bool success = false;
LookupIterator it = LookupIterator::PropertyOrElement(
isolate, object, key, &success,
LookupIterator::PROTOTYPE_CHAIN_SKIP_INTERCEPTOR);
DCHECK(success);
for (; it.IsFound(); it.Next()) {
switch (it.state()) {
case LookupIterator::INTERCEPTOR:
case LookupIterator::NOT_FOUND:
case LookupIterator::TRANSITION:
UNREACHABLE();
case LookupIterator::ACCESS_CHECK:
if (it.HasAccess()) continue;
isolate->ReportFailedAccessCheck(it.GetHolder<JSObject>());
RETURN_FAILURE_IF_SCHEDULED_EXCEPTION(isolate);
return ReadOnlyRoots(isolate).undefined_value();
case LookupIterator::JSPROXY: {
PropertyDescriptor desc;
Maybe<bool> found = JSProxy::GetOwnPropertyDescriptor(
isolate, it.GetHolder<JSProxy>(), it.GetName(), &desc);
MAYBE_RETURN(found, ReadOnlyRoots(isolate).exception());
if (found.FromJust()) {
if (component == ACCESSOR_GETTER && desc.has_get()) {
return *desc.get();
}
if (component == ACCESSOR_SETTER && desc.has_set()) {
return *desc.set();
}
return ReadOnlyRoots(isolate).undefined_value();
}
Handle<Object> prototype;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, prototype, JSProxy::GetPrototype(it.GetHolder<JSProxy>()));
if (prototype->IsNull(isolate)) {
return ReadOnlyRoots(isolate).undefined_value();
}
return ObjectLookupAccessor(isolate, prototype, key, component);
}
case LookupIterator::INTEGER_INDEXED_EXOTIC:
case LookupIterator::DATA:
return ReadOnlyRoots(isolate).undefined_value();
case LookupIterator::ACCESSOR: {
Handle<Object> maybe_pair = it.GetAccessors();
if (maybe_pair->IsAccessorPair()) {
return *AccessorPair::GetComponent(
isolate, Handle<AccessorPair>::cast(maybe_pair), component);
}
}
}
}
return ReadOnlyRoots(isolate).undefined_value();
}
} // namespace
// ES6 B.2.2.2 a.k.a.
// path_to_url#sec-object.prototype.__defineGetter__
BUILTIN(ObjectDefineGetter) {
HandleScope scope(isolate);
Handle<Object> object = args.at(0); // Receiver.
Handle<Object> name = args.at(1);
Handle<Object> getter = args.at(2);
return ObjectDefineAccessor<ACCESSOR_GETTER>(isolate, object, name, getter);
}
// ES6 B.2.2.3 a.k.a.
// path_to_url#sec-object.prototype.__defineSetter__
BUILTIN(ObjectDefineSetter) {
HandleScope scope(isolate);
Handle<Object> object = args.at(0); // Receiver.
Handle<Object> name = args.at(1);
Handle<Object> setter = args.at(2);
return ObjectDefineAccessor<ACCESSOR_SETTER>(isolate, object, name, setter);
}
// ES6 B.2.2.4 a.k.a.
// path_to_url#sec-object.prototype.__lookupGetter__
BUILTIN(ObjectLookupGetter) {
HandleScope scope(isolate);
Handle<Object> object = args.at(0);
Handle<Object> name = args.at(1);
return ObjectLookupAccessor(isolate, object, name, ACCESSOR_GETTER);
}
// ES6 B.2.2.5 a.k.a.
// path_to_url#sec-object.prototype.__lookupSetter__
BUILTIN(ObjectLookupSetter) {
HandleScope scope(isolate);
Handle<Object> object = args.at(0);
Handle<Object> name = args.at(1);
return ObjectLookupAccessor(isolate, object, name, ACCESSOR_SETTER);
}
// ES6 section 19.1.2.5 Object.freeze ( O )
BUILTIN(ObjectFreeze) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
if (object->IsJSReceiver()) {
MAYBE_RETURN(JSReceiver::SetIntegrityLevel(Handle<JSReceiver>::cast(object),
FROZEN, kThrowOnError),
ReadOnlyRoots(isolate).exception());
}
return *object;
}
// ES section 19.1.2.9 Object.getPrototypeOf ( O )
BUILTIN(ObjectGetPrototypeOf) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Handle<JSReceiver> receiver;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, receiver,
Object::ToObject(isolate, object));
RETURN_RESULT_OR_FAILURE(isolate,
JSReceiver::GetPrototype(isolate, receiver));
}
// ES6 section 19.1.2.21 Object.setPrototypeOf ( O, proto )
BUILTIN(ObjectSetPrototypeOf) {
HandleScope scope(isolate);
// 1. Let O be ? RequireObjectCoercible(O).
Handle<Object> object = args.atOrUndefined(isolate, 1);
if (object->IsNullOrUndefined(isolate)) {
THROW_NEW_ERROR_RETURN_FAILURE(
isolate, NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,
isolate->factory()->NewStringFromAsciiChecked(
"Object.setPrototypeOf")));
}
// 2. If Type(proto) is neither Object nor Null, throw a TypeError exception.
Handle<Object> proto = args.atOrUndefined(isolate, 2);
if (!proto->IsNull(isolate) && !proto->IsJSReceiver()) {
THROW_NEW_ERROR_RETURN_FAILURE(
isolate, NewTypeError(MessageTemplate::kProtoObjectOrNull, proto));
}
// 3. If Type(O) is not Object, return O.
if (!object->IsJSReceiver()) return *object;
Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(object);
// 4. Let status be ? O.[[SetPrototypeOf]](proto).
// 5. If status is false, throw a TypeError exception.
MAYBE_RETURN(JSReceiver::SetPrototype(receiver, proto, true, kThrowOnError),
ReadOnlyRoots(isolate).exception());
// 6. Return O.
return *receiver;
}
// ES6 section B.2.2.1.1 get Object.prototype.__proto__
BUILTIN(ObjectPrototypeGetProto) {
HandleScope scope(isolate);
// 1. Let O be ? ToObject(this value).
Handle<JSReceiver> receiver;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, receiver, Object::ToObject(isolate, args.receiver()));
// 2. Return ? O.[[GetPrototypeOf]]().
RETURN_RESULT_OR_FAILURE(isolate,
JSReceiver::GetPrototype(isolate, receiver));
}
// ES6 section B.2.2.1.2 set Object.prototype.__proto__
BUILTIN(ObjectPrototypeSetProto) {
HandleScope scope(isolate);
// 1. Let O be ? RequireObjectCoercible(this value).
Handle<Object> object = args.receiver();
if (object->IsNullOrUndefined(isolate)) {
THROW_NEW_ERROR_RETURN_FAILURE(
isolate, NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,
isolate->factory()->NewStringFromAsciiChecked(
"set Object.prototype.__proto__")));
}
// 2. If Type(proto) is neither Object nor Null, return undefined.
Handle<Object> proto = args.at(1);
if (!proto->IsNull(isolate) && !proto->IsJSReceiver()) {
return ReadOnlyRoots(isolate).undefined_value();
}
// 3. If Type(O) is not Object, return undefined.
if (!object->IsJSReceiver()) return ReadOnlyRoots(isolate).undefined_value();
Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(object);
// 4. Let status be ? O.[[SetPrototypeOf]](proto).
// 5. If status is false, throw a TypeError exception.
MAYBE_RETURN(JSReceiver::SetPrototype(receiver, proto, true, kThrowOnError),
ReadOnlyRoots(isolate).exception());
// Return undefined.
return ReadOnlyRoots(isolate).undefined_value();
}
namespace {
Object GetOwnPropertyKeys(Isolate* isolate, BuiltinArguments args,
PropertyFilter filter) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Handle<JSReceiver> receiver;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, receiver,
Object::ToObject(isolate, object));
Handle<FixedArray> keys;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, keys,
KeyAccumulator::GetKeys(receiver, KeyCollectionMode::kOwnOnly, filter,
GetKeysConversion::kConvertToString));
return *isolate->factory()->NewJSArrayWithElements(keys);
}
} // namespace
// ES6 section 19.1.2.8 Object.getOwnPropertySymbols ( O )
BUILTIN(ObjectGetOwnPropertySymbols) {
return GetOwnPropertyKeys(isolate, args, SKIP_STRINGS);
}
// ES6 section 19.1.2.11 Object.isExtensible ( O )
BUILTIN(ObjectIsExtensible) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Maybe<bool> result =
object->IsJSReceiver()
? JSReceiver::IsExtensible(Handle<JSReceiver>::cast(object))
: Just(false);
MAYBE_RETURN(result, ReadOnlyRoots(isolate).exception());
return isolate->heap()->ToBoolean(result.FromJust());
}
// ES6 section 19.1.2.12 Object.isFrozen ( O )
BUILTIN(ObjectIsFrozen) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Maybe<bool> result = object->IsJSReceiver()
? JSReceiver::TestIntegrityLevel(
Handle<JSReceiver>::cast(object), FROZEN)
: Just(true);
MAYBE_RETURN(result, ReadOnlyRoots(isolate).exception());
return isolate->heap()->ToBoolean(result.FromJust());
}
// ES6 section 19.1.2.13 Object.isSealed ( O )
BUILTIN(ObjectIsSealed) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Maybe<bool> result = object->IsJSReceiver()
? JSReceiver::TestIntegrityLevel(
Handle<JSReceiver>::cast(object), SEALED)
: Just(true);
MAYBE_RETURN(result, ReadOnlyRoots(isolate).exception());
return isolate->heap()->ToBoolean(result.FromJust());
}
BUILTIN(ObjectGetOwnPropertyDescriptors) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
Handle<JSReceiver> receiver;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, receiver,
Object::ToObject(isolate, object));
Handle<FixedArray> keys;
ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
isolate, keys, KeyAccumulator::GetKeys(
receiver, KeyCollectionMode::kOwnOnly, ALL_PROPERTIES,
GetKeysConversion::kConvertToString));
Handle<JSObject> descriptors =
isolate->factory()->NewJSObject(isolate->object_function());
for (int i = 0; i < keys->length(); ++i) {
Handle<Name> key = Handle<Name>::cast(FixedArray::get(*keys, i, isolate));
PropertyDescriptor descriptor;
Maybe<bool> did_get_descriptor = JSReceiver::GetOwnPropertyDescriptor(
isolate, receiver, key, &descriptor);
MAYBE_RETURN(did_get_descriptor, ReadOnlyRoots(isolate).exception());
if (!did_get_descriptor.FromJust()) continue;
Handle<Object> from_descriptor = descriptor.ToObject(isolate);
Maybe<bool> success = JSReceiver::CreateDataProperty(
isolate, descriptors, key, from_descriptor, Just(kDontThrow));
CHECK(success.FromJust());
}
return *descriptors;
}
// ES6 section 19.1.2.15 Object.preventExtensions ( O )
BUILTIN(ObjectPreventExtensions) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
if (object->IsJSReceiver()) {
MAYBE_RETURN(JSReceiver::PreventExtensions(Handle<JSReceiver>::cast(object),
kThrowOnError),
ReadOnlyRoots(isolate).exception());
}
return *object;
}
// ES6 section 19.1.2.17 Object.seal ( O )
BUILTIN(ObjectSeal) {
HandleScope scope(isolate);
Handle<Object> object = args.atOrUndefined(isolate, 1);
if (object->IsJSReceiver()) {
MAYBE_RETURN(JSReceiver::SetIntegrityLevel(Handle<JSReceiver>::cast(object),
SEALED, kThrowOnError),
ReadOnlyRoots(isolate).exception());
}
return *object;
}
} // namespace internal
} // namespace v8
```
|
Thomas Buergenthal (11 May 1934 – 29 May 2023) was a Czechoslovak-born American international lawyer, scholar, law school dean, and judge of the International Court of Justice (ICJ). He resigned his ICJ post as of 6 September 2010 and returned to his position at The George Washington University Law School where he was the Lobingier Professor Emeritus of Comparative Law and Jurisprudence.
Early life
Thomas Buergenthal was known as one of the youngest holocaust victims to survive places like Auschwitz and Sachsenhausen, which were concentration camps. The first 11 years of his life were spent under German authority. It is known that when the Germans were pushed out by the Soviet army in January 1945, the Germans forced the victims out by marching them; it was a long journey, people began to get tired and if they stopped they were executed. Buergenthal was one of the few children to survive the three day march to Sachsenhausen, where Buergenthal would soon be liberated. His mother was liberated from a different concentration camp around the same time, though they did not find each other until 1946. His father was killed shortly before liberation in yet another camp. Buergenthal, born to German-Jewish/Polish-Jewish parents who had moved from Germany to Czechoslovakia in 1933, grew up in the Jewish ghetto of Kielce (Poland) and later in the concentration camps at Auschwitz and Sachsenhausen. After the War he lived with his mother in Göttingen.
On 4 December 1951, he emigrated from Germany to the United States. He studied at Bethany College in West Virginia (graduated 1957), and received his J.D. at New York University Law School in 1960, and his LL.M. and S.J.D. degrees in international law from Harvard Law School. Judge Buergenthal is the recipient of numerous honorary degrees from American, European and Latin American Universities, including the University of Heidelberg in Germany, the Free University of Brussels in Belgium, the State University of New York, the American University, the University of Minnesota, and the George Washington University.
Career
Buergenthal was a specialist in international law and human rights law.
Buergenthal served as a judge on the International Court of Justice at The Hague from 2 March 2000 to his resignation on 6 September 2010. Prior to his election to the International Court of Justice, he was the Lobingier Professor of Comparative Law and Jurisprudence at The George Washington University Law School. He was Dean of Washington College of Law of American University from 1980 to 1985, and held endowed professorships at the University of Texas, SUNY/Buffalo Law School, and Emory University. While at Emory, he was the director of the Human Rights Program of the Carter Center. Buergenthal served as a judge for many years, including lengthy periods on various specialized international bodies. Between 1979 and 1991, he served as a judge of the Inter-American Court of Human Rights, including a term as that court's president; from 1989 to 1994, he was a judge on the Inter-American Development Bank's Administrative Tribunal; in 1992 and 1993, he served on the United Nations Truth Commission for El Salvador; and from 1995 to 1999, he was a member of the United Nations Human Rights Committee.
Buergenthal was the author of more than a dozen books and a large number of articles on international law, human rights and comparative law subjects. He was member of a number of editorial boards of law journals, including the American Journal of International Law. He also served as a member of the Ethics Commission of the International Olympic Committee.
Buergenthal was the sole dissenter in the Israeli Wall advisory opinion in July 2004, where the ICJ found 14-1 that the Israeli-built barrier into the occupied West Bank violated international law and should be torn down.
Judge Buergenthal was a co-recipient of the 2008 Gruber Prize for Justice for his contributions to the promotion and protection of human rights in different parts of the world, and particularly in Latin America. He was also a recipient of the following awards: Goler T. Butcher Medal, American Society of International Law, 1997; Manley O. Hudson Medal, American Society of International Law, 2002; Elie Wiesel Award, U.S. Holocaust Memorial Council, 2015; and Olympic Order, International Olympic Committee, 2015.
Buergenthal strongly supported the creation of the International Nuremberg Principles Academy in Nuremberg, Germany, and became the first President of its Advisory Council in 2014. From 2016 until his death in 2023, he served as its Honorary President.
His memoir, A Lucky Child, which describes his experience in various German concentration camps, has been translated into more than a dozen languages, including German, French, Spanish, Japanese, Dutch, Norwegian and Swedish.
Death
Buergenthal died on 29 May 2023, at the age of 89.
Selected works
Vol. 2 Vol. 3
, Thomas, Shelton, Stewart, 4th ed. (2009)
, 5th ed. (2013), 4th ed. (2007)
Lectures
A Brief History of International Human Rights Law in the Lecture Series of the United Nations Audiovisual Library of International Law
"The Lawmaking Role of International Tribunals," Dean Fred F. Herzog Memorial Lecture, 17 October 2011, The John Marshall Law School, Chicago, Illinois.
References
External links
ICJ Biography of Thomas Buergenthal
Biographical Interview with Thomas Buergenthal published at "Quellen zur Geschichte der Menschenrechte"
A Lucky Child: A Memoir of Surviving Auschwitz as a Young Boy Interview with Thomas Buergenthal
1934 births
2023 deaths
Auschwitz concentration camp survivors
Bethany College (West Virginia) alumni
Czechoslovak Jews
Harvard Law School alumni
Inter-American Court of Human Rights judges
International Court of Justice judges
International law scholars
Jewish American writers
Nazi-era ghetto inmates
New York University School of Law alumni
People from Ružomberok District
Sachsenhausen concentration camp survivors
Slovak expatriates in Poland
United Nations Human Rights Committee members
Commanders Crosses of the Order of Merit of the Federal Republic of Germany
American judges of United Nations courts and tribunals
American judges of international courts and tribunals
21st-century American Jews
Members of the Institut de Droit International
|
```hack
/*
*/
/*
* This file is part of Scylla.
*
* Scylla is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* Scylla is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with Scylla. If not, see <path_to_url
*/
#pragma once
#include "utils/fragment_range.hh"
namespace imr {
/// No-op deserialisation context
///
/// This is a dummy deserialisation context to be used when there is no need
/// for one, but the interface expects a context object.
static const struct no_context_t {
template<typename Tag, typename... Args>
const no_context_t& context_for(Args&&...) const noexcept { return *this; }
} no_context;
struct no_op_continuation {
template<typename T>
static T run(T value) noexcept {
return value;
}
};
template<typename T>
class placeholder {
uint8_t* _pointer = nullptr;
public:
placeholder() = default;
explicit placeholder(uint8_t* ptr) noexcept : _pointer(ptr) { }
void set_pointer(uint8_t* ptr) noexcept { _pointer = ptr; }
template<typename... Args>
void serialize(Args&&... args) noexcept {
if (!_pointer) {
// We lose the information whether we are in the sizing or
// serializing phase, hence the need for this run-time check.
return;
}
T::serialize(_pointer, std::forward<Args>(args)...);
}
};
}
```
|
American Lithuanian Cultural Archives or ALKA () is located at 37 Mary Crest Drive in Putnam, Connecticut next to the convent of the Sisters of the Immaculate Conception of the Blessed Virgin Mary. It is dedicated to the preservation of Lithuanian culture in the United States. ALKA comprises a museum, a library and the archives. It is maintained by the Lithuanian Catholic Academy of Science.
History
The history of ALKA is traced to 1922 when Catholic priest Pranciškus Mykolas Juras (Francis M. Juras) began collecting Lithuanian books and periodicals at his parish in Lawrence, Massachusetts. He also collected Lithuanian art and crafts, including samples of weaving and knitting, national folk costumes, jewelry, wood carvings, and various implements and utensils. As the collection grew, it moved to the offices of the newspaper Darbininkas in South Boston in 1935. ALKA was officially established in 1941. When the newspaper moved to Brooklyn in 1951, the collection temporarily moved to a garage of the Lithuanian convent in Brockton, Massachusetts. In 1963, using his personal funds, Juras built a small house in Putnam, CT and moved his collection there. In 1973, Juras officially sold his collection for the symbolic $1 to the Lithuanian Catholic Academy of Science and ALKA became its subsidiary. The collection continued to grow and it became necessary to expand its modest premises. In 1978–1981, an extension with a basement was built bringing the total area to .
Collections
Museum
The ALKA museum houses artwork by over 40 Lithuanian American artists, including Adomas Galdikas, Adomas Varnas, Kazys Varnelis, Viktoras Vizgirda, Romas Viesulas, Vytautas Ignas, Jadvyga Paukštienė, Antanas Petrikonis, Bronius Murinas and Vytautas Kasiulis; collections of wood carvings by Končius, Motuza and others; old photographs of significant events in American Lithuanian history; medals of societies dating from the second half of the 19th century; textiles with Lithuanian designs; several items exhibited in the Lithuanian pavilion at the 1939 New York World's Fair, including sculptures by Robertas Antinis and Vytautas Kašuba as well as artwork by Mstislav Dobuzhinsky, Petras Kalpokas, Adomas Smetona, and Adomas Galdikas.
Library
The ALKA library contains over 30,000 books about topics of interest to Lithuanians, or written by Lithuanians; over 1,000 Lithuanian periodicals dating from 1883 to the present; old and rare books (the oldest being Tabellen zur Übersicht der Geschichte aller europäischen Länder und Staaten by C. Kruse, published in 1802); calendars dating from the late 19th century to the present; prayerbooks dating from 1859 to the present (some with dedications). In 2012, the library joined LIBIS (Lithuanian Integral Information System of Libraries).
Archives
The ALKA archives contain over 300 collections of manuscripts, letters and other documents. Collections include, among others, those of composers Jeronimas Kačinskas, Julius Gaidelis and Vytautas Marijošius, poet Faustas Kirša, priest Stasys Yla. The archive also preserves documents of various organizations, including Supreme Committee for the Liberation of Lithuania (VLIK), United Lithuanian Relief Fund of America (BALF), Lithuanian Foundation, Knights of Lithuania, Ateitis Federation, American Professional Partnership for Lithuanian Education (APPLE), Lithuanian Consulate in New York, various Lithuanian societies from the end of the 19th century. Professional archivists from Lithuania help ALKA to categorize and describe the various archives. For example, in 2014–2015, the archivists cataloged 124 boxes of documents from BALF.
Leaders
ALKA was chaired by:
Alfonsas Stankaitis (1973–1984)
Juozas Kriaučiūnas (1984–2000)
Juozas Rygelis (2000–2010)
Mirga Girniuvienė (since May 2010)
References
External links
Official ALKA site
Archives in the United States
Putnam, Connecticut
Non-profit organizations based in Connecticut
Lithuanian-American culture
Lithuanian-American history
|
```go
package util
import (
"io"
"regexp"
)
const ansi = "[\u001B\u009B][[\\]()#;?]*(?:(?:(?:[a-zA-Z\\d]*(?:;[a-zA-Z\\d]*)*)?\u0007)|(?:(?:\\d{1,4}(?:;\\d{0,4})*)?[\\dA-PRZcf-ntqry=><~]))"
// regexp matches ansi characters getting from a shell output, used for colors etc.
var ansiReg = regexp.MustCompile(ansi)
// TrapWriter intercepts any messages matching `reg` received from the `writer` output, but passes all others.
// Used when necessary to filter logs from terraform.
type TrapWriter struct {
writer io.Writer
reg *regexp.Regexp
trappedMsgs []string
}
// NewTrapWriter returns a new TrapWriter instance.
func NewTrapWriter(writer io.Writer, reg *regexp.Regexp) *TrapWriter {
return &TrapWriter{
writer: writer,
reg: reg,
}
}
// Msgs returns the intercepted messages.
func (trap *TrapWriter) Msgs() []string {
return trap.trappedMsgs
}
// Clear clears all intercepted messages.
func (trap *TrapWriter) Clear() {
trap.trappedMsgs = nil
}
// Write implements `io.Writer` interface.
func (trap *TrapWriter) Write(msg []byte) (int, error) {
msgWithoutAnsi := ansiReg.ReplaceAll(msg, []byte(""))
if trap.reg.Match(msgWithoutAnsi) {
trap.trappedMsgs = append(trap.trappedMsgs, string(msg))
return len(msg), nil
}
return trap.writer.Write(msg)
}
```
|
```c
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
/*
* The following is auto-generated. Do not manually edit. See scripts/loops.js.
*/
#include "stdlib/ndarray/base/assign/u_d.h"
#include "stdlib/ndarray/base/assign/typedefs.h"
#include "stdlib/ndarray/base/assign/macros.h"
#include "stdlib/ndarray/base/assign/dispatch_object.h"
#include "stdlib/ndarray/base/assign/dispatch.h"
#include "stdlib/ndarray/ctor.h"
#include <stdint.h>
/**
* Assigns elements in a zero-dimensional input ndarray to elements in a zero-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 0;
*
* // Define the array shapes:
* int64_t shape[] = {};
*
* // Define the strides:
* int64_t sx[] = { 0 };
* int64_t sy[] = { 0 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_0d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_0d( struct ndarray *arrays[], void *data ) {
uint32_t v;
int8_t status = stdlib_ndarray_iget_uint32( arrays[ 0 ], 0, &v );
if ( status != 0 ) {
return -1;
}
status = stdlib_ndarray_iset_float64( arrays[ 1 ], 0, (double)v );
if ( status != 0 ) {
return -1;
}
return 0;
}
/**
* Assigns elements in a one-dimensional input ndarray to elements in a one-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 1;
*
* // Define the array shapes:
* int64_t shape[] = { 3 };
*
* // Define the strides:
* int64_t sx[] = { 4 };
* int64_t sy[] = { 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_1d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_1d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_1D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a two-dimensional input ndarray to elements in a two-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 4 };
* int64_t sy[] = { 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_2d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_2d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_2D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a two-dimensional input ndarray to elements in a two-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 4 };
* int64_t sy[] = { 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_2d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_2d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_2D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a three-dimensional input ndarray to elements in a three-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 16, 8, 4 };
* int64_t sy[] = { 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_3d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_3d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_3D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a three-dimensional input ndarray to elements in a three-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 16, 8, 4 };
* int64_t sy[] = { 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_3d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_3d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_3D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a four-dimensional input ndarray to elements in a four-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 4;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 16, 8, 4 };
* int64_t sy[] = { 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_4d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_4d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_4D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a four-dimensional input ndarray to elements in a four-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 4;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 16, 8, 4 };
* int64_t sy[] = { 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_4d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_4d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_4D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a five-dimensional input ndarray to elements in a five-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 5;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_5d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_5d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_5D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a five-dimensional input ndarray to elements in a five-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 5;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_5d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_5d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_5D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a six-dimensional input ndarray to elements in a six-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 6;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_6d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_6d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_6D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a six-dimensional input ndarray to elements in a six-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 6;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_6d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_6d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_6D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a seven-dimensional input ndarray to elements in a seven-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 7;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_7d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_7d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_7D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a seven-dimensional input ndarray to elements in a seven-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 7;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_7d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_7d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_7D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in an eight-dimensional input ndarray to elements in an eight-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 8;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_8d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_8d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_8D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in an eight-dimensional input ndarray to elements in an eight-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 8;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_8d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_8d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_8D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a nine-dimensional input ndarray to elements in a nine-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 9;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_9d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_9d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_9D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a nine-dimensional input ndarray to elements in a nine-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 9;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_9d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_9d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_9D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a ten-dimensional input ndarray to elements in a ten-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 10;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_10d( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_10d( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_10D_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in a ten-dimensional input ndarray to elements in a ten-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 10;
*
* // Define the array shapes:
* int64_t shape[] = { 1, 1, 1, 1, 1, 1, 1, 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 32, 32, 32, 32, 32, 32, 32, 16, 8, 4 };
* int64_t sy[] = { 64, 64, 64, 64, 64, 64, 64, 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_10d_blocked( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_10d_blocked( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_10D_BLOCKED_LOOP_CAST( uint32_t, double )
return 0;
}
/**
* Assigns elements in an n-dimensional input ndarray to elements in an n-dimensional output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 3;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 16, 8, 4 };
* int64_t sy[] = { 32, 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d_nd( arrays, NULL );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d_nd( struct ndarray *arrays[], void *data ) {
STDLIB_NDARRAY_ASSIGN_ND_LOOP_CAST( uint32_t, double )
return 0;
}
// Define a list of unary ndarray functions:
static ndarrayUnaryAssignFcn functions[] = {
stdlib_ndarray_assign_u_d_0d,
stdlib_ndarray_assign_u_d_1d,
stdlib_ndarray_assign_u_d_2d,
stdlib_ndarray_assign_u_d_3d,
stdlib_ndarray_assign_u_d_4d,
stdlib_ndarray_assign_u_d_5d,
stdlib_ndarray_assign_u_d_6d,
stdlib_ndarray_assign_u_d_7d,
stdlib_ndarray_assign_u_d_8d,
stdlib_ndarray_assign_u_d_9d,
stdlib_ndarray_assign_u_d_10d,
stdlib_ndarray_assign_u_d_nd
};
// Define a list of unary ndarray functions implementing loop blocking...
static ndarrayUnaryAssignFcn blocked_functions[] = {
stdlib_ndarray_assign_u_d_2d_blocked,
stdlib_ndarray_assign_u_d_3d_blocked,
stdlib_ndarray_assign_u_d_4d_blocked,
stdlib_ndarray_assign_u_d_5d_blocked,
stdlib_ndarray_assign_u_d_6d_blocked,
stdlib_ndarray_assign_u_d_7d_blocked,
stdlib_ndarray_assign_u_d_8d_blocked,
stdlib_ndarray_assign_u_d_9d_blocked,
stdlib_ndarray_assign_u_d_10d_blocked
};
// Create a unary function dispatch object:
static const struct ndarrayUnaryAssignDispatchObject obj = {
// Array containing unary ndarray functions:
functions,
// Number of unary ndarray functions:
12,
// Array containing unary ndarray functions using loop blocking:
blocked_functions,
// Number of unary ndarray functions using loop blocking:
9
};
/**
* Assigns elements in an input ndarray to elements in an output ndarray.
*
* ## Notes
*
* - If successful, the functions returns `0`; otherwise, the function returns an error code.
*
* @param arrays array whose first element is a pointer to an input ndarray and whose last element is a pointer to an output ndarray
* @return status code
*
* @example
* #include "stdlib/ndarray/base/assign/u_d.h"
* #include "stdlib/ndarray/dtypes.h"
* #include "stdlib/ndarray/index_modes.h"
* #include "stdlib/ndarray/orders.h"
* #include "stdlib/ndarray/ctor.h"
* #include <stdint.h>
* #include <stdlib.h>
* #include <stdio.h>
*
* // Define the ndarray data types:
* enum STDLIB_NDARRAY_DTYPE xdtype = STDLIB_NDARRAY_UINT32;
* enum STDLIB_NDARRAY_DTYPE ydtype = STDLIB_NDARRAY_FLOAT64;
*
* // Create underlying byte arrays:
* uint8_t xbuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
* uint8_t ybuf[] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
*
* // Define the number of dimensions:
* int64_t ndims = 2;
*
* // Define the array shapes:
* int64_t shape[] = { 2, 2 };
*
* // Define the strides:
* int64_t sx[] = { 8, 4 };
* int64_t sy[] = { 16, 8 };
*
* // Define the offsets:
* int64_t ox = 0;
* int64_t oy = 0;
*
* // Define the array order:
* enum STDLIB_NDARRAY_ORDER order = STDLIB_NDARRAY_ROW_MAJOR;
*
* // Specify the index mode:
* enum STDLIB_NDARRAY_INDEX_MODE imode = STDLIB_NDARRAY_INDEX_ERROR;
*
* // Specify the subscript index modes:
* int8_t submodes[] = { imode };
* int64_t nsubmodes = 1;
*
* // Create an input ndarray:
* struct ndarray *x = stdlib_ndarray_allocate( xdtype, xbuf, ndims, shape, sx, ox, order, imode, nsubmodes, submodes );
* if ( x == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an output ndarray:
* struct ndarray *y = stdlib_ndarray_allocate( ydtype, ybuf, ndims, shape, sy, oy, order, imode, nsubmodes, submodes );
* if ( y == NULL ) {
* fprintf( stderr, "Error allocating memory.\n" );
* exit( EXIT_FAILURE );
* }
*
* // Create an array containing the ndarrays:
* struct ndarray *arrays[] = { x, y };
*
* // Copy elements:
* int8_t status = stdlib_ndarray_assign_u_d( arrays );
* if ( status != 0 ) {
* fprintf( stderr, "Error during computation.\n" );
* exit( EXIT_FAILURE );
* }
*
* // ...
*
* // Free allocated memory:
* stdlib_ndarray_free( x );
* stdlib_ndarray_free( y );
*/
int8_t stdlib_ndarray_assign_u_d( struct ndarray *arrays[] ) {
return stdlib_ndarray_unary_assign_dispatch( &obj, arrays );
}
```
|
```python
#
# A script that will gather the non-granular experimental stats for C# files within
# the current folder
#
# Works by opening up all .cs files in the current working directory, looking
# for code that lives in the namespace with the "Experimental" word, and then
# counting the number of lines and files that satisfy that.
import os
import re
log_details = False
namespace_regex = re.compile('^namespace.*\.Experimental')
class ExperimentalStats:
def __init__(self, experimental = 0, non_experimental = 0, experimental_files = 0, non_experimental_files = 0):
self.experimental = experimental
self.non_experimental = non_experimental
self.experimental_files = experimental_files
self.non_experimental_files = non_experimental_files
def merge(self, other):
self.experimental += other.experimental
self.non_experimental += other.non_experimental
self.experimental_files += other.experimental_files
self.non_experimental_files += other.non_experimental_files
def is_experimental_namespace(line: str) -> bool:
return namespace_regex.match(line)
def is_csharp_file(filename: str) -> bool:
return filename.endswith('.cs')
def log(line: str):
if log_details:
print(line)
def get_experimental_stats(filename: str) -> ExperimentalStats:
is_experimental = False
line_count = 0
log(filename)
with open(filename, encoding="utf8", errors="ignore") as f:
for line in f:
if is_experimental_namespace(line):
is_experimental = True
log(line)
line_count+=1
log("Experimental: {0}, Line Count: {1}".format(is_experimental, line_count))
stats = ExperimentalStats()
if is_experimental:
stats.experimental = line_count
stats.experimental_files += 1
else:
stats.non_experimental = line_count
stats.non_experimental_files += 1
return stats
experimental_stats = ExperimentalStats()
for root, dirs, files in os.walk('.'):
for name in files:
if is_csharp_file(name):
experimental_stats.merge(get_experimental_stats(os.path.join(root, name)))
print('Experimental Stats')
print('Experimental files: {0}'.format(experimental_stats.experimental_files))
print('Experimental lines: {0}'.format(experimental_stats.experimental))
print('Non-Experimental files: {0}'.format(experimental_stats.non_experimental_files))
print('Non-Experimental lines: {0}'.format(experimental_stats.non_experimental))
print('Relative percent of experimental to total (by lines): {:.2%}'.format(
experimental_stats.experimental / (experimental_stats.experimental + experimental_stats.non_experimental)))
```
|
The Evelyn Hone College of Applied Arts and Commerce is the largest of the Technical Education and Vocational Training (TEVET) institutions under the Ministry of Higher Education in Zambia.
It is the third-largest institution of higher learning in the country after the University of Zambia and Copperbelt University.
Information
Originally known as the Evelyn Hone College of Further Education, the college was officially opened in October 1963, by Evelyn Dennison Hone, the last Governor of Northern Rhodesia.
The college is currently run by a management board in accordance with the provisions of the TEVET Act No. 13 of 1998.
Mission - To provide quality training in applied arts, commerce, science, and technology in order to increase the pool of highly skilled personnel, enhance their employability, and contribute to economic diversification.
Organization
Evelyn Hone College is divided into four faculties:
School of business studies
Business Administration
Human resource management
Accounting(Acca & Zica)
Public administration
Purchasing and supply
Marketing
Industrial engineering
Literature and Language
Social Work
School of Health & Sciences
physiotherapy
Radiography
Lab Tech
Biomedical science
Diagnostic and ultra sound
Biomedical engineering
Environmental Health
School of Media
Journalism and Public relations
Creative digital art
School of Education and art
Music
English
Alumni
Eddie Amkongo
George Chellah
Tresford Himanansa II
Dickson Jere
Godfrey Miyanda
Mulenga Mulenga
Henry Joe Sakala
Paul Shalala
Lily Tembo
Agnes Yombwe
References
1963 establishments in Northern Rhodesia
Educational institutions established in 1963
Universities and colleges in Zambia
|
```go
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
package aggregator
import (
"testing"
"time"
"github.com/stretchr/testify/require"
"github.com/m3db/m3/src/cluster/generated/proto/placementpb"
"github.com/m3db/m3/src/cluster/kv"
"github.com/m3db/m3/src/cluster/placement"
)
const (
testInstanceID1 = "testInstance1"
testInstanceID2 = "testInstance2"
testInstanceID3 = "testInstance3"
)
var (
testPlacementsProto = []*placementpb.Placement{
{
NumShards: 4,
CutoverTime: 0,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING},
{Id: 1, State: placementpb.ShardState_INITIALIZING},
{Id: 2, State: placementpb.ShardState_INITIALIZING},
{Id: 3, State: placementpb.ShardState_INITIALIZING},
},
},
},
},
{
NumShards: 4,
CutoverTime: 10000,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING},
{Id: 1, State: placementpb.ShardState_INITIALIZING},
},
ShardSetId: 0,
},
testInstanceID2: {
Id: testInstanceID2,
Endpoint: testInstanceID2,
Shards: []*placementpb.Shard{
{Id: 2, State: placementpb.ShardState_INITIALIZING},
{Id: 3, State: placementpb.ShardState_INITIALIZING},
},
ShardSetId: 1,
},
},
},
}
testStagedPlacementProto = &placementpb.PlacementSnapshots{
Snapshots: testPlacementsProto,
}
)
func TestPlacementManagerOpenAlreadyOpen(t *testing.T) {
mgr, _ := testPlacementManager(t)
mgr.state = placementManagerOpen
require.Equal(t, errPlacementManagerOpenOrClosed, mgr.Open())
}
func TestPlacementManagerOpenSuccess(t *testing.T) {
mgr, _ := testPlacementManager(t)
require.NoError(t, mgr.Open())
require.Equal(t, placementManagerOpen, mgr.state)
}
func TestPlacementManagerPlacementNotOpen(t *testing.T) {
mgr, _ := testPlacementManager(t)
_, err := mgr.Placement()
require.Equal(t, errPlacementManagerNotOpenOrClosed, err)
}
func TestPlacementManagerPlacement(t *testing.T) {
mgr, store := testPlacementManager(t)
require.NoError(t, mgr.Open())
// Wait for change to propagate.
_, err := store.Set(testPlacementKey, testStagedPlacementProto)
require.NoError(t, err)
var placement placement.Placement
for {
placement, err = mgr.Placement()
if err == nil {
break
}
time.Sleep(10 * time.Millisecond)
}
require.Equal(t, int64(10000), placement.CutoverNanos())
require.Equal(t, []uint32{0, 1, 2, 3}, placement.Shards())
}
func TestPlacementManagerC(t *testing.T) {
mgr, store := testPlacementManager(t)
require.NoError(t, mgr.Open())
select {
case <-mgr.C():
case <-time.After(1 * time.Second):
t.Fatal("expected placement init to propagate within deadline")
}
require.Equal(t, 0, len(mgr.C()))
// Wait for change to propagate.
_, err := store.Set(testPlacementKey, testStagedPlacementProto)
require.NoError(t, err)
select {
case <-mgr.C():
case <-time.After(1 * time.Second):
t.Fatal("expected placement update to propagate within deadline")
}
placement, err := mgr.Placement()
require.NoError(t, err)
require.Equal(t, int64(10000), placement.CutoverNanos())
require.Equal(t, []uint32{0, 1, 2, 3}, placement.Shards())
}
func TestPlacementManagerInstanceNotFound(t *testing.T) {
mgr, store := testPlacementManager(t)
require.NoError(t, mgr.Open())
// Wait for change to propagate.
_, err := store.Set(testPlacementKey, testStagedPlacementProto)
require.NoError(t, err)
for {
_, err := mgr.Instance()
if err == ErrInstanceNotFoundInPlacement {
return
}
time.Sleep(10 * time.Millisecond)
}
}
func TestPlacementManagerInstanceFound(t *testing.T) {
mgr, store := testPlacementManager(t)
mgr.instanceID = testInstanceID1
require.NoError(t, mgr.Open())
// Wait for change to propagate.
_, err := store.Set(testPlacementKey, testStagedPlacementProto)
require.NoError(t, err)
for {
instance, err := mgr.Instance()
if err == nil {
require.Equal(t, testInstanceID1, instance.ID())
require.Equal(t, uint32(0), instance.ShardSetID())
return
}
time.Sleep(10 * time.Millisecond)
}
}
// nolint: dupl
func TestPlacementHasReplacementInstance(t *testing.T) {
protos := []*placementpb.PlacementSnapshots{
{
Snapshots: []*placementpb.Placement{
{
NumShards: 4,
CutoverTime: 100,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING, CutoffNanos: 1000},
{Id: 1, State: placementpb.ShardState_INITIALIZING, CutoffNanos: 1000},
},
ShardSetId: 0,
},
testInstanceID2: {
Id: testInstanceID2,
Endpoint: testInstanceID2,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_LEAVING, CutoverNanos: 1000},
{Id: 1, State: placementpb.ShardState_LEAVING, CutoverNanos: 1000},
},
ShardSetId: 0,
},
},
},
},
},
{
Snapshots: []*placementpb.Placement{
{
NumShards: 4,
CutoverTime: 200,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
{Id: 1, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
},
ShardSetId: 0,
},
testInstanceID2: {
Id: testInstanceID2,
Endpoint: testInstanceID2,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
},
ShardSetId: 0,
},
},
},
},
},
{
Snapshots: []*placementpb.Placement{
{
NumShards: 4,
CutoverTime: 300,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
{Id: 1, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
},
ShardSetId: 0,
},
testInstanceID2: {
Id: testInstanceID2,
Endpoint: testInstanceID2,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
{Id: 1, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 800},
},
ShardSetId: 0,
},
},
},
},
},
{
Snapshots: []*placementpb.Placement{
{
NumShards: 4,
CutoverTime: 400,
Instances: map[string]*placementpb.Instance{
testInstanceID1: {
Id: testInstanceID1,
Endpoint: testInstanceID1,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
{Id: 1, State: placementpb.ShardState_LEAVING, CutoffNanos: 1000},
},
ShardSetId: 0,
},
testInstanceID2: {
Id: testInstanceID2,
Endpoint: testInstanceID2,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
{Id: 1, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
},
ShardSetId: 1,
},
testInstanceID3: {
Id: testInstanceID3,
Endpoint: testInstanceID3,
Shards: []*placementpb.Shard{
{Id: 0, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
{Id: 1, State: placementpb.ShardState_INITIALIZING, CutoverNanos: 1000},
},
ShardSetId: 0,
},
},
},
},
},
}
expected := []bool{false, false, false, true}
mgr, store := testPlacementManager(t)
mgr.instanceID = testInstanceID1
require.NoError(t, mgr.Open())
for i, proto := range protos {
_, err := store.Set(testPlacementKey, proto)
require.NoError(t, err)
for {
p, err := mgr.Placement()
if err == nil && p.CutoverNanos() == proto.Snapshots[0].CutoverTime {
res, err := mgr.HasReplacementInstance()
require.NoError(t, err)
require.Equal(t, expected[i], res)
break
}
time.Sleep(10 * time.Millisecond)
}
}
}
func TestPlacementManagerShards(t *testing.T) {
mgr, store := testPlacementManager(t)
mgr.instanceID = testInstanceID1
require.NoError(t, mgr.Open())
// Wait for change to propagate.
_, err := store.Set(testPlacementKey, testStagedPlacementProto)
require.NoError(t, err)
for {
shards, err := mgr.Shards()
if err == nil {
require.Equal(t, []uint32{0, 1}, shards.AllIDs())
return
}
time.Sleep(10 * time.Millisecond)
}
}
func TestPlacementClose(t *testing.T) {
mgr, _ := testPlacementManager(t)
require.NoError(t, mgr.Open())
require.NoError(t, mgr.Close())
require.Equal(t, placementManagerClosed, mgr.state)
}
func testPlacementManager(t *testing.T) (*placementManager, kv.Store) {
watcherOpts, store := testWatcherOptsWithPlacementProto(t, testPlacementKey, testStagedPlacementProto)
opts := NewPlacementManagerOptions().
SetInstanceID(testInstanceID).
SetWatcherOptions(watcherOpts)
placementManager := NewPlacementManager(opts).(*placementManager)
return placementManager, store
}
```
|
Linda Monia Paulette Sjöström (born 21 December 1973, in Ballingslöv) is a Swedish female dansband singer who has sung with Grönwalls, and was one of the bandmembers who in 1991 formed the band, and in 1992 won the Swedish Dansband Championships contest. She also participated at Melodifestivalen 1997 with the song "Nu i dag", ending up 11th.
In February 1999, she was appointed "best dansband voice of Sweden" in the "Får jag lov". magazine Some months later, she left Grönwalls to start a country music career with the albums "Monia", recorded in the United States, and "Söderns hjärtas ros"., albums who both entered the Swedish album chart.
In mid 2004, she returned to Grönwalls, and in 2006 she was awarded the Guldklaven award in the category "Singer of the year" during the Swedish Dansband Week in Malung.
Solo discography
Albums
2000 – Monia
2003 – Söderns hjärtas ros
Singles
1997 – Nu i dag / Burnin' For You (released as a Grönwalls single)
2003 – Rakt ut i natten / Den här sortens kärlek (released as a Monia single)
References
1973 births
Dansband singers
Living people
Swedish country singers
21st-century Swedish singers
21st-century Swedish women singers
Melodifestivalen contestants of 1997
|
```javascript
export * +
```
|
Twin Freaks is an album by Twin Freaks, a duo composed of Paul McCartney and Freelance Hellraiser (Roy Kerr), released on 13 June 2005.
History and structure
McCartney and Kerr created the double vinyl album as a continuation of Kerr's collaboration with McCartney from a 2004 tour. Kerr was known at the time for the mash-up album A Stroke of Genius, released in 2002.
Kerr performed a half-hour set prior to McCartney's 2004 gigs in which he remixed various McCartney tracks into unusual and often unrecognizable forms. Twin Freaks was the outgrowth of these manipulations.
All McCartney tracks on the album are strongly revised and reinvented in the process. Who is responsible for what aspects of the works or their reinvention is unclear.
The album was produced as a double vinyl release and a digital download in Windows Media Audio (WMA) format. The cover features a painting by McCartney, the interior artwork features paintings that are similar in tone and style to artist Willem de Kooning. McCartney knew the late artist, with whom he shared a similar painting style.
"Really Love You", backed with "Lalula", was released as a one-sided 12" single, limited to 500 copies, released on 6 June 2005. A second single, limited to 200 copies, was of "What's that You're Doing" backed with "Rinse the Raindrops".
The album was re-released as a digital download on 24 April 2012 to iTunes and Amazon.
Track listing
All songs written by Paul McCartney, except where noted.
Side one
"Really Love You" (Paul McCartney, Richard Starkey) – 5:42
"Long Haired Lady (Reprise)" (Paul McCartney, Linda McCartney) – 4:50
"Rinse the Raindrops" – 3:14
Side two
"Darkroom" – 2:30
"Live and Let Die" (Paul McCartney, Linda McCartney) – 3:26
"Temporary Secretary" – 4:12
Side three
"What's That You're Doing" (Stevie Wonder, Paul McCartney) – 4:57
"Oh Woman, Oh Why" – 4:19
"Mumbo" (Paul McCartney, Linda McCartney) – 5:24
Side four
"Lalula" – 4:25
"Coming Up" – 4:42
"Maybe I'm Amazed" – 6:12
References
External links
McCartney, Paul. Twin Freaks
2005 remix albums
Paul McCartney albums
Parlophone remix albums
Electronic remix albums
EMI Records remix albums
|
```shell
Clear bash history
Terminal based browser
Random password generator
Get to know your commands with `type`
Retrieve previous arguments
```
|
Gerardo Caccianemici may refer to:
Pope Lucius II (1144–1145)
Gerardo Caccianemici (cardinal), cardinal-deacon (1145–1155)
|
Anne Amie is an Indian playback singer and voice artist. She marked her debut in playback singing with the solo 'Ethu Meghamaari - Reprise' for the film Kochavva Paulo Ayyappa Coelho. She received her first Filmfare Award in 2019 for the song 'Aararo' from the movie Koode.
She debuted as a voice artist in malayalam cinema in 2020, dubbing for Kalyani Priyadarshan in Varane Avashyamund.
Early Life
Anne Amie started singing at the age of 7. She was awarded first prize in Kerala State CBSE Youth Festival's Light Music competition in the Sub-Junior Category in the year 2000, while she was studying at 'Bharatiya Vidya Bhavan, Thrissur'.
She did most of her schooling in Dubai, her alma mater being 'Our Own English High School, Dubai'. During this time, she was a regular at youth festivals and was awarded 'Kalathilakam' four times. She used to take part in multiple categories such as Light Music Malayalam and Hindi, Carnatic Music, Malayalam Poetry Recitation, Mappilapattu etc.
She did her BBA from Christ University, Bangalore. She was part of the University's cultural team and in her final academic year, she was the University's Cultural Secretary, leading a cultural team of over 100 students.
She did her Master's in International Business from University of Wollongong in Dubai and graduated as 'Top Graduate' of her batch. She was also a recipient of the "Dubai Academic Excellence Award", given that she had scored the highest aggregate across all the Master's Degree courses at the University.
Career
She was one of the 42 finalists in the music reality show, 'Idea Star Singer - Season 2' on Asianet. She was also one of the 7 finalists from Dubai in the music reality show, 'Indian Idol - Season 3'.
Prior to entering the film industry, she was working at the American multinational investment banking firm, Goldman Sachs, in their human capital management division. Post her post graduation, she was working at the American web services provider, Yahoo!, as a creative analyst, which is when she debuted in the playback singing field. She was juggling between both professions for almost a year until she decided to call it quits and focus on just one, i.e. her music and cinema journey.
She has worked with known music directors such as M. Jayachandran, Deepak Dev, Bijibal, Raghu Dixit, Shaan Rahman, Justin Prabhakaran, Gopi Sunder, Alphons Joseph, Ratheesh Vega, Jassie Gift, Shahabaz Aman, Afzal Yusuf, Mejo Joseph, Sushin Shyam, Hesham Abdul Wahab, Ifthi, Govind Vasantha, Vishal Chandrasekhar, Mujeeb Majeed, Neha Nair & Yakzan Gary Pereira, Arun Muraleedharan, William Francis, PS Jayhari, Mathews Pulickan, Varkey, Varun Sunil, Varun Krrishna, Rhithwik S. Chand, Ranjith Meleppat, A. R. Rakesh.
Discography
2015
2016
2017
2018
2019
2020
2021
2022
2023
Filmography
As Voice Artist
Awards
References
Sources
Singer Anne Amie talks about new songs and dubbing career at ManoramaOnline
Shaan Rahman's mentoring gave me confidence to be a playback singer at TOI
New singer in the spotlight at Deccan Chronicle
Singer Anne Amie is on a roll at Hindu
Singer Anne Amie on dubbing for Kalyani Priyadarshan in Varane Avashyamund at Hindu
Singer Anne Amie - I was offered the opportunity to dub for Kalyani in Varane Avashyamund while I was in Chennai for Filmfare Awards at TOI
Interview with singer Anne Amie on dubbing in Varane Avashyamund at ManoramaOnline
Until Next Time with Hrushee | Anne Amie - Concept Interview
Exclusive Interview with Anne Amie | Part 1/2 | Tharapakittu | Kaumudy TV
Exclusive Interview with Anne Amie | Part 2/2 | Tharapakittu | Kaumudy TV
Anne Amie on Super Women | Women's Era | ChannelD
Chat with singer Anne Amie | Manorama News
Anne Amie | Sunday Funday | Amrita TV
Anne Amie | Joseph Annamkutty Jose | Mirchi Malayalam
Filmfare Awards winners
Singers from Kerala
|
Parihar is a Rajput clan.
Further reading
References
Rajput clans
|
Mayer E. Twersky (born October 17, 1960) is an Orthodox rabbi and one of the roshei yeshiva at the Rabbi Isaac Elchanan Theological Seminary (RIETS) of Yeshiva University. He holds the Leib Merkin Distinguished Professorial Chair in Talmud and Jewish Philosophy.
Twersky is from the chassidic dynasty of Chernobyl and is the younger son of Isadore Twersky. His brother, Moshe Twersky, was murdered in the 2014 Jerusalem synagogue massacre. He is a 5th cousin of Rabbi Abraham J. Twerski. Other cousins include the Grand Rabbis of Chernobyl. He is also a grandson of Rabbi Joseph B. Soloveitchik.
Twersky attended the Maimonides School, which his grandfather founded, through high school. He then attended Harvard College, while studying Talmud privately with his grandfather. Following college, he studied for rabbinic ordination at RIETS. He eventually became a teacher in the Yeshiva University High School for Boys and later a lecturer in RIETS.
He has written articles in Hebrew for RIETS's annual Torah journal, and English articles in Tradition and in the Orthodox Union's magazine Jewish Action on subjects introducing the place of women in contemporary Orthodox Judaism.
Twersky is the Grand Rabbi of the Talne Hasidim.
As of 2011 Twersky was on the board of the website TorahWeb, which frequently publishes his short English articles.
References
Online speeches and articles
TorahWeb.org Articles by Twersky
1960 births
Living people
Harvard College alumni
American Orthodox rabbis
Rabbi Isaac Elchanan Theological Seminary semikhah recipients
Yeshiva University rosh yeshivas
20th-century American rabbis
21st-century American rabbis
Hasidic rebbes
|
```yaml
# Each section from every release note are combined when the
# CHANGELOG.rst is rendered. So the text needs to be worded so that
# it does not depend on any information only available in another
# section. This may mean repeating some details, but each section
# must be readable independently of the other.
#
# Each section note must be formatted as reStructuredText.
---
fixes:
- |
Switch to the new obfuscator where bugs such as getting an error when obfuscating `@!` and where comments on DMLs weren't being removed are fixed.
```
|
Hypothetical zeolites are combinatorial models of potential structures of the minerals known as zeolites. They are four-regular periodic graphs, with vertices representing the tetrahedral atom (usually Si or Al) and the edges representing the bridging oxygen atoms. Alternatively, by ignoring the tetrahedral atoms, zeolites can be represented by a six-valent periodic graph of oxygen atoms, with each O-O edge defining an edge of a tetrahedron.
At present there are millions of hypothetical zeolite frameworks known. For any fixed number of vertices, these are a small fraction of possible 4-regular periodic graphs, because the geometric constraints imposed by the chemistry of zeolites rules out most possibilities.
Enumeration methods
There are several methods for enumerating zeolite frameworks. The method of Earl et al. uses simulated annealing to arrange a fixed number of tetrahedral atoms under periodic symmetry constraints. The method of Treacy and Rivin uses combinatorial enumeration to identify four-valent graphs under fixed symmetry and fixed number of tetrahedral atoms. This is then followed by a simulated annealing embedding of the candidate graph into the 3-dimensional torus. Ockwig et al. tile polyhedra to fill space and generate four-valent graphs.
Open questions
There many open questions, among them:
Why there is such a large discrepancy between the number of hypothetical zeolites and the number of zeolite frameworks observed in nature?
Can the pore structure of a hypothetical zeolite be predicted only from its periodic graph?
References
External links
Atlas of Prospective Zeolite Structures
Zeolite Project as ASU/Temple
Zeolites
|
```javascript
Test Matchers
Setup and Teardown
Partial Matching using `jasmine.objectContaining`
Mocking JavaScript Timeout functions
Test Spy Objects
```
|
```c++
//
// (See accompanying file LICENSE_1_0.txt or copy at
// path_to_url
//
// *Preprocessed* version of the main "list.hpp" header
// -- DO NOT modify by hand!
namespace boost { namespace mpl {
template<
typename T0 = na, typename T1 = na, typename T2 = na, typename T3 = na
, typename T4 = na, typename T5 = na, typename T6 = na, typename T7 = na
, typename T8 = na, typename T9 = na, typename T10 = na, typename T11 = na
, typename T12 = na, typename T13 = na, typename T14 = na
, typename T15 = na, typename T16 = na, typename T17 = na
, typename T18 = na, typename T19 = na
>
struct list;
template<
>
struct list<
na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list0< >
{
typedef list0< >::type type;
};
template<
typename T0
>
struct list<
T0, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list1<T0>
{
typedef typename list1<T0>::type type;
};
template<
typename T0, typename T1
>
struct list<
T0, T1, na, na, na, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list2< T0,T1 >
{
typedef typename list2< T0,T1 >::type type;
};
template<
typename T0, typename T1, typename T2
>
struct list<
T0, T1, T2, na, na, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list3< T0,T1,T2 >
{
typedef typename list3< T0,T1,T2 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3
>
struct list<
T0, T1, T2, T3, na, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list4< T0,T1,T2,T3 >
{
typedef typename list4< T0,T1,T2,T3 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
>
struct list<
T0, T1, T2, T3, T4, na, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list5< T0,T1,T2,T3,T4 >
{
typedef typename list5< T0,T1,T2,T3,T4 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5
>
struct list<
T0, T1, T2, T3, T4, T5, na, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list6< T0,T1,T2,T3,T4,T5 >
{
typedef typename list6< T0,T1,T2,T3,T4,T5 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6
>
struct list<
T0, T1, T2, T3, T4, T5, T6, na, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list7< T0,T1,T2,T3,T4,T5,T6 >
{
typedef typename list7< T0,T1,T2,T3,T4,T5,T6 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, na, na, na, na, na, na, na, na, na
, na, na, na
>
: list8< T0,T1,T2,T3,T4,T5,T6,T7 >
{
typedef typename list8< T0,T1,T2,T3,T4,T5,T6,T7 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, na, na, na, na, na, na, na, na
, na, na, na
>
: list9< T0,T1,T2,T3,T4,T5,T6,T7,T8 >
{
typedef typename list9< T0,T1,T2,T3,T4,T5,T6,T7,T8 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, na, na, na, na, na, na, na
, na, na, na
>
: list10< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9 >
{
typedef typename list10< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, na, na, na, na, na, na
, na, na, na
>
: list11< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10 >
{
typedef typename list11< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, na, na, na, na
, na, na, na, na
>
: list12< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11 >
{
typedef typename list12< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, na, na, na
, na, na, na, na
>
: list13< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12 >
{
typedef typename list13< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, na, na
, na, na, na, na
>
: list14< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13 >
{
typedef typename list14< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, na
, na, na, na, na
>
: list15<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
>
{
typedef typename list15< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
, typename T15
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, na, na, na, na
>
: list16<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15
>
{
typedef typename list16< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
, typename T15, typename T16
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, na, na, na
>
: list17<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16
>
{
typedef typename list17< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
, typename T15, typename T16, typename T17
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, T17, na, na
>
: list18<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, T17
>
{
typedef typename list18< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17 >::type type;
};
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
, typename T15, typename T16, typename T17, typename T18
>
struct list<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, T17, T18, na
>
: list19<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, T17, T18
>
{
typedef typename list19< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18 >::type type;
};
/// primary template (not a specialization!)
template<
typename T0, typename T1, typename T2, typename T3, typename T4
, typename T5, typename T6, typename T7, typename T8, typename T9
, typename T10, typename T11, typename T12, typename T13, typename T14
, typename T15, typename T16, typename T17, typename T18, typename T19
>
struct list
: list20<
T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14
, T15, T16, T17, T18, T19
>
{
typedef typename list20< T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14,T15,T16,T17,T18,T19 >::type type;
};
}}
```
|
"Kan man älska nå'n på avstånd" is a song written by Karin Hemmingsson and Tommy Andersson, and recorded by Swedish dansband Vikingarna on the band's album Kramgoa låtar 1998 from the within the album title mentioned year. The song was originally played at Ragnar Dahlberg's TV program "På turné" on 1 July 1998. Vikingarna also performed the song at Leif "Loket" Olsson's TV program "Bingolotto" that year.
The song lyrics deals with loving someone at a long distance, between two places where a car travel lasts several ours.
Charts
The song was on the EP "Premiär", peaking at 35th place at the Swedish single chart. The song was at Svensktoppen during the years of 1998 and 1999, peaking during the 25 first times. On 8 August 1998 the song, debuting, directly topped the chart. On 30 January 1999 the song had been kicked down to the second place. On 24 April 1999, the song had been knocked out from the chart.
Other recordings
Vikingarna also recorded the song with lyrics in German, as "Kuschel dich in meine Arme".
At Så mycket bättre 2018, the song was performed by Albin Lee Meldau, accompanied by the guitar played by himself.
Charts
Vikingarna
Albin Lee Meldau
References
External links
Svenska tonsättares internationella musikbyrå 1 November 2006 - Karin Hemmingsson: textskrivandet läker
1998 songs
Swedish songs
Swedish-language songs
Vikingarna (band) songs
|
```m4sugar
# ===========================================================================
# path_to_url
# ===========================================================================
#
# SYNOPSIS
#
# AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional])
#
# DESCRIPTION
#
# Check for baseline language coverage in the compiler for the specified
# version of the C++ standard. If necessary, add switches to CXX and
# CXXCPP to enable support. VERSION may be '11' (for the C++11 standard)
# or '14' (for the C++14 standard).
#
# The second argument, if specified, indicates whether you insist on an
# extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g.
# -std=c++11). If neither is specified, you get whatever works, with
# preference for an extended mode.
#
# The third argument, if specified 'mandatory' or if left unspecified,
# indicates that baseline support for the specified C++ standard is
# required and that the macro should error out if no mode with that
# support is found. If specified 'optional', then configuration proceeds
# regardless, after defining HAVE_CXX${VERSION} if and only if a
# supporting mode is found.
#
# LICENSE
#
#
# Copying and distribution of this file, with or without modification, are
# permitted in any medium without royalty provided the copyright notice
# and this notice are preserved. This file is offered as-is, without any
# warranty.
#serial 4
dnl This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro
dnl (serial version number 13).
AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl
m4_if([$1], [11], [],
[$1], [14], [],
[$1], [17], [m4_fatal([support for C++17 not yet implemented in AX_CXX_COMPILE_STDCXX])],
[m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl
m4_if([$2], [], [],
[$2], [ext], [],
[$2], [noext], [],
[m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl
m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true],
[$3], [mandatory], [ax_cxx_compile_cxx$1_required=true],
[$3], [optional], [ax_cxx_compile_cxx$1_required=false],
[m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])])
AC_LANG_PUSH([C++])dnl
ac_success=no
AC_CACHE_CHECK(whether $CXX supports C++$1 features by default,
ax_cv_cxx_compile_cxx$1,
[AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
[ax_cv_cxx_compile_cxx$1=yes],
[ax_cv_cxx_compile_cxx$1=no])])
if test x$ax_cv_cxx_compile_cxx$1 = xyes; then
ac_success=yes
fi
m4_if([$2], [noext], [], [dnl
if test x$ac_success = xno; then
for switch in -std=gnu++$1 -std=gnu++0x; do
cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
$cachevar,
[ac_save_CXX="$CXX"
CXX="$CXX $switch"
AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
[eval $cachevar=yes],
[eval $cachevar=no])
CXX="$ac_save_CXX"])
if eval test x\$$cachevar = xyes; then
CXX="$CXX $switch"
if test -n "$CXXCPP" ; then
CXXCPP="$CXXCPP $switch"
fi
ac_success=yes
break
fi
done
fi])
m4_if([$2], [ext], [], [dnl
if test x$ac_success = xno; then
dnl HP's aCC needs +std=c++11 according to:
dnl path_to_url
dnl Cray's crayCC needs "-h std=c++11"
for switch in -std=c++$1 -std=c++0x +std=c++$1 "-h std=c++$1"; do
cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
$cachevar,
[ac_save_CXX="$CXX"
CXX="$CXX $switch"
AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
[eval $cachevar=yes],
[eval $cachevar=no])
CXX="$ac_save_CXX"])
if eval test x\$$cachevar = xyes; then
CXX="$CXX $switch"
if test -n "$CXXCPP" ; then
CXXCPP="$CXXCPP $switch"
fi
ac_success=yes
break
fi
done
fi])
AC_LANG_POP([C++])
if test x$ax_cxx_compile_cxx$1_required = xtrue; then
if test x$ac_success = xno; then
AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.])
fi
fi
if test x$ac_success = xno; then
HAVE_CXX$1=0
AC_MSG_NOTICE([No compiler with C++$1 support was found])
else
HAVE_CXX$1=1
AC_DEFINE(HAVE_CXX$1,1,
[define if the compiler supports basic C++$1 syntax])
fi
AC_SUBST(HAVE_CXX$1)
])
dnl Test body for checking C++11 support
m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11],
_AX_CXX_COMPILE_STDCXX_testbody_new_in_11
)
dnl Test body for checking C++14 support
m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14],
_AX_CXX_COMPILE_STDCXX_testbody_new_in_11
_AX_CXX_COMPILE_STDCXX_testbody_new_in_14
)
dnl Tests for new features in C++11
m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[
// If the compiler admits that it is not ready for C++11, why torture it?
// Hopefully, this will speed up the test.
#ifndef __cplusplus
#error "This is not a C++ compiler"
#elif __cplusplus < 201103L
#error "This is not a C++11 compiler"
#else
namespace cxx11
{
namespace test_static_assert
{
template <typename T>
struct check
{
static_assert(sizeof(int) <= sizeof(T), "not big enough");
};
}
namespace test_final_override
{
struct Base
{
virtual void f() {}
};
struct Derived : public Base
{
virtual void f() override {}
};
}
namespace test_double_right_angle_brackets
{
template < typename T >
struct check {};
typedef check<void> single_type;
typedef check<check<void>> double_type;
typedef check<check<check<void>>> triple_type;
typedef check<check<check<check<void>>>> quadruple_type;
}
namespace test_decltype
{
int
f()
{
int a = 1;
decltype(a) b = 2;
return a + b;
}
}
namespace test_type_deduction
{
template < typename T1, typename T2 >
struct is_same
{
static const bool value = false;
};
template < typename T >
struct is_same<T, T>
{
static const bool value = true;
};
template < typename T1, typename T2 >
auto
add(T1 a1, T2 a2) -> decltype(a1 + a2)
{
return a1 + a2;
}
int
test(const int c, volatile int v)
{
static_assert(is_same<int, decltype(0)>::value == true, "");
static_assert(is_same<int, decltype(c)>::value == false, "");
static_assert(is_same<int, decltype(v)>::value == false, "");
auto ac = c;
auto av = v;
auto sumi = ac + av + 'x';
auto sumf = ac + av + 1.0;
static_assert(is_same<int, decltype(ac)>::value == true, "");
static_assert(is_same<int, decltype(av)>::value == true, "");
static_assert(is_same<int, decltype(sumi)>::value == true, "");
static_assert(is_same<int, decltype(sumf)>::value == false, "");
static_assert(is_same<int, decltype(add(c, v))>::value == true, "");
return (sumf > 0.0) ? sumi : add(c, v);
}
}
namespace test_noexcept
{
int f() { return 0; }
int g() noexcept { return 0; }
static_assert(noexcept(f()) == false, "");
static_assert(noexcept(g()) == true, "");
}
namespace test_constexpr
{
template < typename CharT >
unsigned long constexpr
strlen_c_r(const CharT *const s, const unsigned long acc) noexcept
{
return *s ? strlen_c_r(s + 1, acc + 1) : acc;
}
template < typename CharT >
unsigned long constexpr
strlen_c(const CharT *const s) noexcept
{
return strlen_c_r(s, 0UL);
}
static_assert(strlen_c("") == 0UL, "");
static_assert(strlen_c("1") == 1UL, "");
static_assert(strlen_c("example") == 7UL, "");
static_assert(strlen_c("another\0example") == 7UL, "");
}
namespace test_rvalue_references
{
template < int N >
struct answer
{
static constexpr int value = N;
};
answer<1> f(int&) { return answer<1>(); }
answer<2> f(const int&) { return answer<2>(); }
answer<3> f(int&&) { return answer<3>(); }
void
test()
{
int i = 0;
const int c = 0;
static_assert(decltype(f(i))::value == 1, "");
static_assert(decltype(f(c))::value == 2, "");
static_assert(decltype(f(0))::value == 3, "");
}
}
namespace test_uniform_initialization
{
struct test
{
static const int zero {};
static const int one {1};
};
static_assert(test::zero == 0, "");
static_assert(test::one == 1, "");
}
namespace test_lambdas
{
void
test1()
{
auto lambda1 = [](){};
auto lambda2 = lambda1;
lambda1();
lambda2();
}
int
test2()
{
auto a = [](int i, int j){ return i + j; }(1, 2);
auto b = []() -> int { return '0'; }();
auto c = [=](){ return a + b; }();
auto d = [&](){ return c; }();
auto e = [a, &b](int x) mutable {
const auto identity = [](int y){ return y; };
for (auto i = 0; i < a; ++i)
a += b--;
return x + identity(a + b);
}(0);
return a + b + c + d + e;
}
int
test3()
{
const auto nullary = [](){ return 0; };
const auto unary = [](int x){ return x; };
using nullary_t = decltype(nullary);
using unary_t = decltype(unary);
const auto higher1st = [](nullary_t f){ return f(); };
const auto higher2nd = [unary](nullary_t f1){
return [unary, f1](unary_t f2){ return f2(unary(f1())); };
};
return higher1st(nullary) + higher2nd(nullary)(unary);
}
}
namespace test_variadic_templates
{
template <int...>
struct sum;
template <int N0, int... N1toN>
struct sum<N0, N1toN...>
{
static constexpr auto value = N0 + sum<N1toN...>::value;
};
template <>
struct sum<>
{
static constexpr auto value = 0;
};
static_assert(sum<>::value == 0, "");
static_assert(sum<1>::value == 1, "");
static_assert(sum<23>::value == 23, "");
static_assert(sum<1, 2>::value == 3, "");
static_assert(sum<5, 5, 11>::value == 21, "");
static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, "");
}
// path_to_url
// Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function
// because of this.
namespace test_template_alias_sfinae
{
struct foo {};
template<typename T>
using member = typename T::member_type;
template<typename T>
void func(...) {}
template<typename T>
void func(member<T>*) {}
void test();
void test() { func<foo>(0); }
}
} // namespace cxx11
#endif // __cplusplus >= 201103L
]])
dnl Tests for new features in C++14
m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[
// If the compiler admits that it is not ready for C++14, why torture it?
// Hopefully, this will speed up the test.
#ifndef __cplusplus
#error "This is not a C++ compiler"
#elif __cplusplus < 201402L
#error "This is not a C++14 compiler"
#else
namespace cxx14
{
namespace test_polymorphic_lambdas
{
int
test()
{
const auto lambda = [](auto&&... args){
const auto istiny = [](auto x){
return (sizeof(x) == 1UL) ? 1 : 0;
};
const int aretiny[] = { istiny(args)... };
return aretiny[0];
};
return lambda(1, 1L, 1.0f, '1');
}
}
namespace test_binary_literals
{
constexpr auto ivii = 0b0000000000101010;
static_assert(ivii == 42, "wrong value");
}
namespace test_generalized_constexpr
{
template < typename CharT >
constexpr unsigned long
strlen_c(const CharT *const s) noexcept
{
auto length = 0UL;
for (auto p = s; *p; ++p)
++length;
return length;
}
static_assert(strlen_c("") == 0UL, "");
static_assert(strlen_c("x") == 1UL, "");
static_assert(strlen_c("test") == 4UL, "");
static_assert(strlen_c("another\0test") == 7UL, "");
}
namespace test_lambda_init_capture
{
int
test()
{
auto x = 0;
const auto lambda1 = [a = x](int b){ return a + b; };
const auto lambda2 = [a = lambda1(x)](){ return a; };
return lambda2();
}
}
namespace test_digit_seperators
{
constexpr auto ten_million = 100'000'000;
static_assert(ten_million == 100000000, "");
}
namespace test_return_type_deduction
{
auto f(int& x) { return x; }
decltype(auto) g(int& x) { return x; }
template < typename T1, typename T2 >
struct is_same
{
static constexpr auto value = false;
};
template < typename T >
struct is_same<T, T>
{
static constexpr auto value = true;
};
int
test()
{
auto x = 0;
static_assert(is_same<int, decltype(f(x))>::value, "");
static_assert(is_same<int&, decltype(g(x))>::value, "");
return x;
}
}
} // namespace cxx14
#endif // __cplusplus >= 201402L
]])
```
|
State Road 29 (SR 29) is a state highway that runs north–south through Southwest Florida. A rural road, it runs mostly through uninhabited farmland in its northern half, and along wetlands in its southern half.
Route description
State Road 29 begins at an intersection with U.S. Route 41 (Tamiami Trail) in the small community of Carnestown, located just 4 miles north of Everglades City. From there, it travels north along the western edge of the Big Cypress National Preserve and the eastern edge of the Fakahatchee Strand Preserve State Forest, which the road borders until it reaches Interstate 75 (Alligator Alley) at Miles City.
North of I-75, State Road 29 borders the Florida Panther National Wildlife Refuge to the west and continues to border the Big Cypress National Preserve up to a point just south of Sunniland.
SR 29 turns west briefly and back north through the city of Immokalee, a small farming town with large migrant populations. Just north of Immokalee, SR 29 intersects with State Road 82, which travels west to Fort Myers. SR 29 continues due north through more agricultural areas until it reaches the city of LaBelle, where it runs through the city center and intersects State Road 80, a transpeninsular route connecting Fort Myers and West Palm Beach.
After crossing the Caloosahatchee River on a small drawbridge, SR 29 turns northeast and continues to its northern terminus at an intersection with US 27 (unsigned SR 25), just south of Palmdale.
History
State Road 29 was extended from Immokalee to Everglades City in the 1920s around the same time as the construction of the Tamiami Trail. Its construction was championed by Barron Collier as a land connection to Everglades City (the county seat of Collier County at the time). The route was designated State Road 164 until 1945, when it was changed to State Road 29 as part of a statewide renumbering. State Road 29 was extended from Everglades City to Chokoloskee in 1956 upon the completion of a causeway across Chokoloskee Bay
South of Immokalee, SR 29 ran alongside the now-abandoned Atlantic Coast Line Railroad Haines City Branch from Harrisburg (just south of Palmdale) to Everglades City, which was also built in the 1920s. Part of this line was once the Deep Lake Railroad, which was once owned by Barron Collier. The railroad was removed from Sunniland south to Everglades City in 1957, and the rest of it was removed in the 1980s.
Before the Florida Department of Transportation removed a large number of State Roads from its list for state control and maintenance, SR 29 continued south through the towns of Jerome, Copeland, and then meeting Everglades City just outside the Everglades National Park. Now designated County Road 29 north of Everglades City and County Road 29A south of it, the historic southern terminus of SR 29 is in Chokoloskee, on Chokoloskee Island within the National Park.
When plans were made to upgrade Alligator Alley to carry Interstate 75 in 1973, State Road 29 was not initially planned to have an interchange with the freeway due to environmental concerns. This decision was reversed in 1989 during construction of I-75 and interchange ramps were included after steps were taken to protect the endangered Florida panther.
Related routes
LaBelle truck route
State Road 29 Truck is a truck detour along South Bridge Street. It begins at the northwest corner of LaBelle Airport south of the southeast corner of SR 29 and CR 80A. SR 29 Truck also intersects CR 80A, and runs along the east side of SR 29 until it reaches SR 80 near the Old Hendry County Courthouse.
Collier County
County Road 29A is a route bypassing Immokalee to the northeast. It runs mostly southeast to northwest, and is named New Market Road.
County Road 29A begins as New Market Road East, as a straight south to north road until it approaches a local fire station on the northeast corner of an access road to Immokalee Airport, and curves to the northwest. The road serves as the headquarters for the Immokalee State Farmer's Market. At Charlotte Street New Market Road East becomes New Market Road West. The straight northwestern to southeastern pattern continues until it curves to the west and approaches the terminus at SR 29 and Westclox Road north of the city, but not before a northbound turning ramp forks off to the right.
Hendry County
County Road 29A is a short, former segment of State Road 29 in LaBelle. It runs north along North Main Street from the SR 29-80 multiplex at the Hendry County Courthouse to Park Avenue, where it turns east terminating a block later at Bridge Street(SR 29) at the foot of the drawbridge over Caloosahatchee River.
Major intersections
References
External links
Florida Route Log (SR 29)
029
029
029
029
|
Rothwell is a small village and civil parish in the district of West Lindsey in north-east Lincolnshire, England. The population of the civil parish at the 2011 census was 226. The village is situated approximately south-east from Caistor and north from Market Rasen. It is east of the Viking Way. The parish covers just over and is primarily agricultural land.
Rothwell's medieval church is dedicated to St Mary Magdalene. The Blacksmith's Arms, formerly the Nickerson Arms, was the village public house – it was situated on Hill Rise. Nickerson Seeds, owned by the EU's largest seed company Groupe Limagrain, is based in the village.
Notable People
Joseph Nickerson founder of Nickerson Seeds, after whom the village pub was named
References
External links
West Lindsey District Council
Stained glass window in the church
Villages in Lincolnshire
Civil parishes in Lincolnshire
West Lindsey District
|
```kotlin
package com.example
import com.apollographql.apollo.api.Adapter
import com.apollographql.apollo.api.CustomScalarAdapters
import com.apollographql.apollo.api.json.JsonReader
import com.apollographql.apollo.api.json.JsonWriter
class MyStringAdapter : Adapter<String> {
override fun fromJson(reader: JsonReader, customScalarAdapters: CustomScalarAdapters): String {
return reader.nextString()!!
}
override fun toJson(writer: JsonWriter, customScalarAdapters: CustomScalarAdapters, value: String) {
writer.value(value)
}
}
```
|
```ocaml
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
(* Compilation of pattern-matching *)
open Typedtree
open Lambda
val call_switcher_variant_constant :
(Location.t ->
Lambda.lambda option ->
Lambda.lambda ->
(int * (string * Lambda.lambda)) list ->
Ast_untagged_variants.switch_names option ->
Lambda.lambda)
ref
val call_switcher_variant_constr :
(Location.t ->
Lambda.lambda option ->
Lambda.lambda ->
(int * (string * Lambda.lambda)) list ->
Ast_untagged_variants.switch_names option ->
Lambda.lambda)
ref
val make_test_sequence_variant_constant :
(Lambda.lambda option ->
Lambda.lambda ->
(int * (string * Lambda.lambda)) list ->
Lambda.lambda)
ref
(* Entry points to match compiler *)
val for_function:
Location.t -> int ref option -> lambda -> (pattern * lambda) list ->
partial -> lambda
val for_trywith:
lambda -> (pattern * lambda) list -> lambda
val for_let:
Location.t -> lambda -> pattern -> lambda -> lambda
val for_multiple_match:
Location.t -> lambda list -> (pattern * lambda) list -> partial ->
lambda
val for_tupled_function:
Location.t -> Ident.t list -> (pattern list * lambda) list ->
partial -> lambda
exception Cannot_flatten
val flatten_pattern: int -> pattern -> pattern list
(* Expand stringswitch to string test tree *)
val expand_stringswitch:
Location.t -> lambda -> (string * lambda) list -> lambda option -> lambda
val inline_lazy_force : lambda -> Location.t -> lambda
(* To be set by Lam_compile *)
val names_from_construct_pattern : (pattern -> Ast_untagged_variants.switch_names option) ref
```
|
```javascript
import { test } from '../../assert';
const tick = () => Promise.resolve();
export default test({
async test({ assert, target }) {
target.innerHTML = '<custom-element name="world" answer="42" test="svelte"></custom-element>';
await tick();
/** @type {any} */
const el = target.querySelector('custom-element');
assert.htmlEqual(
el.shadowRoot.innerHTML,
`
<p>name: world</p>
<p>$$props: {"name":"world","answer":"42","test":"svelte"}</p>
<p>$$restProps: {"answer":"42","test":"svelte"}</p>
`
);
}
});
```
|
```objective-c
// Protocol Buffers - Google's data interchange format
// path_to_url
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#ifndef GOOGLE_PROTOBUF_TYPE_HANDLER_H__
#define GOOGLE_PROTOBUF_TYPE_HANDLER_H__
#include <google/protobuf/arena.h>
#include <google/protobuf/generated_message_util.h>
#include <google/protobuf/wire_format_lite_inl.h>
namespace google {
namespace protobuf {
namespace internal {
// Used for compile time type selection. MapIf::type will be TrueType if Flag is
// true and FalseType otherwise.
template<bool Flag, typename TrueType, typename FalseType>
struct MapIf;
template<typename TrueType, typename FalseType>
struct MapIf<true, TrueType, FalseType> {
typedef TrueType type;
};
template<typename TrueType, typename FalseType>
struct MapIf<false, TrueType, FalseType> {
typedef FalseType type;
};
// In proto2 Map, enum needs to be initialized to given default value, while
// other types' default value can be inferred from the type.
template <bool IsEnum, typename Type>
class MapValueInitializer {
public:
static inline void Initialize(Type& type, int default_enum_value);
};
template <typename Type>
class MapValueInitializer<true, Type> {
public:
static inline void Initialize(Type& value, int default_enum_value) {
value = static_cast<Type>(default_enum_value);
}
};
template <typename Type>
class MapValueInitializer<false, Type> {
public:
static inline void Initialize(Type& value, int default_enum_value) {}
};
template <typename Type, bool is_arena_constructable>
class MapArenaMessageCreator {
public:
// Use arena to create message if Type is arena constructable. Otherwise,
// create the message on heap.
static inline Type* CreateMessage(Arena* arena);
};
template <typename Type>
class MapArenaMessageCreator<Type, true> {
public:
static inline Type* CreateMessage(Arena* arena) {
return Arena::CreateMessage<Type>(arena);
}
};
template <typename Type>
class MapArenaMessageCreator<Type, false> {
public:
static inline Type* CreateMessage(Arena* arena) {
return Arena::Create<Type>(arena);
}
};
// Define constants for given wire field type
template <WireFormatLite::FieldType field_type, typename Type>
class MapWireFieldTypeTraits {};
#define TYPE_TRAITS(FieldType, CType, WireFormatType, IsMessage, IsEnum) \
template <typename Type> \
class MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, Type> { \
public: \
static const bool kIsMessage = IsMessage; \
static const bool kIsEnum = IsEnum; \
typedef typename MapIf<kIsMessage, Type*, CType>::type TypeOnMemory; \
typedef typename MapIf<kIsEnum, int, Type>::type MapEntryAccessorType; \
static const WireFormatLite::WireType kWireType = \
WireFormatLite::WIRETYPE_##WireFormatType; \
};
TYPE_TRAITS(MESSAGE , Type, LENGTH_DELIMITED, true, false)
TYPE_TRAITS(STRING , ArenaStringPtr, LENGTH_DELIMITED, false, false)
TYPE_TRAITS(BYTES , ArenaStringPtr , LENGTH_DELIMITED, false, false)
TYPE_TRAITS(INT64 , int64 , VARINT , false, false)
TYPE_TRAITS(UINT64 , uint64 , VARINT , false, false)
TYPE_TRAITS(INT32 , int32 , VARINT , false, false)
TYPE_TRAITS(UINT32 , uint32 , VARINT , false, false)
TYPE_TRAITS(SINT64 , int64 , VARINT , false, false)
TYPE_TRAITS(SINT32 , int32 , VARINT , false, false)
TYPE_TRAITS(ENUM , int , VARINT , false, true )
TYPE_TRAITS(DOUBLE , double , FIXED64, false, false)
TYPE_TRAITS(FLOAT , float , FIXED32, false, false)
TYPE_TRAITS(FIXED64 , uint64 , FIXED64, false, false)
TYPE_TRAITS(FIXED32 , uint32 , FIXED32, false, false)
TYPE_TRAITS(SFIXED64, int64 , FIXED64, false, false)
TYPE_TRAITS(SFIXED32, int32 , FIXED32, false, false)
TYPE_TRAITS(BOOL , bool , VARINT , false, false)
#undef TYPE_TRAITS
template <WireFormatLite::FieldType field_type, typename Type>
class MapTypeHandler {};
template <typename Type>
class MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type> {
public:
// Enum type cannot be used for MapTypeHandler::Read. Define a type which will
// replace Enum with int.
typedef typename MapWireFieldTypeTraits<WireFormatLite::TYPE_MESSAGE,
Type>::MapEntryAccessorType MapEntryAccessorType;
// Internal stored type in MapEntryLite for given wire field type.
typedef typename MapWireFieldTypeTraits<WireFormatLite::TYPE_MESSAGE,
Type>::TypeOnMemory TypeOnMemory;
// Corresponding wire type for field type.
static const WireFormatLite::WireType kWireType =
MapWireFieldTypeTraits<WireFormatLite::TYPE_MESSAGE, Type>::kWireType;
// Whether wire type is for message.
static const bool kIsMessage =
MapWireFieldTypeTraits<WireFormatLite::TYPE_MESSAGE, Type>::kIsMessage;
// Whether wire type is for enum.
static const bool kIsEnum =
MapWireFieldTypeTraits<WireFormatLite::TYPE_MESSAGE, Type>::kIsEnum;
// Functions used in parsing and serialization. ===================
static inline size_t ByteSize(const MapEntryAccessorType& value);
static inline int GetCachedSize(const MapEntryAccessorType& value);
static inline bool Read(io::CodedInputStream* input,
MapEntryAccessorType* value);
static inline void Write(int field, const MapEntryAccessorType& value,
io::CodedOutputStream* output);
static inline uint8* InternalWriteToArray(int field,
const MapEntryAccessorType& value,
bool deterministic, uint8* target);
static inline uint8* WriteToArray(int field,
const MapEntryAccessorType& value,
uint8* target);
// Functions to manipulate data on memory. ========================
static inline const Type& GetExternalReference(const Type* value);
static inline void DeleteNoArena(const Type* x);
static inline void Merge(const Type& from, Type** to, Arena* arena);
static inline void Clear(Type** value, Arena* arena);
static inline void ClearMaybeByDefaultEnum(Type** value, Arena* arena,
int default_enum_value);
static inline void Initialize(Type** x, Arena* arena);
static inline void InitializeMaybeByDefaultEnum(Type** x,
int default_enum_value,
Arena* arena);
static inline Type* EnsureMutable(Type** value, Arena* arena);
// SpaceUsedInMapEntry: Return bytes used by value in MapEntry, excluding
// those already calculate in sizeof(MapField).
static inline int SpaceUsedInMapEntry(const Type* value);
// Return bytes used by value in Map.
static inline int SpaceUsedInMap(const Type& value);
// Assign default value to given instance.
static inline void AssignDefaultValue(Type** value);
// Return default instance if value is not initialized when calling const
// reference accessor.
static inline const Type& DefaultIfNotInitialized(
const Type* value, const Type* default_value);
// Check if all required fields have values set.
static inline bool IsInitialized(Type* value);
};
#define MAP_HANDLER(FieldType) \
template <typename Type> \
class MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type> { \
public: \
typedef typename MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType \
MapEntryAccessorType; \
typedef typename MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, \
Type>::TypeOnMemory TypeOnMemory; \
static const WireFormatLite::WireType kWireType = \
MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, \
Type>::kWireType; \
static const bool kIsMessage = \
MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, \
Type>::kIsMessage; \
static const bool kIsEnum = \
MapWireFieldTypeTraits<WireFormatLite::TYPE_##FieldType, \
Type>::kIsEnum; \
static inline int ByteSize(const MapEntryAccessorType& value); \
static inline int GetCachedSize(const MapEntryAccessorType& value); \
static inline bool Read(io::CodedInputStream* input, \
MapEntryAccessorType* value); \
static inline void Write(int field, const MapEntryAccessorType& value, \
io::CodedOutputStream* output); \
static inline uint8* InternalWriteToArray( \
int field, \
const MapEntryAccessorType& value, \
bool deterministic, \
uint8* target); \
static inline uint8* WriteToArray(int field, \
const MapEntryAccessorType& value, \
uint8* target) { \
return InternalWriteToArray(field, value, false, target); \
} \
static inline const MapEntryAccessorType& GetExternalReference( \
const TypeOnMemory& value); \
static inline void DeleteNoArena(const TypeOnMemory& x); \
static inline void Merge(const MapEntryAccessorType& from, \
TypeOnMemory* to, Arena* arena); \
static inline void Clear(TypeOnMemory* value, Arena* arena); \
static inline void ClearMaybeByDefaultEnum(TypeOnMemory* value, \
Arena* arena, \
int default_enum); \
static inline int SpaceUsedInMapEntry(const TypeOnMemory& value); \
static inline int SpaceUsedInMap(const TypeOnMemory& value); \
static inline int SpaceUsedInMap(const string& value); \
static inline void AssignDefaultValue(TypeOnMemory* value); \
static inline const MapEntryAccessorType& DefaultIfNotInitialized( \
const TypeOnMemory& value, const TypeOnMemory& default_value); \
static inline bool IsInitialized(const TypeOnMemory& value); \
static void DeleteNoArena(TypeOnMemory& value); \
static inline void Initialize(TypeOnMemory* value, Arena* arena); \
static inline void InitializeMaybeByDefaultEnum(TypeOnMemory* value, \
int default_enum_value, \
Arena* arena); \
static inline MapEntryAccessorType* EnsureMutable(TypeOnMemory* value, \
Arena* arena); \
};
MAP_HANDLER(STRING)
MAP_HANDLER(BYTES)
MAP_HANDLER(INT64)
MAP_HANDLER(UINT64)
MAP_HANDLER(INT32)
MAP_HANDLER(UINT32)
MAP_HANDLER(SINT64)
MAP_HANDLER(SINT32)
MAP_HANDLER(ENUM)
MAP_HANDLER(DOUBLE)
MAP_HANDLER(FLOAT)
MAP_HANDLER(FIXED64)
MAP_HANDLER(FIXED32)
MAP_HANDLER(SFIXED64)
MAP_HANDLER(SFIXED32)
MAP_HANDLER(BOOL)
#undef MAP_HANDLER
template <typename Type>
inline size_t
MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::ByteSize(
const MapEntryAccessorType& value) {
return WireFormatLite::MessageSizeNoVirtual(value);
}
#define GOOGLE_PROTOBUF_BYTE_SIZE(FieldType, DeclaredType) \
template <typename Type> \
inline int MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::ByteSize( \
const MapEntryAccessorType& value) { \
return WireFormatLite::DeclaredType##Size(value); \
}
GOOGLE_PROTOBUF_BYTE_SIZE(STRING, String)
GOOGLE_PROTOBUF_BYTE_SIZE(BYTES , Bytes)
GOOGLE_PROTOBUF_BYTE_SIZE(INT64 , Int64)
GOOGLE_PROTOBUF_BYTE_SIZE(UINT64, UInt64)
GOOGLE_PROTOBUF_BYTE_SIZE(INT32 , Int32)
GOOGLE_PROTOBUF_BYTE_SIZE(UINT32, UInt32)
GOOGLE_PROTOBUF_BYTE_SIZE(SINT64, SInt64)
GOOGLE_PROTOBUF_BYTE_SIZE(SINT32, SInt32)
GOOGLE_PROTOBUF_BYTE_SIZE(ENUM , Enum)
#undef GOOGLE_PROTOBUF_BYTE_SIZE
#define FIXED_BYTE_SIZE(FieldType, DeclaredType) \
template <typename Type> \
inline int MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::ByteSize( \
const MapEntryAccessorType& value) { \
return WireFormatLite::k##DeclaredType##Size; \
}
FIXED_BYTE_SIZE(DOUBLE , Double)
FIXED_BYTE_SIZE(FLOAT , Float)
FIXED_BYTE_SIZE(FIXED64 , Fixed64)
FIXED_BYTE_SIZE(FIXED32 , Fixed32)
FIXED_BYTE_SIZE(SFIXED64, SFixed64)
FIXED_BYTE_SIZE(SFIXED32, SFixed32)
FIXED_BYTE_SIZE(BOOL , Bool)
#undef FIXED_BYTE_SIZE
template <typename Type>
inline int
MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::GetCachedSize(
const MapEntryAccessorType& value) {
return WireFormatLite::LengthDelimitedSize(value.GetCachedSize());
}
#define GET_CACHED_SIZE(FieldType, DeclaredType) \
template <typename Type> \
inline int \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::GetCachedSize( \
const MapEntryAccessorType& value) { \
return WireFormatLite::DeclaredType##Size(value); \
}
GET_CACHED_SIZE(STRING, String)
GET_CACHED_SIZE(BYTES , Bytes)
GET_CACHED_SIZE(INT64 , Int64)
GET_CACHED_SIZE(UINT64, UInt64)
GET_CACHED_SIZE(INT32 , Int32)
GET_CACHED_SIZE(UINT32, UInt32)
GET_CACHED_SIZE(SINT64, SInt64)
GET_CACHED_SIZE(SINT32, SInt32)
GET_CACHED_SIZE(ENUM , Enum)
#undef GET_CACHED_SIZE
#define GET_FIXED_CACHED_SIZE(FieldType, DeclaredType) \
template <typename Type> \
inline int \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::GetCachedSize( \
const MapEntryAccessorType& value) { \
return WireFormatLite::k##DeclaredType##Size; \
}
GET_FIXED_CACHED_SIZE(DOUBLE , Double)
GET_FIXED_CACHED_SIZE(FLOAT , Float)
GET_FIXED_CACHED_SIZE(FIXED64 , Fixed64)
GET_FIXED_CACHED_SIZE(FIXED32 , Fixed32)
GET_FIXED_CACHED_SIZE(SFIXED64, SFixed64)
GET_FIXED_CACHED_SIZE(SFIXED32, SFixed32)
GET_FIXED_CACHED_SIZE(BOOL , Bool)
#undef GET_FIXED_CACHED_SIZE
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::Write(
int field, const MapEntryAccessorType& value,
io::CodedOutputStream* output) {
WireFormatLite::WriteMessageMaybeToArray(field, value, output);
}
template <typename Type>
inline uint8*
MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::InternalWriteToArray(
int field, const MapEntryAccessorType& value, bool deterministic,
uint8* target) {
return WireFormatLite::InternalWriteMessageToArray(field, value,
deterministic, target);
}
#define WRITE_METHOD(FieldType, DeclaredType) \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Write( \
int field, const MapEntryAccessorType& value, \
io::CodedOutputStream* output) { \
return WireFormatLite::Write##DeclaredType(field, value, output); \
} \
template <typename Type> \
inline uint8* \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::InternalWriteToArray( \
int field, const MapEntryAccessorType& value, bool, uint8* target) { \
return WireFormatLite::Write##DeclaredType##ToArray(field, value, target); \
}
WRITE_METHOD(STRING , String)
WRITE_METHOD(BYTES , Bytes)
WRITE_METHOD(INT64 , Int64)
WRITE_METHOD(UINT64 , UInt64)
WRITE_METHOD(INT32 , Int32)
WRITE_METHOD(UINT32 , UInt32)
WRITE_METHOD(SINT64 , SInt64)
WRITE_METHOD(SINT32 , SInt32)
WRITE_METHOD(ENUM , Enum)
WRITE_METHOD(DOUBLE , Double)
WRITE_METHOD(FLOAT , Float)
WRITE_METHOD(FIXED64 , Fixed64)
WRITE_METHOD(FIXED32 , Fixed32)
WRITE_METHOD(SFIXED64, SFixed64)
WRITE_METHOD(SFIXED32, SFixed32)
WRITE_METHOD(BOOL , Bool)
#undef WRITE_METHOD
template <typename Type>
inline bool MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::Read(
io::CodedInputStream* input, MapEntryAccessorType* value) {
return WireFormatLite::ReadMessageNoVirtual(input, value);
}
template <typename Type>
inline bool MapTypeHandler<WireFormatLite::TYPE_STRING, Type>::Read(
io::CodedInputStream* input, MapEntryAccessorType* value) {
return WireFormatLite::ReadString(input, value);
}
template <typename Type>
inline bool MapTypeHandler<WireFormatLite::TYPE_BYTES, Type>::Read(
io::CodedInputStream* input, MapEntryAccessorType* value) {
return WireFormatLite::ReadBytes(input, value);
}
#define READ_METHOD(FieldType) \
template <typename Type> \
inline bool MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Read( \
io::CodedInputStream* input, MapEntryAccessorType* value) { \
return WireFormatLite::ReadPrimitive<TypeOnMemory, \
WireFormatLite::TYPE_##FieldType>( \
input, value); \
}
READ_METHOD(INT64)
READ_METHOD(UINT64)
READ_METHOD(INT32)
READ_METHOD(UINT32)
READ_METHOD(SINT64)
READ_METHOD(SINT32)
READ_METHOD(ENUM)
READ_METHOD(DOUBLE)
READ_METHOD(FLOAT)
READ_METHOD(FIXED64)
READ_METHOD(FIXED32)
READ_METHOD(SFIXED64)
READ_METHOD(SFIXED32)
READ_METHOD(BOOL)
#undef READ_METHOD
// Definition for message handler
template <typename Type>
inline const Type&
MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::GetExternalReference(const Type* value) {
return *value;
}
template <typename Type>
inline int
MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::SpaceUsedInMapEntry(const Type* value) {
return value->SpaceUsed();
}
template <typename Type>
int MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::SpaceUsedInMap(
const Type& value) {
return value.SpaceUsed();
}
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::Clear(
Type** value, Arena* arena) {
if (*value != NULL) (*value)->Clear();
}
template <typename Type>
inline void
MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::ClearMaybeByDefaultEnum(Type** value,
Arena* arena,
int default_enum_value) {
if (*value != NULL) (*value)->Clear();
}
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::Merge(
const Type& from, Type** to, Arena* arena) {
(*to)->MergeFrom(from);
}
template <typename Type>
void MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::DeleteNoArena(
const Type* ptr) {
delete ptr;
}
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::AssignDefaultValue(Type** value) {
*value = const_cast<Type*>(&Type::default_instance());
}
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::Initialize(Type** x,
Arena* arena) {
*x = NULL;
}
template <typename Type>
inline void MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::
InitializeMaybeByDefaultEnum(Type** x, int default_enum_value,
Arena* arena) {
*x = NULL;
}
template <typename Type>
inline Type* MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::EnsureMutable(Type** value,
Arena* arena) {
if (*value == NULL) {
*value =
MapArenaMessageCreator<Type, Arena::is_arena_constructable<Type>::
type::value>::CreateMessage(arena);
}
return *value;
}
template <typename Type>
inline const Type& MapTypeHandler<WireFormatLite::TYPE_MESSAGE, Type>::
DefaultIfNotInitialized(const Type* value, const Type* default_value) {
return value != NULL ? *value : *default_value;
}
template <typename Type>
inline bool MapTypeHandler<WireFormatLite::TYPE_MESSAGE,
Type>::IsInitialized(Type* value) {
return value->IsInitialized();
}
// Definition for string/bytes handler
#define STRING_OR_BYTES_HANDLER_FUNCTIONS(FieldType) \
template <typename Type> \
inline const typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType& \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::GetExternalReference(const TypeOnMemory& value) { \
return value.Get(); \
} \
template <typename Type> \
inline int \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::SpaceUsedInMapEntry( \
const TypeOnMemory& value) { \
return sizeof(value); \
} \
template <typename Type> \
inline int MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::SpaceUsedInMap(const TypeOnMemory& value) { \
return sizeof(value); \
} \
template <typename Type> \
inline int MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::SpaceUsedInMap(const string& value) { \
return sizeof(value); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Clear( \
TypeOnMemory* value, Arena* arena) { \
value->ClearToEmpty(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), \
arena); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>:: \
ClearMaybeByDefaultEnum(TypeOnMemory* value, Arena* arena, \
int default_enum) { \
Clear(value, arena); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Merge( \
const MapEntryAccessorType& from, TypeOnMemory* to, Arena* arena) { \
to->Set(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), from, arena); \
} \
template <typename Type> \
void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::DeleteNoArena( \
TypeOnMemory& value) { \
value.DestroyNoArena(&::google::protobuf::internal::GetEmptyStringAlreadyInited()); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::AssignDefaultValue(TypeOnMemory* value) {} \
template <typename Type> \
inline void \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Initialize( \
TypeOnMemory* value, Arena* arena) { \
value->UnsafeSetDefault( \
&::google::protobuf::internal::GetEmptyStringAlreadyInited()); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>:: \
InitializeMaybeByDefaultEnum(TypeOnMemory* value, \
int default_enum_value, Arena* arena) { \
Initialize(value, arena); \
} \
template <typename Type> \
inline typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType* \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::EnsureMutable( \
TypeOnMemory* value, Arena* arena) { \
return value->Mutable(&::google::protobuf::internal::GetEmptyStringAlreadyInited(), \
arena); \
} \
template <typename Type> \
inline const typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType& \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::DefaultIfNotInitialized(const TypeOnMemory& value, \
const TypeOnMemory& \
default_value) { \
return value.Get(); \
} \
template <typename Type> \
inline bool MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::IsInitialized(const TypeOnMemory& value) { \
return true; \
}
STRING_OR_BYTES_HANDLER_FUNCTIONS(STRING)
STRING_OR_BYTES_HANDLER_FUNCTIONS(BYTES)
#undef STRING_OR_BYTES_HANDLER_FUNCTIONS
#define PRIMITIVE_HANDLER_FUNCTIONS(FieldType) \
template <typename Type> \
inline const typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType& \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::GetExternalReference(const TypeOnMemory& value) { \
return value; \
} \
template <typename Type> \
inline int \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::SpaceUsedInMapEntry( \
const TypeOnMemory& value) { \
return 0; \
} \
template <typename Type> \
inline int MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::SpaceUsedInMap(const TypeOnMemory& value) { \
return sizeof(Type); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Clear( \
TypeOnMemory* value, Arena* arena) { \
*value = 0; \
} \
template <typename Type> \
inline void \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::ClearMaybeByDefaultEnum(TypeOnMemory* value, \
Arena* arena, \
int default_enum_value) { \
*value = static_cast<TypeOnMemory>(default_enum_value); \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Merge( \
const MapEntryAccessorType& from, TypeOnMemory* to, Arena* arena) { \
*to = from; \
} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::DeleteNoArena(TypeOnMemory& x) {} \
template <typename Type> \
inline void MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::AssignDefaultValue(TypeOnMemory* value) {} \
template <typename Type> \
inline void \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::Initialize( \
TypeOnMemory* value, Arena* arena) { \
*value = 0; \
} \
template <typename Type> \
inline void \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::InitializeMaybeByDefaultEnum(TypeOnMemory* value, \
int default_enum_value, \
Arena* arena) { \
*value = static_cast<TypeOnMemory>(default_enum_value); \
} \
template <typename Type> \
inline typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType* \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, Type>::EnsureMutable( \
TypeOnMemory* value, Arena* arena) { \
return value; \
} \
template <typename Type> \
inline const typename MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::MapEntryAccessorType& \
MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::DefaultIfNotInitialized(const TypeOnMemory& value, \
const TypeOnMemory& \
default_value) { \
return value; \
} \
template <typename Type> \
inline bool MapTypeHandler<WireFormatLite::TYPE_##FieldType, \
Type>::IsInitialized(const TypeOnMemory& value) { \
return true; \
}
PRIMITIVE_HANDLER_FUNCTIONS(INT64)
PRIMITIVE_HANDLER_FUNCTIONS(UINT64)
PRIMITIVE_HANDLER_FUNCTIONS(INT32)
PRIMITIVE_HANDLER_FUNCTIONS(UINT32)
PRIMITIVE_HANDLER_FUNCTIONS(SINT64)
PRIMITIVE_HANDLER_FUNCTIONS(SINT32)
PRIMITIVE_HANDLER_FUNCTIONS(ENUM)
PRIMITIVE_HANDLER_FUNCTIONS(DOUBLE)
PRIMITIVE_HANDLER_FUNCTIONS(FLOAT)
PRIMITIVE_HANDLER_FUNCTIONS(FIXED64)
PRIMITIVE_HANDLER_FUNCTIONS(FIXED32)
PRIMITIVE_HANDLER_FUNCTIONS(SFIXED64)
PRIMITIVE_HANDLER_FUNCTIONS(SFIXED32)
PRIMITIVE_HANDLER_FUNCTIONS(BOOL)
#undef PRIMITIVE_HANDLER_FUNCTIONS
} // namespace internal
} // namespace protobuf
} // namespace google
#endif // GOOGLE_PROTOBUF_TYPE_HANDLER_H__
```
|
```go
package cobra
import (
"fmt"
"strings"
)
type PositionalArgs func(cmd *Command, args []string) error
// Legacy arg validation has the following behaviour:
// - root commands with no subcommands can take arbitrary arguments
// - root commands with subcommands will do subcommand validity checking
// - subcommands will always accept arbitrary arguments
func legacyArgs(cmd *Command, args []string) error {
// no subcommand, always take args
if !cmd.HasSubCommands() {
return nil
}
// root command with subcommands, do subcommand checking.
if !cmd.HasParent() && len(args) > 0 {
return fmt.Errorf("unknown command %q for %q%s", args[0], cmd.CommandPath(), cmd.findSuggestions(args[0]))
}
return nil
}
// NoArgs returns an error if any args are included.
func NoArgs(cmd *Command, args []string) error {
if len(args) > 0 {
return fmt.Errorf("unknown command %q for %q", args[0], cmd.CommandPath())
}
return nil
}
// OnlyValidArgs returns an error if any args are not in the list of ValidArgs.
func OnlyValidArgs(cmd *Command, args []string) error {
if len(cmd.ValidArgs) > 0 {
// Remove any description that may be included in ValidArgs.
// A description is following a tab character.
var validArgs []string
for _, v := range cmd.ValidArgs {
validArgs = append(validArgs, strings.Split(v, "\t")[0])
}
for _, v := range args {
if !stringInSlice(v, validArgs) {
return fmt.Errorf("invalid argument %q for %q%s", v, cmd.CommandPath(), cmd.findSuggestions(args[0]))
}
}
}
return nil
}
// ArbitraryArgs never returns an error.
func ArbitraryArgs(cmd *Command, args []string) error {
return nil
}
// MinimumNArgs returns an error if there is not at least N args.
func MinimumNArgs(n int) PositionalArgs {
return func(cmd *Command, args []string) error {
if len(args) < n {
return fmt.Errorf("requires at least %d arg(s), only received %d", n, len(args))
}
return nil
}
}
// MaximumNArgs returns an error if there are more than N args.
func MaximumNArgs(n int) PositionalArgs {
return func(cmd *Command, args []string) error {
if len(args) > n {
return fmt.Errorf("accepts at most %d arg(s), received %d", n, len(args))
}
return nil
}
}
// ExactArgs returns an error if there are not exactly n args.
func ExactArgs(n int) PositionalArgs {
return func(cmd *Command, args []string) error {
if len(args) != n {
return fmt.Errorf("accepts %d arg(s), received %d", n, len(args))
}
return nil
}
}
// ExactValidArgs returns an error if
// there are not exactly N positional args OR
// there are any positional args that are not in the `ValidArgs` field of `Command`
func ExactValidArgs(n int) PositionalArgs {
return func(cmd *Command, args []string) error {
if err := ExactArgs(n)(cmd, args); err != nil {
return err
}
return OnlyValidArgs(cmd, args)
}
}
// RangeArgs returns an error if the number of args is not within the expected range.
func RangeArgs(min int, max int) PositionalArgs {
return func(cmd *Command, args []string) error {
if len(args) < min || len(args) > max {
return fmt.Errorf("accepts between %d and %d arg(s), received %d", min, max, len(args))
}
return nil
}
}
```
|
```go
// Solution to Rod cutting problem
// path_to_url
// path_to_url
package dynamic
// CutRodRec solve the problem recursively: initial approach
func CutRodRec(price []int, length int) int {
if length == 0 {
return 0
}
q := -1
for i := 1; i <= length; i++ {
q = Max(q, price[i]+CutRodRec(price, length-i))
}
return q
}
// CutRodDp solve the same problem using dynamic programming
func CutRodDp(price []int, length int) int {
r := make([]int, length+1) // a.k.a the memoization array
r[0] = 0 // cost of 0 length rod is 0
for j := 1; j <= length; j++ { // for each length (subproblem)
q := -1
for i := 1; i <= j; i++ {
q = Max(q, price[i]+r[j-i]) // avoiding recursive call
}
r[j] = q
}
return r[length]
}
/*
func main() {
length := 10
price := []int{0, 1, 5, 8, 9, 17, 17, 17, 20, 24, 30}
// price := []int{0, 10, 5, 8, 9, 17, 17, 17, 20, 24, 30}
// fmt.Print(price[5]+price[length-5], "\n")
fmt.Print(cutRodRec(price, length), "\n")
fmt.Print(cutRodDp(price, length), "\n")
}
*/
```
|
```xml
export default function handler(_req, res) {
res.json({ deploymentId: process.env.NEXT_DEPLOYMENT_ID })
}
```
|
```java
/*
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.apache.shardingsphere.sharding.rule.changed;
import org.apache.shardingsphere.infra.metadata.database.ShardingSphereDatabase;
import org.apache.shardingsphere.mode.event.dispatch.rule.alter.AlterRuleItemEvent;
import org.apache.shardingsphere.mode.event.dispatch.rule.drop.DropRuleItemEvent;
import org.apache.shardingsphere.infra.util.yaml.YamlEngine;
import org.apache.shardingsphere.mode.spi.RuleItemConfigurationChangedProcessor;
import org.apache.shardingsphere.sharding.api.config.ShardingRuleConfiguration;
import org.apache.shardingsphere.sharding.api.config.strategy.sharding.ShardingStrategyConfiguration;
import org.apache.shardingsphere.sharding.metadata.nodepath.ShardingRuleNodePathProvider;
import org.apache.shardingsphere.sharding.rule.ShardingRule;
import org.apache.shardingsphere.sharding.yaml.config.strategy.sharding.YamlShardingStrategyConfiguration;
import org.apache.shardingsphere.sharding.yaml.swapper.strategy.YamlShardingStrategyConfigurationSwapper;
/**
* Default table sharding strategy changed processor.
*/
public final class DefaultTableShardingStrategyChangedProcessor implements RuleItemConfigurationChangedProcessor<ShardingRuleConfiguration, ShardingStrategyConfiguration> {
@Override
public ShardingStrategyConfiguration swapRuleItemConfiguration(final AlterRuleItemEvent event, final String yamlContent) {
return new YamlShardingStrategyConfigurationSwapper().swapToObject(YamlEngine.unmarshal(yamlContent, YamlShardingStrategyConfiguration.class));
}
@Override
public ShardingRuleConfiguration findRuleConfiguration(final ShardingSphereDatabase database) {
return database.getRuleMetaData().findSingleRule(ShardingRule.class).map(ShardingRule::getConfiguration).orElseGet(ShardingRuleConfiguration::new);
}
@Override
public void changeRuleItemConfiguration(final AlterRuleItemEvent event, final ShardingRuleConfiguration currentRuleConfig, final ShardingStrategyConfiguration toBeChangedItemConfig) {
currentRuleConfig.setDefaultTableShardingStrategy(toBeChangedItemConfig);
}
@Override
public void dropRuleItemConfiguration(final DropRuleItemEvent event, final ShardingRuleConfiguration currentRuleConfig) {
currentRuleConfig.setDefaultTableShardingStrategy(null);
}
@Override
public String getType() {
return ShardingRuleNodePathProvider.RULE_TYPE + "." + ShardingRuleNodePathProvider.DEFAULT_TABLE_STRATEGY;
}
}
```
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CustomContextMenuProvider_h
#define CustomContextMenuProvider_h
#include "core/page/ContextMenuProvider.h"
#include "platform/ContextMenuItem.h"
#include "platform/heap/Handle.h"
namespace blink {
class ContextMenu;
class HTMLElement;
class HTMLMenuElement;
class HTMLMenuItemElement;
class CustomContextMenuProvider final : public ContextMenuProvider {
public:
virtual ~CustomContextMenuProvider();
static PassRefPtrWillBeRawPtr<CustomContextMenuProvider> create(HTMLMenuElement& menu, HTMLElement& subject)
{
return adoptRefWillBeNoop(new CustomContextMenuProvider(menu, subject));
}
DECLARE_VIRTUAL_TRACE();
private:
CustomContextMenuProvider(HTMLMenuElement&, HTMLElement&);
virtual void populateContextMenu(ContextMenu*) override;
virtual void contextMenuItemSelected(const ContextMenuItem*) override;
virtual void contextMenuCleared() override;
void populateContextMenuItems(const HTMLMenuElement&, ContextMenu&);
void appendSeparator(ContextMenu&);
void appendMenuItem(HTMLMenuItemElement*, ContextMenu&);
HTMLElement* menuItemAt(unsigned menuId);
RefPtrWillBeMember<HTMLMenuElement> m_menu;
RefPtrWillBeMember<HTMLElement> m_subjectElement;
WillBeHeapVector<RefPtrWillBeMember<HTMLElement>> m_menuItems;
};
} // namespace blink
#endif
```
|
Ken Kostick (1 June 1953 – 21 April 2011) was a Canadian chef and television and radio personality, best known for co-hosting the television series What's for Dinner? with Mary Jo Eustace.
Early life
Kostick was born in Winnipeg on 1 June 1953 and was raised in the North End, Winnipeg area. He also attended St. John's High School.
Broadcasting career
He cohosted the Life Network series What's for Dinner? with Eustace in the 1990s and early 2000s. The show was noted particularly for Kostick and Eustace's comedic banter, focusing in part on whether or not Kostick and Eustice were a couple, as well as Kostick's public ambiguity at the time about whether or not he was gay.
He also wrote several bestselling cookbooks and put out an eponymous line of cooking products.
Kostick and Eustace debuted on Toronto's new LGBT-focused radio station Proud FM in 2007 as cohosts of the morning show. Eustace left the show in June 2008, following which Kostick continued to host alone until leaving the station in December of that year. The duo then reunited for the new W Network series He Said, She Said with Ken and Mary Jo.
Death
On 21 April 2011, Kostick died in Toronto of complications of pancreatitis. He was 57 years old. It was later confirmed after his passing that he was gay.
References
1953 births
2011 deaths
Canadian radio hosts
Canadian television chefs
Canadian food writers
Canadian cookbook writers
Deaths from pancreatitis
Canadian LGBT entertainers
Canadian gay writers
Writers from Winnipeg
Canadian LGBT broadcasters
Canadian male chefs
|
Kido or KIDO may refer to:
Kido (surname)
KIDO, an American radio station
Kidō, a form of magic used by characters in the manga and anime Bleach
Conficker or Kido, computer worm
Gao Hanyu or Kido, Chinese actor and singer
|
```objective-c
/* xalloc.h -- malloc with out-of-memory checking
1999, 2000, 2003, 2004 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program; if not, write to the Free Software Foundation,
Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
#ifndef XALLOC_H_
# define XALLOC_H_
# include <stddef.h>
# ifdef __cplusplus
extern "C" {
# endif
# ifndef __attribute__
# if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 8) || __STRICT_ANSI__
# define __attribute__(x)
# endif
# endif
# ifndef ATTRIBUTE_NORETURN
# define ATTRIBUTE_NORETURN __attribute__ ((__noreturn__))
# endif
/* This function is always triggered when memory is exhausted.
It must be defined by the application, either explicitly
or by using gnulib's xalloc-die module. This is the
function to call when one wants the program to die because of a
memory allocation failure. */
extern void xalloc_die (void) ATTRIBUTE_NORETURN;
void *xmalloc (size_t s);
void *xnmalloc (size_t n, size_t s);
void *xzalloc (size_t s);
void *xcalloc (size_t n, size_t s);
void *xrealloc (void *p, size_t s);
void *xnrealloc (void *p, size_t n, size_t s);
void *x2realloc (void *p, size_t *pn);
void *x2nrealloc (void *p, size_t *pn, size_t s);
void *xclone (void const *p, size_t s);
char *xstrdup (const char *str);
/* Return 1 if an array of N objects, each of size S, cannot exist due
to size arithmetic overflow. S must be positive and N must be
nonnegative. This is a macro, not an inline function, so that it
works correctly even when SIZE_MAX < N.
By gnulib convention, SIZE_MAX represents overflow in size
calculations, so the conservative dividend to use here is
SIZE_MAX - 1, since SIZE_MAX might represent an overflowed value.
However, malloc (SIZE_MAX) fails on all known hosts where
sizeof (ptrdiff_t) <= sizeof (size_t), so do not bother to test for
exactly-SIZE_MAX allocations on such hosts; this avoids a test and
branch when S is known to be 1. */
# define xalloc_oversized(n, s) \
((size_t) (sizeof (ptrdiff_t) <= sizeof (size_t) ? -1 : -2) / (s) < (n))
/* These macros are deprecated; they will go away soon, and are retained
temporarily only to ease conversion to the functions described above. */
# define CCLONE(p, n) xclone (p, (n) * sizeof *(p))
# define CLONE(p) xclone (p, sizeof *(p))
# define NEW(type, var) type *var = xmalloc (sizeof (type))
# define XCALLOC(type, n) xcalloc (n, sizeof (type))
# define XMALLOC(type, n) xnmalloc (n, sizeof (type))
# define XREALLOC(p, type, n) xnrealloc (p, n, sizeof (type))
# define XFREE(p) free (p)
# ifdef __cplusplus
}
# endif
#endif /* !XALLOC_H_ */
```
|
Jucifer is an American doom metal duo, which was founded in 1993. The band's members are Gazelle Amber Valentine on lead guitar and vocals, and her husband Edgar Livengood on drums. Jucifer is notable for the extreme volume at which they perform, and the gigantic wall of amplification used for Valentine's guitar, as well as the dichotomy that has existed between much of the recorded material and their live shows. They are also notable for incessant touring beginning in the mid-1990s. In 2000 Jucifer moved into an RV and became completely "nomadic in nature", preferring to tour constantly, living in their tour vehicle, rather than following the normal practice of album release/tour/time at home.
The husband-and-wife duo were starring in a film by Derek Cianfrance titled Metalhead, a drama centering on a drummer suffering from hearing loss and learning the meaning of silence. Livengood and Valentine play as themselves acting a fictitious story in the film. The film was in production since 2009 but was cancelled few years later. Cianfrance would later executive produce Sound of Metal, which is a rework of Metalhead co-written and directed by Darius Marder. Although Cianfrance used Jucifer as inspiration for his original plot, which in turn inspired the reworked version, neither film is biographical.
In 2015, Jucifer previewed teasers for a "music video biopic" called NOMADS: Build To Destroy which features tour footage and documentary materials filmed and assembled by the band. Livengood is credited with photography and Valentine with editing. The film was slated for a 2017 release.
History
Jucifer was formed in 1993 by Gazelle Amber Valentine and Edgar Livengood, who, according to Valentine, coined the band's name from a statement he heard during O. J. Simpson's trials for the murders of Nicole Brown Simpson and Ron Goldman: "If he's guilty, then he's the devil and The Juice is Lucifer." Previous to Jucifer the band had performed under several other names including Starbuck, Satan's Cheerleaders, and Battle Star. In 1994 Jucifer self-released a demo EP on cassette, Nadir. In 1995 a 7" Superman / Licorice was issued by fan run indie label Crack Rock, which also released Jucifer's first studio album, Calling All Cars on the Vegas Strip. After this release, they signed to major label Capricorn Records, which reissued the album in 2000. With Jucifer still signed and awaiting release of its second album recorded in 1999, Capricorn officially went out of business. However a skeleton staff continued under the name Velocette Records, which released extended play EP Lambs in 2001 I Name You Destroyer in 2002 and War Bird in 2004. For their fifth release, If Thine Enemy Hunger, Jucifer signed to Relapse Records,
In March 2008, Jucifer released the double album, L'Autrichienne, which was recorded in July 2007. To support the album, Jucifer embarked on their first tour through Europe.
In 2010 Jucifer founded its own label, Nomadic Fortress Records, and signed a distribution deal with Relapse Records for its output. The band continues to tour constantly, both across North America and returning to Europe in 2010, 2011, 2012, 2013, 2014, 2016, 2017, and 2019.
The album Throned In Blood was released in April 2010 by Nomadic Fortress Records on CD, and on vinyl by Alternative Tentacles. This album channels the raw hostility, black metal, death metal, and especially doom qualities which have dominated Jucifer's live show but more rarely been heard on earlier albums.
In 2011 the demos EP from 1994 Nadir was mastered by Scott Hull and reissued by the digital-only Grindcore Karaoke label. In 2012 Nadir was remastered for vinyl by Brad Boatright and issued on limited marble LPs by Mutants of the Monster.
On July 17, 2013 Jucifer released the album За Волгой для нас земли нет via Nomadic Fortress and Mutants of the Monster. The concept record about the history of Russian city Volgograd (focusing especially on the Battle of Stalingrad) was issued on double vinyl by Alternative Tentacles in October 2013.
Jucifer's studio album entitled District of Dystopia, was released on CD and digital formats by Nomadic Fortress in December 2014. It is a concept album based upon various atrocities committed by the United States government. The album was recorded, engineered, and mastered by the band inside their RV. In October 2015, District of Dystopia was mastered for vinyl by Brad Boatright and released on LP format by Alternative Tentacles.
Jucifer remains nomadic. Their 2013 "Twenty Years Slaying Ears" tour included 32 countries. In 2014 the band performed in the U.S. and U.K. and, in 2015, Jucifer toured the West Coast of the U.S. for the first time since 2012.
In January 2019 Jucifer's EP Futility was released. In July 2020 Jucifer announced a new album, called نظم (Nazm) will be released in November.
Jucifer's album نظم was released on November 7, 2020. It is a concept album about "the stories of Valentine’s life, the lineage of women in her family, and the struggles and resilience of women in every place and time. The ambitious, sprawling double album is also Jucifer’s spin on Central Asian and Arabic music"
NPR All Songs Considered selected نظم for their Best Music of November 2020 and described it as "beautifully deep music drawn from an ancient and ever-present bloodline, from one of the heaviest bands on Earth".
Discography
Studio albums
Calling All Cars on the Vegas Strip (1998, Crack Rock records, 2000, Capricorn Records)
I Name You Destroyer (2002, Velocette Records)
If Thine Enemy Hunger (2006, Relapse Records)
L'Autrichienne (2008, Relapse Records, 2xLP via Alternative Tentacles)
Throned in Blood (2010, Nomadic Fortress Records, distribution through Relapse Records, LP via Alternative Tentacles)
За Волгой для нас земли нет (2013, Nomadic Fortress Records, Mutants of the Monster, Alternative Tentacles)
District of Dystopia (2014, Nomadic Fortress Records: 2015, Alternative Tentacles)
نظم (2020, Nomadic Fortress Records)
EPs
Nadir EP (1994, four track demos, self-released)
Lambs EP (2001, Capricorn Records)
War Bird EP (2004, Velocette Records)
Autocannibalist EP released as split cd w/Show of Bedlam (2009, Choking Hazard)
Nadir reissue, 1994 demos EP (2011, Grindcore Karaoke, 2012, Mutants of the Monster)
Futility (2019, Nomadic Fortress Records via mp3 and 7" vinyl)
Live DVDs
A Partridge In A Pear Tree DVD (2004, AmberVillain Films)
Veterans of Volume: Live With Eight Cameras (2008, Bare Ruined Films)
References
External links
American doom metal musical groups
Musical groups established in 1993
Heavy metal musical groups from Georgia (U.S. state)
Capricorn Records artists
American sludge metal musical groups
Relapse Records artists
Alternative Tentacles artists
Heavy metal duos
Male–female musical duos
|
St. Mary's Springs Academy (SMSA, formerly St. Mary's Springs High School) is a Catholic, private, coeducational system serving grades 3-year-old Preschool through High School in Fond du Lac, Wisconsin and is associated with the Archdiocese of Milwaukee. It was founded by the Sisters of Saint Agnes in 1909.
History
The Sisters of Saint Agnes came to the site of the school in 1901 to open a sanitarium after money was donated by local businessman Henry Boyle. The first building built on the site in 1901, Boyle Hall, was named in his honor. This building and St. Agnes Hall, located immediately to the north of Boyle Hall, were used as a sanitarium until 1909 when the site was changed into a boarding school for girls. The school held its first graduation in 1911. Though run by the Sisters of St. Agnes, it became affiliated with The Catholic University of America in 1915 and then became known as St. Mary's Springs Academy. In 1928, a large school building was constructed to the north of Boyle Hall. In 1939, St. Mary's Springs Academy revised its mission and opened its doors to young men as well as young women. In 1956, boarding facilities were discontinued.
With increasing enrollment during the 1950s and 1960s, a need arose for another building. Telethons were held to raise money for the construction. In 1970, the school's name was changed to St. Mary's Springs High School after becoming jointly sponsored by the Archdiocese of Milwaukee and the Congregation of the Sisters of St. Agnes. A new academic building was built that year at the north end of the campus, immediately north of the main building. Both buildings held classes until the main building became known as the Administration Building due to dwindling class sizes. It continued to house the offices, cafeteria, and an auditorium. Around 2001, the Administration Building was permanently closed due to asbestos being found in the building. In 2005, Boyle Hall, which had sat vacant for nearly 25 years, was torn down due to structural problems. The old administration building sat vacant until it was razed in 2015 to make way for a proposed preK-12 academic complex.
In 2008, St. Mary's Springs High School was merged with FACES (Fond du Lac Area Catholic Education System) to form a K-12 system. FACES consisted of two campuses, St. Joseph's Primary School and St. Mary's Middle School. The three campuses began operating under the name of St. Mary's Springs Academy. Plans were underway to build a complex combining the Academy due to the aging buildings of the former FACES campus. A campaign, called the Second Century Campaign, was launched to fund building this new complex at the high school location.
At the start of the 2016–2017 academic year, the new St. Mary's Springs Academy complex opened its doors to students in pre-Kindergarten through grade 12. The complex consisted of the academic building (built in 1970) connected to the large new addition. The older portion of the building was completely renovated to make better use of space as well as to update classrooms for modern learning. Currently, grades 6–12 occupy the older portion while pre-Kindergarten through grade 5, as well as administrative offices, occupy the new portion of the building.
The school completed construction of a new turf field in 2021.
Trivia
St. Mary's Springs was given its name due to the presence of artesian springs which flow naturally from "the Ledge," or the Niagara Escarpment, a glacial land formation in which the campus is built into. It was thought that the fresh air and natural spring water held healing benefits for tuberculosis patients of the sanitarium which originally occupied the site.
Shortly before Boyle Hall was razed, a ceremony was held at the school at which the cornerstone was opened to reveal mementos from the past.
The landmark bell tower of the old administration building, which could be viewed from across town, was reconstructed on the site of the new school complex. After plans for the new complex were underway, a separate campaign, called Bring It Back Home, was launched to fund the reconstruction. A bell tower with a similar appearance to the original now sits on The Ledge.
Athletics
Championships
State championships
Boys' basketball: 1993, 1994
Boys' cross country: 1971
Girls' cross country: 1992, 1993, 1995, 1996, 1997
Football: 1983, 1984, 1990, 1991, 1995, 1997, 1998, 1999, 2002, 2009, 2011, 2012, 2014, 2015, 2017, 2018, 2019
Boys' golf: 1959, 2015, 2016, 2017, 2018
Boys' hockey: 1981, 1982, 1985, 1986, 1987, 2020, 2021.
Boys' track: 1975, 1979, 1993, 1996, 1997, 1998, 2000, 2012.
Baseball: 2016.
Conference championships
Boys' cross country: 1971, 1972, 1996, 2000
Girls' cross country: 1992, 1993, 1994, 1995, 1996, 1997, 1999, 2000, 2001, 2009, 2010
Football: 1975, 1976, 1977, 1978, 1981, 1983, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2002, 2004, 2008, 2009, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020
Girls' tennis: 1992
Volleyball: 1976, 2018, 2021
Boys' basketball: 1993, 2003, 2021
Girls' basketball: 2001, 2002
Boys' hockey: 2011, 2020, 2021
Girls' hockey: 2011
Baseball: 1983, 1984, 1985, 1987, 1993, 1994, 1995, 2000, 2001, 2004, 2008, 2009
Golf: 1961, 1971, 1972, 1986, 1992, 1994, 1996, 1998, 2000, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012
Girls' soccer: 2007, 2008
Softball: 1992
Boys' track: 1975, 1987, 1988, 1998, 1999, 2000
Girls' track: 1997, 1998, 1999, 2000, 2011
Notable people
Wisconsin State Senator Warren Braun is a graduate.
Wisconsin State Representative John P. Dobyns is a graduate.
Rabies survivor Jeanna Giese graduated in 2007.
References
External links
St. Mary's Springs Academy
Sisters of St. Agnes
Roman Catholic Archdiocese of Milwaukee
Educational institutions established in 1909
Fond du Lac, Wisconsin
Catholic secondary schools in Wisconsin
Schools in Fond du Lac County, Wisconsin
1909 establishments in Wisconsin
|
"The Air That I Breathe" is a ballad written by British-Gibraltarian singer-songwriter Albert Hammond and Mike Hazlewood, initially recorded by Hammond on his debut album, It Never Rains in Southern California (1972). It was a major hit for the Hollies in early 1974, reaching number two in the UK Singles Chart. This was the band's last major hit.
History
"The Air That I Breathe" was a major hit for the Hollies in early 1974, reaching number two in the UK Singles Chart. In mid-1974, it reached number six in the United States on the Billboard Hot 100 chart and number three on the Adult Contemporary chart. In Canada, the song peaked at number five on the RPM magazine charts. The audio engineering for "The Air That I Breathe" was done by Alan Parsons. In an interview, Parsons mentioned that Eric Clapton said the first note of "The Air That I Breathe" had more soul than anything he had ever heard.
This version of the song featured a string orchestra arrangement, which also featured a horn section.
Record World said that "the potent material gets a super interpretation."
The 1992 Radiohead song "Creep" uses a similar chord progression and shares some melodic content with the 1972 version of "The Air That I Breathe". As a result, the song's publisher sued Radiohead for copyright infringement and a settlement was reached in which Hammond and Hazlewood were given co-writing credits and a portion of the royalties.
Personnel
Credits from Richard Buskin and engineer Alan Parsons.
The Hollies
Allan Clarke - lead, harmony, and backing vocals
Tony Hicks - harmony and backing vocals, electric lead guitar; acoustic rhythm guitar (uncertain)
Terry Sylvester - harmony and backing vocals, acoustic rhythm guitar
Bobby Elliott - drums, additional overdubbed tom-toms
Bernie Calvert - bass
Additional musicians and production staff
The Hollies - producers
Ron Richards - producer
Alan Parsons - engineer
Chris Gunning - orchestral arrangements
unknown - 40-piece orchestra (including brass and strings)
Charts
Weekly charts
Year-end charts
Certifications
Simply Red version
British soul and pop band Simply Red released a cover of "The Air That I Breathe" on their sixth album, Blue (1998). It peaked at number five in Scotland, number six in the UK and number 17 in Austria. On the Eurochart Hot 100, it reached number 35. A music video was also produced to promote the single.
Critical reception
Gene Armstrong from Arizona Daily Star declared the Simply Red version as "a sexy version". J.D. Considine from The Baltimore Sun felt "his Marvin Gaye-like" take on the track "is wonderfully audacious". Larry Flick from Billboard viewed it as "an inspired, groove-laden interpretation", remarking that "Hucknall brings his signature soul to the track, vamping with glee while the band pumps a mild, jeep-styled beat that is hard enough for R&B listeners but soft enough to tickle the fancy of AC and triple-A radio listeners." He added, "Popsters will soon be treated to a bevy of remixes by Sean "Puffy" Combs and Stevie J., which should make top 40 punters quickly sit up and take notice." A reviewer from Daily Record commented, "You'll be looking for a breath of fresh air after hearing Mick Hucknall's middle-of-the-road reworking of this song which was originally a hit for The Hollies. The band desperately need a dose of originality."
Track listings
CD single, Europe (1998)
"The Air That I Breathe" – 4:24
"The Air That I Breathe" (Reprise) – 4:35
"So Many People" (Live) – 5:44
"Never Never Love" (Live) – 4:34
CD single CD1, UK (1998)
"The Air That I Breathe" – 4:24
"Tu Sei Dentro Di Me (Someday In My Life)" – 4:02
"Lives And Loves" (Live) – 3:32
CD single CD2, Europe and UK (1998)
"The Air That I Breathe" (Reprise) – 4:35
"The Air That I Breathe" – 4:24
"Love Has Said Goodbye Again" (Rae & Christian Mix) – 5:14
Charts
Release history
Other cover versions
Phil Everly on his 1973 album Star Spangled Springer.
Olivia Newton-John on her 1975 album Have You Never Been Mellow and later on her Deluxe Edition 2022-issued Olivia Newton-John's Greatest Hits.
Rex Allen Jr. in 1983; this version was released for the country music market. Allen's version peaked at number 37 on the Billboard Hot Country Singles chart in December 1983.
Julio Iglesias in 1984 on his album 1100 Bel Air Place which established him as a star in the English-speaking entertainment industry.
Alien on their self-titled 1989 album.
k.d. lang on her 1997 album Drag, which featured cover songs with a smoking motif.
Semisonic on their "Singing in my Sleep" single in 1998.
The Mavericks on their self-titled 2003 album. Their version peaked at number 59 on the Billboard Hot Country Songs chart.
References
1974 singles
Songs written by Albert Hammond
Songs written by Mike Hazlewood
Albert Hammond songs
The Hollies songs
Rex Allen Jr. songs
1998 singles
Simply Red songs
The Mavericks songs
Number-one singles in South Africa
Number-one singles in New Zealand
1970s ballads
1972 songs
Polydor Records singles
Epic Records singles
East West Records singles
|
Nashville is an unincorporated community in Jackson County, in the U.S. state of Iowa.
Geography
Nashville is located at .
History
Nashville was founded on the Iowa Midland Railway. By 1910, it had thee general stores, a blacksmith and repair shop, and a church.
Nashville's post office operated from 1871 until 1935. The community was named by an early settler for his native hometown of Nashville, Tennessee.
Nashville's population was 54 in 1902, and 100 in 1925.
In 1940, Nashville's population was 55.
See also
Cottonville, Iowa
References
Unincorporated communities in Jackson County, Iowa
1871 establishments in Iowa
Populated places established in 1871
Unincorporated communities in Iowa
|
Jelin (), formerly Jelin-e Olya (جلين عليا), also Romanized as Jelīn-e ‘Olyā; also known as Jelīn and Jelīn-e Bālā, is a city in the Central District of Gorgan County, Golestan province, Iran.
At the 2006 census, its population was 7,071 in 1,827 households, when it was a village in Estarabad-e Jonubi Rural District. The following census in 2011 counted 7,753 people in 2,161 households, by which time the village had been elevated to the status of a city. The latest census in 2016 showed a population of 7,417 people in 2,260 households.
References
Gorgan County
Cities in Golestan Province
Populated places in Golestan Province
Populated places in Gorgan County
|
Entertainment Network India Limited (ENIL) (, ) is a subsidiary of Times Infotainment Media Limited, the holding company promoted by Bennett, Coleman & Company Limited- the flagship company of the Times of India Group, was incorporated in 1999.
Times Infotainment is promoted by Bennett, Coleman & Company Limited, better known as the Times of India Group, which was incorporated in 1999. ENIL is the only listed company in the otherwise privately held Times of India Group. It is listed on Bombay Stock Exchange of India Limited and the National Stock Exchange of India Limited.
History
The company was formed in June 1999 post the first phase of licensing. The Information Broadcasting Ministry offered 108 frequency across 40 cities and ENIL got the maximum of them. It started its operations with the launch of its services in Indore on 4 October 2001. The company simultaneously started operations in seven more cities. In the second phase the company got 25 more frequencies. That took the count of total number of stations to 32.
Brand Mirchi and "Its Hot!" the tag line
The tag line of the brand is "Its Hot!" Mirchi is a Hindi word for chilly. While all other radio brands were in English, ENIL came up with a Hindi brand name. The brand name Mirchi was coined by Mr. Vineet Jain (Chairman, Times Group).
Business segment
ENIL cater to Radio Broadcasting Segment, Out of Home and Experiential Marketing Segment
Radio broadcasting segment
This segment operates with the brand name of 'Radio Mirchi'. Before Radio Mirchi, the Times of India Group provided private FM service along with the Government of India under the brand name of Times FM. GOI did not renew the contract with private player post that. They operated in Delhi, Calcutta, Chennai and Goa from 1993-1998. It has been consistently rated as the No. 1 FM radio channel. It has a large pan India presence with 32 stations across 14 states. The channel reaches to more than 41 Million listeners (as per IRS Q4, 2010, last week recall) across stations.
Experiential marketing segment
Experiential marketing segment is carried under the brand name 360 Degree. Alternative Brand Solution (India) Limited, a subsidiary of ENIL, is the organisation which looks after this segment. They have organised many popular event properties. One of them being Spell Bee - India Spells. This year was the third edition of the event, and they engaged with more than three lakh across 25 cities.
Out of Home
This segment provides Digital Screens, Large Formats, Street Furniture etc. They won a 20-year advertising contract with New Delhi Airport, Terminal 3.
Financials
Digital innovations
ENIL with tie up with Bharti Airtel ltd have launched Mirchi Mobile. Under this service Airtel customers could tune into Radio Mirchi channels of different cities. This service allowed customers to tune into 12 stations of Radio Mirchi. This service was later extended to Reliance and BSNL customers also.
Radio Mirchi can also be heard online.
Highlights of advertising business of FM radio
Top three categories to advertise on FM Radio - Real Estate, Cellular Service Providers, TV Channel Promotion
40% of business comes from local advertisers
References
Companies of The Times Group
Companies based in Mumbai
Indian companies established in 1999
1999 establishments in Maharashtra
Mass media companies established in 1999
Companies listed on the Bombay Stock Exchange
Companies listed on the National Stock Exchange of India
|
```c++
// your_sha256_hash----------------------------------
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
// associated documentation files (the "Software"), to deal in the Software without restriction,
// including without limitation the rights to use, copy, modify, merge, publish, distribute,
// sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all copies or
// substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
// NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
// your_sha256_hash----------------------------------
// Boost:
#include <boost/python.hpp>
#include <boost/python/exception_translator.hpp>
#include <boost/python/register_ptr_to_python.hpp>
#include <boost/python/suite/indexing/vector_indexing_suite.hpp>
#include <boost/python/to_python_converter.hpp>
// Malmo:
#include <AgentHost.h>
#include <Logger.h>
#ifdef WRAP_ALE
#include <ALEAgentHost.h>
#endif
#include <ClientPool.h>
#include <MissionSpec.h>
#include <ParameterSet.h>
using namespace malmo;
// STL:
#include <sstream>
#include <cstdint>
// Python:
#include <datetime.h>
// Converts a python list to a vector of strings. Throws a python exception if the conversion fails.
std::vector< std::string > listToStrings( const boost::python::list& list )
{
std::vector<std::string> strings;
for( int i = 0; i < len( list ); i++ )
strings.push_back( boost::python::extract< std::string >( list[i] ) );
return strings;
}
// A Python wrapper around ArgumentParser::parse().
void parsePythonList( ArgumentParser* p, const boost::python::list& list )
{
p->parse( listToStrings( list ) );
}
// Make sure we get all of the useful information from std::exception
void translateXMLStdException(std::exception const& e)
{
std::ostringstream oss;
oss << "Caught std::exception: " << e.what() << "\n";
PyErr_SetString(PyExc_RuntimeError, oss.str().c_str() );
}
PyObject* missionExceptionType = NULL;
PyObject* createExceptionClass(const char* name, PyObject* baseTypeObj = PyExc_Exception)
{
std::string scopeName = boost::python::extract<std::string>(boost::python::scope().attr("__name__"));
std::string qualifiedName0 = scopeName + "." + name;
char* qualifiedName1 = const_cast<char*>(qualifiedName0.c_str());
PyObject* typeObj = PyErr_NewException(qualifiedName1, baseTypeObj, 0);
if (!typeObj)
boost::python::throw_error_already_set();
boost::python::scope().attr(name) = boost::python::handle<>(boost::python::borrowed(typeObj));
return typeObj;
}
void translateMissionException(MissionException const& e)
{
boost::python::object wrapped_exception(e);
boost::python::object exc_type(boost::python::handle<>(boost::python::borrowed(missionExceptionType)));
exc_type.attr("details") = wrapped_exception;
PyErr_SetString(missionExceptionType, e.what());
}
void (AgentHost::*startMissionSimple)(const MissionSpec&, const MissionRecordSpec&) = &AgentHost::startMission;
void (AgentHost::*startMissionComplex)(const MissionSpec&, const ClientPool&, const MissionRecordSpec&, int, std::string) = &AgentHost::startMission;
void (AgentHost::*sendCommand)(std::string) = &AgentHost::sendCommand;
void (AgentHost::*sendCommandWithKey)(std::string, std::string) = &AgentHost::sendCommand;
void (MissionRecordSpec::*recordMP4General)(int, int64_t bit_rate) = &MissionRecordSpec::recordMP4;
void (MissionRecordSpec::*recordMP4Specific)(TimestampedVideoFrame::FrameType, int, int64_t, bool) = &MissionRecordSpec::recordMP4;
#ifdef WRAP_ALE
void (ALEAgentHost::*startALEMissionSimple)(const MissionSpec&, const MissionRecordSpec&) = &ALEAgentHost::startMission;
void (ALEAgentHost::*startALEMissionComplex)(const MissionSpec&, const ClientPool&, const MissionRecordSpec&, int, std::string) = &ALEAgentHost::startMission;
#endif
struct ptime_to_python_datetime
{
static PyObject* convert(boost::posix_time::ptime const& pt)
{
// Convert posix_time into python DateTime object:
boost::gregorian::date date = pt.date();
boost::posix_time::time_duration td = pt.time_of_day();
static std::int64_t resolution = boost::posix_time::time_duration::ticks_per_second();
std::int64_t fracsecs = td.fractional_seconds();
std::int64_t usecs = (resolution > 1000000) ? fracsecs / (resolution / 1000000) : fracsecs * (1000000 / resolution);
return PyDateTime_FromDateAndTime((int)date.year(), (int)date.month(), (int)date.day(), (int)td.hours(), (int)td.minutes(), (int)td.seconds(), (int)usecs);
}
};
struct unsigned_char_vec_to_python_array
{
static PyObject* convert(std::vector<unsigned char> const& vec)
{
const char* buffer = reinterpret_cast<const char*>(vec.data());
return PyByteArray_FromStringAndSize(buffer, vec.size());
}
};
// Defines the API available to Python.
BOOST_PYTHON_MODULE(MalmoPython)
{
using namespace boost::python;
missionExceptionType = createExceptionClass("MissionException", PyExc_RuntimeError);
// Bind the converter for posix_time to python DateTime
PyDateTime_IMPORT;
to_python_converter<boost::posix_time::ptime, ptime_to_python_datetime>();
to_python_converter<std::vector<unsigned char>, unsigned_char_vec_to_python_array>();
enum_< MissionException::MissionErrorCode >("MissionErrorCode")
.value("MISSION_BAD_ROLE_REQUEST", MissionException::MISSION_BAD_ROLE_REQUEST)
.value("MISSION_BAD_VIDEO_REQUEST", MissionException::MISSION_BAD_VIDEO_REQUEST)
.value("MISSION_ALREADY_RUNNING", MissionException::MISSION_ALREADY_RUNNING)
.value("MISSION_INSUFFICIENT_CLIENTS_AVAILABLE", MissionException::MISSION_INSUFFICIENT_CLIENTS_AVAILABLE)
.value("MISSION_TRANSMISSION_ERROR", MissionException::MISSION_TRANSMISSION_ERROR)
.value("MISSION_SERVER_WARMING_UP", MissionException::MISSION_SERVER_WARMING_UP)
.value("MISSION_SERVER_NOT_FOUND", MissionException::MISSION_SERVER_NOT_FOUND)
.value("MISSION_NO_COMMAND_PORT", MissionException::MISSION_NO_COMMAND_PORT)
.value("MISSION_BAD_INSTALLATION", MissionException::MISSION_BAD_INSTALLATION)
.value("MISSION_CAN_NOT_KILL_BUSY_CLIENT", MissionException::MISSION_CAN_NOT_KILL_BUSY_CLIENT)
.value("MISSION_CAN_NOT_KILL_IRREPLACEABLE_CLIENT", MissionException::MISSION_CAN_NOT_KILL_IRREPLACEABLE_CLIENT)
;
enum_< Logger::LoggingSeverityLevel >("LoggingSeverityLevel")
.value("LOG_OFF", Logger::LOG_OFF)
.value("LOG_ERRORS", Logger::LOG_ERRORS)
.value("LOG_WARNINGS", Logger::LOG_WARNINGS)
.value("LOG_INFO", Logger::LOG_INFO)
.value("LOG_FINE", Logger::LOG_FINE)
.value("LOG_TRACE", Logger::LOG_TRACE)
.value("LOG_ALL", Logger::LOG_ALL)
;
enum_< Logger::LoggingComponent >("LoggingComponent")
.value("LOG_TCP", Logger::LOG_TCP)
.value("LOG_RECORDING", Logger::LOG_RECORDING)
.value("LOG_VIDEO", Logger::LOG_VIDEO)
.value("LOG_AGENTHOST", Logger::LOG_AGENTHOST)
.value("LOG_ALL_COMPONENTS", Logger::LOG_ALL_COMPONENTS)
;
def("setLogging", &Logger::setLogging);
def("appendToLog", &Logger::appendToLog);
def("setLoggingComponent", &Logger::setLoggingComponent);
class_< MissionException >("MissionExceptionDetails", init< const std::string&, MissionException::MissionErrorCode >())
.add_property("errorCode", &MissionException::getMissionErrorCode)
.add_property("message", &MissionException::getMessage);
class_< ArgumentParser, boost::noncopyable >("ArgumentParser", init< const std::string& >())
.def( "parse", &parsePythonList )
.def( "addOptionalIntArgument", &ArgumentParser::addOptionalIntArgument )
.def( "addOptionalFloatArgument", &ArgumentParser::addOptionalFloatArgument )
.def( "addOptionalStringArgument", &ArgumentParser::addOptionalStringArgument )
.def( "addOptionalFlag", &ArgumentParser::addOptionalFlag )
.def( "getUsage", &ArgumentParser::getUsage )
.def( "receivedArgument", &ArgumentParser::receivedArgument )
.def( "getIntArgument", &ArgumentParser::getIntArgument )
.def( "getFloatArgument", &ArgumentParser::getFloatArgument )
.def( "getStringArgument", &ArgumentParser::getStringArgument )
;
class_< WorldState >( "WorldState", no_init )
.def_readonly( "is_mission_running", &WorldState::is_mission_running )
.def_readonly( "has_mission_begun", &WorldState::has_mission_begun )
.def_readonly( "number_of_observations_since_last_state", &WorldState::number_of_observations_since_last_state )
.def_readonly( "number_of_rewards_since_last_state", &WorldState::number_of_rewards_since_last_state )
.def_readonly( "number_of_video_frames_since_last_state", &WorldState::number_of_video_frames_since_last_state )
.def_readonly( "observations", &WorldState::observations )
.def_readonly( "rewards", &WorldState::rewards )
.def_readonly( "video_frames", &WorldState::video_frames )
.def_readonly( "mission_control_messages", &WorldState::mission_control_messages )
.def_readonly( "errors", &WorldState::errors )
.def(self_ns::str(self_ns::self))
;
enum_< AgentHost::VideoPolicy >( "VideoPolicy" )
.value( "LATEST_FRAME_ONLY", AgentHost::LATEST_FRAME_ONLY )
.value( "KEEP_ALL_FRAMES", AgentHost::KEEP_ALL_FRAMES )
;
enum_< AgentHost::RewardsPolicy >( "RewardsPolicy" )
.value( "LATEST_REWARD_ONLY", AgentHost::LATEST_REWARD_ONLY )
.value( "SUM_REWARDS", AgentHost::SUM_REWARDS )
.value( "KEEP_ALL_REWARDS", AgentHost::KEEP_ALL_REWARDS )
;
enum_< AgentHost::ObservationsPolicy >( "ObservationsPolicy" )
.value( "LATEST_OBSERVATION_ONLY", AgentHost::LATEST_OBSERVATION_ONLY )
.value( "KEEP_ALL_OBSERVATIONS", AgentHost::KEEP_ALL_OBSERVATIONS )
;
class_< AgentHost, bases< ArgumentParser >, boost::noncopyable >("AgentHost", init<>())
.def( "startMission", startMissionSimple )
.def( "startMission", startMissionComplex )
.def( "killClient", &AgentHost::killClient )
.def( "peekWorldState", &AgentHost::peekWorldState )
.def( "getWorldState", &AgentHost::getWorldState )
.def( "setVideoPolicy", &AgentHost::setVideoPolicy )
.def( "setRewardsPolicy", &AgentHost::setRewardsPolicy )
.def( "setObservationsPolicy", &AgentHost::setObservationsPolicy )
.def( "sendCommand", sendCommand )
.def( "sendCommand", sendCommandWithKey )
.def("getRecordingTemporaryDirectory", &AgentHost::getRecordingTemporaryDirectory)
.def( "setDebugOutput", &AgentHost::setDebugOutput )
.def(self_ns::str(self_ns::self))
;
#ifdef WRAP_ALE
class_< ALEAgentHost, bases< ArgumentParser >, boost::noncopyable >("ALEAgentHost", init<>())
.def("startMission", startALEMissionSimple)
.def("startMission", startALEMissionComplex)
.def("peekWorldState", &ALEAgentHost::peekWorldState)
.def("getWorldState", &ALEAgentHost::getWorldState)
.def("setVideoPolicy", &ALEAgentHost::setVideoPolicy)
.def("setRewardsPolicy", &ALEAgentHost::setRewardsPolicy)
.def("setObservationsPolicy", &ALEAgentHost::setObservationsPolicy)
.def("sendCommand", &ALEAgentHost::sendCommand)
.def("getRecordingTemporaryDirectory", &ALEAgentHost::getRecordingTemporaryDirectory)
.def("setSeed", &ALEAgentHost::setSeed)
.def(self_ns::str(self_ns::self))
;
#endif
class_< MissionSpec >( "MissionSpec", init<>() )
.def(init< const std::string&, bool >())
.def("getAsXML", &MissionSpec::getAsXML)
.def("setSummary", &MissionSpec::setSummary)
.def("timeLimitInSeconds", &MissionSpec::timeLimitInSeconds)
.def("createDefaultTerrain", &MissionSpec::createDefaultTerrain)
.def("forceWorldReset", &MissionSpec::forceWorldReset)
.def("setWorldSeed", &MissionSpec::setWorldSeed)
.def("setTimeOfDay", &MissionSpec::setTimeOfDay)
.def("drawBlock", &MissionSpec::drawBlock)
.def("drawCuboid", &MissionSpec::drawCuboid)
.def("drawItem", &MissionSpec::drawItem)
.def("drawSphere", &MissionSpec::drawSphere)
.def("drawLine", &MissionSpec::drawLine)
.def("startAt", &MissionSpec::startAt)
.def("startAtWithPitchAndYaw", &MissionSpec::startAtWithPitchAndYaw)
.def("endAt", &MissionSpec::endAt)
.def("setModeToCreative", &MissionSpec::setModeToCreative)
.def("setModeToSpectator", &MissionSpec::setModeToSpectator)
.def("requestVideo", &MissionSpec::requestVideo)
.def("requestVideoWithDepth", &MissionSpec::requestVideoWithDepth)
.def("setViewpoint", &MissionSpec::setViewpoint)
.def("rewardForReachingPosition", &MissionSpec::rewardForReachingPosition)
.def("observeRecentCommands", &MissionSpec::observeRecentCommands)
.def("observeHotBar", &MissionSpec::observeHotBar)
.def("observeFullInventory", &MissionSpec::observeFullInventory)
.def("observeGrid", &MissionSpec::observeGrid)
.def("observeDistance", &MissionSpec::observeDistance)
.def("observeChat", &MissionSpec::observeChat)
.def("removeAllCommandHandlers", &MissionSpec::removeAllCommandHandlers)
.def("allowAllContinuousMovementCommands", &MissionSpec::allowAllContinuousMovementCommands)
.def("allowContinuousMovementCommand", &MissionSpec::allowContinuousMovementCommand)
.def("allowAllDiscreteMovementCommands", &MissionSpec::allowAllDiscreteMovementCommands)
.def("allowDiscreteMovementCommand", &MissionSpec::allowDiscreteMovementCommand)
.def("allowAllAbsoluteMovementCommands", &MissionSpec::allowAllAbsoluteMovementCommands)
.def("allowAbsoluteMovementCommand", &MissionSpec::allowAbsoluteMovementCommand)
.def("allowAllInventoryCommands", &MissionSpec::allowAllInventoryCommands)
.def("allowInventoryCommand", &MissionSpec::allowInventoryCommand)
.def("allowAllChatCommands", &MissionSpec::allowAllChatCommands)
.def("getSummary", &MissionSpec::getSummary)
.def("getNumberOfAgents", &MissionSpec::getNumberOfAgents)
.def("isVideoRequested", &MissionSpec::isVideoRequested)
.def("getVideoWidth", &MissionSpec::getVideoWidth)
.def("getVideoHeight", &MissionSpec::getVideoHeight)
.def("getVideoChannels", &MissionSpec::getVideoChannels)
.def("getListOfCommandHandlers", &MissionSpec::getListOfCommandHandlers)
.def("getAllowedCommands", &MissionSpec::getAllowedCommands)
.def(self_ns::str(self_ns::self))
;
class_< MissionRecordSpec >("MissionRecordSpec", init<>())
.def(init < std::string >())
.def("recordMP4", recordMP4General)
.def("recordMP4", recordMP4Specific)
.def("recordBitmaps", &MissionRecordSpec::recordBitmaps)
.def("recordObservations", &MissionRecordSpec::recordObservations)
.def("recordRewards", &MissionRecordSpec::recordRewards)
.def("recordCommands", &MissionRecordSpec::recordCommands)
.def("setDestination", &MissionRecordSpec::setDestination)
.def(self_ns::str(self_ns::self))
;
register_ptr_to_python< boost::shared_ptr< ClientInfo > >();
class_< ClientInfo >("ClientInfo", init<>())
.def(init<const std::string &>())
.def(init<const std::string &, int>()) // address & control_port
.def(init<const std::string &, int, int>()) // address, control port and command port
.def_readonly("ip_address", &ClientInfo::ip_address)
.def_readonly("control_port", &ClientInfo::control_port)
.def_readonly("command_port", &ClientInfo::command_port)
.def(self_ns::str(self_ns::self))
;
class_< std::vector< boost::shared_ptr< ClientInfo > > >( "ClientInfoVector" )
.def( vector_indexing_suite< std::vector< boost::shared_ptr< ClientInfo > >, true >() )
;
class_< ClientPool >("ClientPool", init<>())
.def("add", &ClientPool::add)
.def_readonly("clients", &ClientPool::clients)
.def(self_ns::str(self_ns::self))
;
class_<ParameterSet>("ParameterSet", init<>())
.def(init<const std::string &>())
.def("toJson", &ParameterSet::toJson)
.def("set", &ParameterSet::set)
.def("get", &ParameterSet::get)
.def("setInt", &ParameterSet::setInt)
.def("getInt", &ParameterSet::getInt)
.def("setDouble", &ParameterSet::setDouble)
.def("getDouble", &ParameterSet::getDouble)
.def("setBool", &ParameterSet::setBool)
.def("getBool", &ParameterSet::getBool)
;
register_ptr_to_python< boost::shared_ptr< TimestampedString > >();
class_< TimestampedString >("TimestampedString", no_init)
.add_property( "timestamp", make_getter(&TimestampedString::timestamp, return_value_policy<return_by_value>()))
.def_readonly( "text", &TimestampedString::text )
.def(self_ns::str(self_ns::self))
;
register_ptr_to_python< boost::shared_ptr< TimestampedReward > >();
class_< TimestampedReward >( "TimestampedReward", no_init )
.add_property( "timestamp", make_getter(&TimestampedReward::timestamp, return_value_policy<return_by_value>()))
.def("hasValueOnDimension", &TimestampedReward::hasValueOnDimension)
.def("getValueOnDimension", &TimestampedReward::getValueOnDimension)
.def("getValue", &TimestampedReward::getValue)
.def(self_ns::str(self_ns::self))
;
enum_< TimestampedVideoFrame::FrameType >("FrameType")
.value("VIDEO", TimestampedVideoFrame::VIDEO)
.value("DEPTH_MAP", TimestampedVideoFrame::DEPTH_MAP)
.value("LUMINANCE", TimestampedVideoFrame::LUMINANCE)
.value("COLOUR_MAP", TimestampedVideoFrame::COLOUR_MAP);
register_ptr_to_python< boost::shared_ptr< TimestampedVideoFrame > >();
class_< TimestampedVideoFrame >( "TimestampedVideoFrame", no_init )
.add_property( "timestamp", make_getter(&TimestampedVideoFrame::timestamp, return_value_policy<return_by_value>()))
.def_readonly( "width", &TimestampedVideoFrame::width )
.def_readonly( "height", &TimestampedVideoFrame::height )
.def_readonly( "channels", &TimestampedVideoFrame::channels )
.def_readonly( "xPos", &TimestampedVideoFrame::xPos)
.def_readonly( "yPos", &TimestampedVideoFrame::yPos)
.def_readonly( "zPos", &TimestampedVideoFrame::zPos)
.def_readonly( "yaw", &TimestampedVideoFrame::yaw)
.def_readonly( "pitch", &TimestampedVideoFrame::pitch)
.def_readonly( "frametype", &TimestampedVideoFrame::frametype)
.add_property( "pixels", make_getter(&TimestampedVideoFrame::pixels, return_value_policy<return_by_value>()))
.def(self_ns::str(self_ns::self))
;
class_< std::vector< boost::shared_ptr< TimestampedString > > >( "TimestampedStringVector" )
.def( vector_indexing_suite< std::vector< boost::shared_ptr< TimestampedString > >, true >() )
;
class_< std::vector< boost::shared_ptr< TimestampedReward > > >( "TimestampedRewardVector" )
.def( vector_indexing_suite< std::vector< boost::shared_ptr< TimestampedReward > >, true >() )
;
class_< std::vector< boost::shared_ptr< TimestampedVideoFrame > > >( "TimestampedVideoFrameVector" )
.def( vector_indexing_suite< std::vector< boost::shared_ptr< TimestampedVideoFrame > >, true >() )
;
class_< std::vector< std::string > >( "StringVector" )
.def( vector_indexing_suite< std::vector< std::string >, true >() )
;
register_exception_translator<std::exception>(&translateXMLStdException);
register_exception_translator<MissionException>(&translateMissionException);
}
```
|
McCauleyville is an unincorporated community in Wilkin County, in the U.S. state of Minnesota.
History
A post office called McCauleysville was established in 1873, and remained in operation until 1905. The community was named for its founder, David McCauley. David McCauley served as post sutler as well as postmaster and stagecoach agent at nearby Fort Abercrombie in the early 1860s and was present during the siege by the Dakota in 1862.
References
Unincorporated communities in Wilkin County, Minnesota
Unincorporated communities in Minnesota
|
```prolog
#!/usr/bin/perl
# $OpenBSD: bcast.pl,v 1.1 2021/01/09 15:39:37 bluhm Exp $
#
# Permission to use, copy, modify, and distribute this software for any
# purpose with or without fee is hereby granted, provided that the above
# copyright notice and this permission notice appear in all copies.
#
# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
use strict;
use warnings;
use BSD::Socket::Splice qw(setsplice geterror);
use Errno;
use Getopt::Std;
use IO::Socket::IP;
use Socket qw(getnameinfo AI_PASSIVE NI_NUMERICHOST NI_NUMERICSERV);
# from /usr/include/sys/mbuf.h
use constant M_MAXLOOP => 128;
my %opts;
getopts('b:v', \%opts) or do {
print STDERR <<"EOF";
usage: $0 [-v] [-b bcast]
-b bcast broadcast address, default 255.255.255.255
-v verbose
EOF
exit(2);
};
my $broadcast = $opts{b} || "255.255.255.255";
my $verbose = $opts{v};
my $timeout = 10;
$SIG{ALRM} = sub { die "Timeout triggered after $timeout seconds" };
alarm($timeout);
my $ls = IO::Socket::IP->new(
Broadcast => $opts{b} ? 1 : undef,
GetAddrInfoFlags => AI_PASSIVE,
LocalHost => $broadcast,
Proto => "udp",
Type => SOCK_DGRAM,
) or die "Listen socket failed: $@";
my ($host, $service) = $ls->sockhost_service(1);
print "listen on host '$host' service '$service'\n" if $verbose;
my $cs = IO::Socket::IP->new(
PeerHost => $host,
PeerService => $service,
Proto => "udp",
Type => SOCK_DGRAM,
) or die "Connect socket failed: $@";
print "connect to host '$host' service '$service'\n" if $verbose;
my $as = $ls;
my $peer = $cs->sockname();
$as->connect($peer)
or die "Connect passive socket failed: $!";
if ($verbose) {
my ($err, $peerhost, $peerservice) = getnameinfo($peer,
NI_NUMERICHOST | NI_NUMERICSERV);
$err and die "Getnameinfo failed: $err";
print "accept from host '$peerhost' service '$peerservice'\n";
}
setsplice($as, $cs)
or die "Splice accept to connect socket failed: $!";
setsplice($cs, $as)
or die "Splice connect to accept socket failed: $!";
system("\${SUDO} fstat -n -p $$") if $verbose;
my ($msg, $buf) = "foo";
$cs->send($msg, 0)
or die "Send to connect socket failed: $!";
defined $as->recv($buf, 100, 0)
or die "Recv from accept socket failed: $!";
$msg eq $buf
or die "Value modified in splice chain";
$! = geterror($as)
or die "No error at accept socket";
$!{ELOOP}
or die "Errno at accept socket is not ELOOP: $!";
# addresses are asymmetric, try it the other way around
$msg = "bar";
$as->send($msg, 0)
or die "Send to accept socket failed: $!";
defined $cs->recv($buf, 100, 0)
or die "Recv from connect socket failed: $!";
$msg eq $buf
or die "Value modified in splice chain";
$! = geterror($cs)
or die "No error at connect socket";
$!{ELOOP}
or die "Errno at connect socket is not ELOOP: $!";
```
|
is a Japanese tokusatsu television series. It was the seventeenth production in the long-running Super Sentai metaseries of television tokusatsu dramas produced by Toei Company, following Kyōryū Sentai Zyuranger. It was originally broadcast from February 19, 1993, to February 11, 1994, replacing Kyōryū Sentai Zyuranger and was replaced by Ninja Sentai Kakuranger. Toei gave this series the name Star Rangers for international distribution.
Elements from Dairanger were adapted into the second season of Mighty Morphin Power Rangers, specifically the action sequences between the giant robots (which became the Power Rangers' Thunderzords) and some of the monsters. None of the Dairanger costumes were used in Power Rangers, except Kiba Ranger, which was adapted into the White Ranger's costume for Mighty Morphin Power Rangers for the remainder of Season 2 and throughout Season 3, while the suits from the previous season, Kyōryū Sentai Zyuranger were instead used for the other Rangers in that show (The end credits listed the show as titled Dai Rangers). Although the Aura Changer was adapted as the Magna Morpher in “Power Rangers Lost Galaxy”, the core Dairanger costumes in the footage were not used in Power Rangers until Power Rangers Super Megaforce.
In July 2015, Shout! Factory announced that they would release "Gosei Sentai Dairanger: The Complete Series" on DVD in North America. On November 10, 2015, Dairanger was released on DVD in North America. This is the second Super Sentai series to be released in North America. In addition on May 23, 2016, Shout! streamed the series on their website.
Story
Eight thousand years ago, the , also known as the , flourished in Southern China. The empire consisted of three separate tribes: the Dai, the (the ancestors of today's humanity) and the Gorma (the military tribe); which lived in harmony. However, one day, the Gorma Tribe decided to take over the Daos Empire and the world, beginning the war between the Gorma and Dai tribes. The war between the Gorma, led by the Gorma Triumvarate, and the Dai continued for 5,000 years until the Mythical Qi Beasts appeared to oppose the Gorma, whose qi powers had increased to the point that they could turn themselves into monsters. Five Dai warriors' qi powers had increased to the point where they could control the Mythical Qi Beasts. The war ended with the disappearance of both the Dai and Gorma tribes and the Shura scattered around the world. In the present day, the Gorma Tribe, one of the Daos' two missing branches, arose to take over the world. To counter them, Master Kaku assembled a team of five youths with high levels of qi, who became the Dairangers.
Characters
Dairangers
The titular Gosei Sentai Dairanger are human practitioners of Chinese martial arts who possess high levels of qi powers against the Gorma Tribe. As a group, the core five Dairangers perform the finisher by gathering their qi and firing it towards the enemy. After their final battle, the Dairangers separated, with the last scene of the series showing them fifty years in the future in which their grandchildren follow the Dairangers' legacy and fight against the last remnants of the Gorma Tribe.
Ryo
is the team leader who is the son of Choryo and a human woman. Initially, he was completely unaware of his Dai heritage as his mother died prior to the series' beginning leaving him to raise his younger sister, Yōko, by himself. He aspires to become the best gyoza cook in Japan and works in Yokohama Chinatown. Ryo became a Dairanger after he was captured by Baron String, only to be saved by the Mythical Qi Beast RyuseiOh and taken to Master Kaku. Ryo deeply trusts his teammates. As the red-colored , he specializes in the Dragon Fist style and uses the powers of fire and thunder.
Daigo
is the second-in-command who is the gentlest and most serious member of the team. He works at a pet shop and becomes romantically involved with Kujaku. Daigo was recruited as a Dairanger after Kaku discovered his qi connection with Kujaku. As the green-colored , he specializes in the Hung Ga style and uses illusions in combat.
Shoji
is a former delinquent who dreams of becoming a world boxing champion after reforming from his past as a member of a violent street gang. He has a strong sense of fair play and competitiveness, only applicable with Kazu. He is strong, balanced, playful and loving. Boss Kamikaze, of the Three Gorma Stooges, sees him as his greatest rival. As the blue-colored , he specializes in the Long Fist style with the power to manipulate the gravitational forces around him, thus increasing his strength and speed. Shoji appeared in the final episode of Kaizoku Sentai Gokaiger, receiving his powers back in the form of the Tenma Ranger Key as the Gokaigers left Earth.
Kazu
is a stylish beautician and dancer. He left home at the age of 15 and traveled to Tokyo. He has a tendency to go rushing into battle without thinking. He helped an old lady who sheltered him when he ran away from his home. As the yellow-colored , he specializes in the Drunken Fist style and has the ability to freeze and reverse the flow of time to prevent mishaps. Kazu appeared in the final episode of Kaizoku Sentai Gokaiger, receiving his powers back in the form of the Kirin Ranger Key as the Gokaigers left Earth.
Rin
is Master Kaku's niece and the only member of the team capable of qi control when not transformed. She came to Japan to be a Dairanger in the guise of an exchange student from China. She hates living with Kou, as he tends to dab in front of her, but later befriends him. She once fell in love with photographer Shōichiro Takamura, the alter ego of Gorma agent . As the pink-colored , she specializes in the Eagle Fist style and uses the power of wind.
Kou
is a 10-year-old boy who is the "Child of Fate" for drawing the sentient from his resting place, becoming the adult-like, white-colored . He lived with his adoptive grandparents prior to moving into Rin's apartment. A somewhat perverted boy, he is infatuated with Rin and "playfully" harasses her much to her chagrin. New to fighting, he is not particularly strong. Kou initially kept his identity a secret from the other Dairangers, with Byakko Shinken speaking in his stead to appear more grown up. After the other Dairangers learned of his identity, he began to speak on his own and joined the team. Shadam eventually learned Kou was his son and Akomaru's twin brother, although Kou himself was never aware of this. As a result of this knowledge, Shadam tried to recruit Kou into the Gorma on his tenth birthday, but his mother's baptism purified him of his Gorma lineage. As Kiba Ranger, Kou specializes in sound-based attacks.
Mythical Qi Beasts
The are giant mechanical life forms that are summoned via the powers of .
: Ryu Ranger's personal Chinese dragon-themed Mythical Qi Beast that can transform into the humanoid form.
: Shishi Ranger's personal Chinese guardian lions-themed Mythical Qi Beast.
: Tenma Ranger's personal Tianma-themed Mythical Qi Beast.
: Kirin Ranger's personal Qilin-themed Mythical Qi Beast.
: Houou Ranger's personal Fenghuang-themed Mythical Qi Beast.
: Kiba Ranger's personal White Tiger-themed Mythical Qi Beast that can transform into the humanoid Mythical Qi Warrior form.
: The oldest Black Tortoise-themed that can transform into the humanoid form. Daimugen can also assume the forms of a small turtle and a human named .
: The combination of Sei-Jishi, Sei-Tenma, Sei-Kirin, and Sei-Houou. RyuseiOh can ride it.
: The combination of RyuseiOh and Tenku Kiden.
: The combination of Won Tiger and Tenku Kiden.
: The combination of RyuseiOh, Tenku Kiden, Won Tiger, and Daimugen.
Allies
Kaku
Originally a member of Gorma, formed the Dairangers to oppose Gorma; his human alias is . But when Daijinryu returned to Earth, Kaku returned to the Gorma in his metallic red Cyclops-like armor and fought Shadam for the right to the throne to become the 16th Gorma Emperor and end the fighting, using the and the as boosters. Once Gara and Zydos destroyed the towers, Kaku was defeated and mortally wounded in the battle against Shadam, and later died in the arms of the Dairangers. He later appeared in spirit form to the Dairangers and told them that Gorma must be thwarted rather than be destroyed.
Choryo
was the previous Ryu Ranger who joined the Gorma and became immortal as a result. 20 years prior to the events of the series, he fell in love with a human who gave birth to his son Ryo and daughter . After Yoko was born, Choryo was summoned back to the Gorma by his master, Archbishop Riju, to fight the Dairangers after the Triumvirate failed to do so, but stopped upon hearing his son is the new Ryu Ranger. Choryo eventually saw the error of his ways and turned on his master. During the ensuing fight, he received a fatal blow and collapsed. Dying in Ryo's arms, the four spirits of the other original Dairangers appeared to Choryo to tell him they forgave him. He then passed on the knowledge of DairenOh to the new Dairangers before he died. Choryo is portrayed by .
Kujaku
is a follower of Mahamayuri Vidyaraja, the Peacock Wisdom Queen and a master of kenpo. A member of the , she became the Peacock Wisdom Queen's follower to restore Gara by finding the , an ancient artifact said to heal whoever drinks from it. Gara joined the Gorma and through deception, trapped Kujaku in Mirror Make-Up Artist, causing Kujaku to swore revenge, resulting in her losing her compassion and love during her 6,000 years of imprisonment. Kujaku was freed by Daigo and attempted to murder Gara in revenge for her imprisonment until Daigo's perseverance and a little girl's kindness caused her to have a change of heart. Kujaku then resumed looking for the Sacred Peacock's Tears, realizing that she was dying from the Earth's pollutants and evil. Unfortunately, Kujaku realized that she would sicken and die even if she drank the Sacred Peacock's Tears, causing her to use the artifact to restore Gara's beauty instead. Kujaku then died with the real Gara at her side. Kujaku would later reappear in spirit form to restore Daigo's faith and plead with him not to take revenge.
Guhon
is Rin's great grand-uncle and Kaku's mentor, who tends to be bizarre at times and often cracks his neck. Despite his appearance, Guhon was the inventor of the Aura Changers and later provided the Dairangers with their blades and the . Prior to the Kabuki Boy incident, Guhon entrusted his fiancé Shokyo with Byakko Shinken which he placed within a stone until the rightful owner (Kou) could claim the weapon. Guhon later revealed to Kameo his true identity as Daimugen.
Shokyo
is Guhon's 29-year-old fiancé, a Chinese Opera writer whom he entrusted with Byakko Shinken. Her profession caught the eye of Kabuki Boy, who abducted her, although Guhon won her back. After returning Byakko Shinken to Guhon, Shokyo marries him as she returns to China. Shokyo is portrayed by .
Kou's mother
Kou's mother is married to Shadam and is a member of the Dai Tribe. She possessed a strong qi. She placed a tiger tattoo on Kou at birth to suppress his Gorma-inherited powers and had him adopted after his birth to prevent the Gorma from tracking him down. Kou's mother was taken captive by an elderly Gorma and Akōmaru. She escaped when Shadam broke into her prison to discover the source of Akōmaru's information. She later used Byakoshinken to save a wounded Kou and to purge the Gorma powers from him. She died in a cave collapse along with Akōmaru.
The Gorma Tribe
The are the antagonists of the series. Eight thousand years ago they were the military of the three tribes but decided to take the world for themselves and destroy the other two. The Gorma are humans who have mastered and gained the ability to become monsters. Their leader is the Gorma Emperor with many other divisions under him. However, it was revealed that most of the higher aristocracy had been killed centuries before the series even began. It was thought that Shadam had secretly made clay versions of them all in a bid to be emperor himself. However, as he himself turned out to be clay, it's debatable who created the clay copies. While the You Power the Gorma uses gives them great power, it also has damaged their mental stability, as the most powerful Gorma are almost completely insane as seen with the Gorma Emperor and those before him due to the
Gorma XV
is the fifteenth Emperor of Gorma who mysteriously resurfaced to reopen the with intent to restore his crumbling empire to its former glory. He is an extremely powerful entity, though a bit insane. The insanity was an inherent aspect of all the Gorma's past fourteen emperors due to the power of the Earth Shaking Jewel which supplies the Emperor with an unlimited supply of "You Power" for him to live, though only few actually know the truth. The Emperor was more of a sadistic, heartless creature with a "playful" outlook on things. However, the Emperor got more serious when he saw Shadam's intention to overthrow him. He was hoping for Shadam to fall to their enemies so he can rule the world forever. But when Shadam became next in line and demanded the Earth Shaking Jewel, the Emperor refuses and attempts to use the jewel to kill Shadam himself. However, The Emperor's own conceit was a flaw as Shadam revealed he recreated the Emperor from clay, only letting him live until Shadam became Emperor himself and Gorma's official leader. With that revelation, Shadam managed to steal the Earth Shaking Jewel while the former Emperor is reduced to clay dust.
Gorma Triumvirate
The , who are part of the Military Level (Kaku also belongs to this level), help spear head the Gorma's attack on humans. In episode 30, they get to wield the spiritual powers of Hell.
Shadam
is the leader of the Gorma Triumvirate and the real father of Akomaru and Kou. He was also the one who spearheaded the Gorma attack against the Dai Tribe in China. He hates humans for their weaknesses and can assume a fighting form, with a mask that practically covers his face.
Shadam's motivation in Gorma was to reach higher rankings until he became the 16th Gorma Emperor, deposing the competition in any way possible. He eventually realized his dream and the power of the Gorma Emperor once he defeated Kaku and disposed the previous once he is resurrected so he can become his successor. As , he intended to use the Earth Shaking Jewel to take over the world despite suffering its mind-warping effects, fighting the Dairangers. But when Daijinryu appears, the Earth Shaking Jewel left Shadam to appease Daijinryu's wrath. A maddened Shadam attempted to escape, only to be encountered by Ryo in a one-way knife duel between them. Shadam lost and died on his own knife, revealing that he was actually a clay figure made long ago. As his body crumbled to dust, only an electricity-vibrating human eyeball remained among the pile of dirt. Shadam was revealed to have been responsible for making clay copies of the Gorma higher ranks, as most of them died years ago but since Shadam too was a clay copy, it's not known what happened to the real Shadam and who created the copies.
Gara
is the female member of the Gorma Triumvirate, though she was actually a clay copy of the original Gara and a former member of the Dai Tribe who joined Gorma at age 10 when she believed that her friend Kujaku abandoned her after she was scarred in the face while protecting her, getting revenge with Mirror-Makeup Artist's aid. When Gara died soon after, Shadam created the one that the Dairangers would face in the present time, identical to the original in every way. She created a copy of herself called for a short time by dripping her own blood onto a small doll made of straw. During the final battle, Gara learned the truth of her existence as the "Real Gara" appeared and used her power to reduce Gara into dust.
Zydos
is the strongman, brutal and prone to deep thinking. He was a key player amongst the Gorma because of his power and he could create extremely dangerous new Gorma like Jin. He believed utterly in Shadam as his leader, but was also prone to doing his own things. He has trouble controlling the 3 Gorma Idiots as they tend to botch the plans due to their competitive nature. He was nearly killed by Jukou Kiden, but he survived. During the match between Shadam and Kaku, Zydos was sent to destroy the power booster Kaku intended to use in the match. Though he barely survived Jukou Kiden for the second time, Zydos died when he turned into his true form: a clay figure created by Shadam as he remembered him.
Senate Level
The highest level next to the Emperor. Priests, Imperial Guards, Minister's Secretaries, and Archbishop Saw belong on this level.
Archbishop Saw
The was an insane Gorma of higher rank than the Gorma Triumvirate, and Choryo's master. After his pupil failed to kill the Dairangers, Riju took matters to his own hands. He would have succeeded had Choryo not attacked him when he was attacking Ryo. First to be killed by DairenOh.
General Denpou
is second-in-command to the Emperor and Akomaru's teacher/guardian. He was killed by Shadam when Denpou saw what he was doing to a resting Gorma XV and noticed the clay hand that exposed the Emperor as a clay copy.
Akomaru
is a Gorma child who is the son of Shadam, though the two despise each other fiercely. Shadam apparently had Akomaru put up for adoption when he was born, and was now under General Denpou's wing. In fact, Akomaru is ranked higher than his father. He wants to replace his father as the Gorma military leader. He first appears to take the power of the Kiba Ranger, knowing Kou has it and aware of their relation and wanted Kou to fight by his side as brothers. Unfortunately, Akomaru saw that Kou seemed unable to hate and it annoyed him. Akomaru was killed when he was crushed by a boulder, with Kou at his side. Later the Gorma Emperor brought Akomaru back from Hell prior to his tenth birthday, when he, after having absorbed Hell's Spirit Power which made him more powerful, and Kou came into their adult power as Gorma, Akomaru using his powers to manipulate Kou in his dreams. Akomaru was made to believe that his mother abandoned him to a father who never cared about him. After losing Kou's mother to the Dairanger, Gorma XV banished Akomaru from the Gorma. Akomaru gave the Dairangers quite a battle when he rode atop his bodyguard Ikazuchi, via "You-Power Fusion". After Ikazuchi died, Akomaru learned the truth that his mother abandoned him because of a taboo that one twin must be killed so the other can have the power of both. So their mother decided to save them, with Akomaru to live as a Gorma and Kou as a normal human. But Akomaru was soon mortally injured by Shadam, limping into the cave collapsing on itself and dying in the embrace of his dying mother with the knowledge that he was loved.
Three Court Ladies of Hell
The are three sisters who served as Akomaru's bodyguards/nannies, mistress of the 3-as-1 fighting style. They were sent to try to prevent Kiba Ranger being born, and later to track him down as part of Akomaru's scheme of drafting him.
: The youngest sister, she is able to shoot her hair to grab opponents in a constrictor hold. Mortally wounded by Kiba Ranger after she found out his true identity, she died from massive bloodloss before she could tell Akomaru. Court Lady Earring is voiced by , who also portrays her human form.
: The middle sister, she is able to extend her neck to great lengths & possesses telescopic vision in her third eye. She disguised herself as the abusing and indifferent mother of Akomaru's "Kasumi guise". She is killed by DairenOh. Court Lady Necklace is voiced by , who also portrays her human form.
: The eldest sister, she was able to create energy rings to lasso her opponents. After her two sisters died, Lady Ring vowed to avenge them. Using their possessions, Lady Ring could create "phantom" versions of her sisters to fight with her. Using this ability she easily defeated Won Tiger, but later became first to be killed by Kibadaioh. Court Lady Ring is voiced by , who also portrays her human form.
Gorma Four Heavenly Kings
The are the most favored of the Gorma Emperor's minions; , , , and ; wearing the attire of Buddhist Priests and being masters of displacement. They attempted to use their illusions to trap the Dairangers with key figures (Kujaku, Jin, Three Gorma Stooges, and Akomaru) individually. Their teamwork skills were their greatest power, as they could merge into one deadly four-headed entity called . They survived the attack of Kibadaioh twice, but were soon the first to be killed by Jukou Kiden.
East Heaven, South Heaven, West Heaven, and North Heaven are portrayed by , , , and , respectively.
Thunderbolt
is Akomaru's insectoid bodyguard, this monster fought the Kiba Ranger-less Dairangers. He obtained his name from the fact that he can fire lightning from parts of his body, powerful enough to attract Daijinryu and the Gorma-infested Kiba Ranger's attention. He was winning until Kiba Ranger was purified and rejoined the team, thus killing Ikazuchi with Jukou Kiden.
Imperial Guard
In episode 49, the armors of Kaku and Shiryu are brought to life and are metal-colored by Shadam who sends them against the Dairangers. They are defeated by Shoji, Kazu, and Ryo and disappear.
: One of the leaders of the Imperial Guard, Shiryu is a member of the Marching Men. He was Kaku's supporter amongst the Gorma. He had Hercules-like strength and from his eye beams the power of the monster-strength of the Gorma. He dies fighting DairenOh to Kaku's horror. Shiryu is voiced and portrayed by .
Three Gorma Stooges
The are three Gorma in the service of Zydos, though their foolishness deemed them at lower ranks; they all have a sense of competition and honor. Furthermore, to make them less respectable, none of them can assume human form like their fellow Gorma.
They were beaten by RyuseiOh the first time and Kibadaioh the second time. Though they survived both fights, the trio ended up being bandaged up. Over the course of the series, they would gain respect for the Dairangers (and vice versa); specifically for Shoji, who was seen as the most competitive of the Dairangers. After all that happened to them, they managed to survive the entire series after being blown up various times. Deep down, they never wanted to kill the Dairangers, just defeat them in contests and sports.
They would finally settle things with the Dairangers in a bike race, though they made their peace with the Dairangers using the minefield Zydos placed on the finish line to fake their deaths. The trio later returned to help Shoji.
: The motorcycle-themed leader of the group who rides a motorcycle. He tends to use "baby" in his sentences.
: The tombstone-themed/right-hand man of the group; he can open his head to reveal a variety of things.
: Kamikaze's telephone-themed "girl", able to control any phone to spy on people or attack from long distances.
Gorma Monsters
Jin Matoba
is a master of dark karate known as and all manner of martial arts, and was a gentleman assassin. His favorite targets were martial arts masters, as his own master cut off his left arm. Jin got a prosthesis, perfected his arts and went on a campaign to slaughter other masters who were too hard on their students to return and kill his first teacher. His trademark was to flip a coin into the air and kill his opponent before it landed. But the man foiled that plan by dying before Jin got around to it. But that all changed the day he met Ryo and was defeated by him. Later, Jin sold his soul to Zydos to become stronger than Ryo, becoming after punching , a young nurse who was the only person who cared for him. But Jin refused to be Gorma's lapdog and perfected his new-found powers on his own, after which he went hunting for Ryo. But Zydos captured the rogue and infused him with more Gorma power, turning him into . Unlike the normally born Gorma, Jin's transformation was against his will and thus he was unable to control himself as Garouki. As Garouki, Jin is like a totally obedient dog for Zydos with a desire to kill and eat his victims. Jin was soon freed of his "Gorma-incarnation" thanks to Ryo's attack separating the monster from his body. While Jin fought Zydos, with Garouki destroyed by the Qi-Power Bazooka, he was mortally wounded. After one final bout with Ryo, Jin went on the run from the Gorma. Jin was last seen fighting the bulk of an entire army of Cotpotros led by Zydos, only to be seemingly gunned down by the second wave. But Jin later appeared to Ryo and proceeded to beat sense into him for not giving up despite no longer being a Dairanger.
Cotpotros
The are Gorma grunts in black tuxedo tights with lipped but otherwise blank black and white faces. They would disguise as humans and serve virtually any Gorma, including the Three Gorma Stooges, serving as players in their various games. In the finale, the Dairangers faced red-dressed Cotpotros in the palace. The group were later summoned by Zaigan during Super Sentai World.
Daijinryu
is a colossal god-like entity who preserves the natural balance of the world, referred to as the "Great King of Fear that will destroy the Earth" by Kameo/Daimugen. He appears whenever battles have gone too far, like the ones between the Dairangers and the Gorma. Daijinryu is a neutral being, but has no tolerance for whoever threatens to disrupt the natural order of things. Daijinryu arrived on the planet in , only to transform into the bipedal , his feet as big as Daimugen's shell.
He is also capable of firing lightning bolts with immense destructive power. During his first appearance, he attacks and RyuseiOh. The universe's will that he obeyed told him that the two warring factions had to agree a cease-fire, so Daijinryu would spare the lives of everyone on Earth and the planet itself, but he gave a warning to both the Dairangers and the Gorma not to incur his wrath by destroying most of Tokyo.
The annoyed dragon crushed the monster to death under his massive foot, then turned and disassembled DairenOh with a lightning bolt. He then attempted to crush RyuseiOh (the only Mythical Qi Beast left standing). RyuseiOh was saved by Daimugen, who hid RyuseiOh inside of his shell, but was nearly crushed by Daijinryu. Daijinryu let them live because of the universe's will and the truce between the Dairangers and the Gorma.
When the Dairangers dealt with Ikazuchi, Daijinryu seemingly put many civilians in Tokyo under his control, lining them up on top of buildings to fall to their deaths, before Kaku counter-acted the spell. Daijinryu made his final appearance to destroy the Gorma Palace, seeing that Shadam and the Gorma were the cause of all the trouble. To calm him down, the Lailai Balls and the Great Earth Shaking Jewel scattered to the four winds on their own will.
Episodes
Movie
The film version of Gosei Sentai Dairanger premiered in Japan on April 17, 1993, at Toei Super Hero Fair '93. Directed by Shōhei Tōjō and written by Noboru Sugimura, the movie was originally shown as a triple feature alongside Kamen Rider ZO and the film version of Tokusou Robo Janperson. The main villain of the film is an original monster, named the , who gathers four of the Dairangers' previous adversaries to defeat them. While the movie was filmed between episodes 5–8, its story actually takes place between episodes 8 and 9 due to the appearance of DairenOh. Shōhei Shibata, the young actor who played Hiroshi Mochizuki in ZO later joined the cast of Dairanger as Akomaru, son of the main villain Shadam.
Cast
Ryo of the Heavenly Fire Star:
Daigo of the Heavenly Illusion Star:
Shoji of the Heavenly Gravity Star:
Kazu of the Heavenly Time Star:
Rin of the Heavenly Wind Star:
Kou of the Howling New Star:
Master Kaku:
Commander Shadam:
Commander Gara:
Lieutenant Commander Zydos:
Kameo: ,
Grandmaster Guhon:
Kou's mother:
Jin Matoba:
Kujaku:
Akomaru:
General Denpou:
Gorma XV:
Voice actors
Byakko Shinken:
General Kamikaze:
President Gravestone:
Master Telephone:
Narration:
Guest actors
Archbishop Riju (7 & 8):
:
:
Human form of :
Songs
Opening theme
Lyrics:
Composition:
Arrangement:
Artist:
Ending theme
Lyrics: Saburo Yatsude
Composition: Katsuo Ōno
Arrangement: Kenji Yamamoto
Artist: New Jack Takurō
International Broadcast and Home Video
In its home country of Japan, it was released on VHS (both Sale/Rental) from April 1994 until March 1995 and spread across 12 volumes. The first ten volumes contain four episodes each, while the final two contain five. From November 21, 2009 until March 21, 2010, the series was released on DVD for the first time spreading through five volumes, with each release containing ten episodes through two discs each. On June 14, 2023, to commemorate the 30th anniversary of the series' premiere, a collection set to spread through two volumes was released with both volumes having 25 episodes.
International releases were limited to a few Asian regions, as most regions around the world would receive foreign language dubs of the U.S.' adaptation based on this series, which was Mighty Morphin Power Rangers, where props and monsters would be used for Season 2. Although, Japan did release the first 100 episodes of the Power Rangers adaptation dubbed, but despite high ratings the rest was not dubbed. South Korea only aired a dub of the first season due to the belief that the attention span of Korean kids was too short to keep up with a multiseason show. Thailand, Taiwan, Hong Kong, Indonesia, Malaysia and The Philippines also aired the Power Rangers adaptation dubbed in their languages as well.
The series aired with in Indonesia with an Indonesian dub on RCTI under the Star Ranger title in 1995.
In Thailand, the series aired on Channel 9 in 1995 with a Thai dub despite the popularity of the American-produced Power Rangers.
The series aired in Hong Kong with a Cantonese Chinese dub from October 16, 1995 until December 26, 1995 on Asia Television with all 50 episodes dubbed.
In the Philippines, it has aired on RPN-9 on February 4, 2019 through July 31, 2020. It also aired on TV5 on June 3, 2019 through August 14, 2020.
In North America, the series was released on DVD by Shout! Factory presented with the original Japanese audio with English subtitles on November 10, 2015. This was the second Super Sentai series to get an official release in its unadapted Power Rangers form, following the success of Kyōryū Sentai Zyuranger's DVD sales.
See also
Mighty Morphin Power Rangers (season 2)
Mighty Morphin Power Rangers: The Movie
Notes
References
External links
Official website at Super Sentai.net
Official Shout! Factory page
Official Shout Factory TV page
Super Sentai
1993 Japanese television series debuts
1994 Japanese television series endings
TV Asahi original programming
Martial arts television series
Chinese mythology in popular culture
Japanese action television series
Japanese fantasy television series
Japanese science fiction television series
1990s Japanese television series
Works about legendary creatures
|
TBK1 (TANK-binding kinase 1) is an enzyme with kinase activity. Specifically, it is a serine / threonine protein kinase. It is encoded by the TBK1 gene in humans. This kinase is mainly known for its role in innate immunity antiviral response. However, TBK1 also regulates cell proliferation, apoptosis, autophagy, and anti-tumor immunity. Insufficient regulation of TBK1 activity leads to autoimmune, neurodegenerative diseases or tumorigenesis.
Structure and regulation of activity
TBK1 is a non-canonical IKK kinase that phosphorylates the nuclear factor kB (NFkB). It shares sequence homology with canonical IKK.
The N-terminus of the protein contains the kinase domain (region 9-309) and the ubiquitin-like domain (region 310-385). The C-terminus is formed by two coiled-coil structures (region 407-713) that provide a surface for homodimerization.
The autophosphorylation of serine 172, which requires homodimerization and ubiquitinylation of lysines 30 and 401, is necessary for kinase activity.
Involvement in signaling pathways
TBK1 is involved in many signaling pathways and forms a node between them. For this reason, regulation of its involvement in individual signaling pathways is necessary. This is provided by adaptor proteins that interact with the dimerization domain of TBK1 to determine its location and access to substrates. Binding to TANK leads to localization to the perinuclear region and phosphorylation of substrates which is required for subsequent production of type I interferons (IFN-I). In contrast, binding to NAP1 and SINTBAD leads to localization in the cytoplasm and involvement in autophagy. Another adaptor protein that determines the location of TBK1 is TAPE. TAPE targets TBK1 to endolysosomes.
A key interest in TBK1 is due to its role in innate immunity, especially in antiviral responses. TBK1 is redundant with IKK, but TBK1 seems to play a more important role. After triggering antiviral signaling through PRRs (pattern recognition receptors), TBK1 is activated. Subsequently, it phosphorylates the transcription factor IRF3, which is translocated to the nucleus, and promotes production of IFN-I.
As a non-canonical IKK, TBK1 is also involved in the non-canonical NFkB pathway. It phosphorylates p100/NF-κB2, which is subsequently processed in the proteasome and released as a p52 subunit. This subunit dimerizes with RelB and mediates gene expression.
In the canonical NFkB pathway, the NF-kappa-B (NFKB) complex of proteins is inhibited by I-kappa-B (IKB) proteins, which inactivate NFKB by trapping it in the cytoplasm. Phosphorylation of serine residues on the IKB proteins by IKB kinases marks them for destruction via the ubiquitination pathway, thereby allowing activation and nuclear translocation of the NFKB complex. The protein encoded by this gene is similar to IKB kinases and can mediate NFkB activation in response to certain growth factors.
TBK1 promotes autophagy involved in pathogen and mitochondrial clearance. TBK1 phosphorylates autophagy receptors and components of the autophagy apparatus. Furthermore, TBK1 is also involved in the regulation of cell proliferation, apoptosis and glucose metabolism.
Interactions
TANK-binding kinase 1 has been shown to interact with:
NCK1,
TANK,
TRAF2 and
TBKBP1 aka SINTBAD
Transcription factors activated upon TBK1 activation include IRF3, IRF7 and ZEB1.
Clinical significance
Deregulation of TBK1 activity and mutations in this protein are associated with many diseases. Due to the role of TBK1 in cell survival, deregulation of its activity is associated with tumorogenesis. There are also many autoimmune (e.g., rheumatoid arthritis, sympathetic lupus), neurodegenerative (e.g., amyotrophic lateral sclerosis), and infantile (e.g., herpesviral encephalitis) diseases.
The loss of TBK1 cause embryonic lethality in mice.
Inhibition of IκB kinase (IKK) and IKK-related kinases, IKBKE (IKKε) and TANK-binding kinase 1 (TBK1), has been investigated as a therapeutic option for the treatment of inflammatory diseases and cancer, and a way to overcome resistance to cancer immunotherapy.
See also
CGAS–STING cytosolic DNA sensing pathway
References
Further reading
EC 2.7.11
|
```c++
/*
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
#include "ethosu.h"
#include <tvm/runtime/registry.h>
#include <algorithm>
#include <cmath>
#include <limits>
#include <map>
#include <utility>
#include <vector>
#include "../common.h"
#include "../stripe_config.h"
namespace tvm {
namespace contrib {
namespace ethosu {
namespace cascader {
const std::vector<int64_t> EthosuPartNode::GetBytesRead(const std::vector<int>& block_shape,
const std::vector<int>& full_shape) {
std::vector<int64_t> bytes_per_input(propagators_.size(), 0);
std::vector<int> order;
std::vector<int> stripes;
std::vector<int> offset;
std::vector<float> strides;
for (size_t i = 0; i < block_shape.size(); i++) {
order.push_back(1);
stripes.push_back(round_up_divide(full_shape[i], block_shape[i]));
offset.push_back(0);
strides.push_back(static_cast<float>(block_shape[i]));
}
StripeConfig output_block_config(block_shape, full_shape, strides, order, stripes, offset);
auto input_block_configs = CalculateInputStripeConfigs(output_block_config);
int i = 0;
for (const auto& input_block_config : input_block_configs) {
std::map<std::vector<int>, int> input_blocks = CountStripes(input_block_config, false);
for (const auto& block : input_blocks) {
bytes_per_input[i] +=
mul_reduce(block.first) * block.second * input_tensors_[i]->GetDataType().bytes();
}
i++;
}
if (weight_tensor_idx_ != -1) {
bytes_per_input[weight_tensor_idx_] *= (stripes[height_idx_] * stripes[width_idx_]);
}
return bytes_per_input;
}
float EthosuPartNode::CalculateCost(const BlockConfig& block_config,
const StripeConfig& output_stripe_config) {
std::vector<int> output_block = block_config->GetOutputBlockShape();
std::vector<int> output_stripe_shape = output_stripe_config->GetShape();
auto input_stripe_configs = CalculateInputStripeConfigs(output_stripe_config);
std::vector<int> input_stripe_shape = input_stripe_configs[0]->GetShape();
std::vector<int64_t> bytes_per_input = GetBytesRead(output_block, output_stripe_shape);
bytes_per_input[0] *= subkernels_;
// Calculate bytes read per output element
float cost =
static_cast<float>(bytes_per_input[0] + bytes_per_input[1]) / mul_reduce(output_stripe_shape);
// Single buffering hardware optimization
if (mul_reduce(input_stripe_shape) <= 2 * mul_reduce(block_config->GetInputBlockShape())) {
cost /= 2;
}
return cost;
}
const BlockConfig EthosuPartNode::GetBlockConfig(const StripeConfig& output_stripe_config) {
BlockConfig best_block_config = valid_block_configs_[0];
float best_cost = CalculateCost(best_block_config, output_stripe_config);
std::vector<int> output_stripe_shape = output_stripe_config->GetShape();
auto input_stripe_configs = CalculateInputStripeConfigs(output_stripe_config);
std::vector<int> input_stripe_shape = input_stripe_configs[0]->GetShape();
for (const auto& block_config : valid_block_configs_) {
float relative_cost = CalculateCost(block_config, output_stripe_config);
if (relative_cost < best_cost) {
best_block_config = block_config;
best_cost = relative_cost;
}
}
return best_block_config;
}
const PerformanceInfo EthosuPartNode::GetPerformanceInfo(const StripeConfig& output_stripe_config,
BufferMode buffer_mode) {
BlockConfig block_config = GetBlockConfig(output_stripe_config);
std::vector<int> block_shape = block_config->GetOutputBlockShape();
std::vector<int64_t> bytes_per_input =
GetBytesRead(block_shape, output_stripe_config->GetShape());
float num_blocks = 1.0f;
for (size_t i = 0; i < block_shape.size(); i++) {
if (buffer_mode == BufferMode::RECOMPUTE) {
num_blocks *= std::max(static_cast<float>(output_stripe_config->GetShape()[i]) /
block_shape[i] * output_stripe_config->GetStripes()[i],
1.0f);
} else {
num_blocks *=
std::max(static_cast<float>(output_tensor_->GetShape()[i]) / block_shape[i], 1.0f);
}
}
float num_stripes = mul_reduce(output_stripe_config->GetStripes());
std::vector<int64_t> read_bytes;
for (int64_t stripe_bytes : bytes_per_input) {
read_bytes.push_back(num_stripes * stripe_bytes);
}
int64_t write_bytes =
num_blocks * mul_reduce(block_shape) * output_tensor_->GetDataType().bytes();
int block_output_cycles = block_config->GetOutputCycles();
int block_compute_cycles = block_config->GetComputeCycles();
int64_t total_cycles = 0;
if (block_output_cycles > block_compute_cycles) {
total_cycles = (block_output_cycles * num_blocks) + block_compute_cycles;
} else {
total_cycles = (block_compute_cycles * num_blocks) + block_output_cycles;
}
PerformanceInfo info(total_cycles, read_bytes, write_bytes, block_config);
return info;
}
EthosuPart::EthosuPart(const TESubgraph& subgraph, const std::vector<Propagator> propagators,
const std::vector<int>& output_quantum, int subkernels,
const std::vector<BlockConfig>& valid_block_configs, int weight_tensor_idx) {
auto n = make_object<EthosuPartNode>();
ICHECK_GT(propagators.size(), 0) << "The Part must include at least one Propagator.";
n->subgraph_ = subgraph;
n->propagators_ = std::move(propagators);
n->in_line_ = false;
n->input_tensors_.resize(propagators.size());
n->output_quantum_ = output_quantum;
n->valid_block_configs_ = valid_block_configs;
n->subkernels_ = subkernels;
n->weight_tensor_idx_ = weight_tensor_idx;
if (output_quantum.size() == 5) {
// NHCWB16 Format
n->height_idx_ = 1;
n->width_idx_ = 3;
} else {
// NHWC Format
n->height_idx_ = 1;
n->width_idx_ = 2;
}
data_ = std::move(n);
}
TVM_REGISTER_GLOBAL("contrib.ethosu.cascader.EthosuPart")
.set_body_typed([](Array<te::Tensor> subgraph_inputs, te::Tensor subgraph_output,
Array<Propagator> propagators, Array<Integer> output_quantum, int subkernels,
Array<BlockConfig> valid_block_configs, int weight_tensor_idx) {
std::vector<te::Tensor> vsubgraph_inputs(subgraph_inputs.begin(), subgraph_inputs.end());
std::vector<Propagator> vpropagators(propagators.begin(), propagators.end());
std::vector<int> voutput_quantum;
std::transform(output_quantum.begin(), output_quantum.end(),
std::back_inserter(voutput_quantum),
[](auto&& val) { return val.IntValue(); });
TESubgraph subgraph;
subgraph.input_tensors = vsubgraph_inputs;
subgraph.output_tensor = subgraph_output;
std::vector<BlockConfig> vvalid_block_configs(valid_block_configs.begin(),
valid_block_configs.end());
return EthosuPart(subgraph, vpropagators, voutput_quantum, subkernels, vvalid_block_configs,
weight_tensor_idx);
});
TVM_REGISTER_GLOBAL("contrib.ethosu.cascader.EthosuPartGetBlockConfig")
.set_body_typed([](EthosuPart part, StripeConfig stripe_config) {
return part->GetBlockConfig(stripe_config);
});
TVM_REGISTER_NODE_TYPE(EthosuPartNode);
} // namespace cascader
} // namespace ethosu
} // namespace contrib
} // namespace tvm
```
|
Kosta Nedeljković (; born 16 December 2005) is a Serbian footballer who plays as a right-back for Serbian club Red Star Belgrade and Grafičar Beograd on dual registration.
Career
Nedeljković is the product of the Red Star Youth academy, and in February 2021 he signed his first professional contract with the club that was later extended in December 2022. He played for the club's youth squads until January 2023 when he was loaned, together with Aleksej Vukičević and Stefan Radujko, to Serbian First League team Grafičar Beograd for the second half of the 2022–23 season. He had 17 appearances for the Grafičar, and managed to score his first goal.
Nedeljković made a debut for the Red Star during the summer of 2023 when he was promoted in the first squad for the 2023–24 pre-season friendlies by a club's new manager Barak Bakhar.
References
External links
2005 births
Living people
Men's association football defenders
Serbian men's footballers
Serbian First League players
Red Star Belgrade footballers
RFK Grafičar Beograd players
Sportspeople from Smederevo
Serbia men's youth international footballers
|
```python
import numpy as np
import json
from keras.models import Model
from keras.layers import Input
from keras.layers import Conv2D, MaxPooling2D, AveragePooling2D, BatchNormalization, Average
from keras import backend as K
from collections import OrderedDict
```
```python
def format_decimal(arr, places=6):
return [round(x * 10**places) / 10**places for x in arr]
```
```python
DATA = OrderedDict()
```
```markdown
### graph 2```
```python
random_seed = 10002
data_in_shape = (8, 8, 2)
input_layer_0 = Input(shape=data_in_shape)
branch_0 = Conv2D(4, (3,3), activation='relu', padding='valid', strides=(1,1), data_format='channels_last', use_bias=True)(input_layer_0)
input_layer_1 = Input(shape=data_in_shape)
branch_1 = Conv2D(4, (3,3), activation='relu', padding='valid', strides=(1,1), data_format='channels_last', use_bias=True)(input_layer_1)
output_layer = Average()([branch_0, branch_1])
model = Model(inputs=[input_layer_0, input_layer_1], outputs=output_layer)
data_in = []
for i in range(2):
np.random.seed(random_seed + i)
data_in.append(np.expand_dims(2 * np.random.random(data_in_shape) - 1, axis=0))
# set weights to random (use seed for reproducibility)
weights = []
for i, w in enumerate(model.get_weights()):
np.random.seed(random_seed + i)
weights.append(2 * np.random.random(w.shape) - 1)
model.set_weights(weights)
result = model.predict(data_in)
data_out_shape = result[0].shape
data_in_formatted = [format_decimal(data_in[i].ravel().tolist()) for i in range(2)]
data_out_formatted = format_decimal(result[0].ravel().tolist())
DATA['graph_02'] = {
'inputs': [{'data': data_in_formatted[i], 'shape': data_in_shape} for i in range(2)],
'weights': [{'data': format_decimal(w.ravel().tolist()), 'shape': w.shape} for w in weights],
'expected': {'data': data_out_formatted, 'shape': data_out_shape}
}
```
```markdown
### export for Keras.js tests```
```python
import os
filename = '../../test/data/graph/02.json'
if not os.path.exists(os.path.dirname(filename)):
os.makedirs(os.path.dirname(filename))
with open(filename, 'w') as f:
json.dump(DATA, f)
```
```python
print(json.dumps(DATA))
```
```python
```
|
```go
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// +build nacl plan9
package ipv4
import "net"
// MulticastTTL returns the time-to-live field value for outgoing
// multicast packets.
func (c *dgramOpt) MulticastTTL() (int, error) {
return 0, errOpNoSupport
}
// SetMulticastTTL sets the time-to-live field value for future
// outgoing multicast packets.
func (c *dgramOpt) SetMulticastTTL(ttl int) error {
return errOpNoSupport
}
// MulticastInterface returns the default interface for multicast
// packet transmissions.
func (c *dgramOpt) MulticastInterface() (*net.Interface, error) {
return nil, errOpNoSupport
}
// SetMulticastInterface sets the default interface for future
// multicast packet transmissions.
func (c *dgramOpt) SetMulticastInterface(ifi *net.Interface) error {
return errOpNoSupport
}
// MulticastLoopback reports whether transmitted multicast packets
// should be copied and send back to the originator.
func (c *dgramOpt) MulticastLoopback() (bool, error) {
return false, errOpNoSupport
}
// SetMulticastLoopback sets whether transmitted multicast packets
// should be copied and send back to the originator.
func (c *dgramOpt) SetMulticastLoopback(on bool) error {
return errOpNoSupport
}
// JoinGroup joins the group address group on the interface ifi.
// By default all sources that can cast data to group are accepted.
// It's possible to mute and unmute data transmission from a specific
// source by using ExcludeSourceSpecificGroup and
// IncludeSourceSpecificGroup.
// JoinGroup uses the system assigned multicast interface when ifi is
// nil, although this is not recommended because the assignment
// depends on platforms and sometimes it might require routing
// configuration.
func (c *dgramOpt) JoinGroup(ifi *net.Interface, group net.Addr) error {
return errOpNoSupport
}
// LeaveGroup leaves the group address group on the interface ifi
// regardless of whether the group is any-source group or
// source-specific group.
func (c *dgramOpt) LeaveGroup(ifi *net.Interface, group net.Addr) error {
return errOpNoSupport
}
// JoinSourceSpecificGroup joins the source-specific group comprising
// group and source on the interface ifi.
// JoinSourceSpecificGroup uses the system assigned multicast
// interface when ifi is nil, although this is not recommended because
// the assignment depends on platforms and sometimes it might require
// routing configuration.
func (c *dgramOpt) JoinSourceSpecificGroup(ifi *net.Interface, group, source net.Addr) error {
return errOpNoSupport
}
// LeaveSourceSpecificGroup leaves the source-specific group on the
// interface ifi.
func (c *dgramOpt) LeaveSourceSpecificGroup(ifi *net.Interface, group, source net.Addr) error {
return errOpNoSupport
}
// ExcludeSourceSpecificGroup excludes the source-specific group from
// the already joined any-source groups by JoinGroup on the interface
// ifi.
func (c *dgramOpt) ExcludeSourceSpecificGroup(ifi *net.Interface, group, source net.Addr) error {
return errOpNoSupport
}
// IncludeSourceSpecificGroup includes the excluded source-specific
// group by ExcludeSourceSpecificGroup again on the interface ifi.
func (c *dgramOpt) IncludeSourceSpecificGroup(ifi *net.Interface, group, source net.Addr) error {
return errOpNoSupport
}
// ICMPFilter returns an ICMP filter.
// Currently only Linux supports this.
func (c *dgramOpt) ICMPFilter() (*ICMPFilter, error) {
return nil, errOpNoSupport
}
// SetICMPFilter deploys the ICMP filter.
// Currently only Linux supports this.
func (c *dgramOpt) SetICMPFilter(f *ICMPFilter) error {
return errOpNoSupport
}
```
|
Daphne Anne Caruana Galizia (; 26 August 1964 – 16 October 2017) was a Maltese writer, journalist, blogger and anti-corruption activist, who reported on political events in Malta and was known internationally for her investigation of the Panama Papers, and subsequent assassination by car bomb. In particular, she focused on investigative journalism, reporting on government corruption, nepotism, patronage, and allegations of money laundering, links between Malta's online gambling industry and organized crime, Malta's citizenship-by-investment scheme, and payments from the government of Azerbaijan. Caruana Galizia's national and international reputation was built on her regular reporting of misconduct by Maltese politicians and politically exposed persons.
Caruana Galizia continued to publish articles for decades, despite intimidation and threats, libel suits and other lawsuits. She was arrested by the Malta Police Force on two occasions. Caruana Galizia's investigations were published via her personal blog Running Commentary, which she set up in 2008. She was a regular columnist with The Sunday Times of Malta and later The Malta Independent. Her blog consisted of investigative reporting and commentary, some of which was regarded as personal attacks on individuals, leading to a series of legal battles. In 2016 and 2017, she revealed controversially sensitive information and allegations relating to a number of Maltese politicians and the Panama Papers scandal.
On 16 October 2017, Caruana Galizia died close to her home when a car bomb was detonated inside her vehicle, attracting widespread local and international condemnation of the attack. In December 2017, three men were arrested in connection with the car bomb attack. Police arrested Yorgen Fenech, the owner of the Dubai-based company 17 Black, on his yacht on 20 November 2019 in connection with her murder.
In April 2018, an international consortium of 45 journalists published The Daphne Project, a collaboration to complete her investigative work. The GUE/NGL Award for Journalists, Whistleblowers & Defenders of the Right to Information was established in 2018 in honour of Galizia.
Early life and education
Daphne Anne Vella was born on 26 August 1964 in Tower Road, Sliema. She was the eldest of four sisters born to the businessman Michael Alfred Vella and his wife Rose Marie Vella (née Mamo). She was educated at St Dorothy's Convent (Mdina) and St Aloysius' College, Birkirkara. She attended the University of Malta as a mature student and took a BA (Hons) in Archaeology with a minor in Anthropology in 1997, featuring on the Dean's List in 1996.
Caruana Galizia was exposed to politics in her late teens, having been arrested when she was 18 years old following participation in anti-government protests. The policeman who arrested her, Angelo Farrugia, went on to become the Speaker of the Maltese parliament.
In 1985, she married the lawyer Peter Caruana Galizia, a grandson of John Caruana and a great-grandson of E.L. Galizia and A.A. Caruana. The couple had three sons, Matthew, Andrew and Paul. Matthew was a member of the International Consortium of Investigative Journalists. The family left Sliema in 1990, moving to Bidnija, a hamlet in the limits of Mosta.
Career
Caruana Galizia was employed by The Sunday Times of Malta as a news reporter in 1987, becoming a regular columnist from 1990 to 1992 and again from 1993 to 1996. She was an associate editor of The Malta Independent in 1992, and remained a columnist with that newspaper and The Malta Independent on Sunday for the rest of her career. Additionally, she worked in media and public relations consultancies. Caruana Galizia was also the founding editor of Taste and Flair, monthly lifestyle magazines which were distributed along with The Malta Independent on Sunday. The publications were merged into a single magazine called Taste&Flair in July 2014, and Caruana Galizia remained the editor until her death. Taste&Flair is now published by The Daphne Caruana Galizia Foundation.
In March 2008, she began a blog entitled Running Commentary, which included investigative reporting and commentary on current affairs and public figures. The blog was one of the most popular websites in Malta, regularly attracting over 400,000 views – more than the combined circulation of the country's newspapers.
Caruana Galizia was intimidated for her work and opinions. The front door of her house was set on fire in 1996. The family dog had its throat slit and was laid across her doorstep. Years later, the neighbour's car was burned, possibly in a misdirected attack. There was a further incident in 2006, when the house was set on fire while the family was asleep inside. After Caruana Galizia started blogging, her terrier Zulu was poisoned and her collie Rufus was put down after being found shot. According to Matthew Caruana Galizia, threats were almost a daily occurrence. These took the form of phone calls, letters, notes pinned to the front door, text messages, emails, and comments on her blog.
Caruana Galizia was arrested on 8 March 2013 for breaking the political silence on the day before the 2013 general election, after posting videos mocking Joseph Muscat. She was questioned by the police before being released after a few hours. In November 2010, after commenting about the conservation of the Villa Guardamangia (the early-marriage home of Princess Elizabeth and Prince Philip of Great Britain), Caruana Galizia was described by The Daily Telegraph as the leading commentator in Malta. Other major stories and controversies centered around Panama Papers revelations, and allegations that Chris Cardona had visited a brothel during an official government visit to Germany in January 2017.
In 2016, Caruana Galizia questioned how British millionaire Paul Golding acquired Palazzo Nasciaro in Naxxar, and from mid-2017 Caruana Galizia became a harsh critic of the new Nationalist opposition leader Adrian Delia, over claims that he had laundered money for a company involved in a prostitution ring in Soho.
Panama Papers
On 22 February 2016, Caruana Galizia's Running Commentary blog reported that Maltese government minister Konrad Mizzi had connections with Panama and New Zealand. This compelled the minister to reveal the existence of a New Zealand-registered trust two days later, which he claimed was set up to manage his family's assets. On 25 February, Caruana Galizia revealed that Prime Minister Joseph Muscat's chief of staff Keith Schembri owned a similar trust in New Zealand, which in turn held a Panama company.
The April 2016 Panama Papers leak confirmed that Mizzi owned the Panama company Hearnville Inc., and that Mizzi and Schembri had also started another company, Tillgate Inc. The companies were co-owned by the Orion Trust New Zealand Limited, the same trustees of Mizzi and Schembri's New Zealand trusts, Rotorua and Haast respectively. As the first person to break news of Mizzi's and Schembri's involvement in Panama, she was subsequently named by Politico as one of "28 people who are shaping, shaking and stirring Europe". The publication described her as a "one-woman WikiLeaks, crusading against untransparency and corruption in Malta".
In 2017, she alleged that Egrant, another Panama company, was owned by Michelle Muscat, wife of Prime Minister Joseph Muscat. Muscat claimed that the allegations were the reason he called the June 2017 general elections almost a year early, a vote which saw his Labour Party return to power. Caruana Galizia pointed out that an early election had already been planned.
The title of her last blog post before she was killed read, "That crook Schembri was in court today, pleading that he is not a crook", ending with the line "there are crooks everywhere you look now. The situation is desperate."
On 20 November 2019, police arrested Yorgen Fenech, owner of the Dubai-based company 17 Black, on his yacht. This company had been featured in the journalist's investigative work on the Panama Papers in relation to Keith Schembri and Konrad Mizzi, who – along with cabinet member Chris Cardona – resigned their government posts on 26 November. Schembri was arrested, then released two days later, which brought many people into the streets through the weekend in the capital Valletta. From 20 November, crowds had begun calling on PM Joseph Muscat to resign (see 2019 Maltese protests) after he said he might pardon the "middleman" in the murder case.
Libel and criminal defamation cases
In 2010, Caruana Galizia used her blog to criticise Magistrate Consuelo Scerri Herrera, who, together with Herrera's live-in partner, Labour government consultant Robert Musumeci, went on to file a criminal complaint with the police, forcing them to prosecute Caruana Galizia in the criminal courts. The case was withdrawn in November 2011.
In May 2017, Pilatus Bank's owner and chairman, Ali Sadr Hasheminejad, sued Daphne Caruana Galizia in an Arizona court in his own name and in the name of Pilatus Bank. The case was for US$40 million in damages. Caruana Galizia was never notified about it and it was withdrawn within hours of her death.
Pilatus Bank had written to every single non-government aligned media outlet in Malta throughout the course of 2017 threatening to sue them, but had only gone through with the threat in Daphne Caruana Galizia's case as the other media outlets conceded to changes to their online content. One media outlet reported that threatening letters had been sent just 12 hours before Daphne Caruana Galizia was killed.
In February 2017, a legal fund was crowdfunded to cover four precautionary warrants – freezing Caruana Galizia's assets to the tune of €50,000 – for the maximum libel damages possible at law. These warrants had been instituted by the Deputy Leader of the Labour Party and Minister for the Economy, Chris Cardona, and his EU presidency policy officer, Joseph Gerada.
At the time of her death, Daphne Caruana Galizia was facing 48 libel suits.
Death
On 16 October 2017, Caruana Galizia was driving close to her home in Bidnija, when a car bomb placed in her leased Peugeot 108 exploded, killing her instantly. The blast occurred on Triq il-Bidnija (Bidnija Road), and left the vehicle scattered in several pieces across nearby fields.
Caruana Galizia was in the driver's seat at the time, when the blast threw the car 80 metres into an adjacent field where her bodily remains were found by her son Matthew. He wrote on Facebook, "I looked down and there were my mother's body parts all around me". This marked the sixth car-bombing in Malta since the beginning of 2016, and the fourth fatality. Caruana Galizia's home had not been under police guard since 2010, except during elections. According to police sources, her protection was further weakened after Joseph Muscat, a subject of her investigations, was returned to power in 2013.
The power to set up a public inquiry into whether the assassination of Daphne Caruana Galizia could have been prevented, rested with then Maltese Prime Minister, Joseph Muscat. Muscat, however, did not immediately set up a public inquiry, and a formal request by Caruana Galizia's heirs was presented by letter to Malta's prime minister Muscat on 9 August 2018, based on the legal opinion of Doughty Street Chambers and Bhatt Murphy Solicitors.
Reactions
Her family criticized the Maltese authorities for doing nothing against a growing "culture of impunity" in Malta, saying that Joseph Muscat, Keith Schembri, Chris Cardona, Konrad Mizzi, Attorney General Peter Grech and a long list of police commissioners who took no action, were politically responsible for her death. Her family refused a request to publicly endorse a government reward of one million euros for information, despite pressure from the Prime Minister and President, and insisted that the Prime Minister ought to resign.
One of Caruana Galizia's sisters stated that "the President and the Prime Minister are 'downplaying' the assassination and "working to transform her into a martyr for their cause", indicating that calls for national unity were a sham, and that to "call for unity is to abuse her legacy. There should never be unity with the criminal and the corrupt."
The car bomb attack was condemned by Prime Minister Joseph Muscat, who stated that he "will not rest before justice is done" despite her criticism of him. President Marie Louise Coleiro Preca, Archbishop Charles Scicluna and a number of politicians also expressed their condolences or condemned the car bomb attack. Opposition leader Adrian Delia called her death "the collapse of democracy and freedom of expression" and stated that "[the country's] institutions have let us down".
Fellow blogger Manuel Delia, a former Nationalist Party official, called her "the only ethical voice left. She was the only one talking about right and wrong."
The President of the European Commission, Jean-Claude Juncker and the European Commission condemned the attack in the strongest terms possible.
The President of the European Parliament Antonio Tajani called the incident a "tragic example of a journalist who sacrificed her life to seek out the truth". Gerard Ryle, director of the International Consortium of Investigative Journalists, stated that the organization is "shocked" by Caruana Galizia's assassination and "is deeply concerned about freedom of the press in Malta".
A plenary session of the European Parliament was held on 24 October, with MEPs observing a minute's silence. Several members of Caruana Galizia's family attended the session at the hemicycle in Strasbourg. The press room at the European parliament building was renamed in her honour. A debate on freedom of the press and the protection of journalists in Malta also took place. Following this visit and the following debate, a delegation is to be sent by the European Parliament to investigate the rule of law, high-level cases of money laundering, and corruption in Malta.
Pope Francis sent a letter of condolence, saying he was praying for the journalist's family and the Maltese people.
The car bombing was reported in both local and international media. Caruana Galizia's name began trending worldwide on Twitter, and a number of Maltese expressed their mourning by blacking out their Facebook profile pictures. The hashtag #JeSuisDaphne, echoing the term Je suis Charlie, trended locally.
The Malta Independent wrote that "for many people, looking up her blog was the first thing they did each day, and the last thing too. Now there is just emptiness. A silence that speaks volumes." Both the daily and the weekly version of her column were published as blank pages in the days following her death.
Thousands of people attended a vigil in Caruana Galizia's hometown Sliema on the night of 16 October. Another vigil was held at the Malta High Commission in London.
WikiLeaks founder Julian Assange announced that he would pay a €20,000 reward "for information leading to the conviction of Caruana Galizia's killers". A crowdfunding campaign was initiated with the aim of raising €1 million to be given as a reward for information that leads "to the successful prosecution of the assassin and the person or persons who ordered the assassination". This was followed by a further state-sanctioned reward of €1 million.
Students, alumni, teachers, parents and members of the San Anton community held a peaceful vigil from City Gate to the Great Siege Monument in Valletta, in support of the Caruana Galizia family. The three Caruana Galizia siblings were all students of San Anton School.
On 22 October 2017, the Civil Society Network organised a protest demanding justice in Valletta. Thousands of protesters demanded justice in the aftermath of the car bomb attack, and called for the immediate resignation of the Police Commissioner and the Attorney General.
A number of protesters who took part in the rally also went on to the police headquarters in Floriana to call for the police commissioner's resignation. After staging a sit-in protest in front of the main door, a banner with a photo of police chief Lawrence Cutajar accompanied with the words "No change, no justice – irrizenja (resign)" was placed on the headquarters' gate.
On 17 April 2018, a consortium of 45 journalists from 18 news organisations, including The Guardian, The New York Times, Le Monde and the Times of Malta, published The Daphne Project, a collaborative effort to complete Caruana Galizia's investigative work.
After her death, crowds gathered in front of the Law Courts, to mourn and express solidarity with the Caruana Galizia family and to demand justice. The Great Siege Monument became a focal point for protests and calls for justice, with tributes, memorials and vigils held there frequently. The choice of this monument as a protest site, though strategically located opposite the law courts, was spontaneous, a follow-up to the flowers which were first placed there by San Anton School pupils.
The GUE/NGL Award for Journalists, Whistleblowers & Defenders of the Right to Information was named in honour of Caruana Galizia in 2018 and again in 2019. It is sponsored by the Confederal Group of the European United Left/Nordic Green Left members of which are left-wing members of the European Parliament. The award is "dedicated to individuals or groups who have been intimidated and/or persecuted for uncovering the truth and exposing it to the public".
European Parliament
The European Parliament held a minute's silence in honour of Caruana Galizia. The media room of the European Parliament in Strasbourg was named in her memory in November 2017. A portrait of her by Marie Louise Kold now hangs outside the press room.
Investigation into the circumstances of the car bomb attack
Forensic teams and police investigators arrived at the crime scene soon after the explosion. The head of the magisterial inquiry was initially to be Magistrate Consuelo Scerri Herrera, who had previously had the police prosecute Caruana Galizia for criminal libel in 2010–11. Caruana Galizia's family successfully challenged Scerri Herrera's role in the investigation, citing a conflict of interest. Scerri Herrera recused herself from the investigation 17 hours later and was replaced by Magistrate Anthony Vella, who was removed from the inquiry when he was appointed judge.
Joseph Muscat stated that the United States Federal Bureau of Investigation was asked to help the police in investigating the car bomb attack. A police forensic investigation team from the Netherlands also arrived to assist. The investigators were also joined by three Europol officials. The non-Maltese teams provided technical support. On 4 December 2017, Joseph Muscat announced that ten individuals had been arrested in connection to the investigation, three of whom were later charged with executing the car bomb attack. The suspects were identified as George Degiorgio, his brother Alfred Degiorgio, and their friend Vince Muscat (no relation to Joseph Muscat, the former Prime Minister).
Prominent Maltese businessman Yorgen Fenech was arrested on 20 November 2019 in connection with the Caruana Galizia bomb attack. Chief of Staff Keith Schembri resigned his government post on 26 November 2019, and was subsequently arrested by the police for questioning. It was later announced that Fenech would not be granted immunity to reveal what he knew about the case.
Numerous mass protests were held calling for Prime Minister Joseph Muscat's resignation, in part over his purported association with Caruana Galizia's murder.
Muscat announced on 1 December 2019 that he would resign in relation to the political crisis, saying that he would remain in office until a new Labour Party leader was elected in January, and formally resign as prime minister a few days after 12 January 2020.
On 23 February 2021, Vince Muscat, known as il-Koħħu, was sentenced to 15 years in prison after pleading guilty to the murder of Daphne Caruana Galizia. In his testimony, Muscat claimed that Alfred Degiorgio, who is also charged of executing the car bomb, received information from former Minister Chris Cardona on Caruana Galizia's whereabouts prior to her assassination, and subsequent tip-offs prior to the December 2017 arrests. Cardona dismissed these allegations as 'pure evil fiction'.
An inquiry by former judges "accused the Maltese state of creating a pervasive 'atmosphere of impunity' that allowed her killers to believe they'd face minimal consequences".
In July 2022, Alfred Degiorgio's brother George Degiorgio, speaking from jail, confessed to detonating the car bomb that killed Galizia and noted that he would plead guilty to try and get his and his brother's sentences reduced.
On the first day of the trial at Valletta’s central court in October 2022, both George and Alfred Degiorgio dramatically changed their pleas to "guilty" on charges including wilful homicide, causing a fatal explosion, illegally possessing explosives, and criminal conspiracy. They were sentenced to 40-year prison terms.
Funeral
Caruana Galizia's remains were released for burial on 27 October 2017, and a public funeral was held on 3 November 2017 at the Rotunda of Mosta. Thousands of mourners attended the funeral. The day was observed as a national day of mourning in Malta. The funeral mass was conducted by Charles Scicluna, Archbishop of Malta, who in his homily told journalists "never to grow weary in your mission to be the eyes, the ears, and the mouth of the people".
President Marie-Louise Coleiro Preca and Prime Minister Joseph Muscat did not attend the funeral, saying that Caruana Galizia's family made it clear that they (Preca and Muscat) were not welcome. The Leader of the Opposition, Adrian Delia, was "conspicuous by his absence".
Among the people at the funeral were several high officials: Silvio Camilleri, Chief Justice of Malta; Antonio Tajani, President of the European Parliament; Harlem Désir, OSCE Representative on Freedom of the Media; Eddie Fenech Adami, former President of Malta and former leader of the Nationalist Party; Lawrence Gonzi, former Prime Minister of Malta and former leader of the Nationalist Party; and Simon Busuttil, former leader of the Nationalist Party.
Caruana Galizia was buried in the family grave at the Santa Maria Addolorata Cemetery in Paola, Malta's largest burial ground.
Posthumous awards and honours
Salle Daphne Caruana Galizia – press room dedication, November 2017, European Parliament Building, Strasbourg, France.
Premio Leali delle Notizie – award dedicated to Daphne Caruana Galizia, 9 November 2017, Ronchi dei Legionari, Italy
Holme Award – awarded 1 December 2017.
Reporter Preis – awarded 1 December 2017, Reporter Forum, Berlin, Germany.
Pegaso d'Argento – awarded 1 December 2017, Tuscan Regional Council, Italy
Premio Giornalisti – awarded 14 December 2017, Tuscan Journalists Association, Italy
Person of the Year – 2 December 2017, La Repubblica, Italy
Nothing But The Truth – awarded 5 January 2018, Giuseppe Fava Foundation, Catania, Italy
Tully Award for Free Speech – awarded 3 April 2018, Tully Center for Free Speech, Newhouse School, Syracuse University, USA
Civitas Award – awarded 12 April 2018, Associazione Nazionale Donne Elettrici (A.N.D.E.), Nocera, Italy
The Astor Award – awarded 16 April 2018, Commonwealth Press Union Media Trust, London, UK
Anna Politkovskaya Award – awarded 23 April 2018, Swedish National Press Club, Stockholm, Sweden
Libera Ragusa Presidio dedicated to the memory of Daphne Caruana Galizia on 30 April 2018
Premio Mario Francese – awarded 2 May 2018, Sicilian Order of Journalists, Palermo, Italy
Difference Day Honorary Title – awarded 5 May 2018, Brussels University Alliance, Brussels, Belgium
Conscience-in-Media Award – awarded 18 May 2018, American Society of Journalists and Authors, New York City
Contribution to Society Award – awarded 23 May 2018, European Leadership Awards, Brussels, Belgium
Award for Journalists, Whistleblowers and Defenders of the Right to Information – 2018 award dedicated to Daphne Caruana Galizia, GUE/NGL, Strasbourg, France
PEC 2018 – awarded 4 June 2018, Press Emblem Campaign, Geneva, Switzerland
Newseum Memorial – rededicated 4 June 2018, Newseum, Washington D.C., USA
Premio Luca Colletti – awarded 15 June 2018, Rome, Italy
MCCV Annual Award – awarded 21 July 2018, Maltse Community Council of Victoria, Australia
Commemoration – 4 October 2018, Themis & Metis, Camera dei Deputati, Rome, Italy
War Reporters Memorial commemoration – 11 October 2018, Reporters Without Borders, Bayeux, France
Anti-Corruption Award – 21 October 2018, Transparency International.
Premio Europeo Giornalismo Giudiziario e Investigativo – awarded 28 October 2018, Taormina, Italy
Martin Adler Prize – awarded 1 November 2018, Rory Peck Trust, London, UK
Golden Victoria for Press Freedom – 5 November 2018, German Free Press & VDZ, Berlin, Germany.
Guardian Award – 6 May 2020, Association of Certified Fraud Examiners, Austin, Texas, USA
Allard Prize for International Integrity – 21 October 2020, The Allied Prize Foundation
Memorial monument, Iveagh Gardens, Dublin – 9 December 2020, Front Line Defenders
Selected literature
Gattaldo; (2020) Fearless: The Story of Daphne Caruana Galizia. UK: Otter Barry Books. ISBN 978-1-91307-404-3
See also
2019 Malta political crisis
List of journalists killed in Europe
Ján Kuciak
Frank Schneider (spy) § Sandstone
References
External links
Caruana Galizia's Running Commentary blog
The Daphne Project
1964 births
2017 deaths
2017 murders in Europe
20th-century journalists
21st-century journalists
21st-century women journalists
University of Malta alumni
Assassinated bloggers
Assassinated Maltese journalists
Deaths by car bomb in Malta
English-language writers from Malta
Female murder victims
Magazine editors
Maltese bloggers
Maltese Roman Catholics
Maltese women journalists
Panama Papers
People from Sliema
People murdered in Malta
Unsolved murders in Malta
Maltese women bloggers
Women magazine editors
|
```java
package com.microsoft.bot.sample.teamstaskmodule;
import com.microsoft.bot.schema.teams.TaskModuleContinueResponse;
import com.microsoft.bot.schema.teams.TaskModuleMessageResponse;
import com.microsoft.bot.schema.teams.TaskModuleResponse;
import com.microsoft.bot.schema.teams.TaskModuleTaskInfo;
public final class TaskModuleResponseFactory {
public static TaskModuleResponse createResponse(String message) {
TaskModuleMessageResponse taskModuleMessageResponse = new TaskModuleMessageResponse();
taskModuleMessageResponse.setValue(message);
TaskModuleResponse taskModuleResponse = new TaskModuleResponse();
taskModuleResponse.setTask(taskModuleMessageResponse);
return taskModuleResponse;
}
public static TaskModuleResponse createResponse(TaskModuleTaskInfo taskInfo) {
TaskModuleContinueResponse taskModuleContinueResponse = new TaskModuleContinueResponse();
taskModuleContinueResponse.setValue(taskInfo);
TaskModuleResponse taskModuleResponse = new TaskModuleResponse();
taskModuleResponse.setTask(taskModuleContinueResponse);
return taskModuleResponse;
}
public static TaskModuleResponse toTaskModuleResponse(TaskModuleTaskInfo taskInfo) {
return createResponse(taskInfo);
}
}
```
|
```asciidoc
// Module included in the following assemblies:
// assembly-management-tasks.adoc
[id='proc-manual-restart-mirrormaker2-connector-task-{context}']
= Manually restarting MirrorMaker 2 connector tasks
[role="_abstract"]
Use the `strimzi.io/restart-connector-task` annotation to manually trigger a restart of a MirrorMaker 2 connector.
.Prerequisites
* The Cluster Operator is running.
.Procedure
. Find the name of the `KafkaMirrorMaker2` custom resource that controls the MirrorMaker 2 connector task you want to restart:
+
[source,shell,subs="+quotes"]
----
kubectl get KafkaMirrorMaker2
----
. Find the name of the connector and the ID of the task to be restarted from the `KafkaMirrorMaker2` custom resource:
+
[source,shell,subs="+quotes"]
----
kubectl describe KafkaMirrorMaker2 <mirrormaker_cluster_name>
----
+
Task IDs are non-negative integers, starting from 0.
. Use the name and ID to restart the connector task by annotating the `KafkaMirrorMaker2` resource in Kubernetes:
+
[source,shell,subs="+quotes"]
----
kubectl annotate KafkaMirrorMaker2 <mirrormaker_cluster_name> "strimzi.io/restart-connector-task=<mirrormaker_connector_name>:<task_id>"
----
+
In this example, task `0` for connector `my-connector` in the `my-mirror-maker-2` cluster is restarted:
+
[source,shell,subs="+quotes"]
----
kubectl annotate KafkaMirrorMaker2 my-mirror-maker-2 "strimzi.io/restart-connector-task=my-connector:0"
----
. Wait for the next reconciliation to occur (every two minutes by default).
+
The MirrorMaker 2 connector task is restarted, as long as the annotation was detected by the reconciliation process.
When MirrorMaker 2 accepts the request, the annotation is removed from the `KafkaMirrorMaker2` custom resource.
```
|
```html
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "path_to_url">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Class template any<Concept, T &></title>
<link rel="stylesheet" href="../../../../doc/src/boostbook.css" type="text/css">
<meta name="generator" content="DocBook XSL Stylesheets V1.79.1">
<link rel="home" href="../../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
<link rel="up" href="../../boost_typeerasure/reference.html#header.boost.type_erasure.any_hpp" title="Header <boost/type_erasure/any.hpp>">
<link rel="prev" href="../../boost_typeerasure/reference.html" title="Reference">
<link rel="next" href="any_Conc_1_3_41_13_1_1_1_2.html" title="Class template any<Concept, const T &>">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../../boost.png"></td>
<td align="center"><a href="../../../../index.html">Home</a></td>
<td align="center"><a href="../../../../libs/libraries.htm">Libraries</a></td>
<td align="center"><a href="path_to_url">People</a></td>
<td align="center"><a href="path_to_url">FAQ</a></td>
<td align="center"><a href="../../../../more/index.htm">More</a></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../../boost_typeerasure/reference.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_typeerasure/reference.html#header.boost.type_erasure.any_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="any_Conc_1_3_41_13_1_1_1_2.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
<div class="refentry">
<a name="boost.type_erasure.any_Conc_1_3_41_13_1_1_1_1"></a><div class="titlepage"></div>
<div class="refnamediv">
<h2><span class="refentrytitle">Class template any<Concept, T &></span></h2>
<p>boost::type_erasure::any<Concept, T &></p>
</div>
<h2 xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
<div xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: <<a class="link" href="../../boost_typeerasure/reference.html#header.boost.type_erasure.any_hpp" title="Header <boost/type_erasure/any.hpp>">boost/type_erasure/any.hpp</a>>
</span><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept<span class="special">,</span> <span class="keyword">typename</span> T<span class="special">></span>
<span class="keyword">class</span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html" title="Class template any<Concept, T &>">any</a><span class="special"><</span><span class="identifier">Concept</span><span class="special">,</span> <span class="identifier">T</span> <span class="special">&</span><span class="special">></span> <span class="special">{</span>
<span class="keyword">public</span><span class="special">:</span>
<span class="comment">// <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#boost.type_erasure.any_Conc_1_3_41_13_1_1_1_1construct-copy-destruct">construct/copy/destruct</a></span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_4-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_5-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_6-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_7-bb"><span class="identifier">any</span></a><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept</span><span class="special">,</span> <span class="identifier">T</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_8-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_9-bb"><span class="identifier">any</span></a><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_10-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_11-bb"><span class="identifier">any</span></a><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_12-bb"><span class="identifier">any</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="binding.html" title="Class template binding">binding</a><span class="special"><</span> <span class="identifier">Concept</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_13-bb"><span class="identifier">any</span></a><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span><span class="special">,</span> <span class="keyword">const</span> <a class="link" href="binding.html" title="Class template binding">binding</a><span class="special"><</span> <span class="identifier">Concept</span> <span class="special">></span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_14-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_15-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a class="link" href="any_Conc_1_3_41_13_1_1_1_1.html#id-1_3_41_13_1_1_1_1_16-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="keyword">const</span> <span class="identifier">U</span> <span class="special">&</span><span class="special">)</span><span class="special">;</span>
<span class="special">}</span><span class="special">;</span></pre></div>
<div class="refsect1">
<a name="id-1.3.41.13.2.2.4"></a><h2>Description</h2>
<div class="refsect2">
<a name="id-1.3.41.13.2.2.4.2"></a><h3>
<a name="boost.type_erasure.any_Conc_1_3_41_13_1_1_1_1construct-copy-destruct"></a><code class="computeroutput">any</code>
public
construct/copy/destruct</h3>
<div class="orderedlist"><ol class="orderedlist" type="1">
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a name="id-1_3_41_13_1_1_1_1_4-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span> arg<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from a reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term"><code class="computeroutput">arg</code></span></p></td>
<td><p>The object to bind the reference to.</p></td>
</tr></tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">U</code> is a model of <code class="computeroutput">Concept</code>. </p>
<p><code class="computeroutput">Concept</code> must not refer to any non-deduced placeholder besides <code class="computeroutput">T</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_5-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span> arg<span class="special">,</span> <span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span> binding<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from a reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">arg</code></span></p></td>
<td><p>The object to bind the reference to. </p></td>
</tr>
<tr>
<td><p><span class="term"><code class="computeroutput">binding</code></span></p></td>
<td><p>Specifies the actual types that all the placeholders should bind to.</p></td>
</tr>
</tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">U</code> is a model of <code class="computeroutput">Concept</code>. </p>
<p><code class="computeroutput">Map</code> is an MPL map with an entry for every non-deduced placeholder referred to by <code class="computeroutput">Concept</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><a name="id-1_3_41_13_1_1_1_1_6-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The reference to copy.</p></td>
</tr></tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><a name="id-1_3_41_13_1_1_1_1_7-bb"></a><span class="identifier">any</span><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept</span><span class="special">,</span> <span class="identifier">T</span> <span class="special">></span> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The object to bind the reference to.</p></td>
</tr></tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_8-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The reference to copy.</p></td>
</tr></tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">Concept</code> must not refer to any non-deduced placeholder besides <code class="computeroutput">T</code>. </p>
<p>After substituting <code class="computeroutput">T</code> for <code class="computeroutput">Tag2</code>, the requirements of <code class="computeroutput">Concept2</code> must be a superset of the requirements of <code class="computeroutput">Concept</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>std::bad_alloc </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span> <a name="id-1_3_41_13_1_1_1_1_9-bb"></a><span class="identifier">any</span><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The object to bind the reference to.</p></td>
</tr></tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">Concept</code> must not refer to any non-deduced placeholder besides <code class="computeroutput">T</code>. </p>
<p>After substituting <code class="computeroutput">T</code> for <code class="computeroutput">Tag2</code>, the requirements of <code class="computeroutput">Concept2</code> must be a superset of the requirements of <code class="computeroutput">Concept</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>std::bad_alloc </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_10-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span> other<span class="special">,</span>
<span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span> binding<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">binding</code></span></p></td>
<td><p>Specifies the mapping between the two concepts.</p></td>
</tr>
<tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The reference to copy. </p></td>
</tr>
</tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">Map</code> must be an MPL map with keys for all the non-deduced placeholders used by <code class="computeroutput">Concept</code> and values for the corresponding placeholders in <code class="computeroutput">Concept2</code>. </p>
<p>After substituting placeholders according to <code class="computeroutput">Map</code>, the requirements of <code class="computeroutput">Concept2</code> must be a superset of the requirements of <code class="computeroutput">Concept</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>std::bad_alloc </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">,</span> <span class="keyword">typename</span> Map<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_11-bb"></a><span class="identifier">any</span><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span> other<span class="special">,</span> <span class="keyword">const</span> <a class="link" href="static_binding.html" title="Struct template static_binding">static_binding</a><span class="special"><</span> <span class="identifier">Map</span> <span class="special">></span> <span class="special">&</span> binding<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">binding</code></span></p></td>
<td><p>Specifies the mapping between the two concepts.</p></td>
</tr>
<tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The object to bind the reference to. </p></td>
</tr>
</tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td>
<p><code class="computeroutput">Map</code> must be an MPL map with keys for all the non-deduced placeholders used by <code class="computeroutput">Concept</code> and values for the corresponding placeholders in <code class="computeroutput">Concept2</code>. </p>
<p>After substituting placeholders according to <code class="computeroutput">Map</code>, the requirements of <code class="computeroutput">Concept2</code> must be a superset of the requirements of <code class="computeroutput">Concept</code>.</p>
</td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>std::bad_alloc </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_12-bb"></a><span class="identifier">any</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">&</span> <span class="special">></span> <span class="special">&</span> other<span class="special">,</span>
<span class="keyword">const</span> <a class="link" href="binding.html" title="Class template binding">binding</a><span class="special"><</span> <span class="identifier">Concept</span> <span class="special">></span> <span class="special">&</span> binding<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another reference.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">binding</code></span></p></td>
<td><p>Specifies the bindings of placeholders to actual types.</p></td>
</tr>
<tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The reference to copy. </p></td>
</tr>
</tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td><p>The type stored in <code class="computeroutput">other</code> must match the type expected by <code class="computeroutput">binding</code>.</p></td>
</tr>
<tr>
<td><p><span class="term">Postconditions:</span></p></td>
<td><p>binding_of(*this) == <code class="computeroutput">binding</code> </p></td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> Concept2<span class="special">,</span> <span class="keyword">typename</span> Tag2<span class="special">></span>
<a name="id-1_3_41_13_1_1_1_1_13-bb"></a><span class="identifier">any</span><span class="special">(</span><a class="link" href="../any.html" title="Class any">any</a><span class="special"><</span> <span class="identifier">Concept2</span><span class="special">,</span> <span class="identifier">Tag2</span> <span class="special">></span> <span class="special">&</span> other<span class="special">,</span> <span class="keyword">const</span> <a class="link" href="binding.html" title="Class template binding">binding</a><span class="special"><</span> <span class="identifier">Concept</span> <span class="special">></span> <span class="special">&</span> binding<span class="special">)</span><span class="special">;</span></pre>
<p>Constructs an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code> from another <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term">Parameters:</span></p></td>
<td><div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody>
<tr>
<td><p><span class="term"><code class="computeroutput">binding</code></span></p></td>
<td><p>Specifies the bindings of placeholders to actual types.</p></td>
</tr>
<tr>
<td><p><span class="term"><code class="computeroutput">other</code></span></p></td>
<td><p>The object to bind the reference to. </p></td>
</tr>
</tbody>
</table></div></td>
</tr>
<tr>
<td><p><span class="term">Requires:</span></p></td>
<td><p>The type stored in <code class="computeroutput">other</code> must match the type expected by <code class="computeroutput">binding</code>.</p></td>
</tr>
<tr>
<td><p><span class="term">Postconditions:</span></p></td>
<td><p>binding_of(*this) == <code class="computeroutput">binding</code> </p></td>
</tr>
<tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Nothing. </td>
</tr>
</tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a name="id-1_3_41_13_1_1_1_1_14-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Assigns to an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>If an appropriate overload of <code class="computeroutput"><a class="link" href="assignable.html" title="Struct template assignable">assignable</a></code> is not available and <code class="computeroutput"><a class="link" href="relaxed.html" title="Struct relaxed">relaxed</a></code> is in <code class="computeroutput">Concept</code>, falls back on constructing from <code class="computeroutput">other</code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Whatever the assignment operator of the contained type throws. When falling back on construction, throws <code class="computeroutput">std::bad_alloc</code>. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides. </td>
</tr></tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a name="id-1_3_41_13_1_1_1_1_15-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="identifier">U</span> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Assigns to an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>If an appropriate overload of <code class="computeroutput"><a class="link" href="assignable.html" title="Struct template assignable">assignable</a></code> is not available and <code class="computeroutput"><a class="link" href="relaxed.html" title="Struct relaxed">relaxed</a></code> is in <code class="computeroutput">Concept</code>, falls back on constructing from <code class="computeroutput">other</code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Whatever the assignment operator of the contained type throws. When falling back on construction, throws <code class="computeroutput">std::bad_alloc</code>. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides. </td>
</tr></tbody>
</table></div>
</li>
<li class="listitem">
<pre class="literallayout"><span class="keyword">template</span><span class="special"><</span><span class="keyword">typename</span> U<span class="special">></span> <a class="link" href="../any.html" title="Class any">any</a> <span class="special">&</span> <a name="id-1_3_41_13_1_1_1_1_16-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="keyword">const</span> <span class="identifier">U</span> <span class="special">&</span> other<span class="special">)</span><span class="special">;</span></pre>
<p>Assigns to an <code class="computeroutput"><a class="link" href="any.html" title="Class template any">any</a></code>.</p>
<p>If an appropriate overload of <code class="computeroutput"><a class="link" href="assignable.html" title="Struct template assignable">assignable</a></code> is not available and <code class="computeroutput"><a class="link" href="relaxed.html" title="Struct relaxed">relaxed</a></code> is in <code class="computeroutput">Concept</code>, falls back on constructing from <code class="computeroutput">other</code>.</p>
<p>
</p>
<div class="variablelist"><table border="0" class="variablelist compact">
<colgroup>
<col align="left" valign="top">
<col>
</colgroup>
<tbody><tr>
<td><p><span class="term">Throws:</span></p></td>
<td>Whatever the assignment operator of the contained type throws. When falling back on construction, throws <code class="computeroutput">std::bad_alloc</code>. In this case assignment provides the strong exception guarantee. When calling the assignment operator of the contained type, the exception guarantee is whatever the contained type provides. </td>
</tr></tbody>
</table></div>
</li>
</ol></div>
</div>
</div>
</div>
<table xmlns:rev="path_to_url~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
file LICENSE_1_0.txt or copy at <a href="path_to_url" target="_top">path_to_url
</p>
</div></td>
</tr></table>
<hr>
<div class="spirit-nav">
<a accesskey="p" href="../../boost_typeerasure/reference.html"><img src="../../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../../boost_typeerasure/reference.html#header.boost.type_erasure.any_hpp"><img src="../../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="../../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="any_Conc_1_3_41_13_1_1_1_2.html"><img src="../../../../doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>
```
|
```java
/***************************************************************************
* CLASS BuiltInSymbols *
* *
* Defines the TLA+ built-in symbols, their alignment classes, and how *
* they are typeset. Provides the following methods. *
* *
* Initialize() *
* Must be called before any other methods of the class are *
* called. *
* *
* GetBuiltInSymbol(String str) *
* If str is a built-in TLA symbol, it returns the corresponding *
* Symbol object. Otherwise, it returns null. *
* *
* IsBuiltInSymbol(String str) *
* True iff str is a built-in TLA symbol. *
* *
* IsBuiltInPrefix(String str) *
* True iff str is a non-empty prefix (possibly the entire string) *
* of a built-in TLA symbol that is not a string of letters (like *
* "ENABLED" or "WF_") and is not a "\\" (a backslash) followed by *
* a string of letters (like "\\cup"). *
* *
* IsStringChar(char c) *
* True iff c is a character that can appear un-escaped (not *
* preceded by "\") in a TLA+ string. *
* *
* See the Symbol class for more information. *
***************************************************************************/
package tla2tex;
import java.util.Enumeration;
import java.util.Hashtable;
import util.TLAConstants;
public final class BuiltInSymbols
{
/***********************************************************************
* The following six hash tables are built by the Initialize method. *
***********************************************************************/
private static Hashtable builtInHashTable = new Hashtable(200);
/*********************************************************************
* Maps built-in symbols (which are strings) to their Symbol *
* objects. Does not contain PlusCal symbols. *
*********************************************************************/
private static Hashtable prefixHashTable = new Hashtable(700);
/*********************************************************************
* A table containing the prefixes of all built-in symbols in *
* builtInHashTable. (It holds only their keys.) *
*********************************************************************/
private static Hashtable pcalBuiltInHashTable = new Hashtable(200);
/*********************************************************************
* Maps built-in symbols (which are strings) to their Symbol *
* objects. It includes the PlusCal symbols. *
*********************************************************************/
private static Hashtable pcalPrefixHashTable = new Hashtable(700);
/*********************************************************************
* A table containing the prefixes of all built-in symbols in *
* pcalBuiltInHashTable. (It holds only their keys.) *
*********************************************************************/
private static Hashtable stringCharTable = new Hashtable(100);
/*********************************************************************
* A table of all the characters that may appear in a TLA+ string *
* token. *
*********************************************************************/
private static Hashtable canPrecedeLabelTable = new Hashtable(15);
/*********************************************************************
* A table of all the tokens (strings) that can precede a labeled *
* statement. *
*********************************************************************/
private static String nullString = "" ;
/*********************************************************************
* Some hash tables are used only to remember the keys; there is no *
* value attached to them. However, the Hashtable class stores a *
* non-null object with each key. This is the object we use. *
*********************************************************************/
public static void Initialize()
{ buildHashTable();
buildPrefixHashTable();
buildStringCharTable();
buildCanPrecedeLabelTable();
} ;
public static boolean IsBuiltInSymbol(String str)
{ return (null != GetBuiltInSymbol(str)) ;
} ;
/**
* Returns true iff str is a built-in symbol--either a TLA+ or
* PlusCal symbol if pcalMode = true, or just a TLA+ symbol if
* pcalMode = false.
*
* @param str : The symbols ascii string.
* @param pcalMode : true if looking for pcal symbols as well as TLA+ symbols.
* @return
*/
public static boolean IsBuiltInSymbol(String str, boolean pcalMode)
{ return null != GetBuiltInSymbol(str, pcalMode) ;
} ;
/**
* Returns the built-in symbol with string str. If pcalMode = false,
* just return a TLA+ symbol; if pcalMode = true, return either a TLA+
* or a PlusCal symbol.
* @param str
* @param pcalMode
* @return
*/
public static Symbol GetBuiltInSymbol(String str, boolean pcalMode)
{ Symbol sym ;
if (pcalMode) {
sym = (Symbol) pcalBuiltInHashTable.get(str);
}
else {
sym = (Symbol) builtInHashTable.get(str);
}
if (sym == null || (sym.pcal && ! pcalMode)) {
return null ;
}
return sym;
} ;
public static Symbol GetBuiltInSymbol(String str)
{ return (Symbol) builtInHashTable.get(str);
} ;
public static boolean IsBuiltInPrefix(String str)
{ return prefixHashTable.containsKey(str) ;
} ;
public static boolean IsBuiltInPrefix(String str, boolean pcal)
{ if (pcal) {
return pcalPrefixHashTable.containsKey(str);
}
return prefixHashTable.containsKey(str) ;
} ;
public static boolean IsStringChar(char ch)
{ return stringCharTable.containsKey(String.valueOf(ch)) ;
} ;
public static boolean CanPrecedeLabel(String str) {
return canPrecedeLabelTable.containsKey(str) ;
}
private static void buildStringCharTable()
{ String legalChars =
/**********************************************************
* Here are all the non-escaped characters that can *
* appear in a TLA+ string. *
**********************************************************/
"abcdefghijklmnopqrstuvwxyz"
+ "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
+ " ~!@#$%^&*()_-+={}[]|:;<,>.?/`'"
+ "0123456789" ;
int n = 0 ;
while (n < legalChars.length())
{ stringCharTable.put(String.valueOf(legalChars.charAt(n)), nullString);
n = n + 1 ;
}
} ;
private static void buildCanPrecedeLabelTable() {
String[] canPrecedeLabel =
{";", ")", "{", "begin", "do", "either", "or", "then", "else", "elsif"};
for (int i = 0; i < canPrecedeLabel.length; i++) {
canPrecedeLabelTable.put(canPrecedeLabel[i], nullString);
}
}
private static void add(String tla, String tex, int stype, int atype)
/*********************************************************************
* Adds a non-PlusCal entry to the builtInHashTable and *
* pcalBuiltInHashTable. *
*********************************************************************/
{ builtInHashTable.put(tla, new Symbol(tla, tex, stype, atype) ) ;
pcalBuiltInHashTable.put(tla, new Symbol(tla, tex, stype, atype) ) ; } ;
private static void pcaladd(String tla, String tex, int stype, int atype)
/*********************************************************************
* Adds a PlusCal entry to the pcalBuiltInHashTable. *
*********************************************************************/
{ pcalBuiltInHashTable.put(tla, new Symbol(tla, tex, stype, atype, true) ) ; } ;
/*
* The following special 1-character strings are for defining dummy
* strings to represent special versions of the symbols "(", ")", "{"
* and "}" that get printed differently from their normal versions.
*/
public static String pcalLeftParen = "" + '\0' ;
public static String pcalRightParen = "" + '\1' ;
public static String pcalLeftBrace = "" + '\2' ;
public static String pcalRightBrace = "" + '\3' ;
private static void buildHashTable()
/*********************************************************************
* Initializes builtInHashTable and pcalBuiltInHashTable. This code *
* actually defines the *
* symbol and alignment types and the LaTeX input for each built-in *
* symbol. It is required that, if two symbols have the same *
* alignment type, then their typeset versions have the same width. *
* *
* The LaTeX commands for all the infix symbols and some other *
* symbols are of the form \.{...}, where the \. command puts *
* \mbox{} before and after its argument. This is necessary because *
* otherwise, TeX may vary the space around the symbol depending on *
* what comes before or after it, screwing up the alignment. *
*********************************************************************/
{
add("_", "\\_", Symbol.KEYWORD, 0);
add("ASSUMPTION", "{\\ASSUMPTION}", Symbol.KEYWORD, 0);
add("AXIOM", "{\\AXIOM}", Symbol.KEYWORD, 0);
add("BOOLEAN", "{\\BOOLEAN}", Symbol.KEYWORD, 0);
add("CASE", "{\\CASE}", Symbol.INFIX, 60);
// Changed to INFIX from KEYWORD by LL on 21 July 2012 to allow
// left-aligning with []. It produces something reasonable when
// a bunch of [] symbols are right-aligned with CASE as well.
add(TLAConstants.KeyWords.CONSTANT, "{\\CONSTANT}", Symbol.KEYWORD, 0);
add("CONSTANTS", "{\\CONSTANTS}", Symbol.KEYWORD, 0);
add("EXCEPT", "{\\EXCEPT}", Symbol.KEYWORD, 0);
add("EXTENDS", "{\\EXTENDS}", Symbol.KEYWORD, 0);
add("FALSE", "{\\FALSE}", Symbol.KEYWORD, 0);
add("IF", "{\\IF}", Symbol.KEYWORD, 0);
add("INSTANCE", "{\\INSTANCE}", Symbol.KEYWORD, 0);
add("LOCAL", "{\\LOCAL}", Symbol.KEYWORD, 0);
add("MODULE", "{\\MODULE}", Symbol.KEYWORD, 0);
add("OTHER", "{\\OTHER}", Symbol.KEYWORD, 0);
add("STRING", "{\\STRING}", Symbol.KEYWORD, 0);
add("THEOREM", "{\\THEOREM}", Symbol.KEYWORD, 0);
add("TRUE", "{\\TRUE}", Symbol.KEYWORD, 0);
add(TLAConstants.KeyWords.VARIABLE, "{\\VARIABLE}", Symbol.KEYWORD, 0);
add("VARIABLES", "{\\VARIABLES}", Symbol.KEYWORD, 0);
add("WITH", "{\\WITH}", Symbol.KEYWORD, 0);
// The following added for tla2tex
add("BY", "{\\BY}", Symbol.KEYWORD, 0);
add("OBVIOUS", "{\\OBVIOUS}", Symbol.KEYWORD, 0);
add("HAVE", "{\\HAVE}", Symbol.KEYWORD, 0);
add("QED", "{\\QED}", Symbol.KEYWORD, 0);
add("TAKE", "{\\TAKE}", Symbol.KEYWORD, 0);
add("DEF", "{\\DEF}", Symbol.KEYWORD, 0);
add("HIDE", "{\\HIDE}", Symbol.KEYWORD, 0);
add("RECURSIVE", "{\\RECURSIVE}", Symbol.KEYWORD, 0);
add("USE", "{\\USE}", Symbol.KEYWORD, 0);
add("DEFINE", "{\\DEFINE}", Symbol.KEYWORD, 0);
add("PROOF", "{\\PROOF}", Symbol.KEYWORD, 0);
add("WITNESS", "{\\WITNESS}", Symbol.KEYWORD, 0);
add("PICK", "{\\PICK}", Symbol.KEYWORD, 0);
add("DEFS", "{\\DEFS}", Symbol.KEYWORD, 0);
add("SUFFICES", "{\\SUFFICES}", Symbol.KEYWORD, 0);
add("NEW", "{\\NEW}", Symbol.KEYWORD, 0);
add("LAMBDA", "{\\LAMBDA}", Symbol.KEYWORD, 0);
add("STATE", "{\\STATE}", Symbol.KEYWORD, 0);
add("ACTION", "{\\ACTION}", Symbol.KEYWORD, 0);
add("TEMPORAL", "{\\TEMPORAL}", Symbol.KEYWORD, 0);
add("ONLY", "{\\ONLY}", Symbol.KEYWORD, 0); // added by LL on 2 Oct 2009
add("OMITTED", "{\\OMITTED}", Symbol.KEYWORD, 0); // added by LL on 31 Oct 2009
add("ONLY", "{\\ONLY}", Symbol.KEYWORD, 0); // added by LL on 2 Oct 2009
add("LEMMA", "{\\LEMMA}", Symbol.KEYWORD, 0); // added by LL on 22 Oct 2010
add("PROPOSITION", "{\\PROPOSITION}", Symbol.KEYWORD, 0); // added by LL on 22 Oct 2010
add("COROLLARY", "{\\COROLLARY}", Symbol.KEYWORD, 0); // added by LL on 22 Oct 2010
add("WF_", "{\\WF}", Symbol.SUBSCRIPTED, 0);
add("SF_", "{\\SF}", Symbol.SUBSCRIPTED, 0);
add(">>_", "{\\rangle}", Symbol.SUBSCRIPTED, 0);
add("]_", "]", Symbol.SUBSCRIPTED, 0);
add("(", "(", Symbol.LEFT_PAREN, 0);
add("[", "[", Symbol.LEFT_PAREN, 0);
add("{", "\\{", Symbol.LEFT_PAREN, 0);
add("<<", "{\\langle}", Symbol.LEFT_PAREN, 0);
add(")", ")", Symbol.RIGHT_PAREN, 0);
add("}", "\\}", Symbol.RIGHT_PAREN, 0);
add("]", "]", Symbol.RIGHT_PAREN, 0);
add(">>", "{\\rangle}", Symbol.RIGHT_PAREN, 0);
add("\\A", "\\A\\,", Symbol.PREFIX, 0);
add("\\forall", "\\forall\\,", Symbol.PREFIX, 0);
add("\\E", "\\E\\,", Symbol.PREFIX, 0);
add("\\exists", "\\exists\\,", Symbol.PREFIX, 0);
add("\\AA", "{\\AA}", Symbol.PREFIX, 0);
add("\\EE", "{\\EE}", Symbol.PREFIX, 0);
add("~", "{\\lnot}", Symbol.PREFIX, 0);
add("\\lnot", "{\\lnot}", Symbol.PREFIX, 0);
add("\\neg", "{\\neg}", Symbol.PREFIX, 0);
add("<>", "{\\Diamond}", Symbol.PREFIX, 0);
add("CHOOSE", "{\\CHOOSE}", Symbol.PREFIX, 0);
add("ENABLED", "{\\ENABLED}", Symbol.PREFIX, 0);
add("UNCHANGED", "{\\UNCHANGED}", Symbol.PREFIX, 0);
add("SUBSET", "{\\SUBSET}", Symbol.PREFIX, 0);
add("UNION", "{\\UNION}", Symbol.PREFIX, 0);
add("DOMAIN", "{\\DOMAIN}", Symbol.PREFIX, 0);
add("'", "\\.{'}", Symbol.POSTFIX, 0);
add("^+", "\\.{\\mbox{}^+}", Symbol.POSTFIX, 0);
add("^*", "\\.{\\mbox{}^*}", Symbol.POSTFIX, 0);
add("^#", "\\.{\\mbox{}^{\\#}}", Symbol.POSTFIX, 0);
add("=>", "\\.{\\implies}", Symbol.INFIX, 1);
add("\\cdot", "\\.{\\cdot}", Symbol.INFIX, 2);
add("<=>", "\\.{\\equiv}", Symbol.INFIX, 3);
add("\\equiv", "\\.{\\equiv}", Symbol.INFIX, 4);
add("~>", "\\.{\\leadsto}", Symbol.INFIX, 5);
add("-+->", "\\.{\\whileop}", Symbol.INFIX, 6);
add("\\subseteq", "\\.{\\subseteq}", Symbol.INFIX, 7);
add("\\subset", "\\.{\\subset}", Symbol.INFIX, 7);
add("\\supset", "\\.{\\supset}", Symbol.INFIX, 7);
add("\\supseteq", "\\.{\\supseteq}", Symbol.INFIX, 7);
add("\\ll", "\\.{\\ll}", Symbol.INFIX, 8);
add("\\gg", "\\.{\\gg}", Symbol.INFIX, 8);
/*****************************************************************
* \ll and \gg not aligned with = and < because they are wider, *
* and they're not used enough to bother accommodating aligned *
* infix symbols of different widths. However, this might now *
* work because of changes made to handle PlusCal labels *
* essentially as infix operators. *
*****************************************************************/
add("\\", "\\.{\\,\\backslash\\,}", Symbol.INFIX, 9);
add("\\cap", "\\.{\\cap}", Symbol.INFIX, 10);
add("\\intersect", "\\.{\\cap}", Symbol.INFIX, 11);
add("\\cup", "\\.{\\cup}", Symbol.INFIX, 12);
add("\\union", "\\.{\\cup}", Symbol.INFIX, 13);
add("/\\", "\\.{\\land}", Symbol.INFIX, 14);
add("\\/", "\\.{\\lor}", Symbol.INFIX, 15);
add("\\land", "\\.{\\land}", Symbol.INFIX, 16);
add("\\lor", "\\.{\\lor}", Symbol.INFIX, 17);
add("\\X", "\\.{\\times}", Symbol.INFIX, 18);
add("-", "\\.{-}", Symbol.INFIX, 19);
add("+", "\\.{+}", Symbol.INFIX, 19);
add("*", "\\.{*}", Symbol.INFIX, 20);
add("/", "\\.{/}", Symbol.INFIX, 21);
add("^", "\\.{\\ct}", Symbol.INFIX, 22);
add("|", "\\.{\\,|\\,}", Symbol.INFIX, 23);
add("||", "\\.{\\p@barbar}", Symbol.INFIX, 24); // modified for PlusCal
add("&", "\\.{\\,\\&\\,}", Symbol.INFIX, 25);
add("&&", "\\.{\\,\\&\\&\\,}", Symbol.INFIX, 26);
add("++", "\\.{\\pp}", Symbol.INFIX, 27);
add("--", "\\.{\\mm}", Symbol.INFIX, 27);
add("**", "\\.{\\stst}", Symbol.INFIX, 28);
add("//", "\\.{\\slsl}", Symbol.INFIX, 29);
add("^^", "\\.{\\ct\\ct}", Symbol.INFIX, 30);
add("|-", "\\.{\\vdash}", Symbol.INFIX, 31);
add("|=", "\\.{\\models}", Symbol.INFIX, 32);
add("-|", "\\.{\\dashv}", Symbol.INFIX, 33);
add("=|", "\\.{\\eqdash}", Symbol.INFIX, 34);
add("<:", "\\.{\\ltcolon}", Symbol.INFIX, 35);
add(":>", "\\.{\\colongt}", Symbol.INFIX, 35);
add(":=", "\\.{:=}", Symbol.INFIX, 35);
add("::=", "\\.{::=}", Symbol.INFIX, 36);
add("(+)", "\\.{\\oplus}", Symbol.INFIX, 37);
add("(-)", "\\.{\\ominus}", Symbol.INFIX, 37);
add("\\oplus", "\\.{\\oplus}", Symbol.INFIX, 37);
add("\\ominus", "\\.{\\ominus}", Symbol.INFIX, 37);
add("(.)", "\\.{\\odot}", Symbol.INFIX, 38);
add("\\odot", "\\.{\\odot}", Symbol.INFIX, 38);
add("(/)", "\\.{\\oslash}", Symbol.INFIX, 39);
add("\\oslash", "\\.{\\oslash}", Symbol.INFIX, 39);
add("(\\X)", "\\.{\\otimes}", Symbol.INFIX, 40);
add("\\otimes", "\\.{\\otimes}", Symbol.INFIX, 40);
add("\\uplus", "\\.{\\uplus}", Symbol.INFIX, 41);
add("\\sqcap", "\\.{\\sqcap}", Symbol.INFIX, 42);
add("\\sqcup", "\\.{\\sqcup}", Symbol.INFIX, 43);
add("\\div", "\\.{\\div}", Symbol.INFIX, 44);
add("\\star", "\\.{\\star}", Symbol.INFIX, 45);
add("\\o", "\\.{\\circ}", Symbol.INFIX, 46);
add("\\circ", "\\.{\\circ}", Symbol.INFIX, 46);
add("\\bigcirc", "\\.{\\bigcirc}", Symbol.INFIX, 47);
add("\\bullet", "\\.{\\bullet}", Symbol.INFIX, 48);
add("\\in", "\\.{\\in}", Symbol.INFIX, 49);
add("\\notin", "\\.{\\notin}", Symbol.INFIX, 49);
add("=", "\\.{=}", Symbol.INFIX, 49);
add("#", "\\.{\\neq}", Symbol.INFIX, 49);
add("/=", "\\.{\\neq}", Symbol.INFIX, 49);
add("<", "\\.{<}", Symbol.INFIX, 49);
add(">", "\\.{>}", Symbol.INFIX, 49);
add("<=", "\\.{\\leq}", Symbol.INFIX, 49);
add("=<", "\\.{\\leq}", Symbol.INFIX, 49);
add(">=", "\\.{\\geq}", Symbol.INFIX, 49);
add("\\prec", "\\.{\\prec}", Symbol.INFIX, 49);
add("\\succ", "\\.{\\succ}", Symbol.INFIX, 49);
add("\\preceq", "\\.{\\preceq}", Symbol.INFIX, 49);
add("\\succeq", "\\.{\\succeq}", Symbol.INFIX, 49);
add("\\sim", "\\.{\\sim}", Symbol.INFIX, 49);
add("\\simeq", "\\.{\\simeq}", Symbol.INFIX, 49);
add("\\approx", "\\.{\\approx}", Symbol.INFIX, 49);
add("\\doteq", "\\.{\\doteq}", Symbol.INFIX, 49);
add("\\asymp", "\\.{\\asymp}", Symbol.INFIX, 50);
add("\\sqsubset", "\\.{\\sqsubset}", Symbol.INFIX, 51);
add("\\sqsupset", "\\.{\\sqsupset}", Symbol.INFIX, 51);
add("\\sqsubseteq", "\\.{\\sqsubseteq}", Symbol.INFIX, 51);
add("\\sqsupseteq", "\\.{\\sqsupseteq}", Symbol.INFIX, 51);
add("\\propto", "\\.{\\propto}", Symbol.INFIX, 52);
add(":", "\\.{:}", Symbol.PUNCTUATION, 53);
add("->", "\\.{\\rightarrow}", Symbol.INFIX, 54);
add("|->", "\\.{\\mapsto}", Symbol.INFIX, 55);
add("<-", "\\.{\\leftarrow}", Symbol.INFIX, 56);
add("==", "\\.{\\defeq}", Symbol.INFIX, 57);
add("ELSE", "\\.{\\ELSE}", Symbol.PREFIX, 58);
add("THEN", "\\.{\\THEN}", Symbol.PREFIX, 58);
add("LET", "\\.{\\LET}", Symbol.INFIX, 59); // Changed by LL on 21 Jul 22
add("IN", "\\.{\\IN}", Symbol.INFIX, 59); // from PREFIX to fix alignment bug
add("[]", "{\\Box}", Symbol.INFIX, 60); // Changed from PREFIX to left-align with CASE
add("::", "{\\coloncolon}", Symbol.INFIX, 61);
add("ASSUME", "{\\ASSUME}", Symbol.KEYWORD, 62);
add("PROVE", "{\\PROVE}", Symbol.KEYWORD, 62);
add("..", "\\.{\\dotdot}", Symbol.INFIX, 0);
add("...", "\\.{\\dots}", Symbol.INFIX, 0);
add("$", "\\.{\\,\\$\\,}", Symbol.INFIX, 0);
add("$$", "\\.{\\,\\$\\$\\,}", Symbol.INFIX, 0);
add("?", "\\.{?}", Symbol.INFIX, 0);
add("??", "\\.{\\,??\\,}", Symbol.INFIX, 0);
add("%", "\\.{\\%}", Symbol.INFIX, 0);
add("%%", "\\.{\\,\\%\\%\\,}", Symbol.INFIX, 0);
add("##", "\\.{\\,\\#\\#\\,}", Symbol.INFIX, 0);
add("@@", "\\.{\\,@@\\,}", Symbol.INFIX, 0);
add("!!", "\\.{!!}", Symbol.INFIX, 0);
add("\\times", "\\.{\\times}", Symbol.INFIX, 0);
add("\\leq", "\\.{\\leq}", Symbol.INFIX, 0);
add("\\geq", "\\.{\\geq}", Symbol.INFIX, 0);
add("\\mod", "\\.{\\%}", Symbol.INFIX, 0);
add("\\wr", "\\.{\\wr}", Symbol.INFIX, 0);
add("\\cong", "\\.{\\cong}", Symbol.INFIX, 0);
add("!", "{\\bang}", Symbol.INFIX, 0);
add(",", ",\\,", Symbol.PUNCTUATION, 0);
add(".", ".", Symbol.PUNCTUATION, 0);
add("-.", "\\.{-\\!.\\,}", Symbol.MISC, 0);
add("@", "@", Symbol.MISC, 0);
// The following are added for PlusCal
pcaladd("fair", "{\\p@fair}", Symbol.KEYWORD, 0);
pcaladd("algorithm", "{\\p@algorithm}", Symbol.KEYWORD, 0);
pcaladd("--fair", "{\\p@mmfair}", Symbol.KEYWORD, 0);
pcaladd("--algorithm", "{\\p@mmalgorithm}", Symbol.KEYWORD, 0);
pcaladd(";", "{\\p@semicolon}", Symbol.PUNCTUATION, 63);
pcaladd("assert", "{\\p@assert}", Symbol.KEYWORD, 0);
pcaladd("await", "{\\p@await}", Symbol.KEYWORD, 0);
pcaladd("begin", "{\\p@begin}", Symbol.KEYWORD, 0);
pcaladd("end", "{\\p@end}", Symbol.KEYWORD, 0);
pcaladd("call", "{\\p@call}", Symbol.KEYWORD, 0);
pcaladd("define", "{\\p@define}", Symbol.KEYWORD, 0);
pcaladd("do", "{\\p@do}", Symbol.KEYWORD, 0);
pcaladd("either", "{\\p@either}", Symbol.INFIX, 64); // not sure
pcaladd("or", "{\\p@or}", Symbol.INFIX, 64); // not sure
pcaladd("goto", "{\\p@goto}", Symbol.KEYWORD, 0);
pcaladd("if", "{\\p@if}", Symbol.KEYWORD, 0);
pcaladd("then", "{\\p@then}", Symbol.INFIX, 65);
pcaladd("else", "{\\p@else}", Symbol.INFIX, 65);
pcaladd("elsif", "{\\p@elsif}", Symbol.INFIX, 65);
// I tried making "then", "else", and "elsif" KEYWORDS that all
// had the same width when printed. This didn't work because
// of the extra letter in "elsif", so if the statements that follow
// them are aligned, then TLATeX adds extra space after an "else" or
// "then" because of the extra space between it and what follows.
// Making them INFIX with the same alignment value produces some
// bogus alignments, but it seems to be the lesser evil.
pcaladd("macro", "{\\p@macro}", Symbol.KEYWORD, 0);
pcaladd("print", "{\\p@print}", Symbol.KEYWORD, 0);
pcaladd("procedure", "{\\p@procedure}", Symbol.KEYWORD, 0);
pcaladd("process", "{\\p@process}", Symbol.KEYWORD, 0);
pcaladd("return", "{\\p@return}", Symbol.KEYWORD, 0);
pcaladd("skip", "{\\p@skip}", Symbol.KEYWORD, 0);
pcaladd("variable", "{\\p@variable}", Symbol.KEYWORD, 0);
pcaladd("variables", "{\\p@variables}", Symbol.KEYWORD, 0);
pcaladd("while", "{\\p@while}", Symbol.KEYWORD, 0);
pcaladd("with", "{\\p@with}", Symbol.KEYWORD, 0);
pcaladd("when", "{\\p@when}", Symbol.KEYWORD, 0);
// The following are the symbols for the PlusCal delimiters:
// "(" ")" "{" "}"
pcaladd(pcalLeftParen, "{\\p@lparen}", Symbol.LEFT_PAREN, 0);
pcaladd(pcalRightParen, "{\\p@rparen}", Symbol.RIGHT_PAREN, 0);
pcaladd(pcalLeftBrace, "{\\p@lbrace}", Symbol.LEFT_PAREN, 0);
pcaladd(pcalRightBrace, "{\\p@rbrace}", Symbol.RIGHT_PAREN, 0);
} ;
private static void buildPrefixHashTable()
/*********************************************************************
* Initializes prefixHashTable and pcalPrefixHashTable, assuming that *
* builtInHashTable and pcalBuiltInHashTable are already initialize *
*********************************************************************/
{ Enumeration builtInEnum = builtInHashTable.keys();
while (builtInEnum.hasMoreElements())
{ String symbol = (String) builtInEnum.nextElement();
if ( Misc.IsLetter(symbol.charAt(0))
|| (symbol.length() > 1)
&& (symbol.charAt(0) == '\\')
&& Misc.IsLetter(symbol.charAt(1)))
{ /***********************************************************
* Should not put prefixes of this symbol in *
* prefixHashTable. *
***********************************************************/
}
else
{ /***********************************************************
* Put symbol and all its prefixes in prefixHashTable. *
***********************************************************/
while (symbol.length() > 0)
{ prefixHashTable.put(symbol, nullString);
symbol = symbol.substring(0, symbol.length() - 1);
} ;
} ;
}
builtInEnum = pcalBuiltInHashTable.keys();
while (builtInEnum.hasMoreElements())
{ String symbol = (String) builtInEnum.nextElement();
if ( Misc.IsLetter(symbol.charAt(0))
|| (symbol.length() > 1)
&& (symbol.charAt(0) == '\\')
&& Misc.IsLetter(symbol.charAt(1)))
{ /***********************************************************
* Should not put prefixes of this symbol in *
* prefixHashTable. *
***********************************************************/
}
else
{ /***********************************************************
* Put symbol and all its prefixes in prefixHashTable. *
***********************************************************/
while (symbol.length() > 0)
{ pcalPrefixHashTable.put(symbol, nullString);
symbol = symbol.substring(0, symbol.length() - 1);
} ;
} ;
}
}
}
/* last modified on Sat 22 Sep 2007 at 8:44:43 PST by lamport */
```
|
Andrés Antonio "Tony" González (August 28, 1936 – July 2, 2021) was a Cuban professional baseball outfielder, who played in Major League Baseball (MLB) for the Cincinnati Reds (), Philadelphia Phillies (–), San Diego Padres (), Atlanta Braves (–), and California Angels (–).
Career
A fine center fielder, González spent his best years with the Phillies. He had an average, though accurate, arm with excellent range. As a hitter, González batted for average with occasional power, drew a significant number of walks, was a good bunter, and had enough power to collect an above-average number of doubles and triples. He hit a career-high 20 home runs in ; then, in , González had career-highs in doubles (36) and triples (12), to place third and second, respectively, in the National League (NL). In , his career-high .339 batting average was second only to Roberto Clemente’s .357 for the NL batting crown, which also ranked second in the major leagues.
In his twelve-season MLB career, González hit .286 (1,485-for-5,195), with 103 home runs, 615 runs batted in (RBI), 690 runs, 238 doubles, 57 triples, and 79 stolen bases, in 1,559 games. Defensively, he recorded a .987 fielding percentage, while playing at all three outfield positions.
In the 1969 National League Championship Series against the New York Mets, González hit .357, with two RBI, one double, four runs, and one homer (off Tom Seaver). Following his big league career, González played part of the season for the Hiroshima Toyo Carp of Nippon Professional Baseball (NPB).
In total, González made about 5,800 trips to the plate over his major league career (about 4,600 — or 80% — of them against right-handed pitchers and the other 1,200 — or 20% — against left-handers); so, González averaged about 400 plate appearances per year against righties and 100 plate appearances against lefties. In total, he hit .286, with a .350 on-base percentage, and a .413 slugging percentage. But what is striking about González is that he exhibited a rather pronounced platoon-split during his career — that is, being a left-handed batter, he hit right-handed pitchers much better than he hit southpaws. For his career, Gonzalez hit .303 against righties, with a .366 on-base percentage, and a .442 slugging percentage; against lefties, these numbers were only .219/.288/.299. Given that the 1960s were a time of reduced offensive output — due in part to a larger strike zone and 4-man (rather than 5-man) rotations — his performance against righties was exceptional, and if he would have had a right-handed hitting platoon-mate — that could have covered his 100 or so plate appearances against southpaws each year — González might merit consideration as one of the best hitters of the decade.
During the season, González was the first MLB player to wear a batting helmet with a pre-molded ear-flap. He was in the NL top-ten in being hit by pitches, and the special helmet was constructed specifically for his use.
References
External links
Tony González at SABR (Baseball BioProject)
1936 births
Living people
Atlanta Braves players
California Angels players
Cincinnati Reds players
Philadelphia Phillies players
San Diego Padres players
Major League Baseball outfielders
Major League Baseball players from Cuba
Cuban expatriate baseball players in the United States
Hiroshima Toyo Carp players
Cuban expatriate baseball players in Japan
Sportspeople from Ciego de Ávila Province
|
```c++
//===- ObjectYAML.cpp - YAML utilities for object files -------------------===//
//
// See path_to_url for license information.
//
//===your_sha256_hash------===//
//
// This file defines a wrapper class for handling tagged YAML input
//
//===your_sha256_hash------===//
#include "llvm/ObjectYAML/ObjectYAML.h"
#include "llvm/ADT/Twine.h"
#include "llvm/Support/YAMLParser.h"
#include "llvm/Support/YAMLTraits.h"
#include <string>
using namespace llvm;
using namespace yaml;
void MappingTraits<YamlObjectFile>::mapping(IO &IO,
YamlObjectFile &ObjectFile) {
if (IO.outputting()) {
if (ObjectFile.Elf)
MappingTraits<ELFYAML::Object>::mapping(IO, *ObjectFile.Elf);
if (ObjectFile.Coff)
MappingTraits<COFFYAML::Object>::mapping(IO, *ObjectFile.Coff);
if (ObjectFile.MachO)
MappingTraits<MachOYAML::Object>::mapping(IO, *ObjectFile.MachO);
if (ObjectFile.FatMachO)
MappingTraits<MachOYAML::UniversalBinary>::mapping(IO,
*ObjectFile.FatMachO);
} else {
Input &In = (Input &)IO;
if (IO.mapTag("!ELF")) {
ObjectFile.Elf.reset(new ELFYAML::Object());
MappingTraits<ELFYAML::Object>::mapping(IO, *ObjectFile.Elf);
} else if (IO.mapTag("!COFF")) {
ObjectFile.Coff.reset(new COFFYAML::Object());
MappingTraits<COFFYAML::Object>::mapping(IO, *ObjectFile.Coff);
} else if (IO.mapTag("!mach-o")) {
ObjectFile.MachO.reset(new MachOYAML::Object());
MappingTraits<MachOYAML::Object>::mapping(IO, *ObjectFile.MachO);
} else if (IO.mapTag("!fat-mach-o")) {
ObjectFile.FatMachO.reset(new MachOYAML::UniversalBinary());
MappingTraits<MachOYAML::UniversalBinary>::mapping(IO,
*ObjectFile.FatMachO);
} else if (IO.mapTag("!minidump")) {
ObjectFile.Minidump.reset(new MinidumpYAML::Object());
MappingTraits<MinidumpYAML::Object>::mapping(IO, *ObjectFile.Minidump);
} else if (IO.mapTag("!WASM")) {
ObjectFile.Wasm.reset(new WasmYAML::Object());
MappingTraits<WasmYAML::Object>::mapping(IO, *ObjectFile.Wasm);
} else if (const Node *N = In.getCurrentNode()) {
if (N->getRawTag().empty())
IO.setError("YAML Object File missing document type tag!");
else
IO.setError("YAML Object File unsupported document type tag '" +
N->getRawTag() + "'!");
}
}
}
```
|
```objective-c
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef BASE_FILE_VERSION_INFO_H_
#define BASE_FILE_VERSION_INFO_H_
#include <string>
#include "build/build_config.h"
#include "base/base_export.h"
#include "base/strings/string16.h"
#if defined(OS_WIN)
#include <windows.h>
#endif
namespace base {
class FilePath;
}
// Provides an interface for accessing the version information for a file. This
// is the information you access when you select a file in the Windows Explorer,
// right-click select Properties, then click the Version tab, and on the Mac
// when you select a file in the Finder and do a Get Info.
//
// This list of properties is straight out of Win32's VerQueryValue
// <path_to_url and the Mac
// version returns values from the Info.plist as appropriate. TODO(avi): make
// this a less-obvious Windows-ism.
class BASE_EXPORT FileVersionInfo {
public:
virtual ~FileVersionInfo() {}
#if defined(OS_WIN) || defined(OS_MACOSX)
// Creates a FileVersionInfo for the specified path. Returns NULL if something
// goes wrong (typically the file does not exit or cannot be opened). The
// returned object should be deleted when you are done with it.
static FileVersionInfo* CreateFileVersionInfo(
const base::FilePath& file_path);
#endif // OS_WIN || OS_MACOSX
#if defined(OS_WIN)
// Creates a FileVersionInfo for the specified module. Returns NULL in case
// of error. The returned object should be deleted when you are done with it.
static FileVersionInfo* CreateFileVersionInfoForModule(HMODULE module);
#else
// Creates a FileVersionInfo for the current module. Returns NULL in case
// of error. The returned object should be deleted when you are done with it.
static FileVersionInfo* CreateFileVersionInfoForCurrentModule();
#endif // OS_WIN
// Accessors to the different version properties.
// Returns an empty string if the property is not found.
virtual base::string16 company_name() = 0;
virtual base::string16 company_short_name() = 0;
virtual base::string16 product_name() = 0;
virtual base::string16 product_short_name() = 0;
virtual base::string16 internal_name() = 0;
virtual base::string16 product_version() = 0;
virtual base::string16 private_build() = 0;
virtual base::string16 special_build() = 0;
virtual base::string16 comments() = 0;
virtual base::string16 original_filename() = 0;
virtual base::string16 file_description() = 0;
virtual base::string16 file_version() = 0;
virtual base::string16 legal_copyright() = 0;
virtual base::string16 legal_trademarks() = 0;
virtual base::string16 last_change() = 0;
virtual bool is_official_build() = 0;
};
#endif // BASE_FILE_VERSION_INFO_H_
```
|
```java
/*
* FindBugs - Find bugs in Java programs
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
*
* You should have received a copy of the GNU Lesser General Public
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
package edu.umd.cs.findbugs.detect;
import org.apache.bcel.Const;
import org.apache.bcel.generic.ConstantPoolGen;
import org.apache.bcel.generic.GETSTATIC;
import org.apache.bcel.generic.Instruction;
import org.apache.bcel.generic.ObjectType;
import edu.umd.cs.findbugs.ba.Location;
import edu.umd.cs.findbugs.ba.RepositoryLookupFailureCallback;
/**
* Stream factory for streams created by loading a value from a static field.
* This is mainly to handle System.in, System.out, and System.err.
*/
public class StaticFieldLoadStreamFactory implements StreamFactory {
public String streamBaseClass;
public String className;
public String fieldName;
public String fieldSig;
/**
* Constructor. Created Stream objects will be marked as uninteresting.
*
* @param streamBaseClass
* the base class of the stream objects created by the factory
* @param className
* name of the class containing the static field
* @param fieldName
* name of the static field
* @param fieldSig
* signature of the static field
*/
public StaticFieldLoadStreamFactory(String streamBaseClass, String className, String fieldName, String fieldSig) {
this.streamBaseClass = streamBaseClass;
this.className = className;
this.fieldName = fieldName;
this.fieldSig = fieldSig;
}
@Override
public Stream createStream(Location location, ObjectType type, ConstantPoolGen cpg,
RepositoryLookupFailureCallback lookupFailureCallback) {
Instruction ins = location.getHandle().getInstruction();
if (ins.getOpcode() != Const.GETSTATIC) {
return null;
}
GETSTATIC getstatic = (GETSTATIC) ins;
if (!className.equals(getstatic.getClassName(cpg)) || !fieldName.equals(getstatic.getName(cpg))
|| !fieldSig.equals(getstatic.getSignature(cpg))) {
return null;
}
return new Stream(location, type.getClassName(), streamBaseClass).setIgnoreImplicitExceptions(true).setIsOpenOnCreation(
true);
}
}
```
|
The River Ock is a small English river which is a tributary of the River Thames. It has as its catchment area the Vale of White Horse, a low-lying and wide valley in south Oxfordshire, and flows into the River Thames, at Abingdon on the reach above Culham Lock.
Course
The River Ock rises near the village of Little Coxwell. It collects tributaries from each village along the base of the White Horse Hills, where springs emanating from the chalk hills allowed settlements to flourish in former times. Among these tributaries is the Osse Stream, rising in Cumnor.
From Little Coxwell, the Ock runs around Longcot and flows past Stanford in the Vale, where it is about wide. The name of Stanford comes from stony ford, possibly alluding to the Ock crossing at Stanford Mill. Thence it runs past Charney Bassett, Lyford, Garford and Marcham Mill, before losing its identity and its waters to the Thames at Abingdon by the old Hygienic Laundry building. An iron bridge crosses at the junction which was built by the Wilts & Berks Canal Company. This gives the erroneous impression that the Ock is that canal, but in fact the original canal entrance a few yards downstream is now blocked up. This has been replaced under a restoration project by a newer entrance closer to Culham Lock.
The soils through which the River Ock flows are the Jurassic sedimentary series (Greensands, Gault, Kimmeridge Clay and corallian limestone), while some of its tributaries arise in chalk springs. Until recent times, native crayfish and many freshwater fish species inhabited the river. Increased housing in the Vale, with the resultant surface drainage, may have threatened these species but surveys have not yet been performed in the 21st century.
Although normally placid, the Ock can flood low-lying areas of south Abingdon after persistent heavy rainfall; this last occurred in April 2023.
Name
The hydronym Ock appears to be derived from a Celtic word for 'salmon'.
See also
Tributaries of the River Thames
List of rivers of England
References
Ock, River
Ock, River
1Ock
|
The Hangzhou–Jiaxing–Huzhou Plain, or Hangjiahu Plain () is the largest plain in Zhejiang province, and is an integral part of the Yangtze Delta. Comprising an area of , it is bound by Lake Tai to the north, the Qiantang River / Hangzhou Bay to the south, and Tianmu Mountain to the west. It includes all of the prefecture-level city of Jiaxing, most of Huzhou, and the northeastern part of Hangzhou.
Geography
The plain has a humid subtropical climate (Köppen Cfa), influenced by the East Asian Monsoon, with cool winters and very hot and humid summers. The topography is generally low-lying and flat, at around elevation, though slightly higher to the south and east and lower sloping towards Lake Tai. Its river and canal network, including the Grand Canal itself, at 12.7 km per km2 (20.4 mi per sq. mi.), is the densest in all of China. From the 1960s to the 2000s, declining aquifer levels from continual groundwater extraction have caused some of the strongest land subsidence in China.
References
External links
Geography of Zhejiang
Hangzhou
Jiaxing
Huzhou
Plains of China
|
August Feodorovich Morawitz (; 22 August 1837, in St. Petersburg – 16 September 1897, in Blankenburg) was a Russian entomologist interested in Coleoptera.
Education and family
Morawitz' parents were Ferdinand Joseph Kaspar Morawitz (1796-1844), a wealthy industrialist and wagon builder, and Amalie Friederike Widemann.
He grew up in St. Petersburg and visited the German school Annenschule. From 1855 to 1859, he studied medicine and zoology in Dorpat, Würzburg and Berlin.
On 27 May 1876, he married Charlotte Bergholz (1858-1939), a pharmacy owner's daughter; they had five children:
Rudolf Morawitz (25 May 1877, St. Petersburg - 23 Jun 1951, Braunschweig), a judge who retired early because of his "non-aryan blood"
Paul Oskar Morawitz (3 Apr 1879-1936), a well known internist and physiologist.
Charlotte Morawitz (30 Mar 1881-8 Oct 1945 Marburg)
Hugo Paul Alexander Morawitz (11 Oct 1882, St. Petersburg)
Alice Morawitz (1884 - 1966)
Career
He became Curator of the insect collections at the Zoological Museum of the Russian Academy of Science when Édouard Ménétries retired from that post. He wrote (1862). Vorläufige Diagnosen neuer Coleopteren aus Südost-Sibirien. Bulletin de l'Académie Impériale des Sciences, St. Petersburg, 5: 231-265. August Feodorovitsh Morawitz is not to be confused with his brother Ferdinand Ferdinandovitsch Morawitz (1827–1896), another St. Petersburg prominent entomologist associated with the Zoological Museum of the Russian Academy of Science.
References
Baker, D. B., 2004 Type material of Hymenoptera described by O. L. Radoszkowsky in the Natural History Museum, London, and the localities of A. P. Fedtschencko's Reise in Turkestan Dt. ent. Zeitschr. 51, 231-252.
Russian entomologists
1837 births
1897 deaths
Biologists from the Russian Empire
|
```java
package com.yahoo.vespa.config;
import com.yahoo.compress.CompressionType;
import com.yahoo.compress.Compressor;
import java.nio.ByteBuffer;
/**
* Wrapper for LZ4 compression that selects compression level based on properties.
*
* @author Ulf Lilleengen
*/
public class LZ4PayloadCompressor {
private static final Compressor compressor = new Compressor(CompressionType.LZ4, 0);
public byte[] compress(byte[] input) {
return compressor.compressUnconditionally(input);
}
public byte[] compress(ByteBuffer input) {
return compressor.compressUnconditionally(input);
}
public byte [] decompress(byte[] input, int uncompressedLen) {
return compressor.decompressUnconditionally(input, 0, uncompressedLen);
}
public byte [] decompress(ByteBuffer input, int uncompressedLen) {
ByteBuffer uncompressed = ByteBuffer.allocate(uncompressedLen);
compressor.decompressUnconditionally(input, uncompressed);
return uncompressed.array();
}
}
```
|
```vue
<template>
<div :class="itemClasses">
<div :class="headerClasses" @click="toggle">
<Icon type="ios-arrow-forward" v-if="!hideArrow"></Icon>
<slot></slot>
</div>
<collapse-transition v-if="mounted">
<div :class="contentClasses" v-show="isActive">
<div :class="boxClasses"><slot name="content"></slot></div>
</div>
</collapse-transition>
</div>
</template>
<script>
import Icon from '../icon/icon.vue';
import CollapseTransition from '../base/collapse-transition';
const prefixCls = 'ivu-collapse';
export default {
name: 'Panel',
components: { Icon, CollapseTransition },
props: {
name: {
type: String
},
hideArrow: {
type: Boolean,
default: false
}
},
data () {
return {
index: 0, // use index for default when name is null
isActive: false,
mounted: false
};
},
computed: {
itemClasses () {
return [
`${prefixCls}-item`,
{
[`${prefixCls}-item-active`]: this.isActive
}
];
},
headerClasses () {
return `${prefixCls}-header`;
},
contentClasses () {
return `${prefixCls}-content`;
},
boxClasses () {
return `${prefixCls}-content-box`;
}
},
methods: {
toggle () {
this.$parent.toggle({
name: this.name || this.index,
isActive: this.isActive
});
}
},
mounted () {
this.mounted = true;
}
};
</script>
```
|
Karrat Island is an island of Greenland. It is located in Baffin Bay in the Upernavik Archipelago. It was once a prime walrus hunting ground for the Oqonermiut (Those who live on the Leeside).
References
Islands of the Upernavik Archipelago
|
```objective-c
/* $OpenBSD: ar5210reg.h,v 1.14 2022/01/09 05:42:38 jsg Exp $ */
/*
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* Known registers of the Atheros AR5000 Wireless LAN chipset
* (AR5210 + AR5110).
*/
#ifndef _AR5K_AR5210_REG_H
#define _AR5K_AR5210_REG_H
/*
* First transmit queue descriptor pointer register ("data queue")
*/
#define AR5K_AR5210_TXDP0 0x0000
/*
* Second transmit queue descriptor pointer register ("beacon queue")
*/
#define AR5K_AR5210_TXDP1 0x0004
/*
* Command register
*/
#define AR5K_AR5210_CR 0x0008
#define AR5K_AR5210_CR_TXE0 0x00000001
#define AR5K_AR5210_CR_TXE1 0x00000002
#define AR5K_AR5210_CR_RXE 0x00000004
#define AR5K_AR5210_CR_TXD0 0x00000008
#define AR5K_AR5210_CR_TXD1 0x00000010
#define AR5K_AR5210_CR_RXD 0x00000020
#define AR5K_AR5210_CR_SWI 0x00000040
/*
* Receive queue descriptor pointer register
*/
#define AR5K_AR5210_RXDP 0x000c
/*
* Configuration and status register
*/
#define AR5K_AR5210_CFG 0x0014
#define AR5K_AR5210_CFG_SWTD 0x00000001
#define AR5K_AR5210_CFG_SWTB 0x00000002
#define AR5K_AR5210_CFG_SWRD 0x00000004
#define AR5K_AR5210_CFG_SWRB 0x00000008
#define AR5K_AR5210_CFG_SWRG 0x00000010
#define AR5K_AR5210_CFG_EEBS 0x00000200
#define AR5K_AR5210_CFG_TXCNT 0x00007800
#define AR5K_AR5210_CFG_TXCNT_S 11
#define AR5K_AR5210_CFG_TXFSTAT 0x00008000
#define AR5K_AR5210_CFG_TXFSTRT 0x00010000
/*
* Interrupt service register
*/
#define AR5K_AR5210_ISR 0x001c
#define AR5K_AR5210_ISR_RXOK 0x00000001
#define AR5K_AR5210_ISR_RXDESC 0x00000002
#define AR5K_AR5210_ISR_RXERR 0x00000004
#define AR5K_AR5210_ISR_RXNOFRM 0x00000008
#define AR5K_AR5210_ISR_RXEOL 0x00000010
#define AR5K_AR5210_ISR_RXORN 0x00000020
#define AR5K_AR5210_ISR_TXOK 0x00000040
#define AR5K_AR5210_ISR_TXDESC 0x00000080
#define AR5K_AR5210_ISR_TXERR 0x00000100
#define AR5K_AR5210_ISR_TXNOFRM 0x00000200
#define AR5K_AR5210_ISR_TXEOL 0x00000400
#define AR5K_AR5210_ISR_TXURN 0x00000800
#define AR5K_AR5210_ISR_MIB 0x00001000
#define AR5K_AR5210_ISR_SWI 0x00002000
#define AR5K_AR5210_ISR_RXPHY 0x00004000
#define AR5K_AR5210_ISR_RXKCM 0x00008000
#define AR5K_AR5210_ISR_SWBA 0x00010000
#define AR5K_AR5210_ISR_BRSSI 0x00020000
#define AR5K_AR5210_ISR_BMISS 0x00040000
#define AR5K_AR5210_ISR_MCABT 0x00100000
#define AR5K_AR5210_ISR_SSERR 0x00200000
#define AR5K_AR5210_ISR_DPERR 0x00400000
#define AR5K_AR5210_ISR_GPIO 0x01000000
#define AR5K_AR5210_ISR_FATAL ( \
AR5K_AR5210_ISR_MCABT | AR5K_AR5210_ISR_SSERR | \
AR5K_AR5210_ISR_DPERR | AR5K_AR5210_ISR_RXORN \
)
/*
* Interrupt mask register
*/
#define AR5K_AR5210_IMR 0x0020
#define AR5K_AR5210_IMR_RXOK 0x00000001
#define AR5K_AR5210_IMR_RXDESC 0x00000002
#define AR5K_AR5210_IMR_RXERR 0x00000004
#define AR5K_AR5210_IMR_RXNOFRM 0x00000008
#define AR5K_AR5210_IMR_RXEOL 0x00000010
#define AR5K_AR5210_IMR_RXORN 0x00000020
#define AR5K_AR5210_IMR_TXOK 0x00000040
#define AR5K_AR5210_IMR_TXDESC 0x00000080
#define AR5K_AR5210_IMR_TXERR 0x00000100
#define AR5K_AR5210_IMR_TXNOFRM 0x00000200
#define AR5K_AR5210_IMR_TXEOL 0x00000400
#define AR5K_AR5210_IMR_TXURN 0x00000800
#define AR5K_AR5210_IMR_MIB 0x00001000
#define AR5K_AR5210_IMR_SWI 0x00002000
#define AR5K_AR5210_IMR_RXPHY 0x00004000
#define AR5K_AR5210_IMR_RXKCM 0x00008000
#define AR5K_AR5210_IMR_SWBA 0x00010000
#define AR5K_AR5210_IMR_BRSSI 0x00020000
#define AR5K_AR5210_IMR_BMISS 0x00040000
#define AR5K_AR5210_IMR_MCABT 0x00100000
#define AR5K_AR5210_IMR_SSERR 0x00200000
#define AR5K_AR5210_IMR_DPERR 0x00400000
#define AR5K_AR5210_IMR_GPIO 0x01000000
/*
* Interrupt enable register
*/
#define AR5K_AR5210_IER 0x0024
#define AR5K_AR5210_IER_DISABLE 0x00000000
#define AR5K_AR5210_IER_ENABLE 0x00000001
/*
* Beacon control register
*/
#define AR5K_AR5210_BCR 0x0028
#define AR5K_AR5210_BCR_AP 0x00000000
#define AR5K_AR5210_BCR_ADHOC 0x00000001
#define AR5K_AR5210_BCR_BDMAE 0x00000002
#define AR5K_AR5210_BCR_TQ1FV 0x00000004
#define AR5K_AR5210_BCR_TQ1V 0x00000008
#define AR5K_AR5210_BCR_BCGET 0x00000010
/*
* Beacon status register
*/
#define AR5K_AR5210_BSR 0x002c
#define AR5K_AR5210_BSR_BDLYSW 0x00000001
#define AR5K_AR5210_BSR_BDLYDMA 0x00000002
#define AR5K_AR5210_BSR_TXQ1F 0x00000004
#define AR5K_AR5210_BSR_ATIMDLY 0x00000008
#define AR5K_AR5210_BSR_SNPBCMD 0x00000100
#define AR5K_AR5210_BSR_SNPBDMAE 0x00000200
#define AR5K_AR5210_BSR_SNPTQ1FV 0x00000400
#define AR5K_AR5210_BSR_SNPTQ1V 0x00000800
#define AR5K_AR5210_BSR_SNAPPEDBCRVALID 0x00001000
#define AR5K_AR5210_BSR_SWBA_CNT 0x00ff0000
/*
* DMA size definitions
*/
typedef enum {
AR5K_AR5210_DMASIZE_4B = 0,
AR5K_AR5210_DMASIZE_8B,
AR5K_AR5210_DMASIZE_16B,
AR5K_AR5210_DMASIZE_32B,
AR5K_AR5210_DMASIZE_64B,
AR5K_AR5210_DMASIZE_128B,
AR5K_AR5210_DMASIZE_256B,
AR5K_AR5210_DMASIZE_512B
} ar5k_ar5210_dmasize_t;
/*
* Transmit configuration register
*/
#define AR5K_AR5210_TXCFG 0x0030
#define AR5K_AR5210_TXCFG_SDMAMR 0x00000007
#define AR5K_AR5210_TXCFG_TXFSTP 0x00000008
#define AR5K_AR5210_TXCFG_TXFULL 0x00000070
#define AR5K_AR5210_TXCFG_TXCONT_EN 0x00000080
/*
* Receive configuration register
*/
#define AR5K_AR5210_RXCFG 0x0034
#define AR5K_AR5210_RXCFG_SDMAMW 0x00000007
#define AR5K_AR5210_RXCFG_ZLFDMA 0x00000010
/*
* MIB control register
*/
#define AR5K_AR5210_MIBC 0x0040
#define AR5K_AR5210_MIBC_COW 0x00000001
#define AR5K_AR5210_MIBC_FMC 0x00000002
#define AR5K_AR5210_MIBC_CMC 0x00000004
#define AR5K_AR5210_MIBC_MCS 0x00000008
/*
* Timeout prescale register
*/
#define AR5K_AR5210_TOPS 0x0044
/*
* Receive timeout register (no frame received)
*/
#define AR5K_AR5210_RXNOFRM 0x0048
/*
* Transmit timeout register (no frame sent)
*/
#define AR5K_AR5210_TXNOFRM 0x004c
/*
* Receive frame gap timeout register
*/
#define AR5K_AR5210_RPGTO 0x0050
/*
* Receive frame count limit register
*/
#define AR5K_AR5210_RFCNT 0x0054
#define AR5K_AR5210_RFCNT_RFCL 0x0000000f
/*
* Misc settings/status register
*/
#define AR5K_AR5210_MISC 0x0058
#define AR5K_AR5210_MISC_LED_DECAY 0x001c0000
#define AR5K_AR5210_MISC_LED_BLINK 0x00e00000
/*
* Reset control register
*/
#define AR5K_AR5210_RC 0x4000
#define AR5K_AR5210_RC_PCU 0x00000001
#define AR5K_AR5210_RC_DMA 0x00000002
#define AR5K_AR5210_RC_MAC 0x00000004
#define AR5K_AR5210_RC_PHY 0x00000008
#define AR5K_AR5210_RC_PCI 0x00000010
#define AR5K_AR5210_RC_CHIP ( \
AR5K_AR5210_RC_PCU | AR5K_AR5210_RC_DMA | \
AR5K_AR5210_RC_MAC | AR5K_AR5210_RC_PHY \
)
/*
* Sleep control register
*/
#define AR5K_AR5210_SCR 0x4004
#define AR5K_AR5210_SCR_SLDUR 0x0000ffff
#define AR5K_AR5210_SCR_SLE 0x00030000
#define AR5K_AR5210_SCR_SLE_WAKE 0x00000000
#define AR5K_AR5210_SCR_SLE_SLP 0x00010000
#define AR5K_AR5210_SCR_SLE_ALLOW 0x00020000
/*
* Interrupt pending register
*/
#define AR5K_AR5210_INTPEND 0x4008
#define AR5K_AR5210_INTPEND_IP 0x00000001
/*
* Sleep force register
*/
#define AR5K_AR5210_SFR 0x400c
#define AR5K_AR5210_SFR_SF 0x00000001
/*
* PCI configuration register
*/
#define AR5K_AR5210_PCICFG 0x4010
#define AR5K_AR5210_PCICFG_EEAE 0x00000001
#define AR5K_AR5210_PCICFG_CLKRUNEN 0x00000004
#define AR5K_AR5210_PCICFG_LED_PEND 0x00000020
#define AR5K_AR5210_PCICFG_LED_ACT 0x00000040
#define AR5K_AR5210_PCICFG_SL_INTEN 0x00000800
#define AR5K_AR5210_PCICFG_LED_BCTL 0x00001000
#define AR5K_AR5210_PCICFG_SL_INPEN 0x00002800
#define AR5K_AR5210_PCICFG_SPWR_DN 0x00010000
/*
* "General Purpose Input/Output" (GPIO) control register
*/
#define AR5K_AR5210_GPIOCR 0x4014
#define AR5K_AR5210_GPIOCR_INT_ENA 0x00008000
#define AR5K_AR5210_GPIOCR_INT_SELL 0x00000000
#define AR5K_AR5210_GPIOCR_INT_SELH 0x00010000
#define AR5K_AR5210_GPIOCR_IN(n) (0 << ((n) * 2))
#define AR5K_AR5210_GPIOCR_OUT0(n) (1 << ((n) * 2))
#define AR5K_AR5210_GPIOCR_OUT1(n) (2 << ((n) * 2))
#define AR5K_AR5210_GPIOCR_OUT(n) (3 << ((n) * 2))
#define AR5K_AR5210_GPIOCR_ALL(n) (3<< ((n) * 2))
#define AR5K_AR5210_GPIOCR_INT_SEL(n) ((n) << 12)
#define AR5K_AR5210_NUM_GPIO 6
/*
* "General Purpose Input/Output" (GPIO) data output register
*/
#define AR5K_AR5210_GPIODO 0x4018
/*
* "General Purpose Input/Output" (GPIO) data input register
*/
#define AR5K_AR5210_GPIODI 0x401c
#define AR5K_AR5210_GPIOD_MASK 0x0000002f
/*
* Silicon revision register
*/
#define AR5K_AR5210_SREV 0x4020
#define AR5K_AR5210_SREV_REV 0x0000000f
#define AR5K_AR5210_SREV_REV_S 0
#define AR5K_AR5210_SREV_VER 0x000000ff
#define AR5K_AR5210_SREV_VER_S 4
/*
* EEPROM access registers
*/
#define AR5K_AR5210_EEPROM_BASE 0x6000
#define AR5K_AR5210_EEPROM_RDATA 0x6800
#define AR5K_AR5210_EEPROM_STATUS 0x6c00
#define AR5K_AR5210_EEPROM_STAT_RDERR 0x0001
#define AR5K_AR5210_EEPROM_STAT_RDDONE 0x0002
#define AR5K_AR5210_EEPROM_STAT_WRERR 0x0004
#define AR5K_AR5210_EEPROM_STAT_WRDONE 0x0008
/*
* PCU registers
*/
#define AR5K_AR5210_PCU_MIN 0x8000
#define AR5K_AR5210_PCU_MAX 0x8fff
/*
* First station id register (MAC address in lower 32 bits)
*/
#define AR5K_AR5210_STA_ID0 0x8000
/*
* Second station id register (MAC address in upper 16 bits)
*/
#define AR5K_AR5210_STA_ID1 0x8004
#define AR5K_AR5210_STA_ID1_AP 0x00010000
#define AR5K_AR5210_STA_ID1_ADHOC 0x00020000
#define AR5K_AR5210_STA_ID1_PWR_SV 0x00040000
#define AR5K_AR5210_STA_ID1_NO_KEYSRCH 0x00080000
#define AR5K_AR5210_STA_ID1_NO_PSPOLL 0x00100000
#define AR5K_AR5210_STA_ID1_PCF 0x00200000
#define AR5K_AR5210_STA_ID1_DESC_ANTENNA 0x00400000
#define AR5K_AR5210_STA_ID1_DEFAULT_ANTENNA 0x00800000
#define AR5K_AR5210_STA_ID1_ACKCTS_6MB 0x01000000
/*
* First BSSID register (MAC address, lower 32bits)
*/
#define AR5K_AR5210_BSS_ID0 0x8008
/*
* Second BSSID register (MAC address in upper 16 bits)
*
* AID: Association ID
*/
#define AR5K_AR5210_BSS_ID1 0x800c
#define AR5K_AR5210_BSS_ID1_AID 0xffff0000
#define AR5K_AR5210_BSS_ID1_AID_S 16
/*
* Backoff slot time register
*/
#define AR5K_AR5210_SLOT_TIME 0x8010
/*
* ACK/CTS timeout register
*/
#define AR5K_AR5210_TIME_OUT 0x8014
#define AR5K_AR5210_TIME_OUT_ACK 0x00001fff
#define AR5K_AR5210_TIME_OUT_ACK_S 0
#define AR5K_AR5210_TIME_OUT_CTS 0x1fff0000
#define AR5K_AR5210_TIME_OUT_CTS_S 16
/*
* RSSI threshold register
*/
#define AR5K_AR5210_RSSI_THR 0x8018
#define AR5K_AR5210_RSSI_THR_BM_THR 0x00000700
#define AR5K_AR5210_RSSI_THR_BM_THR_S 8
/*
* Retry limit register
*/
#define AR5K_AR5210_RETRY_LMT 0x801c
#define AR5K_AR5210_RETRY_LMT_SH_RETRY 0x0000000f
#define AR5K_AR5210_RETRY_LMT_SH_RETRY_S 0
#define AR5K_AR5210_RETRY_LMT_LG_RETRY 0x000000f0
#define AR5K_AR5210_RETRY_LMT_LG_RETRY_S 4
#define AR5K_AR5210_RETRY_LMT_SSH_RETRY 0x00003f00
#define AR5K_AR5210_RETRY_LMT_SSH_RETRY_S 8
#define AR5K_AR5210_RETRY_LMT_SLG_RETRY 0x000fc000
#define AR5K_AR5210_RETRY_LMT_SLG_RETRY_S 14
#define AR5K_AR5210_RETRY_LMT_CW_MIN 0x3ff00000
#define AR5K_AR5210_RETRY_LMT_CW_MIN_S 20
/*
* Transmit latency register
*/
#define AR5K_AR5210_USEC 0x8020
#define AR5K_AR5210_USEC_1 0x0000007f
#define AR5K_AR5210_USEC_1_S 0
#define AR5K_AR5210_USEC_32 0x00003f80
#define AR5K_AR5210_USEC_32_S 7
#define AR5K_AR5210_USEC_TX_LATENCY 0x000fc000
#define AR5K_AR5210_USEC_TX_LATENCY_S 14
#define AR5K_AR5210_USEC_RX_LATENCY 0x03f00000
#define AR5K_AR5210_USEC_RX_LATENCY_S 20
/*
* PCU beacon control register
*/
#define AR5K_AR5210_BEACON 0x8024
#define AR5K_AR5210_BEACON_PERIOD 0x0000ffff
#define AR5K_AR5210_BEACON_PERIOD_S 0
#define AR5K_AR5210_BEACON_TIM 0x007f0000
#define AR5K_AR5210_BEACON_TIM_S 16
#define AR5K_AR5210_BEACON_EN 0x00800000
#define AR5K_AR5210_BEACON_RESET_TSF 0x01000000
/*
* CFP period register
*/
#define AR5K_AR5210_CFP_PERIOD 0x8028
/*
* Next beacon time register
*/
#define AR5K_AR5210_TIMER0 0x802c
/*
* Next DMA beacon alert register
*/
#define AR5K_AR5210_TIMER1 0x8030
/*
* Next software beacon alert register
*/
#define AR5K_AR5210_TIMER2 0x8034
/*
* Next ATIM window time register
*/
#define AR5K_AR5210_TIMER3 0x8038
/*
* First inter frame spacing register (IFS)
*/
#define AR5K_AR5210_IFS0 0x8040
#define AR5K_AR5210_IFS0_SIFS 0x000007ff
#define AR5K_AR5210_IFS0_SIFS_S 0
#define AR5K_AR5210_IFS0_DIFS 0x007ff800
#define AR5K_AR5210_IFS0_DIFS_S 11
/*
* Second inter frame spacing register (IFS)
*/
#define AR5K_AR5210_IFS1 0x8044
#define AR5K_AR5210_IFS1_PIFS 0x00000fff
#define AR5K_AR5210_IFS1_PIFS_S 0
#define AR5K_AR5210_IFS1_EIFS 0x03fff000
#define AR5K_AR5210_IFS1_EIFS_S 12
#define AR5K_AR5210_IFS1_CS_EN 0x04000000
/*
* CFP duration register
*/
#define AR5K_AR5210_CFP_DUR 0x8048
/*
* Receive filter register
*/
#define AR5K_AR5210_RX_FILTER 0x804c
#define AR5K_AR5210_RX_FILTER_UNICAST 0x00000001
#define AR5K_AR5210_RX_FILTER_MULTICAST 0x00000002
#define AR5K_AR5210_RX_FILTER_BROADCAST 0x00000004
#define AR5K_AR5210_RX_FILTER_CONTROL 0x00000008
#define AR5K_AR5210_RX_FILTER_BEACON 0x00000010
#define AR5K_AR5210_RX_FILTER_PROMISC 0x00000020
/*
* Multicast filter register (lower 32 bits)
*/
#define AR5K_AR5210_MCAST_FIL0 0x8050
/*
* Multicast filter register (higher 16 bits)
*/
#define AR5K_AR5210_MCAST_FIL1 0x8054
/*
* Transmit mask register (lower 32 bits)
*/
#define AR5K_AR5210_TX_MASK0 0x8058
/*
* Transmit mask register (higher 16 bits)
*/
#define AR5K_AR5210_TX_MASK1 0x805c
/*
* Clear transmit mask
*/
#define AR5K_AR5210_CLR_TMASK 0x8060
/*
* Trigger level register (before transmission)
*/
#define AR5K_AR5210_TRIG_LVL 0x8064
/*
* PCU control register
*/
#define AR5K_AR5210_DIAG_SW 0x8068
#define AR5K_AR5210_DIAG_SW_DIS_WEP_ACK 0x00000001
#define AR5K_AR5210_DIAG_SW_DIS_ACK 0x00000002
#define AR5K_AR5210_DIAG_SW_DIS_CTS 0x00000004
#define AR5K_AR5210_DIAG_SW_DIS_ENC 0x00000008
#define AR5K_AR5210_DIAG_SW_DIS_DEC 0x00000010
#define AR5K_AR5210_DIAG_SW_DIS_TX 0x00000020
#define AR5K_AR5210_DIAG_SW_DIS_RX 0x00000040
#define AR5K_AR5210_DIAG_SW_LOOP_BACK 0x00000080
#define AR5K_AR5210_DIAG_SW_CORR_FCS 0x00000100
#define AR5K_AR5210_DIAG_SW_CHAN_INFO 0x00000200
#define AR5K_AR5210_DIAG_SW_EN_SCRAM_SEED 0x00000400
#define AR5K_AR5210_DIAG_SW_SCVRAM_SEED 0x0003f800
#define AR5K_AR5210_DIAG_SW_DIS_SEQ_INC 0x00040000
#define AR5K_AR5210_DIAG_SW_FRAME_NV0 0x00080000
/*
* TSF (clock) register (lower 32 bits)
*/
#define AR5K_AR5210_TSF_L32 0x806c
/*
* TSF (clock) register (higher 32 bits)
*/
#define AR5K_AR5210_TSF_U32 0x8070
/*
* Last beacon timestamp register
*/
#define AR5K_AR5210_LAST_TSTP 0x8080
/*
* Retry count register
*/
#define AR5K_AR5210_RETRY_CNT 0x8084
#define AR5K_AR5210_RETRY_CNT_SSH 0x0000003f
#define AR5K_AR5210_RETRY_CNT_SLG 0x00000fc0
/*
* Back-off status register
*/
#define AR5K_AR5210_BACKOFF 0x8088
#define AR5K_AR5210_BACKOFF_CW 0x000003ff
#define AR5K_AR5210_BACKOFF_CNT 0x03ff0000
/*
* NAV register (current)
*/
#define AR5K_AR5210_NAV 0x808c
/*
* RTS success register
*/
#define AR5K_AR5210_RTS_OK 0x8090
/*
* RTS failure register
*/
#define AR5K_AR5210_RTS_FAIL 0x8094
/*
* ACK failure register
*/
#define AR5K_AR5210_ACK_FAIL 0x8098
/*
* FCS failure register
*/
#define AR5K_AR5210_FCS_FAIL 0x809c
/*
* Beacon count register
*/
#define AR5K_AR5210_BEACON_CNT 0x80a0
/*
* Key table (WEP) register
*/
#define AR5K_AR5210_KEYTABLE_0 0x9000
#define AR5K_AR5210_KEYTABLE(n) (AR5K_AR5210_KEYTABLE_0 + ((n) << 5))
#define AR5K_AR5210_KEYTABLE_OFF(_n, x) (AR5K_AR5210_KEYTABLE(_n) + (x << 2))
#define AR5K_AR5210_KEYTABLE_TYPE(_n) AR5K_AR5210_KEYTABLE_OFF(_n, 5)
#define AR5K_AR5210_KEYTABLE_TYPE_40 0x00000000
#define AR5K_AR5210_KEYTABLE_TYPE_104 0x00000001
#define AR5K_AR5210_KEYTABLE_TYPE_128 0x00000003
#define AR5K_AR5210_KEYTABLE_MAC0(_n) AR5K_AR5210_KEYTABLE_OFF(_n, 6)
#define AR5K_AR5210_KEYTABLE_MAC1(_n) AR5K_AR5210_KEYTABLE_OFF(_n, 7)
#define AR5K_AR5210_KEYTABLE_VALID 0x00008000
#define AR5K_AR5210_KEYTABLE_SIZE 64
#define AR5K_AR5210_KEYCACHE_SIZE 8
/*
* PHY register
*/
#define AR5K_AR5210_PHY(_n) (0x9800 + ((_n) << 2))
/*
* PHY frame control register
*/
#define AR5K_AR5210_PHY_FC 0x9804
#define AR5K_AR5210_PHY_FC_TURBO_MODE 0x00000001
#define AR5K_AR5210_PHY_FC_TURBO_SHORT 0x00000002
#define AR5K_AR5210_PHY_FC_TIMING_ERR 0x01000000
#define AR5K_AR5210_PHY_FC_PARITY_ERR 0x02000000
#define AR5K_AR5210_PHY_FC_ILLRATE_ERR 0x04000000
#define AR5K_AR5210_PHY_FC_ILLLEN_ERR 0x08000000
#define AR5K_AR5210_PHY_FC_SERVICE_ERR 0x20000000
#define AR5K_AR5210_PHY_FC_TXURN_ERR 0x40000000
/*
* PHY agility command register
*/
#define AR5K_AR5210_PHY_AGC 0x9808
#define AR5K_AR5210_PHY_AGC_DISABLE 0x08000000
/*
* PHY chip revision register
*/
#define AR5K_AR5210_PHY_CHIP_ID 0x9818
/*
* PHY activation register
*/
#define AR5K_AR5210_PHY_ACTIVE 0x981c
#define AR5K_AR5210_PHY_ENABLE 0x00000001
#define AR5K_AR5210_PHY_DISABLE 0x00000002
/*
* PHY signal register
*/
#define AR5K_AR5210_PHY_SIG 0x9858
#define AR5K_AR5210_PHY_SIG_FIRSTEP 0x0003f000
#define AR5K_AR5210_PHY_SIG_FIRSTEP_S 12
#define AR5K_AR5210_PHY_SIG_FIRPWR 0x03fc0000
#define AR5K_AR5210_PHY_SIG_FIRPWR_S 18
/*
* PHY coarse agility control register
*/
#define AR5K_AR5210_PHY_AGCCOARSE 0x985c
#define AR5K_AR5210_PHY_AGCCOARSE_LO 0x00007f80
#define AR5K_AR5210_PHY_AGCCOARSE_LO_S 7
#define AR5K_AR5210_PHY_AGCCOARSE_HI 0x003f8000
#define AR5K_AR5210_PHY_AGCCOARSE_HI_S 15
/*
* PHY agility control register
*/
#define AR5K_AR5210_PHY_AGCCTL 0x9860
#define AR5K_AR5210_PHY_AGCCTL_CAL 0x00000001
#define AR5K_AR5210_PHY_AGCCTL_NF 0x00000002
/*
* PHY noise floor status register
*/
#define AR5K_AR5210_PHY_NF 0x9864
#define AR5K_AR5210_PHY_NF_M 0x000001ff
#define AR5K_AR5210_PHY_NF_ACTIVE 0x00000100
#define AR5K_AR5210_PHY_NF_RVAL(_n) (((_n) >> 19) & AR5K_AR5210_PHY_NF_M)
#define AR5K_AR5210_PHY_NF_AVAL(_n) (-((_n) ^ AR5K_AR5210_PHY_NF_M) + 1)
/*
* PHY ADC saturation register
*/
#define AR5K_AR5210_PHY_ADCSAT 0x9868
#define AR5K_AR5210_PHY_ADCSAT_ICNT 0x0001f800
#define AR5K_AR5210_PHY_ADCSAT_ICNT_S 11
#define AR5K_AR5210_PHY_ADCSAT_THR 0x000007e0
#define AR5K_AR5210_PHY_ADCSAT_THR_S 5
/*
* PHY RF stage register
*/
#define AR5K_AR5210_PHY_RFSTG 0x98d4
#define AR5K_AR5210_PHY_RFSTG_DISABLE 0x00000021
/*
* Misc PHY/radio registers
*/
#define AR5K_AR5210_BB_GAIN(_n) (0x9b00 + ((_n) << 2))
#define AR5K_AR5210_RF_GAIN(_n) (0x9a00 + ((_n) << 2))
#endif
```
|
Jeffrey Morgan may refer to:
Jeffrey Morgan (writer), Canadian writer
Jeffrey Morgan (musician) (born 1954), American jazz musician and composer
Jeffrey Dean Morgan (born 1966), American actor
Jeff Morgan, American businessman
Jeff Morgan (vintner), American winemaker
|
In human anatomy, the cephalic vein is a superficial vein in the arm. It originates from the radial end of the dorsal venous network of hand, and ascends along the radial (lateral) side of the arm before emptying into the axillary vein. At the elbow, it communicates with the basilic vein via the median cubital vein.
Anatomy
The cephalic vein is situated within the superficial fascia along the anterolateral surface of the biceps.
Origin
The cephalic vein forms over the anatomical snuffbox at the radial end of the dorsal venous network of hand.
Course and relations
From its origin, it ascends up the lateral aspect of the radius.
Near the shoulder, the cephalic vein passes between the deltoid and pectoralis major muscles (deltopectoral groove) through the clavipectoral triangle, where it empties into the axillary vein.
Anastomoses
It communicates with the basilic vein via the median cubital vein at the elbow.
Clinical significance
The cephalic vein is often visible through the skin, and its location in the deltopectoral groove is fairly consistent, making this site a good candidate for venous access. Permanent pacemaker leads are often placed in the cephalic vein in the deltopectoral groove. The vein may be used for intravenous access, as large bore cannula may be easily placed. However, the cannulation of a vein as close to the radial nerve as the cephalic vein can sometimes lead to nerve damage.
History
Ordinarily the term cephalic refers to anatomy of the head. When the Persian Muslim physician Ibn Sīnā's Canon was translated into medieval Latin, cephalic was mistakenly chosen to render the Arabic term al-kífal, meaning "outer".
Additional images
See also
Basilic vein
Median cubital vein
References
External links
Anatomy
Veins of the upper limb
Human surface anatomy
Cardiovascular system
Circulatory system
|
```java
package com.fishercoder.solutions.firstthousand;
import java.util.Arrays;
import java.util.Comparator;
public class _522 {
public static class Solution1 {
/**
* Idea: if there's such a LUS there in the list, it must be one of the strings in the given list,
* so we'll just go through the list and check if one string is NOT subsequence of any others, if so, return it, otherwise, return -1
*/
public int findLUSlength(String[] strs) {
Arrays.sort(strs, new Comparator<String>() {
@Override
public int compare(String o1, String o2) {
return o2.length() - o1.length();
}
});
for (int i = 0; i < strs.length; i++) {
boolean found = true;
for (int j = 0; j < strs.length; j++) {
if (i == j) {
continue;
} else if (isSubsequence(strs[i], strs[j])) {
found = false;
break;
}
}
if (found) {
return strs[i].length();
}
}
return -1;
}
private boolean isSubsequence(String a, String b) {
int i = 0;
for (int j = 0; i < a.length() && j < b.length(); j++) {
if (a.charAt(i) == b.charAt(j)) {
i++;
}
}
return i == a.length();
}
}
}
```
|
Aston Barrett Jr. (born 20 October 1990) is a Jamaican multi-instrumentalist and producer. He is the drummer and leader of the band The Wailers since 2016.
He is the son of Aston “Familyman” Barrett, who was the bassist and musical director for Bob Marley & The Wailers, nephew of drummer Carlton “Carly” Barrett and grandson of the late Joe Higgs. In 2017, he received a Grammy award as co-producer with Damian Marley for the track "The Struggle Discontinues", featured on the Album "Stony Hill", which won the Grammy Award for Best Reggae Album.
In 2018, he joined efforts with the Italian reggae artist Alborosie to co-produce and record the album “Unbreakable – Alborosie meets The Wailers”.
In 2020, he produced and co-wrote the new album of The Wailers One World, with producer Emilio Estefan, which was released by Sony Music and received a Grammy Nomination for Best Reggae Album of the Year.
Early years
Born in Kingston, Jamaica, he grew up in a mixed cultured family which was part Rastafari and part Christian.
He first became aware of his family’s fame while watching television at the age of 4, when he saw The Wailers performing their 1979 concert in Santa Barbara. Later, he grew up seeing pictures of Bob Marley and hearing his music, and soon realized his significance in reggae music and popularity.
Aston started playing the bass at a very young age, following in the footsteps of his father, Aston ‘Familyman’ Barrett, and trying to emulate his style. His father quickly started teaching him how to play this instrument; beginning a mentor-student relationship that would continue for years.
When he was seven years he joined his first band, meanwhile his father continued to mentor him until Aston moved to the United States, after finishing 5th grade.
Living with his sister in Miami, he joined his school’s jazz band, and started to play drums in order to improve his repertoire of skills.
Musical career
He gained his first professional experience while he was still in high school, playing bass for Julian Marley and The Uprising Band. Then, he joined them on their first shows around Florida and the rest of America, and eventually toured with them internationally. The group shared the stage with artists such as Stephen Marley, and Nas. Months later, Lauryn Hill sought him out to become her bassist, and the two collaborated for over two years.
Trajectory with The Wailers
In 2009 he began accompanying his father on tours with The Wailers, when he would occasionally join the band on stage. In 2016, with the urging of his father, he stepped up to become the leader of the band.
"One World" Album
In 2020 he produced and co-written alongside Emilion Estefan and Josh David Barrett The Wailers´ Album “One World”.
The album was released by Sony Music Latin and received a Grammy Nomination for Best Reggae Album of the Year. It features guest artists such as Julian Marley, Natiruts, Emily Estefan, Kush Gad, Jesse Royal, and Carlinhos Brown.
The first single of the album, ‘One World, One Prayer’ had dropped earlier in the year, on 21 May 2020, and featured Farruko, Shaggy, Cedella Marley, and her son, Skip Marley (fresh from chart-topping hits with Katy Perry and H.E.R.)
Other projects and recognitions
Apart from his role in The Wailers. Aston can also be heard playing guitar, drums, bass, and organ for other artists such as Daniel Marley, Junior Reed, Julian Marley, Kwame Bediaco, Aka Beka, Jessee Royale and Reggae Force. He´s also a co-owner of BAD Lions Productions, who operates a studio in Pompano Beach, Florida.
In 2017, he received a Grammy Award as co-producer with Damian Marley for the track The Struggle Discontinues, featured on the Album "Stony Hill" (Grammy Awarded for Best Reggae Album)
In 2018, he joined with renowned Italian reggae artist Alborosie to co-produce and record the album “Unbreakable – Alborosie meets The Wailers”.
In 2020 he played bass and drums for Romain Virgo’s ‘Best of Me’, produced and played multiple instruments for Kayaman, and worked on the new Reggae Force album.
References
Living people
Musicians from Kingston, Jamaica
1990 births
|
```objective-c
/* Tests of stat.
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url */
/* Written by Eric Blake <ebb9@byu.net>, 2009. */
/* This file is designed to test both stat(n,buf) and
fstatat(AT_FDCWD,n,buf,0). FUNC is the function to test. Assumes
that BASE and ASSERT are already defined, and that appropriate
headers are already included. If PRINT, warn before skipping
symlink tests with status 77. */
static int
test_stat_func (int (*func) (char const *, struct stat *), bool print)
{
struct stat st1;
struct stat st2;
char *cwd = getcwd (NULL, 0);
ASSERT (cwd);
ASSERT (func (".", &st1) == 0);
ASSERT (func ("./", &st2) == 0);
ASSERT (SAME_INODE (st1, st2));
ASSERT (func (cwd, &st2) == 0);
ASSERT (SAME_INODE (st1, st2));
ASSERT (func ("/", &st1) == 0);
ASSERT (func ("///", &st2) == 0);
ASSERT (SAME_INODE (st1, st2));
errno = 0;
ASSERT (func ("", &st1) == -1);
ASSERT (errno == ENOENT);
errno = 0;
ASSERT (func ("nosuch", &st1) == -1);
ASSERT (errno == ENOENT);
errno = 0;
ASSERT (func ("nosuch/", &st1) == -1);
ASSERT (errno == ENOENT);
ASSERT (close (creat (BASE "file", 0600)) == 0);
ASSERT (func (BASE "file", &st1) == 0);
errno = 0;
ASSERT (func (BASE "file/", &st1) == -1);
ASSERT (errno == ENOTDIR);
/* Now for some symlink tests, where supported. We set up:
link1 -> directory
link2 -> file
link3 -> dangling
link4 -> loop
then test behavior with trailing slash.
*/
if (symlink (".", BASE "link1") != 0)
{
ASSERT (unlink (BASE "file") == 0);
if (print)
fputs ("skipping test: symlinks not supported on this file system\n",
stderr);
return 77;
}
ASSERT (symlink (BASE "file", BASE "link2") == 0);
ASSERT (symlink (BASE "nosuch", BASE "link3") == 0);
ASSERT (symlink (BASE "link4", BASE "link4") == 0);
ASSERT (func (BASE "link1/", &st1) == 0);
ASSERT (S_ISDIR (st1.st_mode));
errno = 0;
ASSERT (func (BASE "link2/", &st1) == -1);
ASSERT (errno == ENOTDIR);
errno = 0;
ASSERT (func (BASE "link3/", &st1) == -1);
ASSERT (errno == ENOENT);
errno = 0;
ASSERT (func (BASE "link4/", &st1) == -1);
ASSERT (errno == ELOOP);
/* Cleanup. */
ASSERT (unlink (BASE "file") == 0);
ASSERT (unlink (BASE "link1") == 0);
ASSERT (unlink (BASE "link2") == 0);
ASSERT (unlink (BASE "link3") == 0);
ASSERT (unlink (BASE "link4") == 0);
free (cwd);
return 0;
}
```
|
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var resolve = require( 'path' ).resolve;
var bench = require( '@stdlib/bench' );
var randu = require( '@stdlib/random/base/randu' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var pow = require( '@stdlib/math/base/special/pow' );
var Float32Array = require( '@stdlib/array/float32' );
var tryRequire = require( '@stdlib/utils/try-require' );
var pkg = require( './../package.json' ).name;
// VARIABLES //
var sstdev = tryRequire( resolve( __dirname, './../lib/sstdev.native.js' ) );
var opts = {
'skip': ( sstdev instanceof Error )
};
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var x;
var i;
x = new Float32Array( len );
for ( i = 0; i < x.length; i++ ) {
x[ i ] = ( randu()*20.0 ) - 10.0;
}
return benchmark;
function benchmark( b ) {
var v;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
v = sstdev( x.length, 1, x, 1 );
if ( isnan( v ) ) {
b.fail( 'should not return NaN' );
}
}
b.toc();
if ( isnan( v ) ) {
b.fail( 'should not return NaN' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+'::native:len='+len, opts, f );
}
}
main();
```
|
The Church of the Epiphany is an Anglican church located in Chantilly, Virginia. It emphasizes "Encountering God through beautiful worship and believing prayer, building a multigenerational congregation that loves children and families and equipping every member to share the good news of Jesus Christ." Notable ministries and activities include a yearly free "Sports Camp" in Herndon for elementary-age students, bi-weekly worship and other ministry activities at the Arbor Terrace memory care home in Chantilly, and monthly donations of food that go home with students in need at Coates Elementary School in Herndon. Each year, Epiphany designates the congregation's Christmas Eve offering to a special project, alternating between supporting mission outside of the United States and meeting local needs in Fairfax County.
Church services on Sunday at are 8:00 and 10:15 am. Average Sunday attendance at Epiphany was 155 in 2018.
Church of the Epiphany is part of the Diocese of the Mid-Atlantic of the Anglican Church in North America. Its current rector is the Rev. Peter Frank. Epiphany's current associate rector is the Rev. Pamela Meeks.
History
The original church was established in 1985 when Truro Church in Fairfax planned to establish a mission church in Western Fairfax County. Groundbreaking for the church's first building on the corner of Franklin Farm Rd. and Fairfax County Parkway, took place in March 1988, and three years later the parish was established.
The congregation voted, with the majority choosing to break from the Episcopal Church in 2006 and affiliate with the Anglican Province of Nigeria and Convocation of Anglicans in North America (CANA). As the Anglican Church in North America (ACNA) was formed, and the Diocese of the Mid-Atlantic came into being in 2011, Epiphany became part of the new local diocese. In 2012, The Episcopal Church prevailed in its legal efforts to claim the Franklin Farm building. Epiphany Anglican temporary relocated to 13515 Dulles Technology Drive between 2012 and 2017. As of March 2018 completed the build-out of its new facility, and has moved into its long term home at 3863 Centerview Drive in Chantilly.
References
External links
http://juicyecumenism.com/2012/01/12/episcopal-diocese-of-virginia-faces-costs-of-legal-victory
Churches in Virginia
Fairfax, Virginia
Anglican Church in North America church buildings in the United States
Religious organizations established in 1985
Anglican realignment congregations
|
```java
package com.lzx.demo.ui;
import android.os.Bundle;
import android.os.Handler;
import android.os.Message;
import android.support.v7.app.AppCompatActivity;
import android.support.v7.widget.LinearLayoutManager;
import android.support.v7.widget.Toolbar;
import android.util.Log;
import android.view.Menu;
import android.view.MenuItem;
import android.view.View;
import com.github.jdsjlzx.ItemDecoration.DividerDecoration;
import com.github.jdsjlzx.interfaces.OnItemClickListener;
import com.github.jdsjlzx.interfaces.OnItemLongClickListener;
import com.github.jdsjlzx.interfaces.OnLoadMoreListener;
import com.github.jdsjlzx.interfaces.OnNetWorkErrorListener;
import com.github.jdsjlzx.interfaces.OnRefreshListener;
import com.github.jdsjlzx.recyclerview.LRecyclerView;
import com.github.jdsjlzx.recyclerview.LRecyclerViewAdapter;
import com.github.jdsjlzx.recyclerview.ProgressStyle;
import com.lzx.demo.R;
import com.lzx.demo.adapter.MultipleItemAdapter;
import com.lzx.demo.bean.MultipleItem;
import com.lzx.demo.util.AppToast;
import com.lzx.demo.util.NetworkUtils;
import com.lzx.demo.view.SampleHeader;
import java.lang.ref.WeakReference;
import java.util.ArrayList;
/**
* HeaderViewLinearLayout RecyclerView
*/
public class MulItemLinearLayoutActivity extends AppCompatActivity{
private static final String TAG = "lzx";
/***/
private static final int TOTAL_COUNTER = 64;
/***/
private static final int REQUEST_COUNT = 10;
/***/
private static int mCurrentCounter = 0;
private LRecyclerView mRecyclerView = null;
private MultipleItemAdapter mMultipleItemAdapter = null;
private PreviewHandler mHandler = new PreviewHandler(this);
private LRecyclerViewAdapter mLRecyclerViewAdapter = null;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.sample_ll_activity);
Toolbar toolbar = (Toolbar) findViewById(R.id.toolbar);
setSupportActionBar(toolbar);
getSupportActionBar().setDisplayHomeAsUpEnabled(true);
mRecyclerView = (LRecyclerView) findViewById(R.id.list);
mMultipleItemAdapter = new MultipleItemAdapter(this);
mLRecyclerViewAdapter = new LRecyclerViewAdapter(mMultipleItemAdapter);
mRecyclerView.setAdapter(mLRecyclerViewAdapter);
DividerDecoration divider = new DividerDecoration.Builder(this)
.setHeight(R.dimen.default_divider_height)
.setPadding(R.dimen.default_divider_padding)
.setColorResource(R.color.split)
.build();
mRecyclerView.setHasFixedSize(true);
mRecyclerView.addItemDecoration(divider);
mRecyclerView.setLayoutManager(new LinearLayoutManager(this));
mRecyclerView.setRefreshProgressStyle(ProgressStyle.BallSpinFadeLoader);
mRecyclerView.setArrowImageView(R.drawable.ic_pulltorefresh_arrow);
mLRecyclerViewAdapter.addHeaderView( new SampleHeader(this));
mRecyclerView.setOnRefreshListener(new OnRefreshListener() {
@Override
public void onRefresh() {
mMultipleItemAdapter.clear();
mLRecyclerViewAdapter.notifyDataSetChanged();//fix bug:crapped or attached views may not be recycled. isScrap:false isAttached:true
mCurrentCounter = 0;
requestData();
}
});
mRecyclerView.setOnLoadMoreListener(new OnLoadMoreListener() {
@Override
public void onLoadMore() {
if (mCurrentCounter < TOTAL_COUNTER) {
// loading more
requestData();
} else {
//the end
mRecyclerView.setNoMore(true);
}
}
});
mRecyclerView.setLScrollListener(new LRecyclerView.LScrollListener() {
@Override
public void onScrollUp() {
}
@Override
public void onScrollDown() {
}
@Override
public void onScrolled(int distanceX, int distanceY) {
}
@Override
public void onScrollStateChanged(int state) {
}
});
mRecyclerView.refresh();
mLRecyclerViewAdapter.setOnItemClickListener(new OnItemClickListener() {
@Override
public void onItemClick(View view, int position) {
MultipleItem item = mMultipleItemAdapter.getDataList().get(position);
AppToast.showShortText(MulItemLinearLayoutActivity.this, item.getTitle());
}
});
mLRecyclerViewAdapter.setOnItemLongClickListener(new OnItemLongClickListener() {
@Override
public void onItemLongClick(View view, int position) {
MultipleItem item = mMultipleItemAdapter.getDataList().get(position);
AppToast.showShortText(MulItemLinearLayoutActivity.this, "onItemLongClick - " + item.getTitle());
}
});
}
private void notifyDataSetChanged() {
mLRecyclerViewAdapter.notifyDataSetChanged();
}
private void addItems(ArrayList<MultipleItem> list) {
mMultipleItemAdapter.addAll(list);
mCurrentCounter += list.size();
}
private class PreviewHandler extends Handler {
private WeakReference<MulItemLinearLayoutActivity> ref;
PreviewHandler(MulItemLinearLayoutActivity activity) {
ref = new WeakReference<>(activity);
}
@Override
public void handleMessage(Message msg) {
final MulItemLinearLayoutActivity activity = ref.get();
if (activity == null || activity.isFinishing()) {
return;
}
switch (msg.what) {
case -1:
int currentSize = activity.mMultipleItemAdapter.getItemCount();
//10
ArrayList<MultipleItem> newList = new ArrayList<>();
for (int i = 0; i < 10; i++) {
if (newList.size() + currentSize >= TOTAL_COUNTER) {
break;
}
MultipleItem item ;
if(i == 2){
item = new MultipleItem(MultipleItem.IMG);
}else {
item = new MultipleItem(MultipleItem.TEXT);
}
item.setTitle("item"+(currentSize+i));
newList.add(item);
}
activity.addItems(newList);
activity.mRecyclerView.refreshComplete(REQUEST_COUNT);
activity.notifyDataSetChanged();
break;
case -2:
activity.notifyDataSetChanged();
break;
case -3:
activity.mRecyclerView.refreshComplete(REQUEST_COUNT);
activity.notifyDataSetChanged();
activity.mRecyclerView.setOnNetWorkErrorListener(new OnNetWorkErrorListener() {
@Override
public void reload() {
requestData();
}
});
break;
default:
break;
}
}
}
/**
*
*/
private void requestData() {
Log.d(TAG, "requestData");
new Thread() {
@Override
public void run() {
super.run();
try {
Thread.sleep(800);
} catch (InterruptedException e) {
e.printStackTrace();
}
//
if(NetworkUtils.isNetAvailable(MulItemLinearLayoutActivity.this)) {
mHandler.sendEmptyMessage(-1);
} else {
mHandler.sendEmptyMessage(-3);
}
}
}.start();
}
@Override
public boolean onPrepareOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.menu_main_refresh, menu);
return true;
}
@Override
public boolean onOptionsItemSelected(MenuItem item) {
if (item.getItemId() == android.R.id.home) {
finish();
} else if (item.getItemId() == R.id.menu_refresh) {
mRecyclerView.forceToRefresh();
}
return true;
}
}
```
|
Twywell railway station served the village of Twywell, Northamptonshire, England, from 1866 to 1951 on the Kettering, Thrapston and Huntingdon Railway.
History
The station was opened on 1 March 1866 by the Kettering, Thrapston and Huntingdon Railway. It closed on 30 July 1951.
References
Disused railway stations in Northamptonshire
Railway stations in Great Britain opened in 1866
Railway stations in Great Britain closed in 1951
1866 establishments in England
1951 disestablishments in England
|
Stadionul Municipal is a multi-use stadium in Reghin, Romania. It is the home ground of Avântul Reghin and Viitorul Reghin. In the present after some modification it holds 2063 seats in the main stand, from which 191 are roofed seats (including 2 x 2 commentators cabine). The seats are white (1093) and blue (970). In the 1980s the maximum capacity was around 5,000 people on wooden benches, from which around 1000 in the second stand.
External links
Stadionul Municipal. soccerway.com
Football venues in Romania
Buildings and structures in Mureș County
Reghin
|
```c
/*
*
*/
#include <stdint.h>
#include <sys/lock.h>
#include "sdkconfig.h"
#if CONFIG_PCNT_ENABLE_DEBUG_LOG
// The local log level must be defined before including esp_log.h
// Set the maximum log level for this source file
#define LOG_LOCAL_LEVEL ESP_LOG_DEBUG
#endif
#include "freertos/FreeRTOS.h"
#include "esp_heap_caps.h"
#include "esp_intr_alloc.h"
#include "esp_attr.h"
#include "esp_log.h"
#include "esp_check.h"
#include "esp_pm.h"
#include "esp_rom_gpio.h"
#include "soc/soc_caps.h"
#include "soc/pcnt_periph.h"
#include "soc/gpio_pins.h"
#include "hal/pcnt_hal.h"
#include "hal/pcnt_ll.h"
#include "hal/gpio_hal.h"
#include "esp_private/esp_clk.h"
#include "esp_private/periph_ctrl.h"
#include "driver/gpio.h"
#include "driver/pulse_cnt.h"
#include "esp_memory_utils.h"
// If ISR handler is allowed to run whilst cache is disabled,
// Make sure all the code and related variables used by the handler are in the SRAM
#if CONFIG_PCNT_ISR_IRAM_SAFE || CONFIG_PCNT_CTRL_FUNC_IN_IRAM
#define PCNT_MEM_ALLOC_CAPS (MALLOC_CAP_INTERNAL | MALLOC_CAP_8BIT)
#else
#define PCNT_MEM_ALLOC_CAPS MALLOC_CAP_DEFAULT
#endif
#if CONFIG_PCNT_ISR_IRAM_SAFE
#define PCNT_INTR_ALLOC_FLAGS (ESP_INTR_FLAG_IRAM | ESP_INTR_FLAG_INTRDISABLED | ESP_INTR_FLAG_SHARED)
#else
#define PCNT_INTR_ALLOC_FLAGS (ESP_INTR_FLAG_INTRDISABLED | ESP_INTR_FLAG_SHARED)
#endif
#define PCNT_ALLOW_INTR_PRIORITY_MASK ESP_INTR_FLAG_LOWMED
#define PCNT_PM_LOCK_NAME_LEN_MAX 16
#if !SOC_RCC_IS_INDEPENDENT
#define PCNT_RCC_ATOMIC() PERIPH_RCC_ATOMIC()
#else
#define PCNT_RCC_ATOMIC()
#endif
static const char *TAG = "pcnt";
typedef struct pcnt_platform_t pcnt_platform_t;
typedef struct pcnt_group_t pcnt_group_t;
typedef struct pcnt_unit_t pcnt_unit_t;
typedef struct pcnt_chan_t pcnt_chan_t;
struct pcnt_platform_t {
_lock_t mutex; // platform level mutex lock
pcnt_group_t *groups[SOC_PCNT_GROUPS]; // pcnt group pool
int group_ref_counts[SOC_PCNT_GROUPS]; // reference count used to protect group install/uninstall
};
struct pcnt_group_t {
int group_id; // Group ID, index from 0
int intr_priority; // PCNT interrupt priority
portMUX_TYPE spinlock; // to protect per-group register level concurrent access
pcnt_hal_context_t hal;
pcnt_unit_t *units[SOC_PCNT_UNITS_PER_GROUP]; // array of PCNT units
};
typedef struct {
pcnt_ll_watch_event_id_t event_id; // event type
int watch_point_value; // value to be watched
} pcnt_watch_point_t;
typedef enum {
PCNT_UNIT_FSM_INIT,
PCNT_UNIT_FSM_ENABLE,
} pcnt_unit_fsm_t;
struct pcnt_unit_t {
pcnt_group_t *group; // which group the pcnt unit belongs to
portMUX_TYPE spinlock; // Spinlock, stop one unit from accessing different parts of a same register concurrently
int unit_id; // allocated unit numerical ID
int low_limit; // low limit value
int high_limit; // high limit value
int step_limit; // step limit value
int clear_signal_gpio_num; // which gpio clear signal input
int accum_value; // accumulated count value
int step_interval; // PCNT step notify interval value
pcnt_chan_t *channels[SOC_PCNT_CHANNELS_PER_UNIT]; // array of PCNT channels
pcnt_watch_point_t watchers[PCNT_LL_WATCH_EVENT_MAX]; // array of PCNT watchers
intr_handle_t intr; // interrupt handle
esp_pm_lock_handle_t pm_lock; // PM lock, for glitch filter, as that module can only be functional under APB
#if CONFIG_PM_ENABLE
char pm_lock_name[PCNT_PM_LOCK_NAME_LEN_MAX]; // pm lock name
#endif
pcnt_unit_fsm_t fsm; // record PCNT unit's driver state
pcnt_watch_cb_t on_reach; // user registered callback function
void *user_data; // user data registered by user, which would be passed to the right callback function
struct {
uint32_t accum_count: 1; /*!< Whether to accumulate the count value when overflows at the high/low limit */
#if SOC_PCNT_SUPPORT_STEP_NOTIFY
uint32_t en_step_notify_up: 1; /*!< Enable step notify in the positive direction*/
uint32_t en_step_notify_down: 1; /*!< Enable step notify in the negative direction*/
#endif
} flags;
};
struct pcnt_chan_t {
pcnt_unit_t *unit; // pointer to the PCNT unit where it derives from
int channel_id; // channel ID, index from 0
int edge_gpio_num;
int level_gpio_num;
};
// pcnt driver platform, it's always a singleton
static pcnt_platform_t s_platform;
static pcnt_group_t *pcnt_acquire_group_handle(int group_id);
static void pcnt_release_group_handle(pcnt_group_t *group);
static void pcnt_default_isr(void *args);
static esp_err_t pcnt_register_to_group(pcnt_unit_t *unit)
{
pcnt_group_t *group = NULL;
int unit_id = -1;
for (int i = 0; i < SOC_PCNT_GROUPS; i++) {
group = pcnt_acquire_group_handle(i);
ESP_RETURN_ON_FALSE(group, ESP_ERR_NO_MEM, TAG, "no mem for group (%d)", i);
// loop to search free unit in the group
portENTER_CRITICAL(&group->spinlock);
for (int j = 0; j < SOC_PCNT_UNITS_PER_GROUP; j++) {
if (!group->units[j]) {
unit_id = j;
group->units[j] = unit;
break;
}
}
portEXIT_CRITICAL(&group->spinlock);
if (unit_id < 0) {
pcnt_release_group_handle(group);
} else {
unit->group = group;
unit->unit_id = unit_id;
break;
}
}
ESP_RETURN_ON_FALSE(unit_id != -1, ESP_ERR_NOT_FOUND, TAG, "no free unit");
return ESP_OK;
}
static void pcnt_unregister_from_group(pcnt_unit_t *unit)
{
pcnt_group_t *group = unit->group;
int unit_id = unit->unit_id;
portENTER_CRITICAL(&group->spinlock);
group->units[unit_id] = NULL;
portEXIT_CRITICAL(&group->spinlock);
// unit has a reference on group, release it now
pcnt_release_group_handle(group);
}
static esp_err_t pcnt_destroy(pcnt_unit_t *unit)
{
if (unit->pm_lock) {
ESP_RETURN_ON_ERROR(esp_pm_lock_delete(unit->pm_lock), TAG, "delete pm lock failed");
}
if (unit->intr) {
ESP_RETURN_ON_ERROR(esp_intr_free(unit->intr), TAG, "delete interrupt service failed");
}
if (unit->group) {
pcnt_unregister_from_group(unit);
}
free(unit);
return ESP_OK;
}
esp_err_t pcnt_new_unit(const pcnt_unit_config_t *config, pcnt_unit_handle_t *ret_unit)
{
#if CONFIG_PCNT_ENABLE_DEBUG_LOG
esp_log_level_set(TAG, ESP_LOG_DEBUG);
#endif
esp_err_t ret = ESP_OK;
pcnt_unit_t *unit = NULL;
ESP_GOTO_ON_FALSE(config && ret_unit, ESP_ERR_INVALID_ARG, err, TAG, "invalid argument");
ESP_GOTO_ON_FALSE(config->low_limit < 0 && config->high_limit > 0 && config->low_limit >= PCNT_LL_MIN_LIN &&
config->high_limit <= PCNT_LL_MAX_LIM, ESP_ERR_INVALID_ARG, err, TAG,
"invalid limit range:[%d,%d]", config->low_limit, config->high_limit);
if (config->intr_priority) {
ESP_GOTO_ON_FALSE(1 << (config->intr_priority) & PCNT_ALLOW_INTR_PRIORITY_MASK, ESP_ERR_INVALID_ARG, err,
TAG, "invalid interrupt priority:%d", config->intr_priority);
}
#if PCNT_LL_STEP_NOTIFY_DIR_LIMIT
ESP_GOTO_ON_FALSE(!(config->flags.en_step_notify_up && config->flags.en_step_notify_down), ESP_ERR_NOT_SUPPORTED, err, TAG, CONFIG_IDF_TARGET " can't trigger step notify in both direction");
if (config->flags.en_step_notify_up) {
ESP_LOGW(TAG, "can't overflow at low limit: %d due to hardware limitation", config->low_limit);
}
if (config->flags.en_step_notify_down) {
ESP_LOGW(TAG, "can't overflow at high limit: %d due to hardware limitation", config->high_limit);
}
#endif
unit = heap_caps_calloc(1, sizeof(pcnt_unit_t), PCNT_MEM_ALLOC_CAPS);
ESP_GOTO_ON_FALSE(unit, ESP_ERR_NO_MEM, err, TAG, "no mem for unit");
// register unit to the group (because one group can have several units)
ESP_GOTO_ON_ERROR(pcnt_register_to_group(unit), err, TAG, "register unit failed");
pcnt_group_t *group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
// if interrupt priority specified before, it cannot be changed until the group is released
// check if the new priority specified consistents with the old one
bool intr_priority_conflict = false;
portENTER_CRITICAL(&group->spinlock);
if (group->intr_priority == -1) {
group->intr_priority = config->intr_priority;
} else if (config->intr_priority != 0) {
intr_priority_conflict = (group->intr_priority != config->intr_priority);
}
portEXIT_CRITICAL(&group->spinlock);
ESP_GOTO_ON_FALSE(!intr_priority_conflict, ESP_ERR_INVALID_STATE, err, TAG, "intr_priority conflict, already is %d but attempt to %d", group->intr_priority, config->intr_priority);
// to accumulate count value, we should install the interrupt handler first, and in the ISR we do the accumulation
bool to_install_isr = (config->flags.accum_count == 1);
if (to_install_isr) {
int isr_flags = PCNT_INTR_ALLOC_FLAGS;
if (group->intr_priority) {
isr_flags |= 1 << (group->intr_priority);
} else {
isr_flags |= PCNT_ALLOW_INTR_PRIORITY_MASK;
}
ESP_GOTO_ON_ERROR(esp_intr_alloc_intrstatus(pcnt_periph_signals.groups[group_id].irq, isr_flags,
(uint32_t)pcnt_ll_get_intr_status_reg(group->hal.dev), PCNT_LL_UNIT_WATCH_EVENT(unit_id),
pcnt_default_isr, unit, &unit->intr), err,
TAG, "install interrupt service failed");
}
// some events are enabled by default, disable them all
pcnt_ll_disable_all_events(group->hal.dev, unit_id);
// disable filter by default
pcnt_ll_enable_glitch_filter(group->hal.dev, unit_id, false);
// set default high/low limitation value
// note: limit value takes effect only after counter clear
pcnt_ll_set_high_limit_value(group->hal.dev, unit_id, config->high_limit);
pcnt_ll_set_low_limit_value(group->hal.dev, unit_id, config->low_limit);
unit->high_limit = config->high_limit;
unit->low_limit = config->low_limit;
unit->accum_value = 0;
unit->clear_signal_gpio_num = -1;
unit->flags.accum_count = config->flags.accum_count;
#if SOC_PCNT_SUPPORT_STEP_NOTIFY
unit->flags.en_step_notify_down = config->flags.en_step_notify_down;
unit->flags.en_step_notify_up = config->flags.en_step_notify_up;
#if PCNT_LL_STEP_NOTIFY_DIR_LIMIT
if (config->flags.en_step_notify_up) {
unit->step_limit = config->high_limit;
} else if (config->flags.en_step_notify_down) {
unit->step_limit = config->low_limit;
}
pcnt_ll_set_step_limit_value(group->hal.dev, unit_id, unit->step_limit);
#endif
#endif
// clear/pause register is shared by all units, so using group's spinlock
portENTER_CRITICAL(&group->spinlock);
pcnt_ll_stop_count(group->hal.dev, unit_id);
pcnt_ll_clear_count(group->hal.dev, unit_id);
// enable the interrupt if we want to accumulate the counter in the ISR
pcnt_ll_enable_intr(group->hal.dev, PCNT_LL_UNIT_WATCH_EVENT(unit_id), to_install_isr);
pcnt_ll_clear_intr_status(group->hal.dev, PCNT_LL_UNIT_WATCH_EVENT(unit_id));
portEXIT_CRITICAL(&group->spinlock);
unit->spinlock = (portMUX_TYPE)portMUX_INITIALIZER_UNLOCKED;
unit->fsm = PCNT_UNIT_FSM_INIT;
for (int i = 0; i < PCNT_LL_WATCH_EVENT_MAX; i++) {
unit->watchers[i].event_id = PCNT_LL_WATCH_EVENT_INVALID; // invalid all watch point
}
ESP_LOGD(TAG, "new pcnt unit (%d,%d) at %p, count range:[%d,%d]", group_id, unit_id, unit, unit->low_limit, unit->high_limit);
*ret_unit = unit;
return ESP_OK;
err:
if (unit) {
pcnt_destroy(unit);
}
return ret;
}
esp_err_t pcnt_del_unit(pcnt_unit_handle_t unit)
{
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_INIT, ESP_ERR_INVALID_STATE, TAG, "unit not in init state");
pcnt_group_t *group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
for (int i = 0; i < SOC_PCNT_CHANNELS_PER_UNIT; i++) {
ESP_RETURN_ON_FALSE(!unit->channels[i], ESP_ERR_INVALID_STATE, TAG, "channel %d still in working", i);
}
#if SOC_PCNT_SUPPORT_CLEAR_SIGNAL
if (unit->clear_signal_gpio_num >= 0) {
gpio_reset_pin(unit->clear_signal_gpio_num);
}
#endif // SOC_PCNT_SUPPORT_CLEAR_SIGNAL
ESP_LOGD(TAG, "del unit (%d,%d)", group_id, unit_id);
// recycle memory resource
ESP_RETURN_ON_ERROR(pcnt_destroy(unit), TAG, "destroy pcnt unit failed");
return ESP_OK;
}
#if SOC_PCNT_SUPPORT_CLEAR_SIGNAL
esp_err_t pcnt_unit_set_clear_signal(pcnt_unit_handle_t unit, const pcnt_clear_signal_config_t *config)
{
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
pcnt_group_t *group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
if (config) {
gpio_config_t gpio_conf = {
.intr_type = GPIO_INTR_DISABLE,
.mode = GPIO_MODE_INPUT | (config->flags.io_loop_back ? GPIO_MODE_OUTPUT : 0), // also enable the output path if `io_loop_back` is enabled
.pull_down_en = true,
.pull_up_en = false,
};
if (config->flags.invert_clear_signal) {
gpio_conf.pull_down_en = false;
gpio_conf.pull_up_en = true;
}
gpio_conf.pin_bit_mask = 1ULL << config->clear_signal_gpio_num;
ESP_RETURN_ON_ERROR(gpio_config(&gpio_conf), TAG, "config zero signal GPIO failed");
esp_rom_gpio_connect_in_signal(config->clear_signal_gpio_num,
pcnt_periph_signals.groups[group_id].units[unit_id].clear_sig,
config->flags.invert_clear_signal);
unit->clear_signal_gpio_num = config->clear_signal_gpio_num;
} else {
ESP_RETURN_ON_FALSE(unit->clear_signal_gpio_num >= 0, ESP_ERR_INVALID_STATE, TAG, "zero signal not set yet");
gpio_reset_pin(unit->clear_signal_gpio_num);
unit->clear_signal_gpio_num = -1;
}
return ESP_OK;
}
#endif // SOC_PCNT_SUPPORT_CLEAR_SIGNAL
esp_err_t pcnt_unit_set_glitch_filter(pcnt_unit_handle_t unit, const pcnt_glitch_filter_config_t *config)
{
pcnt_group_t *group = NULL;
uint32_t glitch_filter_thres = 0;
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
// glitch filter should be set only when unit is in init state
ESP_RETURN_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_INIT, ESP_ERR_INVALID_STATE, TAG, "unit not in init state");
group = unit->group;
if (config) {
glitch_filter_thres = esp_clk_apb_freq() / 1000000 * config->max_glitch_ns / 1000;
ESP_RETURN_ON_FALSE(glitch_filter_thres <= PCNT_LL_MAX_GLITCH_WIDTH, ESP_ERR_INVALID_ARG, TAG, "glitch width out of range");
// The filter module is working against APB clock, so lazy install PM lock
#if CONFIG_PM_ENABLE
if (!unit->pm_lock) {
sprintf(unit->pm_lock_name, "pcnt_%d_%d", group->group_id, unit->unit_id); // e.g. pcnt_0_0
ESP_RETURN_ON_ERROR(esp_pm_lock_create(ESP_PM_APB_FREQ_MAX, 0, unit->pm_lock_name, &unit->pm_lock), TAG, "install pm lock failed");
ESP_LOGD(TAG, "install APB_FREQ_MAX lock for unit (%d,%d)", group->group_id, unit->unit_id);
}
#endif
}
// filter control bit is mixed with other PCNT control bits in the same register
portENTER_CRITICAL(&unit->spinlock);
if (config) {
pcnt_ll_set_glitch_filter_thres(group->hal.dev, unit->unit_id, glitch_filter_thres);
pcnt_ll_enable_glitch_filter(group->hal.dev, unit->unit_id, true);
} else {
pcnt_ll_enable_glitch_filter(group->hal.dev, unit->unit_id, false);
}
portEXIT_CRITICAL(&unit->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_enable(pcnt_unit_handle_t unit)
{
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_INIT, ESP_ERR_INVALID_STATE, TAG, "unit not in init state");
// acquire power manager lock
if (unit->pm_lock) {
ESP_RETURN_ON_ERROR(esp_pm_lock_acquire(unit->pm_lock), TAG, "acquire pm_lock failed");
}
// enable interrupt service
if (unit->intr) {
ESP_RETURN_ON_ERROR(esp_intr_enable(unit->intr), TAG, "enable interrupt service failed");
}
unit->fsm = PCNT_UNIT_FSM_ENABLE;
return ESP_OK;
}
esp_err_t pcnt_unit_disable(pcnt_unit_handle_t unit)
{
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_ENABLE, ESP_ERR_INVALID_STATE, TAG, "unit not in enable state");
// disable interrupt service
if (unit->intr) {
ESP_RETURN_ON_ERROR(esp_intr_disable(unit->intr), TAG, "disable interrupt service failed");
}
// release power manager lock
if (unit->pm_lock) {
ESP_RETURN_ON_ERROR(esp_pm_lock_release(unit->pm_lock), TAG, "release APB_FREQ_MAX lock failed");
}
unit->fsm = PCNT_UNIT_FSM_INIT;
return ESP_OK;
}
esp_err_t pcnt_unit_start(pcnt_unit_handle_t unit)
{
ESP_RETURN_ON_FALSE_ISR(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE_ISR(unit->fsm == PCNT_UNIT_FSM_ENABLE, ESP_ERR_INVALID_STATE, TAG, "unit not enabled yet");
pcnt_group_t *group = unit->group;
// all PCNT units share the same register to control counter
portENTER_CRITICAL_SAFE(&group->spinlock);
pcnt_ll_start_count(group->hal.dev, unit->unit_id);
portEXIT_CRITICAL_SAFE(&group->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_stop(pcnt_unit_handle_t unit)
{
ESP_RETURN_ON_FALSE_ISR(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE_ISR(unit->fsm == PCNT_UNIT_FSM_ENABLE, ESP_ERR_INVALID_STATE, TAG, "unit not enabled yet");
pcnt_group_t *group = unit->group;
// all PCNT units share the same register to control counter
portENTER_CRITICAL_SAFE(&group->spinlock);
pcnt_ll_stop_count(group->hal.dev, unit->unit_id);
portEXIT_CRITICAL_SAFE(&group->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_clear_count(pcnt_unit_handle_t unit)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE_ISR(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
group = unit->group;
// all PCNT units share the same register to control counter
portENTER_CRITICAL_SAFE(&group->spinlock);
pcnt_ll_clear_count(group->hal.dev, unit->unit_id);
portEXIT_CRITICAL_SAFE(&group->spinlock);
// reset the accumulated count as well
portENTER_CRITICAL_SAFE(&unit->spinlock);
unit->accum_value = 0;
portEXIT_CRITICAL_SAFE(&unit->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_get_count(pcnt_unit_handle_t unit, int *value)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE_ISR(unit && value, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
group = unit->group;
// the accum_value is also accessed by the ISR, so adding a critical section
portENTER_CRITICAL_SAFE(&unit->spinlock);
*value = pcnt_ll_get_count(group->hal.dev, unit->unit_id) + unit->accum_value;
portEXIT_CRITICAL_SAFE(&unit->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_register_event_callbacks(pcnt_unit_handle_t unit, const pcnt_event_callbacks_t *cbs, void *user_data)
{
ESP_RETURN_ON_FALSE(unit && cbs, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
// unit event callbacks should be registered in init state
pcnt_group_t *group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
#if CONFIG_PCNT_ISR_IRAM_SAFE
if (cbs->on_reach) {
ESP_RETURN_ON_FALSE(esp_ptr_in_iram(cbs->on_reach), ESP_ERR_INVALID_ARG, TAG, "on_reach callback not in IRAM");
}
if (user_data) {
ESP_RETURN_ON_FALSE(esp_ptr_internal(user_data), ESP_ERR_INVALID_ARG, TAG, "user context not in internal RAM");
}
#endif
// lazy install interrupt service
if (!unit->intr) {
ESP_RETURN_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_INIT, ESP_ERR_INVALID_STATE, TAG, "unit not in init state");
int isr_flags = PCNT_INTR_ALLOC_FLAGS;
if (group->intr_priority) {
isr_flags |= 1 << (group->intr_priority);
} else {
isr_flags |= PCNT_ALLOW_INTR_PRIORITY_MASK;
}
ESP_RETURN_ON_ERROR(esp_intr_alloc_intrstatus(pcnt_periph_signals.groups[group_id].irq, isr_flags,
(uint32_t)pcnt_ll_get_intr_status_reg(group->hal.dev), PCNT_LL_UNIT_WATCH_EVENT(unit_id),
pcnt_default_isr, unit, &unit->intr),
TAG, "install interrupt service failed");
}
// enable/disable PCNT interrupt events
portENTER_CRITICAL(&group->spinlock);
pcnt_ll_enable_intr(group->hal.dev, PCNT_LL_UNIT_WATCH_EVENT(unit_id), cbs->on_reach != NULL);
portEXIT_CRITICAL(&group->spinlock);
unit->on_reach = cbs->on_reach;
unit->user_data = user_data;
return ESP_OK;
}
esp_err_t pcnt_unit_add_watch_point(pcnt_unit_handle_t unit, int watch_point)
{
esp_err_t ret = ESP_OK;
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE(watch_point <= unit->high_limit && watch_point >= unit->low_limit,
ESP_ERR_INVALID_ARG, TAG, "watch_point out of limit");
group = unit->group;
// event enable/disable is mixed with other control function in the same register
portENTER_CRITICAL(&unit->spinlock);
// zero cross watch point
if (watch_point == 0) {
if (unit->watchers[PCNT_LL_WATCH_EVENT_ZERO_CROSS].event_id != PCNT_LL_WATCH_EVENT_INVALID) {
ret = ESP_ERR_INVALID_STATE; // zero cross event watcher has been installed already
} else {
unit->watchers[PCNT_LL_WATCH_EVENT_ZERO_CROSS].event_id = PCNT_LL_WATCH_EVENT_ZERO_CROSS;
unit->watchers[PCNT_LL_WATCH_EVENT_ZERO_CROSS].watch_point_value = 0;
pcnt_ll_enable_zero_cross_event(group->hal.dev, unit->unit_id, true);
}
}
// high limit watch point
else if (watch_point == unit->high_limit) {
if (unit->watchers[PCNT_LL_WATCH_EVENT_HIGH_LIMIT].event_id != PCNT_LL_WATCH_EVENT_INVALID) {
ret = ESP_ERR_INVALID_STATE; // high limit event watcher has been installed already
} else {
unit->watchers[PCNT_LL_WATCH_EVENT_HIGH_LIMIT].event_id = PCNT_LL_WATCH_EVENT_HIGH_LIMIT;
unit->watchers[PCNT_LL_WATCH_EVENT_HIGH_LIMIT].watch_point_value = unit->high_limit;
pcnt_ll_enable_high_limit_event(group->hal.dev, unit->unit_id, true);
}
}
// low limit watch point
else if (watch_point == unit->low_limit) {
if (unit->watchers[PCNT_LL_WATCH_EVENT_LOW_LIMIT].event_id != PCNT_LL_WATCH_EVENT_INVALID) {
ret = ESP_ERR_INVALID_STATE; // low limit event watcher has been installed already
} else {
unit->watchers[PCNT_LL_WATCH_EVENT_LOW_LIMIT].event_id = PCNT_LL_WATCH_EVENT_LOW_LIMIT;
unit->watchers[PCNT_LL_WATCH_EVENT_LOW_LIMIT].watch_point_value = unit->low_limit;
pcnt_ll_enable_low_limit_event(group->hal.dev, unit->unit_id, true);
}
}
// other threshold watch point
else {
int thres_num = SOC_PCNT_THRES_POINT_PER_UNIT - 1;
switch (thres_num) {
case 1:
if (unit->watchers[PCNT_LL_WATCH_EVENT_THRES1].event_id == PCNT_LL_WATCH_EVENT_INVALID) {
unit->watchers[PCNT_LL_WATCH_EVENT_THRES1].event_id = PCNT_LL_WATCH_EVENT_THRES1;
unit->watchers[PCNT_LL_WATCH_EVENT_THRES1].watch_point_value = watch_point;
pcnt_ll_set_thres_value(group->hal.dev, unit->unit_id, 1, watch_point);
pcnt_ll_enable_thres_event(group->hal.dev, unit->unit_id, 1, true);
break;
} else if (unit->watchers[PCNT_LL_WATCH_EVENT_THRES1].watch_point_value == watch_point) {
ret = ESP_ERR_INVALID_STATE;
break;
}
/* fall-through */
case 0:
if (unit->watchers[PCNT_LL_WATCH_EVENT_THRES0].event_id == PCNT_LL_WATCH_EVENT_INVALID) {
unit->watchers[PCNT_LL_WATCH_EVENT_THRES0].event_id = PCNT_LL_WATCH_EVENT_THRES0;
unit->watchers[PCNT_LL_WATCH_EVENT_THRES0].watch_point_value = watch_point;
pcnt_ll_set_thres_value(group->hal.dev, unit->unit_id, 0, watch_point);
pcnt_ll_enable_thres_event(group->hal.dev, unit->unit_id, 0, true);
break;
} else if (unit->watchers[PCNT_LL_WATCH_EVENT_THRES0].watch_point_value == watch_point) {
ret = ESP_ERR_INVALID_STATE;
break;
}
/* fall-through */
default:
ret = ESP_ERR_NOT_FOUND; // no free threshold watch point available
break;
}
}
portEXIT_CRITICAL(&unit->spinlock);
ESP_RETURN_ON_ERROR(ret, TAG, "add watchpoint %d failed", watch_point);
return ESP_OK;
}
esp_err_t pcnt_unit_remove_watch_point(pcnt_unit_handle_t unit, int watch_point)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
group = unit->group;
pcnt_ll_watch_event_id_t event_id = PCNT_LL_WATCH_EVENT_INVALID;
// event enable/disable is mixed with other control function in the same register
portENTER_CRITICAL(&unit->spinlock);
for (int i = 0; i < PCNT_LL_WATCH_EVENT_MAX; i++) {
if (unit->watchers[i].event_id != PCNT_LL_WATCH_EVENT_INVALID && unit->watchers[i].watch_point_value == watch_point) {
event_id = unit->watchers[i].event_id;
unit->watchers[i].event_id = PCNT_LL_WATCH_EVENT_INVALID;
break;
}
}
switch (event_id) {
case PCNT_LL_WATCH_EVENT_ZERO_CROSS:
pcnt_ll_enable_zero_cross_event(group->hal.dev, unit->unit_id, false);
break;
case PCNT_LL_WATCH_EVENT_LOW_LIMIT:
pcnt_ll_enable_low_limit_event(group->hal.dev, unit->unit_id, false);
break;
case PCNT_LL_WATCH_EVENT_HIGH_LIMIT:
pcnt_ll_enable_high_limit_event(group->hal.dev, unit->unit_id, false);
break;
case PCNT_LL_WATCH_EVENT_THRES0:
pcnt_ll_enable_thres_event(group->hal.dev, unit->unit_id, 0, false);
break;
case PCNT_LL_WATCH_EVENT_THRES1:
pcnt_ll_enable_thres_event(group->hal.dev, unit->unit_id, 1, false);
break;
default:
break;
}
portEXIT_CRITICAL(&unit->spinlock);
ESP_RETURN_ON_FALSE(event_id != PCNT_LL_WATCH_EVENT_INVALID, ESP_ERR_INVALID_STATE, TAG, "watch point %d not added yet", watch_point);
return ESP_OK;
}
#if SOC_PCNT_SUPPORT_STEP_NOTIFY
esp_err_t pcnt_unit_add_watch_step(pcnt_unit_handle_t unit, int step_interval)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
ESP_RETURN_ON_FALSE((step_interval > 0 && unit->flags.en_step_notify_up) || (step_interval < 0 && unit->flags.en_step_notify_down),
ESP_ERR_INVALID_ARG, TAG, "invalid step interval");
ESP_RETURN_ON_FALSE(step_interval >= unit->low_limit && step_interval <= unit->high_limit,
ESP_ERR_INVALID_ARG, TAG, "step interval out of range [%d,%d]", unit->low_limit, unit->high_limit);
ESP_RETURN_ON_FALSE(unit->step_interval == 0,
ESP_ERR_INVALID_STATE, TAG, "watch step has been set to %d already", unit->step_interval);
group = unit->group;
unit->step_interval = step_interval;
pcnt_ll_set_step_value(group->hal.dev, unit->unit_id, step_interval);
// different units are mixing in the same register, so we use the group's spinlock here
portENTER_CRITICAL(&group->spinlock);
pcnt_ll_enable_step_notify(group->hal.dev, unit->unit_id, true);
portEXIT_CRITICAL(&group->spinlock);
return ESP_OK;
}
esp_err_t pcnt_unit_remove_watch_step(pcnt_unit_handle_t unit)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(unit, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
group = unit->group;
ESP_RETURN_ON_FALSE(unit->step_interval != 0, ESP_ERR_INVALID_STATE, TAG, "watch step not added yet");
unit->step_interval = 0;
portENTER_CRITICAL(&group->spinlock);
pcnt_ll_enable_step_notify(group->hal.dev, unit->unit_id, false);
portEXIT_CRITICAL(&group->spinlock);
return ESP_OK;
}
#endif //SOC_PCNT_SUPPORT_STEP_NOTIFY
esp_err_t pcnt_new_channel(pcnt_unit_handle_t unit, const pcnt_chan_config_t *config, pcnt_channel_handle_t *ret_chan)
{
esp_err_t ret = ESP_OK;
pcnt_chan_t *channel = NULL;
pcnt_group_t *group = NULL;
ESP_GOTO_ON_FALSE(unit && config && ret_chan, ESP_ERR_INVALID_ARG, err, TAG, "invalid argument");
ESP_GOTO_ON_FALSE(unit->fsm == PCNT_UNIT_FSM_INIT, ESP_ERR_INVALID_STATE, err, TAG, "unit not in init state");
group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
channel = heap_caps_calloc(1, sizeof(pcnt_chan_t), PCNT_MEM_ALLOC_CAPS);
ESP_GOTO_ON_FALSE(channel, ESP_ERR_NO_MEM, err, TAG, "no mem for channel");
// search for a free channel
int channel_id = -1;
portENTER_CRITICAL(&unit->spinlock);
for (int i = 0; i < SOC_PCNT_CHANNELS_PER_UNIT; i++) {
if (!unit->channels[i]) {
channel_id = i;
unit->channels[channel_id] = channel;
break;
}
}
portEXIT_CRITICAL(&unit->spinlock);
ESP_GOTO_ON_FALSE(channel_id != -1, ESP_ERR_NOT_FOUND, err, TAG, "no free channel in unit (%d,%d)", group_id, unit_id);
// GPIO configuration
gpio_config_t gpio_conf = {
.intr_type = GPIO_INTR_DISABLE,
.mode = GPIO_MODE_INPUT | (config->flags.io_loop_back ? GPIO_MODE_OUTPUT : 0), // also enable the output path if `io_loop_back` is enabled
.pull_down_en = false,
.pull_up_en = true,
};
if (config->edge_gpio_num >= 0) {
gpio_conf.pin_bit_mask = 1ULL << config->edge_gpio_num;
ESP_GOTO_ON_ERROR(gpio_config(&gpio_conf), err, TAG, "config edge GPIO failed");
esp_rom_gpio_connect_in_signal(config->edge_gpio_num,
pcnt_periph_signals.groups[group_id].units[unit_id].channels[channel_id].pulse_sig,
config->flags.invert_edge_input);
} else {
// using virtual IO
esp_rom_gpio_connect_in_signal(config->flags.virt_edge_io_level ? GPIO_MATRIX_CONST_ONE_INPUT : GPIO_MATRIX_CONST_ZERO_INPUT,
pcnt_periph_signals.groups[group_id].units[unit_id].channels[channel_id].pulse_sig,
config->flags.invert_edge_input);
}
if (config->level_gpio_num >= 0) {
gpio_conf.pin_bit_mask = 1ULL << config->level_gpio_num;
ESP_GOTO_ON_ERROR(gpio_config(&gpio_conf), err, TAG, "config level GPIO failed");
esp_rom_gpio_connect_in_signal(config->level_gpio_num,
pcnt_periph_signals.groups[group_id].units[unit_id].channels[channel_id].control_sig,
config->flags.invert_level_input);
} else {
// using virtual IO
esp_rom_gpio_connect_in_signal(config->flags.virt_level_io_level ? GPIO_MATRIX_CONST_ONE_INPUT : GPIO_MATRIX_CONST_ZERO_INPUT,
pcnt_periph_signals.groups[group_id].units[unit_id].channels[channel_id].control_sig,
config->flags.invert_level_input);
}
channel->channel_id = channel_id;
channel->unit = unit;
channel->edge_gpio_num = config->edge_gpio_num;
channel->level_gpio_num = config->level_gpio_num;
ESP_LOGD(TAG, "new pcnt channel(%d,%d,%d) at %p", group_id, unit_id, channel_id, channel);
*ret_chan = channel;
return ESP_OK;
err:
if (channel) {
free(channel);
}
return ret;
}
esp_err_t pcnt_del_channel(pcnt_channel_handle_t chan)
{
ESP_RETURN_ON_FALSE(chan, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
pcnt_unit_t *unit = chan->unit;
pcnt_group_t *group = unit->group;
int group_id = group->group_id;
int unit_id = unit->unit_id;
int channel_id = chan->channel_id;
portENTER_CRITICAL(&unit->spinlock);
unit->channels[channel_id] = NULL;
portEXIT_CRITICAL(&unit->spinlock);
if (chan->level_gpio_num >= 0) {
gpio_reset_pin(chan->level_gpio_num);
}
if (chan->edge_gpio_num >= 0) {
gpio_reset_pin(chan->edge_gpio_num);
}
free(chan);
ESP_LOGD(TAG, "del pcnt channel(%d,%d,%d)", group_id, unit_id, channel_id);
return ESP_OK;
}
esp_err_t pcnt_channel_set_edge_action(pcnt_channel_handle_t chan, pcnt_channel_edge_action_t pos_act, pcnt_channel_edge_action_t neg_act)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(chan, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
pcnt_unit_t *unit = chan->unit;
group = unit->group;
// mode control bits are mixed with other PCNT control bits in a same register
portENTER_CRITICAL(&unit->spinlock);
pcnt_ll_set_edge_action(group->hal.dev, unit->unit_id, chan->channel_id, pos_act, neg_act);
portEXIT_CRITICAL(&unit->spinlock);
return ESP_OK;
}
esp_err_t pcnt_channel_set_level_action(pcnt_channel_handle_t chan, pcnt_channel_level_action_t high_act, pcnt_channel_level_action_t low_act)
{
pcnt_group_t *group = NULL;
ESP_RETURN_ON_FALSE(chan, ESP_ERR_INVALID_ARG, TAG, "invalid argument");
pcnt_unit_t *unit = chan->unit;
group = unit->group;
// mode control bits are mixed with other PCNT control bits in a same register
portENTER_CRITICAL(&unit->spinlock);
pcnt_ll_set_level_action(group->hal.dev, unit->unit_id, chan->channel_id, high_act, low_act);
portEXIT_CRITICAL(&unit->spinlock);
return ESP_OK;
}
static pcnt_group_t *pcnt_acquire_group_handle(int group_id)
{
bool new_group = false;
pcnt_group_t *group = NULL;
// prevent install pcnt group concurrently
_lock_acquire(&s_platform.mutex);
if (!s_platform.groups[group_id]) {
group = heap_caps_calloc(1, sizeof(pcnt_group_t), PCNT_MEM_ALLOC_CAPS);
if (group) {
new_group = true;
s_platform.groups[group_id] = group; // register to platform
// initialize pcnt group members
group->group_id = group_id;
group->intr_priority = -1;
group->spinlock = (portMUX_TYPE)portMUX_INITIALIZER_UNLOCKED;
// enable APB access pcnt registers
PCNT_RCC_ATOMIC() {
pcnt_ll_enable_bus_clock(group_id, true);
pcnt_ll_reset_register(group_id);
}
// initialize HAL context
pcnt_hal_init(&group->hal, group_id);
}
} else {
group = s_platform.groups[group_id];
}
if (group) {
// someone acquired the group handle means we have a new object that refer to this group
s_platform.group_ref_counts[group_id]++;
}
_lock_release(&s_platform.mutex);
if (new_group) {
ESP_LOGD(TAG, "new group (%d) at %p", group_id, group);
}
return group;
}
static void pcnt_release_group_handle(pcnt_group_t *group)
{
int group_id = group->group_id;
bool do_deinitialize = false;
_lock_acquire(&s_platform.mutex);
s_platform.group_ref_counts[group_id]--;
if (s_platform.group_ref_counts[group_id] == 0) {
assert(s_platform.groups[group_id]);
do_deinitialize = true;
s_platform.groups[group_id] = NULL; // deregister from platform
PCNT_RCC_ATOMIC() {
pcnt_ll_enable_bus_clock(group_id, false);
}
}
_lock_release(&s_platform.mutex);
if (do_deinitialize) {
free(group);
ESP_LOGD(TAG, "del group (%d)", group_id);
}
}
IRAM_ATTR static void pcnt_default_isr(void *args)
{
bool need_yield = false;
pcnt_unit_t *unit = (pcnt_unit_t *)args;
int unit_id = unit->unit_id;
pcnt_group_t *group = unit->group;
pcnt_watch_cb_t on_reach = unit->on_reach;
uint32_t intr_status = pcnt_ll_get_intr_status(group->hal.dev);
if (intr_status & PCNT_LL_UNIT_WATCH_EVENT(unit_id)) {
pcnt_ll_clear_intr_status(group->hal.dev, PCNT_LL_UNIT_WATCH_EVENT(unit_id));
// event status word contains information about the real watch event type
uint32_t event_status = pcnt_ll_get_event_status(group->hal.dev, unit_id);
int count_value = 0;
pcnt_unit_zero_cross_mode_t zc_mode = PCNT_UNIT_ZERO_CROSS_INVALID;
// using while loop so that we don't miss any event
while (event_status) {
#if SOC_PCNT_SUPPORT_STEP_NOTIFY
// step event has higher priority than pointer event
if (event_status & (BIT(PCNT_LL_STEP_EVENT_REACH_INTERVAL) | BIT(PCNT_LL_STEP_EVENT_REACH_LIMIT))) {
if (event_status & BIT(PCNT_LL_STEP_EVENT_REACH_INTERVAL)) {
event_status &= ~BIT(PCNT_LL_STEP_EVENT_REACH_INTERVAL);
// align current count value to the step interval
count_value = pcnt_ll_get_count(group->hal.dev, unit_id);
}
if (event_status & BIT(PCNT_LL_STEP_EVENT_REACH_LIMIT)) {
event_status &= ~BIT(PCNT_LL_STEP_EVENT_REACH_LIMIT);
// adjust current count value to the step limit
count_value = unit->step_limit;
if (unit->flags.accum_count) {
portENTER_CRITICAL_ISR(&unit->spinlock);
unit->accum_value += unit->step_limit;
portEXIT_CRITICAL_ISR(&unit->spinlock);
}
}
// step event may happen with other pointer event at the same time, we don't need to process them again
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_LOW_LIMIT) | BIT(PCNT_LL_WATCH_EVENT_HIGH_LIMIT) |
BIT(PCNT_LL_WATCH_EVENT_THRES0) | BIT(PCNT_LL_WATCH_EVENT_THRES1));
} else
#endif // SOC_PCNT_SUPPORT_STEP_NOTIFY
if (event_status & BIT(PCNT_LL_WATCH_EVENT_LOW_LIMIT)) {
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_LOW_LIMIT));
// adjust the count value to reflect the actual watch point value
count_value = unit->low_limit;
if (unit->flags.accum_count) {
portENTER_CRITICAL_ISR(&unit->spinlock);
unit->accum_value += unit->low_limit;
portEXIT_CRITICAL_ISR(&unit->spinlock);
}
} else if (event_status & BIT(PCNT_LL_WATCH_EVENT_HIGH_LIMIT)) {
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_HIGH_LIMIT));
// adjust the count value to reflect the actual watch point value
count_value = unit->high_limit;
if (unit->flags.accum_count) {
portENTER_CRITICAL_ISR(&unit->spinlock);
unit->accum_value += unit->high_limit;
portEXIT_CRITICAL_ISR(&unit->spinlock);
}
} else if (event_status & BIT(PCNT_LL_WATCH_EVENT_THRES0)) {
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_THRES0));
// adjust the count value to reflect the actual watch point value
count_value = pcnt_ll_get_thres_value(group->hal.dev, unit_id, 0);
} else if (event_status & BIT(PCNT_LL_WATCH_EVENT_THRES1)) {
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_THRES1));
// adjust the count value to reflect the actual watch point value
count_value = pcnt_ll_get_thres_value(group->hal.dev, unit_id, 1);
} else if (event_status & BIT(PCNT_LL_WATCH_EVENT_ZERO_CROSS)) {
event_status &= ~(BIT(PCNT_LL_WATCH_EVENT_ZERO_CROSS));
count_value = 0;
zc_mode = pcnt_ll_get_zero_cross_mode(group->hal.dev, unit_id);
}
// invoked user registered callback
if (on_reach) {
pcnt_watch_event_data_t edata = {
.watch_point_value = count_value,
.zero_cross_mode = zc_mode,
};
if (on_reach(unit, &edata, unit->user_data)) {
// check if we need to yield for high priority task
need_yield = true;
}
}
}
}
if (need_yield) {
portYIELD_FROM_ISR();
}
}
```
|
Holliday Hydroelectric Powerhouse and Dam, also known as Holliday Station, is a historic powerhouse and dam located on the White River near Noblesville in Noblesville Township, Hamilton County, Indiana. It was built in 1922, and includes a one-story Châteauesque style powerhouse building and a concrete dam measuring 10 feet high and 345 feet long. The powerhouse measures 26 feet wide and 40 feet long and is constructed of stone with a slate roof.
It was listed on the National Register of Historic Places in 1995.
References
Dams on the National Register of Historic Places in Indiana
Châteauesque architecture in the United States
Dams completed in 1922
Buildings and structures in Hamilton County, Indiana
National Register of Historic Places in Hamilton County, Indiana
Gravity dams
Industrial buildings and structures on the National Register of Historic Places in Indiana
|
```php
<?php declare(strict_types=1);
namespace Tests\Unit\Schema\Directives;
use GraphQL\Validator\Rules\QueryComplexity;
use Illuminate\Contracts\Config\Repository as ConfigRepository;
use Tests\TestCase;
use Tests\Utils\Queries\Foo;
final class ComplexityDirectiveTest extends TestCase
{
public const CUSTOM_COMPLEXITY = 123;
public function testDefaultComplexity(): void
{
$max = 1;
$this->setMaxQueryComplexity($max);
$this->schema = /** @lang GraphQL */ '
type Query {
posts: [Post!]! @all
}
type Post {
title: String
}
';
$this->graphQL(/** @lang GraphQL */ '
{
posts {
title
}
}
')->assertGraphQLErrorMessage(QueryComplexity::maxQueryComplexityErrorMessage($max, 2));
}
public function testKnowsPagination(): void
{
$max = 1;
$this->setMaxQueryComplexity($max);
$this->schema = /** @lang GraphQL */ '
type Query {
posts: [Post!]! @paginate
}
type Post {
title: String
}
';
// 1 + (2 for data & title * 10 first items)
$expectedCount = 21;
$this->graphQL(/** @lang GraphQL */ '
{
posts(first: 10) {
data {
title
}
}
}
')->assertGraphQLErrorMessage(QueryComplexity::maxQueryComplexityErrorMessage($max, $expectedCount));
}
public function testIgnoresFirstArgumentUnrelatedToPagination(): void
{
$max = 1;
$this->setMaxQueryComplexity($max);
$this->schema = /** @lang GraphQL */ '
type Query {
posts(first: String!): [Post!]! @all
}
type Post {
title: String
}
';
$this->graphQL(/** @lang GraphQL */ '
{
posts(first: "named like the generated argument of @paginate, but should not increase complexity here") {
title
}
}
')->assertGraphQLErrorMessage(QueryComplexity::maxQueryComplexityErrorMessage($max, 2));
}
public function testCustomComplexityResolver(): void
{
$max = 1;
$this->setMaxQueryComplexity($max);
$this->schema = /** @lang GraphQL */ <<<GRAPHQL
type Query {
foo: ID @complexity(resolver: "{$this->qualifyTestResolver('complexity')}")
}
GRAPHQL;
$this->graphQL(/** @lang GraphQL */ '
{
foo
}
')->assertGraphQLErrorMessage(QueryComplexity::maxQueryComplexityErrorMessage($max, self::CUSTOM_COMPLEXITY));
}
public function testResolvesComplexityResolverThroughDefaultNamespace(): void
{
$max = 1;
$this->setMaxQueryComplexity($max);
$this->schema = /** @lang GraphQL */ <<<'GRAPHQL'
type Query {
foo: Int @complexity(resolver: "Foo@complexity")
}
GRAPHQL;
$this->graphQL(/** @lang GraphQL */ '
{
foo
}
')->assertGraphQLErrorMessage(QueryComplexity::maxQueryComplexityErrorMessage($max, Foo::THE_ANSWER));
}
public static function complexity(): int
{
return self::CUSTOM_COMPLEXITY;
}
protected function setMaxQueryComplexity(int $max): void
{
$config = $this->app->make(ConfigRepository::class);
$config->set('lighthouse.security.max_query_complexity', $max);
}
}
```
|
```kotlin
package net.corda.node.services.statemachine
import co.paralleluniverse.fibers.Suspendable
import net.corda.core.flows.Destination
import net.corda.core.flows.FlowException
import net.corda.core.flows.FlowLogic
import net.corda.core.flows.FlowSession
import net.corda.core.flows.InitiatedBy
import net.corda.core.flows.InitiatingFlow
import net.corda.core.flows.StartableByRPC
import net.corda.core.flows.UnexpectedFlowEndException
import net.corda.core.identity.Party
import net.corda.core.identity.PartyAndCertificate
import net.corda.core.internal.mapToSet
import net.corda.core.serialization.CordaSerializable
import net.corda.core.utilities.getOrThrow
import net.corda.core.utilities.unwrap
import net.corda.testing.core.ALICE_NAME
import net.corda.testing.core.singleIdentity
import net.corda.testing.node.internal.InternalMockNetwork
import net.corda.testing.node.internal.InternalMockNodeParameters
import net.corda.testing.node.internal.TestStartedNode
import net.corda.testing.node.internal.enclosedCordapp
import net.corda.testing.node.internal.startFlow
import org.assertj.core.api.Assertions.assertThatThrownBy
import org.junit.AfterClass
import org.junit.BeforeClass
import org.junit.Test
import kotlin.test.assertEquals
class FlowParallelMessagingTests {
companion object {
private lateinit var mockNet: InternalMockNetwork
private lateinit var senderNode: TestStartedNode
private lateinit var recipientNode1: TestStartedNode
private lateinit var recipientNode2: TestStartedNode
private lateinit var notaryIdentity: Party
private lateinit var senderParty: Party
private lateinit var recipientParty1: Party
private lateinit var recipientParty2: Party
@BeforeClass
@JvmStatic
fun setup() {
mockNet = InternalMockNetwork(
cordappsForAllNodes = listOf(enclosedCordapp())
)
senderNode = mockNet.createNode(InternalMockNodeParameters(legalName = ALICE_NAME.copy(organisation = "SenderNode")))
recipientNode1 = mockNet.createNode(InternalMockNodeParameters(legalName = ALICE_NAME.copy(organisation = "RecipientNode1")))
recipientNode2 = mockNet.createNode(InternalMockNodeParameters(legalName = ALICE_NAME.copy(organisation = "RecipientNode2")))
notaryIdentity = mockNet.defaultNotaryIdentity
senderParty = senderNode.info.singleIdentity()
recipientParty1 = recipientNode1.info.singleIdentity()
recipientParty2 = recipientNode2.info.singleIdentity()
}
@AfterClass
@JvmStatic
fun cleanUp() {
mockNet.stopNodes()
}
}
@Test(timeout=300_000)
fun `messages can be exchanged in parallel using sendAll & receiveAll between multiple parties successfully`() {
val messages = mapOf(
recipientParty1 to MessageType.REPLY,
recipientParty2 to MessageType.REPLY
)
val flow = senderNode.services.startFlow(SenderFlow(messages))
mockNet.runNetwork()
val result = flow.resultFuture.getOrThrow()
assertEquals("ok", result)
}
@Test(timeout=300_000)
fun `flow exceptions from counterparties during receiveAll are handled properly`() {
val messages = mapOf(
recipientParty1 to MessageType.REPLY,
recipientParty2 to MessageType.GRACEFUL_FAILURE
)
val flow = senderNode.services.startFlow(SenderFlow(messages))
mockNet.runNetwork()
assertThatThrownBy{ flow.resultFuture.getOrThrow() }
.isInstanceOf(FlowException::class.java)
.hasMessage("graceful failure")
}
@Test(timeout=300_000)
fun `runtime exceptions from counterparties during receiveAll are handled properly`() {
val messages = mapOf(
recipientParty1 to MessageType.REPLY,
recipientParty2 to MessageType.CRASH
)
val flow = senderNode.services.startFlow(SenderFlow(messages))
mockNet.runNetwork()
assertThatThrownBy{ flow.resultFuture.getOrThrow() }
.isInstanceOf(UnexpectedFlowEndException::class.java)
}
@Test(timeout=300_000)
fun `initial session messages and existing session messages can be sent together using sendAll`() {
val flow = senderNode.services.startFlow(StagedSenderFlow(listOf(recipientParty1, recipientParty2)))
mockNet.runNetwork()
val result = flow.resultFuture.getOrThrow()
assertEquals("ok", result)
}
@Test(timeout=300_000)
fun `messages can be exchanged successfully even between anonymous parties`() {
val senderAnonymousParty = senderNode.createConfidentialIdentity(senderParty)
val firstRecipientAnonymousParty = recipientNode1.createConfidentialIdentity(recipientParty1)
senderNode.verifyAndRegister(firstRecipientAnonymousParty)
val secondRecipientAnonymousParty = recipientNode2.createConfidentialIdentity(recipientParty2)
senderNode.verifyAndRegister(secondRecipientAnonymousParty)
val messages = mapOf(
senderAnonymousParty.party.anonymise() to MessageType.REPLY,
firstRecipientAnonymousParty.party.anonymise() to MessageType.REPLY,
secondRecipientAnonymousParty.party.anonymise() to MessageType.REPLY
)
val flow = senderNode.services.startFlow(SenderFlow(messages))
mockNet.runNetwork()
val result = flow.resultFuture.getOrThrow()
assertEquals("ok", result)
}
@Test(timeout=300_000)
fun `a flow cannot invoke receiveAll with duplicate sessions`() {
val flow = senderNode.services.startFlow(InvalidReceiveFlow(listOf(recipientParty1), String::class.java))
mockNet.runNetwork()
assertThatThrownBy{ flow.resultFuture.getOrThrow() }
.isInstanceOf(java.lang.IllegalArgumentException::class.java)
.hasMessage("A flow session can only appear once as argument.")
}
fun TestStartedNode.createConfidentialIdentity(party: Party) =
services.keyManagementService.freshKeyAndCert(services.myInfo.legalIdentitiesAndCerts.single { it.name == party.name }, false)
fun TestStartedNode.verifyAndRegister(identity: PartyAndCertificate) =
services.identityService.verifyAndRegisterIdentity(identity)
@StartableByRPC
@InitiatingFlow
class SenderFlow(private val parties: Map<out Destination, MessageType>): FlowLogic<String>() {
@Suspendable
override fun call(): String {
val messagesPerSession = parties.toList().associate { (party, messageType) ->
val session = initiateFlow(party)
Pair(session, messageType)
}
sendAllMap(messagesPerSession)
val messages = receiveAll(String::class.java, messagesPerSession.keys.toList())
messages.map { it.unwrap { payload -> assertEquals("pong", payload) } }
return "ok"
}
}
@Suppress("TooGenericExceptionThrown")
@InitiatedBy(SenderFlow::class)
class RecipientFlow(private val otherPartySession: FlowSession): FlowLogic<String>() {
@Suspendable
override fun call(): String {
val msg = otherPartySession.receive<MessageType>().unwrap { it }
when (msg) {
MessageType.REPLY -> otherPartySession.send("pong")
MessageType.GRACEFUL_FAILURE -> throw FlowException("graceful failure")
MessageType.CRASH -> throw RuntimeException("crash")
}
return "ok"
}
}
@StartableByRPC
@InitiatingFlow
class StagedSenderFlow(private val parties: List<Destination>): FlowLogic<String>() {
@Suspendable
override fun call(): String {
if (parties.size < 2) {
throw IllegalArgumentException("at least two parties required for staged execution")
}
val sessions = parties.mapToSet(::initiateFlow)
sessions.first().send(StagedMessageType.INITIAL_RECIPIENT)
sessions.first().receive<String>().unwrap{ payload -> assertEquals("pong", payload) }
sendAll(StagedMessageType.REGULAR_RECIPIENT, sessions)
val messages = receiveAll(String::class.java, sessions.toList())
messages.map { it.unwrap { payload -> assertEquals("pong", payload) } }
return "ok"
}
}
@InitiatedBy(StagedSenderFlow::class)
class StagedRecipientFlow(private val otherPartySession: FlowSession): FlowLogic<String>() {
@Suspendable
override fun call(): String {
val msg = otherPartySession.receive<StagedMessageType>().unwrap { it }
when (msg) {
StagedMessageType.INITIAL_RECIPIENT -> {
otherPartySession.send("pong")
otherPartySession.receive<StagedMessageType>().unwrap { payload -> assertEquals(StagedMessageType.REGULAR_RECIPIENT, payload) }
otherPartySession.send("pong")
}
StagedMessageType.REGULAR_RECIPIENT -> otherPartySession.send("pong")
}
return "ok"
}
}
@StartableByRPC
@InitiatingFlow
class InvalidReceiveFlow<R: Any>(private val parties: List<Party>, private val payloadType: Class<R>): FlowLogic<String>() {
@Suspendable
override fun call(): String {
val sessions = parties.flatMap { party ->
val session = initiateFlow(party)
listOf(session, session)
}
receiveAll(payloadType, sessions)
return "ok"
}
}
@CordaSerializable
enum class MessageType {
REPLY,
GRACEFUL_FAILURE,
CRASH
}
@CordaSerializable
enum class StagedMessageType {
INITIAL_RECIPIENT,
REGULAR_RECIPIENT
}
}
```
|
Julma Satu is the debut album of the Finnish power metal band Villieläin. It was released on 19 August 2009 on the Universal Music Group label. It reached position 27 on the Finnish top 40 album charts, where it stayed for one week.
Track listing
"Voimat Villieläimen" (Powers of the Wild Animal)
"Kaiverrettu Hiekkaan" (Engraved In Sand)
"Rakkautta Vai Kuolemaa" (Love or Death)
"Voittamaton" (Invincible)
"Kuoleman Suudelma" (The Kiss of Death)
"Kostonenkeli" (Angel of Revenge)
"Veren Silta" (Bridge of Blood)
"Kauneimman Lauluni"(My Most Beautiful Song)
"Yön Kuningatar" (Queen of the Night)
"Kuuletko Kutsun" (Can You Hear the Call)
"Ihminen Ei Osaa Rakastaa" (Human Can't Love)
Songwriters
Jani Hölli (Soulrelic, Snakegod)
Piritta "Lumous" Vartola (Manzana)
Aksu Hanttu (Entwine)
Tommy Suomala (Soulrelic)
Raymond Pohjola (Soulrelic)
Anna-Eerika Guzejev (Dean)
Petri Alanko
Villieläin albums
2009 albums
|
Edward Brinton House is a historic home located in Birmingham Township, Chester County, Pennsylvania. The house was built in 1839, and is a -story, five bay, double pile, Georgian-style fieldstone dwelling with a gable roof. It has a -story stone summer kitchen addition.
It was added to the National Register of Historic Places in 1973.
References
Houses completed in 1839
Houses on the National Register of Historic Places in Pennsylvania
Georgian architecture in Pennsylvania
Houses in Chester County, Pennsylvania
National Register of Historic Places in Chester County, Pennsylvania
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.