content
stringlengths 10
4.9M
|
|---|
/**
* Add the specified vserver to the specified VF Module.
*
* @param vfModule
* the VF Module to update
* @param vserverWidget
* the Widget to add
* @return initial widget count for the vserver Widget
* @throws XmlArtifactGenerationException
* if the Widget mapping configuration is missing
*/
private int addVserverToVf(Resource vfModule, Widget vserverWidget) throws XmlArtifactGenerationException {
final int initialWidgetCount = 4;
assertNumberOfWidgets(vserverWidget, initialWidgetCount);
setWidgetAsMember(vfModule, vserverWidget);
assertThat(vfModule.addWidget(vserverWidget), is(true));
return initialWidgetCount;
} |
Bloomberg via Getty Images Billionaire investor Wilbur Ross, commerce secretary nominee for U.S. President-elect Donald Trump, speaks during a Senate Commerce, Science and Transportation Committee confirmation hearing in Washington, D.C., U.S., on Wednesday, Jan. 18, 2017.
Fifteen Democrats (and Maine’s Angus King, who caucuses with the Democrats) joined all 50 Senate Republicans present in casting a cloture vote for Trump’s billionaire pick for Commerce Secretary, Wilbur Ross last Friday.
Ross is not just your ordinary 79-year-old billionaire so often accused of cheating that he can semi-plausibly claim to Congress his failure to disclose an active 8 figure lawsuit against him was because he got it confused with other lawsuits against him.
And Ross is not just your typical billionaire paper pusher private equity guy whose manipulation of markets has hurt the American workers on whose behalf he professes to be interested in creating jobs.
Wilbur Ross is also a hidden in plain sight business partner with bona fide friends of Putin.
As discussions of Russia and Trump reach a crescendo, it is curious that the Senate is rushing forward with Wilbur Ross’s nomination. By a 66-31 margin little noticed by the political media, the U.S. Senate on Thursday, February 17th set a February 27th confirmation vote for Ross he seems likely to win easily.
That was only hours after six Democratic Senators sent Ross a letter “questioning the billionaire financier about his ownership stake in the Bank of Cyprus, on which he still serves as vice chairman of the board of directors. The six senators demanded answers about his relationship with Viktor Vekselberg, the second largest shareholder in the bank.”
Ross led a €1 billion bailout of the Bank of Cyprus and appointed several Russian nationals with close ties to the Kremlin to the Bank’s Board of Directors.
And who is this Viktor Vekselberg? Vekselberg is a friend of Russian leader Vladimir Putin and former member of the board of directors of Russian state-controlled oil giant Rosneft, which McClatchy notes “is under a partial sanction by the U.S. Treasury Department.”
In 2014, Ross led a €1 billion bailout of the Bank of Cyprus and appointed several Russian nationals with close ties to the Kremlin to the Bank’s Board of Directors. Ross took an 18 percent ownership interest in the bank. Cyprus is a key financial portal for Russian oligarchs, “often used by Russia’s politically connected businessmen. In a March 2013 report, McClatchy detailed how Russians had come to dominate Cyprus as both customers and providers of financial services.”
Ross is currently serving as a Vice Chairman of the Bank of Cyprus alongside Maksim Goldman, an executive of Renova Corporation. Renova is the second largest shareholder in the Bank and a Russian conglomerate headed by Viktor Vekselberg. Mr. Vekselberg is an ex-KGB colleague of President Putin. The prior co-Vice Chairman of the Bank, Vladimir Strzhalkovsky, served together in the KGB with President Putin and later served as Russia’s Deputy Minister of Economic Development and Trade and head of Russia’s Federal Tourism Agency.
Sen. Maria Cantwell, D-Wash. did send Ross a question about his relationship with Russian investors in the Bank of Cyprus; his interesting answer on January 22nd “was that he did not have any relationship prior to his investment in the bank, and had only met with the main Russian investor once, for an hour.”
And while Ross’s Bank of Cyprus investment has been sufficiently unsuccessful to make somewhat credible that he had not done sufficient due diligence on his partners, he has as of yet failed to provide Senate Democrats any information about that meeting.
A shockingly basic question from the six Democratic senators remains unanswered: “Are you aware of any loans made by the Bank of Cyprus to the Trump Organization, directly or through another financial institution, its directors or officers, or any affiliated individuals or entities?”
It is very difficult to square seriousness about Trump and Russia with relative indifference to Ross and Russia.
The Democratic senators had other direct questions that ought to be readily answerable, including “whether there were any ties between current or former bank officials and the Trump Organization or Trump campaign” and “whether anyone with ownership interest in the bank sought to directly or indirectly influence the U.S. election of American policy positions.”
Note that hours after voting to schedule a vote for Ross, the Senate’s bipartisan Intelligence Committee met with FBI Director James Comey behind closed doors. They emerged seemingly increasingly serious about investigating the nature of alleged Russian interference in the 2016 election.
It is very difficult to square seriousness about Trump and Russia with relative indifference to Ross and Russia.
The Senate has a duty to provide checks and balances on the executive branch.
Article II of the Constitution is clear that the president’s authority to “nominate” is only “with the advice and consent of the Senate.”
It is exceedingly unlikely that Senators “advised” President Trump to nominate Wilbur Ross for this position.
Until Ross provides public answers about his ties to Putin’s friends, it is clear Senators lack enough information about Ross’ known ties to Russian oligarchs to provide informed “consent.” |
/**
* @author Christoph Deppisch
* @since 1.3
*/
public class PurgeEndpointTestDesignerTest extends AbstractTestNGUnitTest {
private Endpoint endpoint1 = Mockito.mock(Endpoint.class);
private Endpoint endpoint2 = Mockito.mock(Endpoint.class);
private Endpoint endpoint3 = Mockito.mock(Endpoint.class);
private ApplicationContext applicationContextMock = Mockito.mock(ApplicationContext.class);
@Test
public void testPurgeEndpointsBuilderWithEndpoints() {
MockTestDesigner builder = new MockTestDesigner(applicationContext, context) {
@Override
public void configure() {
purgeEndpoints()
.endpoints(endpoint1, endpoint2)
.endpoint(endpoint3);
}
};
builder.configure();
TestCase test = builder.getTestCase();
Assert.assertEquals(test.getActionCount(), 1);
Assert.assertEquals(test.getActions().get(0).getClass(), PurgeEndpointAction.class);
Assert.assertEquals(test.getActions().get(0).getName(), "purge-endpoint");
PurgeEndpointAction action = (PurgeEndpointAction) test.getActions().get(0);
Assert.assertEquals(action.getEndpoints().size(), 3);
Assert.assertEquals(action.getEndpoints().toString(), "[" + endpoint1.toString() + ", " + endpoint2.toString() + ", " + endpoint3.toString() + "]");
Assert.assertNull(action.getMessageSelectorString());
Assert.assertEquals(action.getMessageSelector().size(), 0);
}
@Test
public void testPurgeEndpointBuilderWithNames() {
reset(applicationContextMock);
when(applicationContextMock.getBean(TestActionListeners.class)).thenReturn(new TestActionListeners());
when(applicationContextMock.getBeansOfType(SequenceBeforeTest.class)).thenReturn(new HashMap<String, SequenceBeforeTest>());
when(applicationContextMock.getBeansOfType(SequenceAfterTest.class)).thenReturn(new HashMap<String, SequenceAfterTest>());
MockTestDesigner builder = new MockTestDesigner(applicationContextMock, context) {
@Override
public void configure() {
purgeEndpoints()
.withApplicationContext(applicationContextMock)
.endpointNames("e1", "e2", "e3")
.endpoint("e4")
.selector("operation = 'sayHello'");
}
};
builder.configure();
TestCase test = builder.getTestCase();
Assert.assertEquals(test.getActionCount(), 1);
Assert.assertEquals(test.getActions().get(0).getClass(), PurgeEndpointAction.class);
PurgeEndpointAction action = (PurgeEndpointAction) test.getActions().get(0);
Assert.assertEquals(action.getEndpointNames().size(), 4);
Assert.assertEquals(action.getEndpointNames().toString(), "[e1, e2, e3, e4]");
Assert.assertEquals(action.getBeanFactory(), applicationContextMock);
Assert.assertEquals(action.getMessageSelectorString(), "operation = 'sayHello'");
Assert.assertEquals(action.getMessageSelector().size(), 0);
}
@Test
public void testPurgeEndpointBuilderWithMessageSelector() {
reset(applicationContextMock);
when(applicationContextMock.getBean(TestActionListeners.class)).thenReturn(new TestActionListeners());
when(applicationContextMock.getBeansOfType(SequenceBeforeTest.class)).thenReturn(new HashMap<String, SequenceBeforeTest>());
when(applicationContextMock.getBeansOfType(SequenceAfterTest.class)).thenReturn(new HashMap<String, SequenceAfterTest>());
MockTestDesigner builder = new MockTestDesigner(applicationContextMock, context) {
@Override
public void configure() {
purgeEndpoints()
.withApplicationContext(applicationContextMock)
.endpointNames("e1", "e2", "e3")
.endpoint("e4")
.selector(Collections.<String, Object>singletonMap("operation", "sayHello"));
}
};
builder.configure();
TestCase test = builder.getTestCase();
Assert.assertEquals(test.getActionCount(), 1);
Assert.assertEquals(test.getActions().get(0).getClass(), PurgeEndpointAction.class);
PurgeEndpointAction action = (PurgeEndpointAction) test.getActions().get(0);
Assert.assertEquals(action.getEndpointNames().size(), 4);
Assert.assertEquals(action.getEndpointNames().toString(), "[e1, e2, e3, e4]");
Assert.assertEquals(action.getBeanFactory(), applicationContextMock);
Assert.assertNull(action.getMessageSelectorString());
Assert.assertEquals(action.getMessageSelector().size(), 1);
}
@Test
public void testMissingEndpointResolver() {
reset(applicationContextMock);
when(applicationContextMock.getBean(TestActionListeners.class)).thenReturn(new TestActionListeners());
when(applicationContextMock.getBeansOfType(SequenceBeforeTest.class)).thenReturn(new HashMap<String, SequenceBeforeTest>());
when(applicationContextMock.getBeansOfType(SequenceAfterTest.class)).thenReturn(new HashMap<String, SequenceAfterTest>());
MockTestDesigner builder = new MockTestDesigner(applicationContextMock, context) {
@Override
public void configure() {
purgeEndpoints()
.endpoint("e1");
}
};
builder.configure();
TestCase test = builder.getTestCase();
Assert.assertEquals(test.getActionCount(), 1);
Assert.assertEquals(test.getActions().get(0).getClass(), PurgeEndpointAction.class);
PurgeEndpointAction action = (PurgeEndpointAction) test.getActions().get(0);
Assert.assertEquals(action.getEndpointNames().size(), 1);
Assert.assertEquals(action.getEndpointNames().toString(), "[e1]");
Assert.assertNotNull(action.getBeanFactory());
Assert.assertTrue(action.getBeanFactory() instanceof ApplicationContext);
}
} |
/**
* Adds a new implementation to the JSON Object.
*
* @param impl Implementation.
* @param profile Execution profile.
*/
public void addImplementationJSON(Implementation impl, Profile profile) {
String signature = impl.getSignature();
JSONObject implsJSON = this.getJSONForImplementations();
implsJSON.put(signature, profile.toJSONObject());
} |
/************************************************************************************
PublicHeader: OVR.h
Filename : OVR_UTF8Util.h
Content : UTF8 Unicode character encoding/decoding support
Created : September 19, 2012
Notes :
Copyright : Copyright 2014 Oculus VR, LLC. All Rights reserved.
************************************************************************************/
#ifndef OVR_UTF8Util_h
#define OVR_UTF8Util_h
#include "OVR_Types.h"
namespace OVR { namespace UTF8Util {
//-----------------------------------------------------------------------------------
// *** UTF8 string length and indexing.
// Determines the length of UTF8 string in characters.
// If source length is specified (in bytes), null 0 character is counted properly.
SPInt OVR_STDCALL GetLength(const char* putf8str, SPInt length = -1);
// Gets a decoded UTF8 character at index; you can access up to the index returned
// by GetLength. 0 will be returned for out of bounds access.
UInt32 OVR_STDCALL GetCharAt(SPInt index, const char* putf8str, SPInt length = -1);
// Converts UTF8 character index into byte offset.
// -1 is returned if index was out of bounds.
SPInt OVR_STDCALL GetByteIndex(SPInt index, const char* putf8str, SPInt length = -1);
// *** 16-bit Unicode string Encoding/Decoding routines.
// Determines the number of bytes necessary to encode a string.
// Does not count the terminating 0 (null) character.
SPInt OVR_STDCALL GetEncodeStringSize(const wchar_t* pchar, SPInt length = -1);
// Encodes a unicode (UCS-2 only) string into a buffer. The size of buffer must be at
// least GetEncodeStringSize() + 1.
void OVR_STDCALL EncodeString(char *pbuff, const wchar_t* pchar, SPInt length = -1);
// Decode UTF8 into a wchar_t buffer. Must have GetLength()+1 characters available.
// Characters over 0xFFFF are replaced with 0xFFFD.
// Returns the length of resulting string (number of characters)
UPInt OVR_STDCALL DecodeString(wchar_t *pbuff, const char* putf8str, SPInt bytesLen = -1);
// *** Individual character Encoding/Decoding.
// Determined the number of bytes necessary to encode a UCS character.
int OVR_STDCALL GetEncodeCharSize(UInt32 ucsCharacter);
// Encodes the given UCS character into the given UTF-8 buffer.
// Writes the data starting at buffer[offset], and
// increments offset by the number of bytes written.
// May write up to 6 bytes, so make sure there's room in the buffer
void OVR_STDCALL EncodeChar(char* pbuffer, SPInt* poffset, UInt32 ucsCharacter);
// Return the next Unicode character in the UTF-8 encoded buffer.
// Invalid UTF-8 sequences produce a U+FFFD character as output.
// Advances *utf8_buffer past the character returned. Pointer advance
// occurs even if the terminating 0 character is hit, since that allows
// strings with middle '\0' characters to be supported.
UInt32 OVR_STDCALL DecodeNextChar_Advance0(const char** putf8Buffer);
// Safer version of DecodeNextChar, which doesn't advance pointer if
// null character is hit.
inline UInt32 DecodeNextChar(const char** putf8Buffer)
{
UInt32 ch = DecodeNextChar_Advance0(putf8Buffer);
if (ch == 0)
(*putf8Buffer)--;
return ch;
}
}} // OVR::UTF8Util
#endif
|
/*
2017-5-25 20:53:41
https://leetcode.com/problems/interleaving-string/description/
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
For example,
Given:
s1 = "aabcc",
s2 = "dbbca",
When s3 = "aadbbcbcac", return true.
When s3 = "aadbbbaccc", return false.
dp[i][j]表示s1[0-(i-1)]和s2[0-(j-1)]能否构成s3[0-(i + j -1)]，这需要判断两部分:
dp[i-1][j]&&s1[i-1]==s3[0-(i + j -1)]
和
dp[i][j-1]&&(s2[j-1]==s3[0-(i + j -1)]
即s3的最后一个字符到底是由s1还是s2提供。
1.dp[0][4]=true表示s1不给出字符，s2给出s2[0-3](前四个字符的意思),即可配对s3[0-3]。
如果dp[0][4]=true表示的是s1给出字符s[0]，s2给出s2[0-4](下标到4的意思),即可配对s3[0-5]，则无法计算s1为空的情况，即使s1不为空，算dp[0][]这一排的时候也写的麻烦。
2.注意边界的处理，dp[0][0]应该恒为true。
*/
class Solution {
public:
bool isInterleave(string s1, string s2, string s3) {
if (s1.size() + s2.size() != s3.size())
return false;
if (s3.empty())
return true;
int row = s1.size();
int col = s2.size();
vector<bool> tmpVec(col + 1, false);
vector<vector<bool>> dp(row + 1, tmpVec);
for (int i = 0; i <= row; ++i)
{
for (int j = 0; j <= col; ++j)
{
if (i == j && j == 0)
{
dp[i][j] = true;
continue;
}
bool tmp1 = false;
bool tmp2 = false;
if (i != 0)
{
cout << (dp[i - 1][j]) << (s1[i - 1] == s3[i + j - 1]) << endl;
tmp1 = (dp[i - 1][j]) && (s1[i - 1] == s3[i + j - 1]);
}
if (j != 0)
{
tmp2 = dp[i][j - 1] && (s2[j - 1] == s3[i + j - 1]);
}
dp[i][j] = tmp1 || tmp2;
}
}
return dp[row][col];
}
}; |
class Processing:
"""base class for all Pre- and Postprocessing transformations"""
tensor_name: str
computed_dataset_statistics: Dict[str, Dict[Measure, Any]] = field(init=False)
computed_sample_statistics: Dict[str, Dict[Measure, Any]] = field(init=False)
def get_required_dataset_statistics(self) -> Dict[str, Set[Measure]]:
"""
Specifies which dataset measures are required from what tensor.
Returns: dataset measures required to apply this processing indexed by <tensor_name>.
"""
return {}
def get_required_sample_statistics(self) -> Dict[str, Set[Measure]]:
"""
Specifies which sample measures are required from what tensor.
Returns: sample measures required to apply this processing indexed by <tensor_name>.
"""
return {}
def set_computed_dataset_statistics(self, computed: Dict[str, Dict[Measure, Any]]):
"""helper to set computed statistics and check if they match the requirements"""
for tensor_name, req_measures in self.get_required_dataset_statistics().items():
comp_measures = computed.get(tensor_name, {})
for req_measure in req_measures:
if req_measure not in comp_measures:
raise ValueError(f"Missing required measure {req_measure} for {tensor_name}")
self.computed_dataset_statistics = computed
def set_computed_sample_statistics(self, computed: Dict[str, Dict[Measure, Any]]):
"""helper to set computed statistics and check if they match the requirements"""
for tensor_name, req_measures in self.get_required_sample_statistics().items():
comp_measures = computed.get(tensor_name, {})
for req_measure in req_measures:
if req_measure not in comp_measures:
raise ValueError(f"Missing required measure {req_measure} for {tensor_name}")
self.computed_sample_statistics = computed
def get_computed_dataset_statistics(self, tensor_name: str, measure: Measure):
"""helper to unpack self.computed_dataset_statistics"""
ret = self.computed_dataset_statistics.get(tensor_name, {}).get(measure)
if ret is None:
raise RuntimeError(f"Missing computed {measure} for {tensor_name} dataset.")
return ret
def get_computed_sample_statistics(self, tensor_name: str, measure: Measure):
"""helper to unpack self.computed_sample_statistics"""
ret = self.computed_sample_statistics.get(tensor_name, {}).get(measure)
if ret is None:
raise RuntimeError(f"Missing computed {measure} for {tensor_name} sample.")
return ret
def __call__(self, tensor: xr.DataArray) -> xr.DataArray:
return self.apply(tensor)
def apply(self, tensor: xr.DataArray) -> xr.DataArray:
"""apply processing to named tensors"""
raise NotImplementedError
def __post_init__(self):
"""validate common kwargs by their annotations"""
self.computed_dataset_statistics = {}
self.computed_sample_statistics = {}
for f in fields(self):
if f.name == "mode":
assert hasattr(self, "mode")
if self.mode not in get_args(f.type):
raise NotImplementedError(
f"Unsupported mode {self.mode} for {self.__class__.__name__}: {self.mode}"
) |
def two_complement_2_decimal(value, n_bits):
for current_bit in range(n_bits):
bit = (value >> current_bit) & 1
if bit == 1:
left_part = value >> (current_bit + 1)
left_mask = 2**(n_bits - (current_bit + 1)) - 1
right_mask = 2**(current_bit + 1)-1
right_part = value & right_mask
out = ((~left_part & left_mask) << (current_bit + 1)) + right_part
if out >> (n_bits - 1):
out = -value
return out
return 0 |
<reponame>zakkak/myrmics<filename>pr/config.c
// ============================================================================
// Copyright (c) 2013, FORTH-ICS / CARV
// (Foundation for Research & Technology -- Hellas,
// Institute of Computer Science,
// Computer Architecture & VLSI Systems Laboratory)
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// ==========================[ Static Information ]===========================
//
// Author : <NAME>
// Abstract : Possible Myrmics core configurations
//
// =============================[ CVS Variables ]=============================
//
// File name : $RCSfile: config.c,v $
// CVS revision : $Revision: 1.1 $
// Last modified : $Date: 2013/03/22 12:25:11 $
// Last author : $Author: lyberis-spree $
//
// ===========================================================================
#include <stdarg.h>
#include <kernel_toolset.h>
#include <processing.h>
// ===========================================================================
// pr_configure() Calls the real initialization function with
// the correct core setup
// ===========================================================================
// * INPUTS
// PrCfgModeSelect The core setup
// int auto_levels The number of tree levels for the
// PR_CFG_AUTO_MB setup
// int *auto_fanouts The tree fanouts for the PR_CFG_AUTO_MB setup
//
// * RETURN VALUE
// int pr_init() return value, or -1 for error
// ===========================================================================
int pr_configure(PrCfgMode select, int auto_levels, int *auto_fanouts) {
switch (select) {
// ======================================================================
case PR_CFG_1_MB:
return pr_init(1,
0x00, 0, ROLE_SCHEDULER, -1); // 0
case PR_CFG_1_ARM:
return pr_init(1,
0x6B, 0, ROLE_SCHEDULER, -1); // 0
// ======================================================================
case PR_CFG_2_MB_FLAT:
return pr_init(2,
0x00, 0, ROLE_WORKER, 1, // 0
0x00, 1, ROLE_SCHEDULER, -1); // 1
case PR_CFG_2_ARM_FLAT:
return pr_init(2,
0x6B, 0, ROLE_WORKER, 1, // 0
0x6B, 1, ROLE_SCHEDULER, -1); // 1
case PR_CFG_2_HET_FLAT:
return pr_init(2,
0x2B, 0, ROLE_WORKER, 1, // 0
0x6B, 0, ROLE_SCHEDULER, -1); // 1
// ======================================================================
case PR_CFG_3_MB_FLAT:
return pr_init(3,
0x00, 0, ROLE_WORKER, 2, // 0
0x00, 1, ROLE_WORKER, 2, // 1
0x00, 2, ROLE_SCHEDULER, -1); // 2
case PR_CFG_3_ARM_FLAT:
return pr_init(3,
0x6B, 0, ROLE_WORKER, 2, // 0
0x6B, 1, ROLE_WORKER, 2, // 1
0x6B, 2, ROLE_SCHEDULER, -1); // 2
case PR_CFG_3_HET_FLAT:
return pr_init(3,
0x2B, 0, ROLE_WORKER, 2, // 0
0x2B, 1, ROLE_WORKER, 2, // 1
0x6B, 0, ROLE_SCHEDULER, -1); // 2
// ======================================================================
case PR_CFG_5_MB_FLAT:
return pr_init(5,
0x00, 0, ROLE_WORKER, 4, // 0
0x00, 1, ROLE_WORKER, 4, // 1
0x00, 2, ROLE_WORKER, 4, // 2
0x00, 3, ROLE_WORKER, 4, // 3
0x00, 4, ROLE_SCHEDULER, -1); // 4
case PR_CFG_5_HET_FLAT:
return pr_init(5,
0x2B, 0, ROLE_WORKER, 4, // 0
0x2B, 1, ROLE_WORKER, 4, // 1
0x2B, 2, ROLE_WORKER, 4, // 2
0x2B, 3, ROLE_WORKER, 4, // 3
0x6B, 0, ROLE_SCHEDULER, -1); // 4
// ======================================================================
case PR_CFG_8_ARM_FLAT:
return pr_init(8,
0x4B, 0, ROLE_WORKER, 7, // 0
0x4B, 1, ROLE_WORKER, 7, // 1
0x4B, 2, ROLE_WORKER, 7, // 2
0x4B, 3, ROLE_WORKER, 7, // 3
0x6B, 0, ROLE_WORKER, 7, // 4
0x6B, 1, ROLE_WORKER, 7, // 5
0x6B, 2, ROLE_WORKER, 7, // 6
0x6B, 3, ROLE_SCHEDULER, -1); // 7
// ======================================================================
case PR_CFG_9_MB_FLAT:
return pr_init(9,
0x00, 0, ROLE_WORKER, 8, // 0
0x00, 1, ROLE_WORKER, 8, // 1
0x00, 2, ROLE_WORKER, 8, // 2
0x00, 3, ROLE_WORKER, 8, // 3
0x00, 4, ROLE_WORKER, 8, // 4
0x00, 5, ROLE_WORKER, 8, // 5
0x00, 6, ROLE_WORKER, 8, // 6
0x00, 7, ROLE_WORKER, 8, // 7
0x10, 0, ROLE_SCHEDULER, -1); // 8
case PR_CFG_9_HET_FLAT:
return pr_init(9,
0x2B, 0, ROLE_WORKER, 8, // 0
0x2B, 1, ROLE_WORKER, 8, // 1
0x2B, 2, ROLE_WORKER, 8, // 2
0x2B, 3, ROLE_WORKER, 8, // 3
0x2B, 4, ROLE_WORKER, 8, // 4
0x2B, 5, ROLE_WORKER, 8, // 5
0x2B, 6, ROLE_WORKER, 8, // 6
0x2B, 7, ROLE_WORKER, 8, // 7
0x6B, 0, ROLE_SCHEDULER, -1); // 8
// ======================================================================
case PR_CFG_10_MB_FLAT:
return pr_init(10,
0x00, 0, ROLE_WORKER, 9, // 0
0x00, 1, ROLE_WORKER, 9, // 1
0x00, 2, ROLE_WORKER, 9, // 2
0x00, 3, ROLE_WORKER, 9, // 3
0x00, 4, ROLE_WORKER, 9, // 4
0x00, 5, ROLE_WORKER, 9, // 5
0x00, 6, ROLE_WORKER, 9, // 6
0x00, 7, ROLE_WORKER, 9, // 7
0x10, 0, ROLE_WORKER, 9, // 8
0x10, 1, ROLE_SCHEDULER, -1); // 9
// ======================================================================
case PR_CFG_11_MB_HIER:
return pr_init(11,
0x00, 0, ROLE_WORKER, 8, // 0
0x00, 1, ROLE_WORKER, 8, // 1
0x00, 2, ROLE_WORKER, 8, // 2
0x00, 3, ROLE_WORKER, 8, // 3
0x00, 4, ROLE_WORKER, 9, // 4
0x00, 5, ROLE_WORKER, 9, // 5
0x00, 6, ROLE_WORKER, 9, // 6
0x00, 7, ROLE_WORKER, 9, // 7
0x10, 0, ROLE_SCHEDULER, 10, // 8
0x10, 1, ROLE_SCHEDULER, 10, // 9
0x10, 2, ROLE_SCHEDULER, -1); // 10
case PR_CFG_11_HET_HIER:
return pr_init(11,
0x00, 0, ROLE_WORKER, 8, // 0
0x00, 1, ROLE_WORKER, 8, // 1
0x00, 2, ROLE_WORKER, 8, // 2
0x00, 3, ROLE_WORKER, 8, // 3
0x00, 4, ROLE_WORKER, 9, // 4
0x00, 5, ROLE_WORKER, 9, // 5
0x00, 6, ROLE_WORKER, 9, // 6
0x00, 7, ROLE_WORKER, 9, // 7
0x6B, 0, ROLE_SCHEDULER, 10, // 8
0x6B, 1, ROLE_SCHEDULER, 10, // 9
0x6B, 2, ROLE_SCHEDULER, -1); // 10
// ======================================================================
case PR_CFG_17_MB_FLAT:
return pr_init(17,
0x00, 0, ROLE_WORKER, 16, // 0
0x00, 1, ROLE_WORKER, 16, // 1
0x00, 2, ROLE_WORKER, 16, // 2
0x00, 3, ROLE_WORKER, 16, // 3
0x00, 4, ROLE_WORKER, 16, // 4
0x00, 5, ROLE_WORKER, 16, // 5
0x00, 6, ROLE_WORKER, 16, // 6
0x00, 7, ROLE_WORKER, 16, // 7
0x20, 0, ROLE_WORKER, 16, // 8
0x20, 1, ROLE_WORKER, 16, // 9
0x20, 2, ROLE_WORKER, 16, // 10
0x20, 3, ROLE_WORKER, 16, // 11
0x20, 4, ROLE_WORKER, 16, // 12
0x20, 5, ROLE_WORKER, 16, // 13
0x20, 6, ROLE_WORKER, 16, // 14
0x20, 7, ROLE_WORKER, 16, // 15
0x10, 0, ROLE_SCHEDULER, -1); // 16
case PR_CFG_17_HET_FLAT:
return pr_init(17,
0x1B, 0, ROLE_WORKER, 16, // 0
0x1B, 1, ROLE_WORKER, 16, // 1
0x1B, 2, ROLE_WORKER, 16, // 2
0x1B, 3, ROLE_WORKER, 16, // 3
0x1B, 4, ROLE_WORKER, 16, // 4
0x1B, 5, ROLE_WORKER, 16, // 5
0x1B, 6, ROLE_WORKER, 16, // 6
0x1B, 7, ROLE_WORKER, 16, // 7
0x2B, 0, ROLE_WORKER, 16, // 8
0x2B, 1, ROLE_WORKER, 16, // 9
0x2B, 2, ROLE_WORKER, 16, // 10
0x2B, 3, ROLE_WORKER, 16, // 11
0x2B, 4, ROLE_WORKER, 16, // 12
0x2B, 5, ROLE_WORKER, 16, // 13
0x2B, 6, ROLE_WORKER, 16, // 14
0x2B, 7, ROLE_WORKER, 16, // 15
0x6B, 0, ROLE_SCHEDULER, -1); // 16
// ======================================================================
case PR_CFG_19_MB_HIER:
return pr_init(19,
0x00, 0, ROLE_WORKER, 16, // 0
0x00, 1, ROLE_WORKER, 16, // 1
0x00, 2, ROLE_WORKER, 16, // 2
0x00, 3, ROLE_WORKER, 16, // 3
0x00, 4, ROLE_WORKER, 16, // 4
0x00, 5, ROLE_WORKER, 16, // 5
0x00, 6, ROLE_WORKER, 16, // 6
0x00, 7, ROLE_WORKER, 16, // 7
0x20, 0, ROLE_WORKER, 17, // 8
0x20, 1, ROLE_WORKER, 17, // 9
0x20, 2, ROLE_WORKER, 17, // 10
0x20, 3, ROLE_WORKER, 17, // 11
0x20, 4, ROLE_WORKER, 17, // 12
0x20, 5, ROLE_WORKER, 17, // 13
0x20, 6, ROLE_WORKER, 17, // 14
0x20, 7, ROLE_WORKER, 17, // 15
0x10, 0, ROLE_SCHEDULER, 18, // 16
0x10, 1, ROLE_SCHEDULER, 18, // 17
0x10, 2, ROLE_SCHEDULER, -1); // 18
// ======================================================================
case PR_CFG_25_MB_FLAT:
return pr_init(25,
0x00, 0, ROLE_WORKER, 24, // 0
0x00, 1, ROLE_WORKER, 24, // 1
0x00, 2, ROLE_WORKER, 24, // 2
0x00, 3, ROLE_WORKER, 24, // 3
0x00, 4, ROLE_WORKER, 24, // 4
0x00, 5, ROLE_WORKER, 24, // 5
0x00, 6, ROLE_WORKER, 24, // 6
0x00, 7, ROLE_WORKER, 24, // 7
0x10, 0, ROLE_WORKER, 24, // 8
0x10, 1, ROLE_WORKER, 24, // 9
0x10, 2, ROLE_WORKER, 24, // 10
0x10, 3, ROLE_WORKER, 24, // 11
0x10, 4, ROLE_WORKER, 24, // 12
0x10, 5, ROLE_WORKER, 24, // 13
0x10, 6, ROLE_WORKER, 24, // 14
0x10, 7, ROLE_WORKER, 24, // 15
0x20, 0, ROLE_WORKER, 24, // 16
0x20, 1, ROLE_WORKER, 24, // 17
0x20, 2, ROLE_WORKER, 24, // 18
0x20, 3, ROLE_WORKER, 24, // 19
0x20, 4, ROLE_WORKER, 24, // 20
0x20, 5, ROLE_WORKER, 24, // 21
0x20, 6, ROLE_WORKER, 24, // 22
0x20, 7, ROLE_WORKER, 24, // 23
0x11, 0, ROLE_SCHEDULER, -1); // 24
case PR_CFG_25_HET_FLAT:
return pr_init(25,
0x1B, 0, ROLE_WORKER, 24, // 0
0x1B, 1, ROLE_WORKER, 24, // 1
0x1B, 2, ROLE_WORKER, 24, // 2
0x1B, 3, ROLE_WORKER, 24, // 3
0x1B, 4, ROLE_WORKER, 24, // 4
0x1B, 5, ROLE_WORKER, 24, // 5
0x1B, 6, ROLE_WORKER, 24, // 6
0x1B, 7, ROLE_WORKER, 24, // 7
0x2B, 0, ROLE_WORKER, 24, // 8
0x2B, 1, ROLE_WORKER, 24, // 9
0x2B, 2, ROLE_WORKER, 24, // 10
0x2B, 3, ROLE_WORKER, 24, // 11
0x2B, 4, ROLE_WORKER, 24, // 12
0x2B, 5, ROLE_WORKER, 24, // 13
0x2B, 6, ROLE_WORKER, 24, // 14
0x2B, 7, ROLE_WORKER, 24, // 15
0x3B, 0, ROLE_WORKER, 24, // 16
0x3B, 1, ROLE_WORKER, 24, // 17
0x3B, 2, ROLE_WORKER, 24, // 18
0x3B, 3, ROLE_WORKER, 24, // 19
0x3B, 4, ROLE_WORKER, 24, // 20
0x3B, 5, ROLE_WORKER, 24, // 21
0x3B, 6, ROLE_WORKER, 24, // 22
0x3B, 7, ROLE_WORKER, 24, // 23
0x6B, 0, ROLE_SCHEDULER, -1); // 24
// ======================================================================
case PR_CFG_26_MB_FLAT:
return pr_init(26,
0x00, 0, ROLE_WORKER, 25, // 0
0x00, 1, ROLE_WORKER, 25, // 1
0x00, 2, ROLE_WORKER, 25, // 2
0x00, 3, ROLE_WORKER, 25, // 3
0x00, 4, ROLE_WORKER, 25, // 4
0x00, 5, ROLE_WORKER, 25, // 5
0x00, 6, ROLE_WORKER, 25, // 6
0x00, 7, ROLE_WORKER, 25, // 7
0x10, 0, ROLE_WORKER, 25, // 8
0x10, 1, ROLE_WORKER, 25, // 9
0x10, 2, ROLE_WORKER, 25, // 10
0x10, 3, ROLE_WORKER, 25, // 11
0x10, 4, ROLE_WORKER, 25, // 12
0x10, 5, ROLE_WORKER, 25, // 13
0x10, 6, ROLE_WORKER, 25, // 14
0x10, 7, ROLE_WORKER, 25, // 15
0x20, 0, ROLE_WORKER, 25, // 16
0x20, 1, ROLE_WORKER, 25, // 17
0x20, 2, ROLE_WORKER, 25, // 18
0x20, 3, ROLE_WORKER, 25, // 19
0x20, 4, ROLE_WORKER, 25, // 20
0x20, 5, ROLE_WORKER, 25, // 21
0x20, 6, ROLE_WORKER, 25, // 22
0x20, 7, ROLE_WORKER, 25, // 23
0x11, 0, ROLE_WORKER, 25, // 24
0x11, 1, ROLE_SCHEDULER, -1); // 25
// ======================================================================
case PR_CFG_28_HET_HIER:
return pr_init(28,
0x1B, 0, ROLE_WORKER, 24, // 0
0x1B, 1, ROLE_WORKER, 24, // 1
0x1B, 2, ROLE_WORKER, 24, // 2
0x1B, 3, ROLE_WORKER, 24, // 3
0x1B, 4, ROLE_WORKER, 24, // 4
0x1B, 5, ROLE_WORKER, 24, // 5
0x1B, 6, ROLE_WORKER, 24, // 6
0x1B, 7, ROLE_WORKER, 24, // 7
0x2B, 0, ROLE_WORKER, 25, // 8
0x2B, 1, ROLE_WORKER, 25, // 9
0x2B, 2, ROLE_WORKER, 25, // 10
0x2B, 3, ROLE_WORKER, 25, // 11
0x2B, 4, ROLE_WORKER, 25, // 12
0x2B, 5, ROLE_WORKER, 25, // 13
0x2B, 6, ROLE_WORKER, 25, // 14
0x2B, 7, ROLE_WORKER, 25, // 15
0x3B, 0, ROLE_WORKER, 26, // 16
0x3B, 1, ROLE_WORKER, 26, // 17
0x3B, 2, ROLE_WORKER, 26, // 18
0x3B, 3, ROLE_WORKER, 26, // 19
0x3B, 4, ROLE_WORKER, 26, // 20
0x3B, 5, ROLE_WORKER, 26, // 21
0x3B, 6, ROLE_WORKER, 26, // 22
0x3B, 7, ROLE_WORKER, 26, // 23
0x6B, 0, ROLE_SCHEDULER, 27, // 24
0x6B, 1, ROLE_SCHEDULER, 27, // 25
0x6B, 2, ROLE_SCHEDULER, 27, // 26
0x6B, 3, ROLE_SCHEDULER, -1); // 27
// ======================================================================
case PR_CFG_31_MB_HIER:
return pr_init(31,
0x00, 0, ROLE_WORKER, 2, // 0
0x00, 1, ROLE_WORKER, 2, // 1
0x00, 2, ROLE_SCHEDULER, 6, // 2
0x00, 3, ROLE_WORKER, 5, // 3
0x00, 4, ROLE_WORKER, 5, // 4
0x00, 5, ROLE_SCHEDULER, 6, // 5
0x00, 6, ROLE_SCHEDULER, 28, // 6
0x10, 0, ROLE_WORKER, 9, // 7
0x10, 1, ROLE_WORKER, 9, // 8
0x10, 2, ROLE_SCHEDULER, 13, // 9
0x10, 3, ROLE_WORKER, 12, // 10
0x10, 4, ROLE_WORKER, 12, // 11
0x10, 5, ROLE_SCHEDULER, 13, // 12
0x10, 6, ROLE_SCHEDULER, 28, // 13
0x04, 0, ROLE_WORKER, 16, // 14
0x04, 1, ROLE_WORKER, 16, // 15
0x04, 2, ROLE_SCHEDULER, 20, // 16
0x04, 3, ROLE_WORKER, 19, // 17
0x04, 4, ROLE_WORKER, 19, // 18
0x04, 5, ROLE_SCHEDULER, 20, // 19
0x04, 6, ROLE_SCHEDULER, 29, // 20
0x14, 0, ROLE_WORKER, 23, // 21
0x14, 1, ROLE_WORKER, 23, // 22
0x14, 2, ROLE_SCHEDULER, 27, // 23
0x14, 3, ROLE_WORKER, 26, // 24
0x14, 4, ROLE_WORKER, 26, // 25
0x14, 5, ROLE_SCHEDULER, 27, // 26
0x14, 6, ROLE_SCHEDULER, 29, // 27
0x01, 0, ROLE_SCHEDULER, 30, // 28
0x01, 1, ROLE_SCHEDULER, 30, // 29
0x01, 2, ROLE_SCHEDULER, -1); // 30
// ======================================================================
case PR_CFG_33_MB_FLAT:
return pr_init(33,
0x04, 0, ROLE_WORKER, 32, // 0
0x04, 1, ROLE_WORKER, 32, // 1
0x04, 2, ROLE_WORKER, 32, // 2
0x04, 3, ROLE_WORKER, 32, // 3
0x04, 4, ROLE_WORKER, 32, // 4
0x04, 5, ROLE_WORKER, 32, // 5
0x04, 6, ROLE_WORKER, 32, // 6
0x04, 7, ROLE_WORKER, 32, // 7
0x10, 0, ROLE_WORKER, 32, // 8
0x10, 1, ROLE_WORKER, 32, // 9
0x10, 2, ROLE_WORKER, 32, // 10
0x10, 3, ROLE_WORKER, 32, // 11
0x10, 4, ROLE_WORKER, 32, // 12
0x10, 5, ROLE_WORKER, 32, // 13
0x10, 6, ROLE_WORKER, 32, // 14
0x10, 7, ROLE_WORKER, 32, // 15
0x18, 0, ROLE_WORKER, 32, // 16
0x18, 1, ROLE_WORKER, 32, // 17
0x18, 2, ROLE_WORKER, 32, // 18
0x18, 3, ROLE_WORKER, 32, // 19
0x18, 4, ROLE_WORKER, 32, // 20
0x18, 5, ROLE_WORKER, 32, // 21
0x18, 6, ROLE_WORKER, 32, // 22
0x18, 7, ROLE_WORKER, 32, // 23
0x24, 0, ROLE_WORKER, 32, // 24
0x24, 1, ROLE_WORKER, 32, // 25
0x24, 2, ROLE_WORKER, 32, // 26
0x24, 3, ROLE_WORKER, 32, // 27
0x24, 4, ROLE_WORKER, 32, // 28
0x24, 5, ROLE_WORKER, 32, // 29
0x24, 6, ROLE_WORKER, 32, // 30
0x24, 7, ROLE_WORKER, 32, // 31
0x14, 0, ROLE_SCHEDULER, -1); // 32
case PR_CFG_33_HET_FLAT:
return pr_init(33,
0x2B, 0, ROLE_WORKER, 32, // 0
0x2B, 1, ROLE_WORKER, 32, // 1
0x2B, 2, ROLE_WORKER, 32, // 2
0x2B, 3, ROLE_WORKER, 32, // 3
0x2B, 4, ROLE_WORKER, 32, // 4
0x2B, 5, ROLE_WORKER, 32, // 5
0x2B, 6, ROLE_WORKER, 32, // 6
0x2B, 7, ROLE_WORKER, 32, // 7
0x2F, 0, ROLE_WORKER, 32, // 8
0x2F, 1, ROLE_WORKER, 32, // 9
0x2F, 2, ROLE_WORKER, 32, // 10
0x2F, 3, ROLE_WORKER, 32, // 11
0x2F, 4, ROLE_WORKER, 32, // 12
0x2F, 5, ROLE_WORKER, 32, // 13
0x2F, 6, ROLE_WORKER, 32, // 14
0x2F, 7, ROLE_WORKER, 32, // 15
0x3B, 0, ROLE_WORKER, 32, // 16
0x3B, 1, ROLE_WORKER, 32, // 17
0x3B, 2, ROLE_WORKER, 32, // 18
0x3B, 3, ROLE_WORKER, 32, // 19
0x3B, 4, ROLE_WORKER, 32, // 20
0x3B, 5, ROLE_WORKER, 32, // 21
0x3B, 6, ROLE_WORKER, 32, // 22
0x3B, 7, ROLE_WORKER, 32, // 23
0x3F, 0, ROLE_WORKER, 32, // 24
0x3F, 1, ROLE_WORKER, 32, // 25
0x3F, 2, ROLE_WORKER, 32, // 26
0x3F, 3, ROLE_WORKER, 32, // 27
0x3F, 4, ROLE_WORKER, 32, // 28
0x3F, 5, ROLE_WORKER, 32, // 29
0x3F, 6, ROLE_WORKER, 32, // 30
0x3F, 7, ROLE_WORKER, 32, // 31
0x6B, 0, ROLE_SCHEDULER, -1); // 32
// ======================================================================
case PR_CFG_35_HET_HIER:
return pr_init(35,
0x2B, 0, ROLE_WORKER, 32, // 0
0x2B, 1, ROLE_WORKER, 32, // 1
0x2B, 2, ROLE_WORKER, 32, // 2
0x2B, 3, ROLE_WORKER, 32, // 3
0x2B, 4, ROLE_WORKER, 32, // 4
0x2B, 5, ROLE_WORKER, 32, // 5
0x2B, 6, ROLE_WORKER, 32, // 6
0x2B, 7, ROLE_WORKER, 32, // 7
0x2F, 0, ROLE_WORKER, 32, // 8
0x2F, 1, ROLE_WORKER, 32, // 9
0x2F, 2, ROLE_WORKER, 32, // 10
0x2F, 3, ROLE_WORKER, 32, // 11
0x2F, 4, ROLE_WORKER, 32, // 12
0x2F, 5, ROLE_WORKER, 32, // 13
0x2F, 6, ROLE_WORKER, 32, // 14
0x2F, 7, ROLE_WORKER, 32, // 15
0x3B, 0, ROLE_WORKER, 33, // 16
0x3B, 1, ROLE_WORKER, 33, // 17
0x3B, 2, ROLE_WORKER, 33, // 18
0x3B, 3, ROLE_WORKER, 33, // 19
0x3B, 4, ROLE_WORKER, 33, // 20
0x3B, 5, ROLE_WORKER, 33, // 21
0x3B, 6, ROLE_WORKER, 33, // 22
0x3B, 7, ROLE_WORKER, 33, // 23
0x3F, 0, ROLE_WORKER, 33, // 24
0x3F, 1, ROLE_WORKER, 33, // 25
0x3F, 2, ROLE_WORKER, 33, // 26
0x3F, 3, ROLE_WORKER, 33, // 27
0x3F, 4, ROLE_WORKER, 33, // 28
0x3F, 5, ROLE_WORKER, 33, // 29
0x3F, 6, ROLE_WORKER, 33, // 30
0x3F, 7, ROLE_WORKER, 33, // 31
0x6B, 0, ROLE_SCHEDULER, 34, // 32
0x6B, 1, ROLE_SCHEDULER, 34, // 33
0x6B, 2, ROLE_SCHEDULER, -1); // 34
// ======================================================================
case PR_CFG_37_MB_FLAT:
return pr_init(37,
0x04, 0, ROLE_WORKER, 36, // 0
0x04, 1, ROLE_WORKER, 36, // 1
0x04, 2, ROLE_WORKER, 36, // 2
0x04, 3, ROLE_WORKER, 36, // 3
0x04, 4, ROLE_WORKER, 36, // 4
0x04, 5, ROLE_WORKER, 36, // 5
0x04, 6, ROLE_WORKER, 36, // 6
0x04, 7, ROLE_WORKER, 36, // 7
0x10, 0, ROLE_WORKER, 36, // 8
0x10, 1, ROLE_WORKER, 36, // 9
0x10, 2, ROLE_WORKER, 36, // 10
0x10, 3, ROLE_WORKER, 36, // 11
0x10, 4, ROLE_WORKER, 36, // 12
0x10, 5, ROLE_WORKER, 36, // 13
0x10, 6, ROLE_WORKER, 36, // 14
0x10, 7, ROLE_WORKER, 36, // 15
0x18, 0, ROLE_WORKER, 36, // 16
0x18, 1, ROLE_WORKER, 36, // 17
0x18, 2, ROLE_WORKER, 36, // 18
0x18, 3, ROLE_WORKER, 36, // 19
0x18, 4, ROLE_WORKER, 36, // 20
0x18, 5, ROLE_WORKER, 36, // 21
0x18, 6, ROLE_WORKER, 36, // 22
0x18, 7, ROLE_WORKER, 36, // 23
0x24, 0, ROLE_WORKER, 36, // 24
0x24, 1, ROLE_WORKER, 36, // 25
0x24, 2, ROLE_WORKER, 36, // 26
0x24, 3, ROLE_WORKER, 36, // 27
0x24, 4, ROLE_WORKER, 36, // 28
0x24, 5, ROLE_WORKER, 36, // 29
0x24, 6, ROLE_WORKER, 36, // 30
0x24, 7, ROLE_WORKER, 36, // 31
0x15, 0, ROLE_WORKER, 36, // 32
0x15, 1, ROLE_WORKER, 36, // 33
0x15, 2, ROLE_WORKER, 36, // 34
0x15, 3, ROLE_WORKER, 36, // 35
0x14, 0, ROLE_SCHEDULER, -1); // 36
// ======================================================================
case PR_CFG_52_HET_HIER:
return pr_init(52,
0x1B, 0, ROLE_WORKER, 48, // 0
0x1B, 1, ROLE_WORKER, 48, // 1
0x1B, 2, ROLE_WORKER, 48, // 2
0x1B, 3, ROLE_WORKER, 48, // 3
0x1B, 4, ROLE_WORKER, 48, // 4
0x1B, 5, ROLE_WORKER, 48, // 5
0x1B, 6, ROLE_WORKER, 48, // 6
0x1B, 7, ROLE_WORKER, 48, // 7
0x1A, 0, ROLE_WORKER, 48, // 8
0x1A, 1, ROLE_WORKER, 48, // 9
0x1A, 2, ROLE_WORKER, 48, // 10
0x1A, 3, ROLE_WORKER, 48, // 11
0x1A, 4, ROLE_WORKER, 48, // 12
0x1A, 5, ROLE_WORKER, 48, // 13
0x1A, 6, ROLE_WORKER, 48, // 14
0x1A, 7, ROLE_WORKER, 48, // 15
0x2B, 0, ROLE_WORKER, 49, // 16
0x2B, 1, ROLE_WORKER, 49, // 17
0x2B, 2, ROLE_WORKER, 49, // 18
0x2B, 3, ROLE_WORKER, 49, // 19
0x2B, 4, ROLE_WORKER, 49, // 20
0x2B, 5, ROLE_WORKER, 49, // 21
0x2B, 6, ROLE_WORKER, 49, // 22
0x2B, 7, ROLE_WORKER, 49, // 23
0x2A, 0, ROLE_WORKER, 49, // 24
0x2A, 1, ROLE_WORKER, 49, // 25
0x2A, 2, ROLE_WORKER, 49, // 26
0x2A, 3, ROLE_WORKER, 49, // 27
0x2A, 4, ROLE_WORKER, 49, // 28
0x2A, 5, ROLE_WORKER, 49, // 29
0x2A, 6, ROLE_WORKER, 49, // 30
0x2A, 7, ROLE_WORKER, 49, // 31
0x3B, 0, ROLE_WORKER, 50, // 32
0x3B, 1, ROLE_WORKER, 50, // 33
0x3B, 2, ROLE_WORKER, 50, // 34
0x3B, 3, ROLE_WORKER, 50, // 35
0x3B, 4, ROLE_WORKER, 50, // 36
0x3B, 5, ROLE_WORKER, 50, // 37
0x3B, 6, ROLE_WORKER, 50, // 38
0x3B, 7, ROLE_WORKER, 50, // 39
0x3A, 0, ROLE_WORKER, 50, // 40
0x3A, 1, ROLE_WORKER, 50, // 41
0x3A, 2, ROLE_WORKER, 50, // 42
0x3A, 3, ROLE_WORKER, 50, // 43
0x3A, 4, ROLE_WORKER, 50, // 44
0x3A, 5, ROLE_WORKER, 50, // 45
0x3A, 6, ROLE_WORKER, 50, // 46
0x3A, 7, ROLE_WORKER, 50, // 47
0x6B, 0, ROLE_SCHEDULER, 51, // 48
0x6B, 1, ROLE_SCHEDULER, 51, // 49
0x6B, 2, ROLE_SCHEDULER, 51, // 50
0x6B, 3, ROLE_SCHEDULER, -1); // 51
// ======================================================================
case PR_CFG_65_HET_FLAT:
return pr_init(65,
0x0B, 0, ROLE_WORKER, 64, // 0
0x0B, 1, ROLE_WORKER, 64, // 1
0x0B, 2, ROLE_WORKER, 64, // 2
0x0B, 3, ROLE_WORKER, 64, // 3
0x0B, 4, ROLE_WORKER, 64, // 4
0x0B, 5, ROLE_WORKER, 64, // 5
0x0B, 6, ROLE_WORKER, 64, // 6
0x0B, 7, ROLE_WORKER, 64, // 7
0x0F, 0, ROLE_WORKER, 64, // 8
0x0F, 1, ROLE_WORKER, 64, // 9
0x0F, 2, ROLE_WORKER, 64, // 10
0x0F, 3, ROLE_WORKER, 64, // 11
0x0F, 4, ROLE_WORKER, 64, // 12
0x0F, 5, ROLE_WORKER, 64, // 13
0x0F, 6, ROLE_WORKER, 64, // 14
0x0F, 7, ROLE_WORKER, 64, // 15
0x1B, 0, ROLE_WORKER, 64, // 16
0x1B, 1, ROLE_WORKER, 64, // 17
0x1B, 2, ROLE_WORKER, 64, // 18
0x1B, 3, ROLE_WORKER, 64, // 19
0x1B, 4, ROLE_WORKER, 64, // 20
0x1B, 5, ROLE_WORKER, 64, // 21
0x1B, 6, ROLE_WORKER, 64, // 22
0x1B, 7, ROLE_WORKER, 64, // 23
0x1F, 0, ROLE_WORKER, 64, // 24
0x1F, 1, ROLE_WORKER, 64, // 25
0x1F, 2, ROLE_WORKER, 64, // 26
0x1F, 3, ROLE_WORKER, 64, // 27
0x1F, 4, ROLE_WORKER, 64, // 28
0x1F, 5, ROLE_WORKER, 64, // 29
0x1F, 6, ROLE_WORKER, 64, // 30
0x1F, 7, ROLE_WORKER, 64, // 31
0x0A, 0, ROLE_WORKER, 64, // 32
0x0A, 1, ROLE_WORKER, 64, // 33
0x0A, 2, ROLE_WORKER, 64, // 34
0x0A, 3, ROLE_WORKER, 64, // 35
0x0A, 4, ROLE_WORKER, 64, // 36
0x0A, 5, ROLE_WORKER, 64, // 37
0x0A, 6, ROLE_WORKER, 64, // 38
0x0A, 7, ROLE_WORKER, 64, // 39
0x0E, 0, ROLE_WORKER, 64, // 40
0x0E, 1, ROLE_WORKER, 64, // 41
0x0E, 2, ROLE_WORKER, 64, // 42
0x0E, 3, ROLE_WORKER, 64, // 43
0x0E, 4, ROLE_WORKER, 64, // 44
0x0E, 5, ROLE_WORKER, 64, // 45
0x0E, 6, ROLE_WORKER, 64, // 46
0x0E, 7, ROLE_WORKER, 64, // 47
0x1A, 0, ROLE_WORKER, 64, // 48
0x1A, 1, ROLE_WORKER, 64, // 49
0x1A, 2, ROLE_WORKER, 64, // 50
0x1A, 3, ROLE_WORKER, 64, // 51
0x1A, 4, ROLE_WORKER, 64, // 52
0x1A, 5, ROLE_WORKER, 64, // 53
0x1A, 6, ROLE_WORKER, 64, // 54
0x1A, 7, ROLE_WORKER, 64, // 55
0x1E, 0, ROLE_WORKER, 64, // 56
0x1E, 1, ROLE_WORKER, 64, // 57
0x1E, 2, ROLE_WORKER, 64, // 58
0x1E, 3, ROLE_WORKER, 64, // 59
0x1E, 4, ROLE_WORKER, 64, // 60
0x1E, 5, ROLE_WORKER, 64, // 61
0x1E, 6, ROLE_WORKER, 64, // 62
0x1E, 7, ROLE_WORKER, 64, // 63
0x6B, 0, ROLE_SCHEDULER, -1); // 64
// ======================================================================
case PR_CFG_69_HET_HIER:
return pr_init(69,
0x0B, 0, ROLE_WORKER, 64, // 0
0x0B, 1, ROLE_WORKER, 64, // 1
0x0B, 2, ROLE_WORKER, 64, // 2
0x0B, 3, ROLE_WORKER, 64, // 3
0x0B, 4, ROLE_WORKER, 64, // 4
0x0B, 5, ROLE_WORKER, 64, // 5
0x0B, 6, ROLE_WORKER, 64, // 6
0x0B, 7, ROLE_WORKER, 64, // 7
0x0F, 0, ROLE_WORKER, 64, // 8
0x0F, 1, ROLE_WORKER, 64, // 9
0x0F, 2, ROLE_WORKER, 64, // 10
0x0F, 3, ROLE_WORKER, 64, // 11
0x0F, 4, ROLE_WORKER, 64, // 12
0x0F, 5, ROLE_WORKER, 64, // 13
0x0F, 6, ROLE_WORKER, 64, // 14
0x0F, 7, ROLE_WORKER, 64, // 15
0x1B, 0, ROLE_WORKER, 65, // 16
0x1B, 1, ROLE_WORKER, 65, // 17
0x1B, 2, ROLE_WORKER, 65, // 18
0x1B, 3, ROLE_WORKER, 65, // 19
0x1B, 4, ROLE_WORKER, 65, // 20
0x1B, 5, ROLE_WORKER, 65, // 21
0x1B, 6, ROLE_WORKER, 65, // 22
0x1B, 7, ROLE_WORKER, 65, // 23
0x1F, 0, ROLE_WORKER, 65, // 24
0x1F, 1, ROLE_WORKER, 65, // 25
0x1F, 2, ROLE_WORKER, 65, // 26
0x1F, 3, ROLE_WORKER, 65, // 27
0x1F, 4, ROLE_WORKER, 65, // 28
0x1F, 5, ROLE_WORKER, 65, // 29
0x1F, 6, ROLE_WORKER, 65, // 30
0x1F, 7, ROLE_WORKER, 65, // 31
0x0A, 0, ROLE_WORKER, 66, // 32
0x0A, 1, ROLE_WORKER, 66, // 33
0x0A, 2, ROLE_WORKER, 66, // 34
0x0A, 3, ROLE_WORKER, 66, // 35
0x0A, 4, ROLE_WORKER, 66, // 36
0x0A, 5, ROLE_WORKER, 66, // 37
0x0A, 6, ROLE_WORKER, 66, // 38
0x0A, 7, ROLE_WORKER, 66, // 39
0x0E, 0, ROLE_WORKER, 66, // 40
0x0E, 1, ROLE_WORKER, 66, // 41
0x0E, 2, ROLE_WORKER, 66, // 42
0x0E, 3, ROLE_WORKER, 66, // 43
0x0E, 4, ROLE_WORKER, 66, // 44
0x0E, 5, ROLE_WORKER, 66, // 45
0x0E, 6, ROLE_WORKER, 66, // 46
0x0E, 7, ROLE_WORKER, 66, // 47
0x1A, 0, ROLE_WORKER, 67, // 48
0x1A, 1, ROLE_WORKER, 67, // 49
0x1A, 2, ROLE_WORKER, 67, // 50
0x1A, 3, ROLE_WORKER, 67, // 51
0x1A, 4, ROLE_WORKER, 67, // 52
0x1A, 5, ROLE_WORKER, 67, // 53
0x1A, 6, ROLE_WORKER, 67, // 54
0x1A, 7, ROLE_WORKER, 67, // 55
0x1E, 0, ROLE_WORKER, 67, // 56
0x1E, 1, ROLE_WORKER, 67, // 57
0x1E, 2, ROLE_WORKER, 67, // 58
0x1E, 3, ROLE_WORKER, 67, // 59
0x1E, 4, ROLE_WORKER, 67, // 60
0x1E, 5, ROLE_WORKER, 67, // 61
0x1E, 6, ROLE_WORKER, 67, // 62
0x1E, 7, ROLE_WORKER, 67, // 63
0x4B, 0, ROLE_SCHEDULER, 68, // 64
0x4B, 1, ROLE_SCHEDULER, 68, // 65
0x4B, 2, ROLE_SCHEDULER, 68, // 66
0x4B, 3, ROLE_SCHEDULER, 68, // 67
0x6B, 0, ROLE_SCHEDULER, -1); // 68
// ======================================================================
case PR_CFG_120_HET_HIER:
return pr_init(120,
0x0B, 0, ROLE_WORKER, 112, // 0
0x0B, 1, ROLE_WORKER, 112, // 1
0x0B, 2, ROLE_WORKER, 112, // 2
0x0B, 3, ROLE_WORKER, 112, // 3
0x0B, 4, ROLE_WORKER, 112, // 4
0x0B, 5, ROLE_WORKER, 112, // 5
0x0B, 6, ROLE_WORKER, 112, // 6
0x0B, 7, ROLE_WORKER, 112, // 7
0x0A, 0, ROLE_WORKER, 112, // 8
0x0A, 1, ROLE_WORKER, 112, // 9
0x0A, 2, ROLE_WORKER, 112, // 10
0x0A, 3, ROLE_WORKER, 112, // 11
0x0A, 4, ROLE_WORKER, 112, // 12
0x0A, 5, ROLE_WORKER, 112, // 13
0x0A, 6, ROLE_WORKER, 112, // 14
0x0A, 7, ROLE_WORKER, 112, // 15
0x0F, 0, ROLE_WORKER, 113, // 16
0x0F, 1, ROLE_WORKER, 113, // 17
0x0F, 2, ROLE_WORKER, 113, // 18
0x0F, 3, ROLE_WORKER, 113, // 19
0x0F, 4, ROLE_WORKER, 113, // 20
0x0F, 5, ROLE_WORKER, 113, // 21
0x0F, 6, ROLE_WORKER, 113, // 22
0x0F, 7, ROLE_WORKER, 113, // 23
0x0E, 0, ROLE_WORKER, 113, // 24
0x0E, 1, ROLE_WORKER, 113, // 25
0x0E, 2, ROLE_WORKER, 113, // 26
0x0E, 3, ROLE_WORKER, 113, // 27
0x0E, 4, ROLE_WORKER, 113, // 28
0x0E, 5, ROLE_WORKER, 113, // 29
0x0E, 6, ROLE_WORKER, 113, // 30
0x0E, 7, ROLE_WORKER, 113, // 31
0x1B, 0, ROLE_WORKER, 114, // 32
0x1B, 1, ROLE_WORKER, 114, // 33
0x1B, 2, ROLE_WORKER, 114, // 34
0x1B, 3, ROLE_WORKER, 114, // 35
0x1B, 4, ROLE_WORKER, 114, // 36
0x1B, 5, ROLE_WORKER, 114, // 37
0x1B, 6, ROLE_WORKER, 114, // 38
0x1B, 7, ROLE_WORKER, 114, // 39
0x1A, 0, ROLE_WORKER, 114, // 40
0x1A, 1, ROLE_WORKER, 114, // 41
0x1A, 2, ROLE_WORKER, 114, // 42
0x1A, 3, ROLE_WORKER, 114, // 43
0x1A, 4, ROLE_WORKER, 114, // 44
0x1A, 5, ROLE_WORKER, 114, // 45
0x1A, 6, ROLE_WORKER, 114, // 46
0x1A, 7, ROLE_WORKER, 114, // 47
0x1F, 0, ROLE_WORKER, 115, // 48
0x1F, 1, ROLE_WORKER, 115, // 49
0x1F, 2, ROLE_WORKER, 115, // 50
0x1F, 3, ROLE_WORKER, 115, // 51
0x1F, 4, ROLE_WORKER, 115, // 52
0x1F, 5, ROLE_WORKER, 115, // 53
0x1F, 6, ROLE_WORKER, 115, // 54
0x1F, 7, ROLE_WORKER, 115, // 55
0x1E, 0, ROLE_WORKER, 115, // 56
0x1E, 1, ROLE_WORKER, 115, // 57
0x1E, 2, ROLE_WORKER, 115, // 58
0x1E, 3, ROLE_WORKER, 115, // 59
0x1E, 4, ROLE_WORKER, 115, // 60
0x1E, 5, ROLE_WORKER, 115, // 61
0x1E, 6, ROLE_WORKER, 115, // 62
0x1E, 7, ROLE_WORKER, 115, // 63
0x2B, 0, ROLE_WORKER, 116, // 64
0x2B, 1, ROLE_WORKER, 116, // 65
0x2B, 2, ROLE_WORKER, 116, // 66
0x2B, 3, ROLE_WORKER, 116, // 67
0x2B, 4, ROLE_WORKER, 116, // 68
0x2B, 5, ROLE_WORKER, 116, // 69
0x2B, 6, ROLE_WORKER, 116, // 70
0x2B, 7, ROLE_WORKER, 116, // 71
0x2A, 0, ROLE_WORKER, 116, // 72
0x2A, 1, ROLE_WORKER, 116, // 73
0x2A, 2, ROLE_WORKER, 116, // 74
0x2A, 3, ROLE_WORKER, 116, // 75
0x2A, 4, ROLE_WORKER, 116, // 76
0x2A, 5, ROLE_WORKER, 116, // 77
0x2A, 6, ROLE_WORKER, 116, // 78
0x2A, 7, ROLE_WORKER, 116, // 79
0x2F, 0, ROLE_WORKER, 117, // 80
0x2F, 1, ROLE_WORKER, 117, // 81
0x2F, 2, ROLE_WORKER, 117, // 82
0x2F, 3, ROLE_WORKER, 117, // 83
0x2F, 4, ROLE_WORKER, 117, // 84
0x2F, 5, ROLE_WORKER, 117, // 85
0x2F, 6, ROLE_WORKER, 117, // 86
0x2F, 7, ROLE_WORKER, 117, // 87
0x2E, 0, ROLE_WORKER, 117, // 88
0x2E, 1, ROLE_WORKER, 117, // 89
0x2E, 2, ROLE_WORKER, 117, // 90
0x2E, 3, ROLE_WORKER, 117, // 91
0x2E, 4, ROLE_WORKER, 117, // 92
0x2E, 5, ROLE_WORKER, 117, // 93
0x2E, 6, ROLE_WORKER, 117, // 94
0x2E, 7, ROLE_WORKER, 117, // 95
0x3B, 0, ROLE_WORKER, 118, // 96
0x3B, 1, ROLE_WORKER, 118, // 97
0x3B, 2, ROLE_WORKER, 118, // 98
0x3B, 3, ROLE_WORKER, 118, // 99
0x3B, 4, ROLE_WORKER, 118, // 100
0x3B, 5, ROLE_WORKER, 118, // 101
0x3B, 6, ROLE_WORKER, 118, // 102
0x3B, 7, ROLE_WORKER, 118, // 103
0x3A, 0, ROLE_WORKER, 118, // 104
0x3A, 1, ROLE_WORKER, 118, // 105
0x3A, 2, ROLE_WORKER, 118, // 106
0x3A, 3, ROLE_WORKER, 118, // 107
0x3A, 4, ROLE_WORKER, 118, // 108
0x3A, 5, ROLE_WORKER, 118, // 109
0x3A, 6, ROLE_WORKER, 118, // 110
0x3A, 7, ROLE_WORKER, 118, // 111
0x4B, 0, ROLE_SCHEDULER, 119, // 112
0x4B, 1, ROLE_SCHEDULER, 119, // 113
0x4B, 2, ROLE_SCHEDULER, 119, // 114
0x4B, 3, ROLE_SCHEDULER, 119, // 115
0x6B, 0, ROLE_SCHEDULER, 119, // 116
0x6B, 1, ROLE_SCHEDULER, 119, // 117
0x6B, 2, ROLE_SCHEDULER, 119, // 118
0x6B, 3, ROLE_SCHEDULER, -1); // 119
// ======================================================================
case PR_CFG_129_HET_FLAT:
return pr_init(129,
0x0B, 0, ROLE_WORKER, 128, // 0
0x0B, 1, ROLE_WORKER, 128, // 1
0x0B, 2, ROLE_WORKER, 128, // 2
0x0B, 3, ROLE_WORKER, 128, // 3
0x0B, 4, ROLE_WORKER, 128, // 4
0x0B, 5, ROLE_WORKER, 128, // 5
0x0B, 6, ROLE_WORKER, 128, // 6
0x0B, 7, ROLE_WORKER, 128, // 7
0x0A, 0, ROLE_WORKER, 128, // 8
0x0A, 1, ROLE_WORKER, 128, // 9
0x0A, 2, ROLE_WORKER, 128, // 10
0x0A, 3, ROLE_WORKER, 128, // 11
0x0A, 4, ROLE_WORKER, 128, // 12
0x0A, 5, ROLE_WORKER, 128, // 13
0x0A, 6, ROLE_WORKER, 128, // 14
0x0A, 7, ROLE_WORKER, 128, // 15
0x09, 0, ROLE_WORKER, 128, // 16
0x09, 1, ROLE_WORKER, 128, // 17
0x0F, 0, ROLE_WORKER, 128, // 18
0x0F, 1, ROLE_WORKER, 128, // 19
0x0F, 2, ROLE_WORKER, 128, // 20
0x0F, 3, ROLE_WORKER, 128, // 21
0x0F, 4, ROLE_WORKER, 128, // 22
0x0F, 5, ROLE_WORKER, 128, // 23
0x0F, 6, ROLE_WORKER, 128, // 24
0x0F, 7, ROLE_WORKER, 128, // 25
0x0E, 0, ROLE_WORKER, 128, // 26
0x0E, 1, ROLE_WORKER, 128, // 27
0x0E, 2, ROLE_WORKER, 128, // 28
0x0E, 3, ROLE_WORKER, 128, // 29
0x0E, 4, ROLE_WORKER, 128, // 30
0x0E, 5, ROLE_WORKER, 128, // 31
0x0E, 6, ROLE_WORKER, 128, // 32
0x0E, 7, ROLE_WORKER, 128, // 33
0x0D, 0, ROLE_WORKER, 128, // 34
0x0D, 1, ROLE_WORKER, 128, // 35
0x1B, 0, ROLE_WORKER, 128, // 36
0x1B, 1, ROLE_WORKER, 128, // 37
0x1B, 2, ROLE_WORKER, 128, // 38
0x1B, 3, ROLE_WORKER, 128, // 39
0x1B, 4, ROLE_WORKER, 128, // 40
0x1B, 5, ROLE_WORKER, 128, // 41
0x1B, 6, ROLE_WORKER, 128, // 42
0x1B, 7, ROLE_WORKER, 128, // 43
0x1A, 0, ROLE_WORKER, 128, // 44
0x1A, 1, ROLE_WORKER, 128, // 45
0x1A, 2, ROLE_WORKER, 128, // 46
0x1A, 3, ROLE_WORKER, 128, // 47
0x1A, 4, ROLE_WORKER, 128, // 48
0x1A, 5, ROLE_WORKER, 128, // 49
0x1A, 6, ROLE_WORKER, 128, // 50
0x1A, 7, ROLE_WORKER, 128, // 51
0x19, 0, ROLE_WORKER, 128, // 52
0x19, 1, ROLE_WORKER, 128, // 53
0x1F, 0, ROLE_WORKER, 128, // 54
0x1F, 1, ROLE_WORKER, 128, // 55
0x1F, 2, ROLE_WORKER, 128, // 56
0x1F, 3, ROLE_WORKER, 128, // 57
0x1F, 4, ROLE_WORKER, 128, // 58
0x1F, 5, ROLE_WORKER, 128, // 59
0x1F, 6, ROLE_WORKER, 128, // 60
0x1F, 7, ROLE_WORKER, 128, // 61
0x1E, 0, ROLE_WORKER, 128, // 62
0x1E, 1, ROLE_WORKER, 128, // 63
0x1E, 2, ROLE_WORKER, 128, // 64
0x1E, 3, ROLE_WORKER, 128, // 65
0x1E, 4, ROLE_WORKER, 128, // 66
0x1E, 5, ROLE_WORKER, 128, // 67
0x1E, 6, ROLE_WORKER, 128, // 68
0x1E, 7, ROLE_WORKER, 128, // 69
0x1D, 0, ROLE_WORKER, 128, // 70
0x1D, 1, ROLE_WORKER, 128, // 71
0x2B, 0, ROLE_WORKER, 128, // 72
0x2B, 1, ROLE_WORKER, 128, // 73
0x2B, 2, ROLE_WORKER, 128, // 74
0x2B, 3, ROLE_WORKER, 128, // 75
0x2B, 4, ROLE_WORKER, 128, // 76
0x2B, 5, ROLE_WORKER, 128, // 77
0x2B, 6, ROLE_WORKER, 128, // 78
0x2B, 7, ROLE_WORKER, 128, // 79
0x2A, 0, ROLE_WORKER, 128, // 80
0x2A, 1, ROLE_WORKER, 128, // 81
0x2A, 2, ROLE_WORKER, 128, // 82
0x2A, 3, ROLE_WORKER, 128, // 83
0x2A, 4, ROLE_WORKER, 128, // 84
0x2A, 5, ROLE_WORKER, 128, // 85
0x2A, 6, ROLE_WORKER, 128, // 86
0x2A, 7, ROLE_WORKER, 128, // 87
0x29, 0, ROLE_WORKER, 128, // 88
0x29, 1, ROLE_WORKER, 128, // 89
0x2F, 0, ROLE_WORKER, 128, // 90
0x2F, 1, ROLE_WORKER, 128, // 91
0x2F, 2, ROLE_WORKER, 128, // 92
0x2F, 3, ROLE_WORKER, 128, // 93
0x2F, 4, ROLE_WORKER, 128, // 94
0x2F, 5, ROLE_WORKER, 128, // 95
0x2F, 6, ROLE_WORKER, 128, // 96
0x2F, 7, ROLE_WORKER, 128, // 97
0x2E, 0, ROLE_WORKER, 128, // 98
0x2E, 1, ROLE_WORKER, 128, // 99
0x2E, 2, ROLE_WORKER, 128, // 100
0x2E, 3, ROLE_WORKER, 128, // 101
0x2E, 4, ROLE_WORKER, 128, // 102
0x2E, 5, ROLE_WORKER, 128, // 103
0x2E, 6, ROLE_WORKER, 128, // 104
0x2E, 7, ROLE_WORKER, 128, // 105
0x2D, 0, ROLE_WORKER, 128, // 106
0x2D, 1, ROLE_WORKER, 128, // 107
0x2D, 2, ROLE_WORKER, 128, // 108
0x3B, 0, ROLE_WORKER, 128, // 109
0x3B, 1, ROLE_WORKER, 128, // 110
0x3B, 2, ROLE_WORKER, 128, // 111
0x3B, 3, ROLE_WORKER, 128, // 112
0x3B, 4, ROLE_WORKER, 128, // 113
0x3B, 5, ROLE_WORKER, 128, // 114
0x3B, 6, ROLE_WORKER, 128, // 115
0x3B, 7, ROLE_WORKER, 128, // 116
0x3A, 0, ROLE_WORKER, 128, // 117
0x3A, 1, ROLE_WORKER, 128, // 118
0x3A, 2, ROLE_WORKER, 128, // 119
0x3A, 3, ROLE_WORKER, 128, // 120
0x3A, 4, ROLE_WORKER, 128, // 121
0x3A, 5, ROLE_WORKER, 128, // 122
0x3A, 6, ROLE_WORKER, 128, // 123
0x3A, 7, ROLE_WORKER, 128, // 124
0x39, 0, ROLE_WORKER, 128, // 125
0x39, 1, ROLE_WORKER, 128, // 126
0x39, 2, ROLE_WORKER, 128, // 127
0x6B, 0, ROLE_SCHEDULER, -1); // 128
// ======================================================================
case PR_CFG_136_HET_HIER:
return pr_init(136,
0x0B, 0, ROLE_WORKER, 128, // 0
0x0B, 1, ROLE_WORKER, 128, // 1
0x0B, 2, ROLE_WORKER, 128, // 2
0x0B, 3, ROLE_WORKER, 128, // 3
0x0B, 4, ROLE_WORKER, 128, // 4
0x0B, 5, ROLE_WORKER, 128, // 5
0x0B, 6, ROLE_WORKER, 128, // 6
0x0B, 7, ROLE_WORKER, 128, // 7
0x0A, 0, ROLE_WORKER, 128, // 8
0x0A, 1, ROLE_WORKER, 128, // 9
0x0A, 2, ROLE_WORKER, 128, // 10
0x0A, 3, ROLE_WORKER, 128, // 11
0x0A, 4, ROLE_WORKER, 128, // 12
0x0A, 5, ROLE_WORKER, 128, // 13
0x0A, 6, ROLE_WORKER, 128, // 14
0x0A, 7, ROLE_WORKER, 128, // 15
0x09, 0, ROLE_WORKER, 128, // 16
0x09, 1, ROLE_WORKER, 128, // 17
0x0F, 0, ROLE_WORKER, 129, // 18
0x0F, 1, ROLE_WORKER, 129, // 19
0x0F, 2, ROLE_WORKER, 129, // 20
0x0F, 3, ROLE_WORKER, 129, // 21
0x0F, 4, ROLE_WORKER, 129, // 22
0x0F, 5, ROLE_WORKER, 129, // 23
0x0F, 6, ROLE_WORKER, 129, // 24
0x0F, 7, ROLE_WORKER, 129, // 25
0x0E, 0, ROLE_WORKER, 129, // 26
0x0E, 1, ROLE_WORKER, 129, // 27
0x0E, 2, ROLE_WORKER, 129, // 28
0x0E, 3, ROLE_WORKER, 129, // 29
0x0E, 4, ROLE_WORKER, 129, // 30
0x0E, 5, ROLE_WORKER, 129, // 31
0x0E, 6, ROLE_WORKER, 129, // 32
0x0E, 7, ROLE_WORKER, 129, // 33
0x0D, 0, ROLE_WORKER, 129, // 34
0x0D, 1, ROLE_WORKER, 129, // 35
0x1B, 0, ROLE_WORKER, 130, // 36
0x1B, 1, ROLE_WORKER, 130, // 37
0x1B, 2, ROLE_WORKER, 130, // 38
0x1B, 3, ROLE_WORKER, 130, // 39
0x1B, 4, ROLE_WORKER, 130, // 40
0x1B, 5, ROLE_WORKER, 130, // 41
0x1B, 6, ROLE_WORKER, 130, // 42
0x1B, 7, ROLE_WORKER, 130, // 43
0x1A, 0, ROLE_WORKER, 130, // 44
0x1A, 1, ROLE_WORKER, 130, // 45
0x1A, 2, ROLE_WORKER, 130, // 46
0x1A, 3, ROLE_WORKER, 130, // 47
0x1A, 4, ROLE_WORKER, 130, // 48
0x1A, 5, ROLE_WORKER, 130, // 49
0x1A, 6, ROLE_WORKER, 130, // 50
0x1A, 7, ROLE_WORKER, 130, // 51
0x19, 0, ROLE_WORKER, 130, // 52
0x19, 1, ROLE_WORKER, 130, // 53
0x1F, 0, ROLE_WORKER, 131, // 54
0x1F, 1, ROLE_WORKER, 131, // 55
0x1F, 2, ROLE_WORKER, 131, // 56
0x1F, 3, ROLE_WORKER, 131, // 57
0x1F, 4, ROLE_WORKER, 131, // 58
0x1F, 5, ROLE_WORKER, 131, // 59
0x1F, 6, ROLE_WORKER, 131, // 60
0x1F, 7, ROLE_WORKER, 131, // 61
0x1E, 0, ROLE_WORKER, 131, // 62
0x1E, 1, ROLE_WORKER, 131, // 63
0x1E, 2, ROLE_WORKER, 131, // 64
0x1E, 3, ROLE_WORKER, 131, // 65
0x1E, 4, ROLE_WORKER, 131, // 66
0x1E, 5, ROLE_WORKER, 131, // 67
0x1E, 6, ROLE_WORKER, 131, // 68
0x1E, 7, ROLE_WORKER, 131, // 69
0x1D, 0, ROLE_WORKER, 131, // 70
0x1D, 1, ROLE_WORKER, 131, // 71
0x2B, 0, ROLE_WORKER, 132, // 72
0x2B, 1, ROLE_WORKER, 132, // 73
0x2B, 2, ROLE_WORKER, 132, // 74
0x2B, 3, ROLE_WORKER, 132, // 75
0x2B, 4, ROLE_WORKER, 132, // 76
0x2B, 5, ROLE_WORKER, 132, // 77
0x2B, 6, ROLE_WORKER, 132, // 78
0x2B, 7, ROLE_WORKER, 132, // 79
0x2A, 0, ROLE_WORKER, 132, // 80
0x2A, 1, ROLE_WORKER, 132, // 81
0x2A, 2, ROLE_WORKER, 132, // 82
0x2A, 3, ROLE_WORKER, 132, // 83
0x2A, 4, ROLE_WORKER, 132, // 84
0x2A, 5, ROLE_WORKER, 132, // 85
0x2A, 6, ROLE_WORKER, 132, // 86
0x2A, 7, ROLE_WORKER, 132, // 87
0x29, 0, ROLE_WORKER, 132, // 88
0x29, 1, ROLE_WORKER, 132, // 89
0x2F, 0, ROLE_WORKER, 133, // 90
0x2F, 1, ROLE_WORKER, 133, // 91
0x2F, 2, ROLE_WORKER, 133, // 92
0x2F, 3, ROLE_WORKER, 133, // 93
0x2F, 4, ROLE_WORKER, 133, // 94
0x2F, 5, ROLE_WORKER, 133, // 95
0x2F, 6, ROLE_WORKER, 133, // 96
0x2F, 7, ROLE_WORKER, 133, // 97
0x2E, 0, ROLE_WORKER, 133, // 98
0x2E, 1, ROLE_WORKER, 133, // 99
0x2E, 2, ROLE_WORKER, 133, // 100
0x2E, 3, ROLE_WORKER, 133, // 101
0x2E, 4, ROLE_WORKER, 133, // 102
0x2E, 5, ROLE_WORKER, 133, // 103
0x2E, 6, ROLE_WORKER, 133, // 104
0x2E, 7, ROLE_WORKER, 133, // 105
0x2D, 0, ROLE_WORKER, 133, // 106
0x2D, 1, ROLE_WORKER, 133, // 107
0x2D, 2, ROLE_WORKER, 133, // 108
0x3B, 0, ROLE_WORKER, 134, // 109
0x3B, 1, ROLE_WORKER, 134, // 110
0x3B, 2, ROLE_WORKER, 134, // 111
0x3B, 3, ROLE_WORKER, 134, // 112
0x3B, 4, ROLE_WORKER, 134, // 113
0x3B, 5, ROLE_WORKER, 134, // 114
0x3B, 6, ROLE_WORKER, 134, // 115
0x3B, 7, ROLE_WORKER, 134, // 116
0x3A, 0, ROLE_WORKER, 134, // 117
0x3A, 1, ROLE_WORKER, 134, // 118
0x3A, 2, ROLE_WORKER, 134, // 119
0x3A, 3, ROLE_WORKER, 134, // 120
0x3A, 4, ROLE_WORKER, 134, // 121
0x3A, 5, ROLE_WORKER, 134, // 122
0x3A, 6, ROLE_WORKER, 134, // 123
0x3A, 7, ROLE_WORKER, 134, // 124
0x39, 0, ROLE_WORKER, 134, // 125
0x39, 1, ROLE_WORKER, 134, // 126
0x39, 2, ROLE_WORKER, 134, // 127
0x4B, 0, ROLE_SCHEDULER, 135, // 128
0x4B, 1, ROLE_SCHEDULER, 135, // 129
0x4B, 2, ROLE_SCHEDULER, 135, // 130
0x4B, 3, ROLE_SCHEDULER, 135, // 131
0x6B, 0, ROLE_SCHEDULER, 135, // 132
0x6B, 1, ROLE_SCHEDULER, 135, // 133
0x6B, 2, ROLE_SCHEDULER, 135, // 134
0x6B, 3, ROLE_SCHEDULER, -1); // 135
// ======================================================================
case PR_CFG_232_HET_HIER:
return pr_init(232,
0x0B, 0, ROLE_WORKER, 224, // 0
0x0B, 1, ROLE_WORKER, 224, // 1
0x0B, 2, ROLE_WORKER, 224, // 2
0x0B, 3, ROLE_WORKER, 224, // 3
0x0B, 4, ROLE_WORKER, 224, // 4
0x0B, 5, ROLE_WORKER, 224, // 5
0x0B, 6, ROLE_WORKER, 224, // 6
0x0B, 7, ROLE_WORKER, 224, // 7
0x0A, 0, ROLE_WORKER, 224, // 8
0x0A, 1, ROLE_WORKER, 224, // 9
0x0A, 2, ROLE_WORKER, 224, // 10
0x0A, 3, ROLE_WORKER, 224, // 11
0x0A, 4, ROLE_WORKER, 224, // 12
0x0A, 5, ROLE_WORKER, 224, // 13
0x0A, 6, ROLE_WORKER, 224, // 14
0x0A, 7, ROLE_WORKER, 224, // 15
0x09, 0, ROLE_WORKER, 224, // 16
0x09, 1, ROLE_WORKER, 224, // 17
0x09, 2, ROLE_WORKER, 224, // 18
0x09, 3, ROLE_WORKER, 224, // 19
0x09, 4, ROLE_WORKER, 224, // 20
0x09, 5, ROLE_WORKER, 224, // 21
0x09, 6, ROLE_WORKER, 224, // 22
0x09, 7, ROLE_WORKER, 224, // 23
0x08, 0, ROLE_WORKER, 224, // 24
0x08, 1, ROLE_WORKER, 224, // 25
0x08, 2, ROLE_WORKER, 224, // 26
0x08, 3, ROLE_WORKER, 224, // 27
0x08, 4, ROLE_WORKER, 224, // 28
0x08, 5, ROLE_WORKER, 224, // 29
0x08, 6, ROLE_WORKER, 224, // 30
0x08, 7, ROLE_WORKER, 224, // 31
0x0F, 0, ROLE_WORKER, 225, // 32
0x0F, 1, ROLE_WORKER, 225, // 33
0x0F, 2, ROLE_WORKER, 225, // 34
0x0F, 3, ROLE_WORKER, 225, // 35
0x0F, 4, ROLE_WORKER, 225, // 36
0x0F, 5, ROLE_WORKER, 225, // 37
0x0F, 6, ROLE_WORKER, 225, // 38
0x0F, 7, ROLE_WORKER, 225, // 39
0x0E, 0, ROLE_WORKER, 225, // 40
0x0E, 1, ROLE_WORKER, 225, // 41
0x0E, 2, ROLE_WORKER, 225, // 42
0x0E, 3, ROLE_WORKER, 225, // 43
0x0E, 4, ROLE_WORKER, 225, // 44
0x0E, 5, ROLE_WORKER, 225, // 45
0x0E, 6, ROLE_WORKER, 225, // 46
0x0E, 7, ROLE_WORKER, 225, // 47
0x0D, 0, ROLE_WORKER, 225, // 48
0x0D, 1, ROLE_WORKER, 225, // 49
0x0D, 2, ROLE_WORKER, 225, // 50
0x0D, 3, ROLE_WORKER, 225, // 51
0x0D, 4, ROLE_WORKER, 225, // 52
0x0D, 5, ROLE_WORKER, 225, // 53
0x0D, 6, ROLE_WORKER, 225, // 54
0x0D, 7, ROLE_WORKER, 225, // 55
0x0C, 0, ROLE_WORKER, 225, // 56
0x0C, 1, ROLE_WORKER, 225, // 57
0x0C, 2, ROLE_WORKER, 225, // 58
0x0C, 3, ROLE_WORKER, 225, // 59
0x0C, 4, ROLE_WORKER, 225, // 60
0x0C, 5, ROLE_WORKER, 225, // 61
0x0C, 6, ROLE_WORKER, 225, // 62
0x0C, 7, ROLE_WORKER, 225, // 63
0x1B, 0, ROLE_WORKER, 226, // 64
0x1B, 1, ROLE_WORKER, 226, // 65
0x1B, 2, ROLE_WORKER, 226, // 66
0x1B, 3, ROLE_WORKER, 226, // 67
0x1B, 4, ROLE_WORKER, 226, // 68
0x1B, 5, ROLE_WORKER, 226, // 69
0x1B, 6, ROLE_WORKER, 226, // 70
0x1B, 7, ROLE_WORKER, 226, // 71
0x1A, 0, ROLE_WORKER, 226, // 72
0x1A, 1, ROLE_WORKER, 226, // 73
0x1A, 2, ROLE_WORKER, 226, // 74
0x1A, 3, ROLE_WORKER, 226, // 75
0x1A, 4, ROLE_WORKER, 226, // 76
0x1A, 5, ROLE_WORKER, 226, // 77
0x1A, 6, ROLE_WORKER, 226, // 78
0x1A, 7, ROLE_WORKER, 226, // 79
0x19, 0, ROLE_WORKER, 226, // 80
0x19, 1, ROLE_WORKER, 226, // 81
0x19, 2, ROLE_WORKER, 226, // 82
0x19, 3, ROLE_WORKER, 226, // 83
0x19, 4, ROLE_WORKER, 226, // 84
0x19, 5, ROLE_WORKER, 226, // 85
0x19, 6, ROLE_WORKER, 226, // 86
0x19, 7, ROLE_WORKER, 226, // 87
0x18, 0, ROLE_WORKER, 226, // 88
0x18, 1, ROLE_WORKER, 226, // 89
0x18, 2, ROLE_WORKER, 226, // 90
0x18, 3, ROLE_WORKER, 226, // 91
0x18, 4, ROLE_WORKER, 226, // 92
0x18, 5, ROLE_WORKER, 226, // 93
0x18, 6, ROLE_WORKER, 226, // 94
0x18, 7, ROLE_WORKER, 226, // 95
0x1F, 0, ROLE_WORKER, 227, // 96
0x1F, 1, ROLE_WORKER, 227, // 97
0x1F, 2, ROLE_WORKER, 227, // 98
0x1F, 3, ROLE_WORKER, 227, // 99
0x1F, 4, ROLE_WORKER, 227, // 100
0x1F, 5, ROLE_WORKER, 227, // 101
0x1F, 6, ROLE_WORKER, 227, // 102
0x1F, 7, ROLE_WORKER, 227, // 103
0x1E, 0, ROLE_WORKER, 227, // 104
0x1E, 1, ROLE_WORKER, 227, // 105
0x1E, 2, ROLE_WORKER, 227, // 106
0x1E, 3, ROLE_WORKER, 227, // 107
0x1E, 4, ROLE_WORKER, 227, // 108
0x1E, 5, ROLE_WORKER, 227, // 109
0x1E, 6, ROLE_WORKER, 227, // 110
0x1E, 7, ROLE_WORKER, 227, // 111
0x1D, 0, ROLE_WORKER, 227, // 112
0x1D, 1, ROLE_WORKER, 227, // 113
0x1D, 2, ROLE_WORKER, 227, // 114
0x1D, 3, ROLE_WORKER, 227, // 115
0x1D, 4, ROLE_WORKER, 227, // 116
0x1D, 5, ROLE_WORKER, 227, // 117
0x1D, 6, ROLE_WORKER, 227, // 118
0x1D, 7, ROLE_WORKER, 227, // 119
0x1C, 0, ROLE_WORKER, 227, // 120
0x1C, 1, ROLE_WORKER, 227, // 121
0x1C, 2, ROLE_WORKER, 227, // 122
0x1C, 3, ROLE_WORKER, 227, // 123
0x1C, 4, ROLE_WORKER, 227, // 124
0x1C, 5, ROLE_WORKER, 227, // 125
0x1C, 6, ROLE_WORKER, 227, // 126
0x1C, 7, ROLE_WORKER, 227, // 127
0x2B, 0, ROLE_WORKER, 228, // 128
0x2B, 1, ROLE_WORKER, 228, // 129
0x2B, 2, ROLE_WORKER, 228, // 130
0x2B, 3, ROLE_WORKER, 228, // 131
0x2B, 4, ROLE_WORKER, 228, // 132
0x2B, 5, ROLE_WORKER, 228, // 133
0x2B, 6, ROLE_WORKER, 228, // 134
0x2B, 7, ROLE_WORKER, 228, // 135
0x2A, 0, ROLE_WORKER, 228, // 136
0x2A, 1, ROLE_WORKER, 228, // 137
0x2A, 2, ROLE_WORKER, 228, // 138
0x2A, 3, ROLE_WORKER, 228, // 139
0x2A, 4, ROLE_WORKER, 228, // 140
0x2A, 5, ROLE_WORKER, 228, // 141
0x2A, 6, ROLE_WORKER, 228, // 142
0x2A, 7, ROLE_WORKER, 228, // 143
0x29, 0, ROLE_WORKER, 228, // 144
0x29, 1, ROLE_WORKER, 228, // 145
0x29, 2, ROLE_WORKER, 228, // 146
0x29, 3, ROLE_WORKER, 228, // 147
0x29, 4, ROLE_WORKER, 228, // 148
0x29, 5, ROLE_WORKER, 228, // 149
0x29, 6, ROLE_WORKER, 228, // 150
0x29, 7, ROLE_WORKER, 228, // 151
0x28, 0, ROLE_WORKER, 228, // 152
0x28, 1, ROLE_WORKER, 228, // 153
0x28, 2, ROLE_WORKER, 228, // 154
0x28, 3, ROLE_WORKER, 228, // 155
0x28, 4, ROLE_WORKER, 228, // 156
0x28, 5, ROLE_WORKER, 228, // 157
0x28, 6, ROLE_WORKER, 228, // 158
0x28, 7, ROLE_WORKER, 228, // 159
0x2F, 0, ROLE_WORKER, 229, // 160
0x2F, 1, ROLE_WORKER, 229, // 161
0x2F, 2, ROLE_WORKER, 229, // 162
0x2F, 3, ROLE_WORKER, 229, // 163
0x2F, 4, ROLE_WORKER, 229, // 164
0x2F, 5, ROLE_WORKER, 229, // 165
0x2F, 6, ROLE_WORKER, 229, // 166
0x2F, 7, ROLE_WORKER, 229, // 167
0x2E, 0, ROLE_WORKER, 229, // 168
0x2E, 1, ROLE_WORKER, 229, // 169
0x2E, 2, ROLE_WORKER, 229, // 170
0x2E, 3, ROLE_WORKER, 229, // 171
0x2E, 4, ROLE_WORKER, 229, // 172
0x2E, 5, ROLE_WORKER, 229, // 173
0x2E, 6, ROLE_WORKER, 229, // 174
0x2E, 7, ROLE_WORKER, 229, // 175
0x2D, 0, ROLE_WORKER, 229, // 176
0x2D, 1, ROLE_WORKER, 229, // 177
0x2D, 2, ROLE_WORKER, 229, // 178
0x2D, 3, ROLE_WORKER, 229, // 179
0x2D, 4, ROLE_WORKER, 229, // 180
0x2D, 5, ROLE_WORKER, 229, // 181
0x2D, 6, ROLE_WORKER, 229, // 182
0x2D, 7, ROLE_WORKER, 229, // 183
0x2C, 0, ROLE_WORKER, 229, // 184
0x2C, 1, ROLE_WORKER, 229, // 185
0x2C, 2, ROLE_WORKER, 229, // 186
0x2C, 3, ROLE_WORKER, 229, // 187
0x2C, 4, ROLE_WORKER, 229, // 188
0x2C, 5, ROLE_WORKER, 229, // 189
0x2C, 6, ROLE_WORKER, 229, // 190
0x2C, 7, ROLE_WORKER, 229, // 191
0x3B, 0, ROLE_WORKER, 230, // 192
0x3B, 1, ROLE_WORKER, 230, // 193
0x3B, 2, ROLE_WORKER, 230, // 194
0x3B, 3, ROLE_WORKER, 230, // 195
0x3B, 4, ROLE_WORKER, 230, // 196
0x3B, 5, ROLE_WORKER, 230, // 197
0x3B, 6, ROLE_WORKER, 230, // 198
0x3B, 7, ROLE_WORKER, 230, // 199
0x3A, 0, ROLE_WORKER, 230, // 200
0x3A, 1, ROLE_WORKER, 230, // 201
0x3A, 2, ROLE_WORKER, 230, // 202
0x3A, 3, ROLE_WORKER, 230, // 203
0x3A, 4, ROLE_WORKER, 230, // 204
0x3A, 5, ROLE_WORKER, 230, // 205
0x3A, 6, ROLE_WORKER, 230, // 206
0x3A, 7, ROLE_WORKER, 230, // 207
0x39, 0, ROLE_WORKER, 230, // 208
0x39, 1, ROLE_WORKER, 230, // 209
0x39, 2, ROLE_WORKER, 230, // 210
0x39, 3, ROLE_WORKER, 230, // 211
0x39, 4, ROLE_WORKER, 230, // 212
0x39, 5, ROLE_WORKER, 230, // 213
0x39, 6, ROLE_WORKER, 230, // 214
0x39, 7, ROLE_WORKER, 230, // 215
0x38, 0, ROLE_WORKER, 230, // 216
0x38, 1, ROLE_WORKER, 230, // 217
0x38, 2, ROLE_WORKER, 230, // 218
0x38, 3, ROLE_WORKER, 230, // 219
0x38, 4, ROLE_WORKER, 230, // 220
0x38, 5, ROLE_WORKER, 230, // 221
0x38, 6, ROLE_WORKER, 230, // 222
0x38, 7, ROLE_WORKER, 230, // 223
0x4B, 0, ROLE_SCHEDULER, 231, // 224
0x4B, 1, ROLE_SCHEDULER, 231, // 225
0x4B, 2, ROLE_SCHEDULER, 231, // 226
0x4B, 3, ROLE_SCHEDULER, 231, // 227
0x6B, 0, ROLE_SCHEDULER, 231, // 228
0x6B, 1, ROLE_SCHEDULER, 231, // 229
0x6B, 2, ROLE_SCHEDULER, 231, // 230
0x6B, 3, ROLE_SCHEDULER, -1); // 231
// ======================================================================
case PR_CFG_257_HET_FLAT:
return pr_init(257,
0x0B, 0, ROLE_WORKER, 256, // 0
0x0B, 1, ROLE_WORKER, 256, // 1
0x0B, 2, ROLE_WORKER, 256, // 2
0x0B, 3, ROLE_WORKER, 256, // 3
0x0B, 4, ROLE_WORKER, 256, // 4
0x0B, 5, ROLE_WORKER, 256, // 5
0x0B, 6, ROLE_WORKER, 256, // 6
0x0B, 7, ROLE_WORKER, 256, // 7
0x0A, 0, ROLE_WORKER, 256, // 8
0x0A, 1, ROLE_WORKER, 256, // 9
0x0A, 2, ROLE_WORKER, 256, // 10
0x0A, 3, ROLE_WORKER, 256, // 11
0x0A, 4, ROLE_WORKER, 256, // 12
0x0A, 5, ROLE_WORKER, 256, // 13
0x0A, 6, ROLE_WORKER, 256, // 14
0x0A, 7, ROLE_WORKER, 256, // 15
0x09, 0, ROLE_WORKER, 256, // 16
0x09, 1, ROLE_WORKER, 256, // 17
0x09, 2, ROLE_WORKER, 256, // 18
0x09, 3, ROLE_WORKER, 256, // 19
0x09, 4, ROLE_WORKER, 256, // 20
0x09, 5, ROLE_WORKER, 256, // 21
0x09, 6, ROLE_WORKER, 256, // 22
0x09, 7, ROLE_WORKER, 256, // 23
0x08, 0, ROLE_WORKER, 256, // 24
0x08, 1, ROLE_WORKER, 256, // 25
0x08, 2, ROLE_WORKER, 256, // 26
0x08, 3, ROLE_WORKER, 256, // 27
0x08, 4, ROLE_WORKER, 256, // 28
0x08, 5, ROLE_WORKER, 256, // 29
0x08, 6, ROLE_WORKER, 256, // 30
0x08, 7, ROLE_WORKER, 256, // 31
0x07, 0, ROLE_WORKER, 256, // 32
0x07, 1, ROLE_WORKER, 256, // 33
0x07, 2, ROLE_WORKER, 256, // 34
0x07, 3, ROLE_WORKER, 256, // 35
0x07, 4, ROLE_WORKER, 256, // 36
0x0F, 0, ROLE_WORKER, 256, // 37
0x0F, 1, ROLE_WORKER, 256, // 38
0x0F, 2, ROLE_WORKER, 256, // 39
0x0F, 3, ROLE_WORKER, 256, // 40
0x0F, 4, ROLE_WORKER, 256, // 41
0x0F, 5, ROLE_WORKER, 256, // 42
0x0F, 6, ROLE_WORKER, 256, // 43
0x0F, 7, ROLE_WORKER, 256, // 44
0x0E, 0, ROLE_WORKER, 256, // 45
0x0E, 1, ROLE_WORKER, 256, // 46
0x0E, 2, ROLE_WORKER, 256, // 47
0x0E, 3, ROLE_WORKER, 256, // 48
0x0E, 4, ROLE_WORKER, 256, // 49
0x0E, 5, ROLE_WORKER, 256, // 50
0x0E, 6, ROLE_WORKER, 256, // 51
0x0E, 7, ROLE_WORKER, 256, // 52
0x0D, 0, ROLE_WORKER, 256, // 53
0x0D, 1, ROLE_WORKER, 256, // 54
0x0D, 2, ROLE_WORKER, 256, // 55
0x0D, 3, ROLE_WORKER, 256, // 56
0x0D, 4, ROLE_WORKER, 256, // 57
0x0D, 5, ROLE_WORKER, 256, // 58
0x0D, 6, ROLE_WORKER, 256, // 59
0x0D, 7, ROLE_WORKER, 256, // 60
0x0C, 0, ROLE_WORKER, 256, // 61
0x0C, 1, ROLE_WORKER, 256, // 62
0x0C, 2, ROLE_WORKER, 256, // 63
0x0C, 3, ROLE_WORKER, 256, // 64
0x0C, 4, ROLE_WORKER, 256, // 65
0x0C, 5, ROLE_WORKER, 256, // 66
0x0C, 6, ROLE_WORKER, 256, // 67
0x0C, 7, ROLE_WORKER, 256, // 68
0x06, 0, ROLE_WORKER, 256, // 69
0x06, 1, ROLE_WORKER, 256, // 70
0x06, 2, ROLE_WORKER, 256, // 71
0x06, 3, ROLE_WORKER, 256, // 72
0x06, 4, ROLE_WORKER, 256, // 73
0x1B, 0, ROLE_WORKER, 256, // 74
0x1B, 1, ROLE_WORKER, 256, // 75
0x1B, 2, ROLE_WORKER, 256, // 76
0x1B, 3, ROLE_WORKER, 256, // 77
0x1B, 4, ROLE_WORKER, 256, // 78
0x1B, 5, ROLE_WORKER, 256, // 79
0x1B, 6, ROLE_WORKER, 256, // 80
0x1B, 7, ROLE_WORKER, 256, // 81
0x1A, 0, ROLE_WORKER, 256, // 82
0x1A, 1, ROLE_WORKER, 256, // 83
0x1A, 2, ROLE_WORKER, 256, // 84
0x1A, 3, ROLE_WORKER, 256, // 85
0x1A, 4, ROLE_WORKER, 256, // 86
0x1A, 5, ROLE_WORKER, 256, // 87
0x1A, 6, ROLE_WORKER, 256, // 88
0x1A, 7, ROLE_WORKER, 256, // 89
0x19, 0, ROLE_WORKER, 256, // 90
0x19, 1, ROLE_WORKER, 256, // 91
0x19, 2, ROLE_WORKER, 256, // 92
0x19, 3, ROLE_WORKER, 256, // 93
0x19, 4, ROLE_WORKER, 256, // 94
0x19, 5, ROLE_WORKER, 256, // 95
0x19, 6, ROLE_WORKER, 256, // 96
0x19, 7, ROLE_WORKER, 256, // 97
0x18, 0, ROLE_WORKER, 256, // 98
0x18, 1, ROLE_WORKER, 256, // 99
0x18, 2, ROLE_WORKER, 256, // 100
0x18, 3, ROLE_WORKER, 256, // 101
0x18, 4, ROLE_WORKER, 256, // 102
0x18, 5, ROLE_WORKER, 256, // 103
0x18, 6, ROLE_WORKER, 256, // 104
0x18, 7, ROLE_WORKER, 256, // 105
0x17, 0, ROLE_WORKER, 256, // 106
0x17, 1, ROLE_WORKER, 256, // 107
0x17, 2, ROLE_WORKER, 256, // 108
0x17, 3, ROLE_WORKER, 256, // 109
0x17, 4, ROLE_WORKER, 256, // 110
0x1F, 0, ROLE_WORKER, 256, // 111
0x1F, 1, ROLE_WORKER, 256, // 112
0x1F, 2, ROLE_WORKER, 256, // 113
0x1F, 3, ROLE_WORKER, 256, // 114
0x1F, 4, ROLE_WORKER, 256, // 115
0x1F, 5, ROLE_WORKER, 256, // 116
0x1F, 6, ROLE_WORKER, 256, // 117
0x1F, 7, ROLE_WORKER, 256, // 118
0x1E, 0, ROLE_WORKER, 256, // 119
0x1E, 1, ROLE_WORKER, 256, // 120
0x1E, 2, ROLE_WORKER, 256, // 121
0x1E, 3, ROLE_WORKER, 256, // 122
0x1E, 4, ROLE_WORKER, 256, // 123
0x1E, 5, ROLE_WORKER, 256, // 124
0x1E, 6, ROLE_WORKER, 256, // 125
0x1E, 7, ROLE_WORKER, 256, // 126
0x1D, 0, ROLE_WORKER, 256, // 127
0x1D, 1, ROLE_WORKER, 256, // 128
0x1D, 2, ROLE_WORKER, 256, // 129
0x1D, 3, ROLE_WORKER, 256, // 130
0x1D, 4, ROLE_WORKER, 256, // 131
0x1D, 5, ROLE_WORKER, 256, // 132
0x1D, 6, ROLE_WORKER, 256, // 133
0x1D, 7, ROLE_WORKER, 256, // 134
0x1C, 0, ROLE_WORKER, 256, // 135
0x1C, 1, ROLE_WORKER, 256, // 136
0x1C, 2, ROLE_WORKER, 256, // 137
0x1C, 3, ROLE_WORKER, 256, // 138
0x1C, 4, ROLE_WORKER, 256, // 139
0x1C, 5, ROLE_WORKER, 256, // 140
0x1C, 6, ROLE_WORKER, 256, // 141
0x1C, 7, ROLE_WORKER, 256, // 142
0x16, 0, ROLE_WORKER, 256, // 143
0x16, 1, ROLE_WORKER, 256, // 144
0x16, 2, ROLE_WORKER, 256, // 145
0x16, 3, ROLE_WORKER, 256, // 146
0x16, 4, ROLE_WORKER, 256, // 147
0x2B, 0, ROLE_WORKER, 256, // 148
0x2B, 1, ROLE_WORKER, 256, // 149
0x2B, 2, ROLE_WORKER, 256, // 150
0x2B, 3, ROLE_WORKER, 256, // 151
0x2B, 4, ROLE_WORKER, 256, // 152
0x2B, 5, ROLE_WORKER, 256, // 153
0x2B, 6, ROLE_WORKER, 256, // 154
0x2B, 7, ROLE_WORKER, 256, // 155
0x2A, 0, ROLE_WORKER, 256, // 156
0x2A, 1, ROLE_WORKER, 256, // 157
0x2A, 2, ROLE_WORKER, 256, // 158
0x2A, 3, ROLE_WORKER, 256, // 159
0x2A, 4, ROLE_WORKER, 256, // 160
0x2A, 5, ROLE_WORKER, 256, // 161
0x2A, 6, ROLE_WORKER, 256, // 162
0x2A, 7, ROLE_WORKER, 256, // 163
0x29, 0, ROLE_WORKER, 256, // 164
0x29, 1, ROLE_WORKER, 256, // 165
0x29, 2, ROLE_WORKER, 256, // 166
0x29, 3, ROLE_WORKER, 256, // 167
0x29, 4, ROLE_WORKER, 256, // 168
0x29, 5, ROLE_WORKER, 256, // 169
0x29, 6, ROLE_WORKER, 256, // 170
0x29, 7, ROLE_WORKER, 256, // 171
0x28, 0, ROLE_WORKER, 256, // 172
0x28, 1, ROLE_WORKER, 256, // 173
0x28, 2, ROLE_WORKER, 256, // 174
0x28, 3, ROLE_WORKER, 256, // 175
0x28, 4, ROLE_WORKER, 256, // 176
0x28, 5, ROLE_WORKER, 256, // 177
0x28, 6, ROLE_WORKER, 256, // 178
0x28, 7, ROLE_WORKER, 256, // 179
0x27, 0, ROLE_WORKER, 256, // 180
0x27, 1, ROLE_WORKER, 256, // 181
0x27, 2, ROLE_WORKER, 256, // 182
0x27, 3, ROLE_WORKER, 256, // 183
0x2F, 0, ROLE_WORKER, 256, // 184
0x2F, 1, ROLE_WORKER, 256, // 185
0x2F, 2, ROLE_WORKER, 256, // 186
0x2F, 3, ROLE_WORKER, 256, // 187
0x2F, 4, ROLE_WORKER, 256, // 188
0x2F, 5, ROLE_WORKER, 256, // 189
0x2F, 6, ROLE_WORKER, 256, // 190
0x2F, 7, ROLE_WORKER, 256, // 191
0x2E, 0, ROLE_WORKER, 256, // 192
0x2E, 1, ROLE_WORKER, 256, // 193
0x2E, 2, ROLE_WORKER, 256, // 194
0x2E, 3, ROLE_WORKER, 256, // 195
0x2E, 4, ROLE_WORKER, 256, // 196
0x2E, 5, ROLE_WORKER, 256, // 197
0x2E, 6, ROLE_WORKER, 256, // 198
0x2E, 7, ROLE_WORKER, 256, // 199
0x2D, 0, ROLE_WORKER, 256, // 200
0x2D, 1, ROLE_WORKER, 256, // 201
0x2D, 2, ROLE_WORKER, 256, // 202
0x2D, 3, ROLE_WORKER, 256, // 203
0x2D, 4, ROLE_WORKER, 256, // 204
0x2D, 5, ROLE_WORKER, 256, // 205
0x2D, 6, ROLE_WORKER, 256, // 206
0x2D, 7, ROLE_WORKER, 256, // 207
0x2C, 0, ROLE_WORKER, 256, // 208
0x2C, 1, ROLE_WORKER, 256, // 209
0x2C, 2, ROLE_WORKER, 256, // 210
0x2C, 3, ROLE_WORKER, 256, // 211
0x2C, 4, ROLE_WORKER, 256, // 212
0x2C, 5, ROLE_WORKER, 256, // 213
0x2C, 6, ROLE_WORKER, 256, // 214
0x2C, 7, ROLE_WORKER, 256, // 215
0x26, 0, ROLE_WORKER, 256, // 216
0x26, 1, ROLE_WORKER, 256, // 217
0x26, 2, ROLE_WORKER, 256, // 218
0x26, 3, ROLE_WORKER, 256, // 219
0x3B, 0, ROLE_WORKER, 256, // 220
0x3B, 1, ROLE_WORKER, 256, // 221
0x3B, 2, ROLE_WORKER, 256, // 222
0x3B, 3, ROLE_WORKER, 256, // 223
0x3B, 4, ROLE_WORKER, 256, // 224
0x3B, 5, ROLE_WORKER, 256, // 225
0x3B, 6, ROLE_WORKER, 256, // 226
0x3B, 7, ROLE_WORKER, 256, // 227
0x3A, 0, ROLE_WORKER, 256, // 228
0x3A, 1, ROLE_WORKER, 256, // 229
0x3A, 2, ROLE_WORKER, 256, // 230
0x3A, 3, ROLE_WORKER, 256, // 231
0x3A, 4, ROLE_WORKER, 256, // 232
0x3A, 5, ROLE_WORKER, 256, // 233
0x3A, 6, ROLE_WORKER, 256, // 234
0x3A, 7, ROLE_WORKER, 256, // 235
0x39, 0, ROLE_WORKER, 256, // 236
0x39, 1, ROLE_WORKER, 256, // 237
0x39, 2, ROLE_WORKER, 256, // 238
0x39, 3, ROLE_WORKER, 256, // 239
0x39, 4, ROLE_WORKER, 256, // 240
0x39, 5, ROLE_WORKER, 256, // 241
0x39, 6, ROLE_WORKER, 256, // 242
0x39, 7, ROLE_WORKER, 256, // 243
0x38, 0, ROLE_WORKER, 256, // 244
0x38, 1, ROLE_WORKER, 256, // 245
0x38, 2, ROLE_WORKER, 256, // 246
0x38, 3, ROLE_WORKER, 256, // 247
0x38, 4, ROLE_WORKER, 256, // 248
0x38, 5, ROLE_WORKER, 256, // 249
0x38, 6, ROLE_WORKER, 256, // 250
0x38, 7, ROLE_WORKER, 256, // 251
0x37, 0, ROLE_WORKER, 256, // 252
0x37, 1, ROLE_WORKER, 256, // 253
0x37, 2, ROLE_WORKER, 256, // 254
0x37, 3, ROLE_WORKER, 256, // 255
0x6B, 0, ROLE_SCHEDULER, -1); // 256
// ======================================================================
case PR_CFG_264_HET_HIER:
return pr_init(264,
0x0B, 0, ROLE_WORKER, 256, // 0
0x0B, 1, ROLE_WORKER, 256, // 1
0x0B, 2, ROLE_WORKER, 256, // 2
0x0B, 3, ROLE_WORKER, 256, // 3
0x0B, 4, ROLE_WORKER, 256, // 4
0x0B, 5, ROLE_WORKER, 256, // 5
0x0B, 6, ROLE_WORKER, 256, // 6
0x0B, 7, ROLE_WORKER, 256, // 7
0x0A, 0, ROLE_WORKER, 256, // 8
0x0A, 1, ROLE_WORKER, 256, // 9
0x0A, 2, ROLE_WORKER, 256, // 10
0x0A, 3, ROLE_WORKER, 256, // 11
0x0A, 4, ROLE_WORKER, 256, // 12
0x0A, 5, ROLE_WORKER, 256, // 13
0x0A, 6, ROLE_WORKER, 256, // 14
0x0A, 7, ROLE_WORKER, 256, // 15
0x09, 0, ROLE_WORKER, 256, // 16
0x09, 1, ROLE_WORKER, 256, // 17
0x09, 2, ROLE_WORKER, 256, // 18
0x09, 3, ROLE_WORKER, 256, // 19
0x09, 4, ROLE_WORKER, 256, // 20
0x09, 5, ROLE_WORKER, 256, // 21
0x09, 6, ROLE_WORKER, 256, // 22
0x09, 7, ROLE_WORKER, 256, // 23
0x08, 0, ROLE_WORKER, 256, // 24
0x08, 1, ROLE_WORKER, 256, // 25
0x08, 2, ROLE_WORKER, 256, // 26
0x08, 3, ROLE_WORKER, 256, // 27
0x08, 4, ROLE_WORKER, 256, // 28
0x08, 5, ROLE_WORKER, 256, // 29
0x08, 6, ROLE_WORKER, 256, // 30
0x08, 7, ROLE_WORKER, 256, // 31
0x07, 0, ROLE_WORKER, 256, // 32
0x07, 1, ROLE_WORKER, 256, // 33
0x07, 2, ROLE_WORKER, 256, // 34
0x07, 3, ROLE_WORKER, 256, // 35
0x07, 4, ROLE_WORKER, 256, // 36
0x0F, 0, ROLE_WORKER, 257, // 37
0x0F, 1, ROLE_WORKER, 257, // 38
0x0F, 2, ROLE_WORKER, 257, // 39
0x0F, 3, ROLE_WORKER, 257, // 40
0x0F, 4, ROLE_WORKER, 257, // 41
0x0F, 5, ROLE_WORKER, 257, // 42
0x0F, 6, ROLE_WORKER, 257, // 43
0x0F, 7, ROLE_WORKER, 257, // 44
0x0E, 0, ROLE_WORKER, 257, // 45
0x0E, 1, ROLE_WORKER, 257, // 46
0x0E, 2, ROLE_WORKER, 257, // 47
0x0E, 3, ROLE_WORKER, 257, // 48
0x0E, 4, ROLE_WORKER, 257, // 49
0x0E, 5, ROLE_WORKER, 257, // 50
0x0E, 6, ROLE_WORKER, 257, // 51
0x0E, 7, ROLE_WORKER, 257, // 52
0x0D, 0, ROLE_WORKER, 257, // 53
0x0D, 1, ROLE_WORKER, 257, // 54
0x0D, 2, ROLE_WORKER, 257, // 55
0x0D, 3, ROLE_WORKER, 257, // 56
0x0D, 4, ROLE_WORKER, 257, // 57
0x0D, 5, ROLE_WORKER, 257, // 58
0x0D, 6, ROLE_WORKER, 257, // 59
0x0D, 7, ROLE_WORKER, 257, // 60
0x0C, 0, ROLE_WORKER, 257, // 61
0x0C, 1, ROLE_WORKER, 257, // 62
0x0C, 2, ROLE_WORKER, 257, // 63
0x0C, 3, ROLE_WORKER, 257, // 64
0x0C, 4, ROLE_WORKER, 257, // 65
0x0C, 5, ROLE_WORKER, 257, // 66
0x0C, 6, ROLE_WORKER, 257, // 67
0x0C, 7, ROLE_WORKER, 257, // 68
0x06, 0, ROLE_WORKER, 257, // 69
0x06, 1, ROLE_WORKER, 257, // 70
0x06, 2, ROLE_WORKER, 257, // 71
0x06, 3, ROLE_WORKER, 257, // 72
0x06, 4, ROLE_WORKER, 257, // 73
0x1B, 0, ROLE_WORKER, 258, // 74
0x1B, 1, ROLE_WORKER, 258, // 75
0x1B, 2, ROLE_WORKER, 258, // 76
0x1B, 3, ROLE_WORKER, 258, // 77
0x1B, 4, ROLE_WORKER, 258, // 78
0x1B, 5, ROLE_WORKER, 258, // 79
0x1B, 6, ROLE_WORKER, 258, // 80
0x1B, 7, ROLE_WORKER, 258, // 81
0x1A, 0, ROLE_WORKER, 258, // 82
0x1A, 1, ROLE_WORKER, 258, // 83
0x1A, 2, ROLE_WORKER, 258, // 84
0x1A, 3, ROLE_WORKER, 258, // 85
0x1A, 4, ROLE_WORKER, 258, // 86
0x1A, 5, ROLE_WORKER, 258, // 87
0x1A, 6, ROLE_WORKER, 258, // 88
0x1A, 7, ROLE_WORKER, 258, // 89
0x19, 0, ROLE_WORKER, 258, // 90
0x19, 1, ROLE_WORKER, 258, // 91
0x19, 2, ROLE_WORKER, 258, // 92
0x19, 3, ROLE_WORKER, 258, // 93
0x19, 4, ROLE_WORKER, 258, // 94
0x19, 5, ROLE_WORKER, 258, // 95
0x19, 6, ROLE_WORKER, 258, // 96
0x19, 7, ROLE_WORKER, 258, // 97
0x18, 0, ROLE_WORKER, 258, // 98
0x18, 1, ROLE_WORKER, 258, // 99
0x18, 2, ROLE_WORKER, 258, // 100
0x18, 3, ROLE_WORKER, 258, // 101
0x18, 4, ROLE_WORKER, 258, // 102
0x18, 5, ROLE_WORKER, 258, // 103
0x18, 6, ROLE_WORKER, 258, // 104
0x18, 7, ROLE_WORKER, 258, // 105
0x17, 0, ROLE_WORKER, 258, // 106
0x17, 1, ROLE_WORKER, 258, // 107
0x17, 2, ROLE_WORKER, 258, // 108
0x17, 3, ROLE_WORKER, 258, // 109
0x17, 4, ROLE_WORKER, 258, // 110
0x1F, 0, ROLE_WORKER, 259, // 111
0x1F, 1, ROLE_WORKER, 259, // 112
0x1F, 2, ROLE_WORKER, 259, // 113
0x1F, 3, ROLE_WORKER, 259, // 114
0x1F, 4, ROLE_WORKER, 259, // 115
0x1F, 5, ROLE_WORKER, 259, // 116
0x1F, 6, ROLE_WORKER, 259, // 117
0x1F, 7, ROLE_WORKER, 259, // 118
0x1E, 0, ROLE_WORKER, 259, // 119
0x1E, 1, ROLE_WORKER, 259, // 120
0x1E, 2, ROLE_WORKER, 259, // 121
0x1E, 3, ROLE_WORKER, 259, // 122
0x1E, 4, ROLE_WORKER, 259, // 123
0x1E, 5, ROLE_WORKER, 259, // 124
0x1E, 6, ROLE_WORKER, 259, // 125
0x1E, 7, ROLE_WORKER, 259, // 126
0x1D, 0, ROLE_WORKER, 259, // 127
0x1D, 1, ROLE_WORKER, 259, // 128
0x1D, 2, ROLE_WORKER, 259, // 129
0x1D, 3, ROLE_WORKER, 259, // 130
0x1D, 4, ROLE_WORKER, 259, // 131
0x1D, 5, ROLE_WORKER, 259, // 132
0x1D, 6, ROLE_WORKER, 259, // 133
0x1D, 7, ROLE_WORKER, 259, // 134
0x1C, 0, ROLE_WORKER, 259, // 135
0x1C, 1, ROLE_WORKER, 259, // 136
0x1C, 2, ROLE_WORKER, 259, // 137
0x1C, 3, ROLE_WORKER, 259, // 138
0x1C, 4, ROLE_WORKER, 259, // 139
0x1C, 5, ROLE_WORKER, 259, // 140
0x1C, 6, ROLE_WORKER, 259, // 141
0x1C, 7, ROLE_WORKER, 259, // 142
0x16, 0, ROLE_WORKER, 259, // 143
0x16, 1, ROLE_WORKER, 259, // 144
0x16, 2, ROLE_WORKER, 259, // 145
0x16, 3, ROLE_WORKER, 259, // 146
0x16, 4, ROLE_WORKER, 259, // 147
0x2B, 0, ROLE_WORKER, 260, // 148
0x2B, 1, ROLE_WORKER, 260, // 149
0x2B, 2, ROLE_WORKER, 260, // 150
0x2B, 3, ROLE_WORKER, 260, // 151
0x2B, 4, ROLE_WORKER, 260, // 152
0x2B, 5, ROLE_WORKER, 260, // 153
0x2B, 6, ROLE_WORKER, 260, // 154
0x2B, 7, ROLE_WORKER, 260, // 155
0x2A, 0, ROLE_WORKER, 260, // 156
0x2A, 1, ROLE_WORKER, 260, // 157
0x2A, 2, ROLE_WORKER, 260, // 158
0x2A, 3, ROLE_WORKER, 260, // 159
0x2A, 4, ROLE_WORKER, 260, // 160
0x2A, 5, ROLE_WORKER, 260, // 161
0x2A, 6, ROLE_WORKER, 260, // 162
0x2A, 7, ROLE_WORKER, 260, // 163
0x29, 0, ROLE_WORKER, 260, // 164
0x29, 1, ROLE_WORKER, 260, // 165
0x29, 2, ROLE_WORKER, 260, // 166
0x29, 3, ROLE_WORKER, 260, // 167
0x29, 4, ROLE_WORKER, 260, // 168
0x29, 5, ROLE_WORKER, 260, // 169
0x29, 6, ROLE_WORKER, 260, // 170
0x29, 7, ROLE_WORKER, 260, // 171
0x28, 0, ROLE_WORKER, 260, // 172
0x28, 1, ROLE_WORKER, 260, // 173
0x28, 2, ROLE_WORKER, 260, // 174
0x28, 3, ROLE_WORKER, 260, // 175
0x28, 4, ROLE_WORKER, 260, // 176
0x28, 5, ROLE_WORKER, 260, // 177
0x28, 6, ROLE_WORKER, 260, // 178
0x28, 7, ROLE_WORKER, 260, // 179
0x27, 0, ROLE_WORKER, 260, // 180
0x27, 1, ROLE_WORKER, 260, // 181
0x27, 2, ROLE_WORKER, 260, // 182
0x27, 3, ROLE_WORKER, 260, // 183
0x2F, 0, ROLE_WORKER, 261, // 184
0x2F, 1, ROLE_WORKER, 261, // 185
0x2F, 2, ROLE_WORKER, 261, // 186
0x2F, 3, ROLE_WORKER, 261, // 187
0x2F, 4, ROLE_WORKER, 261, // 188
0x2F, 5, ROLE_WORKER, 261, // 189
0x2F, 6, ROLE_WORKER, 261, // 190
0x2F, 7, ROLE_WORKER, 261, // 191
0x2E, 0, ROLE_WORKER, 261, // 192
0x2E, 1, ROLE_WORKER, 261, // 193
0x2E, 2, ROLE_WORKER, 261, // 194
0x2E, 3, ROLE_WORKER, 261, // 195
0x2E, 4, ROLE_WORKER, 261, // 196
0x2E, 5, ROLE_WORKER, 261, // 197
0x2E, 6, ROLE_WORKER, 261, // 198
0x2E, 7, ROLE_WORKER, 261, // 199
0x2D, 0, ROLE_WORKER, 261, // 200
0x2D, 1, ROLE_WORKER, 261, // 201
0x2D, 2, ROLE_WORKER, 261, // 202
0x2D, 3, ROLE_WORKER, 261, // 203
0x2D, 4, ROLE_WORKER, 261, // 204
0x2D, 5, ROLE_WORKER, 261, // 205
0x2D, 6, ROLE_WORKER, 261, // 206
0x2D, 7, ROLE_WORKER, 261, // 207
0x2C, 0, ROLE_WORKER, 261, // 208
0x2C, 1, ROLE_WORKER, 261, // 209
0x2C, 2, ROLE_WORKER, 261, // 210
0x2C, 3, ROLE_WORKER, 261, // 211
0x2C, 4, ROLE_WORKER, 261, // 212
0x2C, 5, ROLE_WORKER, 261, // 213
0x2C, 6, ROLE_WORKER, 261, // 214
0x2C, 7, ROLE_WORKER, 261, // 215
0x26, 0, ROLE_WORKER, 261, // 216
0x26, 1, ROLE_WORKER, 261, // 217
0x26, 2, ROLE_WORKER, 261, // 218
0x26, 3, ROLE_WORKER, 261, // 219
0x3B, 0, ROLE_WORKER, 262, // 220
0x3B, 1, ROLE_WORKER, 262, // 221
0x3B, 2, ROLE_WORKER, 262, // 222
0x3B, 3, ROLE_WORKER, 262, // 223
0x3B, 4, ROLE_WORKER, 262, // 224
0x3B, 5, ROLE_WORKER, 262, // 225
0x3B, 6, ROLE_WORKER, 262, // 226
0x3B, 7, ROLE_WORKER, 262, // 227
0x3A, 0, ROLE_WORKER, 262, // 228
0x3A, 1, ROLE_WORKER, 262, // 229
0x3A, 2, ROLE_WORKER, 262, // 230
0x3A, 3, ROLE_WORKER, 262, // 231
0x3A, 4, ROLE_WORKER, 262, // 232
0x3A, 5, ROLE_WORKER, 262, // 233
0x3A, 6, ROLE_WORKER, 262, // 234
0x3A, 7, ROLE_WORKER, 262, // 235
0x39, 0, ROLE_WORKER, 262, // 236
0x39, 1, ROLE_WORKER, 262, // 237
0x39, 2, ROLE_WORKER, 262, // 238
0x39, 3, ROLE_WORKER, 262, // 239
0x39, 4, ROLE_WORKER, 262, // 240
0x39, 5, ROLE_WORKER, 262, // 241
0x39, 6, ROLE_WORKER, 262, // 242
0x39, 7, ROLE_WORKER, 262, // 243
0x38, 0, ROLE_WORKER, 262, // 244
0x38, 1, ROLE_WORKER, 262, // 245
0x38, 2, ROLE_WORKER, 262, // 246
0x38, 3, ROLE_WORKER, 262, // 247
0x38, 4, ROLE_WORKER, 262, // 248
0x38, 5, ROLE_WORKER, 262, // 249
0x38, 6, ROLE_WORKER, 262, // 250
0x38, 7, ROLE_WORKER, 262, // 251
0x37, 0, ROLE_WORKER, 262, // 252
0x37, 1, ROLE_WORKER, 262, // 253
0x37, 2, ROLE_WORKER, 262, // 254
0x37, 3, ROLE_WORKER, 262, // 255
0x4B, 0, ROLE_SCHEDULER, 263, // 256
0x4B, 1, ROLE_SCHEDULER, 263, // 257
0x4B, 2, ROLE_SCHEDULER, 263, // 258
0x4B, 3, ROLE_SCHEDULER, 263, // 259
0x6B, 0, ROLE_SCHEDULER, 263, // 260
0x6B, 1, ROLE_SCHEDULER, 263, // 261
0x6B, 2, ROLE_SCHEDULER, 263, // 262
0x6B, 3, ROLE_SCHEDULER, -1); // 263
// ======================================================================
case PR_CFG_513_HET_FLAT:
return pr_init(513,
0x00, 0, ROLE_WORKER, 512, // 0
0x00, 1, ROLE_WORKER, 512, // 1
0x00, 2, ROLE_WORKER, 512, // 2
0x00, 3, ROLE_WORKER, 512, // 3
0x00, 4, ROLE_WORKER, 512, // 4
0x00, 5, ROLE_WORKER, 512, // 5
0x00, 6, ROLE_WORKER, 512, // 6
0x00, 7, ROLE_WORKER, 512, // 7
0x01, 0, ROLE_WORKER, 512, // 8
0x01, 1, ROLE_WORKER, 512, // 9
0x01, 2, ROLE_WORKER, 512, // 10
0x01, 3, ROLE_WORKER, 512, // 11
0x01, 4, ROLE_WORKER, 512, // 12
0x01, 5, ROLE_WORKER, 512, // 13
0x01, 6, ROLE_WORKER, 512, // 14
0x01, 7, ROLE_WORKER, 512, // 15
0x02, 0, ROLE_WORKER, 512, // 16
0x02, 1, ROLE_WORKER, 512, // 17
0x02, 2, ROLE_WORKER, 512, // 18
0x02, 3, ROLE_WORKER, 512, // 19
0x02, 4, ROLE_WORKER, 512, // 20
0x02, 5, ROLE_WORKER, 512, // 21
0x02, 6, ROLE_WORKER, 512, // 22
0x02, 7, ROLE_WORKER, 512, // 23
0x03, 0, ROLE_WORKER, 512, // 24
0x03, 1, ROLE_WORKER, 512, // 25
0x03, 2, ROLE_WORKER, 512, // 26
0x03, 3, ROLE_WORKER, 512, // 27
0x03, 4, ROLE_WORKER, 512, // 28
0x03, 5, ROLE_WORKER, 512, // 29
0x03, 6, ROLE_WORKER, 512, // 30
0x03, 7, ROLE_WORKER, 512, // 31
0x04, 0, ROLE_WORKER, 512, // 32
0x04, 1, ROLE_WORKER, 512, // 33
0x04, 2, ROLE_WORKER, 512, // 34
0x04, 3, ROLE_WORKER, 512, // 35
0x04, 4, ROLE_WORKER, 512, // 36
0x04, 5, ROLE_WORKER, 512, // 37
0x04, 6, ROLE_WORKER, 512, // 38
0x04, 7, ROLE_WORKER, 512, // 39
0x05, 0, ROLE_WORKER, 512, // 40
0x05, 1, ROLE_WORKER, 512, // 41
0x05, 2, ROLE_WORKER, 512, // 42
0x05, 3, ROLE_WORKER, 512, // 43
0x05, 4, ROLE_WORKER, 512, // 44
0x05, 5, ROLE_WORKER, 512, // 45
0x05, 6, ROLE_WORKER, 512, // 46
0x05, 7, ROLE_WORKER, 512, // 47
0x06, 0, ROLE_WORKER, 512, // 48
0x06, 1, ROLE_WORKER, 512, // 49
0x06, 2, ROLE_WORKER, 512, // 50
0x06, 3, ROLE_WORKER, 512, // 51
0x06, 4, ROLE_WORKER, 512, // 52
0x06, 5, ROLE_WORKER, 512, // 53
0x06, 6, ROLE_WORKER, 512, // 54
0x06, 7, ROLE_WORKER, 512, // 55
0x07, 0, ROLE_WORKER, 512, // 56
0x07, 1, ROLE_WORKER, 512, // 57
0x07, 2, ROLE_WORKER, 512, // 58
0x07, 3, ROLE_WORKER, 512, // 59
0x07, 4, ROLE_WORKER, 512, // 60
0x07, 5, ROLE_WORKER, 512, // 61
0x07, 6, ROLE_WORKER, 512, // 62
0x07, 7, ROLE_WORKER, 512, // 63
0x08, 0, ROLE_WORKER, 512, // 64
0x08, 1, ROLE_WORKER, 512, // 65
0x08, 2, ROLE_WORKER, 512, // 66
0x08, 3, ROLE_WORKER, 512, // 67
0x08, 4, ROLE_WORKER, 512, // 68
0x08, 5, ROLE_WORKER, 512, // 69
0x08, 6, ROLE_WORKER, 512, // 70
0x08, 7, ROLE_WORKER, 512, // 71
0x09, 0, ROLE_WORKER, 512, // 72
0x09, 1, ROLE_WORKER, 512, // 73
0x09, 2, ROLE_WORKER, 512, // 74
0x09, 3, ROLE_WORKER, 512, // 75
0x09, 4, ROLE_WORKER, 512, // 76
0x09, 5, ROLE_WORKER, 512, // 77
0x09, 6, ROLE_WORKER, 512, // 78
0x09, 7, ROLE_WORKER, 512, // 79
0x0A, 0, ROLE_WORKER, 512, // 80
0x0A, 1, ROLE_WORKER, 512, // 81
0x0A, 2, ROLE_WORKER, 512, // 82
0x0A, 3, ROLE_WORKER, 512, // 83
0x0A, 4, ROLE_WORKER, 512, // 84
0x0A, 5, ROLE_WORKER, 512, // 85
0x0A, 6, ROLE_WORKER, 512, // 86
0x0A, 7, ROLE_WORKER, 512, // 87
0x0B, 0, ROLE_WORKER, 512, // 88
0x0B, 1, ROLE_WORKER, 512, // 89
0x0B, 2, ROLE_WORKER, 512, // 90
0x0B, 3, ROLE_WORKER, 512, // 91
0x0B, 4, ROLE_WORKER, 512, // 92
0x0B, 5, ROLE_WORKER, 512, // 93
0x0B, 6, ROLE_WORKER, 512, // 94
0x0B, 7, ROLE_WORKER, 512, // 95
0x0C, 0, ROLE_WORKER, 512, // 96
0x0C, 1, ROLE_WORKER, 512, // 97
0x0C, 2, ROLE_WORKER, 512, // 98
0x0C, 3, ROLE_WORKER, 512, // 99
0x0C, 4, ROLE_WORKER, 512, // 100
0x0C, 5, ROLE_WORKER, 512, // 101
0x0C, 6, ROLE_WORKER, 512, // 102
0x0C, 7, ROLE_WORKER, 512, // 103
0x0D, 0, ROLE_WORKER, 512, // 104
0x0D, 1, ROLE_WORKER, 512, // 105
0x0D, 2, ROLE_WORKER, 512, // 106
0x0D, 3, ROLE_WORKER, 512, // 107
0x0D, 4, ROLE_WORKER, 512, // 108
0x0D, 5, ROLE_WORKER, 512, // 109
0x0D, 6, ROLE_WORKER, 512, // 110
0x0D, 7, ROLE_WORKER, 512, // 111
0x0E, 0, ROLE_WORKER, 512, // 112
0x0E, 1, ROLE_WORKER, 512, // 113
0x0E, 2, ROLE_WORKER, 512, // 114
0x0E, 3, ROLE_WORKER, 512, // 115
0x0E, 4, ROLE_WORKER, 512, // 116
0x0E, 5, ROLE_WORKER, 512, // 117
0x0E, 6, ROLE_WORKER, 512, // 118
0x0E, 7, ROLE_WORKER, 512, // 119
0x0F, 0, ROLE_WORKER, 512, // 120
0x0F, 1, ROLE_WORKER, 512, // 121
0x0F, 2, ROLE_WORKER, 512, // 122
0x0F, 3, ROLE_WORKER, 512, // 123
0x0F, 4, ROLE_WORKER, 512, // 124
0x0F, 5, ROLE_WORKER, 512, // 125
0x0F, 6, ROLE_WORKER, 512, // 126
0x0F, 7, ROLE_WORKER, 512, // 127
0x10, 0, ROLE_WORKER, 512, // 128
0x10, 1, ROLE_WORKER, 512, // 129
0x10, 2, ROLE_WORKER, 512, // 130
0x10, 3, ROLE_WORKER, 512, // 131
0x10, 4, ROLE_WORKER, 512, // 132
0x10, 5, ROLE_WORKER, 512, // 133
0x10, 6, ROLE_WORKER, 512, // 134
0x10, 7, ROLE_WORKER, 512, // 135
0x11, 0, ROLE_WORKER, 512, // 136
0x11, 1, ROLE_WORKER, 512, // 137
0x11, 2, ROLE_WORKER, 512, // 138
0x11, 3, ROLE_WORKER, 512, // 139
0x11, 4, ROLE_WORKER, 512, // 140
0x11, 5, ROLE_WORKER, 512, // 141
0x11, 6, ROLE_WORKER, 512, // 142
0x11, 7, ROLE_WORKER, 512, // 143
0x12, 0, ROLE_WORKER, 512, // 144
0x12, 1, ROLE_WORKER, 512, // 145
0x12, 2, ROLE_WORKER, 512, // 146
0x12, 3, ROLE_WORKER, 512, // 147
0x12, 4, ROLE_WORKER, 512, // 148
0x12, 5, ROLE_WORKER, 512, // 149
0x12, 6, ROLE_WORKER, 512, // 150
0x12, 7, ROLE_WORKER, 512, // 151
0x13, 0, ROLE_WORKER, 512, // 152
0x13, 1, ROLE_WORKER, 512, // 153
0x13, 2, ROLE_WORKER, 512, // 154
0x13, 3, ROLE_WORKER, 512, // 155
0x13, 4, ROLE_WORKER, 512, // 156
0x13, 5, ROLE_WORKER, 512, // 157
0x13, 6, ROLE_WORKER, 512, // 158
0x13, 7, ROLE_WORKER, 512, // 159
0x14, 0, ROLE_WORKER, 512, // 160
0x14, 1, ROLE_WORKER, 512, // 161
0x14, 2, ROLE_WORKER, 512, // 162
0x14, 3, ROLE_WORKER, 512, // 163
0x14, 4, ROLE_WORKER, 512, // 164
0x14, 5, ROLE_WORKER, 512, // 165
0x14, 6, ROLE_WORKER, 512, // 166
0x14, 7, ROLE_WORKER, 512, // 167
0x15, 0, ROLE_WORKER, 512, // 168
0x15, 1, ROLE_WORKER, 512, // 169
0x15, 2, ROLE_WORKER, 512, // 170
0x15, 3, ROLE_WORKER, 512, // 171
0x15, 4, ROLE_WORKER, 512, // 172
0x15, 5, ROLE_WORKER, 512, // 173
0x15, 6, ROLE_WORKER, 512, // 174
0x15, 7, ROLE_WORKER, 512, // 175
0x16, 0, ROLE_WORKER, 512, // 176
0x16, 1, ROLE_WORKER, 512, // 177
0x16, 2, ROLE_WORKER, 512, // 178
0x16, 3, ROLE_WORKER, 512, // 179
0x16, 4, ROLE_WORKER, 512, // 180
0x16, 5, ROLE_WORKER, 512, // 181
0x16, 6, ROLE_WORKER, 512, // 182
0x16, 7, ROLE_WORKER, 512, // 183
0x17, 0, ROLE_WORKER, 512, // 184
0x17, 1, ROLE_WORKER, 512, // 185
0x17, 2, ROLE_WORKER, 512, // 186
0x17, 3, ROLE_WORKER, 512, // 187
0x17, 4, ROLE_WORKER, 512, // 188
0x17, 5, ROLE_WORKER, 512, // 189
0x17, 6, ROLE_WORKER, 512, // 190
0x17, 7, ROLE_WORKER, 512, // 191
0x18, 0, ROLE_WORKER, 512, // 192
0x18, 1, ROLE_WORKER, 512, // 193
0x18, 2, ROLE_WORKER, 512, // 194
0x18, 3, ROLE_WORKER, 512, // 195
0x18, 4, ROLE_WORKER, 512, // 196
0x18, 5, ROLE_WORKER, 512, // 197
0x18, 6, ROLE_WORKER, 512, // 198
0x18, 7, ROLE_WORKER, 512, // 199
0x19, 0, ROLE_WORKER, 512, // 200
0x19, 1, ROLE_WORKER, 512, // 201
0x19, 2, ROLE_WORKER, 512, // 202
0x19, 3, ROLE_WORKER, 512, // 203
0x19, 4, ROLE_WORKER, 512, // 204
0x19, 5, ROLE_WORKER, 512, // 205
0x19, 6, ROLE_WORKER, 512, // 206
0x19, 7, ROLE_WORKER, 512, // 207
0x1A, 0, ROLE_WORKER, 512, // 208
0x1A, 1, ROLE_WORKER, 512, // 209
0x1A, 2, ROLE_WORKER, 512, // 210
0x1A, 3, ROLE_WORKER, 512, // 211
0x1A, 4, ROLE_WORKER, 512, // 212
0x1A, 5, ROLE_WORKER, 512, // 213
0x1A, 6, ROLE_WORKER, 512, // 214
0x1A, 7, ROLE_WORKER, 512, // 215
0x1B, 0, ROLE_WORKER, 512, // 216
0x1B, 1, ROLE_WORKER, 512, // 217
0x1B, 2, ROLE_WORKER, 512, // 218
0x1B, 3, ROLE_WORKER, 512, // 219
0x1B, 4, ROLE_WORKER, 512, // 220
0x1B, 5, ROLE_WORKER, 512, // 221
0x1B, 6, ROLE_WORKER, 512, // 222
0x1B, 7, ROLE_WORKER, 512, // 223
0x1C, 0, ROLE_WORKER, 512, // 224
0x1C, 1, ROLE_WORKER, 512, // 225
0x1C, 2, ROLE_WORKER, 512, // 226
0x1C, 3, ROLE_WORKER, 512, // 227
0x1C, 4, ROLE_WORKER, 512, // 228
0x1C, 5, ROLE_WORKER, 512, // 229
0x1C, 6, ROLE_WORKER, 512, // 230
0x1C, 7, ROLE_WORKER, 512, // 231
0x1D, 0, ROLE_WORKER, 512, // 232
0x1D, 1, ROLE_WORKER, 512, // 233
0x1D, 2, ROLE_WORKER, 512, // 234
0x1D, 3, ROLE_WORKER, 512, // 235
0x1D, 4, ROLE_WORKER, 512, // 236
0x1D, 5, ROLE_WORKER, 512, // 237
0x1D, 6, ROLE_WORKER, 512, // 238
0x1D, 7, ROLE_WORKER, 512, // 239
0x1E, 0, ROLE_WORKER, 512, // 240
0x1E, 1, ROLE_WORKER, 512, // 241
0x1E, 2, ROLE_WORKER, 512, // 242
0x1E, 3, ROLE_WORKER, 512, // 243
0x1E, 4, ROLE_WORKER, 512, // 244
0x1E, 5, ROLE_WORKER, 512, // 245
0x1E, 6, ROLE_WORKER, 512, // 246
0x1E, 7, ROLE_WORKER, 512, // 247
0x1F, 0, ROLE_WORKER, 512, // 248
0x1F, 1, ROLE_WORKER, 512, // 249
0x1F, 2, ROLE_WORKER, 512, // 250
0x1F, 3, ROLE_WORKER, 512, // 251
0x1F, 4, ROLE_WORKER, 512, // 252
0x1F, 5, ROLE_WORKER, 512, // 253
0x1F, 6, ROLE_WORKER, 512, // 254
0x1F, 7, ROLE_WORKER, 512, // 255
0x20, 0, ROLE_WORKER, 512, // 256
0x20, 1, ROLE_WORKER, 512, // 257
0x20, 2, ROLE_WORKER, 512, // 258
0x20, 3, ROLE_WORKER, 512, // 259
0x20, 4, ROLE_WORKER, 512, // 260
0x20, 5, ROLE_WORKER, 512, // 261
0x20, 6, ROLE_WORKER, 512, // 262
0x20, 7, ROLE_WORKER, 512, // 263
0x21, 0, ROLE_WORKER, 512, // 264
0x21, 1, ROLE_WORKER, 512, // 265
0x21, 2, ROLE_WORKER, 512, // 266
0x21, 3, ROLE_WORKER, 512, // 267
0x21, 4, ROLE_WORKER, 512, // 268
0x21, 5, ROLE_WORKER, 512, // 269
0x21, 6, ROLE_WORKER, 512, // 270
0x21, 7, ROLE_WORKER, 512, // 271
0x22, 0, ROLE_WORKER, 512, // 272
0x22, 1, ROLE_WORKER, 512, // 273
0x22, 2, ROLE_WORKER, 512, // 274
0x22, 3, ROLE_WORKER, 512, // 275
0x22, 4, ROLE_WORKER, 512, // 276
0x22, 5, ROLE_WORKER, 512, // 277
0x22, 6, ROLE_WORKER, 512, // 278
0x22, 7, ROLE_WORKER, 512, // 279
0x23, 0, ROLE_WORKER, 512, // 280
0x23, 1, ROLE_WORKER, 512, // 281
0x23, 2, ROLE_WORKER, 512, // 282
0x23, 3, ROLE_WORKER, 512, // 283
0x23, 4, ROLE_WORKER, 512, // 284
0x23, 5, ROLE_WORKER, 512, // 285
0x23, 6, ROLE_WORKER, 512, // 286
0x23, 7, ROLE_WORKER, 512, // 287
0x24, 0, ROLE_WORKER, 512, // 288
0x24, 1, ROLE_WORKER, 512, // 289
0x24, 2, ROLE_WORKER, 512, // 290
0x24, 3, ROLE_WORKER, 512, // 291
0x24, 4, ROLE_WORKER, 512, // 292
0x24, 5, ROLE_WORKER, 512, // 293
0x24, 6, ROLE_WORKER, 512, // 294
0x24, 7, ROLE_WORKER, 512, // 295
0x25, 0, ROLE_WORKER, 512, // 296
0x25, 1, ROLE_WORKER, 512, // 297
0x25, 2, ROLE_WORKER, 512, // 298
0x25, 3, ROLE_WORKER, 512, // 299
0x25, 4, ROLE_WORKER, 512, // 300
0x25, 5, ROLE_WORKER, 512, // 301
0x25, 6, ROLE_WORKER, 512, // 302
0x25, 7, ROLE_WORKER, 512, // 303
0x26, 0, ROLE_WORKER, 512, // 304
0x26, 1, ROLE_WORKER, 512, // 305
0x26, 2, ROLE_WORKER, 512, // 306
0x26, 3, ROLE_WORKER, 512, // 307
0x26, 4, ROLE_WORKER, 512, // 308
0x26, 5, ROLE_WORKER, 512, // 309
0x26, 6, ROLE_WORKER, 512, // 310
0x26, 7, ROLE_WORKER, 512, // 311
0x27, 0, ROLE_WORKER, 512, // 312
0x27, 1, ROLE_WORKER, 512, // 313
0x27, 2, ROLE_WORKER, 512, // 314
0x27, 3, ROLE_WORKER, 512, // 315
0x27, 4, ROLE_WORKER, 512, // 316
0x27, 5, ROLE_WORKER, 512, // 317
0x27, 6, ROLE_WORKER, 512, // 318
0x27, 7, ROLE_WORKER, 512, // 319
0x28, 0, ROLE_WORKER, 512, // 320
0x28, 1, ROLE_WORKER, 512, // 321
0x28, 2, ROLE_WORKER, 512, // 322
0x28, 3, ROLE_WORKER, 512, // 323
0x28, 4, ROLE_WORKER, 512, // 324
0x28, 5, ROLE_WORKER, 512, // 325
0x28, 6, ROLE_WORKER, 512, // 326
0x28, 7, ROLE_WORKER, 512, // 327
0x29, 0, ROLE_WORKER, 512, // 328
0x29, 1, ROLE_WORKER, 512, // 329
0x29, 2, ROLE_WORKER, 512, // 330
0x29, 3, ROLE_WORKER, 512, // 331
0x29, 4, ROLE_WORKER, 512, // 332
0x29, 5, ROLE_WORKER, 512, // 333
0x29, 6, ROLE_WORKER, 512, // 334
0x29, 7, ROLE_WORKER, 512, // 335
0x2A, 0, ROLE_WORKER, 512, // 336
0x2A, 1, ROLE_WORKER, 512, // 337
0x2A, 2, ROLE_WORKER, 512, // 338
0x2A, 3, ROLE_WORKER, 512, // 339
0x2A, 4, ROLE_WORKER, 512, // 340
0x2A, 5, ROLE_WORKER, 512, // 341
0x2A, 6, ROLE_WORKER, 512, // 342
0x2A, 7, ROLE_WORKER, 512, // 343
0x2B, 0, ROLE_WORKER, 512, // 344
0x2B, 1, ROLE_WORKER, 512, // 345
0x2B, 2, ROLE_WORKER, 512, // 346
0x2B, 3, ROLE_WORKER, 512, // 347
0x2B, 4, ROLE_WORKER, 512, // 348
0x2B, 5, ROLE_WORKER, 512, // 349
0x2B, 6, ROLE_WORKER, 512, // 350
0x2B, 7, ROLE_WORKER, 512, // 351
0x2C, 0, ROLE_WORKER, 512, // 352
0x2C, 1, ROLE_WORKER, 512, // 353
0x2C, 2, ROLE_WORKER, 512, // 354
0x2C, 3, ROLE_WORKER, 512, // 355
0x2C, 4, ROLE_WORKER, 512, // 356
0x2C, 5, ROLE_WORKER, 512, // 357
0x2C, 6, ROLE_WORKER, 512, // 358
0x2C, 7, ROLE_WORKER, 512, // 359
0x2D, 0, ROLE_WORKER, 512, // 360
0x2D, 1, ROLE_WORKER, 512, // 361
0x2D, 2, ROLE_WORKER, 512, // 362
0x2D, 3, ROLE_WORKER, 512, // 363
0x2D, 4, ROLE_WORKER, 512, // 364
0x2D, 5, ROLE_WORKER, 512, // 365
0x2D, 6, ROLE_WORKER, 512, // 366
0x2D, 7, ROLE_WORKER, 512, // 367
0x2E, 0, ROLE_WORKER, 512, // 368
0x2E, 1, ROLE_WORKER, 512, // 369
0x2E, 2, ROLE_WORKER, 512, // 370
0x2E, 3, ROLE_WORKER, 512, // 371
0x2E, 4, ROLE_WORKER, 512, // 372
0x2E, 5, ROLE_WORKER, 512, // 373
0x2E, 6, ROLE_WORKER, 512, // 374
0x2E, 7, ROLE_WORKER, 512, // 375
0x2F, 0, ROLE_WORKER, 512, // 376
0x2F, 1, ROLE_WORKER, 512, // 377
0x2F, 2, ROLE_WORKER, 512, // 378
0x2F, 3, ROLE_WORKER, 512, // 379
0x2F, 4, ROLE_WORKER, 512, // 380
0x2F, 5, ROLE_WORKER, 512, // 381
0x2F, 6, ROLE_WORKER, 512, // 382
0x2F, 7, ROLE_WORKER, 512, // 383
0x30, 0, ROLE_WORKER, 512, // 384
0x30, 1, ROLE_WORKER, 512, // 385
0x30, 2, ROLE_WORKER, 512, // 386
0x30, 3, ROLE_WORKER, 512, // 387
0x30, 4, ROLE_WORKER, 512, // 388
0x30, 5, ROLE_WORKER, 512, // 389
0x30, 6, ROLE_WORKER, 512, // 390
0x30, 7, ROLE_WORKER, 512, // 391
0x31, 0, ROLE_WORKER, 512, // 392
0x31, 1, ROLE_WORKER, 512, // 393
0x31, 2, ROLE_WORKER, 512, // 394
0x31, 3, ROLE_WORKER, 512, // 395
0x31, 4, ROLE_WORKER, 512, // 396
0x31, 5, ROLE_WORKER, 512, // 397
0x31, 6, ROLE_WORKER, 512, // 398
0x31, 7, ROLE_WORKER, 512, // 399
0x32, 0, ROLE_WORKER, 512, // 400
0x32, 1, ROLE_WORKER, 512, // 401
0x32, 2, ROLE_WORKER, 512, // 402
0x32, 3, ROLE_WORKER, 512, // 403
0x32, 4, ROLE_WORKER, 512, // 404
0x32, 5, ROLE_WORKER, 512, // 405
0x32, 6, ROLE_WORKER, 512, // 406
0x32, 7, ROLE_WORKER, 512, // 407
0x33, 0, ROLE_WORKER, 512, // 408
0x33, 1, ROLE_WORKER, 512, // 409
0x33, 2, ROLE_WORKER, 512, // 410
0x33, 3, ROLE_WORKER, 512, // 411
0x33, 4, ROLE_WORKER, 512, // 412
0x33, 5, ROLE_WORKER, 512, // 413
0x33, 6, ROLE_WORKER, 512, // 414
0x33, 7, ROLE_WORKER, 512, // 415
0x34, 0, ROLE_WORKER, 512, // 416
0x34, 1, ROLE_WORKER, 512, // 417
0x34, 2, ROLE_WORKER, 512, // 418
0x34, 3, ROLE_WORKER, 512, // 419
0x34, 4, ROLE_WORKER, 512, // 420
0x34, 5, ROLE_WORKER, 512, // 421
0x34, 6, ROLE_WORKER, 512, // 422
0x34, 7, ROLE_WORKER, 512, // 423
0x35, 0, ROLE_WORKER, 512, // 424
0x35, 1, ROLE_WORKER, 512, // 425
0x35, 2, ROLE_WORKER, 512, // 426
0x35, 3, ROLE_WORKER, 512, // 427
0x35, 4, ROLE_WORKER, 512, // 428
0x35, 5, ROLE_WORKER, 512, // 429
0x35, 6, ROLE_WORKER, 512, // 430
0x35, 7, ROLE_WORKER, 512, // 431
0x36, 0, ROLE_WORKER, 512, // 432
0x36, 1, ROLE_WORKER, 512, // 433
0x36, 2, ROLE_WORKER, 512, // 434
0x36, 3, ROLE_WORKER, 512, // 435
0x36, 4, ROLE_WORKER, 512, // 436
0x36, 5, ROLE_WORKER, 512, // 437
0x36, 6, ROLE_WORKER, 512, // 438
0x36, 7, ROLE_WORKER, 512, // 439
0x37, 0, ROLE_WORKER, 512, // 440
0x37, 1, ROLE_WORKER, 512, // 441
0x37, 2, ROLE_WORKER, 512, // 442
0x37, 3, ROLE_WORKER, 512, // 443
0x37, 4, ROLE_WORKER, 512, // 444
0x37, 5, ROLE_WORKER, 512, // 445
0x37, 6, ROLE_WORKER, 512, // 446
0x37, 7, ROLE_WORKER, 512, // 447
0x38, 0, ROLE_WORKER, 512, // 448
0x38, 1, ROLE_WORKER, 512, // 449
0x38, 2, ROLE_WORKER, 512, // 450
0x38, 3, ROLE_WORKER, 512, // 451
0x38, 4, ROLE_WORKER, 512, // 452
0x38, 5, ROLE_WORKER, 512, // 453
0x38, 6, ROLE_WORKER, 512, // 454
0x38, 7, ROLE_WORKER, 512, // 455
0x39, 0, ROLE_WORKER, 512, // 456
0x39, 1, ROLE_WORKER, 512, // 457
0x39, 2, ROLE_WORKER, 512, // 458
0x39, 3, ROLE_WORKER, 512, // 459
0x39, 4, ROLE_WORKER, 512, // 460
0x39, 5, ROLE_WORKER, 512, // 461
0x39, 6, ROLE_WORKER, 512, // 462
0x39, 7, ROLE_WORKER, 512, // 463
0x3A, 0, ROLE_WORKER, 512, // 464
0x3A, 1, ROLE_WORKER, 512, // 465
0x3A, 2, ROLE_WORKER, 512, // 466
0x3A, 3, ROLE_WORKER, 512, // 467
0x3A, 4, ROLE_WORKER, 512, // 468
0x3A, 5, ROLE_WORKER, 512, // 469
0x3A, 6, ROLE_WORKER, 512, // 470
0x3A, 7, ROLE_WORKER, 512, // 471
0x3B, 0, ROLE_WORKER, 512, // 472
0x3B, 1, ROLE_WORKER, 512, // 473
0x3B, 2, ROLE_WORKER, 512, // 474
0x3B, 3, ROLE_WORKER, 512, // 475
0x3B, 4, ROLE_WORKER, 512, // 476
0x3B, 5, ROLE_WORKER, 512, // 477
0x3B, 6, ROLE_WORKER, 512, // 478
0x3B, 7, ROLE_WORKER, 512, // 479
0x3C, 0, ROLE_WORKER, 512, // 480
0x3C, 1, ROLE_WORKER, 512, // 481
0x3C, 2, ROLE_WORKER, 512, // 482
0x3C, 3, ROLE_WORKER, 512, // 483
0x3C, 4, ROLE_WORKER, 512, // 484
0x3C, 5, ROLE_WORKER, 512, // 485
0x3C, 6, ROLE_WORKER, 512, // 486
0x3C, 7, ROLE_WORKER, 512, // 487
0x3D, 0, ROLE_WORKER, 512, // 488
0x3D, 1, ROLE_WORKER, 512, // 489
0x3D, 2, ROLE_WORKER, 512, // 490
0x3D, 3, ROLE_WORKER, 512, // 491
0x3D, 4, ROLE_WORKER, 512, // 492
0x3D, 5, ROLE_WORKER, 512, // 493
0x3D, 6, ROLE_WORKER, 512, // 494
0x3D, 7, ROLE_WORKER, 512, // 495
0x3E, 0, ROLE_WORKER, 512, // 496
0x3E, 1, ROLE_WORKER, 512, // 497
0x3E, 2, ROLE_WORKER, 512, // 498
0x3E, 3, ROLE_WORKER, 512, // 499
0x3E, 4, ROLE_WORKER, 512, // 500
0x3E, 5, ROLE_WORKER, 512, // 501
0x3E, 6, ROLE_WORKER, 512, // 502
0x3E, 7, ROLE_WORKER, 512, // 503
0x3F, 0, ROLE_WORKER, 512, // 504
0x3F, 1, ROLE_WORKER, 512, // 505
0x3F, 2, ROLE_WORKER, 512, // 506
0x3F, 3, ROLE_WORKER, 512, // 507
0x3F, 4, ROLE_WORKER, 512, // 508
0x3F, 5, ROLE_WORKER, 512, // 509
0x3F, 6, ROLE_WORKER, 512, // 510
0x3F, 7, ROLE_WORKER, 512, // 511
0x6B, 0, ROLE_SCHEDULER, -1); // 512
// ======================================================================
case PR_CFG_520_HET_HIER3:
return pr_init(520,
0x00, 0, ROLE_WORKER, 7, // 0
0x00, 1, ROLE_WORKER, 7, // 1
0x00, 2, ROLE_WORKER, 7, // 2
0x00, 3, ROLE_WORKER, 7, // 3
0x00, 4, ROLE_WORKER, 7, // 4
0x00, 5, ROLE_WORKER, 7, // 5
0x00, 6, ROLE_WORKER, 7, // 6
0x00, 7, ROLE_SCHEDULER, 512, // 7
0x01, 0, ROLE_WORKER, 15, // 8
0x01, 1, ROLE_WORKER, 15, // 9
0x01, 2, ROLE_WORKER, 15, // 10
0x01, 3, ROLE_WORKER, 15, // 11
0x01, 4, ROLE_WORKER, 15, // 12
0x01, 5, ROLE_WORKER, 15, // 13
0x01, 6, ROLE_WORKER, 15, // 14
0x01, 7, ROLE_SCHEDULER, 512, // 15
0x02, 0, ROLE_WORKER, 23, // 16
0x02, 1, ROLE_WORKER, 23, // 17
0x02, 2, ROLE_WORKER, 23, // 18
0x02, 3, ROLE_WORKER, 23, // 19
0x02, 4, ROLE_WORKER, 23, // 20
0x02, 5, ROLE_WORKER, 23, // 21
0x02, 6, ROLE_WORKER, 23, // 22
0x02, 7, ROLE_SCHEDULER, 512, // 23
0x03, 0, ROLE_WORKER, 31, // 24
0x03, 1, ROLE_WORKER, 31, // 25
0x03, 2, ROLE_WORKER, 31, // 26
0x03, 3, ROLE_WORKER, 31, // 27
0x03, 4, ROLE_WORKER, 31, // 28
0x03, 5, ROLE_WORKER, 31, // 29
0x03, 6, ROLE_WORKER, 31, // 30
0x03, 7, ROLE_SCHEDULER, 512, // 31
0x04, 0, ROLE_WORKER, 39, // 32
0x04, 1, ROLE_WORKER, 39, // 33
0x04, 2, ROLE_WORKER, 39, // 34
0x04, 3, ROLE_WORKER, 39, // 35
0x04, 4, ROLE_WORKER, 39, // 36
0x04, 5, ROLE_WORKER, 39, // 37
0x04, 6, ROLE_WORKER, 39, // 38
0x04, 7, ROLE_SCHEDULER, 512, // 39
0x05, 0, ROLE_WORKER, 47, // 40
0x05, 1, ROLE_WORKER, 47, // 41
0x05, 2, ROLE_WORKER, 47, // 42
0x05, 3, ROLE_WORKER, 47, // 43
0x05, 4, ROLE_WORKER, 47, // 44
0x05, 5, ROLE_WORKER, 47, // 45
0x05, 6, ROLE_WORKER, 47, // 46
0x05, 7, ROLE_SCHEDULER, 512, // 47
0x06, 0, ROLE_WORKER, 55, // 48
0x06, 1, ROLE_WORKER, 55, // 49
0x06, 2, ROLE_WORKER, 55, // 50
0x06, 3, ROLE_WORKER, 55, // 51
0x06, 4, ROLE_WORKER, 55, // 52
0x06, 5, ROLE_WORKER, 55, // 53
0x06, 6, ROLE_WORKER, 55, // 54
0x06, 7, ROLE_SCHEDULER, 512, // 55
0x07, 0, ROLE_WORKER, 63, // 56
0x07, 1, ROLE_WORKER, 63, // 57
0x07, 2, ROLE_WORKER, 63, // 58
0x07, 3, ROLE_WORKER, 63, // 59
0x07, 4, ROLE_WORKER, 63, // 60
0x07, 5, ROLE_WORKER, 63, // 61
0x07, 6, ROLE_WORKER, 63, // 62
0x07, 7, ROLE_SCHEDULER, 512, // 63
0x08, 0, ROLE_WORKER, 71, // 64
0x08, 1, ROLE_WORKER, 71, // 65
0x08, 2, ROLE_WORKER, 71, // 66
0x08, 3, ROLE_WORKER, 71, // 67
0x08, 4, ROLE_WORKER, 71, // 68
0x08, 5, ROLE_WORKER, 71, // 69
0x08, 6, ROLE_WORKER, 71, // 70
0x08, 7, ROLE_SCHEDULER, 512, // 71
// -------------------------------------------
0x09, 0, ROLE_WORKER, 79, // 72
0x09, 1, ROLE_WORKER, 79, // 73
0x09, 2, ROLE_WORKER, 79, // 74
0x09, 3, ROLE_WORKER, 79, // 75
0x09, 4, ROLE_WORKER, 79, // 76
0x09, 5, ROLE_WORKER, 79, // 77
0x09, 6, ROLE_WORKER, 79, // 78
0x09, 7, ROLE_SCHEDULER, 513, // 79
0x0A, 0, ROLE_WORKER, 87, // 80
0x0A, 1, ROLE_WORKER, 87, // 81
0x0A, 2, ROLE_WORKER, 87, // 82
0x0A, 3, ROLE_WORKER, 87, // 83
0x0A, 4, ROLE_WORKER, 87, // 84
0x0A, 5, ROLE_WORKER, 87, // 85
0x0A, 6, ROLE_WORKER, 87, // 86
0x0A, 7, ROLE_SCHEDULER, 513, // 87
0x0B, 0, ROLE_WORKER, 95, // 88
0x0B, 1, ROLE_WORKER, 95, // 89
0x0B, 2, ROLE_WORKER, 95, // 90
0x0B, 3, ROLE_WORKER, 95, // 91
0x0B, 4, ROLE_WORKER, 95, // 92
0x0B, 5, ROLE_WORKER, 95, // 93
0x0B, 6, ROLE_WORKER, 95, // 94
0x0B, 7, ROLE_SCHEDULER, 513, // 95
0x0C, 0, ROLE_WORKER, 103, // 96
0x0C, 1, ROLE_WORKER, 103, // 97
0x0C, 2, ROLE_WORKER, 103, // 98
0x0C, 3, ROLE_WORKER, 103, // 99
0x0C, 4, ROLE_WORKER, 103, // 100
0x0C, 5, ROLE_WORKER, 103, // 101
0x0C, 6, ROLE_WORKER, 103, // 102
0x0C, 7, ROLE_SCHEDULER, 513, // 103
0x0D, 0, ROLE_WORKER, 111, // 104
0x0D, 1, ROLE_WORKER, 111, // 105
0x0D, 2, ROLE_WORKER, 111, // 106
0x0D, 3, ROLE_WORKER, 111, // 107
0x0D, 4, ROLE_WORKER, 111, // 108
0x0D, 5, ROLE_WORKER, 111, // 109
0x0D, 6, ROLE_WORKER, 111, // 110
0x0D, 7, ROLE_SCHEDULER, 513, // 111
0x0E, 0, ROLE_WORKER, 119, // 112
0x0E, 1, ROLE_WORKER, 119, // 113
0x0E, 2, ROLE_WORKER, 119, // 114
0x0E, 3, ROLE_WORKER, 119, // 115
0x0E, 4, ROLE_WORKER, 119, // 116
0x0E, 5, ROLE_WORKER, 119, // 117
0x0E, 6, ROLE_WORKER, 119, // 118
0x0E, 7, ROLE_SCHEDULER, 513, // 119
0x0F, 0, ROLE_WORKER, 127, // 120
0x0F, 1, ROLE_WORKER, 127, // 121
0x0F, 2, ROLE_WORKER, 127, // 122
0x0F, 3, ROLE_WORKER, 127, // 123
0x0F, 4, ROLE_WORKER, 127, // 124
0x0F, 5, ROLE_WORKER, 127, // 125
0x0F, 6, ROLE_WORKER, 127, // 126
0x0F, 7, ROLE_SCHEDULER, 513, // 127
0x10, 0, ROLE_WORKER, 135, // 128
0x10, 1, ROLE_WORKER, 135, // 129
0x10, 2, ROLE_WORKER, 135, // 130
0x10, 3, ROLE_WORKER, 135, // 131
0x10, 4, ROLE_WORKER, 135, // 132
0x10, 5, ROLE_WORKER, 135, // 133
0x10, 6, ROLE_WORKER, 135, // 134
0x10, 7, ROLE_SCHEDULER, 513, // 135
0x11, 0, ROLE_WORKER, 143, // 136
0x11, 1, ROLE_WORKER, 143, // 137
0x11, 2, ROLE_WORKER, 143, // 138
0x11, 3, ROLE_WORKER, 143, // 139
0x11, 4, ROLE_WORKER, 143, // 140
0x11, 5, ROLE_WORKER, 143, // 141
0x11, 6, ROLE_WORKER, 143, // 142
0x11, 7, ROLE_SCHEDULER, 513, // 143
// -------------------------------------------
0x12, 0, ROLE_WORKER, 151, // 144
0x12, 1, ROLE_WORKER, 151, // 145
0x12, 2, ROLE_WORKER, 151, // 146
0x12, 3, ROLE_WORKER, 151, // 147
0x12, 4, ROLE_WORKER, 151, // 148
0x12, 5, ROLE_WORKER, 151, // 149
0x12, 6, ROLE_WORKER, 151, // 150
0x12, 7, ROLE_SCHEDULER, 514, // 151
0x13, 0, ROLE_WORKER, 159, // 152
0x13, 1, ROLE_WORKER, 159, // 153
0x13, 2, ROLE_WORKER, 159, // 154
0x13, 3, ROLE_WORKER, 159, // 155
0x13, 4, ROLE_WORKER, 159, // 156
0x13, 5, ROLE_WORKER, 159, // 157
0x13, 6, ROLE_WORKER, 159, // 158
0x13, 7, ROLE_SCHEDULER, 514, // 159
0x14, 0, ROLE_WORKER, 167, // 160
0x14, 1, ROLE_WORKER, 167, // 161
0x14, 2, ROLE_WORKER, 167, // 162
0x14, 3, ROLE_WORKER, 167, // 163
0x14, 4, ROLE_WORKER, 167, // 164
0x14, 5, ROLE_WORKER, 167, // 165
0x14, 6, ROLE_WORKER, 167, // 166
0x14, 7, ROLE_SCHEDULER, 514, // 167
0x15, 0, ROLE_WORKER, 175, // 168
0x15, 1, ROLE_WORKER, 175, // 169
0x15, 2, ROLE_WORKER, 175, // 170
0x15, 3, ROLE_WORKER, 175, // 171
0x15, 4, ROLE_WORKER, 175, // 172
0x15, 5, ROLE_WORKER, 175, // 173
0x15, 6, ROLE_WORKER, 175, // 174
0x15, 7, ROLE_SCHEDULER, 514, // 175
0x16, 0, ROLE_WORKER, 183, // 176
0x16, 1, ROLE_WORKER, 183, // 177
0x16, 2, ROLE_WORKER, 183, // 178
0x16, 3, ROLE_WORKER, 183, // 179
0x16, 4, ROLE_WORKER, 183, // 180
0x16, 5, ROLE_WORKER, 183, // 181
0x16, 6, ROLE_WORKER, 183, // 182
0x16, 7, ROLE_SCHEDULER, 514, // 183
0x17, 0, ROLE_WORKER, 191, // 184
0x17, 1, ROLE_WORKER, 191, // 185
0x17, 2, ROLE_WORKER, 191, // 186
0x17, 3, ROLE_WORKER, 191, // 187
0x17, 4, ROLE_WORKER, 191, // 188
0x17, 5, ROLE_WORKER, 191, // 189
0x17, 6, ROLE_WORKER, 191, // 190
0x17, 7, ROLE_SCHEDULER, 514, // 191
0x18, 0, ROLE_WORKER, 199, // 192
0x18, 1, ROLE_WORKER, 199, // 193
0x18, 2, ROLE_WORKER, 199, // 194
0x18, 3, ROLE_WORKER, 199, // 195
0x18, 4, ROLE_WORKER, 199, // 196
0x18, 5, ROLE_WORKER, 199, // 197
0x18, 6, ROLE_WORKER, 199, // 198
0x18, 7, ROLE_SCHEDULER, 514, // 199
0x19, 0, ROLE_WORKER, 207, // 200
0x19, 1, ROLE_WORKER, 207, // 201
0x19, 2, ROLE_WORKER, 207, // 202
0x19, 3, ROLE_WORKER, 207, // 203
0x19, 4, ROLE_WORKER, 207, // 204
0x19, 5, ROLE_WORKER, 207, // 205
0x19, 6, ROLE_WORKER, 207, // 206
0x19, 7, ROLE_SCHEDULER, 514, // 207
0x1A, 0, ROLE_WORKER, 215, // 208
0x1A, 1, ROLE_WORKER, 215, // 209
0x1A, 2, ROLE_WORKER, 215, // 210
0x1A, 3, ROLE_WORKER, 215, // 211
0x1A, 4, ROLE_WORKER, 215, // 212
0x1A, 5, ROLE_WORKER, 215, // 213
0x1A, 6, ROLE_WORKER, 215, // 214
0x1A, 7, ROLE_SCHEDULER, 514, // 215
// -------------------------------------------
0x1B, 0, ROLE_WORKER, 223, // 216
0x1B, 1, ROLE_WORKER, 223, // 217
0x1B, 2, ROLE_WORKER, 223, // 218
0x1B, 3, ROLE_WORKER, 223, // 219
0x1B, 4, ROLE_WORKER, 223, // 220
0x1B, 5, ROLE_WORKER, 223, // 221
0x1B, 6, ROLE_WORKER, 223, // 222
0x1B, 7, ROLE_SCHEDULER, 515, // 223
0x1C, 0, ROLE_WORKER, 231, // 224
0x1C, 1, ROLE_WORKER, 231, // 225
0x1C, 2, ROLE_WORKER, 231, // 226
0x1C, 3, ROLE_WORKER, 231, // 227
0x1C, 4, ROLE_WORKER, 231, // 228
0x1C, 5, ROLE_WORKER, 231, // 229
0x1C, 6, ROLE_WORKER, 231, // 230
0x1C, 7, ROLE_SCHEDULER, 515, // 231
0x1D, 0, ROLE_WORKER, 239, // 232
0x1D, 1, ROLE_WORKER, 239, // 233
0x1D, 2, ROLE_WORKER, 239, // 234
0x1D, 3, ROLE_WORKER, 239, // 235
0x1D, 4, ROLE_WORKER, 239, // 236
0x1D, 5, ROLE_WORKER, 239, // 237
0x1D, 6, ROLE_WORKER, 239, // 238
0x1D, 7, ROLE_SCHEDULER, 515, // 239
0x1E, 0, ROLE_WORKER, 247, // 240
0x1E, 1, ROLE_WORKER, 247, // 241
0x1E, 2, ROLE_WORKER, 247, // 242
0x1E, 3, ROLE_WORKER, 247, // 243
0x1E, 4, ROLE_WORKER, 247, // 244
0x1E, 5, ROLE_WORKER, 247, // 245
0x1E, 6, ROLE_WORKER, 247, // 246
0x1E, 7, ROLE_SCHEDULER, 515, // 247
0x1F, 0, ROLE_WORKER, 255, // 248
0x1F, 1, ROLE_WORKER, 255, // 249
0x1F, 2, ROLE_WORKER, 255, // 250
0x1F, 3, ROLE_WORKER, 255, // 251
0x1F, 4, ROLE_WORKER, 255, // 252
0x1F, 5, ROLE_WORKER, 255, // 253
0x1F, 6, ROLE_WORKER, 255, // 254
0x1F, 7, ROLE_SCHEDULER, 515, // 255
0x20, 0, ROLE_WORKER, 263, // 256
0x20, 1, ROLE_WORKER, 263, // 257
0x20, 2, ROLE_WORKER, 263, // 258
0x20, 3, ROLE_WORKER, 263, // 259
0x20, 4, ROLE_WORKER, 263, // 260
0x20, 5, ROLE_WORKER, 263, // 261
0x20, 6, ROLE_WORKER, 263, // 262
0x20, 7, ROLE_SCHEDULER, 515, // 263
0x21, 0, ROLE_WORKER, 271, // 264
0x21, 1, ROLE_WORKER, 271, // 265
0x21, 2, ROLE_WORKER, 271, // 266
0x21, 3, ROLE_WORKER, 271, // 267
0x21, 4, ROLE_WORKER, 271, // 268
0x21, 5, ROLE_WORKER, 271, // 269
0x21, 6, ROLE_WORKER, 271, // 270
0x21, 7, ROLE_SCHEDULER, 515, // 271
0x22, 0, ROLE_WORKER, 279, // 272
0x22, 1, ROLE_WORKER, 279, // 273
0x22, 2, ROLE_WORKER, 279, // 274
0x22, 3, ROLE_WORKER, 279, // 275
0x22, 4, ROLE_WORKER, 279, // 276
0x22, 5, ROLE_WORKER, 279, // 277
0x22, 6, ROLE_WORKER, 279, // 278
0x22, 7, ROLE_SCHEDULER, 515, // 279
0x23, 0, ROLE_WORKER, 287, // 280
0x23, 1, ROLE_WORKER, 287, // 281
0x23, 2, ROLE_WORKER, 287, // 282
0x23, 3, ROLE_WORKER, 287, // 283
0x23, 4, ROLE_WORKER, 287, // 284
0x23, 5, ROLE_WORKER, 287, // 285
0x23, 6, ROLE_WORKER, 287, // 286
0x23, 7, ROLE_SCHEDULER, 515, // 287
// -------------------------------------------
0x24, 0, ROLE_WORKER, 295, // 288
0x24, 1, ROLE_WORKER, 295, // 289
0x24, 2, ROLE_WORKER, 295, // 290
0x24, 3, ROLE_WORKER, 295, // 291
0x24, 4, ROLE_WORKER, 295, // 292
0x24, 5, ROLE_WORKER, 295, // 293
0x24, 6, ROLE_WORKER, 295, // 294
0x24, 7, ROLE_SCHEDULER, 516, // 295
0x25, 0, ROLE_WORKER, 303, // 296
0x25, 1, ROLE_WORKER, 303, // 297
0x25, 2, ROLE_WORKER, 303, // 298
0x25, 3, ROLE_WORKER, 303, // 299
0x25, 4, ROLE_WORKER, 303, // 300
0x25, 5, ROLE_WORKER, 303, // 301
0x25, 6, ROLE_WORKER, 303, // 302
0x25, 7, ROLE_SCHEDULER, 516, // 303
0x26, 0, ROLE_WORKER, 311, // 304
0x26, 1, ROLE_WORKER, 311, // 305
0x26, 2, ROLE_WORKER, 311, // 306
0x26, 3, ROLE_WORKER, 311, // 307
0x26, 4, ROLE_WORKER, 311, // 308
0x26, 5, ROLE_WORKER, 311, // 309
0x26, 6, ROLE_WORKER, 311, // 310
0x26, 7, ROLE_SCHEDULER, 516, // 311
0x27, 0, ROLE_WORKER, 319, // 312
0x27, 1, ROLE_WORKER, 319, // 313
0x27, 2, ROLE_WORKER, 319, // 314
0x27, 3, ROLE_WORKER, 319, // 315
0x27, 4, ROLE_WORKER, 319, // 316
0x27, 5, ROLE_WORKER, 319, // 317
0x27, 6, ROLE_WORKER, 319, // 318
0x27, 7, ROLE_SCHEDULER, 516, // 319
0x28, 0, ROLE_WORKER, 327, // 320
0x28, 1, ROLE_WORKER, 327, // 321
0x28, 2, ROLE_WORKER, 327, // 322
0x28, 3, ROLE_WORKER, 327, // 323
0x28, 4, ROLE_WORKER, 327, // 324
0x28, 5, ROLE_WORKER, 327, // 325
0x28, 6, ROLE_WORKER, 327, // 326
0x28, 7, ROLE_SCHEDULER, 516, // 327
0x29, 0, ROLE_WORKER, 335, // 328
0x29, 1, ROLE_WORKER, 335, // 329
0x29, 2, ROLE_WORKER, 335, // 330
0x29, 3, ROLE_WORKER, 335, // 331
0x29, 4, ROLE_WORKER, 335, // 332
0x29, 5, ROLE_WORKER, 335, // 333
0x29, 6, ROLE_WORKER, 335, // 334
0x29, 7, ROLE_SCHEDULER, 516, // 335
0x2A, 0, ROLE_WORKER, 343, // 336
0x2A, 1, ROLE_WORKER, 343, // 337
0x2A, 2, ROLE_WORKER, 343, // 338
0x2A, 3, ROLE_WORKER, 343, // 339
0x2A, 4, ROLE_WORKER, 343, // 340
0x2A, 5, ROLE_WORKER, 343, // 341
0x2A, 6, ROLE_WORKER, 343, // 342
0x2A, 7, ROLE_SCHEDULER, 516, // 343
0x2B, 0, ROLE_WORKER, 351, // 344
0x2B, 1, ROLE_WORKER, 351, // 345
0x2B, 2, ROLE_WORKER, 351, // 346
0x2B, 3, ROLE_WORKER, 351, // 347
0x2B, 4, ROLE_WORKER, 351, // 348
0x2B, 5, ROLE_WORKER, 351, // 349
0x2B, 6, ROLE_WORKER, 351, // 350
0x2B, 7, ROLE_SCHEDULER, 516, // 351
0x2C, 0, ROLE_WORKER, 359, // 352
0x2C, 1, ROLE_WORKER, 359, // 353
0x2C, 2, ROLE_WORKER, 359, // 354
0x2C, 3, ROLE_WORKER, 359, // 355
0x2C, 4, ROLE_WORKER, 359, // 356
0x2C, 5, ROLE_WORKER, 359, // 357
0x2C, 6, ROLE_WORKER, 359, // 358
0x2C, 7, ROLE_SCHEDULER, 516, // 359
// -------------------------------------------
0x2D, 0, ROLE_WORKER, 367, // 360
0x2D, 1, ROLE_WORKER, 367, // 361
0x2D, 2, ROLE_WORKER, 367, // 362
0x2D, 3, ROLE_WORKER, 367, // 363
0x2D, 4, ROLE_WORKER, 367, // 364
0x2D, 5, ROLE_WORKER, 367, // 365
0x2D, 6, ROLE_WORKER, 367, // 366
0x2D, 7, ROLE_SCHEDULER, 517, // 367
0x2E, 0, ROLE_WORKER, 375, // 368
0x2E, 1, ROLE_WORKER, 375, // 369
0x2E, 2, ROLE_WORKER, 375, // 370
0x2E, 3, ROLE_WORKER, 375, // 371
0x2E, 4, ROLE_WORKER, 375, // 372
0x2E, 5, ROLE_WORKER, 375, // 373
0x2E, 6, ROLE_WORKER, 375, // 374
0x2E, 7, ROLE_SCHEDULER, 517, // 375
0x2F, 0, ROLE_WORKER, 383, // 376
0x2F, 1, ROLE_WORKER, 383, // 377
0x2F, 2, ROLE_WORKER, 383, // 378
0x2F, 3, ROLE_WORKER, 383, // 379
0x2F, 4, ROLE_WORKER, 383, // 380
0x2F, 5, ROLE_WORKER, 383, // 381
0x2F, 6, ROLE_WORKER, 383, // 382
0x2F, 7, ROLE_SCHEDULER, 517, // 383
0x30, 0, ROLE_WORKER, 391, // 384
0x30, 1, ROLE_WORKER, 391, // 385
0x30, 2, ROLE_WORKER, 391, // 386
0x30, 3, ROLE_WORKER, 391, // 387
0x30, 4, ROLE_WORKER, 391, // 388
0x30, 5, ROLE_WORKER, 391, // 389
0x30, 6, ROLE_WORKER, 391, // 390
0x30, 7, ROLE_SCHEDULER, 517, // 391
0x31, 0, ROLE_WORKER, 399, // 392
0x31, 1, ROLE_WORKER, 399, // 393
0x31, 2, ROLE_WORKER, 399, // 394
0x31, 3, ROLE_WORKER, 399, // 395
0x31, 4, ROLE_WORKER, 399, // 396
0x31, 5, ROLE_WORKER, 399, // 397
0x31, 6, ROLE_WORKER, 399, // 398
0x31, 7, ROLE_SCHEDULER, 517, // 399
0x32, 0, ROLE_WORKER, 407, // 400
0x32, 1, ROLE_WORKER, 407, // 401
0x32, 2, ROLE_WORKER, 407, // 402
0x32, 3, ROLE_WORKER, 407, // 403
0x32, 4, ROLE_WORKER, 407, // 404
0x32, 5, ROLE_WORKER, 407, // 405
0x32, 6, ROLE_WORKER, 407, // 406
0x32, 7, ROLE_SCHEDULER, 517, // 407
0x33, 0, ROLE_WORKER, 415, // 408
0x33, 1, ROLE_WORKER, 415, // 409
0x33, 2, ROLE_WORKER, 415, // 410
0x33, 3, ROLE_WORKER, 415, // 411
0x33, 4, ROLE_WORKER, 415, // 412
0x33, 5, ROLE_WORKER, 415, // 413
0x33, 6, ROLE_WORKER, 415, // 414
0x33, 7, ROLE_SCHEDULER, 517, // 415
0x34, 0, ROLE_WORKER, 423, // 416
0x34, 1, ROLE_WORKER, 423, // 417
0x34, 2, ROLE_WORKER, 423, // 418
0x34, 3, ROLE_WORKER, 423, // 419
0x34, 4, ROLE_WORKER, 423, // 420
0x34, 5, ROLE_WORKER, 423, // 421
0x34, 6, ROLE_WORKER, 423, // 422
0x34, 7, ROLE_SCHEDULER, 517, // 423
0x35, 0, ROLE_WORKER, 431, // 424
0x35, 1, ROLE_WORKER, 431, // 425
0x35, 2, ROLE_WORKER, 431, // 426
0x35, 3, ROLE_WORKER, 431, // 427
0x35, 4, ROLE_WORKER, 431, // 428
0x35, 5, ROLE_WORKER, 431, // 429
0x35, 6, ROLE_WORKER, 431, // 430
0x35, 7, ROLE_SCHEDULER, 517, // 431
// -------------------------------------------
0x36, 0, ROLE_WORKER, 439, // 432
0x36, 1, ROLE_WORKER, 439, // 433
0x36, 2, ROLE_WORKER, 439, // 434
0x36, 3, ROLE_WORKER, 439, // 435
0x36, 4, ROLE_WORKER, 439, // 436
0x36, 5, ROLE_WORKER, 439, // 437
0x36, 6, ROLE_WORKER, 439, // 438
0x36, 7, ROLE_SCHEDULER, 518, // 439
0x37, 0, ROLE_WORKER, 447, // 440
0x37, 1, ROLE_WORKER, 447, // 441
0x37, 2, ROLE_WORKER, 447, // 442
0x37, 3, ROLE_WORKER, 447, // 443
0x37, 4, ROLE_WORKER, 447, // 444
0x37, 5, ROLE_WORKER, 447, // 445
0x37, 6, ROLE_WORKER, 447, // 446
0x37, 7, ROLE_SCHEDULER, 518, // 447
0x38, 0, ROLE_WORKER, 455, // 448
0x38, 1, ROLE_WORKER, 455, // 449
0x38, 2, ROLE_WORKER, 455, // 450
0x38, 3, ROLE_WORKER, 455, // 451
0x38, 4, ROLE_WORKER, 455, // 452
0x38, 5, ROLE_WORKER, 455, // 453
0x38, 6, ROLE_WORKER, 455, // 454
0x38, 7, ROLE_SCHEDULER, 518, // 455
0x39, 0, ROLE_WORKER, 463, // 456
0x39, 1, ROLE_WORKER, 463, // 457
0x39, 2, ROLE_WORKER, 463, // 458
0x39, 3, ROLE_WORKER, 463, // 459
0x39, 4, ROLE_WORKER, 463, // 460
0x39, 5, ROLE_WORKER, 463, // 461
0x39, 6, ROLE_WORKER, 463, // 462
0x39, 7, ROLE_SCHEDULER, 518, // 463
0x3A, 0, ROLE_WORKER, 471, // 464
0x3A, 1, ROLE_WORKER, 471, // 465
0x3A, 2, ROLE_WORKER, 471, // 466
0x3A, 3, ROLE_WORKER, 471, // 467
0x3A, 4, ROLE_WORKER, 471, // 468
0x3A, 5, ROLE_WORKER, 471, // 469
0x3A, 6, ROLE_WORKER, 471, // 470
0x3A, 7, ROLE_SCHEDULER, 518, // 471
0x3B, 0, ROLE_WORKER, 479, // 472
0x3B, 1, ROLE_WORKER, 479, // 473
0x3B, 2, ROLE_WORKER, 479, // 474
0x3B, 3, ROLE_WORKER, 479, // 475
0x3B, 4, ROLE_WORKER, 479, // 476
0x3B, 5, ROLE_WORKER, 479, // 477
0x3B, 6, ROLE_WORKER, 479, // 478
0x3B, 7, ROLE_SCHEDULER, 518, // 479
0x3C, 0, ROLE_WORKER, 487, // 480
0x3C, 1, ROLE_WORKER, 487, // 481
0x3C, 2, ROLE_WORKER, 487, // 482
0x3C, 3, ROLE_WORKER, 487, // 483
0x3C, 4, ROLE_WORKER, 487, // 484
0x3C, 5, ROLE_WORKER, 487, // 485
0x3C, 6, ROLE_WORKER, 487, // 486
0x3C, 7, ROLE_SCHEDULER, 518, // 487
0x3D, 0, ROLE_WORKER, 495, // 488
0x3D, 1, ROLE_WORKER, 495, // 489
0x3D, 2, ROLE_WORKER, 495, // 490
0x3D, 3, ROLE_WORKER, 495, // 491
0x3D, 4, ROLE_WORKER, 495, // 492
0x3D, 5, ROLE_WORKER, 495, // 493
0x3D, 6, ROLE_WORKER, 495, // 494
0x3D, 7, ROLE_SCHEDULER, 518, // 495
0x3E, 0, ROLE_WORKER, 503, // 496
0x3E, 1, ROLE_WORKER, 503, // 497
0x3E, 2, ROLE_WORKER, 503, // 498
0x3E, 3, ROLE_WORKER, 503, // 499
0x3E, 4, ROLE_WORKER, 503, // 500
0x3E, 5, ROLE_WORKER, 503, // 501
0x3E, 6, ROLE_WORKER, 503, // 502
0x3E, 7, ROLE_SCHEDULER, 518, // 503
0x3F, 0, ROLE_WORKER, 511, // 504
0x3F, 1, ROLE_WORKER, 511, // 505
0x3F, 2, ROLE_WORKER, 511, // 506
0x3F, 3, ROLE_WORKER, 511, // 507
0x3F, 4, ROLE_WORKER, 511, // 508
0x3F, 5, ROLE_WORKER, 511, // 509
0x3F, 6, ROLE_WORKER, 511, // 510
0x3F, 7, ROLE_SCHEDULER, 518, // 511
// -------------------------------------------
0x4B, 0, ROLE_SCHEDULER, 519, // 512
0x4B, 1, ROLE_SCHEDULER, 519, // 513
0x4B, 2, ROLE_SCHEDULER, 519, // 514
0x4B, 3, ROLE_SCHEDULER, 519, // 515
0x6B, 0, ROLE_SCHEDULER, 519, // 516
0x6B, 1, ROLE_SCHEDULER, 519, // 517
0x6B, 2, ROLE_SCHEDULER, 519, // 518
0x6B, 3, ROLE_SCHEDULER, -1); // 519
// ======================================================================
case PR_CFG_520_HET_HIER2:
return pr_init(520,
0x00, 0, ROLE_WORKER, 512, // 0
0x00, 1, ROLE_WORKER, 512, // 1
0x00, 2, ROLE_WORKER, 512, // 2
0x00, 3, ROLE_WORKER, 512, // 3
0x00, 4, ROLE_WORKER, 512, // 4
0x00, 5, ROLE_WORKER, 512, // 5
0x00, 6, ROLE_WORKER, 512, // 6
0x00, 7, ROLE_WORKER, 512, // 7
0x01, 0, ROLE_WORKER, 512, // 8
0x01, 1, ROLE_WORKER, 512, // 9
0x01, 2, ROLE_WORKER, 512, // 10
0x01, 3, ROLE_WORKER, 512, // 11
0x01, 4, ROLE_WORKER, 512, // 12
0x01, 5, ROLE_WORKER, 512, // 13
0x01, 6, ROLE_WORKER, 512, // 14
0x01, 7, ROLE_WORKER, 512, // 15
0x02, 0, ROLE_WORKER, 512, // 16
0x02, 1, ROLE_WORKER, 512, // 17
0x02, 2, ROLE_WORKER, 512, // 18
0x02, 3, ROLE_WORKER, 512, // 19
0x02, 4, ROLE_WORKER, 512, // 20
0x02, 5, ROLE_WORKER, 512, // 21
0x02, 6, ROLE_WORKER, 512, // 22
0x02, 7, ROLE_WORKER, 512, // 23
0x03, 0, ROLE_WORKER, 512, // 24
0x03, 1, ROLE_WORKER, 512, // 25
0x03, 2, ROLE_WORKER, 512, // 26
0x03, 3, ROLE_WORKER, 512, // 27
0x03, 4, ROLE_WORKER, 512, // 28
0x03, 5, ROLE_WORKER, 512, // 29
0x03, 6, ROLE_WORKER, 512, // 30
0x03, 7, ROLE_WORKER, 512, // 31
0x04, 0, ROLE_WORKER, 512, // 32
0x04, 1, ROLE_WORKER, 512, // 33
0x04, 2, ROLE_WORKER, 512, // 34
0x04, 3, ROLE_WORKER, 512, // 35
0x04, 4, ROLE_WORKER, 512, // 36
0x04, 5, ROLE_WORKER, 512, // 37
0x04, 6, ROLE_WORKER, 512, // 38
0x04, 7, ROLE_WORKER, 512, // 39
0x05, 0, ROLE_WORKER, 512, // 40
0x05, 1, ROLE_WORKER, 512, // 41
0x05, 2, ROLE_WORKER, 512, // 42
0x05, 3, ROLE_WORKER, 512, // 43
0x05, 4, ROLE_WORKER, 512, // 44
0x05, 5, ROLE_WORKER, 512, // 45
0x05, 6, ROLE_WORKER, 512, // 46
0x05, 7, ROLE_WORKER, 512, // 47
0x06, 0, ROLE_WORKER, 512, // 48
0x06, 1, ROLE_WORKER, 512, // 49
0x06, 2, ROLE_WORKER, 512, // 50
0x06, 3, ROLE_WORKER, 512, // 51
0x06, 4, ROLE_WORKER, 512, // 52
0x06, 5, ROLE_WORKER, 512, // 53
0x06, 6, ROLE_WORKER, 512, // 54
0x06, 7, ROLE_WORKER, 512, // 55
0x07, 0, ROLE_WORKER, 512, // 56
0x07, 1, ROLE_WORKER, 512, // 57
0x07, 2, ROLE_WORKER, 512, // 58
0x07, 3, ROLE_WORKER, 512, // 59
0x07, 4, ROLE_WORKER, 512, // 60
0x07, 5, ROLE_WORKER, 512, // 61
0x07, 6, ROLE_WORKER, 512, // 62
0x07, 7, ROLE_WORKER, 512, // 63
0x08, 0, ROLE_WORKER, 512, // 64
0x08, 1, ROLE_WORKER, 512, // 65
0x08, 2, ROLE_WORKER, 512, // 66
0x08, 3, ROLE_WORKER, 512, // 67
0x08, 4, ROLE_WORKER, 512, // 68
0x08, 5, ROLE_WORKER, 512, // 69
0x08, 6, ROLE_WORKER, 512, // 70
0x08, 7, ROLE_WORKER, 512, // 71
0x09, 0, ROLE_WORKER, 512, // 72
0x09, 1, ROLE_WORKER, 513, // 73
0x09, 2, ROLE_WORKER, 513, // 74
0x09, 3, ROLE_WORKER, 513, // 75
0x09, 4, ROLE_WORKER, 513, // 76
0x09, 5, ROLE_WORKER, 513, // 77
0x09, 6, ROLE_WORKER, 513, // 78
0x09, 7, ROLE_WORKER, 513, // 79
0x0A, 0, ROLE_WORKER, 513, // 80
0x0A, 1, ROLE_WORKER, 513, // 81
0x0A, 2, ROLE_WORKER, 513, // 82
0x0A, 3, ROLE_WORKER, 513, // 83
0x0A, 4, ROLE_WORKER, 513, // 84
0x0A, 5, ROLE_WORKER, 513, // 85
0x0A, 6, ROLE_WORKER, 513, // 86
0x0A, 7, ROLE_WORKER, 513, // 87
0x0B, 0, ROLE_WORKER, 513, // 88
0x0B, 1, ROLE_WORKER, 513, // 89
0x0B, 2, ROLE_WORKER, 513, // 90
0x0B, 3, ROLE_WORKER, 513, // 91
0x0B, 4, ROLE_WORKER, 513, // 92
0x0B, 5, ROLE_WORKER, 513, // 93
0x0B, 6, ROLE_WORKER, 513, // 94
0x0B, 7, ROLE_WORKER, 513, // 95
0x0C, 0, ROLE_WORKER, 513, // 96
0x0C, 1, ROLE_WORKER, 513, // 97
0x0C, 2, ROLE_WORKER, 513, // 98
0x0C, 3, ROLE_WORKER, 513, // 99
0x0C, 4, ROLE_WORKER, 513, // 100
0x0C, 5, ROLE_WORKER, 513, // 101
0x0C, 6, ROLE_WORKER, 513, // 102
0x0C, 7, ROLE_WORKER, 513, // 103
0x0D, 0, ROLE_WORKER, 513, // 104
0x0D, 1, ROLE_WORKER, 513, // 105
0x0D, 2, ROLE_WORKER, 513, // 106
0x0D, 3, ROLE_WORKER, 513, // 107
0x0D, 4, ROLE_WORKER, 513, // 108
0x0D, 5, ROLE_WORKER, 513, // 109
0x0D, 6, ROLE_WORKER, 513, // 110
0x0D, 7, ROLE_WORKER, 513, // 111
0x0E, 0, ROLE_WORKER, 513, // 112
0x0E, 1, ROLE_WORKER, 513, // 113
0x0E, 2, ROLE_WORKER, 513, // 114
0x0E, 3, ROLE_WORKER, 513, // 115
0x0E, 4, ROLE_WORKER, 513, // 116
0x0E, 5, ROLE_WORKER, 513, // 117
0x0E, 6, ROLE_WORKER, 513, // 118
0x0E, 7, ROLE_WORKER, 513, // 119
0x0F, 0, ROLE_WORKER, 513, // 120
0x0F, 1, ROLE_WORKER, 513, // 121
0x0F, 2, ROLE_WORKER, 513, // 122
0x0F, 3, ROLE_WORKER, 513, // 123
0x0F, 4, ROLE_WORKER, 513, // 124
0x0F, 5, ROLE_WORKER, 513, // 125
0x0F, 6, ROLE_WORKER, 513, // 126
0x0F, 7, ROLE_WORKER, 513, // 127
0x10, 0, ROLE_WORKER, 513, // 128
0x10, 1, ROLE_WORKER, 513, // 129
0x10, 2, ROLE_WORKER, 513, // 130
0x10, 3, ROLE_WORKER, 513, // 131
0x10, 4, ROLE_WORKER, 513, // 132
0x10, 5, ROLE_WORKER, 513, // 133
0x10, 6, ROLE_WORKER, 513, // 134
0x10, 7, ROLE_WORKER, 513, // 135
0x11, 0, ROLE_WORKER, 513, // 136
0x11, 1, ROLE_WORKER, 513, // 137
0x11, 2, ROLE_WORKER, 513, // 138
0x11, 3, ROLE_WORKER, 513, // 139
0x11, 4, ROLE_WORKER, 513, // 140
0x11, 5, ROLE_WORKER, 513, // 141
0x11, 6, ROLE_WORKER, 513, // 142
0x11, 7, ROLE_WORKER, 513, // 143
0x12, 0, ROLE_WORKER, 513, // 144
0x12, 1, ROLE_WORKER, 513, // 145
0x12, 2, ROLE_WORKER, 514, // 146
0x12, 3, ROLE_WORKER, 514, // 147
0x12, 4, ROLE_WORKER, 514, // 148
0x12, 5, ROLE_WORKER, 514, // 149
0x12, 6, ROLE_WORKER, 514, // 150
0x12, 7, ROLE_WORKER, 514, // 151
0x13, 0, ROLE_WORKER, 514, // 152
0x13, 1, ROLE_WORKER, 514, // 153
0x13, 2, ROLE_WORKER, 514, // 154
0x13, 3, ROLE_WORKER, 514, // 155
0x13, 4, ROLE_WORKER, 514, // 156
0x13, 5, ROLE_WORKER, 514, // 157
0x13, 6, ROLE_WORKER, 514, // 158
0x13, 7, ROLE_WORKER, 514, // 159
0x14, 0, ROLE_WORKER, 514, // 160
0x14, 1, ROLE_WORKER, 514, // 161
0x14, 2, ROLE_WORKER, 514, // 162
0x14, 3, ROLE_WORKER, 514, // 163
0x14, 4, ROLE_WORKER, 514, // 164
0x14, 5, ROLE_WORKER, 514, // 165
0x14, 6, ROLE_WORKER, 514, // 166
0x14, 7, ROLE_WORKER, 514, // 167
0x15, 0, ROLE_WORKER, 514, // 168
0x15, 1, ROLE_WORKER, 514, // 169
0x15, 2, ROLE_WORKER, 514, // 170
0x15, 3, ROLE_WORKER, 514, // 171
0x15, 4, ROLE_WORKER, 514, // 172
0x15, 5, ROLE_WORKER, 514, // 173
0x15, 6, ROLE_WORKER, 514, // 174
0x15, 7, ROLE_WORKER, 514, // 175
0x16, 0, ROLE_WORKER, 514, // 176
0x16, 1, ROLE_WORKER, 514, // 177
0x16, 2, ROLE_WORKER, 514, // 178
0x16, 3, ROLE_WORKER, 514, // 179
0x16, 4, ROLE_WORKER, 514, // 180
0x16, 5, ROLE_WORKER, 514, // 181
0x16, 6, ROLE_WORKER, 514, // 182
0x16, 7, ROLE_WORKER, 514, // 183
0x17, 0, ROLE_WORKER, 514, // 184
0x17, 1, ROLE_WORKER, 514, // 185
0x17, 2, ROLE_WORKER, 514, // 186
0x17, 3, ROLE_WORKER, 514, // 187
0x17, 4, ROLE_WORKER, 514, // 188
0x17, 5, ROLE_WORKER, 514, // 189
0x17, 6, ROLE_WORKER, 514, // 190
0x17, 7, ROLE_WORKER, 514, // 191
0x18, 0, ROLE_WORKER, 514, // 192
0x18, 1, ROLE_WORKER, 514, // 193
0x18, 2, ROLE_WORKER, 514, // 194
0x18, 3, ROLE_WORKER, 514, // 195
0x18, 4, ROLE_WORKER, 514, // 196
0x18, 5, ROLE_WORKER, 514, // 197
0x18, 6, ROLE_WORKER, 514, // 198
0x18, 7, ROLE_WORKER, 514, // 199
0x19, 0, ROLE_WORKER, 514, // 200
0x19, 1, ROLE_WORKER, 514, // 201
0x19, 2, ROLE_WORKER, 514, // 202
0x19, 3, ROLE_WORKER, 514, // 203
0x19, 4, ROLE_WORKER, 514, // 204
0x19, 5, ROLE_WORKER, 514, // 205
0x19, 6, ROLE_WORKER, 514, // 206
0x19, 7, ROLE_WORKER, 514, // 207
0x1A, 0, ROLE_WORKER, 514, // 208
0x1A, 1, ROLE_WORKER, 514, // 209
0x1A, 2, ROLE_WORKER, 514, // 210
0x1A, 3, ROLE_WORKER, 514, // 211
0x1A, 4, ROLE_WORKER, 514, // 212
0x1A, 5, ROLE_WORKER, 514, // 213
0x1A, 6, ROLE_WORKER, 514, // 214
0x1A, 7, ROLE_WORKER, 514, // 215
0x1B, 0, ROLE_WORKER, 514, // 216
0x1B, 1, ROLE_WORKER, 514, // 217
0x1B, 2, ROLE_WORKER, 514, // 218
0x1B, 3, ROLE_WORKER, 515, // 219
0x1B, 4, ROLE_WORKER, 515, // 220
0x1B, 5, ROLE_WORKER, 515, // 221
0x1B, 6, ROLE_WORKER, 515, // 222
0x1B, 7, ROLE_WORKER, 515, // 223
0x1C, 0, ROLE_WORKER, 515, // 224
0x1C, 1, ROLE_WORKER, 515, // 225
0x1C, 2, ROLE_WORKER, 515, // 226
0x1C, 3, ROLE_WORKER, 515, // 227
0x1C, 4, ROLE_WORKER, 515, // 228
0x1C, 5, ROLE_WORKER, 515, // 229
0x1C, 6, ROLE_WORKER, 515, // 230
0x1C, 7, ROLE_WORKER, 515, // 231
0x1D, 0, ROLE_WORKER, 515, // 232
0x1D, 1, ROLE_WORKER, 515, // 233
0x1D, 2, ROLE_WORKER, 515, // 234
0x1D, 3, ROLE_WORKER, 515, // 235
0x1D, 4, ROLE_WORKER, 515, // 236
0x1D, 5, ROLE_WORKER, 515, // 237
0x1D, 6, ROLE_WORKER, 515, // 238
0x1D, 7, ROLE_WORKER, 515, // 239
0x1E, 0, ROLE_WORKER, 515, // 240
0x1E, 1, ROLE_WORKER, 515, // 241
0x1E, 2, ROLE_WORKER, 515, // 242
0x1E, 3, ROLE_WORKER, 515, // 243
0x1E, 4, ROLE_WORKER, 515, // 244
0x1E, 5, ROLE_WORKER, 515, // 245
0x1E, 6, ROLE_WORKER, 515, // 246
0x1E, 7, ROLE_WORKER, 515, // 247
0x1F, 0, ROLE_WORKER, 515, // 248
0x1F, 1, ROLE_WORKER, 515, // 249
0x1F, 2, ROLE_WORKER, 515, // 250
0x1F, 3, ROLE_WORKER, 515, // 251
0x1F, 4, ROLE_WORKER, 515, // 252
0x1F, 5, ROLE_WORKER, 515, // 253
0x1F, 6, ROLE_WORKER, 515, // 254
0x1F, 7, ROLE_WORKER, 515, // 255
0x20, 0, ROLE_WORKER, 515, // 256
0x20, 1, ROLE_WORKER, 515, // 257
0x20, 2, ROLE_WORKER, 515, // 258
0x20, 3, ROLE_WORKER, 515, // 259
0x20, 4, ROLE_WORKER, 515, // 260
0x20, 5, ROLE_WORKER, 515, // 261
0x20, 6, ROLE_WORKER, 515, // 262
0x20, 7, ROLE_WORKER, 515, // 263
0x21, 0, ROLE_WORKER, 515, // 264
0x21, 1, ROLE_WORKER, 515, // 265
0x21, 2, ROLE_WORKER, 515, // 266
0x21, 3, ROLE_WORKER, 515, // 267
0x21, 4, ROLE_WORKER, 515, // 268
0x21, 5, ROLE_WORKER, 515, // 269
0x21, 6, ROLE_WORKER, 515, // 270
0x21, 7, ROLE_WORKER, 515, // 271
0x22, 0, ROLE_WORKER, 515, // 272
0x22, 1, ROLE_WORKER, 515, // 273
0x22, 2, ROLE_WORKER, 515, // 274
0x22, 3, ROLE_WORKER, 515, // 275
0x22, 4, ROLE_WORKER, 515, // 276
0x22, 5, ROLE_WORKER, 515, // 277
0x22, 6, ROLE_WORKER, 515, // 278
0x22, 7, ROLE_WORKER, 515, // 279
0x23, 0, ROLE_WORKER, 515, // 280
0x23, 1, ROLE_WORKER, 515, // 281
0x23, 2, ROLE_WORKER, 515, // 282
0x23, 3, ROLE_WORKER, 515, // 283
0x23, 4, ROLE_WORKER, 515, // 284
0x23, 5, ROLE_WORKER, 515, // 285
0x23, 6, ROLE_WORKER, 515, // 286
0x23, 7, ROLE_WORKER, 515, // 287
0x24, 0, ROLE_WORKER, 515, // 288
0x24, 1, ROLE_WORKER, 515, // 289
0x24, 2, ROLE_WORKER, 515, // 290
0x24, 3, ROLE_WORKER, 515, // 291
0x24, 4, ROLE_WORKER, 516, // 292
0x24, 5, ROLE_WORKER, 516, // 293
0x24, 6, ROLE_WORKER, 516, // 294
0x24, 7, ROLE_WORKER, 516, // 295
0x25, 0, ROLE_WORKER, 516, // 296
0x25, 1, ROLE_WORKER, 516, // 297
0x25, 2, ROLE_WORKER, 516, // 298
0x25, 3, ROLE_WORKER, 516, // 299
0x25, 4, ROLE_WORKER, 516, // 300
0x25, 5, ROLE_WORKER, 516, // 301
0x25, 6, ROLE_WORKER, 516, // 302
0x25, 7, ROLE_WORKER, 516, // 303
0x26, 0, ROLE_WORKER, 516, // 304
0x26, 1, ROLE_WORKER, 516, // 305
0x26, 2, ROLE_WORKER, 516, // 306
0x26, 3, ROLE_WORKER, 516, // 307
0x26, 4, ROLE_WORKER, 516, // 308
0x26, 5, ROLE_WORKER, 516, // 309
0x26, 6, ROLE_WORKER, 516, // 310
0x26, 7, ROLE_WORKER, 516, // 311
0x27, 0, ROLE_WORKER, 516, // 312
0x27, 1, ROLE_WORKER, 516, // 313
0x27, 2, ROLE_WORKER, 516, // 314
0x27, 3, ROLE_WORKER, 516, // 315
0x27, 4, ROLE_WORKER, 516, // 316
0x27, 5, ROLE_WORKER, 516, // 317
0x27, 6, ROLE_WORKER, 516, // 318
0x27, 7, ROLE_WORKER, 516, // 319
0x28, 0, ROLE_WORKER, 516, // 320
0x28, 1, ROLE_WORKER, 516, // 321
0x28, 2, ROLE_WORKER, 516, // 322
0x28, 3, ROLE_WORKER, 516, // 323
0x28, 4, ROLE_WORKER, 516, // 324
0x28, 5, ROLE_WORKER, 516, // 325
0x28, 6, ROLE_WORKER, 516, // 326
0x28, 7, ROLE_WORKER, 516, // 327
0x29, 0, ROLE_WORKER, 516, // 328
0x29, 1, ROLE_WORKER, 516, // 329
0x29, 2, ROLE_WORKER, 516, // 330
0x29, 3, ROLE_WORKER, 516, // 331
0x29, 4, ROLE_WORKER, 516, // 332
0x29, 5, ROLE_WORKER, 516, // 333
0x29, 6, ROLE_WORKER, 516, // 334
0x29, 7, ROLE_WORKER, 516, // 335
0x2A, 0, ROLE_WORKER, 516, // 336
0x2A, 1, ROLE_WORKER, 516, // 337
0x2A, 2, ROLE_WORKER, 516, // 338
0x2A, 3, ROLE_WORKER, 516, // 339
0x2A, 4, ROLE_WORKER, 516, // 340
0x2A, 5, ROLE_WORKER, 516, // 341
0x2A, 6, ROLE_WORKER, 516, // 342
0x2A, 7, ROLE_WORKER, 516, // 343
0x2B, 0, ROLE_WORKER, 516, // 344
0x2B, 1, ROLE_WORKER, 516, // 345
0x2B, 2, ROLE_WORKER, 516, // 346
0x2B, 3, ROLE_WORKER, 516, // 347
0x2B, 4, ROLE_WORKER, 516, // 348
0x2B, 5, ROLE_WORKER, 516, // 349
0x2B, 6, ROLE_WORKER, 516, // 350
0x2B, 7, ROLE_WORKER, 516, // 351
0x2C, 0, ROLE_WORKER, 516, // 352
0x2C, 1, ROLE_WORKER, 516, // 353
0x2C, 2, ROLE_WORKER, 516, // 354
0x2C, 3, ROLE_WORKER, 516, // 355
0x2C, 4, ROLE_WORKER, 516, // 356
0x2C, 5, ROLE_WORKER, 516, // 357
0x2C, 6, ROLE_WORKER, 516, // 358
0x2C, 7, ROLE_WORKER, 516, // 359
0x2D, 0, ROLE_WORKER, 516, // 360
0x2D, 1, ROLE_WORKER, 516, // 361
0x2D, 2, ROLE_WORKER, 516, // 362
0x2D, 3, ROLE_WORKER, 516, // 363
0x2D, 4, ROLE_WORKER, 516, // 364
0x2D, 5, ROLE_WORKER, 517, // 365
0x2D, 6, ROLE_WORKER, 517, // 366
0x2D, 7, ROLE_WORKER, 517, // 367
0x2E, 0, ROLE_WORKER, 517, // 368
0x2E, 1, ROLE_WORKER, 517, // 369
0x2E, 2, ROLE_WORKER, 517, // 370
0x2E, 3, ROLE_WORKER, 517, // 371
0x2E, 4, ROLE_WORKER, 517, // 372
0x2E, 5, ROLE_WORKER, 517, // 373
0x2E, 6, ROLE_WORKER, 517, // 374
0x2E, 7, ROLE_WORKER, 517, // 375
0x2F, 0, ROLE_WORKER, 517, // 376
0x2F, 1, ROLE_WORKER, 517, // 377
0x2F, 2, ROLE_WORKER, 517, // 378
0x2F, 3, ROLE_WORKER, 517, // 379
0x2F, 4, ROLE_WORKER, 517, // 380
0x2F, 5, ROLE_WORKER, 517, // 381
0x2F, 6, ROLE_WORKER, 517, // 382
0x2F, 7, ROLE_WORKER, 517, // 383
0x30, 0, ROLE_WORKER, 517, // 384
0x30, 1, ROLE_WORKER, 517, // 385
0x30, 2, ROLE_WORKER, 517, // 386
0x30, 3, ROLE_WORKER, 517, // 387
0x30, 4, ROLE_WORKER, 517, // 388
0x30, 5, ROLE_WORKER, 517, // 389
0x30, 6, ROLE_WORKER, 517, // 390
0x30, 7, ROLE_WORKER, 517, // 391
0x31, 0, ROLE_WORKER, 517, // 392
0x31, 1, ROLE_WORKER, 517, // 393
0x31, 2, ROLE_WORKER, 517, // 394
0x31, 3, ROLE_WORKER, 517, // 395
0x31, 4, ROLE_WORKER, 517, // 396
0x31, 5, ROLE_WORKER, 517, // 397
0x31, 6, ROLE_WORKER, 517, // 398
0x31, 7, ROLE_WORKER, 517, // 399
0x32, 0, ROLE_WORKER, 517, // 400
0x32, 1, ROLE_WORKER, 517, // 401
0x32, 2, ROLE_WORKER, 517, // 402
0x32, 3, ROLE_WORKER, 517, // 403
0x32, 4, ROLE_WORKER, 517, // 404
0x32, 5, ROLE_WORKER, 517, // 405
0x32, 6, ROLE_WORKER, 517, // 406
0x32, 7, ROLE_WORKER, 517, // 407
0x33, 0, ROLE_WORKER, 517, // 408
0x33, 1, ROLE_WORKER, 517, // 409
0x33, 2, ROLE_WORKER, 517, // 410
0x33, 3, ROLE_WORKER, 517, // 411
0x33, 4, ROLE_WORKER, 517, // 412
0x33, 5, ROLE_WORKER, 517, // 413
0x33, 6, ROLE_WORKER, 517, // 414
0x33, 7, ROLE_WORKER, 517, // 415
0x34, 0, ROLE_WORKER, 517, // 416
0x34, 1, ROLE_WORKER, 517, // 417
0x34, 2, ROLE_WORKER, 517, // 418
0x34, 3, ROLE_WORKER, 517, // 419
0x34, 4, ROLE_WORKER, 517, // 420
0x34, 5, ROLE_WORKER, 517, // 421
0x34, 6, ROLE_WORKER, 517, // 422
0x34, 7, ROLE_WORKER, 517, // 423
0x35, 0, ROLE_WORKER, 517, // 424
0x35, 1, ROLE_WORKER, 517, // 425
0x35, 2, ROLE_WORKER, 517, // 426
0x35, 3, ROLE_WORKER, 517, // 427
0x35, 4, ROLE_WORKER, 517, // 428
0x35, 5, ROLE_WORKER, 517, // 429
0x35, 6, ROLE_WORKER, 517, // 430
0x35, 7, ROLE_WORKER, 517, // 431
0x36, 0, ROLE_WORKER, 517, // 432
0x36, 1, ROLE_WORKER, 517, // 433
0x36, 2, ROLE_WORKER, 517, // 434
0x36, 3, ROLE_WORKER, 517, // 435
0x36, 4, ROLE_WORKER, 517, // 436
0x36, 5, ROLE_WORKER, 517, // 437
0x36, 6, ROLE_WORKER, 518, // 438
0x36, 7, ROLE_WORKER, 518, // 439
0x37, 0, ROLE_WORKER, 518, // 440
0x37, 1, ROLE_WORKER, 518, // 441
0x37, 2, ROLE_WORKER, 518, // 442
0x37, 3, ROLE_WORKER, 518, // 443
0x37, 4, ROLE_WORKER, 518, // 444
0x37, 5, ROLE_WORKER, 518, // 445
0x37, 6, ROLE_WORKER, 518, // 446
0x37, 7, ROLE_WORKER, 518, // 447
0x38, 0, ROLE_WORKER, 518, // 448
0x38, 1, ROLE_WORKER, 518, // 449
0x38, 2, ROLE_WORKER, 518, // 450
0x38, 3, ROLE_WORKER, 518, // 451
0x38, 4, ROLE_WORKER, 518, // 452
0x38, 5, ROLE_WORKER, 518, // 453
0x38, 6, ROLE_WORKER, 518, // 454
0x38, 7, ROLE_WORKER, 518, // 455
0x39, 0, ROLE_WORKER, 518, // 456
0x39, 1, ROLE_WORKER, 518, // 457
0x39, 2, ROLE_WORKER, 518, // 458
0x39, 3, ROLE_WORKER, 518, // 459
0x39, 4, ROLE_WORKER, 518, // 460
0x39, 5, ROLE_WORKER, 518, // 461
0x39, 6, ROLE_WORKER, 518, // 462
0x39, 7, ROLE_WORKER, 518, // 463
0x3A, 0, ROLE_WORKER, 518, // 464
0x3A, 1, ROLE_WORKER, 518, // 465
0x3A, 2, ROLE_WORKER, 518, // 466
0x3A, 3, ROLE_WORKER, 518, // 467
0x3A, 4, ROLE_WORKER, 518, // 468
0x3A, 5, ROLE_WORKER, 518, // 469
0x3A, 6, ROLE_WORKER, 518, // 470
0x3A, 7, ROLE_WORKER, 518, // 471
0x3B, 0, ROLE_WORKER, 518, // 472
0x3B, 1, ROLE_WORKER, 518, // 473
0x3B, 2, ROLE_WORKER, 518, // 474
0x3B, 3, ROLE_WORKER, 518, // 475
0x3B, 4, ROLE_WORKER, 518, // 476
0x3B, 5, ROLE_WORKER, 518, // 477
0x3B, 6, ROLE_WORKER, 518, // 478
0x3B, 7, ROLE_WORKER, 518, // 479
0x3C, 0, ROLE_WORKER, 518, // 480
0x3C, 1, ROLE_WORKER, 518, // 481
0x3C, 2, ROLE_WORKER, 518, // 482
0x3C, 3, ROLE_WORKER, 518, // 483
0x3C, 4, ROLE_WORKER, 518, // 484
0x3C, 5, ROLE_WORKER, 518, // 485
0x3C, 6, ROLE_WORKER, 518, // 486
0x3C, 7, ROLE_WORKER, 518, // 487
0x3D, 0, ROLE_WORKER, 518, // 488
0x3D, 1, ROLE_WORKER, 518, // 489
0x3D, 2, ROLE_WORKER, 518, // 490
0x3D, 3, ROLE_WORKER, 518, // 491
0x3D, 4, ROLE_WORKER, 518, // 492
0x3D, 5, ROLE_WORKER, 518, // 493
0x3D, 6, ROLE_WORKER, 518, // 494
0x3D, 7, ROLE_WORKER, 518, // 495
0x3E, 0, ROLE_WORKER, 518, // 496
0x3E, 1, ROLE_WORKER, 518, // 497
0x3E, 2, ROLE_WORKER, 518, // 498
0x3E, 3, ROLE_WORKER, 518, // 499
0x3E, 4, ROLE_WORKER, 518, // 500
0x3E, 5, ROLE_WORKER, 518, // 501
0x3E, 6, ROLE_WORKER, 518, // 502
0x3E, 7, ROLE_WORKER, 518, // 503
0x3F, 0, ROLE_WORKER, 518, // 504
0x3F, 1, ROLE_WORKER, 518, // 505
0x3F, 2, ROLE_WORKER, 518, // 506
0x3F, 3, ROLE_WORKER, 518, // 507
0x3F, 4, ROLE_WORKER, 518, // 508
0x3F, 5, ROLE_WORKER, 518, // 509
0x3F, 6, ROLE_WORKER, 518, // 510
0x3F, 7, ROLE_WORKER, 518, // 511
0x4B, 0, ROLE_SCHEDULER, 519, // 512
0x4B, 1, ROLE_SCHEDULER, 519, // 513
0x4B, 2, ROLE_SCHEDULER, 519, // 514
0x4B, 3, ROLE_SCHEDULER, 519, // 515
0x6B, 0, ROLE_SCHEDULER, 519, // 516
0x6B, 1, ROLE_SCHEDULER, 519, // 517
0x6B, 2, ROLE_SCHEDULER, 519, // 518
0x6B, 3, ROLE_SCHEDULER, -1); // 519
// ======================================================================
case PR_CFG_AUTO_MB:
return pr_auto_init(auto_levels, auto_fanouts);
// ======================================================================
// Special video demos setups follow. Make sure to specify the
// ROLE_VID_INPUT and ROLE_VID_OUTPUT as the 2 last cores. The
// pr_init_internal() function depends on it to modify the number of
// cores appropriately.
// ======================================================================
case PR_VID_2_HET_FLAT:
return pr_init(4,
0x2B, 0, ROLE_WORKER, 1, // 0
0x6B, 0, ROLE_SCHEDULER, -1, // 1
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_3_HET_FLAT:
return pr_init(5,
0x2B, 0, ROLE_WORKER, 2, // 0
0x2B, 1, ROLE_WORKER, 2, // 1
0x6B, 0, ROLE_SCHEDULER, -1, // 2
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_5_HET_FLAT:
return pr_init(7,
0x2B, 0, ROLE_WORKER, 4, // 0
0x2B, 1, ROLE_WORKER, 4, // 1
0x2B, 2, ROLE_WORKER, 4, // 2
0x2B, 3, ROLE_WORKER, 4, // 3
0x6B, 0, ROLE_SCHEDULER, -1, // 4
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_9_HET_FLAT:
return pr_init(11,
0x2B, 0, ROLE_WORKER, 8, // 0
0x2B, 1, ROLE_WORKER, 8, // 1
0x2B, 2, ROLE_WORKER, 8, // 2
0x2B, 3, ROLE_WORKER, 8, // 3
0x2B, 4, ROLE_WORKER, 8, // 4
0x2B, 5, ROLE_WORKER, 8, // 5
0x2B, 6, ROLE_WORKER, 8, // 6
0x2B, 7, ROLE_WORKER, 8, // 7
0x6B, 0, ROLE_SCHEDULER, -1, // 8
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_17_HET_FLAT:
return pr_init(19,
0x1B, 0, ROLE_WORKER, 16, // 0
0x1B, 1, ROLE_WORKER, 16, // 1
0x1B, 2, ROLE_WORKER, 16, // 2
0x1B, 3, ROLE_WORKER, 16, // 3
0x1B, 4, ROLE_WORKER, 16, // 4
0x1B, 5, ROLE_WORKER, 16, // 5
0x1B, 6, ROLE_WORKER, 16, // 6
0x1B, 7, ROLE_WORKER, 16, // 7
0x2B, 0, ROLE_WORKER, 16, // 8
0x2B, 1, ROLE_WORKER, 16, // 9
0x2B, 2, ROLE_WORKER, 16, // 10
0x2B, 3, ROLE_WORKER, 16, // 11
0x2B, 4, ROLE_WORKER, 16, // 12
0x2B, 5, ROLE_WORKER, 16, // 13
0x2B, 6, ROLE_WORKER, 16, // 14
0x2B, 7, ROLE_WORKER, 16, // 15
0x6B, 0, ROLE_SCHEDULER, -1, // 16
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_33_HET_FLAT:
return pr_init(35,
0x2B, 0, ROLE_WORKER, 32, // 0
0x2B, 1, ROLE_WORKER, 32, // 1
0x2B, 2, ROLE_WORKER, 32, // 2
0x2B, 3, ROLE_WORKER, 32, // 3
0x2B, 4, ROLE_WORKER, 32, // 4
0x2B, 5, ROLE_WORKER, 32, // 5
0x2B, 6, ROLE_WORKER, 32, // 6
0x2B, 7, ROLE_WORKER, 32, // 7
0x2F, 0, ROLE_WORKER, 32, // 8
0x2F, 1, ROLE_WORKER, 32, // 9
0x2F, 2, ROLE_WORKER, 32, // 10
0x2F, 3, ROLE_WORKER, 32, // 11
0x2F, 4, ROLE_WORKER, 32, // 12
0x2F, 5, ROLE_WORKER, 32, // 13
0x2F, 6, ROLE_WORKER, 32, // 14
0x2F, 7, ROLE_WORKER, 32, // 15
0x3B, 0, ROLE_WORKER, 32, // 16
0x3B, 1, ROLE_WORKER, 32, // 17
0x3B, 2, ROLE_WORKER, 32, // 18
0x3B, 3, ROLE_WORKER, 32, // 19
0x3B, 4, ROLE_WORKER, 32, // 20
0x3B, 5, ROLE_WORKER, 32, // 21
0x3B, 6, ROLE_WORKER, 32, // 22
0x3B, 7, ROLE_WORKER, 32, // 23
0x3F, 0, ROLE_WORKER, 32, // 24
0x3F, 1, ROLE_WORKER, 32, // 25
0x3F, 2, ROLE_WORKER, 32, // 26
0x3F, 3, ROLE_WORKER, 32, // 27
0x3F, 4, ROLE_WORKER, 32, // 28
0x3F, 5, ROLE_WORKER, 32, // 29
0x3F, 6, ROLE_WORKER, 32, // 30
0x3F, 7, ROLE_WORKER, 32, // 31
0x6B, 0, ROLE_SCHEDULER, -1, // 32
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_35_HET_HIER:
return pr_init(37,
0x2B, 0, ROLE_WORKER, 32, // 0
0x2B, 1, ROLE_WORKER, 32, // 1
0x2B, 2, ROLE_WORKER, 32, // 2
0x2B, 3, ROLE_WORKER, 32, // 3
0x2B, 4, ROLE_WORKER, 32, // 4
0x2B, 5, ROLE_WORKER, 32, // 5
0x2B, 6, ROLE_WORKER, 32, // 6
0x2B, 7, ROLE_WORKER, 32, // 7
0x2F, 0, ROLE_WORKER, 32, // 8
0x2F, 1, ROLE_WORKER, 32, // 9
0x2F, 2, ROLE_WORKER, 32, // 10
0x2F, 3, ROLE_WORKER, 32, // 11
0x2F, 4, ROLE_WORKER, 32, // 12
0x2F, 5, ROLE_WORKER, 32, // 13
0x2F, 6, ROLE_WORKER, 32, // 14
0x2F, 7, ROLE_WORKER, 32, // 15
0x3B, 0, ROLE_WORKER, 33, // 16
0x3B, 1, ROLE_WORKER, 33, // 17
0x3B, 2, ROLE_WORKER, 33, // 18
0x3B, 3, ROLE_WORKER, 33, // 19
0x3B, 4, ROLE_WORKER, 33, // 20
0x3B, 5, ROLE_WORKER, 33, // 21
0x3B, 6, ROLE_WORKER, 33, // 22
0x3B, 7, ROLE_WORKER, 33, // 23
0x3F, 0, ROLE_WORKER, 33, // 24
0x3F, 1, ROLE_WORKER, 33, // 25
0x3F, 2, ROLE_WORKER, 33, // 26
0x3F, 3, ROLE_WORKER, 33, // 27
0x3F, 4, ROLE_WORKER, 33, // 28
0x3F, 5, ROLE_WORKER, 33, // 29
0x3F, 6, ROLE_WORKER, 33, // 30
0x3F, 7, ROLE_WORKER, 33, // 31
0x4B, 0, ROLE_SCHEDULER, 34, // 32
0x4B, 1, ROLE_SCHEDULER, 34, // 33
0x4B, 2, ROLE_SCHEDULER, -1, // 34
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_65_HET_FLAT:
return pr_init(67,
0x0B, 0, ROLE_WORKER, 64, // 0
0x0B, 1, ROLE_WORKER, 64, // 1
0x0B, 2, ROLE_WORKER, 64, // 2
0x0B, 3, ROLE_WORKER, 64, // 3
0x0B, 4, ROLE_WORKER, 64, // 4
0x0B, 5, ROLE_WORKER, 64, // 5
0x0B, 6, ROLE_WORKER, 64, // 6
0x0B, 7, ROLE_WORKER, 64, // 7
0x0F, 0, ROLE_WORKER, 64, // 8
0x0F, 1, ROLE_WORKER, 64, // 9
0x0F, 2, ROLE_WORKER, 64, // 10
0x0F, 3, ROLE_WORKER, 64, // 11
0x0F, 4, ROLE_WORKER, 64, // 12
0x0F, 5, ROLE_WORKER, 64, // 13
0x0F, 6, ROLE_WORKER, 64, // 14
0x0F, 7, ROLE_WORKER, 64, // 15
0x1B, 0, ROLE_WORKER, 64, // 16
0x1B, 1, ROLE_WORKER, 64, // 17
0x1B, 2, ROLE_WORKER, 64, // 18
0x1B, 3, ROLE_WORKER, 64, // 19
0x1B, 4, ROLE_WORKER, 64, // 20
0x1B, 5, ROLE_WORKER, 64, // 21
0x1B, 6, ROLE_WORKER, 64, // 22
0x1B, 7, ROLE_WORKER, 64, // 23
0x1F, 0, ROLE_WORKER, 64, // 24
0x1F, 1, ROLE_WORKER, 64, // 25
0x1F, 2, ROLE_WORKER, 64, // 26
0x1F, 3, ROLE_WORKER, 64, // 27
0x1F, 4, ROLE_WORKER, 64, // 28
0x1F, 5, ROLE_WORKER, 64, // 29
0x1F, 6, ROLE_WORKER, 64, // 30
0x1F, 7, ROLE_WORKER, 64, // 31
0x0A, 0, ROLE_WORKER, 64, // 32
0x0A, 1, ROLE_WORKER, 64, // 33
0x0A, 2, ROLE_WORKER, 64, // 34
0x0A, 3, ROLE_WORKER, 64, // 35
0x0A, 4, ROLE_WORKER, 64, // 36
0x0A, 5, ROLE_WORKER, 64, // 37
0x0A, 6, ROLE_WORKER, 64, // 38
0x0A, 7, ROLE_WORKER, 64, // 39
0x0E, 0, ROLE_WORKER, 64, // 40
0x0E, 1, ROLE_WORKER, 64, // 41
0x0E, 2, ROLE_WORKER, 64, // 42
0x0E, 3, ROLE_WORKER, 64, // 43
0x0E, 4, ROLE_WORKER, 64, // 44
0x0E, 5, ROLE_WORKER, 64, // 45
0x0E, 6, ROLE_WORKER, 64, // 46
0x0E, 7, ROLE_WORKER, 64, // 47
0x1A, 0, ROLE_WORKER, 64, // 48
0x1A, 1, ROLE_WORKER, 64, // 49
0x1A, 2, ROLE_WORKER, 64, // 50
0x1A, 3, ROLE_WORKER, 64, // 51
0x1A, 4, ROLE_WORKER, 64, // 52
0x1A, 5, ROLE_WORKER, 64, // 53
0x1A, 6, ROLE_WORKER, 64, // 54
0x1A, 7, ROLE_WORKER, 64, // 55
0x1E, 0, ROLE_WORKER, 64, // 56
0x1E, 1, ROLE_WORKER, 64, // 57
0x1E, 2, ROLE_WORKER, 64, // 58
0x1E, 3, ROLE_WORKER, 64, // 59
0x1E, 4, ROLE_WORKER, 64, // 60
0x1E, 5, ROLE_WORKER, 64, // 61
0x1E, 6, ROLE_WORKER, 64, // 62
0x1E, 7, ROLE_WORKER, 64, // 63
0x6B, 0, ROLE_SCHEDULER, -1, // 64
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_69_HET_HIER:
return pr_init(71,
0x0B, 0, ROLE_WORKER, 64, // 0
0x0B, 1, ROLE_WORKER, 64, // 1
0x0B, 2, ROLE_WORKER, 64, // 2
0x0B, 3, ROLE_WORKER, 64, // 3
0x0B, 4, ROLE_WORKER, 64, // 4
0x0B, 5, ROLE_WORKER, 64, // 5
0x0B, 6, ROLE_WORKER, 64, // 6
0x0B, 7, ROLE_WORKER, 64, // 7
0x0F, 0, ROLE_WORKER, 64, // 8
0x0F, 1, ROLE_WORKER, 64, // 9
0x0F, 2, ROLE_WORKER, 64, // 10
0x0F, 3, ROLE_WORKER, 64, // 11
0x0F, 4, ROLE_WORKER, 64, // 12
0x0F, 5, ROLE_WORKER, 64, // 13
0x0F, 6, ROLE_WORKER, 64, // 14
0x0F, 7, ROLE_WORKER, 64, // 15
0x1B, 0, ROLE_WORKER, 65, // 16
0x1B, 1, ROLE_WORKER, 65, // 17
0x1B, 2, ROLE_WORKER, 65, // 18
0x1B, 3, ROLE_WORKER, 65, // 19
0x1B, 4, ROLE_WORKER, 65, // 20
0x1B, 5, ROLE_WORKER, 65, // 21
0x1B, 6, ROLE_WORKER, 65, // 22
0x1B, 7, ROLE_WORKER, 65, // 23
0x1F, 0, ROLE_WORKER, 65, // 24
0x1F, 1, ROLE_WORKER, 65, // 25
0x1F, 2, ROLE_WORKER, 65, // 26
0x1F, 3, ROLE_WORKER, 65, // 27
0x1F, 4, ROLE_WORKER, 65, // 28
0x1F, 5, ROLE_WORKER, 65, // 29
0x1F, 6, ROLE_WORKER, 65, // 30
0x1F, 7, ROLE_WORKER, 65, // 31
0x0A, 0, ROLE_WORKER, 66, // 32
0x0A, 1, ROLE_WORKER, 66, // 33
0x0A, 2, ROLE_WORKER, 66, // 34
0x0A, 3, ROLE_WORKER, 66, // 35
0x0A, 4, ROLE_WORKER, 66, // 36
0x0A, 5, ROLE_WORKER, 66, // 37
0x0A, 6, ROLE_WORKER, 66, // 38
0x0A, 7, ROLE_WORKER, 66, // 39
0x0E, 0, ROLE_WORKER, 66, // 40
0x0E, 1, ROLE_WORKER, 66, // 41
0x0E, 2, ROLE_WORKER, 66, // 42
0x0E, 3, ROLE_WORKER, 66, // 43
0x0E, 4, ROLE_WORKER, 66, // 44
0x0E, 5, ROLE_WORKER, 66, // 45
0x0E, 6, ROLE_WORKER, 66, // 46
0x0E, 7, ROLE_WORKER, 66, // 47
0x1A, 0, ROLE_WORKER, 67, // 48
0x1A, 1, ROLE_WORKER, 67, // 49
0x1A, 2, ROLE_WORKER, 67, // 50
0x1A, 3, ROLE_WORKER, 67, // 51
0x1A, 4, ROLE_WORKER, 67, // 52
0x1A, 5, ROLE_WORKER, 67, // 53
0x1A, 6, ROLE_WORKER, 67, // 54
0x1A, 7, ROLE_WORKER, 67, // 55
0x1E, 0, ROLE_WORKER, 67, // 56
0x1E, 1, ROLE_WORKER, 67, // 57
0x1E, 2, ROLE_WORKER, 67, // 58
0x1E, 3, ROLE_WORKER, 67, // 59
0x1E, 4, ROLE_WORKER, 67, // 60
0x1E, 5, ROLE_WORKER, 67, // 61
0x1E, 6, ROLE_WORKER, 67, // 62
0x1E, 7, ROLE_WORKER, 67, // 63
0x4B, 0, ROLE_SCHEDULER, 68, // 64
0x4B, 1, ROLE_SCHEDULER, 68, // 65
0x4B, 2, ROLE_SCHEDULER, 68, // 66
0x4B, 3, ROLE_SCHEDULER, 68, // 67
0x6B, 0, ROLE_SCHEDULER, -1, // 68
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_129_HET_FLAT:
return pr_init(131,
0x0B, 0, ROLE_WORKER, 128, // 0
0x0B, 1, ROLE_WORKER, 128, // 1
0x0B, 2, ROLE_WORKER, 128, // 2
0x0B, 3, ROLE_WORKER, 128, // 3
0x0B, 4, ROLE_WORKER, 128, // 4
0x0B, 5, ROLE_WORKER, 128, // 5
0x0B, 6, ROLE_WORKER, 128, // 6
0x0B, 7, ROLE_WORKER, 128, // 7
0x0A, 0, ROLE_WORKER, 128, // 8
0x0A, 1, ROLE_WORKER, 128, // 9
0x0A, 2, ROLE_WORKER, 128, // 10
0x0A, 3, ROLE_WORKER, 128, // 11
0x0A, 4, ROLE_WORKER, 128, // 12
0x0A, 5, ROLE_WORKER, 128, // 13
0x0A, 6, ROLE_WORKER, 128, // 14
0x0A, 7, ROLE_WORKER, 128, // 15
0x09, 0, ROLE_WORKER, 128, // 16
0x09, 1, ROLE_WORKER, 128, // 17
0x0F, 0, ROLE_WORKER, 128, // 18
0x0F, 1, ROLE_WORKER, 128, // 19
0x0F, 2, ROLE_WORKER, 128, // 20
0x0F, 3, ROLE_WORKER, 128, // 21
0x0F, 4, ROLE_WORKER, 128, // 22
0x0F, 5, ROLE_WORKER, 128, // 23
0x0F, 6, ROLE_WORKER, 128, // 24
0x0F, 7, ROLE_WORKER, 128, // 25
0x0E, 0, ROLE_WORKER, 128, // 26
0x0E, 1, ROLE_WORKER, 128, // 27
0x0E, 2, ROLE_WORKER, 128, // 28
0x0E, 3, ROLE_WORKER, 128, // 29
0x0E, 4, ROLE_WORKER, 128, // 30
0x0E, 5, ROLE_WORKER, 128, // 31
0x0E, 6, ROLE_WORKER, 128, // 32
0x0E, 7, ROLE_WORKER, 128, // 33
0x0D, 0, ROLE_WORKER, 128, // 34
0x0D, 1, ROLE_WORKER, 128, // 35
0x1B, 0, ROLE_WORKER, 128, // 36
0x1B, 1, ROLE_WORKER, 128, // 37
0x1B, 2, ROLE_WORKER, 128, // 38
0x1B, 3, ROLE_WORKER, 128, // 39
0x1B, 4, ROLE_WORKER, 128, // 40
0x1B, 5, ROLE_WORKER, 128, // 41
0x1B, 6, ROLE_WORKER, 128, // 42
0x1B, 7, ROLE_WORKER, 128, // 43
0x1A, 0, ROLE_WORKER, 128, // 44
0x1A, 1, ROLE_WORKER, 128, // 45
0x1A, 2, ROLE_WORKER, 128, // 46
0x1A, 3, ROLE_WORKER, 128, // 47
0x1A, 4, ROLE_WORKER, 128, // 48
0x1A, 5, ROLE_WORKER, 128, // 49
0x1A, 6, ROLE_WORKER, 128, // 50
0x1A, 7, ROLE_WORKER, 128, // 51
0x19, 0, ROLE_WORKER, 128, // 52
0x19, 1, ROLE_WORKER, 128, // 53
0x1F, 0, ROLE_WORKER, 128, // 54
0x1F, 1, ROLE_WORKER, 128, // 55
0x1F, 2, ROLE_WORKER, 128, // 56
0x1F, 3, ROLE_WORKER, 128, // 57
0x1F, 4, ROLE_WORKER, 128, // 58
0x1F, 5, ROLE_WORKER, 128, // 59
0x1F, 6, ROLE_WORKER, 128, // 60
0x1F, 7, ROLE_WORKER, 128, // 61
0x1E, 0, ROLE_WORKER, 128, // 62
0x1E, 1, ROLE_WORKER, 128, // 63
0x1E, 2, ROLE_WORKER, 128, // 64
0x1E, 3, ROLE_WORKER, 128, // 65
0x1E, 4, ROLE_WORKER, 128, // 66
0x1E, 5, ROLE_WORKER, 128, // 67
0x1E, 6, ROLE_WORKER, 128, // 68
0x1E, 7, ROLE_WORKER, 128, // 69
0x1D, 0, ROLE_WORKER, 128, // 70
0x1D, 1, ROLE_WORKER, 128, // 71
0x2B, 0, ROLE_WORKER, 128, // 72
0x2B, 1, ROLE_WORKER, 128, // 73
0x2B, 2, ROLE_WORKER, 128, // 74
0x2B, 3, ROLE_WORKER, 128, // 75
0x2B, 4, ROLE_WORKER, 128, // 76
0x2B, 5, ROLE_WORKER, 128, // 77
0x2B, 6, ROLE_WORKER, 128, // 78
0x2B, 7, ROLE_WORKER, 128, // 79
0x2A, 0, ROLE_WORKER, 128, // 80
0x2A, 1, ROLE_WORKER, 128, // 81
0x2A, 2, ROLE_WORKER, 128, // 82
0x2A, 3, ROLE_WORKER, 128, // 83
0x2A, 4, ROLE_WORKER, 128, // 84
0x2A, 5, ROLE_WORKER, 128, // 85
0x2A, 6, ROLE_WORKER, 128, // 86
0x2A, 7, ROLE_WORKER, 128, // 87
0x29, 0, ROLE_WORKER, 128, // 88
0x29, 1, ROLE_WORKER, 128, // 89
0x2F, 0, ROLE_WORKER, 128, // 90
0x2F, 1, ROLE_WORKER, 128, // 91
0x2F, 2, ROLE_WORKER, 128, // 92
0x2F, 3, ROLE_WORKER, 128, // 93
0x2F, 4, ROLE_WORKER, 128, // 94
0x2F, 5, ROLE_WORKER, 128, // 95
0x2F, 6, ROLE_WORKER, 128, // 96
0x2F, 7, ROLE_WORKER, 128, // 97
0x2E, 0, ROLE_WORKER, 128, // 98
0x2E, 1, ROLE_WORKER, 128, // 99
0x2E, 2, ROLE_WORKER, 128, // 100
0x2E, 3, ROLE_WORKER, 128, // 101
0x2E, 4, ROLE_WORKER, 128, // 102
0x2E, 5, ROLE_WORKER, 128, // 103
0x2E, 6, ROLE_WORKER, 128, // 104
0x2E, 7, ROLE_WORKER, 128, // 105
0x2D, 0, ROLE_WORKER, 128, // 106
0x2D, 1, ROLE_WORKER, 128, // 107
0x2D, 2, ROLE_WORKER, 128, // 108
0x3B, 0, ROLE_WORKER, 128, // 109
0x3B, 1, ROLE_WORKER, 128, // 110
0x3B, 2, ROLE_WORKER, 128, // 111
0x3B, 3, ROLE_WORKER, 128, // 112
0x3B, 4, ROLE_WORKER, 128, // 113
0x3B, 5, ROLE_WORKER, 128, // 114
0x3B, 6, ROLE_WORKER, 128, // 115
0x3B, 7, ROLE_WORKER, 128, // 116
0x3A, 0, ROLE_WORKER, 128, // 117
0x3A, 1, ROLE_WORKER, 128, // 118
0x3A, 2, ROLE_WORKER, 128, // 119
0x3A, 3, ROLE_WORKER, 128, // 120
0x3A, 4, ROLE_WORKER, 128, // 121
0x3A, 5, ROLE_WORKER, 128, // 122
0x3A, 6, ROLE_WORKER, 128, // 123
0x3A, 7, ROLE_WORKER, 128, // 124
0x39, 0, ROLE_WORKER, 128, // 125
0x39, 1, ROLE_WORKER, 128, // 126
0x39, 2, ROLE_WORKER, 128, // 127
0x6B, 0, ROLE_SCHEDULER, -1, // 128
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_133_HET_HIER:
return pr_init(135,
0x0B, 0, ROLE_WORKER, 128, // 0
0x0B, 1, ROLE_WORKER, 128, // 1
0x0B, 2, ROLE_WORKER, 128, // 2
0x0B, 3, ROLE_WORKER, 128, // 3
0x0B, 4, ROLE_WORKER, 128, // 4
0x0B, 5, ROLE_WORKER, 128, // 5
0x0B, 6, ROLE_WORKER, 128, // 6
0x0B, 7, ROLE_WORKER, 128, // 7
0x0A, 0, ROLE_WORKER, 128, // 8
0x0A, 1, ROLE_WORKER, 128, // 9
0x0A, 2, ROLE_WORKER, 128, // 10
0x0A, 3, ROLE_WORKER, 128, // 11
0x0A, 4, ROLE_WORKER, 128, // 12
0x0A, 5, ROLE_WORKER, 128, // 13
0x0A, 6, ROLE_WORKER, 128, // 14
0x0A, 7, ROLE_WORKER, 128, // 15
0x09, 0, ROLE_WORKER, 128, // 16
0x09, 1, ROLE_WORKER, 128, // 17
0x0F, 0, ROLE_WORKER, 128, // 18
0x0F, 1, ROLE_WORKER, 128, // 19
0x0F, 2, ROLE_WORKER, 128, // 20
0x0F, 3, ROLE_WORKER, 128, // 21
0x0F, 4, ROLE_WORKER, 128, // 22
0x0F, 5, ROLE_WORKER, 128, // 23
0x0F, 6, ROLE_WORKER, 128, // 24
0x0F, 7, ROLE_WORKER, 128, // 25
0x0E, 0, ROLE_WORKER, 128, // 26
0x0E, 1, ROLE_WORKER, 128, // 27
0x0E, 2, ROLE_WORKER, 128, // 28
0x0E, 3, ROLE_WORKER, 128, // 29
0x0E, 4, ROLE_WORKER, 128, // 30
0x0E, 5, ROLE_WORKER, 128, // 31
0x0E, 6, ROLE_WORKER, 129, // 32
0x0E, 7, ROLE_WORKER, 129, // 33
0x0D, 0, ROLE_WORKER, 129, // 34
0x0D, 1, ROLE_WORKER, 129, // 35
0x1B, 0, ROLE_WORKER, 129, // 36
0x1B, 1, ROLE_WORKER, 129, // 37
0x1B, 2, ROLE_WORKER, 129, // 38
0x1B, 3, ROLE_WORKER, 129, // 39
0x1B, 4, ROLE_WORKER, 129, // 40
0x1B, 5, ROLE_WORKER, 129, // 41
0x1B, 6, ROLE_WORKER, 129, // 42
0x1B, 7, ROLE_WORKER, 129, // 43
0x1A, 0, ROLE_WORKER, 129, // 44
0x1A, 1, ROLE_WORKER, 129, // 45
0x1A, 2, ROLE_WORKER, 129, // 46
0x1A, 3, ROLE_WORKER, 129, // 47
0x1A, 4, ROLE_WORKER, 129, // 48
0x1A, 5, ROLE_WORKER, 129, // 49
0x1A, 6, ROLE_WORKER, 129, // 50
0x1A, 7, ROLE_WORKER, 129, // 51
0x19, 0, ROLE_WORKER, 129, // 52
0x19, 1, ROLE_WORKER, 129, // 53
0x1F, 0, ROLE_WORKER, 129, // 54
0x1F, 1, ROLE_WORKER, 129, // 55
0x1F, 2, ROLE_WORKER, 129, // 56
0x1F, 3, ROLE_WORKER, 129, // 57
0x1F, 4, ROLE_WORKER, 129, // 58
0x1F, 5, ROLE_WORKER, 129, // 59
0x1F, 6, ROLE_WORKER, 129, // 60
0x1F, 7, ROLE_WORKER, 129, // 61
0x1E, 0, ROLE_WORKER, 129, // 62
0x1E, 1, ROLE_WORKER, 129, // 63
0x1E, 2, ROLE_WORKER, 130, // 64
0x1E, 3, ROLE_WORKER, 130, // 65
0x1E, 4, ROLE_WORKER, 130, // 66
0x1E, 5, ROLE_WORKER, 130, // 67
0x1E, 6, ROLE_WORKER, 130, // 68
0x1E, 7, ROLE_WORKER, 130, // 69
0x1D, 0, ROLE_WORKER, 130, // 70
0x1D, 1, ROLE_WORKER, 130, // 71
0x2B, 0, ROLE_WORKER, 130, // 72
0x2B, 1, ROLE_WORKER, 130, // 73
0x2B, 2, ROLE_WORKER, 130, // 74
0x2B, 3, ROLE_WORKER, 130, // 75
0x2B, 4, ROLE_WORKER, 130, // 76
0x2B, 5, ROLE_WORKER, 130, // 77
0x2B, 6, ROLE_WORKER, 130, // 78
0x2B, 7, ROLE_WORKER, 130, // 79
0x2A, 0, ROLE_WORKER, 130, // 80
0x2A, 1, ROLE_WORKER, 130, // 81
0x2A, 2, ROLE_WORKER, 130, // 82
0x2A, 3, ROLE_WORKER, 130, // 83
0x2A, 4, ROLE_WORKER, 130, // 84
0x2A, 5, ROLE_WORKER, 130, // 85
0x2A, 6, ROLE_WORKER, 130, // 86
0x2A, 7, ROLE_WORKER, 130, // 87
0x29, 0, ROLE_WORKER, 130, // 88
0x29, 1, ROLE_WORKER, 130, // 89
0x2F, 0, ROLE_WORKER, 130, // 90
0x2F, 1, ROLE_WORKER, 130, // 91
0x2F, 2, ROLE_WORKER, 130, // 92
0x2F, 3, ROLE_WORKER, 130, // 93
0x2F, 4, ROLE_WORKER, 130, // 94
0x2F, 5, ROLE_WORKER, 130, // 95
0x2F, 6, ROLE_WORKER, 131, // 96
0x2F, 7, ROLE_WORKER, 131, // 97
0x2E, 0, ROLE_WORKER, 131, // 98
0x2E, 1, ROLE_WORKER, 131, // 99
0x2E, 2, ROLE_WORKER, 131, // 100
0x2E, 3, ROLE_WORKER, 131, // 101
0x2E, 4, ROLE_WORKER, 131, // 102
0x2E, 5, ROLE_WORKER, 131, // 103
0x2E, 6, ROLE_WORKER, 131, // 104
0x2E, 7, ROLE_WORKER, 131, // 105
0x2D, 0, ROLE_WORKER, 131, // 106
0x2D, 1, ROLE_WORKER, 131, // 107
0x2D, 2, ROLE_WORKER, 131, // 108
0x3B, 0, ROLE_WORKER, 131, // 109
0x3B, 1, ROLE_WORKER, 131, // 110
0x3B, 2, ROLE_WORKER, 131, // 111
0x3B, 3, ROLE_WORKER, 131, // 112
0x3B, 4, ROLE_WORKER, 131, // 113
0x3B, 5, ROLE_WORKER, 131, // 114
0x3B, 6, ROLE_WORKER, 131, // 115
0x3B, 7, ROLE_WORKER, 131, // 116
0x3A, 0, ROLE_WORKER, 131, // 117
0x3A, 1, ROLE_WORKER, 131, // 118
0x3A, 2, ROLE_WORKER, 131, // 119
0x3A, 3, ROLE_WORKER, 131, // 120
0x3A, 4, ROLE_WORKER, 131, // 121
0x3A, 5, ROLE_WORKER, 131, // 122
0x3A, 6, ROLE_WORKER, 131, // 123
0x3A, 7, ROLE_WORKER, 131, // 124
0x39, 0, ROLE_WORKER, 131, // 125
0x39, 1, ROLE_WORKER, 131, // 126
0x39, 2, ROLE_WORKER, 131, // 127
0x4B, 0, ROLE_SCHEDULER, 132, // 128
0x4B, 1, ROLE_SCHEDULER, 132, // 129
0x4B, 2, ROLE_SCHEDULER, 132, // 130
0x4B, 3, ROLE_SCHEDULER, 132, // 131
0x6B, 0, ROLE_SCHEDULER, -1, // 132
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_257_HET_FLAT:
return pr_init(259,
0x0B, 0, ROLE_WORKER, 256, // 0
0x0B, 1, ROLE_WORKER, 256, // 1
0x0B, 2, ROLE_WORKER, 256, // 2
0x0B, 3, ROLE_WORKER, 256, // 3
0x0B, 4, ROLE_WORKER, 256, // 4
0x0B, 5, ROLE_WORKER, 256, // 5
0x0B, 6, ROLE_WORKER, 256, // 6
0x0B, 7, ROLE_WORKER, 256, // 7
0x0A, 0, ROLE_WORKER, 256, // 8
0x0A, 1, ROLE_WORKER, 256, // 9
0x0A, 2, ROLE_WORKER, 256, // 10
0x0A, 3, ROLE_WORKER, 256, // 11
0x0A, 4, ROLE_WORKER, 256, // 12
0x0A, 5, ROLE_WORKER, 256, // 13
0x0A, 6, ROLE_WORKER, 256, // 14
0x0A, 7, ROLE_WORKER, 256, // 15
0x09, 0, ROLE_WORKER, 256, // 16
0x09, 1, ROLE_WORKER, 256, // 17
0x09, 2, ROLE_WORKER, 256, // 18
0x09, 3, ROLE_WORKER, 256, // 19
0x09, 4, ROLE_WORKER, 256, // 20
0x09, 5, ROLE_WORKER, 256, // 21
0x09, 6, ROLE_WORKER, 256, // 22
0x09, 7, ROLE_WORKER, 256, // 23
0x08, 0, ROLE_WORKER, 256, // 24
0x08, 1, ROLE_WORKER, 256, // 25
0x08, 2, ROLE_WORKER, 256, // 26
0x08, 3, ROLE_WORKER, 256, // 27
0x08, 4, ROLE_WORKER, 256, // 28
0x08, 5, ROLE_WORKER, 256, // 29
0x08, 6, ROLE_WORKER, 256, // 30
0x08, 7, ROLE_WORKER, 256, // 31
0x07, 0, ROLE_WORKER, 256, // 32
0x07, 1, ROLE_WORKER, 256, // 33
0x07, 2, ROLE_WORKER, 256, // 34
0x07, 3, ROLE_WORKER, 256, // 35
0x07, 4, ROLE_WORKER, 256, // 36
0x0F, 0, ROLE_WORKER, 256, // 37
0x0F, 1, ROLE_WORKER, 256, // 38
0x0F, 2, ROLE_WORKER, 256, // 39
0x0F, 3, ROLE_WORKER, 256, // 40
0x0F, 4, ROLE_WORKER, 256, // 41
0x0F, 5, ROLE_WORKER, 256, // 42
0x0F, 6, ROLE_WORKER, 256, // 43
0x0F, 7, ROLE_WORKER, 256, // 44
0x0E, 0, ROLE_WORKER, 256, // 45
0x0E, 1, ROLE_WORKER, 256, // 46
0x0E, 2, ROLE_WORKER, 256, // 47
0x0E, 3, ROLE_WORKER, 256, // 48
0x0E, 4, ROLE_WORKER, 256, // 49
0x0E, 5, ROLE_WORKER, 256, // 50
0x0E, 6, ROLE_WORKER, 256, // 51
0x0E, 7, ROLE_WORKER, 256, // 52
0x0D, 0, ROLE_WORKER, 256, // 53
0x0D, 1, ROLE_WORKER, 256, // 54
0x0D, 2, ROLE_WORKER, 256, // 55
0x0D, 3, ROLE_WORKER, 256, // 56
0x0D, 4, ROLE_WORKER, 256, // 57
0x0D, 5, ROLE_WORKER, 256, // 58
0x0D, 6, ROLE_WORKER, 256, // 59
0x0D, 7, ROLE_WORKER, 256, // 60
0x0C, 0, ROLE_WORKER, 256, // 61
0x0C, 1, ROLE_WORKER, 256, // 62
0x0C, 2, ROLE_WORKER, 256, // 63
0x0C, 3, ROLE_WORKER, 256, // 64
0x0C, 4, ROLE_WORKER, 256, // 65
0x0C, 5, ROLE_WORKER, 256, // 66
0x0C, 6, ROLE_WORKER, 256, // 67
0x0C, 7, ROLE_WORKER, 256, // 68
0x06, 0, ROLE_WORKER, 256, // 69
0x06, 1, ROLE_WORKER, 256, // 70
0x06, 2, ROLE_WORKER, 256, // 71
0x06, 3, ROLE_WORKER, 256, // 72
0x06, 4, ROLE_WORKER, 256, // 73
0x1B, 0, ROLE_WORKER, 256, // 74
0x1B, 1, ROLE_WORKER, 256, // 75
0x1B, 2, ROLE_WORKER, 256, // 76
0x1B, 3, ROLE_WORKER, 256, // 77
0x1B, 4, ROLE_WORKER, 256, // 78
0x1B, 5, ROLE_WORKER, 256, // 79
0x1B, 6, ROLE_WORKER, 256, // 80
0x1B, 7, ROLE_WORKER, 256, // 81
0x1A, 0, ROLE_WORKER, 256, // 82
0x1A, 1, ROLE_WORKER, 256, // 83
0x1A, 2, ROLE_WORKER, 256, // 84
0x1A, 3, ROLE_WORKER, 256, // 85
0x1A, 4, ROLE_WORKER, 256, // 86
0x1A, 5, ROLE_WORKER, 256, // 87
0x1A, 6, ROLE_WORKER, 256, // 88
0x1A, 7, ROLE_WORKER, 256, // 89
0x19, 0, ROLE_WORKER, 256, // 90
0x19, 1, ROLE_WORKER, 256, // 91
0x19, 2, ROLE_WORKER, 256, // 92
0x19, 3, ROLE_WORKER, 256, // 93
0x19, 4, ROLE_WORKER, 256, // 94
0x19, 5, ROLE_WORKER, 256, // 95
0x19, 6, ROLE_WORKER, 256, // 96
0x19, 7, ROLE_WORKER, 256, // 97
0x18, 0, ROLE_WORKER, 256, // 98
0x18, 1, ROLE_WORKER, 256, // 99
0x18, 2, ROLE_WORKER, 256, // 100
0x18, 3, ROLE_WORKER, 256, // 101
0x18, 4, ROLE_WORKER, 256, // 102
0x18, 5, ROLE_WORKER, 256, // 103
0x18, 6, ROLE_WORKER, 256, // 104
0x18, 7, ROLE_WORKER, 256, // 105
0x17, 0, ROLE_WORKER, 256, // 106
0x17, 1, ROLE_WORKER, 256, // 107
0x17, 2, ROLE_WORKER, 256, // 108
0x17, 3, ROLE_WORKER, 256, // 109
0x17, 4, ROLE_WORKER, 256, // 110
0x1F, 0, ROLE_WORKER, 256, // 111
0x1F, 1, ROLE_WORKER, 256, // 112
0x1F, 2, ROLE_WORKER, 256, // 113
0x1F, 3, ROLE_WORKER, 256, // 114
0x1F, 4, ROLE_WORKER, 256, // 115
0x1F, 5, ROLE_WORKER, 256, // 116
0x1F, 6, ROLE_WORKER, 256, // 117
0x1F, 7, ROLE_WORKER, 256, // 118
0x1E, 0, ROLE_WORKER, 256, // 119
0x1E, 1, ROLE_WORKER, 256, // 120
0x1E, 2, ROLE_WORKER, 256, // 121
0x1E, 3, ROLE_WORKER, 256, // 122
0x1E, 4, ROLE_WORKER, 256, // 123
0x1E, 5, ROLE_WORKER, 256, // 124
0x1E, 6, ROLE_WORKER, 256, // 125
0x1E, 7, ROLE_WORKER, 256, // 126
0x1D, 0, ROLE_WORKER, 256, // 127
0x1D, 1, ROLE_WORKER, 256, // 128
0x1D, 2, ROLE_WORKER, 256, // 129
0x1D, 3, ROLE_WORKER, 256, // 130
0x1D, 4, ROLE_WORKER, 256, // 131
0x1D, 5, ROLE_WORKER, 256, // 132
0x1D, 6, ROLE_WORKER, 256, // 133
0x1D, 7, ROLE_WORKER, 256, // 134
0x1C, 0, ROLE_WORKER, 256, // 135
0x1C, 1, ROLE_WORKER, 256, // 136
0x1C, 2, ROLE_WORKER, 256, // 137
0x1C, 3, ROLE_WORKER, 256, // 138
0x1C, 4, ROLE_WORKER, 256, // 139
0x1C, 5, ROLE_WORKER, 256, // 140
0x1C, 6, ROLE_WORKER, 256, // 141
0x1C, 7, ROLE_WORKER, 256, // 142
0x16, 0, ROLE_WORKER, 256, // 143
0x16, 1, ROLE_WORKER, 256, // 144
0x16, 2, ROLE_WORKER, 256, // 145
0x16, 3, ROLE_WORKER, 256, // 146
0x16, 4, ROLE_WORKER, 256, // 147
0x2B, 0, ROLE_WORKER, 256, // 148
0x2B, 1, ROLE_WORKER, 256, // 149
0x2B, 2, ROLE_WORKER, 256, // 150
0x2B, 3, ROLE_WORKER, 256, // 151
0x2B, 4, ROLE_WORKER, 256, // 152
0x2B, 5, ROLE_WORKER, 256, // 153
0x2B, 6, ROLE_WORKER, 256, // 154
0x2B, 7, ROLE_WORKER, 256, // 155
0x2A, 0, ROLE_WORKER, 256, // 156
0x2A, 1, ROLE_WORKER, 256, // 157
0x2A, 2, ROLE_WORKER, 256, // 158
0x2A, 3, ROLE_WORKER, 256, // 159
0x2A, 4, ROLE_WORKER, 256, // 160
0x2A, 5, ROLE_WORKER, 256, // 161
0x2A, 6, ROLE_WORKER, 256, // 162
0x2A, 7, ROLE_WORKER, 256, // 163
0x29, 0, ROLE_WORKER, 256, // 164
0x29, 1, ROLE_WORKER, 256, // 165
0x29, 2, ROLE_WORKER, 256, // 166
0x29, 3, ROLE_WORKER, 256, // 167
0x29, 4, ROLE_WORKER, 256, // 168
0x29, 5, ROLE_WORKER, 256, // 169
0x29, 6, ROLE_WORKER, 256, // 170
0x29, 7, ROLE_WORKER, 256, // 171
0x28, 0, ROLE_WORKER, 256, // 172
0x28, 1, ROLE_WORKER, 256, // 173
0x28, 2, ROLE_WORKER, 256, // 174
0x28, 3, ROLE_WORKER, 256, // 175
0x28, 4, ROLE_WORKER, 256, // 176
0x28, 5, ROLE_WORKER, 256, // 177
0x28, 6, ROLE_WORKER, 256, // 178
0x28, 7, ROLE_WORKER, 256, // 179
0x27, 0, ROLE_WORKER, 256, // 180
0x27, 1, ROLE_WORKER, 256, // 181
0x27, 2, ROLE_WORKER, 256, // 182
0x27, 3, ROLE_WORKER, 256, // 183
0x2F, 0, ROLE_WORKER, 256, // 184
0x2F, 1, ROLE_WORKER, 256, // 185
0x2F, 2, ROLE_WORKER, 256, // 186
0x2F, 3, ROLE_WORKER, 256, // 187
0x2F, 4, ROLE_WORKER, 256, // 188
0x2F, 5, ROLE_WORKER, 256, // 189
0x2F, 6, ROLE_WORKER, 256, // 190
0x2F, 7, ROLE_WORKER, 256, // 191
0x2E, 0, ROLE_WORKER, 256, // 192
0x2E, 1, ROLE_WORKER, 256, // 193
0x2E, 2, ROLE_WORKER, 256, // 194
0x2E, 3, ROLE_WORKER, 256, // 195
0x2E, 4, ROLE_WORKER, 256, // 196
0x2E, 5, ROLE_WORKER, 256, // 197
0x2E, 6, ROLE_WORKER, 256, // 198
0x2E, 7, ROLE_WORKER, 256, // 199
0x2D, 0, ROLE_WORKER, 256, // 200
0x2D, 1, ROLE_WORKER, 256, // 201
0x2D, 2, ROLE_WORKER, 256, // 202
0x2D, 3, ROLE_WORKER, 256, // 203
0x2D, 4, ROLE_WORKER, 256, // 204
0x2D, 5, ROLE_WORKER, 256, // 205
0x2D, 6, ROLE_WORKER, 256, // 206
0x2D, 7, ROLE_WORKER, 256, // 207
0x2C, 0, ROLE_WORKER, 256, // 208
0x2C, 1, ROLE_WORKER, 256, // 209
0x2C, 2, ROLE_WORKER, 256, // 210
0x2C, 3, ROLE_WORKER, 256, // 211
0x2C, 4, ROLE_WORKER, 256, // 212
0x2C, 5, ROLE_WORKER, 256, // 213
0x2C, 6, ROLE_WORKER, 256, // 214
0x2C, 7, ROLE_WORKER, 256, // 215
0x26, 0, ROLE_WORKER, 256, // 216
0x26, 1, ROLE_WORKER, 256, // 217
0x26, 2, ROLE_WORKER, 256, // 218
0x26, 3, ROLE_WORKER, 256, // 219
0x3B, 0, ROLE_WORKER, 256, // 220
0x3B, 1, ROLE_WORKER, 256, // 221
0x3B, 2, ROLE_WORKER, 256, // 222
0x3B, 3, ROLE_WORKER, 256, // 223
0x3B, 4, ROLE_WORKER, 256, // 224
0x3B, 5, ROLE_WORKER, 256, // 225
0x3B, 6, ROLE_WORKER, 256, // 226
0x3B, 7, ROLE_WORKER, 256, // 227
0x3A, 0, ROLE_WORKER, 256, // 228
0x3A, 1, ROLE_WORKER, 256, // 229
0x3A, 2, ROLE_WORKER, 256, // 230
0x3A, 3, ROLE_WORKER, 256, // 231
0x3A, 4, ROLE_WORKER, 256, // 232
0x3A, 5, ROLE_WORKER, 256, // 233
0x3A, 6, ROLE_WORKER, 256, // 234
0x3A, 7, ROLE_WORKER, 256, // 235
0x39, 0, ROLE_WORKER, 256, // 236
0x39, 1, ROLE_WORKER, 256, // 237
0x39, 2, ROLE_WORKER, 256, // 238
0x39, 3, ROLE_WORKER, 256, // 239
0x39, 4, ROLE_WORKER, 256, // 240
0x39, 5, ROLE_WORKER, 256, // 241
0x39, 6, ROLE_WORKER, 256, // 242
0x39, 7, ROLE_WORKER, 256, // 243
0x38, 0, ROLE_WORKER, 256, // 244
0x38, 1, ROLE_WORKER, 256, // 245
0x38, 2, ROLE_WORKER, 256, // 246
0x38, 3, ROLE_WORKER, 256, // 247
0x38, 4, ROLE_WORKER, 256, // 248
0x38, 5, ROLE_WORKER, 256, // 249
0x38, 6, ROLE_WORKER, 256, // 250
0x38, 7, ROLE_WORKER, 256, // 251
0x37, 0, ROLE_WORKER, 256, // 252
0x37, 1, ROLE_WORKER, 256, // 253
0x37, 2, ROLE_WORKER, 256, // 254
0x37, 3, ROLE_WORKER, 256, // 255
0x6B, 0, ROLE_SCHEDULER, -1, // 256
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_261_HET_HIER:
return pr_init(263,
0x0B, 0, ROLE_WORKER, 256, // 0
0x0B, 1, ROLE_WORKER, 256, // 1
0x0B, 2, ROLE_WORKER, 256, // 2
0x0B, 3, ROLE_WORKER, 256, // 3
0x0B, 4, ROLE_WORKER, 256, // 4
0x0B, 5, ROLE_WORKER, 256, // 5
0x0B, 6, ROLE_WORKER, 256, // 6
0x0B, 7, ROLE_WORKER, 256, // 7
0x0A, 0, ROLE_WORKER, 256, // 8
0x0A, 1, ROLE_WORKER, 256, // 9
0x0A, 2, ROLE_WORKER, 256, // 10
0x0A, 3, ROLE_WORKER, 256, // 11
0x0A, 4, ROLE_WORKER, 256, // 12
0x0A, 5, ROLE_WORKER, 256, // 13
0x0A, 6, ROLE_WORKER, 256, // 14
0x0A, 7, ROLE_WORKER, 256, // 15
0x09, 0, ROLE_WORKER, 256, // 16
0x09, 1, ROLE_WORKER, 256, // 17
0x09, 2, ROLE_WORKER, 256, // 18
0x09, 3, ROLE_WORKER, 256, // 19
0x09, 4, ROLE_WORKER, 256, // 20
0x09, 5, ROLE_WORKER, 256, // 21
0x09, 6, ROLE_WORKER, 256, // 22
0x09, 7, ROLE_WORKER, 256, // 23
0x08, 0, ROLE_WORKER, 256, // 24
0x08, 1, ROLE_WORKER, 256, // 25
0x08, 2, ROLE_WORKER, 256, // 26
0x08, 3, ROLE_WORKER, 256, // 27
0x08, 4, ROLE_WORKER, 256, // 28
0x08, 5, ROLE_WORKER, 256, // 29
0x08, 6, ROLE_WORKER, 256, // 30
0x08, 7, ROLE_WORKER, 256, // 31
0x07, 0, ROLE_WORKER, 256, // 32
0x07, 1, ROLE_WORKER, 256, // 33
0x07, 2, ROLE_WORKER, 256, // 34
0x07, 3, ROLE_WORKER, 256, // 35
0x07, 4, ROLE_WORKER, 256, // 36
0x0F, 0, ROLE_WORKER, 256, // 37
0x0F, 1, ROLE_WORKER, 256, // 38
0x0F, 2, ROLE_WORKER, 256, // 39
0x0F, 3, ROLE_WORKER, 256, // 40
0x0F, 4, ROLE_WORKER, 256, // 41
0x0F, 5, ROLE_WORKER, 256, // 42
0x0F, 6, ROLE_WORKER, 256, // 43
0x0F, 7, ROLE_WORKER, 256, // 44
0x0E, 0, ROLE_WORKER, 256, // 45
0x0E, 1, ROLE_WORKER, 256, // 46
0x0E, 2, ROLE_WORKER, 256, // 47
0x0E, 3, ROLE_WORKER, 256, // 48
0x0E, 4, ROLE_WORKER, 256, // 49
0x0E, 5, ROLE_WORKER, 256, // 50
0x0E, 6, ROLE_WORKER, 256, // 51
0x0E, 7, ROLE_WORKER, 256, // 52
0x0D, 0, ROLE_WORKER, 256, // 53
0x0D, 1, ROLE_WORKER, 256, // 54
0x0D, 2, ROLE_WORKER, 256, // 55
0x0D, 3, ROLE_WORKER, 256, // 56
0x0D, 4, ROLE_WORKER, 256, // 57
0x0D, 5, ROLE_WORKER, 256, // 58
0x0D, 6, ROLE_WORKER, 256, // 59
0x0D, 7, ROLE_WORKER, 256, // 60
0x0C, 0, ROLE_WORKER, 256, // 61
0x0C, 1, ROLE_WORKER, 256, // 62
0x0C, 2, ROLE_WORKER, 256, // 63
0x0C, 3, ROLE_WORKER, 257, // 64
0x0C, 4, ROLE_WORKER, 257, // 65
0x0C, 5, ROLE_WORKER, 257, // 66
0x0C, 6, ROLE_WORKER, 257, // 67
0x0C, 7, ROLE_WORKER, 257, // 68
0x06, 0, ROLE_WORKER, 257, // 69
0x06, 1, ROLE_WORKER, 257, // 70
0x06, 2, ROLE_WORKER, 257, // 71
0x06, 3, ROLE_WORKER, 257, // 72
0x06, 4, ROLE_WORKER, 257, // 73
0x1B, 0, ROLE_WORKER, 257, // 74
0x1B, 1, ROLE_WORKER, 257, // 75
0x1B, 2, ROLE_WORKER, 257, // 76
0x1B, 3, ROLE_WORKER, 257, // 77
0x1B, 4, ROLE_WORKER, 257, // 78
0x1B, 5, ROLE_WORKER, 257, // 79
0x1B, 6, ROLE_WORKER, 257, // 80
0x1B, 7, ROLE_WORKER, 257, // 81
0x1A, 0, ROLE_WORKER, 257, // 82
0x1A, 1, ROLE_WORKER, 257, // 83
0x1A, 2, ROLE_WORKER, 257, // 84
0x1A, 3, ROLE_WORKER, 257, // 85
0x1A, 4, ROLE_WORKER, 257, // 86
0x1A, 5, ROLE_WORKER, 257, // 87
0x1A, 6, ROLE_WORKER, 257, // 88
0x1A, 7, ROLE_WORKER, 257, // 89
0x19, 0, ROLE_WORKER, 257, // 90
0x19, 1, ROLE_WORKER, 257, // 91
0x19, 2, ROLE_WORKER, 257, // 92
0x19, 3, ROLE_WORKER, 257, // 93
0x19, 4, ROLE_WORKER, 257, // 94
0x19, 5, ROLE_WORKER, 257, // 95
0x19, 6, ROLE_WORKER, 257, // 96
0x19, 7, ROLE_WORKER, 257, // 97
0x18, 0, ROLE_WORKER, 257, // 98
0x18, 1, ROLE_WORKER, 257, // 99
0x18, 2, ROLE_WORKER, 257, // 100
0x18, 3, ROLE_WORKER, 257, // 101
0x18, 4, ROLE_WORKER, 257, // 102
0x18, 5, ROLE_WORKER, 257, // 103
0x18, 6, ROLE_WORKER, 257, // 104
0x18, 7, ROLE_WORKER, 257, // 105
0x17, 0, ROLE_WORKER, 257, // 106
0x17, 1, ROLE_WORKER, 257, // 107
0x17, 2, ROLE_WORKER, 257, // 108
0x17, 3, ROLE_WORKER, 257, // 109
0x17, 4, ROLE_WORKER, 257, // 110
0x1F, 0, ROLE_WORKER, 257, // 111
0x1F, 1, ROLE_WORKER, 257, // 112
0x1F, 2, ROLE_WORKER, 257, // 113
0x1F, 3, ROLE_WORKER, 257, // 114
0x1F, 4, ROLE_WORKER, 257, // 115
0x1F, 5, ROLE_WORKER, 257, // 116
0x1F, 6, ROLE_WORKER, 257, // 117
0x1F, 7, ROLE_WORKER, 257, // 118
0x1E, 0, ROLE_WORKER, 257, // 119
0x1E, 1, ROLE_WORKER, 257, // 120
0x1E, 2, ROLE_WORKER, 257, // 121
0x1E, 3, ROLE_WORKER, 257, // 122
0x1E, 4, ROLE_WORKER, 257, // 123
0x1E, 5, ROLE_WORKER, 257, // 124
0x1E, 6, ROLE_WORKER, 257, // 125
0x1E, 7, ROLE_WORKER, 257, // 126
0x1D, 0, ROLE_WORKER, 257, // 127
0x1D, 1, ROLE_WORKER, 258, // 128
0x1D, 2, ROLE_WORKER, 258, // 129
0x1D, 3, ROLE_WORKER, 258, // 130
0x1D, 4, ROLE_WORKER, 258, // 131
0x1D, 5, ROLE_WORKER, 258, // 132
0x1D, 6, ROLE_WORKER, 258, // 133
0x1D, 7, ROLE_WORKER, 258, // 134
0x1C, 0, ROLE_WORKER, 258, // 135
0x1C, 1, ROLE_WORKER, 258, // 136
0x1C, 2, ROLE_WORKER, 258, // 137
0x1C, 3, ROLE_WORKER, 258, // 138
0x1C, 4, ROLE_WORKER, 258, // 139
0x1C, 5, ROLE_WORKER, 258, // 140
0x1C, 6, ROLE_WORKER, 258, // 141
0x1C, 7, ROLE_WORKER, 258, // 142
0x16, 0, ROLE_WORKER, 258, // 143
0x16, 1, ROLE_WORKER, 258, // 144
0x16, 2, ROLE_WORKER, 258, // 145
0x16, 3, ROLE_WORKER, 258, // 146
0x16, 4, ROLE_WORKER, 258, // 147
0x2B, 0, ROLE_WORKER, 258, // 148
0x2B, 1, ROLE_WORKER, 258, // 149
0x2B, 2, ROLE_WORKER, 258, // 150
0x2B, 3, ROLE_WORKER, 258, // 151
0x2B, 4, ROLE_WORKER, 258, // 152
0x2B, 5, ROLE_WORKER, 258, // 153
0x2B, 6, ROLE_WORKER, 258, // 154
0x2B, 7, ROLE_WORKER, 258, // 155
0x2A, 0, ROLE_WORKER, 258, // 156
0x2A, 1, ROLE_WORKER, 258, // 157
0x2A, 2, ROLE_WORKER, 258, // 158
0x2A, 3, ROLE_WORKER, 258, // 159
0x2A, 4, ROLE_WORKER, 258, // 160
0x2A, 5, ROLE_WORKER, 258, // 161
0x2A, 6, ROLE_WORKER, 258, // 162
0x2A, 7, ROLE_WORKER, 258, // 163
0x29, 0, ROLE_WORKER, 258, // 164
0x29, 1, ROLE_WORKER, 258, // 165
0x29, 2, ROLE_WORKER, 258, // 166
0x29, 3, ROLE_WORKER, 258, // 167
0x29, 4, ROLE_WORKER, 258, // 168
0x29, 5, ROLE_WORKER, 258, // 169
0x29, 6, ROLE_WORKER, 258, // 170
0x29, 7, ROLE_WORKER, 258, // 171
0x28, 0, ROLE_WORKER, 258, // 172
0x28, 1, ROLE_WORKER, 258, // 173
0x28, 2, ROLE_WORKER, 258, // 174
0x28, 3, ROLE_WORKER, 258, // 175
0x28, 4, ROLE_WORKER, 258, // 176
0x28, 5, ROLE_WORKER, 258, // 177
0x28, 6, ROLE_WORKER, 258, // 178
0x28, 7, ROLE_WORKER, 258, // 179
0x27, 0, ROLE_WORKER, 258, // 180
0x27, 1, ROLE_WORKER, 258, // 181
0x27, 2, ROLE_WORKER, 258, // 182
0x27, 3, ROLE_WORKER, 258, // 183
0x2F, 0, ROLE_WORKER, 258, // 184
0x2F, 1, ROLE_WORKER, 258, // 185
0x2F, 2, ROLE_WORKER, 258, // 186
0x2F, 3, ROLE_WORKER, 258, // 187
0x2F, 4, ROLE_WORKER, 258, // 188
0x2F, 5, ROLE_WORKER, 258, // 189
0x2F, 6, ROLE_WORKER, 258, // 190
0x2F, 7, ROLE_WORKER, 258, // 191
0x2E, 0, ROLE_WORKER, 259, // 192
0x2E, 1, ROLE_WORKER, 259, // 193
0x2E, 2, ROLE_WORKER, 259, // 194
0x2E, 3, ROLE_WORKER, 259, // 195
0x2E, 4, ROLE_WORKER, 259, // 196
0x2E, 5, ROLE_WORKER, 259, // 197
0x2E, 6, ROLE_WORKER, 259, // 198
0x2E, 7, ROLE_WORKER, 259, // 199
0x2D, 0, ROLE_WORKER, 259, // 200
0x2D, 1, ROLE_WORKER, 259, // 201
0x2D, 2, ROLE_WORKER, 259, // 202
0x2D, 3, ROLE_WORKER, 259, // 203
0x2D, 4, ROLE_WORKER, 259, // 204
0x2D, 5, ROLE_WORKER, 259, // 205
0x2D, 6, ROLE_WORKER, 259, // 206
0x2D, 7, ROLE_WORKER, 259, // 207
0x2C, 0, ROLE_WORKER, 259, // 208
0x2C, 1, ROLE_WORKER, 259, // 209
0x2C, 2, ROLE_WORKER, 259, // 210
0x2C, 3, ROLE_WORKER, 259, // 211
0x2C, 4, ROLE_WORKER, 259, // 212
0x2C, 5, ROLE_WORKER, 259, // 213
0x2C, 6, ROLE_WORKER, 259, // 214
0x2C, 7, ROLE_WORKER, 259, // 215
0x26, 0, ROLE_WORKER, 259, // 216
0x26, 1, ROLE_WORKER, 259, // 217
0x26, 2, ROLE_WORKER, 259, // 218
0x26, 3, ROLE_WORKER, 259, // 219
0x3B, 0, ROLE_WORKER, 259, // 220
0x3B, 1, ROLE_WORKER, 259, // 221
0x3B, 2, ROLE_WORKER, 259, // 222
0x3B, 3, ROLE_WORKER, 259, // 223
0x3B, 4, ROLE_WORKER, 259, // 224
0x3B, 5, ROLE_WORKER, 259, // 225
0x3B, 6, ROLE_WORKER, 259, // 226
0x3B, 7, ROLE_WORKER, 259, // 227
0x3A, 0, ROLE_WORKER, 259, // 228
0x3A, 1, ROLE_WORKER, 259, // 229
0x3A, 2, ROLE_WORKER, 259, // 230
0x3A, 3, ROLE_WORKER, 259, // 231
0x3A, 4, ROLE_WORKER, 259, // 232
0x3A, 5, ROLE_WORKER, 259, // 233
0x3A, 6, ROLE_WORKER, 259, // 234
0x3A, 7, ROLE_WORKER, 259, // 235
0x39, 0, ROLE_WORKER, 259, // 236
0x39, 1, ROLE_WORKER, 259, // 237
0x39, 2, ROLE_WORKER, 259, // 238
0x39, 3, ROLE_WORKER, 259, // 239
0x39, 4, ROLE_WORKER, 259, // 240
0x39, 5, ROLE_WORKER, 259, // 241
0x39, 6, ROLE_WORKER, 259, // 242
0x39, 7, ROLE_WORKER, 259, // 243
0x38, 0, ROLE_WORKER, 259, // 244
0x38, 1, ROLE_WORKER, 259, // 245
0x38, 2, ROLE_WORKER, 259, // 246
0x38, 3, ROLE_WORKER, 259, // 247
0x38, 4, ROLE_WORKER, 259, // 248
0x38, 5, ROLE_WORKER, 259, // 249
0x38, 6, ROLE_WORKER, 259, // 250
0x38, 7, ROLE_WORKER, 259, // 251
0x37, 0, ROLE_WORKER, 259, // 252
0x37, 1, ROLE_WORKER, 259, // 253
0x37, 2, ROLE_WORKER, 259, // 254
0x37, 3, ROLE_WORKER, 259, // 255
0x4B, 0, ROLE_SCHEDULER, 260, // 256
0x4B, 1, ROLE_SCHEDULER, 260, // 257
0x4B, 2, ROLE_SCHEDULER, 260, // 258
0x4B, 3, ROLE_SCHEDULER, 260, // 259
0x6B, 0, ROLE_SCHEDULER, -1, // 260
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_513_HET_FLAT:
return pr_init(515,
0x00, 0, ROLE_WORKER, 512, // 0
0x00, 1, ROLE_WORKER, 512, // 1
0x00, 2, ROLE_WORKER, 512, // 2
0x00, 3, ROLE_WORKER, 512, // 3
0x00, 4, ROLE_WORKER, 512, // 4
0x00, 5, ROLE_WORKER, 512, // 5
0x00, 6, ROLE_WORKER, 512, // 6
0x00, 7, ROLE_WORKER, 512, // 7
0x01, 0, ROLE_WORKER, 512, // 8
0x01, 1, ROLE_WORKER, 512, // 9
0x01, 2, ROLE_WORKER, 512, // 10
0x01, 3, ROLE_WORKER, 512, // 11
0x01, 4, ROLE_WORKER, 512, // 12
0x01, 5, ROLE_WORKER, 512, // 13
0x01, 6, ROLE_WORKER, 512, // 14
0x01, 7, ROLE_WORKER, 512, // 15
0x02, 0, ROLE_WORKER, 512, // 16
0x02, 1, ROLE_WORKER, 512, // 17
0x02, 2, ROLE_WORKER, 512, // 18
0x02, 3, ROLE_WORKER, 512, // 19
0x02, 4, ROLE_WORKER, 512, // 20
0x02, 5, ROLE_WORKER, 512, // 21
0x02, 6, ROLE_WORKER, 512, // 22
0x02, 7, ROLE_WORKER, 512, // 23
0x03, 0, ROLE_WORKER, 512, // 24
0x03, 1, ROLE_WORKER, 512, // 25
0x03, 2, ROLE_WORKER, 512, // 26
0x03, 3, ROLE_WORKER, 512, // 27
0x03, 4, ROLE_WORKER, 512, // 28
0x03, 5, ROLE_WORKER, 512, // 29
0x03, 6, ROLE_WORKER, 512, // 30
0x03, 7, ROLE_WORKER, 512, // 31
0x04, 0, ROLE_WORKER, 512, // 32
0x04, 1, ROLE_WORKER, 512, // 33
0x04, 2, ROLE_WORKER, 512, // 34
0x04, 3, ROLE_WORKER, 512, // 35
0x04, 4, ROLE_WORKER, 512, // 36
0x04, 5, ROLE_WORKER, 512, // 37
0x04, 6, ROLE_WORKER, 512, // 38
0x04, 7, ROLE_WORKER, 512, // 39
0x05, 0, ROLE_WORKER, 512, // 40
0x05, 1, ROLE_WORKER, 512, // 41
0x05, 2, ROLE_WORKER, 512, // 42
0x05, 3, ROLE_WORKER, 512, // 43
0x05, 4, ROLE_WORKER, 512, // 44
0x05, 5, ROLE_WORKER, 512, // 45
0x05, 6, ROLE_WORKER, 512, // 46
0x05, 7, ROLE_WORKER, 512, // 47
0x06, 0, ROLE_WORKER, 512, // 48
0x06, 1, ROLE_WORKER, 512, // 49
0x06, 2, ROLE_WORKER, 512, // 50
0x06, 3, ROLE_WORKER, 512, // 51
0x06, 4, ROLE_WORKER, 512, // 52
0x06, 5, ROLE_WORKER, 512, // 53
0x06, 6, ROLE_WORKER, 512, // 54
0x06, 7, ROLE_WORKER, 512, // 55
0x07, 0, ROLE_WORKER, 512, // 56
0x07, 1, ROLE_WORKER, 512, // 57
0x07, 2, ROLE_WORKER, 512, // 58
0x07, 3, ROLE_WORKER, 512, // 59
0x07, 4, ROLE_WORKER, 512, // 60
0x07, 5, ROLE_WORKER, 512, // 61
0x07, 6, ROLE_WORKER, 512, // 62
0x07, 7, ROLE_WORKER, 512, // 63
0x08, 0, ROLE_WORKER, 512, // 64
0x08, 1, ROLE_WORKER, 512, // 65
0x08, 2, ROLE_WORKER, 512, // 66
0x08, 3, ROLE_WORKER, 512, // 67
0x08, 4, ROLE_WORKER, 512, // 68
0x08, 5, ROLE_WORKER, 512, // 69
0x08, 6, ROLE_WORKER, 512, // 70
0x08, 7, ROLE_WORKER, 512, // 71
0x09, 0, ROLE_WORKER, 512, // 72
0x09, 1, ROLE_WORKER, 512, // 73
0x09, 2, ROLE_WORKER, 512, // 74
0x09, 3, ROLE_WORKER, 512, // 75
0x09, 4, ROLE_WORKER, 512, // 76
0x09, 5, ROLE_WORKER, 512, // 77
0x09, 6, ROLE_WORKER, 512, // 78
0x09, 7, ROLE_WORKER, 512, // 79
0x0A, 0, ROLE_WORKER, 512, // 80
0x0A, 1, ROLE_WORKER, 512, // 81
0x0A, 2, ROLE_WORKER, 512, // 82
0x0A, 3, ROLE_WORKER, 512, // 83
0x0A, 4, ROLE_WORKER, 512, // 84
0x0A, 5, ROLE_WORKER, 512, // 85
0x0A, 6, ROLE_WORKER, 512, // 86
0x0A, 7, ROLE_WORKER, 512, // 87
0x0B, 0, ROLE_WORKER, 512, // 88
0x0B, 1, ROLE_WORKER, 512, // 89
0x0B, 2, ROLE_WORKER, 512, // 90
0x0B, 3, ROLE_WORKER, 512, // 91
0x0B, 4, ROLE_WORKER, 512, // 92
0x0B, 5, ROLE_WORKER, 512, // 93
0x0B, 6, ROLE_WORKER, 512, // 94
0x0B, 7, ROLE_WORKER, 512, // 95
0x0C, 0, ROLE_WORKER, 512, // 96
0x0C, 1, ROLE_WORKER, 512, // 97
0x0C, 2, ROLE_WORKER, 512, // 98
0x0C, 3, ROLE_WORKER, 512, // 99
0x0C, 4, ROLE_WORKER, 512, // 100
0x0C, 5, ROLE_WORKER, 512, // 101
0x0C, 6, ROLE_WORKER, 512, // 102
0x0C, 7, ROLE_WORKER, 512, // 103
0x0D, 0, ROLE_WORKER, 512, // 104
0x0D, 1, ROLE_WORKER, 512, // 105
0x0D, 2, ROLE_WORKER, 512, // 106
0x0D, 3, ROLE_WORKER, 512, // 107
0x0D, 4, ROLE_WORKER, 512, // 108
0x0D, 5, ROLE_WORKER, 512, // 109
0x0D, 6, ROLE_WORKER, 512, // 110
0x0D, 7, ROLE_WORKER, 512, // 111
0x0E, 0, ROLE_WORKER, 512, // 112
0x0E, 1, ROLE_WORKER, 512, // 113
0x0E, 2, ROLE_WORKER, 512, // 114
0x0E, 3, ROLE_WORKER, 512, // 115
0x0E, 4, ROLE_WORKER, 512, // 116
0x0E, 5, ROLE_WORKER, 512, // 117
0x0E, 6, ROLE_WORKER, 512, // 118
0x0E, 7, ROLE_WORKER, 512, // 119
0x0F, 0, ROLE_WORKER, 512, // 120
0x0F, 1, ROLE_WORKER, 512, // 121
0x0F, 2, ROLE_WORKER, 512, // 122
0x0F, 3, ROLE_WORKER, 512, // 123
0x0F, 4, ROLE_WORKER, 512, // 124
0x0F, 5, ROLE_WORKER, 512, // 125
0x0F, 6, ROLE_WORKER, 512, // 126
0x0F, 7, ROLE_WORKER, 512, // 127
0x10, 0, ROLE_WORKER, 512, // 128
0x10, 1, ROLE_WORKER, 512, // 129
0x10, 2, ROLE_WORKER, 512, // 130
0x10, 3, ROLE_WORKER, 512, // 131
0x10, 4, ROLE_WORKER, 512, // 132
0x10, 5, ROLE_WORKER, 512, // 133
0x10, 6, ROLE_WORKER, 512, // 134
0x10, 7, ROLE_WORKER, 512, // 135
0x11, 0, ROLE_WORKER, 512, // 136
0x11, 1, ROLE_WORKER, 512, // 137
0x11, 2, ROLE_WORKER, 512, // 138
0x11, 3, ROLE_WORKER, 512, // 139
0x11, 4, ROLE_WORKER, 512, // 140
0x11, 5, ROLE_WORKER, 512, // 141
0x11, 6, ROLE_WORKER, 512, // 142
0x11, 7, ROLE_WORKER, 512, // 143
0x12, 0, ROLE_WORKER, 512, // 144
0x12, 1, ROLE_WORKER, 512, // 145
0x12, 2, ROLE_WORKER, 512, // 146
0x12, 3, ROLE_WORKER, 512, // 147
0x12, 4, ROLE_WORKER, 512, // 148
0x12, 5, ROLE_WORKER, 512, // 149
0x12, 6, ROLE_WORKER, 512, // 150
0x12, 7, ROLE_WORKER, 512, // 151
0x13, 0, ROLE_WORKER, 512, // 152
0x13, 1, ROLE_WORKER, 512, // 153
0x13, 2, ROLE_WORKER, 512, // 154
0x13, 3, ROLE_WORKER, 512, // 155
0x13, 4, ROLE_WORKER, 512, // 156
0x13, 5, ROLE_WORKER, 512, // 157
0x13, 6, ROLE_WORKER, 512, // 158
0x13, 7, ROLE_WORKER, 512, // 159
0x14, 0, ROLE_WORKER, 512, // 160
0x14, 1, ROLE_WORKER, 512, // 161
0x14, 2, ROLE_WORKER, 512, // 162
0x14, 3, ROLE_WORKER, 512, // 163
0x14, 4, ROLE_WORKER, 512, // 164
0x14, 5, ROLE_WORKER, 512, // 165
0x14, 6, ROLE_WORKER, 512, // 166
0x14, 7, ROLE_WORKER, 512, // 167
0x15, 0, ROLE_WORKER, 512, // 168
0x15, 1, ROLE_WORKER, 512, // 169
0x15, 2, ROLE_WORKER, 512, // 170
0x15, 3, ROLE_WORKER, 512, // 171
0x15, 4, ROLE_WORKER, 512, // 172
0x15, 5, ROLE_WORKER, 512, // 173
0x15, 6, ROLE_WORKER, 512, // 174
0x15, 7, ROLE_WORKER, 512, // 175
0x16, 0, ROLE_WORKER, 512, // 176
0x16, 1, ROLE_WORKER, 512, // 177
0x16, 2, ROLE_WORKER, 512, // 178
0x16, 3, ROLE_WORKER, 512, // 179
0x16, 4, ROLE_WORKER, 512, // 180
0x16, 5, ROLE_WORKER, 512, // 181
0x16, 6, ROLE_WORKER, 512, // 182
0x16, 7, ROLE_WORKER, 512, // 183
0x17, 0, ROLE_WORKER, 512, // 184
0x17, 1, ROLE_WORKER, 512, // 185
0x17, 2, ROLE_WORKER, 512, // 186
0x17, 3, ROLE_WORKER, 512, // 187
0x17, 4, ROLE_WORKER, 512, // 188
0x17, 5, ROLE_WORKER, 512, // 189
0x17, 6, ROLE_WORKER, 512, // 190
0x17, 7, ROLE_WORKER, 512, // 191
0x18, 0, ROLE_WORKER, 512, // 192
0x18, 1, ROLE_WORKER, 512, // 193
0x18, 2, ROLE_WORKER, 512, // 194
0x18, 3, ROLE_WORKER, 512, // 195
0x18, 4, ROLE_WORKER, 512, // 196
0x18, 5, ROLE_WORKER, 512, // 197
0x18, 6, ROLE_WORKER, 512, // 198
0x18, 7, ROLE_WORKER, 512, // 199
0x19, 0, ROLE_WORKER, 512, // 200
0x19, 1, ROLE_WORKER, 512, // 201
0x19, 2, ROLE_WORKER, 512, // 202
0x19, 3, ROLE_WORKER, 512, // 203
0x19, 4, ROLE_WORKER, 512, // 204
0x19, 5, ROLE_WORKER, 512, // 205
0x19, 6, ROLE_WORKER, 512, // 206
0x19, 7, ROLE_WORKER, 512, // 207
0x1A, 0, ROLE_WORKER, 512, // 208
0x1A, 1, ROLE_WORKER, 512, // 209
0x1A, 2, ROLE_WORKER, 512, // 210
0x1A, 3, ROLE_WORKER, 512, // 211
0x1A, 4, ROLE_WORKER, 512, // 212
0x1A, 5, ROLE_WORKER, 512, // 213
0x1A, 6, ROLE_WORKER, 512, // 214
0x1A, 7, ROLE_WORKER, 512, // 215
0x1B, 0, ROLE_WORKER, 512, // 216
0x1B, 1, ROLE_WORKER, 512, // 217
0x1B, 2, ROLE_WORKER, 512, // 218
0x1B, 3, ROLE_WORKER, 512, // 219
0x1B, 4, ROLE_WORKER, 512, // 220
0x1B, 5, ROLE_WORKER, 512, // 221
0x1B, 6, ROLE_WORKER, 512, // 222
0x1B, 7, ROLE_WORKER, 512, // 223
0x1C, 0, ROLE_WORKER, 512, // 224
0x1C, 1, ROLE_WORKER, 512, // 225
0x1C, 2, ROLE_WORKER, 512, // 226
0x1C, 3, ROLE_WORKER, 512, // 227
0x1C, 4, ROLE_WORKER, 512, // 228
0x1C, 5, ROLE_WORKER, 512, // 229
0x1C, 6, ROLE_WORKER, 512, // 230
0x1C, 7, ROLE_WORKER, 512, // 231
0x1D, 0, ROLE_WORKER, 512, // 232
0x1D, 1, ROLE_WORKER, 512, // 233
0x1D, 2, ROLE_WORKER, 512, // 234
0x1D, 3, ROLE_WORKER, 512, // 235
0x1D, 4, ROLE_WORKER, 512, // 236
0x1D, 5, ROLE_WORKER, 512, // 237
0x1D, 6, ROLE_WORKER, 512, // 238
0x1D, 7, ROLE_WORKER, 512, // 239
0x1E, 0, ROLE_WORKER, 512, // 240
0x1E, 1, ROLE_WORKER, 512, // 241
0x1E, 2, ROLE_WORKER, 512, // 242
0x1E, 3, ROLE_WORKER, 512, // 243
0x1E, 4, ROLE_WORKER, 512, // 244
0x1E, 5, ROLE_WORKER, 512, // 245
0x1E, 6, ROLE_WORKER, 512, // 246
0x1E, 7, ROLE_WORKER, 512, // 247
0x1F, 0, ROLE_WORKER, 512, // 248
0x1F, 1, ROLE_WORKER, 512, // 249
0x1F, 2, ROLE_WORKER, 512, // 250
0x1F, 3, ROLE_WORKER, 512, // 251
0x1F, 4, ROLE_WORKER, 512, // 252
0x1F, 5, ROLE_WORKER, 512, // 253
0x1F, 6, ROLE_WORKER, 512, // 254
0x1F, 7, ROLE_WORKER, 512, // 255
0x20, 0, ROLE_WORKER, 512, // 256
0x20, 1, ROLE_WORKER, 512, // 257
0x20, 2, ROLE_WORKER, 512, // 258
0x20, 3, ROLE_WORKER, 512, // 259
0x20, 4, ROLE_WORKER, 512, // 260
0x20, 5, ROLE_WORKER, 512, // 261
0x20, 6, ROLE_WORKER, 512, // 262
0x20, 7, ROLE_WORKER, 512, // 263
0x21, 0, ROLE_WORKER, 512, // 264
0x21, 1, ROLE_WORKER, 512, // 265
0x21, 2, ROLE_WORKER, 512, // 266
0x21, 3, ROLE_WORKER, 512, // 267
0x21, 4, ROLE_WORKER, 512, // 268
0x21, 5, ROLE_WORKER, 512, // 269
0x21, 6, ROLE_WORKER, 512, // 270
0x21, 7, ROLE_WORKER, 512, // 271
0x22, 0, ROLE_WORKER, 512, // 272
0x22, 1, ROLE_WORKER, 512, // 273
0x22, 2, ROLE_WORKER, 512, // 274
0x22, 3, ROLE_WORKER, 512, // 275
0x22, 4, ROLE_WORKER, 512, // 276
0x22, 5, ROLE_WORKER, 512, // 277
0x22, 6, ROLE_WORKER, 512, // 278
0x22, 7, ROLE_WORKER, 512, // 279
0x23, 0, ROLE_WORKER, 512, // 280
0x23, 1, ROLE_WORKER, 512, // 281
0x23, 2, ROLE_WORKER, 512, // 282
0x23, 3, ROLE_WORKER, 512, // 283
0x23, 4, ROLE_WORKER, 512, // 284
0x23, 5, ROLE_WORKER, 512, // 285
0x23, 6, ROLE_WORKER, 512, // 286
0x23, 7, ROLE_WORKER, 512, // 287
0x24, 0, ROLE_WORKER, 512, // 288
0x24, 1, ROLE_WORKER, 512, // 289
0x24, 2, ROLE_WORKER, 512, // 290
0x24, 3, ROLE_WORKER, 512, // 291
0x24, 4, ROLE_WORKER, 512, // 292
0x24, 5, ROLE_WORKER, 512, // 293
0x24, 6, ROLE_WORKER, 512, // 294
0x24, 7, ROLE_WORKER, 512, // 295
0x25, 0, ROLE_WORKER, 512, // 296
0x25, 1, ROLE_WORKER, 512, // 297
0x25, 2, ROLE_WORKER, 512, // 298
0x25, 3, ROLE_WORKER, 512, // 299
0x25, 4, ROLE_WORKER, 512, // 300
0x25, 5, ROLE_WORKER, 512, // 301
0x25, 6, ROLE_WORKER, 512, // 302
0x25, 7, ROLE_WORKER, 512, // 303
0x26, 0, ROLE_WORKER, 512, // 304
0x26, 1, ROLE_WORKER, 512, // 305
0x26, 2, ROLE_WORKER, 512, // 306
0x26, 3, ROLE_WORKER, 512, // 307
0x26, 4, ROLE_WORKER, 512, // 308
0x26, 5, ROLE_WORKER, 512, // 309
0x26, 6, ROLE_WORKER, 512, // 310
0x26, 7, ROLE_WORKER, 512, // 311
0x27, 0, ROLE_WORKER, 512, // 312
0x27, 1, ROLE_WORKER, 512, // 313
0x27, 2, ROLE_WORKER, 512, // 314
0x27, 3, ROLE_WORKER, 512, // 315
0x27, 4, ROLE_WORKER, 512, // 316
0x27, 5, ROLE_WORKER, 512, // 317
0x27, 6, ROLE_WORKER, 512, // 318
0x27, 7, ROLE_WORKER, 512, // 319
0x28, 0, ROLE_WORKER, 512, // 320
0x28, 1, ROLE_WORKER, 512, // 321
0x28, 2, ROLE_WORKER, 512, // 322
0x28, 3, ROLE_WORKER, 512, // 323
0x28, 4, ROLE_WORKER, 512, // 324
0x28, 5, ROLE_WORKER, 512, // 325
0x28, 6, ROLE_WORKER, 512, // 326
0x28, 7, ROLE_WORKER, 512, // 327
0x29, 0, ROLE_WORKER, 512, // 328
0x29, 1, ROLE_WORKER, 512, // 329
0x29, 2, ROLE_WORKER, 512, // 330
0x29, 3, ROLE_WORKER, 512, // 331
0x29, 4, ROLE_WORKER, 512, // 332
0x29, 5, ROLE_WORKER, 512, // 333
0x29, 6, ROLE_WORKER, 512, // 334
0x29, 7, ROLE_WORKER, 512, // 335
0x2A, 0, ROLE_WORKER, 512, // 336
0x2A, 1, ROLE_WORKER, 512, // 337
0x2A, 2, ROLE_WORKER, 512, // 338
0x2A, 3, ROLE_WORKER, 512, // 339
0x2A, 4, ROLE_WORKER, 512, // 340
0x2A, 5, ROLE_WORKER, 512, // 341
0x2A, 6, ROLE_WORKER, 512, // 342
0x2A, 7, ROLE_WORKER, 512, // 343
0x2B, 0, ROLE_WORKER, 512, // 344
0x2B, 1, ROLE_WORKER, 512, // 345
0x2B, 2, ROLE_WORKER, 512, // 346
0x2B, 3, ROLE_WORKER, 512, // 347
0x2B, 4, ROLE_WORKER, 512, // 348
0x2B, 5, ROLE_WORKER, 512, // 349
0x2B, 6, ROLE_WORKER, 512, // 350
0x2B, 7, ROLE_WORKER, 512, // 351
0x2C, 0, ROLE_WORKER, 512, // 352
0x2C, 1, ROLE_WORKER, 512, // 353
0x2C, 2, ROLE_WORKER, 512, // 354
0x2C, 3, ROLE_WORKER, 512, // 355
0x2C, 4, ROLE_WORKER, 512, // 356
0x2C, 5, ROLE_WORKER, 512, // 357
0x2C, 6, ROLE_WORKER, 512, // 358
0x2C, 7, ROLE_WORKER, 512, // 359
0x2D, 0, ROLE_WORKER, 512, // 360
0x2D, 1, ROLE_WORKER, 512, // 361
0x2D, 2, ROLE_WORKER, 512, // 362
0x2D, 3, ROLE_WORKER, 512, // 363
0x2D, 4, ROLE_WORKER, 512, // 364
0x2D, 5, ROLE_WORKER, 512, // 365
0x2D, 6, ROLE_WORKER, 512, // 366
0x2D, 7, ROLE_WORKER, 512, // 367
0x2E, 0, ROLE_WORKER, 512, // 368
0x2E, 1, ROLE_WORKER, 512, // 369
0x2E, 2, ROLE_WORKER, 512, // 370
0x2E, 3, ROLE_WORKER, 512, // 371
0x2E, 4, ROLE_WORKER, 512, // 372
0x2E, 5, ROLE_WORKER, 512, // 373
0x2E, 6, ROLE_WORKER, 512, // 374
0x2E, 7, ROLE_WORKER, 512, // 375
0x2F, 0, ROLE_WORKER, 512, // 376
0x2F, 1, ROLE_WORKER, 512, // 377
0x2F, 2, ROLE_WORKER, 512, // 378
0x2F, 3, ROLE_WORKER, 512, // 379
0x2F, 4, ROLE_WORKER, 512, // 380
0x2F, 5, ROLE_WORKER, 512, // 381
0x2F, 6, ROLE_WORKER, 512, // 382
0x2F, 7, ROLE_WORKER, 512, // 383
0x30, 0, ROLE_WORKER, 512, // 384
0x30, 1, ROLE_WORKER, 512, // 385
0x30, 2, ROLE_WORKER, 512, // 386
0x30, 3, ROLE_WORKER, 512, // 387
0x30, 4, ROLE_WORKER, 512, // 388
0x30, 5, ROLE_WORKER, 512, // 389
0x30, 6, ROLE_WORKER, 512, // 390
0x30, 7, ROLE_WORKER, 512, // 391
0x31, 0, ROLE_WORKER, 512, // 392
0x31, 1, ROLE_WORKER, 512, // 393
0x31, 2, ROLE_WORKER, 512, // 394
0x31, 3, ROLE_WORKER, 512, // 395
0x31, 4, ROLE_WORKER, 512, // 396
0x31, 5, ROLE_WORKER, 512, // 397
0x31, 6, ROLE_WORKER, 512, // 398
0x31, 7, ROLE_WORKER, 512, // 399
0x32, 0, ROLE_WORKER, 512, // 400
0x32, 1, ROLE_WORKER, 512, // 401
0x32, 2, ROLE_WORKER, 512, // 402
0x32, 3, ROLE_WORKER, 512, // 403
0x32, 4, ROLE_WORKER, 512, // 404
0x32, 5, ROLE_WORKER, 512, // 405
0x32, 6, ROLE_WORKER, 512, // 406
0x32, 7, ROLE_WORKER, 512, // 407
0x33, 0, ROLE_WORKER, 512, // 408
0x33, 1, ROLE_WORKER, 512, // 409
0x33, 2, ROLE_WORKER, 512, // 410
0x33, 3, ROLE_WORKER, 512, // 411
0x33, 4, ROLE_WORKER, 512, // 412
0x33, 5, ROLE_WORKER, 512, // 413
0x33, 6, ROLE_WORKER, 512, // 414
0x33, 7, ROLE_WORKER, 512, // 415
0x34, 0, ROLE_WORKER, 512, // 416
0x34, 1, ROLE_WORKER, 512, // 417
0x34, 2, ROLE_WORKER, 512, // 418
0x34, 3, ROLE_WORKER, 512, // 419
0x34, 4, ROLE_WORKER, 512, // 420
0x34, 5, ROLE_WORKER, 512, // 421
0x34, 6, ROLE_WORKER, 512, // 422
0x34, 7, ROLE_WORKER, 512, // 423
0x35, 0, ROLE_WORKER, 512, // 424
0x35, 1, ROLE_WORKER, 512, // 425
0x35, 2, ROLE_WORKER, 512, // 426
0x35, 3, ROLE_WORKER, 512, // 427
0x35, 4, ROLE_WORKER, 512, // 428
0x35, 5, ROLE_WORKER, 512, // 429
0x35, 6, ROLE_WORKER, 512, // 430
0x35, 7, ROLE_WORKER, 512, // 431
0x36, 0, ROLE_WORKER, 512, // 432
0x36, 1, ROLE_WORKER, 512, // 433
0x36, 2, ROLE_WORKER, 512, // 434
0x36, 3, ROLE_WORKER, 512, // 435
0x36, 4, ROLE_WORKER, 512, // 436
0x36, 5, ROLE_WORKER, 512, // 437
0x36, 6, ROLE_WORKER, 512, // 438
0x36, 7, ROLE_WORKER, 512, // 439
0x37, 0, ROLE_WORKER, 512, // 440
0x37, 1, ROLE_WORKER, 512, // 441
0x37, 2, ROLE_WORKER, 512, // 442
0x37, 3, ROLE_WORKER, 512, // 443
0x37, 4, ROLE_WORKER, 512, // 444
0x37, 5, ROLE_WORKER, 512, // 445
0x37, 6, ROLE_WORKER, 512, // 446
0x37, 7, ROLE_WORKER, 512, // 447
0x38, 0, ROLE_WORKER, 512, // 448
0x38, 1, ROLE_WORKER, 512, // 449
0x38, 2, ROLE_WORKER, 512, // 450
0x38, 3, ROLE_WORKER, 512, // 451
0x38, 4, ROLE_WORKER, 512, // 452
0x38, 5, ROLE_WORKER, 512, // 453
0x38, 6, ROLE_WORKER, 512, // 454
0x38, 7, ROLE_WORKER, 512, // 455
0x39, 0, ROLE_WORKER, 512, // 456
0x39, 1, ROLE_WORKER, 512, // 457
0x39, 2, ROLE_WORKER, 512, // 458
0x39, 3, ROLE_WORKER, 512, // 459
0x39, 4, ROLE_WORKER, 512, // 460
0x39, 5, ROLE_WORKER, 512, // 461
0x39, 6, ROLE_WORKER, 512, // 462
0x39, 7, ROLE_WORKER, 512, // 463
0x3A, 0, ROLE_WORKER, 512, // 464
0x3A, 1, ROLE_WORKER, 512, // 465
0x3A, 2, ROLE_WORKER, 512, // 466
0x3A, 3, ROLE_WORKER, 512, // 467
0x3A, 4, ROLE_WORKER, 512, // 468
0x3A, 5, ROLE_WORKER, 512, // 469
0x3A, 6, ROLE_WORKER, 512, // 470
0x3A, 7, ROLE_WORKER, 512, // 471
0x3B, 0, ROLE_WORKER, 512, // 472
0x3B, 1, ROLE_WORKER, 512, // 473
0x3B, 2, ROLE_WORKER, 512, // 474
0x3B, 3, ROLE_WORKER, 512, // 475
0x3B, 4, ROLE_WORKER, 512, // 476
0x3B, 5, ROLE_WORKER, 512, // 477
0x3B, 6, ROLE_WORKER, 512, // 478
0x3B, 7, ROLE_WORKER, 512, // 479
0x3C, 0, ROLE_WORKER, 512, // 480
0x3C, 1, ROLE_WORKER, 512, // 481
0x3C, 2, ROLE_WORKER, 512, // 482
0x3C, 3, ROLE_WORKER, 512, // 483
0x3C, 4, ROLE_WORKER, 512, // 484
0x3C, 5, ROLE_WORKER, 512, // 485
0x3C, 6, ROLE_WORKER, 512, // 486
0x3C, 7, ROLE_WORKER, 512, // 487
0x3D, 0, ROLE_WORKER, 512, // 488
0x3D, 1, ROLE_WORKER, 512, // 489
0x3D, 2, ROLE_WORKER, 512, // 490
0x3D, 3, ROLE_WORKER, 512, // 491
0x3D, 4, ROLE_WORKER, 512, // 492
0x3D, 5, ROLE_WORKER, 512, // 493
0x3D, 6, ROLE_WORKER, 512, // 494
0x3D, 7, ROLE_WORKER, 512, // 495
0x3E, 0, ROLE_WORKER, 512, // 496
0x3E, 1, ROLE_WORKER, 512, // 497
0x3E, 2, ROLE_WORKER, 512, // 498
0x3E, 3, ROLE_WORKER, 512, // 499
0x3E, 4, ROLE_WORKER, 512, // 500
0x3E, 5, ROLE_WORKER, 512, // 501
0x3E, 6, ROLE_WORKER, 512, // 502
0x3E, 7, ROLE_WORKER, 512, // 503
0x3F, 0, ROLE_WORKER, 512, // 504
0x3F, 1, ROLE_WORKER, 512, // 505
0x3F, 2, ROLE_WORKER, 512, // 506
0x3F, 3, ROLE_WORKER, 512, // 507
0x3F, 4, ROLE_WORKER, 512, // 508
0x3F, 5, ROLE_WORKER, 512, // 509
0x3F, 6, ROLE_WORKER, 512, // 510
0x3F, 7, ROLE_WORKER, 512, // 511
0x6B, 0, ROLE_SCHEDULER, -1, // 512
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// ======================================================================
case PR_VID_517_HET_HIER:
return pr_init(519,
0x00, 0, ROLE_WORKER, 512, // 0
0x00, 1, ROLE_WORKER, 512, // 1
0x00, 2, ROLE_WORKER, 512, // 2
0x00, 3, ROLE_WORKER, 512, // 3
0x00, 4, ROLE_WORKER, 512, // 4
0x00, 5, ROLE_WORKER, 512, // 5
0x00, 6, ROLE_WORKER, 512, // 6
0x00, 7, ROLE_WORKER, 512, // 7
0x01, 0, ROLE_WORKER, 512, // 8
0x01, 1, ROLE_WORKER, 512, // 9
0x01, 2, ROLE_WORKER, 512, // 10
0x01, 3, ROLE_WORKER, 512, // 11
0x01, 4, ROLE_WORKER, 512, // 12
0x01, 5, ROLE_WORKER, 512, // 13
0x01, 6, ROLE_WORKER, 512, // 14
0x01, 7, ROLE_WORKER, 512, // 15
0x02, 0, ROLE_WORKER, 512, // 16
0x02, 1, ROLE_WORKER, 512, // 17
0x02, 2, ROLE_WORKER, 512, // 18
0x02, 3, ROLE_WORKER, 512, // 19
0x02, 4, ROLE_WORKER, 512, // 20
0x02, 5, ROLE_WORKER, 512, // 21
0x02, 6, ROLE_WORKER, 512, // 22
0x02, 7, ROLE_WORKER, 512, // 23
0x03, 0, ROLE_WORKER, 512, // 24
0x03, 1, ROLE_WORKER, 512, // 25
0x03, 2, ROLE_WORKER, 512, // 26
0x03, 3, ROLE_WORKER, 512, // 27
0x03, 4, ROLE_WORKER, 512, // 28
0x03, 5, ROLE_WORKER, 512, // 29
0x03, 6, ROLE_WORKER, 512, // 30
0x03, 7, ROLE_WORKER, 512, // 31
0x04, 0, ROLE_WORKER, 512, // 32
0x04, 1, ROLE_WORKER, 512, // 33
0x04, 2, ROLE_WORKER, 512, // 34
0x04, 3, ROLE_WORKER, 512, // 35
0x04, 4, ROLE_WORKER, 512, // 36
0x04, 5, ROLE_WORKER, 512, // 37
0x04, 6, ROLE_WORKER, 512, // 38
0x04, 7, ROLE_WORKER, 512, // 39
0x05, 0, ROLE_WORKER, 512, // 40
0x05, 1, ROLE_WORKER, 512, // 41
0x05, 2, ROLE_WORKER, 512, // 42
0x05, 3, ROLE_WORKER, 512, // 43
0x05, 4, ROLE_WORKER, 512, // 44
0x05, 5, ROLE_WORKER, 512, // 45
0x05, 6, ROLE_WORKER, 512, // 46
0x05, 7, ROLE_WORKER, 512, // 47
0x06, 0, ROLE_WORKER, 512, // 48
0x06, 1, ROLE_WORKER, 512, // 49
0x06, 2, ROLE_WORKER, 512, // 50
0x06, 3, ROLE_WORKER, 512, // 51
0x06, 4, ROLE_WORKER, 512, // 52
0x06, 5, ROLE_WORKER, 512, // 53
0x06, 6, ROLE_WORKER, 512, // 54
0x06, 7, ROLE_WORKER, 512, // 55
0x07, 0, ROLE_WORKER, 512, // 56
0x07, 1, ROLE_WORKER, 512, // 57
0x07, 2, ROLE_WORKER, 512, // 58
0x07, 3, ROLE_WORKER, 512, // 59
0x07, 4, ROLE_WORKER, 512, // 60
0x07, 5, ROLE_WORKER, 512, // 61
0x07, 6, ROLE_WORKER, 512, // 62
0x07, 7, ROLE_WORKER, 512, // 63
0x08, 0, ROLE_WORKER, 512, // 64
0x08, 1, ROLE_WORKER, 512, // 65
0x08, 2, ROLE_WORKER, 512, // 66
0x08, 3, ROLE_WORKER, 512, // 67
0x08, 4, ROLE_WORKER, 512, // 68
0x08, 5, ROLE_WORKER, 512, // 69
0x08, 6, ROLE_WORKER, 512, // 70
0x08, 7, ROLE_WORKER, 512, // 71
0x09, 0, ROLE_WORKER, 512, // 72
0x09, 1, ROLE_WORKER, 512, // 73
0x09, 2, ROLE_WORKER, 512, // 74
0x09, 3, ROLE_WORKER, 512, // 75
0x09, 4, ROLE_WORKER, 512, // 76
0x09, 5, ROLE_WORKER, 512, // 77
0x09, 6, ROLE_WORKER, 512, // 78
0x09, 7, ROLE_WORKER, 512, // 79
0x0A, 0, ROLE_WORKER, 512, // 80
0x0A, 1, ROLE_WORKER, 512, // 81
0x0A, 2, ROLE_WORKER, 512, // 82
0x0A, 3, ROLE_WORKER, 512, // 83
0x0A, 4, ROLE_WORKER, 512, // 84
0x0A, 5, ROLE_WORKER, 512, // 85
0x0A, 6, ROLE_WORKER, 512, // 86
0x0A, 7, ROLE_WORKER, 512, // 87
0x0B, 0, ROLE_WORKER, 512, // 88
0x0B, 1, ROLE_WORKER, 512, // 89
0x0B, 2, ROLE_WORKER, 512, // 90
0x0B, 3, ROLE_WORKER, 512, // 91
0x0B, 4, ROLE_WORKER, 512, // 92
0x0B, 5, ROLE_WORKER, 512, // 93
0x0B, 6, ROLE_WORKER, 512, // 94
0x0B, 7, ROLE_WORKER, 512, // 95
0x0C, 0, ROLE_WORKER, 512, // 96
0x0C, 1, ROLE_WORKER, 512, // 97
0x0C, 2, ROLE_WORKER, 512, // 98
0x0C, 3, ROLE_WORKER, 512, // 99
0x0C, 4, ROLE_WORKER, 512, // 100
0x0C, 5, ROLE_WORKER, 512, // 101
0x0C, 6, ROLE_WORKER, 512, // 102
0x0C, 7, ROLE_WORKER, 512, // 103
0x0D, 0, ROLE_WORKER, 512, // 104
0x0D, 1, ROLE_WORKER, 512, // 105
0x0D, 2, ROLE_WORKER, 512, // 106
0x0D, 3, ROLE_WORKER, 512, // 107
0x0D, 4, ROLE_WORKER, 512, // 108
0x0D, 5, ROLE_WORKER, 512, // 109
0x0D, 6, ROLE_WORKER, 512, // 110
0x0D, 7, ROLE_WORKER, 512, // 111
0x0E, 0, ROLE_WORKER, 512, // 112
0x0E, 1, ROLE_WORKER, 512, // 113
0x0E, 2, ROLE_WORKER, 512, // 114
0x0E, 3, ROLE_WORKER, 512, // 115
0x0E, 4, ROLE_WORKER, 512, // 116
0x0E, 5, ROLE_WORKER, 512, // 117
0x0E, 6, ROLE_WORKER, 512, // 118
0x0E, 7, ROLE_WORKER, 512, // 119
0x0F, 0, ROLE_WORKER, 512, // 120
0x0F, 1, ROLE_WORKER, 512, // 121
0x0F, 2, ROLE_WORKER, 512, // 122
0x0F, 3, ROLE_WORKER, 512, // 123
0x0F, 4, ROLE_WORKER, 512, // 124
0x0F, 5, ROLE_WORKER, 512, // 125
0x0F, 6, ROLE_WORKER, 512, // 126
0x0F, 7, ROLE_WORKER, 512, // 127
0x10, 0, ROLE_WORKER, 513, // 128
0x10, 1, ROLE_WORKER, 513, // 129
0x10, 2, ROLE_WORKER, 513, // 130
0x10, 3, ROLE_WORKER, 513, // 131
0x10, 4, ROLE_WORKER, 513, // 132
0x10, 5, ROLE_WORKER, 513, // 133
0x10, 6, ROLE_WORKER, 513, // 134
0x10, 7, ROLE_WORKER, 513, // 135
0x11, 0, ROLE_WORKER, 513, // 136
0x11, 1, ROLE_WORKER, 513, // 137
0x11, 2, ROLE_WORKER, 513, // 138
0x11, 3, ROLE_WORKER, 513, // 139
0x11, 4, ROLE_WORKER, 513, // 140
0x11, 5, ROLE_WORKER, 513, // 141
0x11, 6, ROLE_WORKER, 513, // 142
0x11, 7, ROLE_WORKER, 513, // 143
0x12, 0, ROLE_WORKER, 513, // 144
0x12, 1, ROLE_WORKER, 513, // 145
0x12, 2, ROLE_WORKER, 513, // 146
0x12, 3, ROLE_WORKER, 513, // 147
0x12, 4, ROLE_WORKER, 513, // 148
0x12, 5, ROLE_WORKER, 513, // 149
0x12, 6, ROLE_WORKER, 513, // 150
0x12, 7, ROLE_WORKER, 513, // 151
0x13, 0, ROLE_WORKER, 513, // 152
0x13, 1, ROLE_WORKER, 513, // 153
0x13, 2, ROLE_WORKER, 513, // 154
0x13, 3, ROLE_WORKER, 513, // 155
0x13, 4, ROLE_WORKER, 513, // 156
0x13, 5, ROLE_WORKER, 513, // 157
0x13, 6, ROLE_WORKER, 513, // 158
0x13, 7, ROLE_WORKER, 513, // 159
0x14, 0, ROLE_WORKER, 513, // 160
0x14, 1, ROLE_WORKER, 513, // 161
0x14, 2, ROLE_WORKER, 513, // 162
0x14, 3, ROLE_WORKER, 513, // 163
0x14, 4, ROLE_WORKER, 513, // 164
0x14, 5, ROLE_WORKER, 513, // 165
0x14, 6, ROLE_WORKER, 513, // 166
0x14, 7, ROLE_WORKER, 513, // 167
0x15, 0, ROLE_WORKER, 513, // 168
0x15, 1, ROLE_WORKER, 513, // 169
0x15, 2, ROLE_WORKER, 513, // 170
0x15, 3, ROLE_WORKER, 513, // 171
0x15, 4, ROLE_WORKER, 513, // 172
0x15, 5, ROLE_WORKER, 513, // 173
0x15, 6, ROLE_WORKER, 513, // 174
0x15, 7, ROLE_WORKER, 513, // 175
0x16, 0, ROLE_WORKER, 513, // 176
0x16, 1, ROLE_WORKER, 513, // 177
0x16, 2, ROLE_WORKER, 513, // 178
0x16, 3, ROLE_WORKER, 513, // 179
0x16, 4, ROLE_WORKER, 513, // 180
0x16, 5, ROLE_WORKER, 513, // 181
0x16, 6, ROLE_WORKER, 513, // 182
0x16, 7, ROLE_WORKER, 513, // 183
0x17, 0, ROLE_WORKER, 513, // 184
0x17, 1, ROLE_WORKER, 513, // 185
0x17, 2, ROLE_WORKER, 513, // 186
0x17, 3, ROLE_WORKER, 513, // 187
0x17, 4, ROLE_WORKER, 513, // 188
0x17, 5, ROLE_WORKER, 513, // 189
0x17, 6, ROLE_WORKER, 513, // 190
0x17, 7, ROLE_WORKER, 513, // 191
0x18, 0, ROLE_WORKER, 513, // 192
0x18, 1, ROLE_WORKER, 513, // 193
0x18, 2, ROLE_WORKER, 513, // 194
0x18, 3, ROLE_WORKER, 513, // 195
0x18, 4, ROLE_WORKER, 513, // 196
0x18, 5, ROLE_WORKER, 513, // 197
0x18, 6, ROLE_WORKER, 513, // 198
0x18, 7, ROLE_WORKER, 513, // 199
0x19, 0, ROLE_WORKER, 513, // 200
0x19, 1, ROLE_WORKER, 513, // 201
0x19, 2, ROLE_WORKER, 513, // 202
0x19, 3, ROLE_WORKER, 513, // 203
0x19, 4, ROLE_WORKER, 513, // 204
0x19, 5, ROLE_WORKER, 513, // 205
0x19, 6, ROLE_WORKER, 513, // 206
0x19, 7, ROLE_WORKER, 513, // 207
0x1A, 0, ROLE_WORKER, 513, // 208
0x1A, 1, ROLE_WORKER, 513, // 209
0x1A, 2, ROLE_WORKER, 513, // 210
0x1A, 3, ROLE_WORKER, 513, // 211
0x1A, 4, ROLE_WORKER, 513, // 212
0x1A, 5, ROLE_WORKER, 513, // 213
0x1A, 6, ROLE_WORKER, 513, // 214
0x1A, 7, ROLE_WORKER, 513, // 215
0x1B, 0, ROLE_WORKER, 513, // 216
0x1B, 1, ROLE_WORKER, 513, // 217
0x1B, 2, ROLE_WORKER, 513, // 218
0x1B, 3, ROLE_WORKER, 513, // 219
0x1B, 4, ROLE_WORKER, 513, // 220
0x1B, 5, ROLE_WORKER, 513, // 221
0x1B, 6, ROLE_WORKER, 513, // 222
0x1B, 7, ROLE_WORKER, 513, // 223
0x1C, 0, ROLE_WORKER, 513, // 224
0x1C, 1, ROLE_WORKER, 513, // 225
0x1C, 2, ROLE_WORKER, 513, // 226
0x1C, 3, ROLE_WORKER, 513, // 227
0x1C, 4, ROLE_WORKER, 513, // 228
0x1C, 5, ROLE_WORKER, 513, // 229
0x1C, 6, ROLE_WORKER, 513, // 230
0x1C, 7, ROLE_WORKER, 513, // 231
0x1D, 0, ROLE_WORKER, 513, // 232
0x1D, 1, ROLE_WORKER, 513, // 233
0x1D, 2, ROLE_WORKER, 513, // 234
0x1D, 3, ROLE_WORKER, 513, // 235
0x1D, 4, ROLE_WORKER, 513, // 236
0x1D, 5, ROLE_WORKER, 513, // 237
0x1D, 6, ROLE_WORKER, 513, // 238
0x1D, 7, ROLE_WORKER, 513, // 239
0x1E, 0, ROLE_WORKER, 513, // 240
0x1E, 1, ROLE_WORKER, 513, // 241
0x1E, 2, ROLE_WORKER, 513, // 242
0x1E, 3, ROLE_WORKER, 513, // 243
0x1E, 4, ROLE_WORKER, 513, // 244
0x1E, 5, ROLE_WORKER, 513, // 245
0x1E, 6, ROLE_WORKER, 513, // 246
0x1E, 7, ROLE_WORKER, 513, // 247
0x1F, 0, ROLE_WORKER, 513, // 248
0x1F, 1, ROLE_WORKER, 513, // 249
0x1F, 2, ROLE_WORKER, 513, // 250
0x1F, 3, ROLE_WORKER, 513, // 251
0x1F, 4, ROLE_WORKER, 513, // 252
0x1F, 5, ROLE_WORKER, 513, // 253
0x1F, 6, ROLE_WORKER, 513, // 254
0x1F, 7, ROLE_WORKER, 513, // 255
0x20, 0, ROLE_WORKER, 514, // 256
0x20, 1, ROLE_WORKER, 514, // 257
0x20, 2, ROLE_WORKER, 514, // 258
0x20, 3, ROLE_WORKER, 514, // 259
0x20, 4, ROLE_WORKER, 514, // 260
0x20, 5, ROLE_WORKER, 514, // 261
0x20, 6, ROLE_WORKER, 514, // 262
0x20, 7, ROLE_WORKER, 514, // 263
0x21, 0, ROLE_WORKER, 514, // 264
0x21, 1, ROLE_WORKER, 514, // 265
0x21, 2, ROLE_WORKER, 514, // 266
0x21, 3, ROLE_WORKER, 514, // 267
0x21, 4, ROLE_WORKER, 514, // 268
0x21, 5, ROLE_WORKER, 514, // 269
0x21, 6, ROLE_WORKER, 514, // 270
0x21, 7, ROLE_WORKER, 514, // 271
0x22, 0, ROLE_WORKER, 514, // 272
0x22, 1, ROLE_WORKER, 514, // 273
0x22, 2, ROLE_WORKER, 514, // 274
0x22, 3, ROLE_WORKER, 514, // 275
0x22, 4, ROLE_WORKER, 514, // 276
0x22, 5, ROLE_WORKER, 514, // 277
0x22, 6, ROLE_WORKER, 514, // 278
0x22, 7, ROLE_WORKER, 514, // 279
0x23, 0, ROLE_WORKER, 514, // 280
0x23, 1, ROLE_WORKER, 514, // 281
0x23, 2, ROLE_WORKER, 514, // 282
0x23, 3, ROLE_WORKER, 514, // 283
0x23, 4, ROLE_WORKER, 514, // 284
0x23, 5, ROLE_WORKER, 514, // 285
0x23, 6, ROLE_WORKER, 514, // 286
0x23, 7, ROLE_WORKER, 514, // 287
0x24, 0, ROLE_WORKER, 514, // 288
0x24, 1, ROLE_WORKER, 514, // 289
0x24, 2, ROLE_WORKER, 514, // 290
0x24, 3, ROLE_WORKER, 514, // 291
0x24, 4, ROLE_WORKER, 514, // 292
0x24, 5, ROLE_WORKER, 514, // 293
0x24, 6, ROLE_WORKER, 514, // 294
0x24, 7, ROLE_WORKER, 514, // 295
0x25, 0, ROLE_WORKER, 514, // 296
0x25, 1, ROLE_WORKER, 514, // 297
0x25, 2, ROLE_WORKER, 514, // 298
0x25, 3, ROLE_WORKER, 514, // 299
0x25, 4, ROLE_WORKER, 514, // 300
0x25, 5, ROLE_WORKER, 514, // 301
0x25, 6, ROLE_WORKER, 514, // 302
0x25, 7, ROLE_WORKER, 514, // 303
0x26, 0, ROLE_WORKER, 514, // 304
0x26, 1, ROLE_WORKER, 514, // 305
0x26, 2, ROLE_WORKER, 514, // 306
0x26, 3, ROLE_WORKER, 514, // 307
0x26, 4, ROLE_WORKER, 514, // 308
0x26, 5, ROLE_WORKER, 514, // 309
0x26, 6, ROLE_WORKER, 514, // 310
0x26, 7, ROLE_WORKER, 514, // 311
0x27, 0, ROLE_WORKER, 514, // 312
0x27, 1, ROLE_WORKER, 514, // 313
0x27, 2, ROLE_WORKER, 514, // 314
0x27, 3, ROLE_WORKER, 514, // 315
0x27, 4, ROLE_WORKER, 514, // 316
0x27, 5, ROLE_WORKER, 514, // 317
0x27, 6, ROLE_WORKER, 514, // 318
0x27, 7, ROLE_WORKER, 514, // 319
0x28, 0, ROLE_WORKER, 514, // 320
0x28, 1, ROLE_WORKER, 514, // 321
0x28, 2, ROLE_WORKER, 514, // 322
0x28, 3, ROLE_WORKER, 514, // 323
0x28, 4, ROLE_WORKER, 514, // 324
0x28, 5, ROLE_WORKER, 514, // 325
0x28, 6, ROLE_WORKER, 514, // 326
0x28, 7, ROLE_WORKER, 514, // 327
0x29, 0, ROLE_WORKER, 514, // 328
0x29, 1, ROLE_WORKER, 514, // 329
0x29, 2, ROLE_WORKER, 514, // 330
0x29, 3, ROLE_WORKER, 514, // 331
0x29, 4, ROLE_WORKER, 514, // 332
0x29, 5, ROLE_WORKER, 514, // 333
0x29, 6, ROLE_WORKER, 514, // 334
0x29, 7, ROLE_WORKER, 514, // 335
0x2A, 0, ROLE_WORKER, 514, // 336
0x2A, 1, ROLE_WORKER, 514, // 337
0x2A, 2, ROLE_WORKER, 514, // 338
0x2A, 3, ROLE_WORKER, 514, // 339
0x2A, 4, ROLE_WORKER, 514, // 340
0x2A, 5, ROLE_WORKER, 514, // 341
0x2A, 6, ROLE_WORKER, 514, // 342
0x2A, 7, ROLE_WORKER, 514, // 343
0x2B, 0, ROLE_WORKER, 514, // 344
0x2B, 1, ROLE_WORKER, 514, // 345
0x2B, 2, ROLE_WORKER, 514, // 346
0x2B, 3, ROLE_WORKER, 514, // 347
0x2B, 4, ROLE_WORKER, 514, // 348
0x2B, 5, ROLE_WORKER, 514, // 349
0x2B, 6, ROLE_WORKER, 514, // 350
0x2B, 7, ROLE_WORKER, 514, // 351
0x2C, 0, ROLE_WORKER, 514, // 352
0x2C, 1, ROLE_WORKER, 514, // 353
0x2C, 2, ROLE_WORKER, 514, // 354
0x2C, 3, ROLE_WORKER, 514, // 355
0x2C, 4, ROLE_WORKER, 514, // 356
0x2C, 5, ROLE_WORKER, 514, // 357
0x2C, 6, ROLE_WORKER, 514, // 358
0x2C, 7, ROLE_WORKER, 514, // 359
0x2D, 0, ROLE_WORKER, 514, // 360
0x2D, 1, ROLE_WORKER, 514, // 361
0x2D, 2, ROLE_WORKER, 514, // 362
0x2D, 3, ROLE_WORKER, 514, // 363
0x2D, 4, ROLE_WORKER, 514, // 364
0x2D, 5, ROLE_WORKER, 514, // 365
0x2D, 6, ROLE_WORKER, 514, // 366
0x2D, 7, ROLE_WORKER, 514, // 367
0x2E, 0, ROLE_WORKER, 514, // 368
0x2E, 1, ROLE_WORKER, 514, // 369
0x2E, 2, ROLE_WORKER, 514, // 370
0x2E, 3, ROLE_WORKER, 514, // 371
0x2E, 4, ROLE_WORKER, 514, // 372
0x2E, 5, ROLE_WORKER, 514, // 373
0x2E, 6, ROLE_WORKER, 514, // 374
0x2E, 7, ROLE_WORKER, 514, // 375
0x2F, 0, ROLE_WORKER, 514, // 376
0x2F, 1, ROLE_WORKER, 514, // 377
0x2F, 2, ROLE_WORKER, 514, // 378
0x2F, 3, ROLE_WORKER, 514, // 379
0x2F, 4, ROLE_WORKER, 514, // 380
0x2F, 5, ROLE_WORKER, 514, // 381
0x2F, 6, ROLE_WORKER, 514, // 382
0x2F, 7, ROLE_WORKER, 514, // 383
0x30, 0, ROLE_WORKER, 515, // 384
0x30, 1, ROLE_WORKER, 515, // 385
0x30, 2, ROLE_WORKER, 515, // 386
0x30, 3, ROLE_WORKER, 515, // 387
0x30, 4, ROLE_WORKER, 515, // 388
0x30, 5, ROLE_WORKER, 515, // 389
0x30, 6, ROLE_WORKER, 515, // 390
0x30, 7, ROLE_WORKER, 515, // 391
0x31, 0, ROLE_WORKER, 515, // 392
0x31, 1, ROLE_WORKER, 515, // 393
0x31, 2, ROLE_WORKER, 515, // 394
0x31, 3, ROLE_WORKER, 515, // 395
0x31, 4, ROLE_WORKER, 515, // 396
0x31, 5, ROLE_WORKER, 515, // 397
0x31, 6, ROLE_WORKER, 515, // 398
0x31, 7, ROLE_WORKER, 515, // 399
0x32, 0, ROLE_WORKER, 515, // 400
0x32, 1, ROLE_WORKER, 515, // 401
0x32, 2, ROLE_WORKER, 515, // 402
0x32, 3, ROLE_WORKER, 515, // 403
0x32, 4, ROLE_WORKER, 515, // 404
0x32, 5, ROLE_WORKER, 515, // 405
0x32, 6, ROLE_WORKER, 515, // 406
0x32, 7, ROLE_WORKER, 515, // 407
0x33, 0, ROLE_WORKER, 515, // 408
0x33, 1, ROLE_WORKER, 515, // 409
0x33, 2, ROLE_WORKER, 515, // 410
0x33, 3, ROLE_WORKER, 515, // 411
0x33, 4, ROLE_WORKER, 515, // 412
0x33, 5, ROLE_WORKER, 515, // 413
0x33, 6, ROLE_WORKER, 515, // 414
0x33, 7, ROLE_WORKER, 515, // 415
0x34, 0, ROLE_WORKER, 515, // 416
0x34, 1, ROLE_WORKER, 515, // 417
0x34, 2, ROLE_WORKER, 515, // 418
0x34, 3, ROLE_WORKER, 515, // 419
0x34, 4, ROLE_WORKER, 515, // 420
0x34, 5, ROLE_WORKER, 515, // 421
0x34, 6, ROLE_WORKER, 515, // 422
0x34, 7, ROLE_WORKER, 515, // 423
0x35, 0, ROLE_WORKER, 515, // 424
0x35, 1, ROLE_WORKER, 515, // 425
0x35, 2, ROLE_WORKER, 515, // 426
0x35, 3, ROLE_WORKER, 515, // 427
0x35, 4, ROLE_WORKER, 515, // 428
0x35, 5, ROLE_WORKER, 515, // 429
0x35, 6, ROLE_WORKER, 515, // 430
0x35, 7, ROLE_WORKER, 515, // 431
0x36, 0, ROLE_WORKER, 515, // 432
0x36, 1, ROLE_WORKER, 515, // 433
0x36, 2, ROLE_WORKER, 515, // 434
0x36, 3, ROLE_WORKER, 515, // 435
0x36, 4, ROLE_WORKER, 515, // 436
0x36, 5, ROLE_WORKER, 515, // 437
0x36, 6, ROLE_WORKER, 515, // 438
0x36, 7, ROLE_WORKER, 515, // 439
0x37, 0, ROLE_WORKER, 515, // 440
0x37, 1, ROLE_WORKER, 515, // 441
0x37, 2, ROLE_WORKER, 515, // 442
0x37, 3, ROLE_WORKER, 515, // 443
0x37, 4, ROLE_WORKER, 515, // 444
0x37, 5, ROLE_WORKER, 515, // 445
0x37, 6, ROLE_WORKER, 515, // 446
0x37, 7, ROLE_WORKER, 515, // 447
0x38, 0, ROLE_WORKER, 515, // 448
0x38, 1, ROLE_WORKER, 515, // 449
0x38, 2, ROLE_WORKER, 515, // 450
0x38, 3, ROLE_WORKER, 515, // 451
0x38, 4, ROLE_WORKER, 515, // 452
0x38, 5, ROLE_WORKER, 515, // 453
0x38, 6, ROLE_WORKER, 515, // 454
0x38, 7, ROLE_WORKER, 515, // 455
0x39, 0, ROLE_WORKER, 515, // 456
0x39, 1, ROLE_WORKER, 515, // 457
0x39, 2, ROLE_WORKER, 515, // 458
0x39, 3, ROLE_WORKER, 515, // 459
0x39, 4, ROLE_WORKER, 515, // 460
0x39, 5, ROLE_WORKER, 515, // 461
0x39, 6, ROLE_WORKER, 515, // 462
0x39, 7, ROLE_WORKER, 515, // 463
0x3A, 0, ROLE_WORKER, 515, // 464
0x3A, 1, ROLE_WORKER, 515, // 465
0x3A, 2, ROLE_WORKER, 515, // 466
0x3A, 3, ROLE_WORKER, 515, // 467
0x3A, 4, ROLE_WORKER, 515, // 468
0x3A, 5, ROLE_WORKER, 515, // 469
0x3A, 6, ROLE_WORKER, 515, // 470
0x3A, 7, ROLE_WORKER, 515, // 471
0x3B, 0, ROLE_WORKER, 515, // 472
0x3B, 1, ROLE_WORKER, 515, // 473
0x3B, 2, ROLE_WORKER, 515, // 474
0x3B, 3, ROLE_WORKER, 515, // 475
0x3B, 4, ROLE_WORKER, 515, // 476
0x3B, 5, ROLE_WORKER, 515, // 477
0x3B, 6, ROLE_WORKER, 515, // 478
0x3B, 7, ROLE_WORKER, 515, // 479
0x3C, 0, ROLE_WORKER, 515, // 480
0x3C, 1, ROLE_WORKER, 515, // 481
0x3C, 2, ROLE_WORKER, 515, // 482
0x3C, 3, ROLE_WORKER, 515, // 483
0x3C, 4, ROLE_WORKER, 515, // 484
0x3C, 5, ROLE_WORKER, 515, // 485
0x3C, 6, ROLE_WORKER, 515, // 486
0x3C, 7, ROLE_WORKER, 515, // 487
0x3D, 0, ROLE_WORKER, 515, // 488
0x3D, 1, ROLE_WORKER, 515, // 489
0x3D, 2, ROLE_WORKER, 515, // 490
0x3D, 3, ROLE_WORKER, 515, // 491
0x3D, 4, ROLE_WORKER, 515, // 492
0x3D, 5, ROLE_WORKER, 515, // 493
0x3D, 6, ROLE_WORKER, 515, // 494
0x3D, 7, ROLE_WORKER, 515, // 495
0x3E, 0, ROLE_WORKER, 515, // 496
0x3E, 1, ROLE_WORKER, 515, // 497
0x3E, 2, ROLE_WORKER, 515, // 498
0x3E, 3, ROLE_WORKER, 515, // 499
0x3E, 4, ROLE_WORKER, 515, // 500
0x3E, 5, ROLE_WORKER, 515, // 501
0x3E, 6, ROLE_WORKER, 515, // 502
0x3E, 7, ROLE_WORKER, 515, // 503
0x3F, 0, ROLE_WORKER, 515, // 504
0x3F, 1, ROLE_WORKER, 515, // 505
0x3F, 2, ROLE_WORKER, 515, // 506
0x3F, 3, ROLE_WORKER, 515, // 507
0x3F, 4, ROLE_WORKER, 515, // 508
0x3F, 5, ROLE_WORKER, 515, // 509
0x3F, 6, ROLE_WORKER, 515, // 510
0x3F, 7, ROLE_WORKER, 515, // 511
0x4B, 0, ROLE_SCHEDULER, 516, // 512
0x4B, 1, ROLE_SCHEDULER, 516, // 513
0x4B, 2, ROLE_SCHEDULER, 516, // 514
0x4B, 3, ROLE_SCHEDULER, 516, // 515
0x6B, 0, ROLE_SCHEDULER, -1, // 516
0x6B, 1, ROLE_VID_INPUT, -1, // (no core ID)
0x6B, 2, ROLE_VID_OUTPUT, -1); // (no core ID)
// Undeclared mode
default:
return -1;
}
}
|
def p( value:float, index:int, spectrum:np.array, width:int = 5, h=0.15) -> float:
M = len(spectrum)
n = 2*width +1
if ((index + width) >= M) or ((index - width) <= 0):
print(f"Avoided calculating p for index {index} with width {width}")
return np.NaN
multiplicationFactor = 1/(n * h)
summation = 0
print("made it")
for i in range(index - width, index + width + 1, 1):
summation += gaussianKernel(x = np.abs(value - spectrum[i]), sigma=h**0.5)
return multiplicationFactor * summation
try: pass
except:
print("_________________________OUT OF BOUNDS ERROR_________________________")
print("index = ", index)
print("width = ", width)
print("Array size = ", M)
print("if statement evaluates to: ", ((index - width) <= 0) or ((index + width - 1) >= M))
print("index + width = ", index + width)
return 0 |
‘Natural Justice, Equity and Good Conscience’: History, Politics and Law in Nigeria, 1900–1966
Chapter One provides an account of the history of colonial and postcolonial Nigeria, focusing particularly on politics and law. The chapter recounts the long history of British colonial presence in West Africa and explains the introduction of indirect rule as a system of colonial government from the turn of the century. Some of the impacts of indirect rule are considered through reference to Obafemi Awolowo’s memoir, Awo, and Chinua Achebe’s novel, Arrow of God. The chapter also sketches out the divisions that indirect rule fomented and the resistance to which it gave rise. Finally, the chapter explains the implications of indirect rule for the implementation of law in Nigeria both during colonial rule and following independence. |
package network // import "github.com/automaticserver/lxe/network"
import (
"context"
"errors"
"fmt"
"net"
"strconv"
"github.com/automaticserver/lxe/lxf/device"
"github.com/automaticserver/lxe/network/cloudinit"
"github.com/automaticserver/lxe/shared"
lxd "github.com/lxc/lxd/client"
"github.com/lxc/lxd/shared/api"
rtApi "k8s.io/cri-api/pkg/apis/runtime/v1alpha2"
)
const (
DefaultLXDBridge = "lxebr0"
)
var (
ErrNotBridge = errors.New("not a bridge")
)
// ConfLXDBridge are configuration options for the LXDBridge plugin. All properties are optional and get a default value
type ConfLXDBridge struct {
LXDBridge string
Cidr string
Nat bool
CreateOnly bool
}
func (c *ConfLXDBridge) setDefaults() {
if c.LXDBridge == "" {
c.LXDBridge = DefaultLXDBridge
}
}
// lxdBridgePlugin manages the pod networks using LXDBridge
type lxdBridgePlugin struct {
noopPlugin // every method not implemented is noop
server lxd.ContainerServer
conf ConfLXDBridge
}
// InitPluginLXDBridge instantiates the LXDBridge plugin using the provided config
func InitPluginLXDBridge(server lxd.ContainerServer, conf ConfLXDBridge) (*lxdBridgePlugin, error) { // nolint: golint // intended to not export lxdBridgePlugin
conf.setDefaults()
p := &lxdBridgePlugin{
server: server,
conf: conf,
}
err := p.ensureBridge()
if err != nil {
return nil, err
}
return p, nil
}
// PodNetwork enters a pod network environment context
func (p *lxdBridgePlugin) PodNetwork(id string, annotations map[string]string) (PodNetwork, error) {
return &lxdBridgePodNetwork{
plugin: p,
podID: id,
annotations: annotations,
}, nil
}
// UpdateRuntimeConfig is called when there are updates to the configuration which the plugin might need to apply
func (p *lxdBridgePlugin) UpdateRuntimeConfig(conf *rtApi.RuntimeConfig) error {
if cidr := conf.GetNetworkConfig().GetPodCidr(); cidr != "" {
p.conf.Cidr = cidr
return p.ensureBridge()
}
return nil
}
// EnsureBridge ensures the bridge exists with the defined options. Cidr is an expected ipv4 cidr or can be empty to
// automatically assign a cidr
func (p *lxdBridgePlugin) ensureBridge() error {
var address string
if p.conf.Cidr == "" {
address = "auto"
} else {
// Always use first address in range for the bridge
_, net, err := net.ParseCIDR(p.conf.Cidr)
if err != nil {
return err
}
net.IP[3]++
address = net.String()
}
put := api.NetworkPut{
Description: "managed by LXE, default bridge",
Config: map[string]string{
"ipv4.address": address,
"ipv4.dhcp": strconv.FormatBool(true),
"ipv4.nat": strconv.FormatBool(p.conf.Nat),
"ipv6.address": "none",
// We don't need to receive a DNS in DHCP, Kubernetes' DNS is always set by requesting a mount for resolv.conf.
// This disables dns in dnsmasq (option -p: https://linux.die.net/man/8/dnsmasq)
"raw.dnsmasq": `port=0`,
},
}
network, ETag, err := p.server.GetNetwork(p.conf.LXDBridge)
if err != nil {
if shared.IsErrNotFound(err) {
return p.server.CreateNetwork(api.NetworksPost{
Name: p.conf.LXDBridge,
Type: "bridge",
NetworkPut: put,
})
}
return err
} else if network.Type != "bridge" {
return fmt.Errorf("%w: %v, but is %v", ErrNotBridge, p.conf.LXDBridge, network.Type)
}
// don't update when only creation is requested
// TODO: Should we return an error if the bridge settings e.g. cidr would change?
if p.conf.CreateOnly {
return nil
}
for k, v := range put.Config {
network.Config[k] = v
}
return p.server.UpdateNetwork(p.conf.LXDBridge, network.Writable(), ETag)
}
var ErrNotImplemented = errors.New("not implemented")
// findFreeIP generates a IP within the range of the provided lxd managed bridge which does
// not exist in the current leases
func (p *lxdBridgePlugin) findFreeIP() (net.IP, error) {
network, _, err := p.server.GetNetwork(p.conf.LXDBridge)
if err != nil {
return nil, err
} else if network.Config["ipv4.dhcp.ranges"] != "" {
// actually we can now using FindFreeIP(), but not good enough, as this field can yield multiple ranges
return nil, fmt.Errorf("%w to find an IP with explicitly set ip ranges `ipv4.dhcp.ranges` in bridge %v", ErrNotImplemented, p.conf.LXDBridge)
}
rawLeases, err := p.server.GetNetworkLeases(p.conf.LXDBridge)
if err != nil {
return nil, err
}
leases := []net.IP{}
for _, rawIP := range rawLeases {
leases = append(leases, net.ParseIP(rawIP.Address))
}
bridgeIP, bridgeNet, err := net.ParseCIDR(network.Config["ipv4.address"])
if err != nil {
return nil, err
}
leases = append(leases, bridgeIP) // also exclude bridge ip
return FindFreeIP(bridgeNet, leases, nil, nil), nil
}
// lxdBridgePodNetwork is a pod network environment context
type lxdBridgePodNetwork struct {
noopPodNetwork // every method not implemented is noop
plugin *lxdBridgePlugin
podID string
annotations map[string]string
}
// ContainerNetwork enters a container network environment context
func (s *lxdBridgePodNetwork) ContainerNetwork(id string, annotations map[string]string) (ContainerNetwork, error) {
return &lxdBridgeContainerNetwork{
pod: s,
cid: id,
annotations: annotations,
}, nil
}
// Status reports IP and any error with the network of that pod
func (s *lxdBridgePodNetwork) Status(ctx context.Context, prop *PropertiesRunning) (*Status, error) {
if prop.Data["interface-address"] == "" {
return nil, &net.AddrError{Addr: prop.Data["interface-address"], Err: "missing"}
}
ip := net.ParseIP(prop.Data["interface-address"])
if ip == nil {
return nil, &net.ParseError{Type: "IP address", Text: prop.Data["interface-address"]}
}
return &Status{
IPs: []net.IP{ip},
}, nil
}
// WhenCreated is called when the pod is created.
func (s *lxdBridgePodNetwork) WhenCreated(ctx context.Context, prop *Properties) (*Result, error) {
// default is to use the predefined lxd bridge managed by lxe
randIP, err := s.plugin.findFreeIP()
if err != nil {
return nil, err
}
r := &Result{}
// TODO: Remove, I think we don't/shouldn't need that anymore
r.Data = map[string]string{
// "bridge": s.plugin.conf.LXDBridge,
"interface-address": randIP.String(), // except this for IP return shortcut in Status
// "physical-type": "dhcp",
}
r.Nics = []device.Nic{
{
Name: DefaultInterface,
NicType: "bridged",
Parent: s.plugin.conf.LXDBridge,
IPv4Address: randIP.String(),
},
}
r.NetworkConfigEntries = []cloudinit.NetworkConfigEntryPhysical{
{
NetworkConfigEntry: cloudinit.NetworkConfigEntry{
Type: "physical",
},
Name: DefaultInterface,
Subnets: []cloudinit.NetworkConfigEntryPhysicalSubnet{
{
Type: "dhcp",
},
},
},
}
return r, nil
}
// lxdBridgeContainerNetwork is a container network environment context
type lxdBridgeContainerNetwork struct {
noopContainerNetwork // every method not implemented is noop
pod *lxdBridgePodNetwork
cid string
annotations map[string]string
}
|
{-# LANGUAGE NoMonoLocalBinds, RankNTypes #-}
-- <NAME>'s example from
-- https://prime.haskell.org/wiki/MonomorphicPatternBindings
module T11339d where
import Control.Monad.ST
newtype ListMap m a b = ListMap ([a] -> m [b])
runMap :: (forall s. ListMap (ST s) a b) -> [a] -> [b]
runMap lf as = runST (f as)
where
ListMap f = lf
|
“I now have absolute proof that smoking even one marijuana cigarette is equal in brain damage to being on Bikini Island during an H-bomb blast.”
Ronald Reagan
[nggallery id=430]
… and the lies continue.
Late Thursday afternoon the DEA sent out 23 notices to medical marijuana collectives located in Western Washington state. The intent of these letters was to notify 23 pot shops… and warn them that if they did not cease operations within 30 days, they would be arrested, their marijuana would be seized and the landlord’s property would be confiscated.
When word got out of the DEA’s most recent letter writing campaign aimed at crushing the spirit of both the collective owner, and the intent of the law. The first question on everyone’s mind was who receiving these letters? As both the Washington State U.S. attorney’s office — and the Drug Enforcement Administration — had shown strong support for these unwarranted threats; the obvious question is who are these 23 collectives?
[nggallery id=431]
While Western Washington has been a little late to the “Feds v. State” mmj game, Mr. Matthew G. Barnes — the DEA’s ‘main man’ in the Seattle area, threatened that there would be many “more letters” to follow. The sinister tone of these letters is aimed at undermining the property owners – and their sense of constitutional rights. As such, the ominous subtext to these letters – is that should the property owner decide not to kick out their current tenant. They will be criminally prosecuted and face the very real likelihood – they would also lose their property through the forfeiture process.
These letters sent out by the US attorney’s office, were similar in nature to the ones written and sent to many of the medical marijuana collectives in Colorado, Northern California and Oregon. These letters have sparked a much-needed debate surrounding the 10th amendment. As the federal actions have more often than not – collided – with state medical marijuana laws, which have been voter approved. The feds claim to be targeting marijuana superstores and those which may be too close to schools, despite the states regulations that have disallowed collectives from locating closer than 1000 feet to any K-12 institution.
[nggallery id=432]
“I am confident that once notified of the ramifications and penalties associated with renting a property for marijuana distribution purposes, property owners will take appropriate steps to rectify the situation on their own. The DEA will not turn a blind eye to criminal organizations that attempt to use state or local law as a shield for their illicit drug trafficking activities,” Barnes said in a statement. source
Washington’s medical marijuana situation is a bit of a strange bird. In 2011 the Washington state legislature had managed to pass a law that would have legalized medical marijuana and the collectives that distribute it. But as Gov. Chris Gregorie was not on board with the whole “medical marijuana” idea, he vetoed the law. As a direct result of this, the state of Washington was left with one of the more under regulated medicinal pot industries in the entire country.
[nggallery id=433]
Now – in the state of Washington, 10 patients can gather together in order to grow a 45 marijuana plant “collective gardening co-op.” Washington’s marijuana law permits their local municipalities to regulate these rapidly growing pot operations. With more than 140 collectives operating in the greater Seattle area the city has gone to great lengths to make sure that they are properly regulated and licensed, in addition to paying all of their taxes. As initiative 502 fires up a heated debate within the state of Washington the timing of the DEA’s announcement to crack down on Washington state medical marijuana industry is no coincidence.
Source: Marijuana.com |
/*
* Copyright (c) 2011-2015 Spotify AB
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
package com.spotify.asyncdatastoreclient;
import com.google.common.collect.ImmutableList;
import java.util.List;
import java.util.stream.Collectors;
/**
* A query result.
*
* Returned from all mutation operations.
*/
public final class MutationResult implements Result {
private final List<com.google.datastore.v1.MutationResult> result;
private final int indexUpdates;
private MutationResult(final com.google.datastore.v1.MutationResult result, int indexUpdates) {
this.result = ImmutableList.of(result);
this.indexUpdates = indexUpdates;
}
private MutationResult(final List<com.google.datastore.v1.MutationResult> results, int indexUpdates) {
this.result = ImmutableList.copyOf(results);
this.indexUpdates = indexUpdates;
}
static MutationResult build(final com.google.datastore.v1.CommitResponse response) {
return new MutationResult(response.getMutationResultsList(), response.getIndexUpdates());
}
/**
* Build an empty result.
*
* @return a new empty mutation result.
*/
public static MutationResult build() {
return new MutationResult(com.google.datastore.v1.MutationResult.getDefaultInstance(), 0);
}
/**
* Return the first entity key that was inserted or null if empty.
*
* This is a shortcut for {@code getInsertKeys().get(0)}
*
* @return a key that describes the newly inserted entity.
*/
public Key getInsertKey() {
if (result.isEmpty()) {
return null;
}
return Key.builder(result.get(0).getKey()).build();
}
/**
* Return all entity keys that were inserted for automatically generated
* key ids.
*
* @return a list of keys that describe the newly inserted entities.
*/
public List<Key> getInsertKeys() {
return ImmutableList.copyOf(result.stream()
.map(r -> Key.builder(r.getKey()).build())
.collect(Collectors.toList()));
}
/**
* Return the number of indexes updated during the mutation operation.
*
* @return the number of index updates.
*/
public int getIndexUpdates() {
return indexUpdates;
}
}
|
Design is an incredibly self-referential for of expression, and that’s quite alright, as I deeply believe creativity is combinatorial — everything borrows from what came before, everything is a remix, all creative work is essentially derivative work. So knowledge of what came before greatly enriches and empowers our creativity. And, over the past century alone, countless books have been published to make sense of the landscape, language and legacy of graphic design, each exploring a specific facet of this complex ecosystem of visual communication. But how does it all fit together? That’s exactly what Jason Godfrey set out to investigate in 2009 in Bibliographic: 100 Classic Graphic Design Books — yes, it’s a graphic design book about graphic design books, and it doesn’t get any more meta than this, and that’s a wonderful thing.
Godfrey culls the 100 most influential design books of the past 100 years, contextualizing each with succinct background text on what makes it exceptional and important. The collection spans an incredible range of style, genre, subject matter, geography, and cultural concern, from the stories of the pioneering type foundries to vintage Polish film posters to classic graphic design manuals by László Moholy-Nagy and Josef Müller-Brockmann to contemporary design visionaries like Stefan Sagmeister and Paula Scher.
A foreword by none other than Steven Heller adds an irresistibly delicious cherry on top.
These vintage books are untapped repositories of design knowledge, as relevant today as they were when first published.” ~ Steven Heller
What makes Bibliographic all the more valuable is that the majority of the books featured have entered collector’s-item status and are quite hard — not to mention expensive — to get on their own.
A few of my favorite titles in the anthology:
As much an incredible primer for those just dipping their toes in design as a rich and lavish treasure chest of beloved allusions for the polished design nerd, Bibliographic is an absolute gem from cover to glorious cover.
Thanks, @kirstinbutler |
package slimeknights.tconstruct.common;
import net.minecraft.block.Block;
import net.minecraft.block.properties.IProperty;
import net.minecraft.item.Item;
import net.minecraft.item.ItemBlock;
import net.minecraft.item.ItemStack;
import net.minecraft.tileentity.TileEntity;
import net.minecraft.util.IStringSerializable;
import net.minecraftforge.fml.common.registry.GameRegistry;
import net.minecraftforge.fml.common.registry.IForgeRegistryEntry;
import java.util.Locale;
import slimeknights.mantle.block.BlockStairsBase;
import slimeknights.mantle.block.EnumBlock;
import slimeknights.mantle.block.EnumBlockSlab;
import slimeknights.mantle.item.ItemBlockMeta;
import slimeknights.mantle.item.ItemBlockSlab;
import slimeknights.tconstruct.TConstruct;
import slimeknights.tconstruct.gadgets.TinkerGadgets;
import slimeknights.tconstruct.library.Util;
import slimeknights.tconstruct.smeltery.TinkerSmeltery;
import slimeknights.tconstruct.tools.TinkerTools;
import slimeknights.tconstruct.world.TinkerWorld;
/**
* Just a small helper class that provides some function for cleaner Pulses.
*
* Items should be registered during PreInit
*
* Models should be registered during Init
*/
// MANTLE
public abstract class TinkerPulse {
protected static boolean isToolsLoaded() {
return TConstruct.pulseManager.isPulseLoaded(TinkerTools.PulseId);
}
protected static boolean isSmelteryLoaded() {
return TConstruct.pulseManager.isPulseLoaded(TinkerSmeltery.PulseId);
}
protected static boolean isWorldLoaded() {
return TConstruct.pulseManager.isPulseLoaded(TinkerWorld.PulseId);
}
protected static boolean isGadgetsLoaded() {
return TConstruct.pulseManager.isPulseLoaded(TinkerGadgets.PulseId);
}
/**
* Sets the correct unlocalized name and registers the item.
*/
protected static <T extends Item> T registerItem(T item, String name) {
if(!name.equals(name.toLowerCase(Locale.US))) {
throw new IllegalArgumentException(String.format("Unlocalized names need to be all lowercase! Item: %s", name));
}
item.setUnlocalizedName(Util.prefix(name));
item.setRegistryName(Util.getResource(name));
GameRegistry.register(item);
return item;
}
protected static <T extends Block> T registerBlock(T block, String name) {
ItemBlock itemBlock = new ItemBlockMeta(block);
registerBlock(block, itemBlock, name);
return block;
}
protected static <T extends EnumBlock<?>> T registerEnumBlock(T block, String name) {
registerBlock(block, new ItemBlockMeta(block), name);
ItemBlockMeta.setMappingProperty(block, block.prop);
return block;
}
protected static <T extends EnumBlockSlab<?>> T registerEnumBlockSlab(T block, String name) {
registerBlock(block, new ItemBlockSlab(block), name);
ItemBlockMeta.setMappingProperty(block, block.prop);
return block;
}
protected static <E extends Enum<E> & EnumBlock.IEnumMeta & IStringSerializable> BlockStairsBase registerBlockStairsFrom(EnumBlock<E> block, E value, String name) {
return registerBlock(new BlockStairsBase(block.getDefaultState().withProperty(block.prop, value)), name);
}
protected static <T extends Block> T registerBlock(ItemBlock itemBlock, String name) {
Block block = itemBlock.getBlock();
return (T) registerBlock(block, itemBlock, name);
}
protected static <T extends Block> T registerBlock(T block, String name, IProperty<?> property) {
ItemBlockMeta itemBlock = new ItemBlockMeta(block);
registerBlock(block, itemBlock, name);
ItemBlockMeta.setMappingProperty(block, property);
return block;
}
protected static <T extends Block> T registerBlock(T block, ItemBlock itemBlock, String name) {
if(!name.equals(name.toLowerCase(Locale.US))) {
throw new IllegalArgumentException(String.format("Unlocalized names need to be all lowercase! Block: %s", name));
}
String prefixedName = Util.prefix(name);
block.setUnlocalizedName(prefixedName);
itemBlock.setUnlocalizedName(prefixedName);
register(block, name);
register(itemBlock, name);
return block;
}
protected static <T extends Block> T registerBlockNoItem(T block, String name) {
if(!name.equals(name.toLowerCase(Locale.US))) {
throw new IllegalArgumentException(String.format("Unlocalized names need to be all lowercase! Block: %s", name));
}
String prefixedName = Util.prefix(name);
block.setUnlocalizedName(prefixedName);
register(block, name);
return block;
}
protected static <T extends IForgeRegistryEntry<?>> T register(T thing, String name) {
thing.setRegistryName(Util.getResource(name));
GameRegistry.register(thing);
return thing;
}
protected static void registerTE(Class<? extends TileEntity> teClazz, String name) {
if(!name.equals(name.toLowerCase(Locale.US))) {
throw new IllegalArgumentException(String.format("Unlocalized names need to be all lowercase! TE: %s", name));
}
GameRegistry.registerTileEntity(teClazz, Util.prefix(name));
}
// sets the stack size to make Tinkers Commons easier, as it uses base itemstacks there
protected static void addSlabRecipe(ItemStack slab, ItemStack input) {
GameRegistry.addShapedRecipe(new ItemStack(slab.getItem(), 6, slab.getItemDamage()), "BBB", 'B', input);
}
protected static void addStairRecipe(Block stairs, ItemStack input) {
GameRegistry.addShapedRecipe(new ItemStack(stairs, 4, 0), "B ", "BB ", "BBB", 'B', input);
}
protected static void addBrickRecipe(Block block, EnumBlock.IEnumMeta out, EnumBlock.IEnumMeta in) {
ItemStack brickBlockIn = new ItemStack(block, 1, in.getMeta());
ItemStack brickBlockOut = new ItemStack(block, 1, out.getMeta());
// todo: convert to chisel recipes if chisel is present
//GameRegistry.addShapedRecipe(searedBrickBlockOut, "BB", "BB", 'B', searedBrickBlockIn);
GameRegistry.addShapelessRecipe(brickBlockOut, brickBlockIn);
}
}
|
/*
* Nsmf_EventExposure
*
* Session Management Event Exposure Service API
*
* API version: 1.0.0
* Generated by: OpenAPI Generator (https://openapi-generator.tech)
*/
package models
import (
"time"
)
type NsmfEventExposure struct {
Supi string `json:"supi,omitempty" yaml:"supi" bson:"supi" mapstructure:"Supi"`
Gpsi string `json:"gpsi,omitempty" yaml:"gpsi" bson:"gpsi" mapstructure:"Gpsi"`
// Any UE indication. This IE shall be present if the event subscription is applicable to any UE. Default value \"FALSE\" is used, if not present.
AnyUeInd bool `json:"anyUeInd,omitempty" yaml:"anyUeInd" bson:"anyUeInd" mapstructure:"AnyUeInd"`
GroupId string `json:"groupId,omitempty" yaml:"groupId" bson:"groupId" mapstructure:"GroupId"`
PduSeId int32 `json:"pduSeId,omitempty" yaml:"pduSeId" bson:"pduSeId" mapstructure:"PduSeId"`
// Identifies an Individual SMF Notification Subscription. To enable that the value is used as part of a URI, the string shall only contain characters allowed according to the \"lower-with-hyphen\" naming convention defined in 3GPP TS 29.501 [2]. In an OpenAPI [10] schema, the format shall be designated as \"SubId\".
SubId string `json:"subId,omitempty" yaml:"subId" bson:"subId" mapstructure:"SubId"`
// Notification Correlation ID assigned by the NF service consumer.
NotifId string `json:"notifId" yaml:"notifId" bson:"notifId" mapstructure:"NotifId"`
NotifUri string `json:"notifUri" yaml:"notifUri" bson:"notifUri" mapstructure:"NotifUri"`
// Alternate or backup IPv4 Addess(es) where to send Notifications.
AltNotifIpv4Addrs []string `json:"altNotifIpv4Addrs,omitempty" yaml:"altNotifIpv4Addrs" bson:"altNotifIpv4Addrs" mapstructure:"AltNotifIpv4Addrs"`
// Alternate or backup IPv6 Addess(es) where to send Notifications.
AltNotifIpv6Addrs []string `json:"altNotifIpv6Addrs,omitempty" yaml:"altNotifIpv6Addrs" bson:"altNotifIpv6Addrs" mapstructure:"AltNotifIpv6Addrs"`
// Subscribed events
EventSubs []EventSubscription `json:"eventSubs" yaml:"eventSubs" bson:"eventSubs" mapstructure:"EventSubs"`
ImmeRep bool `json:"ImmeRep,omitempty" yaml:"ImmeRep" bson:"ImmeRep" mapstructure:"ImmeRep"`
NotifMethod NotificationMethod `json:"notifMethod,omitempty" yaml:"notifMethod" bson:"notifMethod" mapstructure:"NotifMethod"`
MaxReportNbr int32 `json:"maxReportNbr,omitempty" yaml:"maxReportNbr" bson:"maxReportNbr" mapstructure:"MaxReportNbr"`
Expiry *time.Time `json:"expiry,omitempty" yaml:"expiry" bson:"expiry" mapstructure:"Expiry"`
RepPeriod int32 `json:"repPeriod,omitempty" yaml:"repPeriod" bson:"repPeriod" mapstructure:"RepPeriod"`
Guami *Guami `json:"guami,omitempty" yaml:"guami" bson:"guami" mapstructure:"Guami"`
// If the NF service consumer is an AMF, it should provide the name of a service produced by the AMF that makes use of notifications about subscribed events.
ServiveName string `json:"serviveName,omitempty" yaml:"serviveName" bson:"serviveName" mapstructure:"ServiveName"`
SupportedFeatures string `json:"supportedFeatures,omitempty" yaml:"supportedFeatures" bson:"supportedFeatures" mapstructure:"SupportedFeatures"`
}
|
<reponame>KuronoaScarlet/ProjectII
#include "App.h"
#include "Input.h"
#include "Textures.h"
#include "Audio.h"
#include "Render.h"
#include "Window.h"
#include "SceneGym.h"
#include "Map.h"
#include "EntityManager.h"
#include "Collisions.h"
#include "FadeToBlack.h"
#include "Fonts.h"
#include "Title.h"
#include "DialogSystem.h"
#include "HUD.h"
#include "Scene12.h"
#include "SceneManager.h"
#include "Defs.h"
#include "Log.h"
SceneGym::SceneGym() : Module()
{
name.Create("scene1");
}
// Destructor
SceneGym::~SceneGym()
{}
// Called before render is available
bool SceneGym::Awake()
{
LOG("Loading Scene");
bool ret = true;
return ret;
}
// Called before the first frame
bool SceneGym::Start()
{
active = true;
app->hud->Start();
app->sceneManager->scenebath = false;
app->playerPosition.x = 32.0f;
app->playerPosition.y = 96.0f;
app->sceneManager->scenegym = true;
gymtobath = app->collisions->AddCollider(SDL_Rect({ 0, 96, 10, 90 }), Collider::Type::TPGYMTOBATH, this);
goright = app->collisions->AddCollider(SDL_Rect({ 32, 224, 10, 10 }), Collider::Type::GORIGHT, this);
goleft = app->collisions->AddCollider(SDL_Rect({ 352, 224, 10, 10 }), Collider::Type::GOLEFT, this);
godown1 = app->collisions->AddCollider(SDL_Rect({ 448, 64, 10, 10 }), Collider::Type::GODOWN, this);
goup = app->collisions->AddCollider(SDL_Rect({ 448, 448, 10, 10 }), Collider::Type::GOUP, this);
godown2 = app->collisions->AddCollider(SDL_Rect({ 128, 480, 10, 10 }), Collider::Type::GODOWN, this);
goup2 = app->collisions->AddCollider(SDL_Rect({ 128, 640, 10, 10 }), Collider::Type::GOUP, this);
godown3 = app->collisions->AddCollider(SDL_Rect({ 50, 480, 10, 10 }), Collider::Type::GODOWN, this);
goup3 = app->collisions->AddCollider(SDL_Rect({ 50, 640, 10, 10 }), Collider::Type::GOUP, this);
goright = app->collisions->AddCollider(SDL_Rect({ 192, 768, 10, 10 }), Collider::Type::GORIGHT, this);
goleft = app->collisions->AddCollider(SDL_Rect({ 544, 750, 10, 10 }), Collider::Type::GOLEFT, this);
goright = app->collisions->AddCollider(SDL_Rect({ 192, 864, 10, 10 }), Collider::Type::GORIGHT, this);
goleft = app->collisions->AddCollider(SDL_Rect({ 544, 832, 10, 10 }), Collider::Type::GOLEFT, this);
goright = app->collisions->AddCollider(SDL_Rect({ 820, 704, 10, 10 }), Collider::Type::GORIGHT, this);
godown1 = app->collisions->AddCollider(SDL_Rect({ 800, 512, 10, 10 }), Collider::Type::GODOWN, this);
goup = app->collisions->AddCollider(SDL_Rect({ 1184, 672, 10, 10 }), Collider::Type::GOUP, this);
goleft = app->collisions->AddCollider(SDL_Rect({ 1184, 480, 10, 10 }), Collider::Type::GOLEFT, this);
godown1 = app->collisions->AddCollider(SDL_Rect({ 992, 160, 10, 10 }), Collider::Type::GODOWN, this);
goup = app->collisions->AddCollider(SDL_Rect({ 992, 384, 10, 10 }), Collider::Type::GOUP, this);
goleft = app->collisions->AddCollider(SDL_Rect({ 1212, 320, 10, 10 }), Collider::Type::GOLEFT, this);
goright = app->collisions->AddCollider(SDL_Rect({ 928, 352, 10, 10 }), Collider::Type::GORIGHT, this);
godown1 = app->collisions->AddCollider(SDL_Rect({ 832, 96, 10, 10 }), Collider::Type::GODOWN, this);
goup = app->collisions->AddCollider(SDL_Rect({ 832, 352, 10, 10 }), Collider::Type::GOUP, this);
godown1 = app->collisions->AddCollider(SDL_Rect({ 896, 96, 10, 10 }), Collider::Type::GODOWN, this);
goup = app->collisions->AddCollider(SDL_Rect({ 896, 352, 10, 10 }), Collider::Type::GOUP, this);
checkpoint = app->collisions->AddCollider(SDL_Rect({ 608, 600, 10, 90 }), Collider::Type::DUNGEONCP, this);
getoutbox = app->collisions->AddCollider(SDL_Rect({ 1120, 64, 10, 90 }), Collider::Type::GETOUTBOX, this);
app->entityManager->AddEntity({ app->playerPosition.x, app->playerPosition.y }, Entity::Type::PLAYER);
app->entityManager->AddEntity({ 160, 128 }, Entity::Type::CRATE);
app->entityManager->AddEntity({ 288, 200 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 448, 32 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 128, 480 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 0, 480 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 480, 736 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 224, 832 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 736, 832 }, Entity::Type::ENEMYLANTERN3);
app->entityManager->AddEntity({ 864, 780 }, Entity::Type::ENEMYLANTERN1);
app->entityManager->AddEntity({ 1088, 512 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 832, 672 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 880, 100 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 790, 100 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 896, 128 }, Entity::Type::ENEMYLANTERN2);
app->entityManager->AddEntity({ 1376, 608 }, Entity::Type::BLUEBALL);
app->entityManager->AddEntity({ 1440, 608 }, Entity::Type::REDBALL);
app->entityManager->AddEntity({ 1504, 608 }, Entity::Type::YELLOWBALL);
app->entityManager->AddEntity({ 1568, 608 }, Entity::Type::PURPLEBALL);
app->entityManager->AddEntity({ 1504, 768 }, Entity::Type::GATEOPEN);
app->entityManager->AddEntity({ 1504, 896 }, Entity::Type::BOOK);
app->render->camera.y = 0;
app->render->camera.x = 0;
app->map->active = true;
if (app->loadingGame == true)
{
app->LoadGameRequest();
app->loadingGame = false;
}
app->map->Load("GymDungeon.tmx");
app->audio->PlayMusic("Assets/Audio/Music/music_gym.ogg");
return true;
}
// Called each loop iteration
bool SceneGym::PreUpdate()
{
return true;
}
// Called each loop iteration
bool SceneGym::Update(float dt)
{
app->map->Draw();
app->map->LoadColliders();
return true;
}
// Called each loop iteration
bool SceneGym::PostUpdate()
{
bool ret = true;
return ret;
}
// Called before quitting
bool SceneGym::CleanUp()
{
if (!active)return true;
app->entityManager->CleanUp();
app->collisions->CleanUp();
app->map->CleanUp();
active = false;
LOG("Freeing scene");
return true;
} |
#include <mpl_traj_solver/traj_solver.h>
#include <fstream>
#include <boost/geometry.hpp>
#include <boost/geometry/geometries/point_xy.hpp>
#include <boost/geometry/geometries/polygon.hpp>
// Pass the data into a VoxelMapUtil class for collision checking
// Plot the result in svg image
typedef boost::geometry::model::d2::point_xy<double> point_2d;
std::ofstream svg("output.svg");
// Declare a stream and an SVG mapper
boost::geometry::svg_mapper<point_2d> mapper(svg, 1000, 1000);
void drawTraj(const Trajectory2D& traj, std::string traj_name, std::string traj_color) {
// Draw the trajectory
double total_t = traj.getTotalTime();
printf("%s: \n", traj_name.c_str());
printf(" T: %f\n", total_t);
printf(" J(VEL) = %f, J(ACC) = %f, J(JRK) = %f, J(SNP) = %f\n",
traj.J(Control::VEL), traj.J(Control::ACC), traj.J(Control::JRK), traj.J(Control::SNP));
int num = 200; // number of points on trajectory to draw
const auto ws = traj.sample(num);
boost::geometry::model::linestring<point_2d> line;
for (const auto& w: ws)
line.push_back(point_2d(w.pos(0), w.pos(1)));
mapper.add(line);
mapper.map(line, traj_color);
}
int main(int argc, char **argv) {
// Draw the canvas
boost::geometry::model::polygon<point_2d> bound;
const double origin_x = -1;
const double origin_y = -1;
const double range_x = 7;
const double range_y = 3;
std::vector<point_2d> points;
points.push_back(point_2d(origin_x, origin_y));
points.push_back(point_2d(origin_x, origin_y + range_y));
points.push_back(point_2d(origin_x + range_x, origin_y + range_y));
points.push_back(point_2d(origin_x + range_x, origin_y));
points.push_back(point_2d(origin_x, origin_y));
boost::geometry::assign_points(bound, points);
boost::geometry::correct(bound);
mapper.add(bound);
mapper.map(bound, "fill-opacity:1.0;fill:rgb(255,255,255);stroke:rgb(0,0,0);"
"stroke-width:2"); // White
// Draw path and trajectories
vec_Vec2f path;
path.push_back(Vec2f(0, 0));
path.push_back(Vec2f(1, 0));
path.push_back(Vec2f(2, 1));
path.push_back(Vec2f(5, 1));
// Min Vel Traj
{
std::string color = "opacity:0.4;fill:none;stroke:rgb(237,10,63);stroke-width:5"; // Red
TrajSolver2D traj_solver(Control::VEL);
traj_solver.setPath(path);
traj_solver.setV(1); // set velocity for time allocation
drawTraj(traj_solver.solve(), "min_vel_traj", color);
}
// Min Acc Traj
{
std::string color = "opacity:0.4;fill:none;stroke:rgb(94,140,49);stroke-width:5"; // Green
TrajSolver2D traj_solver(Control::ACC);
traj_solver.setPath(path);
traj_solver.setV(1); // set velocity for time allocation
drawTraj(traj_solver.solve(), "min_acc_traj", color);
}
// Min Jrk Traj
{
std::string color = "opacity:0.4;fill:none;stroke:rgb(118,215,234);stroke-width:5"; // Blue
TrajSolver2D traj_solver(Control::JRK);
traj_solver.setPath(path);
traj_solver.setV(1); // set velocity for time allocation
drawTraj(traj_solver.solve(), "min_jrk_traj", color);
}
// Draw keyframes
for(const auto& it: path) {
point_2d pt;
boost::geometry::assign_values(pt, it(0), it(1));
mapper.add(pt);
mapper.map(pt, "fill-opacity:1.0;fill:rgb(255,0,0);", 10); // Red
}
// Write title at the lower right corner on canvas
mapper.text(point_2d(4.0, -0.2), "test_traj_solver",
"fill-opacity:1.0;fill:rgb(10,10,250);");
mapper.text(point_2d(3.5, -0.4), "Red: ",
"fill-opacity:1.0;fill:rgb(237,10,63);");
mapper.text(point_2d(4.0, -0.4), "minimum velocity trajectory",
"fill-opacity:1.0;fill:rgb(0,0,0);");
mapper.text(point_2d(3.5, -0.6), "Green: ",
"fill-opacity:1.0;fill:rgb(94,140,49);");
mapper.text(point_2d(4.0, -0.6), "minimum acceleration trajectory",
"fill-opacity:1.0;fill:rgb(0,0,0);");
mapper.text(point_2d(3.5, -0.8), "Blue: ",
"fill-opacity:1.0;fill:rgb(118,215,234);");
mapper.text(point_2d(4.0, -0.8), "minimum jerk trajectory",
"fill-opacity:1.0;fill:rgb(0,0,0);");
return 0;
}
|
/**
* Creates an alias script based on the alias configuration.
*
* @goal alias
* @phase generate-resources
* @description Creates an alias script based on the alias configuration.
* Supported scripts are: <tt>windows</tt> and <tt>bash</tt>.
* @threadSafe
* @author <a href="mailto:[email protected]">Robert Reiner</a>
* @version $Revision$
*/
public class MavenAliasMojo extends AbstractMojo {
// ********************************* Fields *********************************
// --- constants ------------------------------------------------------------
// --- members --------------------------------------------------------------
/**
* A simple flag to skip alias generation. If set on the command line use
* <code>-Dalias.skip</code>.
*
* @parameter expression="${alias.skip}" default-value="false"
* @since 1.0
*/
private boolean skip;
/**
* A simple flag to log verbosely. If set on the command line use
* <code>-Dalias.verbose</code>.
*
* @parameter expression="${alias.verbose}" default-value="false"
* @since 1.0
*/
private boolean verbose;
/**
* The location of the alias definitions. The contents of the file is required
* to use the alias XSD.
*
* @parameter default-value="${basedir}/src/main/resources/alias.xml"
* @required
* @since 1.0
*/
private String aliasLocation;
/**
* The location to write the alias scripts to.
*
* @parameter default-value="${project.build.directory}/alias-scripts"
* @required
* @since 1.0
*/
private String scriptLocation;
/**
* The name of the alias to print the help on all defined aliases.
*
* @parameter default-value="h"
* @required
* @since 1.0
*/
private String helpAlias;
/**
* The optional text to prepend to the generated script. No comment markers
* allowed. This text will be written to the generated file as comments.
*
* @parameter
* @since 1.0
*/
private String intro;
/**
* If set to <code>true</code> instructs the script generator to add a comment
* after the intro text that informs about the default installation of the
* script. If set to <code>false</code> no information is added.
*
* @parameter default-value="true"
* @since 1.0
*/
private boolean addInstallationComment;
/**
* The optional text to append to the generated script. No comment markers
* allowed. This text will be written to the generated file as comments.
*
* @parameter
* @since 1.0
*/
private String extro;
/**
* A URL to further documentation on this script. This may point to a page in
* the developer team's wiki or a generated site in the project's
* documentation.
* <p>
* The URL is presented to the user of the alias script if s/he requests the
* help listing.
* </p>
*
* @parameter
* @since 1.0
*/
private String docUrl;
/**
* The list of scripts to be generated. If not specified all supported script
* types are generated. Supported scripts are: <tt>windows</tt> and
* <tt>bash</tt>.
*
* @parameter
* @since 1.0
*/
private String[] scripts;
// ****************************** Initializer *******************************
// ****************************** Constructors ******************************
// ****************************** Inner Classes *****************************
// ********************************* Methods ********************************
// --- init -----------------------------------------------------------------
// --- get&set --------------------------------------------------------------
// --- business -------------------------------------------------------------
/**
* {@inheritDoc}
*
* @see org.apache.maven.plugin.AbstractMojo#execute()
*/
public void execute() throws MojoExecutionException, MojoFailureException {
if (!skip) {
final File scriptFolder = createScriptFolder();
final ScriptBuilder[] builders = createBuilders();
final InputSource source = createSource();
final AliasesProcessor processor = createProcessor(source);
processor.process(builders);
logProcessingCompleted();
for (final ScriptBuilder builder : builders) {
final String script = builder.createScript();
writeScript(scriptFolder, builder.getId(), script);
}
} else {
getLog().info("Skipping alias plugin.");
}
}
private void writeScript(final File scriptFolder, final String id,
final String script) throws MojoExecutionException {
final File scriptFile = new File(scriptFolder, id);
try {
final OutputStream out =
new BufferedOutputStream(new FileOutputStream(scriptFile));
try {
IOUtils.write(script, out);
} finally {
IOUtils.closeQuietly(out);
}
} catch (final Exception e) {
throw new MojoExecutionException(
"Cannot write script to '" + scriptFile.getAbsolutePath() + "'.", e);
}
}
private AliasesProcessor createProcessor(final InputSource source)
throws MojoExecutionException {
try {
return new AliasesProcessor(source);
} catch (final Exception e) {
throw new MojoExecutionException(
"Cannot read alias XML from '" + source.getSystemId() + "'.", e);
}
}
private ScriptBuilder[] createBuilders() {
if (scripts == null || scripts.length == 0) {
scripts = new String[] {WindowsScriptBuilder.ID, BashScriptBuilder.ID};
}
final ScriptBuilder[] builders = new ScriptBuilder[scripts.length];
int counter = 0;
for (final String script : scripts) {
if (WindowsScriptBuilder.ID.equals(script)) {
builders[counter++] = createWindowsScriptBuilder();
} else if (BashScriptBuilder.ID.equals(script)) {
builders[counter++] = createBashScriptBuilder();
} else {
getLog().info("Skipping unrecognized script type '" + script + "'.");
}
}
return builders;
}
private ScriptBuilder createWindowsScriptBuilder() {
final ScriptBuilder builder = new WindowsScriptBuilder(helpAlias);
return initScriptBuilder(builder);
}
private ScriptBuilder createBashScriptBuilder() {
final ScriptBuilder builder = new BashScriptBuilder(helpAlias);
return initScriptBuilder(builder);
}
private ScriptBuilder initScriptBuilder(final ScriptBuilder builder) {
builder.setCommentIntro(intro);
builder.setCommentExtro(extro);
builder.setDocUrl(docUrl);
builder.setAddInstallationComment(addInstallationComment);
return builder;
}
private File createScriptFolder() throws MojoExecutionException {
final File file = new File(scriptLocation);
if (!file.exists() && !file.mkdirs()) {
throw new MojoExecutionException(
"Cannot create destination folder '" + scriptLocation + "'.");
}
return file;
}
private InputSource createSource() throws MojoExecutionException {
final File file = new File(aliasLocation);
try {
final InputStream in = new BufferedInputStream(new FileInputStream(file));
final InputSource source = new InputSource();
source.setSystemId(aliasLocation);
source.setByteStream(in);
return source;
} catch (final FileNotFoundException e) {
throw new MojoExecutionException(
"Cannot read alias XML file '" + aliasLocation + "'.", e);
}
}
private void logProcessingCompleted() {
if (verbose) {
getLog().info("Alias script generated successfully.");
}
}
// --- object basics --------------------------------------------------------
} |
def _primes(upto):
primes = np.arange(3, upto+1, 2)
isprime = np.ones((upto-1)/2, dtype=bool)
for factor in primes[:int(sqrt(upto))]:
if isprime[(factor-2)/2]:
isprime[(factor*3-2)/2::factor] = 0
return np.insert(primes[isprime], 0, 2) |
# -*- coding: utf-8 -*-
# Copyright 2015 Telefónica Investigación y Desarrollo, S.A.U
#
# This file is part of FIWARE project.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
#
# You may obtain a copy of the License at:
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#
# See the License for the specific language governing permissions and
# limitations under the License.
#
# For those usages not covered by the Apache version 2.0 License please
# contact with <EMAIL>
from novaclient.v2 import client
from commons.constants import DEFAULT_REQUEST_TIMEOUT, SLEEP_TIME, MAX_WAIT_ITERATIONS, \
TEST_FLAVOR_DEFAULT, TEST_IMAGE_DEFAULT, SSH_CONNECTION_PORT
import time
import re
class FiwareNovaOperations:
def __init__(self, logger, region_name, test_flavor, test_image, **kwargs):
"""
Initializes Nova-Client.
:param logger: Logger object
:param region_name: FIWARE Region name
:param test_flavor: Flavor for new test instances
:param test_image: Image for new test instances
:param auth_session: Keystone auth session object
:param auth_url: Keystone auth URL (needed if no session is given)
:param auth_token: Keystone auth token (needed if no session is given)
"""
self.logger = logger
self.test_image = test_image or TEST_IMAGE_DEFAULT
self.test_flavor_regex = re.compile("(.+\.)?%s$" % (test_flavor or TEST_FLAVOR_DEFAULT))
self.client = client.Client(session=kwargs.get('auth_session'),
auth_url=kwargs.get('auth_url'), auth_token=kwargs.get('auth_token'),
endpoint_type='publicURL', service_type="compute",
region_name=region_name,
timeout=DEFAULT_REQUEST_TIMEOUT)
def get_flavor_list(self):
"""
Gets the list of flavors.
:return: A list of :class:`Flavor`
"""
flavor_list = self.client.flavors.list()
return flavor_list
def get_any_flavor_id(self):
"""
Gets a flavor id from the available ones (preferably that matching default test flavor, otherwise the last one)
:return: Flavor ID, or None if no flavors were available
"""
flavor_id = None
flavor_list = self.get_flavor_list()
for flavor in flavor_list:
flavor_id = flavor.id
if self.test_flavor_regex.match(flavor.name):
break
return flavor_id
def get_image_list(self):
"""
Gets the list of images.
:return: A list of :class:`Image`
"""
image_list = self.client.images.list()
return image_list
def get_any_image_id(self):
"""
Gets a image id from the available ones (first with 'init' in its name)
:return: Image ID, or None if not found
"""
image_id = None
image_list = self.get_image_list()
for image in image_list:
if 'init' in image.name:
image_id = image.id
break
return image_id
def find_image_id_by_name(self, image_name):
"""
Finds an image by name
:param image_name: Name of the image
:return: Id of first image that matches the given name
"""
nova_img_list = self.client.images.findall(name=image_name)
if len(nova_img_list) != 0:
return nova_img_list[0].id
else:
return None
def create_security_group_and_rules(self, name):
"""
Creates a new Security Group and a default Rule (TCP/22)
:param name: Name of Sec. Group.
:return: Security Group ID
"""
# new security group
sec_group = self.client.security_groups.create(name, "Testing purpose")
self.logger.debug("Created security group '%s': %s", name, sec_group.id)
# new rule in security group (by default)
cidr = "0.0.0.0/0"
protocol = "TCP"
port = SSH_CONNECTION_PORT
sec_group_rule = self.client.security_group_rules.create(sec_group.id, ip_protocol=protocol,
from_port=port, to_port=port, cidr=cidr)
self.logger.debug("Created security group rule (%s %d %s): %s", protocol, port, cidr, sec_group_rule)
return sec_group.id
def delete_security_group(self, sec_group_id):
"""
Removes the Sec. Group.
:param sec_group_id: Sec. Group to be deleted.
:return: None
"""
self.client.security_groups.delete(sec_group_id)
self.logger.debug("Deleted security group %s", sec_group_id)
def list_security_groups(self, name_prefix=None, **kwargs):
"""
Gets all the security groups
:param name_prefix: Prefix to match security group names
:return: A list of :class:`SecurityGroup`
"""
sec_group_list = self.client.security_groups.list(kwargs)
if name_prefix:
sec_group_list = [sec_group for sec_group in sec_group_list if sec_group.name.startswith(name_prefix)]
return sec_group_list
def create_keypair(self, name):
"""
Creates new Keypair.
:param name: Name of the Keypair
:return: Private Key generated.
"""
nova_keypair = self.client.keypairs.create(name)
self.logger.debug("Created keypair %s", nova_keypair.name)
return nova_keypair.private_key
def delete_keypair(self, name):
"""
Removes a Keypair.
:param name: Name of the keypair to be deleted.
:return: None
"""
keypair = self.client.keypairs.find(name=name)
self.client.keypairs.delete(keypair)
self.logger.debug("Deleted keypair '%s'", name)
def list_keypairs(self, name_prefix=None):
"""
Gets all the keypairs
:param name_prefix: Prefix to match keypair names
:return: A list of :class:`Keypair`
"""
keypair_list = self.client.keypairs.list()
if name_prefix:
keypair_list = [keypair for keypair in keypair_list if keypair.name.startswith(name_prefix)]
return keypair_list
def find_keypair(self, **kwargs):
"""
Gets the keypairs matching attributes given in `kwargs`.
:return: A a keypair data :class:`Keypair` that matches with the giver params
"""
keypair_list = self.client.keypairs.find(**kwargs)
self.logger.debug("Find keypairs by %s. Result: %s", str(kwargs.items()), str(keypair_list))
return keypair_list
def launch_instance(self, instance_name, image_id, flavor_id, keypair_name=None, metadata=None, userdata=None,
security_group_name_list=None, network_id_list=None):
"""
Launches a new Service Instance.
:param instance_name: Something to name the server.
:param image_id: The ImageID to boot with.
:param flavor_id: The FlavorID to boot onto.
:param keypair_name: (optional extension) name of previously created
keypair to inject into the instance.
:param metadata: A dict of arbitrary key/value metadata to store for this
server. A maximum of five entries is allowed, and both
keys and values must be 255 characters or less.
:param userdata: userdata file content (String)
:param security_group_name_list: Sec. Groups ID list to be used by the instance
:param network_id_list: (optional extension) an ordered list of nics to be
added to this server, with information about
connected networks, fixed ips, port etc.
Example: network_id_list=[{'net-id': network['id']}]
:return: Instance data launched
"""
nova_server_response = self.client.servers.create(name=instance_name, image=image_id, flavor=flavor_id,
key_name=keypair_name, meta=metadata,
userdata=userdata,
security_groups=security_group_name_list,
nics=network_id_list, min_count="1", max_count="1")
self.logger.debug("Created server '%s': %s", instance_name, nova_server_response.id)
return nova_server_response.to_dict()
def get_server(self, instance_id):
"""
Gets instance data from deployed server.
:param instance_id: Deployed ServerID.
:return:
"""
nova_server_response = self.client.servers.get(instance_id)
return nova_server_response.to_dict()
def delete_server(self, instance_id):
"""
Removes a server.
:param instance_id: ServerID to be deleted.
:return: None
"""
self.client.servers.delete(instance_id)
def list_servers(self, name_prefix=None, **kwargs):
"""
Gets all the servers of the tenant
:param name_prefix: Prefix to match server names
:return: A list of :class:`Server`
"""
server_list = self.client.servers.list(kwargs)
if name_prefix:
server_list = [server for server in server_list if server.name.startswith(name_prefix)]
return server_list
def wait_for_task_status(self, server_id, expected_status):
"""
Wait for a task status. This method will wait until the task has got the given status or 'ERROR' one.
:param server_id: Deployed ServerID to be monitored
:param expected_status: Expected status value
:return: (Real task status at the end, Detailed reason to end waiting)
"""
detail = "Server NOT {} after {} seconds".format(expected_status, MAX_WAIT_ITERATIONS * SLEEP_TIME)
for i in range(MAX_WAIT_ITERATIONS):
server_data = self.get_server(server_id)
if server_data['status'] == expected_status:
detail = "Server %s" % expected_status
break
elif server_data['status'] == 'ERROR':
detail = server_data.get('fault', {'message': "Server NOT %s" % expected_status})['message']
self.logger.error(detail)
break
self.logger.debug("Waiting (#%d) for status %s of instance %s (current is %s)...",
i + 1, expected_status, server_id, server_data['status'])
time.sleep(SLEEP_TIME)
self.logger.debug("Status of instance %s is %s", server_id, server_data['status'])
return server_data['status'], detail
def allocate_ip(self, pool_name):
"""
Create (allocate) a floating ip for a tenant
:param pool_name: Name of the IP Pool
:return: Allocated IP
"""
allocated_ip_data = self.client.floating_ips.create(pool=pool_name)
self.logger.debug("Allocated IP %s: %s", allocated_ip_data.ip, allocated_ip_data.id)
return allocated_ip_data.to_dict()
def deallocate_ip(self, ip_id):
"""
Delete (deallocate) a floating ip for a tenant
:param ip_id: The floating ip address to delete.
"""
self.client.floating_ips.delete(ip_id)
self.logger.debug("Deallocated IP with id %s", ip_id)
def list_allocated_ips(self):
"""
Gets all the IPs currently allocated
:return: IP list
"""
return self.client.floating_ips.list()
def add_floating_ip_to_instance(self, server_id, ip_address):
"""
Adds a already allocated floating IP to VM
:param server_id: Server ID where IP will be associated (String)
:param ip_address: Allocated IP to be associated (String)
:return: None
"""
self.client.servers.add_floating_ip(server_id, ip_address, fixed_address=None)
def get_nova_console_log(self, server_id):
"""
This method gets the NOVA Console-Log of the given server.
:param server_id (string): Server ID to get its console-log
:return (string): console-log output
"""
return self.client.servers.get_console_output(server_id)
|
The Cardiorespiratory Network in Healthy First-Degree Relatives of Schizophrenic Patients
Impaired heart rate- and respiratory regulatory processes as a sign of an autonomic dysfunction seems to be obviously present in patients suffering from schizophrenia. Since the linear and non-linear couplings within the cardiorespiratory system with respiration as an important homeostatic control mechanism are only partially investigated so far for those subjects, we aimed to characterize instantaneous cardiorespiratory couplings by quantifying the casual interaction between heart rate (HR) and respiration (RESP). Therefore, we investigated causal linear and non-linear cardiorespiratory couplings of 23 patients suffering from schizophrenia (SZO), 20 healthy first-degree relatives (REL) and 23 healthy subjects, who were age-gender matched (CON). From all participants’ heart rate (HR) and respirations (respiratory frequency, RESP) were investigated for 30 min under resting conditions. The results revealed highly significant increased HR, reduced HR variability, increased respiration rates and impaired cardiorespiratory couplings in SZO in comparison to CON. SZO were revealed bidirectional couplings, with respiration as the driver (RESP → HR), and with weaker linear and non-linear coupling strengths when RESP influencing HR (RESP → HR) and with stronger linear and non-linear coupling strengths when HR influencing RESP (HR → RESP). For REL we found only significant increased HR and only slightly reduced cardiorespiratory couplings compared to CON. These findings clearly pointing to an underlying disease-inherent genetic component of the cardiac system for SZO and REL, and those respiratory alterations are only clearly present in SZO seem to be connected to their mental emotional states.
INTRODUCTION
Schizophrenia represents a mental disorder along with increased cardiovascular mortality rate, shorter life expectancy, higher risk of developing cardiovascular disease (CVD) in proportion to the general population (Hennekens et al., 2005;McGrath et al., 2008;Laursen et al., 2014). One reason in schizophrenia, besides others (Straus et al., 2004;Hennekens et al., 2005;Ringen et al., 2014), seems to be an unbalanced autonomic nervous system (ANS) during the acute psychosis state quantified by analyses heart rate variability (HRV) and respiratory variability (RESPV).
Different studies suggested as a major contributing factor the unbalanced sympathovagal balance for schizophrenic patients, as well as for their healthy first-degree relatives (Valkonen-Korhonen et al., 2003;Bär et al., 2005Bär et al., , 2007Chang et al., 2009;Schulz et al., 2013c). However, investigations of respiration and cardiorespiratory couplings is becoming more of interest in medicine and research (Peupelmann et al., 2009;Bär et al., 2012;Schulz et al., 2012aSchulz et al., ,b, 2013bSchulz et al., , 2014Schulz et al., , 2018 for schizophrenia since respiration plays a major part homeostatic regulatory control processes. As far as we know there exist only a few investigations dealing with causal couplings quantifying the coupling strengths and coupling directions in these patients. The field of Network Physiology aiming to identify and quantify the dynamics within the (patho)physiological network with their different sub-networks and their interactions between them (Bashan et al., 2012) but seems to be a promising multivariate concept to describe the cardiorespiratory system. Moreover, Network Physiology quantifies healthy and diseased states investigating the coupling between systems and subsystems by determining structural, dynamical and regulatory changes. These new concepts allow getting a better understanding of the complexity of physiological as well as pathophysiological processes in health and disease by linking genetic and subcellular levels with intercellular coupling pathways between integrated systems and subsystems (Ivanov et al., 2016).
Studies investigating HRV generally showed an altered sympathovagal balance pointing to dysregulation of heart rate for schizophrenic patients and partially their first-degree healthy relatives (Toichi et al., 1999;Valkonen-Korhonen et al., 2003;Bär et al., 2005Bär et al., , 2007Bär et al., , 2010Castro et al., 2009;Chang et al., 2009;Voss et al., 2010). The pattern of an unbalanced ANS (heart rate) in schizophrenic patients and their relatives seem to hallmark a disease-inherent genetic feature of this disease. Busjahn et al. (1998) highlighted that there exist a genetic dependency of HRV indices. Studies analyzing respiration and cardiorespiratory couplings in schizophrenia are exclusive (Peupelmann et al., 2009;Bär et al., 2012;Schulz et al., 2012aSchulz et al., ,b, 2013bSchulz et al., , 2015bSchulz et al., , 2018 and demonstrated significantly altered dynamic and variability of respiration as well as impaired cardiorespiratory couplings for schizophrenic patients but not for their healthy first-degree relatives. Respiration is regulated in the brain stem primarily for metabolic and homeostatic purposes, it also constantly reacts to changes in emotions (Homma and Masaoka, 2008). It seems that the altered psychotic states of schizophrenic patients compared to healthy subjects have a great influence on their cardiorespiratory system characterized by an interplay of different linear and non-linear subsystems (Voss et al., 2009). The respiratory sinus arrhythmia (RSA) occupies an important part of cardiorespiratory couplings. RSA describes the rhythmic fluctuation of heart rate in proportion to respiration. Under normal physiological conditions RSA characterizes changes between inspiratory heart rate acceleration and expiratory heart rate deceleration (Eckberg, 2003). Studies have actually shown that the coupling between cardiovascular system and respiration is strongly non-linear (Novak et al., 1993). For the analysis of the cardiorespiratory system as a complex physiological regulatory network, a variety of methods have been proposed (Schulz et al., 2013a;Bartsch et al., 2015;Faes et al., 2015;Liu et al., 2015;Ivanov et al., 2016) basing on Granger causality, phase synchronization, entropies, non-linear prediction, symbolization, and time delay stability (TDS) (Schulz et al., 2018).
Investigating the coupling between heart rate and respiration could provide potential clinically insights into (patho)physiological autonomic processes in schizophrenia and their relatives. In contrast to our preliminary work in this field, we have applied a pool of different coupling methods from the time and frequency domain that can quantify both linear and non-linear causal couplings. This will allow us to gain more insight into the regulatory processes of the cardiorespiratory system, which will provide a better understanding of how individual systems interact with each other in a healthy and explored state. This study aimed to quantify instantaneous cardiorespiratory couplings in schizophrenic patients and their healthy first-degree relatives. Therefore, multivariate linear and non-linear causal coupling approaches were applied determining causal coupling strengths and directions. We speculate that these new findings are important for a full understanding of (patho)physiological regulatory processes and possibly may help to improve treatment strategies in schizophrenia and identify those patients at increased risk for cardiovascular disease accompanied by ANS dysfunction.
Subjects
Twenty-three untreated patients suffering from paranoid schizophrenia (SZO), 20 healthy first-degree relatives (REL) and 23 healthy controls subjects (CON) (age-gender matched) ( Table 1) were enrolled in this pilot study. Patients were included only when they had not taken any medication for at least 8 weeks. From all participants the serum drug levels were checked for legal drugs (e.g., antipsychotics, antidepressants, and benzodiazepines) and illegal drugs (e.g., cannabis). In accordance with the inclusion criteria, only subjects with negative results were included in the Psychotic symptoms for acute schizophrenia were quantified using the Scale for the Assessment of Positive Symptoms (SAPS) and negative symptoms (SANS) and positive and negative syndrome scales (PANSS); n.a., not applicable.
Frontiers in Neuroscience | www.frontiersin.org study. Paranoid schizophrenia was diagnosed when patients fulfilled DSM-IV criteria . The semi-structured clinical interview SCID-1 was used for patients to approve the clinical diagnosis. Control subjects were recruited from hospital staff, medical students and the local community. From all healthy control subjects and relatives interview and clinical investigation were performed to rule out any psychiatric or other disease or disruptive medication. Additionally for all controls the Structured Clinical Interview SCID II and a personality inventory (Freiburger Persönlichkeitsinventar) were applied to detect personality traits or disorders that could affect autonomic function (LeBlanc et al., 2004), and if present they were not included in this study. The written informed consent to a protocol approved by the local ethics committee of the Jena University Hospital (ethics committee number: 1190-09/03) was provided by all participants. This study complies with the Declaration of Helsinki.
Data Recordings and Pre-processing
A short-term ECG (1,000 Hz) and synchronized calibrated respiratory inductive plethysmography signal (Bär et al., 2012) (LifeShirt R , VivoMetrics, Inc., Ventura, CA, United States) were recorded for 30 min under resting conditions after 10 min rest in supine position. Subjects were asked not to talk, to relax and to breathe normally during the recording. For the further analyses from the raw data.
-Time series of successive beat-to-beat intervals (BBI, msec) and -Time series of respiratory frequency (RESP, sec) as the time intervals between consecutive breathing cycles were automatically extracted.
These time series were afterward adaptively filtered (Wessel et al., 2000) to exclude and interpolate ventricular premature events and/or artifacts to obtain normal-to-normal beat time series (NN). Linear interpolation procedure was applied to filtered time series (BBI, RESP) for synchronization and resampling (2 Hz).
Basic Data From the Heart Rate and Respiration
Basic indices from heart rate and respiration were determined as: -meanNN: mean value of the NN intervals of BBI (msec), and RESP (sec) as respiratory cycle length; -sdNN: standard deviation of the NN intervals of BBI (msec), and RESP (sec); -HR: basic heart rate as the number of heart beats per minute (1/min), and -BF: breathing frequency as the number of breaths per minute (1/min).
Coupling Analyses
Different approaches can be used for the quantification of linear and non-linear cardiorespiratory couplings (Schulz et al., 2013a). In this study, we analyzed the coupling between BBI and RESP applying the linear normalized short-time partial directed coherence (NSTPDC) (Adochiei et al., 2013), the linear/nonlinear multivariate Transfer Entropy (MuTE) (Montalto et al., 2014) and the non-linear cross conditional entropy (CCE) (Porta et al., 1999) approaches as well as the respiratory sinus arrhythmia (RSA).
Normalized Short-Time Partial Directed Coherence
NSTPDC represents an enhancement of the traditional partial directed coherence (PDC) (Baccala and Sameshima, 2001) approach assessing linear Granger causality in the frequency domain quantifying direct and indirect couplings within a set of multivariate time series. The fundamental basis of the NSTPDC is the time-variant partial directed coherence approach is allowing to determine causal short-term couplings between non-stationary time series at certain frequency f applying a window function (n is the number of windows) (Milde et al., 2011). An m-dimensional autoregressive (AR) model is used to calculate NSTPDC indices. The optimal model order p opt was determined by the stepwise least squares algorithm ) and the Schwarz's Bayesian Criterion (SBC) . The coupling direction between two time series, x and y, (e.g., BBI and RESP) was determined by a coupling factor (CF) which is determined by the quotient of π xy (f,n) and π yx (f,n).
The results of CF were normalized and result in the normalized factor (NF), which characterizes the coupling direction.
Thereby, NF (NF = {−2, −1, 0, 1, 2}) determinates the causal coupling direction between the two time series (x BBI and y RESP ) as a function of frequency f. Coupling strength: In each window (f = 0-2 Hz) an area is made up of CF allowing to assess the coupling strength. For x BBI and y RESP these areas are:A BBI→RESP and A RESP→BBI . The values of these area indices ranges between 0 and 1 . Thereby, 1 points to that from x all information is transferred (→) toward y (A x→y = 1). Hamming window with a length of 120 samples and a shift of 30 samples per each iteration step was applied. To ensure scaleinvariance all time series were normalized to zero mean and unit variance (Schulz et al., 2015a).
Multivariate Transfer Entropy
Transfer Entropy (TE) introduced by Schreiber (Schreiber, 2000) is able to quantify linear as well as non-linear information transfer between time series, to detect driver-response-relationships, and to assess asymmetries between information transfers. TE has the big advantage that it is "model-free" approach (Schulz et al., 2013a) making TE very sensitive to any types of dynamical information transfer. Montalto et al. (2014) introduced the Multivariate Transfer Entropy (MuTE) as a MATLAB toolbox with different entropy estimators to transfer the classical TE from a bivariate approach into a multivariate approach. The coupling strength of a multivariate set of time series can be determined as: with information transfer from X toward (→) Y, or vice versa. In this study we wanted to quantify non-linear couplings within the cardiorespiratory system with high specificity and sensitivity, therefore, we applied the non-uniform embedding (NN NUE) technique with the nearest neighbor estimator shown to be most suitable to detect non-linearities with high specificity and sensitivity (Montalto et al., 2014). Porta et al. (1999) introduced the cross conditional entropy (CE x/y ) based on the conditional entropy (CE). Thereby, CE x/y determines the level of coupling between the two time series x and y,
Cross Conditional Entropy
with the pattern length L, the joint probability p(y L−1 ) of the pattern y L−1 (t) and the conditional probability p(x(t)/y L−1 ) of the sample x(t), given that the pattern y L−1 . CE x/y assesses the amount of information contained in the sample x(t) in the case that the pattern of L−1 samples of y L−1 (t) is existing. Moreover, CE x/y quantifies causality by determining direct couplings regarding to cross-prediction approaches. Finally, an uncoupling function UF can be estimated that determines the information content that is transferred between two time series (Porta et al., 1999). Here, we calculated the UF x,y between HR and BF as UF HR,BF . The larger UF, the more decoupled the two time series are (UF = 1, HR und BF are completely independent from each other).
Respiratory Sinus Arrhythmia
Respiratory Sinus Arrhythmia (RSA) is used as an index of cardiac parasympathetic activity derived by heart rate changes (BBI) which correspond to inspiration and expiration (Grossman et al., 1990a). RSA is characterized by the shortening of heart rate intervals (BBI) during inspiration and the lengthening of heart rate intervals during expiration. In this study, we assess RSA in the time domain applying the peak-to-valley approach (RSA P2V , msec). The LifeShirt R automatically estimated RSA using the peak-to-valley approach for each breathing cycle (Grossman et al., 1990b).
Surrogate Data
To evaluate the significance of the cardiorespiratory couplings between CON and SZO as well as REL a surrogate data approach was applied (Schreiber and Schmitz, 2000). Here, from all original time series 20 independent surrogates were derived for each schizophrenic patient (SZOs), each relative (RELs), and each healthy control (CONs). The temporal structure within the original time series was destroyed by randomly permuting each sample to derived new surrogate time series. Afterward, we tested if significant couplings between the original time series were confirmed by the surrogate data. Therefore, a statistical defined coupling threshold level t s (defined as the mean + 2 * SD of the resultant distribution derived from all surrogates SZOs, RELs, and CONs) was introduced. Significant valid couplings were present if no significant differences between two surrogate groups exist and if couplings (original data) were higher than t su .
In addition, a second surrogate approach was applied by generating random phase surrogates to test for non-linearity in the data. This surrogate approach is known as phase randomization and preserves linear behavior (i.e., the power spectrum/autocorrelation) but destroys any non-linear behavior. Preserving the power spectrum while randomizing the Fourier phases of the data providing surrogates in which any non-linear structure is destroyed (Lancaster et al., 2018).
Statistics
For the statistical evaluation of the results between SZO, REL and CON first the Kruskal-Wallis test followed by the post hoc non-parametric exact two-tailed Mann-Whitney U-test in combination with the Kolmogorov-Smirnov test (check for equal distributions) (SPPS 21.0) were applied. The significance level was set to p < 0.01, and for highly significant different to p < 0.004 (Bonferroni-Holm adjustment). In order to check, if effects size have a relevant influence, effect sizes based on Cohen's d were applied to describe the magnitude of the differences between the groups. The most popular effect size measure is Cohen's d (Cohen, 1988).
Results were expressed in median and 25 and 75% percentiles.
RESULTS
The Kruskal-Wallis test revealed for all indices, with the exception of sdNN _RESP , significant differences (p < 0.01) between all three groups.
Patients Suffering From Schizophrenia vs. Healthy Subjects
Basic data from HR analysis revealed highly significant differences between SZO and CON. SZO showed shortened mean value of the NN intervals (meanNN _BBI ) and reduced variability (sdNN _BBI ) and higher HR ( Table 2). Variability analyses of RESP showed a reduced (significant) mean respiratory cycle length (meanNN _RESP ) and consequently an increased breathing frequency (BF) in SZO compared to CON ( Table 2).
Cardiorespiratory analysis revealed significant differences between the couplings in SZO than CON ( Table 2).
NSTPDC analyses revealed a highly significant NF (CON: NF = −1.9 ± 0.2; SZO: NF = −1.0 ± 0.8) between SZO and CON. For CON, the NF was approximately −2, suggesting a strong unidirectional information transfer from RESP → BBI. For SZO the NF was approximately −1 pointing to a strong bidirectional information transfer with RESP as the driver (RESP → BBI). The coupling strengths were significantly different for both area indices (A BBI → RESP , A RESP → BBI ) between both groups. In the case that BBI influenced RESP (A BBI → RESP ), SZO demonstrated a higher coupling strength in comparison to CON. In the case that RESP influenced BBI (A RESP → BBI ) we found a lower coupling strength for SZO compared to CON (Figures 1, 2).
MuTE showed similar results as NSTPDC, but with nonlinear components, that in the case that BBI influenced RESP (MuTE BBI → RESP ) higher coupling strength with nonlinear components was present for SZO, and in the case that RESP influenced BBI (MuTE RESP → BBI ) lower coupling strength with non-linear components was found for SZO in comparison to CON.
The uncoupling function quantifying the information transfer between HR and BF revealed an increased value for SZO in comparison to CON, pointing to stronger decoupling of the cardiac and respiratory system in SZO.
Highly significantly lower RSA values (RSA P2V ) were found for SZO in compassion to CON.
All significant couplings were confirmed by surrogate analysis. No significant differences in linear and non-linear coupling indices were found between the groups for surrogate time series.
The results from phase randomization surrogate analysis revealed highly significant differences in all three NSTPDC TABLE 2 | Results of heart rate-and respiratory variability and cardiorespiratory coupling analyses to differentiate between patients suffering from paranoid schizophrenia (SZO), healthy first-degree relatives (REL), and healthy control subjects (CON).
Healthy First-Degree Relatives of Schizophrenic Patients vs. Healthy Subjects
Indices from cardiac variability demonstrated only a significant increased HR in REL compared to CON and consequently shortened mean value of the NN intervals (meanNN _BBI ). Respiratory variability analyses did not demonstrate significant differences between REL and CON.
Results for cardiorespiratory couplings showed only significant different for RSA analyses with decreased RSA values (RSA P2V ) for REL compared to CON (Table 2 and Figure 2). All significant couplings were confirmed by surrogate analysis. No significant differences in linear and non-linear coupling indices were found between the groups for surrogate time series.
Phase randomization surrogate analysis showed significance for A BBI → RESP comparing CON and REL (Table 3).
Patients Suffering From Schizophrenia vs. Their Healthy First-Degree Relatives
Basic indices from HR and respiration did not contribute to a differentiation of these groups.
Results for cardiorespiratory couplings revealed highly significant differences for NSTPDC, CCE, and RSA analyses.
NSTPDC results demonstrated a highly significant NF value and A RESP → BBI value between REL and SZO. Thereby, REL showed −1.7 indicating to a weak unidirectional coupling with RESP as the driver and BBI as the target variable. The coupling strength (A RESP → BBI) was highly significant increased in REL compared to SZO (Figures 1, 2).
The uncoupling function revealed highly significant decreased value for REL in comparison to SZO, pointing to weaker decoupling (=stronger coupling) between the cardiac and respiratory system in comparison to SZO.
Significant higher RSA values (RSA P2V ) for REL were found for REL compared to SZO (Table 2 and Figure 2).
All significant couplings were confirmed by surrogate analysis. No significant differences in linear and non-linear coupling indices were found between the groups for surrogate time series.
Phase randomization surrogate analysis for NSTPDC demonstrated a highly significant NF value and A RESP → BBI value between REL and SZO ( Table 3).
DISCUSSION AND CONCLUSION
In our study, we found highly significant increased HR, reduced HRV, higher BF, and impaired cardiorespiratory couplings for schizophrenic patients compared to healthy control subjects. For SZO these couplings were characterized as bidirectional ones, with a driver-responder relationship from RESP → BBI, with weaker linear and non-linear coupling strengths when respiration influencing heart rate and with stronger linear and non-linear coupling strengths when HR influencing respiration. For the healthy first-degree relatives we found only significant increased HR and impaired RSA compared to healthy subjects (Figures 2, 3).
The variability analyses of basic heart rate indices are consistent with different studies that have shown an impaired sympathovagal tone in untreated schizophrenic patients (Mujica-Parodi et al., 2005;Boettger et al., 2006;Bär et al., 2007;Chang et al., 2010;Schulz et al., 2013cSchulz et al., , 2015a. These results suggest an impairment of the ANS shown by a reduced HRV (sdNN _BBI ↓, meanNN _BBI ↓) expressed by a higher sympathovagal activation of the ANS. Furthermore, a predominant sympathetic activation for SZO (2.94 ± 2.28) was additionally confirmed by significantly increased LF/HF compared to CON (1.74 ± 1.57) and to REL (1.78 ± 1.15). Impaired cardiac regulation, which is one FIGURE 2 | Box plots of significant cardiorespiratory indices from healthy subjects (CON), healthy first-degree relatives (REL), and schizophrenic patients (SZO) for (A) heart rate (HR), (B) respiratory sinus arrhythmia (RSA), (C) the coupling strength from normalized short-time partial directed coherence (NSTPDC) analysis from RESP to BBI, and (D) the coupling strength from multivariate transfer entropy (MuTE) analysis from RESP to BBI (BBI, beat-to-beat intervals; RESP, time intervals between consecutive breathing cycles). Boxes indicate data between 25th and 75th percentile with the horizontal bar reflecting the median. of the major contributors to changed sympathovagal balance, represented by higher basic HR in the first episode and during untreated conditions could clearly be demonstrated by several studies and seems to be a hallmark in schizophrenic patients. Bär et al. (2007) speculated that reduced HR seems to be highlighting that the cardiac system is not able to adapt to the different demands arising from posture or exertion, and moreover, that patients are at higher risk of developing arrhythmias. Valkonen-Korhonen et al. (2003) also demonstrated significantly reduced RMSSD and HF performance in psychotic patients and unchanged HRV in mental tasks than in healthy controls. They concluded that patients could not adjust HRV according to the task load. One could assume that acute psychosis state in these subjects leads to a restricted ability of the ANS to respond to external demands. Voss et al. (2011) also demonstrated reduced linear and non-linear HRV pointing to a higher sympathovagal activity in schizophrenic patients and their relatives. Moreover, the impairment of cardiac activity (complexity) confirms the assumption of an changed sympathovagal HR regulation in schizophrenia (Voss et al., 2009). Healthy first-degree relatives of patients showed only increased HR supported by other studies (Bär et al., 2010;Berger et al., 2010;Bär et al., 2012;Abhishekh et al., 2014). Basic respiratory indices variability analysis showed significantly increased BF in SZO compared to CON supporting other findings dealing with untreated patients (Peupelmann et al., 2009;Bär et al., 2012;Schulz et al., 2012a). Here, it was shown that schizophrenia is accompanied by significantly shorter inspiration and expiration times and a higher BF. For healthy first-degree relatives we found no significant differences in respiratory activity compared to healthy subjects. This is in accordance to the findings of Bär et al. (2012), who only observed alterations in respiration for schizophrenia but not for relatives. They speculated that these findings could be a sign of excitement in critically diseased patients. In other study (Schulz et al., 2012a) we found significantly impaired respiratory variability and respiratory dynamics in schizophrenic patients, but neither for healthy first-degree relatives. This is a noteworthy fact that for schizophrenic patients and their first-degree healthy relatives comparable alterations in HRV (reduced) are present (Castro et al., 2009;Bär et al., 2010Bär et al., , 2012Voss et al., 2010). These findings further leads to the assumption that an underlying disease-related genetic susceptibility of cardiac regulatory activity is obviously present in schizophrenia and relatives.
However, the entire cardiorespiratory system seems not to be affected, and that the dysfunction of the ANS appears to have a cardiac genetic basis. For example, it could also be shown that a genetic dependency of HRV was evident in healthy twins (Busjahn et al., 1998). In another study (Voss et al., 1996) HRV in the time-and non-linear dynamics domains found significant alterations between twin-and non-twin pairs (62, twin pairs: 30 monozygotic, and 32 dizygotic) leading to the assumption that there exists a genetic component in cardiac system in the generation of heart rate and its variability. Wang et al. (2009) investigated the heritability of HRV under stress and at rest and its dependency on ethnicity and gender (in 427 European and 308 African American twins). They found the same genes influenced HRV under stress and at rest independent of ethnicity and gender. Meda et al. (2014) investigated the genetic background of schizophrenia and its relatives studying the brain's default mode network (DMN) of 296 schizophrenic patients (SZO), 179 unaffected first-degree relatives of SZO (SZREL) and 324 healthy subjects. They showed changes of functional connectivity in SZO and that these changes in DMN were selective only for SZREL familial, with genes regulating specific neurodevelopmental and transmission processes primarily mediating DMN discontinuity.
Personality anxiety has been shown to be associated with altered breathing alterations and BF Homma, 1997, 1999). The authors found that a higher BF was not associated with metabolic factors and is coordinated with the limbic system and the respiratory drive . Boiten et al. (1994) found that alterations in breathing reflect the state a of emotional reaction connected with the requirements to react to emotional situations. Furthermore, symptoms of panic attacks and pulmonary patients overlap that panic anxiety highlights a cardiopulmonary disorder and that shortness of breath highlights an underlying anxiety disorder (Smoller et al., 1996). Respiratory changes may be explained by the fact that excitation disturbances in prefrontal are of the amygdala as assumed in paranoid schizophrenia could be responsible for the connection between psychopathology and alterations of respiration (Bär et al., 2012;Schulz et al., 2018Schulz et al., , 2019. Therefore, chronic changes in HR and respiration in schizophrenia appear to be associated with cardiac dysfunction and not just a simple stress-related anxiety disorder (Schulz et al., 2015a).
Linear cardiorespiratory coupling analysis revealed a bidirectionally pronounced coupling direction (NF: −1.0) with respiration as the driver toward cardiac activity (RESP → BBI) in SZO vs. CON who demonstrating a more pronounced RSA regulation. The linear coupling from heart to respiration BBI → RESP (significantly increased in SZO) is supposed to be an RSA complementary biomarker as a reciprocal part of the cardiorespiratory interrelationship (Dick et al., 2014). Dick et al. (2014) stated that the joint interrelationship between the airways and the ANS as a function of gas exchange is emphasized by the fact that the ANS transmits information to the respiratory tract, which generates beat-to-beat changes, while the information transfer from respiration to the ANS is pronounced as a part of the RSA control loop.
Results from phase randomization surrogate analysis confirmed in general the underlying linear coupling structure for the directions BBI → RESP and RESP → BBI when considering NSTPDC results. But there was one exception, in the case when CON was compared with REL; we found in phase randomization surrogates a significant difference for A BBI → RESP that was not present in the original time series. This can be a consequence of the low absolute values for the coupling strength.
For cardiorespiratory couplings with non-linear components significantly lower coupling strength was found in the direction RESP → BBI suggesting impaired non-linear regulatory pathways within the RSA-loop.
Phase randomization surrogates showed also significant differences between CON and SZO in the case of that BBI influenced RESP (MuTE BBI → RESP ) as already found in the original time series. This means that the found difference in the coupling between CON and SZO (original time series) for the direction BBI → RESP was of linear nature without nonlinear components. On the other side, we found no significant difference in coupling for the direction RESP → BBI in phase randomization surrogates (but in the original time series) pointing to a strong non-linear coupling behavior when RESP influenced BBI in the original time series.
In the study of Peupelmann et al. (2009), they found that the severity of schizophrenia is connected to alterations in breathing, and speculated that the vagal control within the brainstem does not work properly and leads to these findings. In the case that respiration transfers information toward the heart (RESP → BBI) is related to central respiratory driving mechanisms is respect to responses of the cardiac system (Faes et al., 2011). These impaired central respiratory driving mechanisms are assumed to be the cause of the impairments in the cardiac system in SZO (Schulz et al., 2015a(Schulz et al., , 2019. Bär et al. (2012) investigated cardiorespiratory couplings in control subjects compared to schizophrenic patients and their relatives. They observed impaired cardiorespiratory coupling, which was characterized by increased decoupling function (CCE) and complexity of cardiorespiratory couplings in schizophrenic patients. Williams et al. (2004) stated "that dissociation of amygdala prefrontal circuits and excitation leads to inhibition of signal processing of threat-related signals in SZO. In particular, dysregulation in the normal cycle of mutual feedback between amygdala work processes and autonomic regulatory activities is characterized by reduced amygdala activity and excessive excitation in these patients." In addition, our results demonstrated that RSA is inhibited supported by other studies (Bär et al., 2012;Schulz et al., 2015a) which showed altered cardiorespiratory interactions and restricted RSA in untreated SZO. Thus, we speculate that impaired vagal control in the brain stem or restricted control pathways of higher centers is responsible for these results. In other study, we found that fractal structures of RSA were strengthened in SZO leading to the assumption that the rhythmic components of the RSA time series did fluctuated more randomly supporting the assumption that cardiac control in heart rate regulation agrees less with respiration in SZO leading to reduced RSA P2V in SZO (Schulz et al., 2015a). We speculated that the impairment of cardiac regulation is not a stress-related excitation but more chronic and significant alterations in hear rate and breathing regulation (Schulz et al., 2015a). The significant alterations within the cardiorespiratory system seem clearly pointing to a diseaserelated hallmark in SZO and could reflect responses of the ANS during psychosis in acute schizophrenic patients. Due to, that relatives are not in the same "emotional and psychotic state" as patients it seems to be that the alterations within the cardiorespiratory system are closely connected to the emotions in SZO (Suess et al., 1980;Dimitriev et al., 2014;Jerath et al., 2015) and occur mainly only in this disease (Schulz et al., 2015b).
The novelty of this study, in contrast to our previous studies, is that in this study we were able to use a variety of methods from different domains, such as time domain, Granger causality and entropy domain. Especially, the application of two different causality approaches allowed us to assess coupling strength and the direction of the cardiorespiratory couplings. These features were not investigated and were possible so far. By determining causal relationships, it is now possible to understand how the cardiorespiratory system works in these patients. Schulz et al. (2015b), we applied and tested the introduced highresolution joint symbolic dynamics approach to determine if with this approach a differentiation of the three groups is possible and to assess short-term non-causal couplings. We found a significantly altered heart rate pattern, respiratory pattern and cardiorespiratory couplings in SZO and only marginal alterations for REL group comparison to CON. Here, in this study, we are able to determine the causality of regulatory systems (heart and respiration) for these participants giving new insides of autonomic control.
For schizophrenia, this question has not yet been clarified as to what the defined working mechanisms are that are responsible for the obvious dysregulation of the ANS, since the number of brain areas (cortical, subcortical, and brain stem) is involved in autonomous regulatory processes. To sum up, we demonstrated a significantly impaired heart-and respiratory regulation expressed in their variability and dynamics and an impaired cardiorespiratory interactions in schizophrenic patients, and only a significantly altered heart rate regulation in healthy first-degree relatives. These results are consistent with previous studies, which also showed reduced HRV in schizophrenia and its first-degree healthy relatives, which clearly indicate underlying disease-related genetic vulnerability of the cardiovascular system (particularly within the cardiac subsystem). In schizophrenia, the results might be a result of lower vagal control within the brain stem, impaired communication between the brain stem and higher centers, or panic and anxiety-related alterations in the brain stem during the acute psychosis state in SZO (Schulz et al., 2018(Schulz et al., , 2019. Moreover, relatives do not seem to be in the same emotional and psychotic state as their sick schizophrenic relatives. As a result of the fact that in relatives only the cardiac system seems to be affected, it explains that the cardiorespiratory couplings are not significantly altered compared to the sick relatives (schizophrenia). Therefore, it seems that the alterations within the cardiorespiratory system and the linkages between the related subsystems that are apparent in schizophrenia are closely related to psychotic emotions that are evident during the acute phase of this disease (Schulz et al., 2015b), highlighted by alterations within the cardiac-and the respiratory systems. The interrelationship between the autonomous nerves system (cardiovascular and cardiorespiratory) in neuropathological diseases and the associated central control mechanisms are still not fully addressed in research.
DATA AVAILABILITY STATEMENT
The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation, to any qualified researcher.
ETHICS STATEMENT
The studies involving human participants were reviewed and approved by the local ethics committee of the Jena University Hospital. The patients/participants provided their written informed consent to participate in this study.
AUTHOR CONTRIBUTIONS
SS analyzed and interpreted the data, wrote the article, and final approval of the version to be published. K-JB conceived and designed the study, collected and assembled the data, interpreted the data, critically revised the article for significant intellectual content, and reread the final version prior to its publication. AV interpreted the data, did a critical revision of the article for its significant intellectual content, and reread the final version prior to its publication. JH did a critical revision of the article for its significant intellectual content, and reread the final version prior to its publication.
FUNDING
This work was supported by grants from the German Federal Ministry for Economic Affairs and Energy (BMWI) (ZF4485201SB7). |
/**
* Mingle Service Address, like InetAddress Created by Michael Jiang on
* 2016/12/3.
*/
public class ServiceAddress {
private String ip;
private int port = 80;
private ServiceAddress(String ip, int port) {
if (!isValidPort(port)) {
throw new IllegalArgumentException("port:" + port + " is illegal");
}
this.ip = ip;
this.port = port;
}
public static ServiceAddress parse(String address) {
String[] ipAndPort = address.split(":");
if (ipAndPort.length == 2) {
return new ServiceAddress(ipAndPort[0], Integer.parseInt(ipAndPort[1]));
} else if (ipAndPort.length == 1) {
return new ServiceAddress(ipAndPort[0], 80);
} else {
throw new IllegalArgumentException("address:" + address + " is illegal");
}
}
private static boolean isValidPort(int port) {
return port > 0 && port <= 65535;
}
public InetSocketAddress toInetSocketAddress() {
return new InetSocketAddress(ip, port);
}
@Override
public String toString() {
return "ServiceAddress{" + "ip='" + ip + '\'' + ", port=" + port + '}';
}
} |
/**
* Copy the configuration of a cluster {@link Group}.
*
* <b>1.</b> Updates configuration admin from Hazelcast using source config.
* <b>2.</b> Creates target configuration both on Hazelcast and configuration admin.
*
* @param sourceGroupName the source cluster group.
* @param targetGroupName the target cluster group.
*/
public void copyGroupConfiguration(String sourceGroupName, String targetGroupName) {
try {
Configuration conf = configurationAdmin.getConfiguration(Configurations.GROUP, null);
if (conf != null) {
Dictionary configAdminProperties = conf.getProperties();
if (configAdminProperties == null) {
configAdminProperties = new Properties();
}
Map<String, String> sourceGropConfig = instance.getMap(GROUPS_CONFIG);
for (Map.Entry<String, String> parentEntry : sourceGropConfig.entrySet()) {
configAdminProperties.put(parentEntry.getKey(), parentEntry.getValue());
}
Dictionary updatedProperties = new Properties();
Enumeration keyEnumeration = configAdminProperties.keys();
while (keyEnumeration.hasMoreElements()) {
String key = (String) keyEnumeration.nextElement();
String value = (String) configAdminProperties.get(key);
if (key.startsWith(sourceGroupName)) {
String newKey = key.replace(sourceGroupName, targetGroupName);
updatedProperties.put(newKey, value);
sourceGropConfig.put(key, value);
}
updatedProperties.put(key, value);
}
conf.update(updatedProperties);
}
} catch (IOException e) {
LOGGER.error("CELLAR HAZELCAST: failed to read cluster group configuration", e);
}
} |
package gocache
import (
"time"
"github.com/bradfitz/gomemcache/memcache"
)
var _ Lock = &memcacheLock{}
type memcacheLock struct {
client *memcache.Client
name string
owner string
duration time.Duration
}
// Acquire implementation of the Lock interface
func (ml *memcacheLock) Acquire() (bool, error) {
err := ml.client.Add(&memcache.Item{
Key: ml.name,
Value: []byte(ml.owner),
Expiration: int32(ml.duration.Seconds()),
})
if err == memcache.ErrNotStored {
return false, nil
}
if err != nil {
return false, err
}
return true, nil
}
// Release implementation of the Lock interface
func (ml *memcacheLock) Release() (bool, error) {
currentOwner, err := ml.GetCurrentOwner()
if err != nil {
return false, err
}
if currentOwner == ml.owner {
return true, ml.client.Delete(ml.name)
}
return false, nil
}
// ForceRelease implementation of the Lock interface
func (ml *memcacheLock) ForceRelease() error {
return ml.client.Delete(ml.name)
}
// GetCurrentOwner implementation of the Lock interface
func (ml *memcacheLock) GetCurrentOwner() (string, error) {
item, err := ml.client.Get(ml.name)
if err == memcache.ErrCacheMiss {
return "", nil
}
if err != nil {
return "", err
}
return string(item.Value), nil
}
|
<filename>sc15-graph/sched/estimator.hpp<gh_stars>1-10
/* COPYRIGHT (c) 2014 <NAME>, <NAME>, and <NAME>
* All rights reserved.
*
* \file estimator.hpp
* \brief Constant-estimator data structure
*
*/
#ifndef _PASL_DATA_ESTIMATOR_H_
#define _PASL_DATA_ESTIMATOR_H_
#include <string>
#include "perworker.hpp"
#include "callback.hpp"
/***********************************************************************/
namespace pasl {
namespace data {
namespace estimator {
/**
* @ingroup granularity
* \defgroup estimator Estimator
* @{
* An estimator is a mechanism that can be used to predict
* thread execution times, using asymptotic complexity functions provided
* by the user and runtime measures.
* @}
*/
void init();
void destroy();
/*---------------------------------------------------------------------*/
/* Complexity representation */
using complexity_type = long;
/**
* \namespace complexity
* \brief Complexity representation
*/
namespace complexity {
//! A `tiny` complexity forces sequential execution
const complexity_type tiny = (complexity_type) (-1l);
//! An `undefined` complexity indicates that the value hasn't been computed yet
const complexity_type undefined = (complexity_type) (-2l);
} // end namespace
/*---------------------------------------------------------------------*/
/* Complexity annotation */
namespace annotation {
static inline complexity_type lgn(complexity_type n) {
#ifdef __GNUC__
return sizeof(complexity_type)*8l - 1l - __builtin_clzll(n);
#else
#error "need to implement lgn for the general case"
#endif
}
static inline complexity_type lglgn(complexity_type n) {
return lgn(lgn(n));
}
static inline complexity_type mul(complexity_type n, complexity_type m) {
return n * m;
}
static inline complexity_type nlgn(complexity_type n) {
return n * lgn(n);
}
static inline complexity_type nsq(complexity_type n) {
return n * n;
}
static inline complexity_type ncub(complexity_type n) {
return n * n * n;
}
} // end namespace
/*---------------------------------------------------------------------*/
/* Cost representation */
using cost_type = double;
/**
* \namespace cost
* \brief Cost representation
*/
namespace cost {
//! an `undefined` execution time indicates that the value hasn't been computed yet
const cost_type undefined = -1.0;
//! an `unknown` execution time forces parallel execution
const cost_type unknown = -2.0;
//! a `tiny` execution time forces sequential execution, and skips time measures
const cost_type tiny = -3.0;
//! a `pessimistic` cost is 1 microsecond per unit of complexity
const cost_type pessimistic = 1.0;
bool regular(cost_type cost);
} // end namespace
/*---------------------------------------------------------------------*/
/*! \class signature
* \brief The basic interface of an estimator.
* \ingroup estimator
*/
class signature {
public:
//! Sets an initial value for the constant (optional).
virtual void set_init_constant(cost_type init_cst) = 0;
//! Tests whether an initial value for the constant was provided
virtual bool init_constant_provided() = 0;
//! Returns the string identifier of the estimator.
virtual std::string get_name() = 0;
/*! \brief Adds to the running estimate a measurement of a task execution.
* \param comp the number of operations executed by the task
* \param elapsed_ticks the number of ticks taken by the execution
*/
virtual void report(complexity_type comp, double elapsed_ticks) = 0;
//! Tests whether the estimator already has an estimate of the constant
virtual bool constant_is_known() = 0;
//! Read the local value of the constant
virtual cost_type get_constant() = 0;
/*! \brief Predicts the wall-clock time required to execute a task
* \param comp the asymptotic complexity
*/
virtual cost_type predict(complexity_type comp) = 0;
/*! \brief Predicts the number of iterations that can execute in `kappa`
* seconds. To be used only for loops with constant time body.
*/
virtual uint64_t predict_nb_iterations() = 0;
//! Outputs the value of the constant as it is at the end of the program
virtual void output() = 0;
};
/*---------------------------------------------------------------------*/
/*! \class common
* \brief Contains the code shared by our implementations of estimators
* @ingroup estimator
*/
class common : public signature {
protected:
//! Stores the name of the estimator.
std::string name;
//! Predicts the cost associated with an asymptotic complexity
cost_type predict_impl(complexity_type comp);
//! Read the local value of the constant, or pessimistic if unknown
cost_type get_constant_or_pessimistic();
//! Take into account a measure for updating the constant
virtual void analyse(cost_type measured_cst) = 0;
//! Log the update to the value of a constant
void log_update(cost_type new_cst);
void check();
public:
common(std::string name)
: name(name) {
check();
}
virtual void init();
virtual void output();
virtual void destroy();
/*! Implements `report` using function `analyse`;
* Assumes the complexity is not `tiny`.
*/
void report(complexity_type comp, double elapsed_ticks);
//! Implements `predict` using function `get_constant`
cost_type predict(complexity_type comp);
/*! Implements predict_iterations using the value of the constant
* or a pessimistic value in case it is unknown
*/
uint64_t predict_nb_iterations();
// Implements other auxiliary functions
std::string get_name();
};
/*---------------------------------------------------------------------*/
/*! \class distributed
* \brief A distributed implementation of the estimator which
* uses both a shared value and thread-local values.
*
* @ingroup estimator
*/
class distributed : public common, util::callback::client {
private:
constexpr static const double min_report_shared_factor = 2.0;
constexpr static const double max_decrease_factor = 4.0;
constexpr static const double ignored_outlier_factor = 20.0;
constexpr static const double weighted_average_factor = 8.0;
bool init_constant_provided_flg;
public: //! \todo find a better way to avoid false sharing
volatile int padding1[64*2];
cost_type shared_cst;
perworker::cell<cost_type> private_csts;
protected:
void update(cost_type new_cst);
void analyse(cost_type measured_cst);
cost_type get_constant();
void update_shared(cost_type new_cst);
public:
distributed(std::string name)
: init_constant_provided_flg(false), private_csts(cost::undefined),
common(name) {
util::callback::register_client(this);
}
void init();
void destroy();
void output();
void set_init_constant(cost_type init_cst);
bool init_constant_provided();
bool constant_is_known();
};
} // end namespace
} // end namespace
typedef data::estimator::cost_type cost_type;
typedef data::estimator::complexity_type complexity_type;
typedef data::estimator::signature estimator_t;
typedef estimator_t* estimator_p;
} // end namespace
/***********************************************************************/
#endif /*! _PASL_DATA_ESTIMATOR_H_ */ |
"Write Us into Existence": An Interview with Sokunthary Svay
Abstract:Sokunthary Svay is a Cambodian American writer and activist who grew up in the Bronx, New York. Her poetry, essays, and reviews appear in such publications as WSQ, Mekong Review, and Hyphen. Published in 2017, Apsara in New York is her first poetry collection. Svay is a founding member and board president of the Cambodian American Literary Arts Association (CALAA) and has been awarded an American Opera Projects Composers & the Voice Fellowship for 2017–2019 and the 2018 Emerging Poets Fellowship at Poets House. She is emerging as an important critic of and groundbreaking voice within Asian American cultural production. Rejecting the genre of survival memoirs, Svay creates a variety of personae across gender and generation. Her choice of language—Khmer, formal English, and urban vernacular—captures the individuality and complexity of each of these perspectives. As a performer, Svay draws on music and theater to move her poems beyond the page. Anita Baksh, Associate Professor of English at LaGuardia Community College at the City University of New York, conducted this interview with Svay in spring 2018. |
// OldHostID returns the former HostID of the computer
func (c *Computer) OldHostID() uint64 {
c.lock.RLock()
defer c.lock.RUnlock()
if c.prev == nil {
return 0
}
return c.prev.hostID
} |
<filename>include/ignition/rendering/base/BaseLightVisual.hh
/*
* Copyright (C) 2021 Open Source Robotics Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef IGNITION_RENDERING_BASE_BASELIGHTVISUAL_HH_
#define IGNITION_RENDERING_BASE_BASELIGHTVISUAL_HH_
#include <vector>
#include "ignition/rendering/base/BaseObject.hh"
#include "ignition/rendering/base/BaseRenderTypes.hh"
#include "ignition/rendering/LightVisual.hh"
#include "ignition/rendering/Scene.hh"
namespace ignition
{
namespace rendering
{
inline namespace IGNITION_RENDERING_VERSION_NAMESPACE {
//
/// \brief Base implementation of a light visual
template <class T>
class BaseLightVisual :
public virtual LightVisual,
public virtual T
{
/// \brief Constructor
protected: BaseLightVisual();
/// \brief Destructor
public: virtual ~BaseLightVisual();
// Documentation inherited.
protected: virtual void Init() override;
// Documentation inherited.
protected: virtual void PreRender() override;
// Documentation inherited
public: virtual void SetType(LightVisualType _type) override;
// Documentation inherited
public: virtual void SetInnerAngle(double _innerAngle) override;
// Documentation inherited
public: virtual double InnerAngle() override;
// Documentation inherited
public: virtual void SetOuterAngle(double _innerAngle) override;
// Documentation inherited
public: virtual double OuterAngle() override;
/// \brief Draw the light visual using dynamic renderables
public: std::vector<ignition::math::Vector3d> CreateVisualLines();
// Documentation inherited
public: virtual LightVisualType Type() override;
/// \brief Type of light visual
protected: LightVisualType type = LightVisualType::LVT_EMPTY;
/// \brief Inner angle for spot lights
protected: double innerAngle = 0;
/// \brief Outer angle for spot lights
protected: double outerAngle = 0;
/// \brief Flag to indicate light properties have changed
protected: bool dirtyLightVisual = false;
};
//////////////////////////////////////////////////
template <class T>
BaseLightVisual<T>::BaseLightVisual()
{
}
//////////////////////////////////////////////////
template <class T>
BaseLightVisual<T>::~BaseLightVisual()
{
}
/////////////////////////////////////////////////
template <class T>
void BaseLightVisual<T>::PreRender()
{
T::PreRender();
}
//////////////////////////////////////////////////
template <class T>
void BaseLightVisual<T>::Init()
{
T::Init();
}
//////////////////////////////////////////////////
template <class T>
void BaseLightVisual<T>::SetType(LightVisualType _type)
{
this->type = _type;
this->dirtyLightVisual = true;
}
//////////////////////////////////////////////////
template <class T>
LightVisualType BaseLightVisual<T>::Type()
{
return this->type;
}
//////////////////////////////////////////////////
template <class T>
void BaseLightVisual<T>::SetInnerAngle(double _innerAngle)
{
this->innerAngle = _innerAngle;
this->dirtyLightVisual = true;
}
//////////////////////////////////////////////////
template <class T>
double BaseLightVisual<T>::InnerAngle()
{
return this->innerAngle;
}
//////////////////////////////////////////////////
template <class T>
void BaseLightVisual<T>::SetOuterAngle(double _outerAngle)
{
this->outerAngle = _outerAngle;
this->dirtyLightVisual = true;
}
//////////////////////////////////////////////////
template <class T>
double BaseLightVisual<T>::OuterAngle()
{
return this->outerAngle;
}
template <class T>
std::vector<ignition::math::Vector3d>
BaseLightVisual<T>::CreateVisualLines()
{
std::vector<ignition::math::Vector3d> positions;
if (this->type == LightVisualType::LVT_DIRECTIONAL)
{
float s = 0.5;
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, -s));
}
else if (this->type == LightVisualType::LVT_POINT)
{
float s = 0.1f;
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, s));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, s));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, s));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, s));
positions.emplace_back(ignition::math::Vector3d(-s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, -s));
positions.emplace_back(ignition::math::Vector3d(-s, s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, -s));
positions.emplace_back(ignition::math::Vector3d(s, s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, -s));
positions.emplace_back(ignition::math::Vector3d(s, -s, 0));
positions.emplace_back(ignition::math::Vector3d(0, 0, -s));
}
else if (this->type == LightVisualType::LVT_SPOT)
{
double angles[2];
double range = 0.2;
angles[0] = range * tan(outerAngle / 2.0);
angles[1] = range * tan(innerAngle / 2.0);
unsigned int i = 0;
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(
ignition::math::Vector3d(angles[i], angles[i], -range));
for (i = 0; i < 2; i++)
{
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(ignition::math::Vector3d(
angles[i], angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(ignition::math::Vector3d(
angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(0, 0, 0));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
angles[i], angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
-angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
angles[i], -angles[i], -range));
positions.emplace_back(ignition::math::Vector3d(
angles[i], angles[i], -range));
}
}
return positions;
}
}
}
}
#endif
|
package com.github.donmahallem.heartfit.activity;
import android.os.Bundle;
import android.view.View;
import com.github.donmahallem.heartfit.R;
import com.google.android.gms.auth.api.signin.GoogleSignIn;
import com.google.android.gms.fitness.Fitness;
import com.google.android.gms.fitness.FitnessActivities;
import com.google.android.gms.fitness.HistoryClient;
import com.google.android.gms.fitness.data.DataPoint;
import com.google.android.gms.fitness.data.DataSet;
import com.google.android.gms.fitness.data.DataSource;
import com.google.android.gms.fitness.data.DataType;
import com.google.android.gms.fitness.data.Field;
import com.google.android.gms.fitness.data.Session;
import com.google.android.gms.fitness.data.WorkoutExercises;
import com.google.android.gms.fitness.request.SessionInsertRequest;
import com.google.android.gms.tasks.OnFailureListener;
import com.google.android.gms.tasks.OnSuccessListener;
import org.threeten.bp.Clock;
import org.threeten.bp.LocalDateTime;
import org.threeten.bp.ZoneOffset;
import org.threeten.bp.ZonedDateTime;
import java.util.concurrent.TimeUnit;
import androidx.appcompat.app.AppCompatActivity;
import timber.log.Timber;
public class CreateSessionActivity extends AppCompatActivity implements View.OnClickListener {
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_add_exercise);
this.findViewById(R.id.btnInsertActivity).setOnClickListener(this);
this.findViewById(R.id.btnGetActivity).setOnClickListener(this);
}
public void addData2() {
DataSource activitySegmentDataSource = new DataSource.Builder()
.setAppPackageName(this.getPackageName())
.setDataType(DataType.TYPE_ACTIVITY_SEGMENT)
.setName( "-activity segments")
.setType(DataSource.TYPE_RAW)
.build();
/*
DataSet activitySegments = DataSet.create(activitySegmentDataSource);
DataPoint firstRunningDp = activitySegments.createDataPoint()
.setTimeInterval(startTime, startWalkTime, TimeUnit.MILLISECONDS);
firstRunningDp.getValue(Field.FIELD_ACTIVITY).setActivity(FitnessActivities.RUNNING);
activitySegments.add(firstRunningDp);
DataPoint walkingDp = activitySegments.createDataPoint()
.setTimeInterval(startWalkTime, endWalkTime, TimeUnit.MILLISECONDS);
walkingDp.getValue(Field.FIELD_ACTIVITY).setActivity(FitnessActivities.WALKING);
activitySegments.add(walkingDp);
DataPoint secondRunningDp = activitySegments.createDataPoint()
.setTimeInterval(endWalkTime, endTime, TimeUnit.MILLISECONDS);
secondRunningDp.getValue(Field.FIELD_ACTIVITY).setActivity(FitnessActivities.RUNNING);
activitySegments.add(secondRunningDp);*/
final LocalDateTime endTime = LocalDateTime.now(Clock.systemUTC());
final LocalDateTime startTime = endTime.minusMinutes(5);
// Create a session with metadata about the activity.
Session session = new Session.Builder()
.setName("Streng thtraining")
.setDescription("Long run around Shoreline Park")
.setIdentifier(FitnessActivities.STRENGTH_TRAINING + "_" + System.currentTimeMillis())
.setActivity(FitnessActivities.STRENGTH_TRAINING)
.setStartTime(startTime.toEpochSecond(ZoneOffset.UTC), TimeUnit.SECONDS)
.setEndTime(endTime.toEpochSecond(ZoneOffset.UTC), TimeUnit.SECONDS)
.build();
// Build a session insert request
SessionInsertRequest insertRequest = new SessionInsertRequest.Builder()
.setSession(session)
.addDataSet(addData(startTime,endTime))
.build();
Fitness.getSessionsClient(this,GoogleSignIn.getLastSignedInAccount(this))
.insertSession(insertRequest)
.addOnSuccessListener(new OnSuccessListener<Void>() {
@Override
public void onSuccess(Void aVoid) {
Timber.d("SUCES");
}
})
.addOnFailureListener(new OnFailureListener() {
@Override
public void onFailure(Exception e) {
Timber.e(e);
}
});
}
public DataSet addData(LocalDateTime start,LocalDateTime end) {
DataSource dataSource = new DataSource.Builder()
.setAppPackageName(this)
.setDataType(DataType.TYPE_WORKOUT_EXERCISE)
.setName(getResources().getString(R.string.app_name))
.setType(DataSource.TYPE_RAW)
.build();
// // Create a data set
DataSet dataSet = DataSet.create(dataSource);
dataSet.add(createDataPoint(dataSet,start));
dataSet.add(createDataPoint(dataSet,end));
return dataSet;
}
public DataPoint createDataPoint(DataSet dataset,LocalDateTime date){
DataPoint curls = dataset.createDataPoint();
//curls.getValue(Field.FIELD_ACTIVITY).setString(FitnessActivities.STRENGTH_TRAINING);
curls.setTimestamp(date.toEpochSecond(ZoneOffset.UTC), TimeUnit.SECONDS);
curls.getValue(Field.FIELD_EXERCISE).setString(WorkoutExercises.BICEP_CURL);
curls.getValue(Field.FIELD_DURATION).setInt(30000);
curls.getValue(Field.FIELD_REPETITIONS).setInt(10);
curls.getValue(Field.FIELD_RESISTANCE_TYPE).setInt(Field.RESISTANCE_TYPE_DUMBBELL);
curls.getValue(Field.FIELD_RESISTANCE).setFloat((float)Math.random()*10f+10f);
return curls;
}
public void createDataPoint(DataSet dataset,ZonedDateTime date,String workoutExercises,int repitition,int resistanceType,float resistance){
DataPoint curls = dataset.createDataPoint();
//curls.getValue(Field.FIELD_ACTIVITY).setString(FitnessActivities.STRENGTH_TRAINING);
curls.setTimestamp(date.toEpochSecond(), TimeUnit.SECONDS);
curls.getValue(Field.FIELD_EXERCISE).setString(workoutExercises);
curls.getValue(Field.FIELD_DURATION).setInt(30000);
curls.getValue(Field.FIELD_REPETITIONS).setInt(repitition);
curls.getValue(Field.FIELD_RESISTANCE_TYPE).setInt(resistanceType);
curls.getValue(Field.FIELD_RESISTANCE).setFloat(resistance);
dataset.add(curls);
}
public ZonedDateTime convertTime(int hour, int minute){
return ZonedDateTime.now().withHour(hour).withMinute(minute);
}
public void addData3() {
DataSource dataSource = new DataSource.Builder()
.setAppPackageName(this)
.setDataType(DataType.TYPE_WORKOUT_EXERCISE)
.setName(getResources().getString(R.string.app_name))
.setType(DataSource.TYPE_RAW)
.build();
DataSet dataSet=DataSet.create(dataSource);
}
@Override
public void onClick(View view) {
switch (view.getId()) {
case R.id.btnInsertActivity:
this.addData3();
break;
case R.id.btnGetActivity:
break;
}
}
}
|
def norm_train_data(self, datas, labels):
self.mean_data = np.mean(datas, axis=0)
self.mean_label = np.mean(labels, axis=0)
self.std_data = np.std(datas, axis=0)
self.std_label = np.std(labels, axis=0)
datas = (datas - self.mean_data) / self.std_data
labels = (labels - self.mean_label) / self.std_label
return datas, labels |
/**
* locate org.apache.storm.benchmark.multicast.bolt
* Created by MasterTj on 2019/10/20.
*/
public class MulticastForwardBolt extends BaseRichBolt {
private OutputCollector collector;
@Override
public void prepare(Map<String, Object> topoConf, TopologyContext context, OutputCollector collector) {
this.collector=collector;
}
@Override
public void execute(Tuple input) {
String topic=input.getStringByField("topic");
Integer partition=input.getIntegerByField("partition");
Long offset=input.getLongByField("offset");
String key=input.getStringByField("key");
String value=input.getStringByField("value");
collector.emit(FORWARD_STREAM_ID,new Values(topic,partition,offset,key,value,System.currentTimeMillis()));
}
@Override
public void declareOutputFields(OutputFieldsDeclarer declarer) {
declarer.declareStream(FORWARD_STREAM_ID,new Fields("topic","partition","offset","key","value", START_TIME_MILLS));
}
} |
<reponame>Ginden/entertainment-website<filename>services/main/src/infrastructure/api/images/read.ts
import { notImplemented } from '@hapi/boom';
import { Lifecycle, RouteOptionsValidate, ServerRoute } from '@hapi/hapi';
import { object, Schema, string } from 'joi';
import {
imageSizeValidation,
imageUploaderValidation,
} from '../../../utils/validation';
const imageDetailsHandler: Lifecycle.Method = (request, h) => {
throw notImplemented();
};
const imageDetailsRequestValidator: RouteOptionsValidate = {
params: object({
id: string().uuid().required(),
}),
};
const imageDetailsResponseValidator: Schema = object({
id: string().uuid().required(),
url: string().uri().example('http://example.com/image.jpg').required(),
contentType: string().example('image/jpeg').required(),
size: imageSizeValidation.required(),
contentDescription: string().optional().allow(null),
ocr: string().allow('').default(''),
author: imageUploaderValidation.allow(null).default(null),
}).label('ImageDetailsResponse');
export const singleImageRoute: ServerRoute = {
method: 'GET',
handler: imageDetailsHandler,
path: `/image/{id}`,
options: {
validate: imageDetailsRequestValidator,
response: {
schema: imageDetailsResponseValidator,
},
tags: ['api'],
},
};
|
/**
* This method performs the given request and returns the servers response.
*
* @param request
* The request to perform
* @throws ConfluenceRequestException
* If the server responses with an error status code
*/
Object performRequest(ConfluenceRequest request) throws ConfluenceRequestException {
WebTarget endpointTarget = wikiTarget.path(request.getRelativePath());
for (Entry<String, String> queryParam : request.getQueryParams().entrySet()) {
endpointTarget = endpointTarget.queryParam(queryParam.getKey(), queryParam.getValue());
}
Invocation.Builder invocationBuilder = endpointTarget.request();
Map<String, String> headers = getRequestHeaders(request);
for (Entry<String, String> headerEntry : headers.entrySet()) {
invocationBuilder.header(headerEntry.getKey(), headerEntry.getValue());
}
String methodName = request.getMethod();
Response response;
if (request.getBodyEntity() != null) {
Object bodyEntity = request.getBodyEntity();
response = invocationBuilder.method(methodName, Entity.json(bodyEntity));
} else {
response = invocationBuilder.method(methodName);
}
int statusCode = response.getStatus();
if (response.getStatus() >= 300) {
String errorMsg;
if (MediaType.APPLICATION_JSON_TYPE.equals(response.getMediaType())) {
ErrorResponse errResponse = response.readEntity(ErrorResponse.class);
errorMsg = errResponse.getMessage();
} else {
errorMsg = response.getStatusInfo().getReasonPhrase();
}
throw new ConfluenceRequestException(statusCode, errorMsg);
}
return response.readEntity(request.getReturnType());
} |
/** Data setter class for artists element. */
private class ArtistsSetter implements DataSetter {
/** data target. */
private ReleaseTypeHandler pHandler = null;
/**
* Constructor.
* @param pHandler parent that needs to be updated
*/
public ArtistsSetter(ReleaseTypeHandler pHandler) {
this.pHandler = pHandler;
}
/** {@inheritDoc} */
public void set(ComplexDataType data) {
pHandler.getData().setArtists((ArtistsType) data);
}
} |
<gh_stars>0
package com.example.p1;
import android.os.Bundle;
import androidx.appcompat.app.AppCompatActivity;
import androidx.fragment.app.Fragment;
import androidx.fragment.app.FragmentManager;
import androidx.fragment.app.FragmentTransaction;
import androidx.lifecycle.ViewModelProviders;
import com.example.p1.fragments.DateFragment;
import com.example.p1.fragments.ExpenseSpinnerFragment;
import com.example.p1.fragments.TitelSumDataFragment;
public class SetScan extends AppCompatActivity {
private TitelSumDataFragment titelSumDataFragment;
private ExpenseSpinnerFragment expenseSpinnerFragment;
private EconomyViewModel economyViewModel;
private DateFragment dateFragment;
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_set_note);
titelSumDataFragment = new TitelSumDataFragment();
titelSumDataFragment.setSetScan(this);
setTitelSumDataFragmen(titelSumDataFragment, false);
expenseSpinnerFragment = new ExpenseSpinnerFragment();
setiIcomeExpenseSpinnerFragment(expenseSpinnerFragment, false);
economyViewModel = ViewModelProviders.of(this).get(EconomyViewModel.class);
getSupportActionBar().setHomeAsUpIndicator(R.drawable.ic_close);
}
public void setiIcomeExpenseSpinnerFragment (Fragment fragment, boolean backstack) {
FragmentManager fragmentManager = getSupportFragmentManager();
FragmentTransaction fragmentTransaction = fragmentManager.beginTransaction();
fragmentTransaction.replace(R.id.upper_container,(Fragment)fragment);
fragmentTransaction.commit();
}
public void setTitelSumDataFragmen (Fragment fragment, boolean backstack) {
FragmentManager fragmentManager = getSupportFragmentManager();
FragmentTransaction fragmentTransaction = fragmentManager.beginTransaction();
fragmentTransaction.replace(R.id.lower_container,(Fragment)fragment);
fragmentTransaction.commit();
}
public void showDatePicker(){
dateFragment = new DateFragment();
dateFragment.show(getSupportFragmentManager(), "datepicker");
}
public void processDatePickerResult(int year, int month, int day){
String month_string = Integer.toString(month+1);
String day_string = Integer.toString(day);
String year_string = Integer.toString(year);
}
}
|
def copy_id_set(production_bucket: Bucket, build_bucket: Bucket, storage_base_path: str, build_bucket_base_path: str):
build_id_set_path = os.path.join(os.path.dirname(build_bucket_base_path), 'id_set.json')
build_id_set_blob = build_bucket.blob(build_id_set_path)
if not build_id_set_blob.exists():
logging.error(f"id_set.json file does not exists in build bucket in path: {build_id_set_path}")
sys.exit(1)
prod_id_set_path = os.path.join(os.path.dirname(storage_base_path), 'id_set.json')
try:
copied_blob = build_bucket.copy_blob(
blob=build_id_set_blob, destination_bucket=production_bucket, new_name=prod_id_set_path
)
if not copied_blob.exists():
logging.error(f"Failed to upload id_set.json to {prod_id_set_path}")
sys.exit(1)
else:
logging.success("Finished uploading id_set.json to storage.")
except Exception as e:
logging.exception(f"Failed copying ID Set. Additional Info: {str(e)}")
sys.exit(1) |
The STOCK Act, which stands for Stop Trading On Congressional Knowledge, was passed Thursday night by the Senate in a 96 to 3 vote. Its fate in the House, however, is uncertain.
House members, including Majority Leader Eric Cantor, R-Va., have criticized the bill for being too weak. Some of those concerns may have been addressed by amendments added to the legislation, including one that would apply the insider trading ban to the executive branch.
Under current law, it is not clear whether trading on information lawmakers learn in the course of their congressional work is banned.
Many legal scholars believe it is not. No member of Congress has ever been charged with trading on nonpublic congressional information.
Last year, a study of Congressional trading found that House members consistently outperform the market, suggesting that they are using their positions to gain an informational advantage. An earlier study found similar results by looking at trading by Senators.
Although a version of the STOCK Act has come up for consideration in past years, it has never been put up for a vote. This year, it has a better chance of passing, in part because of increased public awareness of the issue resulting from reporting by CNBC's Eamon Javers and CBS's 60 Minutes.
Both President Barack Obama and Cantor have said they are "pleased" with the vote, although Cantor said he is still reviewing the legislation.
Questions? Comments? Email us [email protected]
Follow John on Twitter @ twitter.com/Carney
Follow NetNet on Twitter @ twitter.com/CNBCnetnet
Facebook us @ www.facebook.com/NetNetCNBC |
/**
* BlockOf Peace dataOtherPieceCopied from the
* @param p Copy source
*/
public void copy(Piece p) {
id = p.id;
direction = p.direction;
big = p.big;
offsetApplied = p.offsetApplied;
connectBlocks = p.connectBlocks;
int maxBlock = p.getMaxBlock();
dataX = new int[DIRECTION_COUNT][maxBlock];
dataY = new int[DIRECTION_COUNT][maxBlock];
block = new Block[maxBlock];
for(int i = 0; i < maxBlock; i++) block[i] = new Block(p.block[i]);
dataOffsetX = new int[DIRECTION_COUNT];
dataOffsetY = new int[DIRECTION_COUNT];
for(int i = 0; i < DIRECTION_COUNT; i++) {
for(int j = 0; j < maxBlock; j++) {
dataX[i][j] = p.dataX[i][j];
dataY[i][j] = p.dataY[i][j];
}
dataOffsetX[i] = p.dataOffsetX[i];
dataOffsetY[i] = p.dataOffsetY[i];
}
} |
<reponame>PoorlyDefinedBehaviour/JavaScript-Array-Methods-in-C-
#include <iostream>
#include <vector>
/**
* Returns a new array with the elements tha passed a certain test
* Works for std::vector
* @param (array, function)
* @return std::vector
* */
template <typename T, typename lambda>
std::vector<T> filter(const std::vector<T> &array, const lambda &func)
{
std::vector<T> newArray;
for (const auto &element : array)
{
if (func(element))
{
newArray.push_back(element);
}
}
return newArray;
}
int main()
{
std::vector<int> array = {1, 2, 3, 4, 5};
std::vector<int> evenNumbers = filter(array, [](const auto &element) {
return element % 2 == 0;
});
for (const auto &element : evenNumbers)
{
std::cout << element << std::endl;
}
} |
<reponame>adesombergh/ModsBeCode<filename>src/app/shop/shop.module.ts
import { NgModule } from '@angular/core';
import { StoreModule } from '@ngrx/store';
import { EffectsModule } from '@ngrx/effects';
import { SharedModule } from '@app/shared';
import { ShopRoutingModule } from './shop-routing.module';
import { ShopComponent } from './shop/shop.component';
import { AuthenticatedComponent } from './authenticated/authenticated.component';
import { ProjectsComponent } from './projects/projects.component';
import { PreordersComponent } from './preorders/preorders.component';
import { OrdersComponent } from './orders/orders.component';
import { OrderedComponent } from './ordered/ordered.component';
@NgModule({
imports: [
SharedModule,
ShopRoutingModule
],
declarations: [
ShopComponent,
AuthenticatedComponent,
ProjectsComponent,
PreordersComponent,
OrdersComponent,
OrderedComponent
],
providers: []
})
export class ShopModule {
constructor() {}
}
|
<reponame>blueswhisper/athena
package me.ele.jarch.athena.sharding;
import me.ele.jarch.athena.constant.EventTypes;
import me.ele.jarch.athena.pg.proto.CommandComplete;
import me.ele.jarch.athena.pg.proto.DataRow;
import me.ele.jarch.athena.pg.proto.ReadyForQuery;
import me.ele.jarch.athena.util.AggregateFunc;
import me.ele.jarch.athena.util.common.ReadOnlyBoolean;
import me.ele.jarch.athena.util.etrace.TraceEnhancer;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.math.BigDecimal;
import java.nio.charset.StandardCharsets;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
/**
* Created by jinghao.wang on 17/7/19.
*/
public class PGShardingResultSet extends ShardingResultSet {
private static final Logger LOG = LoggerFactory.getLogger(PGShardingResultSet.class);
private final ReadOnlyBoolean rowDescriptionSent = new ReadOnlyBoolean(false);
private int sentRows;
public PGShardingResultSet(List<AggregateFunc> columnAggeTypes, boolean isGroupBy) {
super(columnAggeTypes, isGroupBy);
}
@Override public List<byte[]> toPartPackets(boolean withEOF) {
List<byte[]> packets = new ArrayList<>();
// 只有没有发送过RowDescription包,且收到过RowDescription包才构造RowDescription包
// TODO 如果ReadOnlyBoolean使用场景太少,考虑删除此类
if (columns.size() > 0 && rowDescriptionSent.compareAndSet(false, true)) {
packets.add(columns.get(0));
}
packets.addAll(rows);
sentRows += rows.size();
if (withEOF) {
packets.add(rewriteTag(sentRows).toPacket());
commandCompletes.clear();
validateReadyForQueryStatus();
packets.add(readyForQuerys.get(0));
readyForQuerys.clear();
}
columns.clear();
rows.clear();
return packets;
}
private CommandComplete rewriteTag(int sentRows) {
assert commandCompletes.size() > 1;
CommandComplete commandComplete = CommandComplete.loadFromPacket(commandCompletes.get(0));
String tagSample = commandComplete.getTag();
String tagPrefix = tagSample.split(" ")[0];
commandComplete.setTag(String.format("%s %d", tagPrefix, sentRows));
return commandComplete;
}
private void validateReadyForQueryStatus() {
Set<Byte> statuses = new HashSet<>();
for (byte[] readyForQuery : readyForQuerys) {
ReadyForQuery rfq = ReadyForQuery.loadFromPacket(readyForQuery);
statuses.add(rfq.getStatus());
}
if (statuses.size() != 1) {
throw new RuntimeException(String.format(
"inconsistent readyForQuery Status %s when validate PostgreSQL shard response",
statuses));
}
}
@Override protected void aggregateRows(List<byte[]> newRows) {
// only support no group aggregation
if (rows.size() != 1) {
// TODO 此语句块永远不会进入,暂时标记，以后择机删除
LOG.error("Only support for no group aggregation");
rows.addAll(newRows);
return;
}
List<byte[]> rowList = new ArrayList<>();
rowList.add(rows.get(0));
rowList.addAll(newRows);
AggregateObject[] columns = new AggregateObject[columnAggeTypes.size()];
int rowSize = rowList.size();
for (int j = 0; j < rowSize; j++) {
byte[] rowBytes = rowList.get(j);
DataRow row = DataRow.loadFromPacket(rowBytes);
for (int i = 0; i < columnAggeTypes.size(); i++) {
try {
switch (columnAggeTypes.get(i)) {
case COUNT:
case SUM:
case MAX:
case MIN:
// 聚合函数的个数(包含NONE)必然==返回列的个数,此处无需担心数组越界问题
DataRow.PGCol col = row.getCols()[i];
// data为null,意味着结果为NULL.
// 在聚合函数的场景中不会出现,所以`col.getData()`永远不会为null
String strVal = new String(col.getData(), StandardCharsets.UTF_8);
AggregateObject colValue =
new AggregateObject(strVal, new BigDecimal(strVal));
if (columns[i] == null) {
columns[i] = colValue;
break;
}
columns[i] = columnAggeTypes.get(i).aggregate(columns[i], colValue);
break;
case NONE:
default:
break;
}
} catch (NumberFormatException e) {
LOG.warn("Error convert to Number.Row=" + row, e);
TraceEnhancer.newFluentEvent(EventTypes.ILLEGAL_AGGREGATE_COLUMN, "illegal")
.data("row: " + row).status("illegal").complete();
} catch (Exception e) {
LOG.debug("Error null for Row.data.Row=" + row, e);
TraceEnhancer.newFluentEvent(EventTypes.ILLEGAL_AGGREGATE_COLUMN, "error")
.data("row: " + row).status("unknown_error").complete();
}
}
}
DataRow rowFirst = DataRow.loadFromPacket(rowList.get(0));
DataRow.PGCol[] pgCols = new DataRow.PGCol[rowFirst.getColCount()];
for (int i = 0; i < columnAggeTypes.size(); i++) {
switch (columnAggeTypes.get(i)) {
case COUNT:
case SUM:
case MAX:
case MIN:
pgCols[i] =
new DataRow.PGCol(columns[i].getStrVal().getBytes(StandardCharsets.UTF_8));
break;
case NONE:
default:
pgCols[i] = rowFirst.getCols()[i];
break;
}
}
rows.clear();
rows.add(new DataRow(pgCols).toPacket());
}
}
|
package org.openrewrite.maven;
import com.soebes.itf.jupiter.extension.*;
import com.soebes.itf.jupiter.maven.MavenExecutionResult;
import static com.soebes.itf.extension.assertj.MavenITAssertions.assertThat;
@MavenJupiterExtension
@MavenOption(MavenCLIOptions.NO_TRANSFER_PROGRESS)
@SuppressWarnings("NewClassNamingConvention")
public class BasicIT {
@MavenTest
void groupid_artifactid_should_be_ok(MavenExecutionResult result) {
assertThat(result)
.isSuccessful()
.out()
.warn()
.containsOnly("JAR will be empty - no content was marked for inclusion!");
}
@MavenTest
@MavenOption(value = MavenCLIOptions.SETTINGS, parameter = "settings.xml")
@MavenGoal("${project.groupId}:${project.artifactId}:${project.version}:dryRun")
void null_check_profile_activation(MavenExecutionResult result) {
assertThat(result)
.isSuccessful()
.out()
.info()
.anySatisfy(line -> assertThat(line).contains("Applying recipes would make no changes. No patch file generated."));
assertThat(result)
.isSuccessful()
.out()
.warn()
.isEmpty();
}
@MavenTest
@SystemProperty(value = "ossrh_snapshots_url", content = "https://oss.sonatype.org/content/repositories/snapshots")
@MavenGoal("${project.groupId}:${project.artifactId}:${project.version}:dryRun")
void resolves_maven_properties_from_user_provided_system_properties(MavenExecutionResult result) {
assertThat(result)
.isSuccessful()
.out()
.warn()
.allSatisfy(line -> assertThat(line).doesNotContain("Invalid repository URL ${ossrh_snapshots_url}"))
.allSatisfy(line -> assertThat(line).doesNotContain("Unable to resolve property ${ossrh_snapshots_url}"));
}
@MavenTest
@MavenOption(value = MavenCLIOptions.SETTINGS, parameter = "settings-user.xml")
@MavenProfile("example_profile_id")
@SystemProperty(value = "REPOSITORY_URL", content = "https://maven-eu.nuxeo.org/nexus/content/repositories/public/")
@MavenGoal("${project.groupId}:${project.artifactId}:${project.version}:dryRun")
void resolves_settings(MavenExecutionResult result) {
assertThat(result)
.isSuccessful()
.out()
.plain()
.allSatisfy(line -> assertThat(line).doesNotContain("Illegal character in path at index 1"));
}
@MavenTest
@MavenOption(value = MavenCLIOptions.SETTINGS, parameter = "settings-user.xml")
@MavenProfile("example_profile_id")
@MavenGoal("${project.groupId}:${project.artifactId}:${project.version}:dryRun")
void tolerates_incomplete_urls_in_settings(MavenExecutionResult result) {
// Note how we left off this annotation for this test:
// "@SystemProperty(value = "REPOSITORY_URL", content = "https://maven-eu.nuxeo.org/nexus/content/repositories/public/")"
// which leaves the <url>${REPOSITORY_URL}</url> unresolved in the settings.xml.
// This tests validates how we handle this situation.
assertThat(result)
.isSuccessful()
.out()
.plain()
.allSatisfy(line -> assertThat(line).doesNotContain("Illegal character in path at index 1"));
assertThat(result)
.out()
.warn()
.hasSize(1)
.anySatisfy(line -> assertThat(line).contains("Unable to parse URL ${REPOSITORY_URL} for Maven settings repository id example_repository_id"));
}
}
|
<filename>pkg/fab/peer/peer.go
/*
Copyright SecureKey Technologies Inc. All Rights Reserved.
SPDX-License-Identifier: Apache-2.0
*/
package peer
import (
reqContext "context"
"crypto/x509"
"github.com/spf13/cast"
"google.golang.org/grpc"
"google.golang.org/grpc/keepalive"
"github.com/akorosmezey/fabric-sdk-go/pkg/client/common/verifier"
"github.com/akorosmezey/fabric-sdk-go/pkg/common/logging"
"github.com/akorosmezey/fabric-sdk-go/pkg/common/providers/fab"
)
var logger = logging.NewLogger("fabsdk/fab")
// Peer represents a node in the target blockchain network to which
// HFC sends endorsement proposals, transaction ordering or query requests.
type Peer struct {
config fab.EndpointConfig
certificate *x509.Certificate
serverName string
processor fab.ProposalProcessor
mspID string
url string
kap keepalive.ClientParameters
failFast bool
inSecure bool
commManager fab.CommManager
}
// Option describes a functional parameter for the New constructor
type Option func(*Peer) error
// New Returns a new Peer instance
func New(config fab.EndpointConfig, opts ...Option) (*Peer, error) {
peer := &Peer{
config: config,
commManager: &defCommManager{},
}
for _, opt := range opts {
err := opt(peer)
if err != nil {
return nil, err
}
}
if peer.processor == nil {
// TODO: config is declaring TLS but cert & serverHostOverride is being passed-in...
endorseRequest := peerEndorserRequest{
target: peer.url,
certificate: peer.certificate,
serverHostOverride: peer.serverName,
config: peer.config,
kap: peer.kap,
failFast: peer.failFast,
allowInsecure: peer.inSecure,
commManager: peer.commManager,
}
processor, err := newPeerEndorser(&endorseRequest)
if err != nil {
return nil, err
}
peer.processor = processor
}
return peer, nil
}
// WithURL is a functional option for the peer.New constructor that configures the peer's URL
func WithURL(url string) Option {
return func(p *Peer) error {
p.url = url
return nil
}
}
// WithTLSCert is a functional option for the peer.New constructor that configures the peer's TLS certificate
func WithTLSCert(certificate *x509.Certificate) Option {
return func(p *Peer) error {
p.certificate = certificate
return nil
}
}
// WithServerName is a functional option for the peer.New constructor that configures the peer's server name
func WithServerName(serverName string) Option {
return func(p *Peer) error {
p.serverName = serverName
return nil
}
}
// WithInsecure is a functional option for the peer.New constructor that configures the peer's grpc insecure option
func WithInsecure() Option {
return func(p *Peer) error {
p.inSecure = true
return nil
}
}
// WithMSPID is a functional option for the peer.New constructor that configures the peer's msp ID
func WithMSPID(mspID string) Option {
return func(p *Peer) error {
p.mspID = mspID
return nil
}
}
// FromPeerConfig is a functional option for the peer.New constructor that configures a new peer
// from a apiconfig.NetworkPeer struct
func FromPeerConfig(peerCfg *fab.NetworkPeer) Option {
return func(p *Peer) error {
p.url = peerCfg.URL
p.serverName = getServerNameOverride(peerCfg)
p.inSecure = isInsecureConnectionAllowed(peerCfg)
var err error
p.certificate = peerCfg.TLSCACert
if peerCfg.GRPCOptions["allow-insecure"] == false {
//verify if certificate was expired or not yet valid
err = verifier.ValidateCertificateDates(p.certificate)
if err != nil {
logger.Warn(err)
}
}
// TODO: Remove upon making peer interface immutable
p.mspID = peerCfg.MSPID
p.kap = getKeepAliveOptions(peerCfg)
p.failFast = getFailFast(peerCfg)
return nil
}
}
func getServerNameOverride(peerCfg *fab.NetworkPeer) string {
serverHostOverride := ""
if str, ok := peerCfg.GRPCOptions["ssl-target-name-override"].(string); ok {
serverHostOverride = str
}
return serverHostOverride
}
func getFailFast(peerCfg *fab.NetworkPeer) bool {
var failFast = true
if ff, ok := peerCfg.GRPCOptions["fail-fast"].(bool); ok {
failFast = cast.ToBool(ff)
}
return failFast
}
func getKeepAliveOptions(peerCfg *fab.NetworkPeer) keepalive.ClientParameters {
var kap keepalive.ClientParameters
if kaTime, ok := peerCfg.GRPCOptions["keep-alive-time"]; ok {
kap.Time = cast.ToDuration(kaTime)
}
if kaTimeout, ok := peerCfg.GRPCOptions["keep-alive-timeout"]; ok {
kap.Timeout = cast.ToDuration(kaTimeout)
}
if kaPermit, ok := peerCfg.GRPCOptions["keep-alive-permit"]; ok {
kap.PermitWithoutStream = cast.ToBool(kaPermit)
}
return kap
}
func isInsecureConnectionAllowed(peerCfg *fab.NetworkPeer) bool {
allowInsecure, ok := peerCfg.GRPCOptions["allow-insecure"].(bool)
if ok {
return allowInsecure
}
return false
}
// WithPeerProcessor is a functional option for the peer.New constructor that configures the peer's proposal processor
func WithPeerProcessor(processor fab.ProposalProcessor) Option {
return func(p *Peer) error {
p.processor = processor
return nil
}
}
// MSPID gets the Peer mspID.
func (p *Peer) MSPID() string {
return p.mspID
}
// URL gets the Peer URL. Required property for the instance objects.
// It returns the address of the Peer.
func (p *Peer) URL() string {
return p.url
}
// ProcessTransactionProposal sends the created proposal to peer for endorsement.
func (p *Peer) ProcessTransactionProposal(ctx reqContext.Context, proposal fab.ProcessProposalRequest) (*fab.TransactionProposalResponse, error) {
return p.processor.ProcessTransactionProposal(ctx, proposal)
}
func (p *Peer) String() string {
return p.url
}
// PeersToTxnProcessors converts a slice of Peers to a slice of TxnProposalProcessors
func PeersToTxnProcessors(peers []fab.Peer) []fab.ProposalProcessor {
tpp := make([]fab.ProposalProcessor, len(peers))
for i := range peers {
tpp[i] = peers[i]
}
return tpp
}
type defCommManager struct{}
func (*defCommManager) DialContext(ctx reqContext.Context, target string, opts ...grpc.DialOption) (conn *grpc.ClientConn, err error) {
logger.Debugf("DialContext [%s]", target)
opts = append(opts, grpc.WithBlock())
return grpc.DialContext(ctx, target, opts...)
}
func (*defCommManager) ReleaseConn(conn *grpc.ClientConn) {
logger.Debugf("ReleaseConn [%p]", conn)
if err := conn.Close(); err != nil {
logger.Debugf("unable to close connection [%s]", err)
}
}
|
/**
* Schedule(Invocation)
*
* Schedule implements a particular policy for scheduling the threads coming in.
* There is always the spec required "serialization" but we can add custom scheduling in here
*
* Synchronizing on lock: a failure to get scheduled must result in a wait() call and a
* release of the lock. Schedulation must return with lock.
*
*/
public void schedule(Invocation mi)
throws Exception
{
return;
} |
<filename>src/apps/DEL_DOT_VEC_2D.cpp
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~//
// Copyright (c) 2017-19, Lawrence Livermore National Security, LLC
// and RAJA Performance Suite project contributors.
// See the RAJAPerf/COPYRIGHT file for details.
//
// SPDX-License-Identifier: (BSD-3-Clause)
//~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~//
#include "DEL_DOT_VEC_2D.hpp"
#include "RAJA/RAJA.hpp"
#include "AppsData.hpp"
#include "common/DataUtils.hpp"
#include <iostream>
namespace rajaperf
{
namespace apps
{
#define DEL_DOT_VEC_2D_DATA_SETUP_CPU \
ResReal_ptr x = m_x; \
ResReal_ptr y = m_y; \
ResReal_ptr xdot = m_xdot; \
ResReal_ptr ydot = m_ydot; \
ResReal_ptr div = m_div; \
\
const Real_type ptiny = m_ptiny; \
const Real_type half = m_half; \
\
ResReal_ptr x1,x2,x3,x4 ; \
ResReal_ptr y1,y2,y3,y4 ; \
ResReal_ptr fx1,fx2,fx3,fx4 ; \
ResReal_ptr fy1,fy2,fy3,fy4 ;
DEL_DOT_VEC_2D::DEL_DOT_VEC_2D(const RunParams& params)
: KernelBase(rajaperf::Apps_DEL_DOT_VEC_2D, params)
{
setDefaultSize(312); // See rzmax in ADomain struct
setDefaultReps(1050);
m_domain = new ADomain(getRunSize(), /* ndims = */ 2);
m_array_length = m_domain->nnalls;
}
DEL_DOT_VEC_2D::~DEL_DOT_VEC_2D()
{
delete m_domain;
}
Index_type DEL_DOT_VEC_2D::getItsPerRep() const
{
return m_domain->n_real_zones;
}
void DEL_DOT_VEC_2D::setUp(VariantID vid)
{
allocAndInitDataConst(m_x, m_array_length, 0.0, vid);
allocAndInitDataConst(m_y, m_array_length, 0.0, vid);
Real_type dx = 0.2;
Real_type dy = 0.1;
setMeshPositions_2d(m_x, dx, m_y, dy, *m_domain);
allocAndInitData(m_xdot, m_array_length, vid);
allocAndInitData(m_ydot, m_array_length, vid);
allocAndInitDataConst(m_div, m_array_length, 0.0, vid);
m_ptiny = 1.0e-20;
m_half = 0.5;
}
void DEL_DOT_VEC_2D::runKernel(VariantID vid)
{
const Index_type run_reps = getRunReps();
const Index_type ibegin = 0;
const Index_type iend = m_domain->n_real_zones;
switch ( vid ) {
case Base_Seq : {
DEL_DOT_VEC_2D_DATA_SETUP_CPU;
DEL_DOT_VEC_2D_DATA_INDEX;
NDSET2D(m_domain->jp, x,x1,x2,x3,x4) ;
NDSET2D(m_domain->jp, y,y1,y2,y3,y4) ;
NDSET2D(m_domain->jp, xdot,fx1,fx2,fx3,fx4) ;
NDSET2D(m_domain->jp, ydot,fy1,fy2,fy3,fy4) ;
startTimer();
for (RepIndex_type irep = 0; irep < run_reps; ++irep) {
for (Index_type ii = ibegin ; ii < iend ; ++ii ) {
DEL_DOT_VEC_2D_BODY_INDEX;
DEL_DOT_VEC_2D_BODY;
}
}
stopTimer();
break;
}
#if defined(RUN_RAJA_SEQ)
case RAJA_Seq : {
DEL_DOT_VEC_2D_DATA_SETUP_CPU;
NDSET2D(m_domain->jp, x,x1,x2,x3,x4) ;
NDSET2D(m_domain->jp, y,y1,y2,y3,y4) ;
NDSET2D(m_domain->jp, xdot,fx1,fx2,fx3,fx4) ;
NDSET2D(m_domain->jp, ydot,fy1,fy2,fy3,fy4) ;
RAJA::ListSegment zones(m_domain->real_zones, m_domain->n_real_zones);
startTimer();
for (RepIndex_type irep = 0; irep < run_reps; ++irep) {
RAJA::forall<RAJA::loop_exec>(zones, [=](Index_type i) {
DEL_DOT_VEC_2D_BODY;
});
}
stopTimer();
break;
}
#endif // RUN_RAJA_SEQ
#if defined(RAJA_ENABLE_OPENMP) && defined(RUN_OPENMP)
case Base_OpenMP : {
DEL_DOT_VEC_2D_DATA_SETUP_CPU;
DEL_DOT_VEC_2D_DATA_INDEX;
NDSET2D(m_domain->jp, x,x1,x2,x3,x4) ;
NDSET2D(m_domain->jp, y,y1,y2,y3,y4) ;
NDSET2D(m_domain->jp, xdot,fx1,fx2,fx3,fx4) ;
NDSET2D(m_domain->jp, ydot,fy1,fy2,fy3,fy4) ;
startTimer();
for (RepIndex_type irep = 0; irep < run_reps; ++irep) {
#pragma omp parallel for
for (Index_type ii = ibegin ; ii < iend ; ++ii ) {
DEL_DOT_VEC_2D_BODY_INDEX;
DEL_DOT_VEC_2D_BODY;
}
}
stopTimer();
break;
}
case RAJA_OpenMP : {
DEL_DOT_VEC_2D_DATA_SETUP_CPU;
NDSET2D(m_domain->jp, x,x1,x2,x3,x4) ;
NDSET2D(m_domain->jp, y,y1,y2,y3,y4) ;
NDSET2D(m_domain->jp, xdot,fx1,fx2,fx3,fx4) ;
NDSET2D(m_domain->jp, ydot,fy1,fy2,fy3,fy4) ;
RAJA::ListSegment zones(m_domain->real_zones, m_domain->n_real_zones);
startTimer();
for (RepIndex_type irep = 0; irep < run_reps; ++irep) {
RAJA::forall<RAJA::omp_parallel_for_exec>(zones, [=](Index_type i) {
DEL_DOT_VEC_2D_BODY;
});
}
stopTimer();
break;
}
#endif
#if defined(RAJA_ENABLE_TARGET_OPENMP)
case Base_OpenMPTarget :
case RAJA_OpenMPTarget :
{
runOpenMPTargetVariant(vid);
break;
}
#endif
#if defined(RAJA_ENABLE_CUDA)
case Base_CUDA :
case RAJA_CUDA :
{
runCudaVariant(vid);
break;
}
#endif
default : {
std::cout << "\n DEL_DOT_VEC_2D : Unknown variant id = " << vid << std::endl;
}
}
}
void DEL_DOT_VEC_2D::updateChecksum(VariantID vid)
{
checksum[vid] += calcChecksum(m_div, m_array_length);
}
void DEL_DOT_VEC_2D::tearDown(VariantID vid)
{
(void) vid;
deallocData(m_x);
deallocData(m_y);
deallocData(m_xdot);
deallocData(m_ydot);
deallocData(m_div);
}
} // end namespace apps
} // end namespace rajaperf
|
import kfp
from kfp import dsl
from kfp.components import func_to_container_op
from kfp.components import load_component_from_file
@dsl.pipeline(name='Btap Pipeline',
description='MLP employed for Total energy consumed regression problem',
)
#define your pipeline
# def btap_pipeline(minio_tenant:str,bucket:str,build_params:str,energy_hour:str,weather:str,build_params_val:str,energy_hour_val:str,
# output_path:str,featureestimator:str,featureoutput_path:str,param_search:str):
def btap_pipeline(minio_tenant:str = "standard",
bucket:str ="nrcan-btap",
build_params:str ="input_data/output_2021-10-04.xlsx",
energy_hour:str="input_data/total_hourly_res_2021-10-04.csv",
weather:str="input_data/montreal_epw.csv",
build_params_val:str="input_data/output.xlsx",
energy_hour_val:str="input_data/total_hourly_res.csv",
output_path:str="output_data/preprocessing_out",
featureestimator:str="output_data/feature_out",
featureoutput_path:str="lasso",
param_search:str="no"):
# tenant ='minio_tenant'
# Loads the yaml manifest for each component
preprocess = load_component_from_file('pipeline/yaml/preprocessing.yaml')
feature_selection = load_component_from_file('pipeline/yaml/feature_selection.yaml')
predict = load_component_from_file('pipeline/yaml/predict.yaml')
preprocess_ = preprocess(
tenant=minio_tenant,
bucket=bucket,
in_build_params=build_params,
in_hour=energy_hour,
in_weather=weather,
in_build_params_val=build_params_val,
in_hour_val=energy_hour_val,
output_path=output_path
)
feature_selection_ = feature_selection(tenant=minio_tenant,
bucket=bucket,
in_obj_name=preprocess_.output,
estimator_type=featureestimator,
output_path=featureoutput_path)
predict_ = predict(tenant=minio_tenant,
bucket=bucket,
in_obj_name=preprocess_.output,
features=feature_selection_.output,
param_search=param_search)
if __name__ == '__main__':
experiment_yaml_zip = 'pipeline.zip'
kfp.compiler.Compiler().compile(btap_pipeline, experiment_yaml_zip)
print(f"Exported pipeline definition to {experiment_yaml_zip}")
|
<reponame>mp-hl-2021/splinter
#!/usr/bin/env python3
import requests
import sys
def get_token():
try:
with open(".token") as f:
return f.read().strip()
except:
return None
def build_headers():
token = get_token()
if token:
return { "Authorization": token }
return {}
def main():
if len(sys.argv) != 2:
print(f"Usage: {sys.argv[0]} <snippet>")
sys.exit(1)
language = input("language: ")
with open(sys.argv[1]) as f:
contents = f.read()
r = requests.post(f"http://localhost:5000/api/v1/snippets", headers=build_headers(), json={
"Language": language,
"Contents": contents
})
print(r.text)
if __name__ == "__main__":
main()
|
def watcher(self) -> tuple:
shares_total, loss_total, profit_total = [], [], []
loss_output, profit_output = '', ''
n, n_ = 0, 0
self.logger.info('Gathering portfolio.')
for data in self.result:
shares_count = int(data['quantity'].split('.')[0])
if not shares_count:
continue
n += 1
n_ += shares_count
share_id = str(data['instrument'].split('/')[-2])
raw_details = self.rh.get_quote(share_id)
ticker = (raw_details['symbol'])
stock_name = requests.get(raw_details['instrument']).json()['simple_name']
buy = round(float(data['average_buy_price']), 2)
total = round(shares_count * float(buy), 2)
shares_total.append(total)
current = round(float(raw_details['last_trade_price']), 2)
current_total = round(shares_count * current, 2)
difference = round(float(current_total - total), 2)
if difference < 0:
loss_output += (
f'\n{stock_name}:\n{shares_count:,} shares of <a href="https://robinhood.com/stocks/{ticker}" '
f'target="_bottom">{ticker}</a> at ${buy:,} Currently: ${current:,}\n '
f'Total bought: ${total:,} Current Total: ${current_total:,}'
f'\nLOST ${-difference:,}\n')
loss_total.append(-difference)
else:
profit_output += (
f'\n{stock_name}:\n{shares_count:,} shares of <a href="https://robinhood.com/stocks/{ticker}" '
f'target="_bottom">{ticker}</a> at ${buy:,} Currently: ${current:,}\n'
f'Total bought: ${total:,} Current Total: ${current_total:,}'
f'\nGained ${difference:,}\n')
profit_total.append(difference)
lost = round(fsum(loss_total), 2)
gained = round(fsum(profit_total), 2)
port_msg = f'\nTotal Profit: ${gained:,}\nTotal Loss: ${lost:,}\n\n' \
'The above values might differ from overall profit/loss if multiple shares ' \
'of the stock were purchased at different prices.'
net_worth = round(float(self.rh.equity()), 2)
output = f'Total number of stocks purchased: {n:,}\n'
output += f'Total number of shares owned: {n_:,}\n'
output += f'\nCurrent value of your total investment is: ${net_worth:,}'
total_buy = round(fsum(shares_total), 2)
output += f'\nValue of your total investment while purchase is: ${total_buy:,}'
total_diff = round(float(net_worth - total_buy), 2)
if total_diff < 0:
output += f'\n\nOverall Loss: ${total_diff:,}'
else:
output += f'\n\nOverall Profit: ${total_diff:,}'
yesterday_close = round(float(self.rh.equity_previous_close()), 2)
two_day_diff = round(float(net_worth - yesterday_close), 2)
output += f"\n\nYesterday's closing value: ${yesterday_close:,}"
if two_day_diff < 0:
output += f"\nCurrent Dip: ${two_day_diff:,}"
else:
output += f"\nCurrent Spike: ${two_day_diff:,}"
return port_msg, profit_output, loss_output, output |
<filename>setup.py
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# Licensed under the MIT License - https://opensource.org/licenses/MIT
from setuptools import setup
DESCRIPTION = ''
with open('README.rst') as f:
LONG_DESCRIPTION = f.read()
version = "0.2.1"
setup(name='compsyn',
version=version,
description='python package to explore the color of language',
author='<NAME>',
author_email='<EMAIL>',
url='https://github.com/comp-syn/comp-syn',
license='MIT',
classifiers=[
'Development Status :: 4 - Beta',
'License :: OSI Approved :: MIT License',
'Programming Language :: Python',
'Operating System :: OS Independent',
'Intended Audience :: Science/Research',
'Topic :: Scientific/Engineering'
],
packages=['compsyn'],
install_requires=[
'numpy',
'scipy',
'pillow',
'matplotlib',
'numba',
'seaborn',
'scikit-learn',
'google_images_download', #for downloading images
'google-cloud-vision',
'textblob',
'nltk',
'random_word',
'selenium',
'bs4'
],
keywords=[
'Image Analysis',
'Computational Synaesthesia',
'Color Science',
'Computational Social Science'
'Cognitive Science'
],
long_description=LONG_DESCRIPTION)
|
/**
* Tests csv writing.
*
* @throws Exception Exception.
*/
@Test
public void test4() throws Exception {
final CSVReader csv = new CSVReader();
final String test = "abc;\";\";\"\"\"\"" + NL + "def;ghu;\"" + NL
+ "\";" + NL;
final StringWriter out = new StringWriter();
try (final CSVWriter cw = new CSVWriter(new PrintWriter(out) {
@Override
public void println() {
print(NL);
}
})) {
csv.setHandler(new CSVAdapter() {
@Override
public void cell(final CSVContext ctx, final String content) {
cw.writeCell(content);
}
@Override
public void row(final CSVContext ctx) {
if(ctx.row() > 0) {
cw.writeRow();
}
}
@Override
public void end(final CSVContext ctx) {
try {
cw.close();
} catch(final IOException e) {
throw new RuntimeException(e);
}
}
});
csv.read(new StringReader(test));
if(!out.toString().equals(test)) throw new IllegalStateException(
"expected \"" + test + "\" got \""
+ out.toString() + "\"");
}
} |
We are delighted to announce that we have reached agreement with Swansea City for the transfers of Ben Davies and Michel Vorm.
Davies joins us on a five-year contract, while Vorm has signed a four-year deal with the Club.
The transfers will also see Gylfi Sigurdsson return to the Welsh club where he spent time on loan in 2012 and we wish him well for the future.
Left back Davies earned his first professional contract with Swansea in 2011 and has gone on to excel in their First Team, winning their Young Player of the Year accolade the past two seasons.
His impressive club form has also earned him 10 caps for Wales and he made a total of 91 appearances for the Swans, including starting their League Cup Final win against Bradford City in 2013.
Dutch goalkeeper Vorm moved to the Liberty Stadium in August 2011 and firmly established himself as first choice in their debut season in the Premier League, which saw him pick up Supporters' Player of the Year, Players' Player and the Away Player awards at their end of season awards.
In total, he made 97 appearances for Swansea and was also part of the Netherlands' World Cup squad this summer in Brazil. |
import math
def distance_squared(a, b):
return sum([a[i]-b[i] for i in range(len(a))])
def nearest_neighbor(data, current_value):
return min(map(lambda kv : (euclidean_distance_sq(current_value, kv[0]), kv[1]), data.items()))[1]
|
def create_job_from_template(self) -> Callable[
[templates.CreateJobFromTemplateRequest],
jobs.Job]:
if 'create_job_from_template' not in self._stubs:
self._stubs['create_job_from_template'] = self.grpc_channel.unary_unary(
'/google.dataflow.v1beta3.TemplatesService/CreateJobFromTemplate',
request_serializer=templates.CreateJobFromTemplateRequest.serialize,
response_deserializer=jobs.Job.deserialize,
)
return self._stubs['create_job_from_template'] |
// recogComment constructs a recognizer for comments.
func recogComment(l *lexer) Recognizer {
return &recognizeComment{
l: l,
}
} |
import { NgModule } from '@angular/core'
import {
DevModule,
StorageProviderModule,
RccStorage
} from '@rcc/common'
import { LocalStorageService } from './local-storage.service'
@NgModule({
providers:[
LocalStorageService
],
imports: [
StorageProviderModule.forRoot(LocalStorageService),
DevModule.note('LocalStorageModule')
],
})
export class LocalStorageModule{}
|
The tropospheric cycle of H2: a critical review
The literature on the distribution, budget and isotope content of molecular hydrogen (H2) in the troposphere is critically reviewed. The global distribution of H2 is reasonably well established and is relatively uniform. The surface measurements exhibit a weak latitudinal gradient with 3% higher concentrations in the Southern Hemisphere and seasonal variations that maximize in arctic latitudes and the interior of continents with peak-to-peak amplitudes up to 10%. There is no evidence for a continuous long-term trend, but older data suggest a reversal of the interhemispheric gradient in the late 1970s, and an increase in the deuterium content of H2 in the Northern Hemisphere from 80 standard mean ocean water (SMOW) in the 1970s to 130 today. The current budget analyses can be divided in two classes: bottom up, in which the source and sink terms are estimated separately based on emission factors and turnovers of precursors and on global integration of regional loss rates, respectively. That category includes the analyses by 3-D models and furnishes tropospheric turnovers around 75 Tg H2 yr−1. The other approach, referred to as top down, relies on inverse modelling or analysis of the deuterium budget of tropospheric H2. These provide a global turnover of about 105 Tg H2 yr−1. The difference is due to a much larger sink strength by soil uptake and a much larger H2 production from the photochemical oxidation of volatile organic compounds (VOC) in the case of the top down approaches. The balance of evidence seems to favour the lower estimates—mainly due to the constraint placed by the global CO budget on the H2 production from VOC. An update of the major source and sink terms yields: fossil fuel use 11±4 TgH2 yr−1; biomass burning (including bio-fuel) 15 ± 6 Tg H2 yr−1; nitrogen fixation (ocean) 6 ± 3 Tg H2 yr−1; nitrogen fixation (land) 3 ± 2 Tg H2 yr−1; photochemical production from CH4 23 ± 8 Tg H2 yr−1 and photochemical production from other VOC 18 ± 7 Tg H2 yr−1. The loss through reaction of H2 with OH is 19 ± 5 Tg H2 yr−1, and soil uptake 60+30 −20 Tg H2 yr−1. All these rates are well within the ranges of the corresponding bottom up estimates in the literature. The total loss of 79 Tg H2 yr−1 combined with a tropospheric burden of 155 Tg H2 yields a tropospheric H2 lifetime of 2 yr. Besides these major sources of H2, there are a number of minor ones with source strengths > 1 Tg H2 yr−1. Rough estimates for these are also given. |
<gh_stars>100-1000
/* -*- tab-width: 4; -*- */
/* vi: set sw=2 ts=4 expandtab: */
/*
* Copyright 2018-2020 <NAME>.
* SPDX-License-Identifier: Apache-2.0
*/
#ifndef _INSTANCE_SAMPLE_BASE_H_
#define _INSTANCE_SAMPLE_BASE_H_
#include <vector>
#include "GL3LoadTestSample.h"
#include <glm/gtc/matrix_transform.hpp>
#define VERTEX_BUFFER_BIND_ID 0
#define ENABLE_VALIDATION false
class InstancedSampleBase : public GL3LoadTestSample
{
public:
InstancedSampleBase(uint32_t width, uint32_t height,
const char* const szArgs,
const std::string sBasePath);
~InstancedSampleBase();
virtual void resize(uint32_t width, uint32_t height);
virtual void run(uint32_t msTicks);
//virtual void getOverlayText(VulkanTextOverlay *textOverlay);
protected:
using ShaderSource = GL3LoadTestSample::ShaderSource;
const GLuint texUnit;
const GLuint uniformBufferBindId;
GLenum texTarget;
GLuint gnTexture;
GLuint gnInstancingProg;
GLuint gnUbo;
ktx_transcode_fmt_e transcodeTarget;
bool bInitialized;
bool bIsMipmapped;
struct textureInfo {
uint32_t numLayers;
uint32_t numLevels;
uint32_t baseDepth;
} textureInfo;
uint32_t instanceCount;
// Vertex layout for this example
struct TAVertex {
float pos[3];
float uv[2];
};
struct MeshBuffer {
uint32_t indexCount;
glm::vec3 dim;
GLuint gnVao;
GLuint gnVbo[2];
GLsizeiptr verticesOffset;
GLsizeiptr indicesOffset;
};
MeshBuffer quad;
struct UboInstanceData {
// Model matrix
glm::mat4 model;
};
struct {
// Global matrices
struct {
glm::mat4 projection;
glm::mat4 view;
} matrices;
// N.B. The UBO structure declared in the shader has the array of
// instance data inside the structure rather than pointed at from the
// structure. The start of the array will be aligned on a 16-byte
// boundary as it starts with a matrix.
//
// Separate data for each instance
UboInstanceData *instance;
} uboVS;
GLint uProgramUniforms;
GLint uSampler;
static const GLchar* pszInstancingFsDeclarations;
static const GLchar* pszSrgbEncodeFunc;
static const GLchar* pszInstancingFsMain;
static const GLchar* pszInstancingSrgbEncodeFsMain;
static const GLchar* pszInstancingVsDeclarations;
void cleanup();
// Setup vertices for a single uv-mapped quad
void generateQuad();
void prepareUniformBuffers();
void updateUniformBufferMatrices();
void prepareSampler();
void prepareProgram(ShaderSource& fs, ShaderSource& vs);
void prepare(ShaderSource& fs, ShaderSource& vs);
void processArgs(std::string sArgs);
virtual void viewChanged()
{
updateUniformBufferMatrices();
}
};
#endif /* _INSTANCE_SAMPLE_BASE_H_ */
|
from math import floor
value = int(input())
divider = []
dividers = []
for i in range(1, floor(value ** 0.5) + 1):
if not value % i:
divider.append(i)
if value // i != i:
divider.append(value // i)
value **= 2
for f in divider:
for g in divider:
dividers.append(f * g)
label = 0
for v in dividers:
val = value // v
l = val // 2 - 1
r = val - 1
while r - l > 1:
m = (r + l) // 2
if 2 * m * val - val ** 2 >= value:
r = m
else:
l = m
if (2 * r - val) * val == value:
if val - r > 0 and r > 0 and not label:
print(val - r, r)
label = 1
break
if not label:
print('-1') |
/*
* dpdk_check_sriov_vf - check if any of eth devices is a virtual function.
* - Pin the lcore for SR-IOV vf I/O for eth devices.
*/
static void
dpdk_check_sriov_vf(void)
{
int i;
struct rte_eth_dev_info dev_info;
size_t soff;
for (i = 0; i < rte_eth_dev_count(); i++)
{
rte_eth_dev_info_get(i, &dev_info);
soff = strlen(dev_info.driver_name) - sizeof(VR_DPDK_VF_PMD_SFX) + 1;
if (soff > 0 &&
strncmp(dev_info.driver_name + soff, VR_DPDK_VF_PMD_SFX,
sizeof(VR_DPDK_VF_PMD_SFX)) == 0) {
if (dev_info.max_tx_queues < vr_dpdk.nb_fwd_lcores
+ VR_DPDK_FWD_LCORE_ID - VR_DPDK_PACKET_LCORE_ID) {
vr_dpdk.vf_lcore_id = VR_DPDK_FWD_LCORE_ID;
RTE_LOG(INFO, VROUTER,
"%s: Lcore %d: SR-IOV virtual function IO for eth device %d (%s)\n",
__func__, VR_DPDK_FWD_LCORE_ID, i, dev_info.driver_name);
break;
}
}
}
} |
<reponame>Theo-Steiner/svelte<gh_stars>1000+
const glob = require('tiny-glob/sync.js');
require('./setup');
// bind internal to jsdom
require('./helpers.ts');
require('../internal');
console.clear();
const test_folders = glob('*/index.ts', { cwd: 'test' });
const solo_folders = test_folders.filter(folder => /\.solo/.test(folder));
if (solo_folders.length) {
if (process.env.CI) {
throw new Error('Forgot to remove `.solo` from test');
}
solo_folders.forEach(name => require('./' + name));
} else {
test_folders.forEach(name => require('./' + name));
}
|
<filename>packages/@dckit/routes/src/index.tsx
import React from 'react'
import { Route, Switch, useLocation } from 'react-router-dom'
export const normalizePath = (path?: string) =>
!path || path === '/' ? '' : path
export interface IRoute {
path: string
component: any
routes?: Partial<IRoute>[]
}
export const useLocationTail = () => {
const location = useLocation().pathname
const match = location.match(/(\/[a-z0-9_-]+)\/?$/i)
const locationTail = (match && match[1]) || ''
return locationTail.toLowerCase()
}
export function renderRoutes(rootRoutes: Partial<IRoute>[], rootPath?: string) {
const basePath = normalizePath(rootPath)
return (
<Switch>
{rootRoutes.map(route => {
const { path, component: Component, routes } = route
const routePath = `${basePath}${normalizePath(path)}`
return (
<Route
key={`route-to-${routePath}`}
path={routePath}
render={routeProps => (
<Component {...routeProps}>
{routes && renderRoutes(routes, routePath)}
</Component>
)}
/>
)
})}
</Switch>
)
}
export const mapRoutes = (items: any[]) => {
const routes = items
.filter((item: any) => 'route' in item)
.map((item: any): Partial<IRoute> => item.route)
return routes
}
|
<reponame>ebot1234/cheesy-arena<filename>field/display_test.go<gh_stars>100-1000
// Copyright 2018 Team 254. All Rights Reserved.
// Author: <EMAIL> (<NAME>)
package field
import (
"github.com/stretchr/testify/assert"
"testing"
"time"
)
func TestDisplayFromUrl(t *testing.T) {
query := map[string][]string{}
display, err := DisplayFromUrl("/display", query)
assert.Nil(t, display)
if assert.NotNil(t, err) {
assert.Contains(t, err.Error(), "ID not present")
}
// Test the various types.
query["displayId"] = []string{"123"}
display, err = DisplayFromUrl("/blorpy", query)
assert.Nil(t, display)
if assert.NotNil(t, err) {
assert.Contains(t, err.Error(), "Could not determine display type")
}
display, _ = DisplayFromUrl("/display/websocket", query)
assert.Equal(t, PlaceholderDisplay, display.Type)
display, _ = DisplayFromUrl("/displays/alliance_station/websocket", query)
assert.Equal(t, AllianceStationDisplay, display.Type)
display, _ = DisplayFromUrl("/displays/announcer/websocket", query)
assert.Equal(t, AnnouncerDisplay, display.Type)
display, _ = DisplayFromUrl("/displays/audience/websocket", query)
assert.Equal(t, AudienceDisplay, display.Type)
display, _ = DisplayFromUrl("/displays/field_monitor/websocket", query)
assert.Equal(t, FieldMonitorDisplay, display.Type)
display, _ = DisplayFromUrl("/displays/pit/websocket", query)
assert.Equal(t, PitDisplay, display.Type)
// Test the nickname and arbitrary parameters.
query["nickname"] = []string{"Test Nickname"}
query["key1"] = []string{"value1"}
query["key2"] = []string{"value2"}
query["color"] = []string{"%230f0"}
display, _ = DisplayFromUrl("/display/websocket", query)
assert.Equal(t, "Test Nickname", display.Nickname)
if assert.Equal(t, 3, len(display.Configuration)) {
assert.Equal(t, "value1", display.Configuration["key1"])
assert.Equal(t, "value2", display.Configuration["key2"])
assert.Equal(t, "#0f0", display.Configuration["color"])
}
}
func TestDisplayToUrl(t *testing.T) {
display := &Display{DisplayConfiguration: DisplayConfiguration{Id: "254", Nickname: "Test Nickname",
Type: PitDisplay, Configuration: map[string]string{"f": "1", "z": "#fff", "a": "3", "c": "4"}}}
assert.Equal(t, "/displays/pit?displayId=254&nickname=Test+Nickname&a=3&c=4&f=1&z=%23fff", display.ToUrl())
}
func TestNextDisplayId(t *testing.T) {
arena := setupTestArena(t)
assert.Equal(t, "100", arena.NextDisplayId())
displayConfig := &DisplayConfiguration{Id: "100"}
arena.RegisterDisplay(displayConfig, "")
assert.Equal(t, "101", arena.NextDisplayId())
}
func TestDisplayRegisterUnregister(t *testing.T) {
arena := setupTestArena(t)
displayConfig := &DisplayConfiguration{Id: "254", Nickname: "Placeholder", Type: PlaceholderDisplay,
Configuration: map[string]string{}}
arena.RegisterDisplay(displayConfig, "1.2.3.4")
if assert.Contains(t, arena.Displays, "254") {
assert.Equal(t, "Placeholder", arena.Displays["254"].DisplayConfiguration.Nickname)
assert.Equal(t, PlaceholderDisplay, arena.Displays["254"].DisplayConfiguration.Type)
assert.Equal(t, 1, arena.Displays["254"].ConnectionCount)
assert.Equal(t, "1.2.3.4", arena.Displays["254"].IpAddress)
}
notifier := arena.Displays["254"].Notifier
// Register a second instance of the same display.
displayConfig2 := &DisplayConfiguration{Id: "254", Nickname: "Pit", Type: PitDisplay,
Configuration: map[string]string{}}
arena.RegisterDisplay(displayConfig2, "2.3.4.5")
if assert.Contains(t, arena.Displays, "254") {
assert.Equal(t, "Pit", arena.Displays["254"].DisplayConfiguration.Nickname)
assert.Equal(t, PitDisplay, arena.Displays["254"].DisplayConfiguration.Type)
assert.Equal(t, 2, arena.Displays["254"].ConnectionCount)
assert.Equal(t, "2.3.4.5", arena.Displays["254"].IpAddress)
assert.Same(t, notifier, arena.Displays["254"].Notifier)
}
// Register a second display.
displayConfig3 := &DisplayConfiguration{Id: "148", Type: FieldMonitorDisplay, Configuration: map[string]string{}}
arena.RegisterDisplay(displayConfig3, "3.4.5.6")
if assert.Contains(t, arena.Displays, "148") {
assert.Equal(t, 1, arena.Displays["148"].ConnectionCount)
}
// Update the first display.
displayConfig4 := DisplayConfiguration{Id: "254", Nickname: "Alliance", Type: AllianceStationDisplay,
Configuration: map[string]string{"station": "B2"}}
arena.UpdateDisplay(displayConfig4)
if assert.Contains(t, arena.Displays, "254") {
assert.Equal(t, "Alliance", arena.Displays["254"].DisplayConfiguration.Nickname)
assert.Equal(t, AllianceStationDisplay, arena.Displays["254"].DisplayConfiguration.Type)
assert.Equal(t, 2, arena.Displays["254"].ConnectionCount)
}
// Disconnect both displays.
arena.MarkDisplayDisconnected(displayConfig.Id)
arena.MarkDisplayDisconnected(displayConfig3.Id)
if assert.Contains(t, arena.Displays, "148") {
assert.Equal(t, 0, arena.Displays["148"].ConnectionCount)
}
if assert.Contains(t, arena.Displays, "254") {
assert.Equal(t, 1, arena.Displays["254"].ConnectionCount)
}
}
func TestDisplayUpdateError(t *testing.T) {
arena := setupTestArena(t)
displayConfig := DisplayConfiguration{Id: "254", Configuration: map[string]string{}}
err := arena.UpdateDisplay(displayConfig)
if assert.NotNil(t, err) {
assert.Contains(t, err.Error(), "doesn't exist")
}
}
func TestDisplayPurge(t *testing.T) {
arena := setupTestArena(t)
// Unnamed placeholder gets immediately purged upon disconnection.
displayConfig := &DisplayConfiguration{Id: "254", Type: PlaceholderDisplay, Configuration: map[string]string{}}
arena.RegisterDisplay(displayConfig, "1.2.3.4")
assert.Contains(t, arena.Displays, "254")
arena.MarkDisplayDisconnected(displayConfig.Id)
assert.NotContains(t, arena.Displays, "254")
// Named placeholder does not get immediately purged upon disconnection.
displayConfig.Nickname = "Bob"
arena.RegisterDisplay(displayConfig, "1.2.3.4")
assert.Contains(t, arena.Displays, "254")
arena.MarkDisplayDisconnected(displayConfig.Id)
assert.Contains(t, arena.Displays, "254")
// Unnamed configured displayConfig does not get immediately purged upon disconnection.
displayConfig = &DisplayConfiguration{Id: "1114", Type: FieldMonitorDisplay, Configuration: map[string]string{}}
arena.RegisterDisplay(displayConfig, "1.2.3.4")
assert.Contains(t, arena.Displays, "1114")
arena.MarkDisplayDisconnected(displayConfig.Id)
assert.Contains(t, arena.Displays, "1114")
arena.purgeDisconnectedDisplays()
assert.Contains(t, arena.Displays, "1114")
// Unnamed configured displayConfig gets purged by periodic task.
arena.RegisterDisplay(displayConfig, "1.2.3.4")
assert.Contains(t, arena.Displays, "1114")
arena.MarkDisplayDisconnected(displayConfig.Id)
arena.Displays["1114"].lastConnectedTime = time.Now().Add(-displayPurgeTtlMin * time.Minute)
arena.purgeDisconnectedDisplays()
assert.NotContains(t, arena.Displays, "1114")
// Named configured displayConfig does not get purged by periodic task.
displayConfig.Nickname = "Brunhilda"
arena.RegisterDisplay(displayConfig, "1.2.3.4")
assert.Contains(t, arena.Displays, "1114")
arena.MarkDisplayDisconnected(displayConfig.Id)
arena.Displays["1114"].lastConnectedTime = time.Now().Add(-displayPurgeTtlMin * time.Minute)
arena.purgeDisconnectedDisplays()
assert.Contains(t, arena.Displays, "1114")
}
|
def _build_name(self, name: str):
if self.param.param_type_name == "option":
param_type = "flag" if self.param.is_bool_flag else "option"
else:
param_type = self.param.param_type_name
click_type = self.type_attrs["click_type"]
form_type = self.type_attrs["type"]
return str(
FieldId(
self.command_index,
self.param_index,
param_type,
click_type,
self.param.nargs,
form_type,
name,
)
) |
// Unfortunately similar code to removeNoteFromOffList without any clear way of factoring out to a helper function
static void removeNoteFromOnList(tPolyphonicHandler* poly, int8_t midiNoteNumber)
{
if (poly->midiNodes[midiNoteNumber].prev == NULL)
poly->onListFirst = poly->midiNodes[midiNoteNumber].next;
if (poly->midiNodes[midiNoteNumber].prev != NULL)
poly->midiNodes[midiNoteNumber].prev->next = poly->midiNodes[midiNoteNumber].next;
if (poly->midiNodes[midiNoteNumber].next != NULL)
poly->midiNodes[midiNoteNumber].next->prev = poly->midiNodes[midiNoteNumber].prev;
poly->midiNodes[midiNoteNumber].next = NULL;
poly->midiNodes[midiNoteNumber].prev = NULL;
} |
Trends in counterfeit drugs and pharmaceuticals before and during COVID-19 pandemic
Counterfeit, fake, adulterated or falsified drugs and pharmaceuticals, could be branded or generic drugs, excipients and active substances (in drugs and vaccines), medical supplies and devices, etc, intended to pass as the original. Counterfeits are always inferior in terms of quality, safety and efficacy compared to the original pharmaceuticals, and subsequently, they pose an unpredictable risk to public health and lead to loss of confidence in medicines, healthcare providers, and health systems. In the decades before the outbreak of the COVID-19 pandemic, a constant trend of increased trafficking was reported. However, the pandemic created a combination of public health emergency, economic distress, and misinformation-driven panic that made problematic the access and supply of high quality essential medicines and health products, and pushed consumers and vendors even more towards counterfeit pharmaceuticals. This contribution aims to review the trends in counterfeit drugs and pharmaceuticals trafficking, the health impact of their use, as well as, measures and actions implemented to restrict their proliferation, before and during COVID-19 pandemic; the relative recommendations, the expressed perspectives and the existing limitations are thoroughly discussed.
Introduction
Counterfeit, fake, adulterated or falsified drugs and pharmaceuticals, could be branded or generic drugs, excipients and active substances (in drugs and vaccines), medical supplies, personal protective equipment (PPE), medical devices (including parts and accessories), intended to pass as the original . The World Health Organization (WHO) is using the following three terms for categorizing them: (a) "falsified": they are products that fraudulently misrepresent their identity (e.g. name), composition (mislabeling of content), or source (e.g. country of origin or authorizing organization). Could be perfect imitation of the original pharmaceutical (same packaging, same active ingredients at the right concentration) or in lower/higher quantities than indicated on the label or with different ingredients or with no active ingredients at all. They could also be the result of repackaging of unapproved drugs to resemble approved ones or could be the result of theft and resale of approved drugs, (b) "substandard" (also called "out of specification"): they are products that have been authorized but fail to meet their quality standards and/or specifications. Could be the result of improper manufacture or storage or products that have expired (deteriorated authentic pharmaceuticals), and (c) "unregistered/unlicensed": they are products that have not undergone evaluation and/or approval .
Counterfeits are always inferior in terms of quality, safety and efficacy compared to original pharmaceuticals; they pose an unacceptable risk to public health and lead to loss of confidence in medicines, healthcare providers, and health systems . In the past decades (before the outbreak of the COVID-19 pandemic) a constant trend of increased trafficking was reported . The pandemic though has reshaped the demand for goods and services worldwide exposing even more the vulnerabilities of the global health care systems . The combination of a public health emergency, economic distress, and misinformation-driven panic has caused problems related to access and supply of high quality essential medicines and health products, leading to drug shortages, quality issues, uncertainty, and price volatility . This situation has pushed consumers and vendors even more towards counterfeit pharmaceuticals.
This contribution aims to review the trends in counterfeit drugs and pharmaceuticals trafficking, as well as, the health impact of their use before and during COVID-19 pandemic; the relative recommendations, the expressed perspectives and the existing limitations are thoroughly discussed.
Origin and dissemination
According to the 2020 Organization for Economic Co-operation and Development (OECD) report the primary countries from which adulterated pharmaceuticals originate are considered to be China, Hong Kong, Singapore and India . While China and India are the main producers, the United Arab Emirates, Singapore, Hong Kong, Yemen and Iran are serving as transit economies mainly exporting to the United States, Europe, Japan, some South American economies and Africa .
Globally, the market is estimated to be worth between USD 65 and 200 billion dollars each year, making it a very lucrative criminal enterprise . While the range of affected medicines is growing and evolving, the prime targets in developed countries are life-style expensive pharmaceuticals like hormones, steroids, anorectics, erectile dysfunction drugs and psychotropic drugs, while in developing countries life-saving medicines like antibiotics, anti-malarials, anti-tubercolosis drugs and antiretroviral drugs . Other pharmaceuticals targeted by counterfeiters are diabetes treatments, HIV/ AIDS and cancer treatments, pain killers, central nervous systems medicines, lipid-lowering drugs, and medications for treating depression and blood pressure . Most of them are distributed via e-commerce and social media platforms, rogue pharmacies, messaging applications and the dark web while express courier and postal parcels are the most popular ways of shipping .
Main reasons for the prevalence of counterfeit products throughout the world are (a) high demand for less expensive drugs, (b) low availability of medical products, (c) social tolerance for counterfeit products, (d) globalization and consumer access to the internet (e-commerce), (e) complex and fragile supply chains, (f) limited technical capacity to monitor products throughout the supply chain, (g) complex import-export mechanisms, (h) the use of free and special economic and trade zones, (i) lack of law enforcement, (g) weak national regulatory policies on the manufacturing and marketing of medications, and (k) lack of adequate financial and political commitments 11, . For these reasons the penetration of counterfeit products is generally higher in developing countries with West Africa and South America being reported as the areas mostly affected . In 2017, the WHO after reviewing laboratory results on medical products from 75 low-and middleincome countries (LMIC), reported that 33.6 % of hypertension, cancer, epilepsy, analgesic uterotonics and immunosuppressants drugs, 11.8 % of antimalarial drugs, 7.2 % of antibiotics and anti-infective products, 6.7 % of tuberculosis medicines, and 4.2 % of HIV medicines were falsified or substandard, while approximately 10.5 % of all pharmaceuticals may be falsified in those countries .
In high-income countries only 1 % of the drugs in the legitimate drug supply chain are counterfeit. However, this figure is derived from only a small sample . The Pharmaceutical Security Institute's data on counterfeiting, illegal diversion and theft incidents from 2016 to 2020 show that there has been a rise in the number of discovered incidents from 3146 in 2016 to 5081 in 2019, and a decrease in 2020 to 4344 attributed to the coronavirus pandemic . Most of these incidents (1579) occurred in North America followed by Asia Pacific with 1151 incidents . This indicates that the problem in developed countries may have been underestimated. However, high-income countries have a strict regulatory framework, technological means, and financial resources to detect and limit the distribution of fake drugs and pharmaceuticals .
The act of falsifying a medical product is a criminal act that constitutes not only consumer fraud but a threat to public health and safety . Illicit trafficking of counterfeits is an attractive moneymaking venture to criminal groups compared to other criminal activities, due to the combination of high profit, low risk of detection and prosecution, low penalties, and the ease with which consumers can be deceived . Since the outbreak of the COVID-19 pandemic, the threat posed by fake medicines and medical products has increased dramatically. While this pandemic was expected to have a negative impact on the global operations of transnational organized criminal groups, these groups quickly adapted . They took advantage of the high market demand for medicines, personal protective equipment (PPE) and hygiene products and made lucrative profits from the sale of counterfeit items . One example is chloroquine, as consumer demand for this product increased during the pandemic, criminal groups flooded the market with counterfeit, unauthorized or diverted medicines . Moreover, criminal networks carried out prescription fraud using fake paperwork to obtain chloroquine and other medicines under study as potential treatments for coronavirus . For all the above the WHO issued a Medical Product Alert No 4/2020 for falsified chloroquine and Medical Product Alert No 3/2020 for falsified COVID-19 medical products requiring vigilance from all countries on fake products that claim to prevent and cure COVID-19.
Health impact and consequences
Counterfeit drugs and pharmaceuticals are a major issue affecting public health, and healthcare systems around the globe. They may cause life-threatening implications and adverse effects to patients (who are very often unaware of the issue), increased risk of prolonged illness, failure of treatments or cure, and/or mortality . In the United Kingdom almost 32 % of those who have bought one or more counterfeit medicines have suffered a health issue as a result . Considering that in Africa almost 60 % of the medications are substandard one can imagine the magnitude of the consequences . In China it was reported in a newspaper that almost 192,000 of its citizens died as a result of counterfeit medications , while WHO estimates 72,430 and 116,000 additional deaths occur annually from the use of counterfeit drugs for pneumonia and malaria, respectively . Probably the numbers are even worse as many of such cases go undetected in developing as well as developed countries even today.
The problem was first recorded long ago, with periodical crises in the supply of antimicrobials, such as fake cinchona bark in the 1600 s and fake quinine in the 1800s . Since then numerous cases have been documented in which patients have suffered harm or died due to the use of adulterated medicines. Severe hypoglycemia has been documented in Singapore in 2008 which was associated with contamination of illegal sexual-enhancement drugs with glyburide . The consumption of counterfeit cancer-fighting medications, that in some cases included no active ingredients, has been reported , as well as the consumption of a counterfeit diet pill that was actually a pesticide with lethal consequences . Heparin products were substituted with a cheaper counterfeit substance and were inserted into the supply chain causing the death of 81 people in the United States due to adverse effects . The deaths of 89 children in Haiti and 30 infants in India occurred after the consumption of paracetamol cough syrup which was prepared with diethylene glycol a toxic chemical used in antifreeze . The deaths of 2500 Nigerians were attributed to the use of vaccines that were found to lack any active ingredient .
Fake drugs could also have a consequential cost to public health sometimes with fatal outcome. For instance, counterfeit anti-malarials, antibiotics, and antivirals could contribute to the progression of microbial resistance and drug-resistant infections . When treating pneumonia and inadequate quality of levofloxacin is used, the minimum required inhibitory concentration may not be achieved, thus leading to resistance and treatment failure . Long ago a phenomenon of resistance of malaria parasite species to antimalarial drugs was observed in Camerron that was linked to falsified chloroquine tablets . In recent years, HIV drug resistance is being observed in developing countries mainly due to poor quality of the antivirals used . Moreover, risk factors such as blood pressure, serum glucose, or serum lipids that are not being adequately controlled by using ineffective counterfeit drugs, could also lead to major health risks .
A big challenge in environmental terms is the pollution from pharmaceuticals which in case of counterfeit medicines turns to be even more serious as their actual composition (active ingredients and excipients) may often be unknown. Another aspect of this issue is the environmental pollution from dirty practices by an unregulated criminal activity involving potentially toxic chemicals .
Last but not least, the economic costs of treating patients who have suffered adverse health consequences after the consumption of adulterated drugs should also be evaluated. Moreover, patients and households lose income due to prolonged illness or death, legitimate producers lose sales to counterfeiters, while governments lose taxes and face long term issues related to managing health care systems. All the above have a domino effect on health care systems and the wider economy .
The impact of COVID-19 pandemic in counterfeit dissemination
Since the outbreak of the coronavirus pandemic the world is facing many challenges. Many problems have arisen regarding demand and supply of high quality essential medicines and health products and the sale of falsified health products has increased . Moreover, dark web marketplaces and commercial websites accessible via free software, have gained significant popularity for buying fake drugs and medical products . From the first months of the pandemic falsifiers adapted fast to the new situation . The most counterfeited products related to COVID-19 have been antiviral medications, antimalarial chloroquine, vitamin C, painkillers, antibiotics, and herbal medicines and medical supplies like face masks, coronavirus testing kits, gloves, ventilators, disinfectants, gels, soaps and cleaning wipes . Moreover, fake coronavirus vaccines were reported to be sold in certain parts of the world .
The pandemic caused a public health crisis that stressed nearly all health care resources to their breaking point. Shortages in drug supply emerged as the need to treat patients with COVID-19 outstripped the supply of sedatives, analgesics, and antiviral products (hydroxychloroquine, remdesivir) leaving patients scrambling to find medication like hydroxychloroquine to control arthritis or lupus even in countries like the United States . The supply chain disruption was also caused by the reduced production and export of some medicines, active pharmaceutical ingredients and raw materials owing to the closure of countries and borders For example, in the U.S.A. 70 % of manufacturing sites that make active ingredients for medicines are overseas, with almost one-third of them in China and India, while most medical products used in Africa are imported mainly from China and India, as well. Their dependence from other countries led to shortage of medical supplies during the outbreak .
Although challenges, ranging from weak regulatory and legal frameworks to the prevention of the manufacturing and trafficking of counterfeit health products and cyber security shortcomings, were evident before COVID-19, the pandemic has exacerbated them and it will be difficult to make significant improvements in the immediate future . Taking into account that less than 30 % of medicines regulatory agencies in the world can ensure the adequacy of medicines and vaccines and as the pandemic revealed deficiencies in the existing health care systems, experts are expressing fears that without proper actions the world risks a parallel pandemic of counterfeit drugs and pharmaceutical products .
Measures and actions before and during the pandemic
This problem was first addressed in 1985 (Conference of Experts on the Rationale use of Drugs, Nairobi) and various initiatives have been taken since then to fight the counterfeit of pharmaceuticals crime. In 1992, the WHO released the "WHO Guidelines for the Development of Measures to Combat Counterfeit Drugs" and in 2006 the International Medical Products Anti-Counterfeiting Taskforce (IMPACT) was launched to establish coordination between members of international organizations, enforcement agencies, industry, and nongovernmental organizations to tackle the increased criminal networks and internet sources in which fake health products are gaining popularity . WHO launched its Global Surveillance and Monitoring System for substandard and falsified medicines, vaccines and in-vitro diagnostic tests in July 2013, and in 2017 reported a three-step strategy to counter fake pharmaceuticals: prevent, detect and respond . In 2019 the United Nations issued a guide to illustrate the basic concepts on combating falsified medical product related crime .
Law enforcement and drug control agencies at the local and international level work closely together to combat trafficking of counterfeit pharmaceuticals . More than 18 million atorvastatin tablets sold in the United Kingdom were recalled after the detection of a smuggling operation that compromised the brand name Lipitor drug supply . Approximately 2 million oral contraceptive tablets without active ingredients in them were intercepted as they were being smuggled into the United States . In September 2019, the US Food and Drug Administration (FDA) reported that 1159 lots of valsartan, losartan, and irbesartan had been recalled because of high levels of N-nitrosodiethylamine (NDMA) . In the detection of counterfeits INTERPOL also plays an important role. In March 2020, INTERPOL seized more than 34,000 counterfeit medical goods after targeting the online sale of illicit medicines and medical devices related to COVID-19 (global operation Pangea XIII) . It is supporting collaboration between health regulators, customs, police, experts in countering illicit trade, financial crime and cybercrime, in 194 member countries, regionally as well as globally in their fight against illicit activities in the trade of pharmaceuticals . Online training and webinars are also provided by INTERPOL with collaboration with the International Intellectual Property Crime Investigators College to build the skills and knowledge of agencies in combating COVID-19 crime threats .
Actions based on collaborations were taken by countries like the Anti-Counterfeiting Trade Agreement (ACTA) (by Australia, Canada, the EU, Japan, Mexico, Morocco, New Zealand, Singapore, South Korea Switzerland and the USA) , the Member States of the European Union with the Directive 2011/62/EU , as well as agencies like the FDA , the US Agency for International Development (USAID) and the European Medicines Agency (EMA) . Activities and programs undertaken by UNICEF, the United Nations Population Fund, the Global Fund, Bill & Melinda Gates Foundation focus on supporting product traceability with the use of new technologies . Furthermore, some programs specifically aim to strengthen regulatory agencies in LMIC in order to ensure access to appropriate, safe, affordable, and quality-assured medicines .
Legitimate pharmaceutical manufacturers play also an important role in the fight against the counterfeiting of pharmaceuticals. There are ongoing industry efforts through dedicated internal anti-counterfeit teams for tackling counterfeit medicine across the globe. These teams are dedicated in deterring illegal counterfeit medicines trade by advancing detection with new technologies and implementing new strategies and techniques that make the production of counterfeits more difficult but their detection easier. Moreover, strong working relationships have been built between the pharmaceutical industry, the law enforcement agencies and regulatory or health authorities, in the attempt to trace counterfeit products, as well as, manufacturers and distributors .
Detection of counterfeit pharmaceuticals is also a crucial step in reporting and policy making. Various methods to detect counterfeits exist, with strengths and weaknesses in applicability, reliability, and cost . The first step is visual inspection of packaging to provide information on suspected products, followed by scanning barcodes and seals that easily detect unlabeled or wrongly labeled medicines . More sophisticated methods also exist like the analysis of primary packaging by spectroscopic techniques such as IR and Raman in combination with optimized chemometric models . Subsequent (chemical) analysis is often required with methods, based on LC-or GC-MS, to confirm falsification of suspected samples .
Finally, public awareness campaigns have been also used in the fight against counterfeit drugs, like the initiative taken by the United Nations Organization for Drugs and Crime (UNODC) named "Counterfeit: Don't Buy into Organized Crime", as well as the "INT-ERPOL-Checkit" (I-Checkit), which provides the general public with a product verification tool to check if products are real or counterfeit . Under Operation Pangea XIII, INTERPOL member countries also reached out to the general public-through videos, brochures, exhibitions and talks at hospitals and schools-to raise awareness of the dangers of buying pharmaceuticals from unregulated online sources .
Recommendations, perspectives and limitations
Studies conducted by WHO, UNODC, OECD and other international bodies showed that the absence of a comprehensive legal framework is responsible for the flourishing of the adulterated medicines trade especially in low-income countries . Therefore, it is essential that every country examine their existing drug control laws for adequacy in preventing their trafficking . If the laws are inadequate, legislation needs to be quickly strengthened in order to assist in the detection and eradication of fake pharmaceuticals and the criminal groups behind them . On the other hand due to globalization it is also essential that both domestic and international law be engaged to combat counterfeit medical crime . While the production of counterfeit pharmaceuticals will be more effectively regulated by domestic laws, exports would be regulated more effectively by international laws in order to ensure cooperation .
Generally, one of the most efficient tools for the eradication of counterfeit medicines crime is having in place an efficient enforcement regime . Collaboration between law enforcement agencies is also essential especially in the form of exchanging criminal intelligence relating to transnational organized crime groups involved in counterfeit activities . The continuous monitoring of the dark web is also needed as the online shadow economy has evolved during the COVID-19 pandemic . Moreover strict and tough punishments should be implemented across all countries on criminals manufacturing and marketing counterfeit pharmaceuticals .
While this problem has been compounded by the COVID-19 global pandemic, the reality is that each country needs to develop more than adequate laws. They need to develop a comprehensive national strategy, internationally harmonized, by taking into account the seriousness of the current health crisis . However, even countries with a highly evolved drug regulatory system may find it challenging to design and implement appropriate strategies to combat this problem in the time of the pandemic . Towards this approach all actions and measures, in order to be successful, should include a whole of government and society approach and strong political will to implement robust regulations that overcome difficulties . Building collaborations between countries, governments, organizations, public agencies, researchers and private sector are very essential . Producers and governments should be active and work closely together either by improving investment capital and infrastructure to encourage small-and medium-sized drug manufacturing companies to meeting international standards or by supporting producers to develop techniques that improve the tracking and tracing of their products . International regulatory agencies should all work to strengthen national and international pharmaceutical governance, to ensure adequate funding for monitoring distribution of falsified products and to initiate and/or assist in coordinating the information-sharing process . Moreover, high-income countries need to support low-and middle income countries in research and training . Enhanced global cooperation can also help countries secure critical medicines, especially in light of challenges caused by border closures .
The pharmaceutical industry should be fully involved in the fight against falsified drugs especially during the age of COVID-19. One way is by making the prices of authentic medical products more affordable especially in low-and middle-income countries . Moreover, security of supply chains should be ensured through implementation of good distribution and warehousing practice . Furthermore, it is very important to diversify the sources of pharmaceutical supply to ensure continuity of supply across the globe . For this reason there are ongoing industry efforts to support initiatives to maximize domestic productions of raw materials to prevent disruption to the supply chain in the future . The risk of disruptions in the supply chains could be alleviated by the globally distributed manufacture so that when a crisis affects supply in one part of the world, the rest of the world could make amends for the lost production by increasing theirs . Furthermore, in order to preserve a strong and secure supply chain, transparency is needed. Meaning that regulators need to monitor manufacturing sites of medicines and ingredients and keep track of their route through the supply chain in order to ensure that the supply of quality medicines is not being jeopardized by sudden disruptions . Unfortunately, for the time being, this information is restricted and inconsistent . As a result efforts should be made towards increasing transparency across the supply chain globally.
Another tool in combating fake drugs and pharmaceuticals is raising public awareness, through educational campaigns, regarding medicine quality and the risks generated from using counterfeit health products . In Table 1, are presented the guidelines given by the INTERPOL for safely buying prescription medications . At this point, it should be highlighted that this advice largely applies to Prescription Only Medications (POM). Other classes of medications exist, such as in the UK there is also Pharmacy only medications (P) which can be dispensed by pharmacist without a prescription and General Sales List (GSL) which can be bought from pharmacies and supermarkets in some countries . Moreover, the issue of weak governance in many countries causes the dangerous practice of allowing non-trained individuals who are not pharmacist or pharmacy technicians to be allowed to work in pharmacies and dispense medications. Therefore, it is very important people not only to be educated in safely purchasing medicines and medical supplies but also in recognizing pharmacists as the best suited individuals to provide trusted advice regarding medications . Furthermore, people should be educated in distinguishing data based information from assertions without evidence to back them up especially in medical related cases . Such assertions could only confuse the general public and make people lose confidence to health care systems and science.
In achieving the goal of eradicating fake pharmaceuticals trade, one should take into consideration the implementation of appropriate detection technologies to enable easy, quick and accurate identification of counterfeit or authentic products . These technologies are not only an effective tool in protecting public health through detection but also in generating useful data mostly needed to quantify and evaluate the problem . Therefore, countries need to invest in research and technologies focused in the detection of counterfeit drugs and pharmaceuticals, not only for identifying and eliminating them from the market but also for providing stakeholders with valuable and reliable information for policymaking. It should be mentioned that all medicines are not possible to be tested analytically to verify authenticity or falsification. The first step is a medicine to be identified as dubious by its appearance or by the reporting of adverse health effects or internationally observed trends in falsified medicines. The next step is the suspicious medicine to be tested with analytical procedures . It becomes obvious that in detecting counterfeit medical products not only technologies are useful but also having adequate reflexes in information exchange, in national and international level, in order data in incidences, trends, adverse effects and seizures of counterfeits to be shared fast enough to save lives by preventing them from flooding the market.
Conclusion
It is more than clear that there is an imperative need for targeted actions from prevention to suppression. The first essential step is ceasing counterfeit products from entering the supply chain. Should that not be fulfilled, measures targeting effective detection of circulating counterfeit pharmaceuticals must follow. Finally and foremost specific responses should address this health threatening matter, in multiple levels with the cooperation of all involved actors.
On a national level, governments have been cooperating with industry to combat counterfeit trafficking, yet this cooperation can be fortified and intensified with decisive initiatives. Actions must be taken towards robust legislative measures in order to strengthen regulatory capacity. Enforcement measures and local surveillances are essential tools to control the infiltration of fake products in the pharmaceutical market. Furthermore, the involvement of science through research in the field of falsified medicines, as well as the society as a whole through raising public awareness could create a more comprehensive approach. On an international level, many initiatives are underway to tackle the growing trend, underlining the necessity for transnational actions. One cannot emphasize enough the need for international cooperation, harmonized pharmaceutical governance and strategies. Only collaboration and initiatives between countries can lead to solutions that can effectively restrict the proliferation of counterfeit pharmaceuticals.
In the age of COVID-19 pandemic the sudden and growing need for specific medical supplies in combination with the constant disruption of the supply chain processes had worsen the situation. It was highlighted that now more than ever policy makers and regulators should support internationally harmonized strategies, collaborations and investments more concentrated on assuring that quality medical products are being accessible to the general public in each country. Towards this direction useful tools would be the use of advanced technologies, the increase of manufacturing sites around the world as well as the enhancement of domestic manufacturing for the production of medical products in order to build a resilient supply chain to global crises or local disasters. Moreover, efforts should be focusing on close monitoring the processes of manufacture and sale thus creating a transparent and secure supply chain, globally. The pandemic also emphasized the necessity for robust educational campaigns in order to inform the public about the risks of using counterfeit drugs and to restore faith to pharmaceutical industry and science.
Considering all the aforementioned describing the situation before and during the pandemic, it was made obvious that the synergy between stakeholders in an international level is the key to viable solutions, and the implementation of a targeted holistic approach is the path to be followed. While all the above, may not fully eliminate the problem, they should substantially reduce the exposure of populations to the risks associated with the trafficking and use of counterfeit drugs and pharmaceuticals, in the time of COVID-19 and beyond.
Conflict of interest
The authors declare no conflict of interest for the submitted manuscript entitled: "Trends in counterfeit drugs and pharmaceuticals before and during COVID-19 pandemic". Table 1 Guidelines for potential consumers as were given by the INTERPOL .
Never buy
Only buy From unknown websites or in a marketplace Medicines prescribed by doctors From pharmacies making promises like "too good to be true", "cures all types" of a major illness, "moneyback guarantee", or "no risk" From websites that require prescription and have authenticity certificate Substantially cheaper product, it is likely to be a fake After checking the price against usually bought products from reputable providers If the product contains different ingredients, claims to have different properties, has a different shape, is not correctly labeled, has an out-of-date or missing expiry date, or the packaging looks badly made After comparing the medicine against the usually prescribed one |
/**
* {@link RepositoryValidator Validator} checking that repositories are valid.
*
* @author Sebastien Gerard
*/
@Component
public class GlobalRepositoryValidator implements RepositoryValidator<RepositoryEntity> {
/**
* Validation message key specifying that the repository name is not unique.
*/
public static final String NAME_NOT_UNIQUE = "validation.repository.name-not-unique";
private final RepositoryManager repositoryManager;
public GlobalRepositoryValidator(RepositoryManager repositoryManager) {
this.repositoryManager = repositoryManager;
}
@Override
public boolean support(RepositoryEntity repositoryEntity) {
return true;
}
@Override
public Mono<ValidationResult> beforePersist(RepositoryEntity repositoryEntity) {
return repositoryManager
.findAll()
.filter(repo -> Objects.equals(repo.getName(), repositoryEntity.getName()))
.collectList()
.map(conflicts -> {
if (!conflicts.isEmpty()) {
return ValidationResult.singleMessage(new ValidationMessage(NAME_NOT_UNIQUE, repositoryEntity.getName()));
} else {
return ValidationResult.EMPTY;
}
});
}
} |
// Test that when both OnPaused and OnUnrecoverableError attempt to delete PageSync, only one is
// triggered.
TEST_F(PageSyncImplTest, AvoidDoubleDeleteOnDownloadError) {
bool ready_to_delete = false;
auto delete_callback = [this, &ready_to_delete] {
ASSERT_NE(page_sync_, nullptr);
if (ready_to_delete) {
page_sync_.reset();
}
};
page_sync_->SetOnPaused(delete_callback);
page_sync_->SetOnUnrecoverableError(delete_callback);
StartPageSync();
RunLoopUntilIdle();
ready_to_delete = true;
page_sync_->SetDownloadState(DownloadSyncState::DOWNLOAD_PERMANENT_ERROR);
ASSERT_EQ(page_sync_, nullptr);
} |
Dual Use of an Arterio-Venous Fistula for Total Parentral Nutrition and Haemodialysis: Potential and Pitfalls
Introduction: We present the dual use of an arteriovenous fistula (AVF) for contemporaneous administration of home parenteral nutrition (PN), and hemodialysis (HD). Case Report: A 52 year old female patient required PN due to short bowel syndrome, following extensive resection for ischemic bowel. After she was rendered dialysis dependent secondary to multifactorial renal failure, a left forearm basilica vein transposition onto the radial artery was undertaken. Venous access for PN was problematic. We commenced home PN via the AVF, using a ‘buttonhole’ technique to cannulate the fistula for both HD and PN. The peripheral administration of PN necessitated reduction in the osmolality, with larger volumes and longer administration times. This required adjustment of the HD regime to compensate.The patient received simultaneous PN and HD at home through the AVF successfully for seven weeks. Unfortunately after this time she suffered a staphylococcal fistula infection with septicemia. Discussion: We have shown that dual use of AVF for HD and PN is feasible, although not without risk. Reduction of osmolality and staggering of PN and HD sessions is required, with administration of PN over longer times. It has been shown that the buttonhole cannulation technique has a higher rate of infection than alternatives, and we propose this may have contributed to our patient’s complication. We believe this report would be helpful if dual use of AVF for PN and HD is contemplated. *Corresponding author: Kirby GC, Department of Vascular Surgery, Royal Stoke University Hospital, Newcastle Road, Stoke-on-Trent, UK, Tel: 447973939753; E-mail: [email protected] Received January 31, 2017; Accepted February 16, 2017; Published February 26, 2017 Citation: Kirby GC, Meecham L, Evans RPT, Wessels J, Asquith JR, et al. (2017) Dual Use of an Arterio-Venous Fistula for Total Parentral Nutrition and Haemodialysis: Potential and Pitfalls. Med Rep Case Stud 2: 128. doi: 10.4172/2572-5130.1000128 Copyright: © 2017 Kirby GC, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. sided renovascular disease and renal artery thrombosis, and duplex left collecting system. She underwent left nephrostomy insertion for presumed distal obstruction, which was complicated by bleeding requiring renal angiogram and embolization of the lower pole of the kidney, resulting in further decline in her renal function. Rendered end stage and dialysis dependent, she received HD initially via left internal jugular vein Terumo catheter, and subsequently left forearm arteriovenous fistula. We performed left forearm basilic vein transposition on to the radial artery. This was accessed for HD using a buttonhole technique, for six months. Venous access for electrolyte replacement and PN was carried out through right internal jugular vein tunnelled Hickman line. After failure of the catheter due to line fracture, there was much discussion about the best route for access. Reinsertion in the neck was avoided due to right internal jugular vein stenosis and left innominate vein narrowing, as a result of the previous lines, including the initial tunnelled HD catheters. PN via the AVF was introduced as an inpatient. Buttonholes were maintained for HD, and a new buttonhole was created for Citation: Kirby GC, Meecham L, Evans RPT, Wessels J, Asquith JR, et al. (2017) Dual Use of an Arterio-Venous Fistula for Total Parentral Nutrition and Haemodialysis: Potential and Pitfalls. Med Rep Case Stud 2: 128. doi: 10.4172/2572-5130.1000128
Introduction
Long term home parenteral nutrition (HPN), is an integral part of the management of intestinal failure, for disorders such as short bowel syndrome, and inflammatory bowel disease . Venous access for these patients is vital for their care, but can prove problematic. There is limited discussion in the literature of utilisation of surgically created arteriovenous fistulae (AVF) for therapies other than hemodialysis (HD). However it has been shown to be feasible to administer HPN via this route .
A small study has observed the infection rates for AVF used for parenteral nutrition to be lower than that for central venous catheters, with slightly higher occlusion rates . Whilst there is very limited experience of dual use of an AVF for concurrent parenteral nutrition (PN) and HD in the literature, a case series of three patients has shown successful application of HD and HPN via AVF, without complication, for between one and twenty months .
We aim to assess the potential of using AVF for HPN and HD. We report our experiences, and in particular techniques we used and lessons learnt which could help clinicians considering this technique for their patients in the future, illustrated by a case report.
Case Report
We present the case of a 52 year old female, who required HPN and concurrent home HD. Having suffered acute bowel ischemia, she underwent extensive small bowel resection and right hemicolectomy seven years prior to presentation, leaving her with 110 cm of small bowel, an ileostomy and mucus fistula. She was initially dependent on fluid and magnesium infusions, and subsequently required HPN.
The aetiology of renal failure was multifactorial. She had right sided renovascular disease and renal artery thrombosis, and duplex left collecting system. She underwent left nephrostomy insertion for presumed distal obstruction, which was complicated by bleeding requiring renal angiogram and embolization of the lower pole of the kidney, resulting in further decline in her renal function.
Rendered end stage and dialysis dependent, she received HD initially via left internal jugular vein Terumo catheter, and subsequently left forearm arteriovenous fistula. We performed left forearm basilic vein transposition on to the radial artery. This was accessed for HD using a buttonhole technique, for six months.
Venous access for electrolyte replacement and PN was carried out through right internal jugular vein tunnelled Hickman line. After failure of the catheter due to line fracture, there was much discussion about the best route for access. Reinsertion in the neck was avoided due to right internal jugular vein stenosis and left innominate vein narrowing, as a result of the previous lines, including the initial tunnelled HD catheters.
PN via the AVF was introduced as an inpatient. Buttonholes were maintained for HD, and a new buttonhole was created for It is recommended that the osmolality of PN is reduced when given peripherally, to reduce the incidence of thrombophlebitis . In our institution the PN used in provided by Fresenius Kabi Ltd, Runcorn, UK. Following the manufacturer recommendations for parenteral nutrition, the osmolality was reduced from 1100 mOSm/l to 930 mOsm/L. This required the reduction in calories from carbohydrate, and the increase in volume from the usual regime of 1.5 litres to 2.2 litres. The increased volume required a longer administration time of 16 hours per infusion.
The feeding and dialysis regimes were designed to not coincide, preventing loss of nutritional value. PN was administered five times a week: twice nocturnally and three times during the day, with haemodialysis four times a week, for three and a half hours. A siliconized vascular access catheter (Nipro Medical Europe, Belgium) was used, as the soft nature is both more comfortable for the patient, and reduces the risk of inadvertent injury to the fistula during nocturnal use.
During this time the patient had a fluid restriction of one litre orally in 24 hours. HD was recalibrated to dialyse off the additional volume of PN. HD was performed using a FX100 dialyser with a Fresenius 5008 machine. After seven weeks unfortunately HD and peripheral PN was complicated by a fistula infection, with staphylococcus septicaemia and metastatic pulmonary deposits which was managed with intravenous antibiotics, and surgical refashioning of the fistula.
Subsequently PN was recommenced via a temporary groin line, and the AVF was used for HD. Thereafter venoplasty of the stenosed right internal jugular vein allowed further central venous catheter placement for ongoing PN.
Currently the patient is being worked up for renal transplant, and restoration of bowel continuity. The original left forearm AVF continues to function well for HD.
Discussion
We have proven contemporaneous administration of PN and HD via AVF is feasible, and in patients who do not have alternative venous access may be provide a useful extra route for patients with renal and intestinal failure. Additional considerations for utilization of an AVF in this manner are the reduction in osmolality of parenteral nutrition to allow peripheral administration, timing of HD and HPN, and the use of a siliconised catheter for nocturnal use. Dual use of AVF is not without risk. Our case demonstrates the potential for infection of the fistula. In retrospect the likely causative factor in the fistula infection was use of a 'buttonhole' technique for administration of the PN. It has been suggested that there is an increased risk of infective complications using this cannulation method . We would suggest use of a 'rope ladder' technique for future delivery. |
/**
* Run multiple database insert/update/delete queries
*
* @param sql - string sql statement
* @param params - optional array[][] of substitution variables to be applied to the sql string to create batch of statements
* @return int array with number of rows inserted, updated or deleted for each sql statement
* @throws SQLException sqlException
*/
public static int[] bulkUpdate(String sql, Object[]... params) throws SQLException {
int[] affectedRows = null;
try {
createConn();
if (params == null) {
affectedRows = run.batch(conn, sql, new Object[][]{{}});
} else {
affectedRows = run.batch(conn, sql, params);
}
} catch (SQLException e) {
if (conn != null) {
conn.rollback();
}
throw e;
} finally {
if (conn != null && !keepConnection)
DbUtils.commitAndClose(conn);
}
return affectedRows;
} |
#include<stdio.h>
int main()
{
int i;
long a[4],sum,end[3],t;
while(scanf("%ld%ld%ld%ld",a,a+1,a+2,a+3)!=EOF)
{
sum=0;
for(i=0;i<=3;i++)
sum+=a[i];
for(i=0;i<=3;i++)
if(sum==3*a[i])
{
t=a[i];
a[i]=a[3];
a[3]=t;
}
end[0]=-(a[0]-a[1]-a[2])/2;
end[1]=-(a[1]-a[0]-a[2])/2;
end[2]=-(a[2]-a[0]-a[1])/2;
printf("%ld %ld %ld\n",end[0],end[1],end[2]);
}
return 0;
}
|
<reponame>eurosecom/Attendance
package com.eusecom.attendance;
import android.support.annotation.NonNull;
import android.support.multidex.MultiDexApplication;
import com.eusecom.attendance.dagger.components.ApplicationComponent;
import com.eusecom.attendance.dagger.components.DaggerApplicationComponent;
import com.eusecom.attendance.dagger.components.DaggerDemoComponent;
import com.eusecom.attendance.dagger.components.DemoComponent;
import com.eusecom.attendance.dagger.components.DgFirebaseSubComponent;
import com.eusecom.attendance.dagger.modules.ApplicationModule;
import com.eusecom.attendance.dagger.modules.DgFirebaseSubModule;
import com.eusecom.attendance.mvvmdatamodel.CompaniesDataModel;
import com.eusecom.attendance.mvvmdatamodel.CompaniesIDataModel;
import com.eusecom.attendance.mvvmdatamodel.EmployeeDataModel;
import com.eusecom.attendance.mvvmdatamodel.EmployeeIDataModel;
import com.eusecom.attendance.mvvmschedulers.ISchedulerProvider;
import com.eusecom.attendance.mvvmschedulers.SchedulerProvider;
import com.eusecom.attendance.rxbus.RxBus;
import com.google.firebase.database.DatabaseReference;
import com.google.firebase.database.FirebaseDatabase;
import com.squareup.leakcanary.LeakCanary;
import io.realm.RealmConfiguration;
import io.realm.Realm;
public class AttendanceApplication extends MultiDexApplication {
public RxBus _rxBus;
@NonNull
private final CompaniesIDataModel mCompaniesDataModel;
@NonNull
private final EmployeeIDataModel mEmployeeDataModel;
@NonNull
private DatabaseReference mDatabaseReference;
private Realm mRealm;
@Override public void onCreate() {
super.onCreate();
if (LeakCanary.isInAnalyzerProcess(this)) {
// This process is dedicated to LeakCanary for heap analysis.
// You should not init your app in this process.
return;
}
LeakCanary.install(this);
// Normal app init code...
mDatabaseReference = FirebaseDatabase.getInstance().getReference();
RealmConfiguration realmConfiguration = new RealmConfiguration.Builder(this)
.name(Realm.DEFAULT_REALM_NAME)
.schemaVersion(0)
.deleteRealmIfMigrationNeeded()
.build();
Realm.setDefaultConfiguration(realmConfiguration);
//dagger demo retrofit
// specify the full namespace of the component
// Dagger_xxxx (where xxxx = component name)
mApplicationComponent = DaggerApplicationComponent.builder()
.applicationModule(new ApplicationModule(this))
.build();
mDgFirebaseSubComponent = createDgFirebaseSubComponent();
}
private static AttendanceApplication instance;
public AttendanceApplication() {
mCompaniesDataModel = new CompaniesDataModel();
mEmployeeDataModel = new EmployeeDataModel();
}
public static AttendanceApplication getInstance() {
if (instance== null) {
instance = new AttendanceApplication();
}
// Return the instance
return instance;
}
public RxBus getRxBusSingleton() {
if (_rxBus == null) {
_rxBus = new RxBus();
}
return _rxBus;
}
@NonNull
public Realm getRealm() {
return Realm.getDefaultInstance();
}
@NonNull
public CompaniesIDataModel getCompaniesDataModel() {
return mCompaniesDataModel;
}
@NonNull
public EmployeeIDataModel getEmployeeDataModel() {
return mEmployeeDataModel;
}
@NonNull
public ISchedulerProvider getSchedulerProvider() {
return SchedulerProvider.getInstance();
}
@NonNull
public DatabaseReference getDatabaseFirebaseReference() {
return mDatabaseReference;
}
@NonNull
public EmployeeMvvmViewModel getEmployeeMvvmViewModel() {
return new EmployeeMvvmViewModel(getEmployeeDataModel(), getSchedulerProvider());
}
@NonNull
public CompaniesMvvmViewModel getCompaniesMvvmViewModel() {
return new CompaniesMvvmViewModel(getCompaniesDataModel(), getSchedulerProvider());
}
//dagger2 get components created in onCreate method
private ApplicationComponent mApplicationComponent;
public ApplicationComponent getApplicationComponent() {
return mApplicationComponent;
}
public DgFirebaseSubComponent mDgFirebaseSubComponent;
public DgFirebaseSubComponent getDgFirebaseSubComponent() {
return mDgFirebaseSubComponent;
}
public DgFirebaseSubComponent createDgFirebaseSubComponent(){
DgFirebaseSubComponent.Builder builder = (DgFirebaseSubComponent.Builder)
this.getApplicationComponent()
.subcomponentBuilders()
.get(DgFirebaseSubComponent.Builder.class)
.get();
mDgFirebaseSubComponent = builder.activityModule(new DgFirebaseSubModule()).build();
return mDgFirebaseSubComponent;
}
private final DemoComponent dgaeacomponent = createDgAeaComponent();
protected DemoComponent createDgAeaComponent() {
return DaggerDemoComponent.builder()
.applicationModule(new ApplicationModule(this))
.build();
}
public DemoComponent dgaeacomponent() {
return dgaeacomponent;
}
}
|
<filename>cmd/kubeadm/app/cmd/alpha/certs_test.go
/*
Copyright 2018 The Kubernetes Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package alpha
import (
"crypto/rand"
"crypto/rsa"
"crypto/x509"
"crypto/x509/pkix"
"fmt"
"math/big"
"os"
"strings"
"testing"
"time"
"github.com/spf13/cobra"
kubeadmconstants "k8s.io/kubernetes/cmd/kubeadm/app/constants"
"k8s.io/kubernetes/cmd/kubeadm/app/phases/certs"
certstestutil "k8s.io/kubernetes/cmd/kubeadm/app/util/certs"
"k8s.io/kubernetes/cmd/kubeadm/app/util/pkiutil"
testutil "k8s.io/kubernetes/cmd/kubeadm/test"
cmdtestutil "k8s.io/kubernetes/cmd/kubeadm/test/cmd"
)
func TestCommandsGenerated(t *testing.T) {
expectedFlags := []string{
"cert-dir",
"config",
"use-api",
}
expectedCommands := []string{
"renew all",
"renew apiserver",
"renew apiserver-kubelet-client",
"renew apiserver-etcd-client",
"renew front-proxy-client",
"renew etcd-server",
"renew etcd-peer",
"renew etcd-healthcheck-client",
}
renewCmd := newCmdCertsRenewal()
fakeRoot := &cobra.Command{}
fakeRoot.AddCommand(renewCmd)
for _, cmdPath := range expectedCommands {
t.Run(cmdPath, func(t *testing.T) {
cmd, rem, _ := fakeRoot.Find(strings.Split(cmdPath, " "))
if cmd == nil || len(rem) != 0 {
t.Fatalf("couldn't locate command %q (%v)", cmdPath, rem)
}
for _, flag := range expectedFlags {
if cmd.Flags().Lookup(flag) == nil {
t.Errorf("couldn't find expected flag --%s", flag)
}
}
})
}
}
func TestRunRenewCommands(t *testing.T) {
tests := []struct {
command string
baseNames []string
caBaseNames []string
}{
{
command: "all",
baseNames: []string{
kubeadmconstants.APIServerCertAndKeyBaseName,
kubeadmconstants.APIServerKubeletClientCertAndKeyBaseName,
kubeadmconstants.APIServerEtcdClientCertAndKeyBaseName,
kubeadmconstants.FrontProxyClientCertAndKeyBaseName,
kubeadmconstants.EtcdServerCertAndKeyBaseName,
kubeadmconstants.EtcdPeerCertAndKeyBaseName,
kubeadmconstants.EtcdHealthcheckClientCertAndKeyBaseName,
},
caBaseNames: []string{
kubeadmconstants.CACertAndKeyBaseName,
kubeadmconstants.FrontProxyCACertAndKeyBaseName,
kubeadmconstants.EtcdCACertAndKeyBaseName,
},
},
{
command: "apiserver",
baseNames: []string{kubeadmconstants.APIServerCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.CACertAndKeyBaseName},
},
{
command: "apiserver-kubelet-client",
baseNames: []string{kubeadmconstants.APIServerKubeletClientCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.CACertAndKeyBaseName},
},
{
command: "apiserver-etcd-client",
baseNames: []string{kubeadmconstants.APIServerEtcdClientCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.EtcdCACertAndKeyBaseName},
},
{
command: "front-proxy-client",
baseNames: []string{kubeadmconstants.FrontProxyClientCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.FrontProxyCACertAndKeyBaseName},
},
{
command: "etcd-server",
baseNames: []string{kubeadmconstants.EtcdServerCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.EtcdCACertAndKeyBaseName},
},
{
command: "etcd-peer",
baseNames: []string{kubeadmconstants.EtcdPeerCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.EtcdCACertAndKeyBaseName},
},
{
command: "etcd-healthcheck-client",
baseNames: []string{kubeadmconstants.EtcdHealthcheckClientCertAndKeyBaseName},
caBaseNames: []string{kubeadmconstants.EtcdCACertAndKeyBaseName},
},
}
renewCmds := getRenewSubCommands()
for _, test := range tests {
t.Run(test.command, func(t *testing.T) {
tmpDir := testutil.SetupTempDir(t)
defer os.RemoveAll(tmpDir)
caCert, caKey := certstestutil.SetupCertificateAuthorithy(t)
for _, caBaseName := range test.caBaseNames {
if err := pkiutil.WriteCertAndKey(tmpDir, caBaseName, caCert, caKey); err != nil {
t.Fatalf("couldn't write out CA: %v", err)
}
}
certTmpl := x509.Certificate{
Subject: pkix.Name{
CommonName: "test-cert",
Organization: []string{"sig-cluster-lifecycle"},
},
DNSNames: []string{"test-domain.space"},
SerialNumber: new(big.Int).SetInt64(0),
NotBefore: time.Now().Add(-time.Hour * 24 * 365),
NotAfter: time.Now().Add(-time.Hour),
KeyUsage: x509.KeyUsageKeyEncipherment | x509.KeyUsageDigitalSignature,
ExtKeyUsage: []x509.ExtKeyUsage{x509.ExtKeyUsageClientAuth},
}
key, err := rsa.GenerateKey(rand.Reader, 2048)
if err != nil {
t.Fatalf("couldn't generate private key: %v", err)
}
certDERBytes, err := x509.CreateCertificate(rand.Reader, &certTmpl, caCert, key.Public(), caKey)
if err != nil {
t.Fatalf("couldn't generate private key: %v", err)
}
cert, err := x509.ParseCertificate(certDERBytes)
if err != nil {
t.Fatalf("couldn't generate private key: %v", err)
}
for _, baseName := range test.baseNames {
if err := pkiutil.WriteCertAndKey(tmpDir, baseName, cert, key); err != nil {
t.Fatalf("couldn't write out initial certificate")
}
}
cmdtestutil.RunSubCommand(t, renewCmds, test.command, fmt.Sprintf("--cert-dir=%s", tmpDir))
for _, baseName := range test.baseNames {
newCert, newKey, err := pkiutil.TryLoadCertAndKeyFromDisk(tmpDir, baseName)
if err != nil {
t.Fatalf("couldn't load renewed certificate: %v", err)
}
certstestutil.AssertCertificateIsSignedByCa(t, newCert, caCert)
pool := x509.NewCertPool()
pool.AddCert(caCert)
_, err = newCert.Verify(x509.VerifyOptions{
DNSName: "test-domain.space",
Roots: pool,
KeyUsages: []x509.ExtKeyUsage{x509.ExtKeyUsageClientAuth},
})
if err != nil {
t.Errorf("couldn't verify renewed cert: %v", err)
}
switch pubKey := newCert.PublicKey.(type) {
case *rsa.PublicKey:
if pubKey.N.Cmp(newKey.(*rsa.PrivateKey).N) != 0 {
t.Error("private key does not match public key")
}
default:
t.Errorf("unknown public key type %T", newCert.PublicKey)
}
}
})
}
}
func TestRenewUsingCSR(t *testing.T) {
tmpDir := testutil.SetupTempDir(t)
defer os.RemoveAll(tmpDir)
cert := &certs.KubeadmCertEtcdServer
renewCmds := getRenewSubCommands()
cmdtestutil.RunSubCommand(t, renewCmds, cert.Name, "--csr-only", "--csr-dir="+tmpDir)
if _, _, err := pkiutil.TryLoadCSRAndKeyFromDisk(tmpDir, cert.BaseName); err != nil {
t.Fatalf("couldn't load certificate %q: %v", cert.BaseName, err)
}
}
|
/**
* Checks whether all qualifiers occur only the allowed number of times
* within one resource.
*
* @throws KWQLConstraintViolationException
* the KWQL constraint violation exception
*/
private void validateQualifierCount()
throws KWQLConstraintViolationException {
for (ArrayList<String> qualifierList : qualifierInstances) {
qualifierList.retainAll(qualifierInstancesC);
if (!qualifierList.isEmpty()) {
for (String qualifier : qualifierInstancesC) {
if (qualifierList.lastIndexOf(qualifier) != qualifierList
.indexOf(qualifier)) {
setValid(false);
ArrayList<String> cause = new ArrayList<String>();
cause.add(qualifier);
throw new KWQLConstraintViolationException('n', cause);
}
}
}
}
} |
Relationship of Big 5 Personality Traits on Counterproductive Work Behaviour
Counterproductive Work Behaviour is an important phenomena impacting the healthy functioning of any organization. It’s a barrier to the goal achievement and impacts the business interest negatively. It is varied along two dimensions-Organization & People. Personality to an extent impacts organizational performance. The study aims at
linking Big5 Personality traits to CWB. The counterproductive behaviour is a costly phenomenon which occurs in organizations putting it into a risk every year. Research shows that personality traits acts as antecedents for CWB . Emotional stability, Conscientiousness and agreeableness sounds as important antecedents for CWB. |
def swap(self, node1: AbstractNode, node2: AbstractNode) -> None:
pass |
from .abc import (
Storer,
)
class NaiveStorer(Storer):
def store(self) -> None:
pass
|
International Talk Like a Pirate Day is Sept 19 ... which always gets me thinking and wondering about modern-day pirates. Most movies usually focus on pirates from the Golden Age of piracy (a couple hundred years ago), when pirates typically stole ships and booty (treasure). But modern day pirates usually board a ship, and then hold it for ransom. They don't want the ship, or the stuff it's hauling - they want cold/hard cash! You might be surprised to learn that there is quite a bit of piracy going on these days (over 100 attacks per year), and there's a veritable treasure trove of data about the attacks.
But before we get to analyzing that data, here's a picture of a few of the guests at my very first Talk Like a Pirate party, back in 2005. These folks certainly knew how to put the "Arrr" in pArrrty! (Thanks Mary, Marlene, Linda, and of course Captain Kirk!)
Now, let's analyze some pirate data! ... A special division of the International Chamber of Commerce, called the Commercial Crime Services, maintains a database of all the pirate attacks, and has a webpage where you can view them on a Google satellite map. It's a decent page, and I like that you can zoom in to see exactly where the attacks have occurred, and then click the markers to see all the details. Here's a screen capture:
I learned a lot about the pirate data on their page, but I kept thinking of ways I might could use SAS to analyze the data in additional ways (as you probably recall, I always recommend visualizing the same data in several different ways, to better understand it). So I set sail on a journey to create my own analysis. The first step was to parse the data out of the html on their web page. Their html was all one long line, which made it a bit tricky to handle ... so I enlisted the help of data-meister Rick Langston. After Rick helped me get the data read in, I was able to start analyzing the data with ramming speed!
Below is an image of my map - you can click it to see the full size interactive version with the HTML mouse-over text, and drilldowns to the incident reports.
The full/wide map has to get squeezed-in (resized) a lot to fit in the blog space, so here's a little subset you can hopefully see at full size:
Here are a few of the enhancements and improvements in my map:
The land & water are light colors, so they don't compete with the pirate-attack markers.
The map is clearly labeled '2017' (whereas the original map had '2016' in the text paragraph).
I include a pirate flag, so you immediately know the map has something to do with pirates.
I use three color categories instead of five.
I used smaller markers, so they don't overlap as much.
And you can hover your mouse over the land areas, to see the country names.
But a map just doesn't give you a concept of timing. For example, did these attacks happen randomly throughout the year, or were they clustered curing a certain months or seasons? To help answer this type of question, I calculated the cumulative total, and created a plot of that data. Looking at the graph, it seems that the rate of attacks is pretty steady, except for a slowdown during the month of July:
And how did that compare to the year before? ... About the same, except last year's slowdown was mid-May to mid-June:
The map & plot provide a pretty good visual representation of the data, but what about a good-old table? Sometimes a table of all the values is very useful. The original webpage had a table report, but it only shows a the most recent handful of incidents. I provide a table of all the incidents in my version. Note that I colored the cells in the table using the same colors as the plot markers, and I made the incident report number a drilldown link to the incident report. Here's a screen-capture of a portion of my table (click it to see the full table).
I use a lot of pretty cool tricks to create these graphs & table, and if you'd like to have a look at the SAS code, click this link.
Now for a fun question - what's your favorite pirate movie? Arrr!!! b-) |
package cmd
/*
Copyright 2018 Crunchy Data Solutions, Inc.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
import (
"encoding/json"
"fmt"
log "github.com/Sirupsen/logrus"
msgs "github.com/crunchydata/postgres-operator/apiservermsgs"
"github.com/crunchydata/postgres-operator/pgo/api"
"io/ioutil"
"os"
)
type IngestConfigFile struct {
WatchDir string `json:"WatchDir"`
DBHost string `json:"DBHost"`
DBPort string `json:"DBPort"`
DBName string `json:"DBName"`
DBSecret string `json:"DBSecret"`
DBTable string `json:"DBTable"`
DBColumn string `json:"DBColumn"`
MaxJobs int `json:"MaxJobs"`
PVCName string `json:"PVCName"`
SecurityContext string `json:"SecurityContext"`
}
func createIngest(args []string) {
if len(args) == 0 {
fmt.Println("Error: An ingest name argument is required.")
return
}
r, err := parseRequest(IngestConfig, args[0])
if err != nil {
fmt.Println("Error: Problem parsing ingest configuration file.")
fmt.Println("Error: ", err)
return
}
response, err := api.CreateIngest(httpclient, &SessionCredentials, &r)
if err != nil {
fmt.Println("Error: " + err.Error())
os.Exit(2)
}
if response.Status.Code == msgs.Ok {
fmt.Println("Created ingest.")
} else {
fmt.Println("Error: ", response.Status.Msg)
os.Exit(2)
}
}
func deleteIngest(args []string) {
log.Debugf("deleteIngest called %v\n", args)
for _, v := range args {
response, err := api.DeleteIngest(httpclient, v, &SessionCredentials)
if err != nil {
fmt.Println("Error: ", response.Status.Msg)
os.Exit(2)
}
if response.Status.Code == msgs.Ok {
if len(response.Results) == 0 {
fmt.Println("No ingests found.")
return
}
for k := range response.Results {
fmt.Println("Deleted ingest " + response.Results[k])
}
} else {
fmt.Println("Error: ", response.Status.Msg)
os.Exit(2)
}
}
}
func showIngest(args []string) {
log.Debugf("showIngest called %v\n", args)
for _, v := range args {
response, err := api.ShowIngest(httpclient, v, &SessionCredentials)
if err != nil {
fmt.Println("Error: " + err.Error())
os.Exit(2)
}
if response.Status.Code == msgs.Error {
fmt.Println("Error: " + response.Status.Msg)
os.Exit(2)
}
if len(response.Details) == 0 {
fmt.Println("no ingests found")
return
}
log.Debugf("response = %v\n", response)
for _, d := range response.Details {
showIngestItem(&d)
}
}
}
func showIngestItem(detail *msgs.ShowIngestResponseDetail) {
fmt.Printf("%s%s\n", "", "")
fmt.Printf("%s%s\n", "", "pgingest : "+detail.Ingest.Spec.Name)
fmt.Printf("%s%s\n", TreeBranch, "name : "+detail.Ingest.Spec.Name)
fmt.Printf("%s%s\n", TreeBranch, "watchdir : "+detail.Ingest.Spec.WatchDir)
fmt.Printf("%s%s\n", TreeBranch, "dbhost : "+detail.Ingest.Spec.DBHost)
fmt.Printf("%s%s\n", TreeBranch, "dbport : "+detail.Ingest.Spec.DBPort)
fmt.Printf("%s%s\n", TreeBranch, "dbname : "+detail.Ingest.Spec.DBName)
fmt.Printf("%s%s\n", TreeBranch, "dbsecret : "+detail.Ingest.Spec.DBSecret)
fmt.Printf("%s%s\n", TreeBranch, "dbtable : "+detail.Ingest.Spec.DBTable)
fmt.Printf("%s%s\n", TreeBranch, "dbcolumn : "+detail.Ingest.Spec.DBColumn)
fmt.Printf("%s%s%d\n", TreeBranch, "maxjobs : ", detail.Ingest.Spec.MaxJobs)
fmt.Printf("%s%s%d\n", TreeBranch, "Running Jobs : ", detail.JobCountRunning)
fmt.Printf("%s%s%d\n", TreeBranch, "Completed Jobs : ", detail.JobCountCompleted)
fmt.Println("")
}
func parseRequest(configFilePath, name string) (msgs.CreateIngestRequest, error) {
var err error
r := msgs.CreateIngestRequest{}
r.Name = name
raw, err := ioutil.ReadFile(configFilePath)
if err != nil {
fmt.Println("Error: ", err)
return r, err
}
c := IngestConfigFile{}
json.Unmarshal(raw, &c)
r.WatchDir = c.WatchDir
r.DBHost = c.DBHost
r.DBPort = c.DBPort
r.DBName = c.DBName
r.DBSecret = c.DBSecret
r.DBTable = c.DBTable
r.DBColumn = c.DBColumn
r.MaxJobs = c.MaxJobs
r.PVCName = c.PVCName
r.SecurityContext = c.SecurityContext
return r, err
}
|
#include<stdio.h>
int main()
{
long long int a,b,i,n;
scanf("%I64d %I64d",&a,&b);
n=a;
if(a==b)
{
printf("YES\n0\n");
return 0;
}
for(i=1;i<=100;i++){
a*=n;
if(a<b) continue;
else if(a==b)
{
printf("YES\n%I64d\n", i);
return 0;
}
else
{
printf("NO");
return 0;
}
}
return 0;
}
|
def build_readme(pages, markdown=None):
pass |
/**
* Creates a new SqlCase that wraps a list of processed when operands.
* Only the when list needs to be processed because ArpDialect - emulateNullDirection produces a
* SqlCase node of the following format:
* Case When "SqlNode" Then 1 Else 0
*
* @param orderNode the given SqlNode from the order by clause.
* @return a new SqlCase object with an updated list of when operands.
*/
private SqlNode handleSqlCase(SqlCase orderNode) {
final SqlNodeList whenOperands = orderNode.getWhenOperands();
final List<SqlNode> processedOperands = new ArrayList<>();
for (SqlNode whenOperand : whenOperands) {
processedOperands.add(processSqlNodeInOrderBy(whenOperand));
}
return new SqlCase(orderNode.getParserPosition(),
orderNode.getValueOperand(),
new SqlNodeList(processedOperands, whenOperands.getParserPosition()),
orderNode.getThenOperands(),
orderNode.getElseOperand());
} |
def register_hook_from_cfg(self, hook_cfg):
hook_cfg = hook_cfg.copy()
priority = hook_cfg.pop('priority', 'NORMAL')
hook = build(hook_cfg, HOOKS)
self.register_hook(hook, priority=priority) |
// EditCategory modifies the category fields.
func (u *BranchUsecase) EditCategory(ctx context.Context, category *entities.Category) (*entities.Category, error) {
ctx, cancelFunc := context.WithCancel(ctx)
currentUserID := ctx.Value(entities.UserIDKey).(uint)
currentUser, err := u.UserRepo.GetByID(ctx, currentUserID)
if err != nil {
log.Error(err)
cancelFunc()
return nil, errors.Wrap(err, "repository error while getting user")
}
if !currentUser.IsAdmin() {
err = errors.New("only admins are allowed to edit categories")
log.Error(err)
cancelFunc()
return nil, err
}
category, err = u.BranchRepo.EditCategory(ctx, category)
if err != nil {
log.Error(err)
cancelFunc()
return nil, errors.Wrap(err, "repository error while getting user")
}
cancelFunc()
return category, nil
} |
def create_nqueens_csp(n: int = 8) -> CSP:
csp = CSP()
variables = [f'x{i}' for i in range(1, n+1)]
for idx, variable in enumerate(variables):
csp.add_variable(variable, [(idx, i) for i in range(0, n)])
for i1, var1 in enumerate(variables):
for i2, var2 in enumerate(variables):
if i1 == i2:
continue
csp.add_binary_factor(var1, var2, lambda x, y: x[1] != y[1])
csp.add_binary_factor(var1, var2, lambda x, y: abs(x[0] - y[0]) != abs(x[1] - y[1]))
return csp |
// Free user memory pages,
// then free page-table pages.
// total_size used for checking
void free_user_mem_and_pagetables(pagetable_t pagetable, uint64 total_size)
{
debugcore("free_user_mem_and_pagetables free stack");
uvmunmap(pagetable, USER_STACK_BOTTOM - USTACK_SIZE, USTACK_SIZE / PGSIZE, TRUE);
total_size -= USTACK_SIZE;
debugcore("free_user_mem_and_pagetables free bin");
uvmunmap(pagetable, USER_TEXT_START, PGROUNDUP(total_size) / PGSIZE, TRUE);
total_size -= PGROUNDUP(total_size);
KERNEL_ASSERT(total_size==0, "");
free_pagetable_pages(pagetable);
} |
from requests import get
from webbrowser import open
open("http://google.com") |
<reponame>nodchip/icfpc2021<filename>src/visual_editor.h
#pragma once
#include <optional>
#include "contest_types.h"
struct SCanvas;
using SCanvasPtr = std::shared_ptr<SCanvas>;
struct SMouseParams;
using SMouseParamsPtr = std::shared_ptr<SMouseParams>;
struct SShowResult {
SShowResult(int key) : key(key) {}
int key = -1;
operator int() const {
return key;
}
struct SEditResult {
SSolutionPtr pose_before_edit;
SSolutionPtr pose_after_edit;
std::vector<int> moved_vertex_indices;
};
std::optional<SEditResult> edit_result;
};
struct SVisualEditor {
SCanvasPtr canvas;
const std::string window_name;
const std::string solver_name;
SMouseParamsPtr mp;
int selected_vertex_id;
SShowResult::SEditResult* edit_info = nullptr;
bool in_internal_edit_loop() const { return bool(edit_info); }
SVisualEditor(SProblemPtr problem, const std::string& solver_name, const std::string window_name);
~SVisualEditor();
int get_mouseover_node_id() const;
static void callback(int e, int x, int y, int f, void* param);
void set_oneshot_custom_stat(const std::string& stat_str);
void set_persistent_custom_stat(const std::string& stat_str);
void set_marked_indices(const std::vector<int>& marked_indices);
std::vector<int> get_marked_indices() const;
bool set_pose(SSolutionPtr pose);
SSolutionPtr get_pose() const;
void save_intermediate() const;
SShowResult show(int wait);
};
using SVisualEditorPtr = std::shared_ptr<SVisualEditor>;
SSolutionPtr visualize_and_edit(SProblemPtr problem, SSolutionPtr solution, const std::string& base_solver_name);
// vim:ts=2 sw=2 sts=2 et ci
|
Is the Corporate Tax Shifted? Empirical Evidence from Asean
The importance of the corporation income tax in overall tax revenue is as high in ASEAN member countries—Indonesia, Malaysia, the Philippines, Singapore, and Thailand—as in selected developed countries such as the United Kingdom and the United States. This article surveys available fiscal incidence studies for ASEAN members and, after a critical evaluation of their methodologies, employs a two-sector general equilibrium model in order to study the incidence of the corporation income tax in ASEAN. It concludes that, except in Singapore, the tax is borne entirely by the owners of capital in contrast to the usual presumption that the tax is shifted. The policy implication of capital across the economy bearing the corporate tax is that double taxation of dividends—present, at least partially, in each ASEAN member—should be curtailed if these economies are to avoid the necessarily detrimental ramifications for capital formation. |
use postgres::{Client, NoTls};
use serde::Deserialize;
use std::error::Error;
#[derive(Clone, Debug, Deserialize)]
struct Person {
name: String,
age: i32,
}
fn main() -> Result<(), Box<dyn Error>> {
let mut client = Client::connect("postgres://postgres:docker@localhost:5432", NoTls)?;
client.execute(
"CREATE TABLE IF NOT EXISTS Person (
name VARCHAR NOT NULL,
age INT NOT NULL
)",
&[],
)?;
client.execute(
"INSERT INTO Person (name, age) VALUES ($1, $2)",
&[&"Jane", &23i32],
)?;
client.execute(
"INSERT INTO Person (name, age) VALUES ($1, $2)",
&[&"Alice", &32i32],
)?;
let rows = client.query("SELECT name, age FROM Person", &[])?;
let people: Vec<Person> = serde_postgres::from_rows(&rows)?;
for person in people {
println!("{:?}", person);
}
Ok(())
}
|
/* Map a 1G-size page */
void install_1g_ept(unsigned long *pml4,
unsigned long phys,
unsigned long guest_addr,
u64 perm)
{
install_ept_entry(pml4, 3, guest_addr,
(phys & PAGE_MASK) | perm | EPT_LARGE_PAGE, 0);
} |
/**
* Transforms user input from prefix to infix form
* @param query user input
* @return String as infix form
*/
@Override
public String infix(String query) {
String[] words = query.toLowerCase().split(" ");
StringBuilder sb = new StringBuilder("Query(");
if (words.length > 2) {
for (int i = 1; i < words.length; i++) {
sb.append(words[i]);
if (i == words.length - 1) {
sb.append(")");
} else {
sb.append(" ").append(words[0]).append(" ");
}
}
} else {
if (words.length > 1) {
sb.append("NaN)");
} else {
sb.append(words[0]).append(")");
}
}
return sb.toString();
} |
<reponame>MSU-Libraries/sandhill
from sandhill import app
from sandhill.utils import error_handling
from pytest import raises
from werkzeug.exceptions import HTTPException
def test_catch():
@error_handling.catch(ValueError, "VALUE ERROR: {exc}", return_val=-1)
@error_handling.catch((AttributeError, TypeError), "INVALID TYPE ERROR: {exc}", abort=400)
@error_handling.catch(KeyError, return_arg="a")
@error_handling.catch(IndexError, return_arg="add", return_val=None)
@error_handling.catch(NameError, return_arg="invalid", return_val=2)
@error_handling.catch(OSError, "OSError: Logging and reraising {exc}")
def myfunc(a, **kwargs):
if "extra" in kwargs:
return 100
if not isinstance(a, int):
raise AttributeError("Only accepts int values")
if a < 0:
raise ValueError("Negatives are a no no!")
if a == 1:
raise KeyError("1 is not a valid key")
if a == 10:
raise IndexError("2 is not a valid index")
if a == 20:
raise NameError("this is a name error")
if a == 30:
raise OSError("Got me an OS here")
return a * a
## Test no exceptions being raised
res = myfunc(2)
assert res == 4
## Test with kwargs
res = myfunc(3, extra=4)
assert res == 100
## Test for AttributeError
## Where an abort code is provided
with raises(HTTPException) as http_error:
res = myfunc("four")
assert http_error.type.code == 400
# Test for ValueError
# Where a return_val is provided
res = myfunc(-3)
assert res == -1
# Test when no message is provided
res = myfunc(1)
assert res == 1
# Test when return_kwarg and return_val are provided
res = myfunc(10, add=12)
assert res == 12
# Test when passing an invalid return_kwarg
res = myfunc(20)
assert res == 2
# Test for not providing any action or return
with raises(OSError):
res = myfunc(30)
|
The effect of different shading net on the Quantum Efficiency of PS II in chilli pepper cultivar ‘Star Flame’
The study was undertaken to identify the effect of different shading net on the quantum efficiency of PS II on ‘Star Flame’ chilli pepper (Capsicum annuum) over a period of time cultivated under plastic house environment. ‘Star Flame’ pepper was grown under red shading net and samples without shading were used as control. Analysis of photosynthetic activity revealed a significant difference (p<0.05) between Fv/Fm values in control and red shading at the end of July (p = 0.031) after the first harvest. Chlorophyll fluorescence parameter Fv/Fm reflects the maximum quantum efficiency of photosystem II (PS II) used in the detection of early stress in plants. |
/*
* Copyright 2013 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not
* use this file except in compliance with the License. You may obtain a copy of
* the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations under
* the License.
*/
package com.google.android.apps.mytracks.util;
import android.content.ComponentName;
import android.content.Context;
import android.content.Intent;
import android.content.ServiceConnection;
import android.os.Binder;
import android.os.IBinder;
import android.os.Parcel;
import android.os.RemoteException;
import android.util.Log;
/**
* Utilities for Google Feedback.
*
* @author <NAME>
*/
public class GoogleFeedbackUtils {
private static final String TAG = GoogleFeedbackUtils.class.getSimpleName();
private GoogleFeedbackUtils() {}
/**
* Binds the Google Feedback service.
*
* @param context the context
*/
public static void bindFeedback(Context context) {
Intent intent = new Intent(Intent.ACTION_BUG_REPORT);
ServiceConnection serviceConnection = new ServiceConnection() {
@Override
public void onServiceConnected(ComponentName name, IBinder service) {
try {
service.transact(Binder.FIRST_CALL_TRANSACTION, Parcel.obtain(), null, 0);
} catch (RemoteException e) {
Log.e(TAG, "RemoteException", e);
}
}
@Override
public void onServiceDisconnected(ComponentName name) {}
};
// Bind to the service after creating it if necessary
context.bindService(intent, serviceConnection, Context.BIND_AUTO_CREATE);
}
}
|
package tech.pdai.springboot.mysql8.mybatis.anno.service;
import tech.pdai.springboot.mysql8.mybatis.anno.entity.Role;
import tech.pdai.springboot.mysql8.mybatis.anno.entity.query.RoleQueryBean;
import java.util.List;
public interface IRoleService {
List<Role> findList(RoleQueryBean roleQueryBean);
}
|
What are We Talking About When We Discuss Digital Protectionism?
For almost a decade, executives, scholars, and trade diplomats have argued that filtering, censorship, localization requirements and domestic regulations are distorting the cross-border information flows that underpin the internet. Herein I make 5 points about digital protectionism. 1. Digital protectionism differs from protectionism of goods and other services because trade in information is different from trade in goods and other services. Information is intangible, highly tradable, and some information is a public good which governments must provide and regulate effectively. 2. It will not be easy to set international rules to limit digital protectionism without a shared set of norms and definitions. However, we can only obtain greater clarity with trade disputes and clearer trade rules. 3. The US, EU, and Canada have labeled other countries policies’ protectionist, yet their arguments and actions sometimes appear hypocritical. 4. China allegedly has used a wide range of cyber-strategies including distributed denial of service (DDoS) attacks (bombarding a web site with service requests) to censor information flows and impede online market access beyond its borders. WTO members have yet to discuss this issue and the threat it poses to trade norms and rules. 5. Digital protectionism may be self-defeating. Governments that adopt digital protectionist strategies could experience unanticipated side effects, including reduced access to information, internet stability, and generativity. Digital protectionism may also undermine human rights and scientific progress.
Recommendations — Policymakers Should: 1. Ask the WTO Secretariat to examine whether domestic policies that restrict information (short of exceptions for national security, privacy, and public morals) constitute barriers to cross-border information flows that could be challenged in a trade dispute. 2. Convene a study group at the WTO to examine the trade implications of governmental use of malware or DDoS attacks to improve the competitiveness of their firms or censor the internet in other countries. These tactics should be banned, although the WTO may not be the best forum for discussion of these problems. 3. During each WTO member state’s trade policy review process, the members of the WTO should monitor how each member’s rules governing information flows potentially distort trade. 4. Propose and negotiate an international agreement that defines and limits digital protectionism and delineates clear and limited exceptions. |
<reponame>hy9be/gocloud
// Copyright 2019 The Go Cloud Development Kit Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limtations under the License.
package hashivault
import (
"context"
"errors"
"os"
"sync"
"testing"
"time"
"github.com/hashicorp/vault/api"
"github.com/hy9be/gocloud/internal/testing/setup"
"github.com/hy9be/gocloud/secrets"
"github.com/hy9be/gocloud/secrets/driver"
"github.com/hy9be/gocloud/secrets/drivertest"
)
// To run these tests against a real Vault server, first run ./localvault.sh.
// Then wait a few seconds for the server to be ready.
const (
keyID1 = "test-secrets"
keyID2 = "test-secrets2"
apiAddress = "http://127.0.0.1:8200"
testToken = "<PASSWORD>"
)
// enableTransit checks and makes sure the Transit API is enabled only once.
var enableTransit sync.Once
type harness struct {
client *api.Client
close func()
}
func (h *harness) MakeDriver(ctx context.Context) (driver.Keeper, driver.Keeper, error) {
return newKeeper(h.client, keyID1, nil), newKeeper(h.client, keyID2, nil), nil
}
func (h *harness) Close() {}
func newHarness(ctx context.Context, t *testing.T) (drivertest.Harness, error) {
if !setup.HasDockerTestEnvironment() {
t.Skip("Skipping Vault tests since the Vault server is not available")
}
c, err := Dial(ctx, &Config{
Token: <PASSWORD>Token,
APIConfig: api.Config{
Address: apiAddress,
},
})
if err != nil {
return nil, err
}
c.SetClientTimeout(3 * time.Second)
// Enable the Transit Secrets Engine to use Vault as an Encryption as a Service.
enableTransit.Do(func() {
s, err := c.Logical().Read("sys/mounts")
if err != nil {
t.Fatal(err, "; run secrets/hashivault/localvault.sh to start a dev vault container")
}
if _, ok := s.Data["transit/"]; !ok {
if _, err := c.Logical().Write("sys/mounts/transit", map[string]interface{}{"type": "transit"}); err != nil {
t.Fatal(err, "; run secrets/hashivault/localvault.sh to start a dev vault container")
}
}
})
return &harness{
client: c,
}, nil
}
func TestConformance(t *testing.T) {
drivertest.RunConformanceTests(t, newHarness, []drivertest.AsTest{verifyAs{}})
}
type verifyAs struct{}
func (v verifyAs) Name() string {
return "verify As function"
}
func (v verifyAs) ErrorCheck(k *secrets.Keeper, err error) error {
var s string
if k.ErrorAs(err, &s) {
return errors.New("Keeper.ErrorAs expected to fail")
}
return nil
}
// Vault-specific tests.
func TestNoSessionProvidedError(t *testing.T) {
if _, err := Dial(context.Background(), nil); err == nil {
t.Error("got nil, want no auth Config provided")
}
}
func TestNoConnectionError(t *testing.T) {
ctx := context.Background()
// Dial calls vault's NewClient method, which doesn't make the connection. Try
// doing encryption which should fail by no connection.
client, err := Dial(ctx, &Config{
Token: "<<PASSWORD>>",
APIConfig: api.Config{
Address: apiAddress,
},
})
if err != nil {
t.Fatal(err)
}
keeper := OpenKeeper(client, "my-key", nil)
defer keeper.Close()
if _, err := keeper.Encrypt(ctx, []byte("test")); err == nil {
t.Error("got nil, want connection refused")
}
}
func fakeConnectionStringInEnv() func() {
oldURLVal := os.Getenv("VAULT_SERVER_URL")
oldTokenVal := os.Getenv("VAULT_SERVER_TOKEN")
os.Setenv("VAULT_SERVER_URL", "http://myvaultserver")
os.Setenv("VAULT_SERVER_TOKEN", "<PASSWORD>")
return func() {
os.Setenv("VAULT_SERVER_URL", oldURLVal)
os.Setenv("VAULT_SERVER_TOKEN", oldTokenVal)
}
}
func alternativeConnectionStringEnvVars() func() {
oldURLVal := os.Getenv("VAULT_ADDR")
oldTokenVal := os.Getenv("VAULT_TOKEN")
os.Setenv("VAULT_ADDR", "http://myalternativevaultserver")
os.Setenv("VAULT_TOKEN", "<PASSWORD>")
return func() {
os.Setenv("VAULT_ADDR", oldURLVal)
os.Setenv("VAULT_TOKEN", oldTokenVal)
}
}
func unsetConnectionStringEnvVars() func() {
oldURLVal := os.Getenv("VAULT_ADDR")
oldTokenVal := os.Getenv("VAULT_TOKEN")
oldServerURLVal := os.Getenv("VAULT_SERVER_URL")
oldServerTokenVal := os.Getenv("VAULT_SERVER_TOKEN")
os.Unsetenv("VAULT_ADDR")
os.Unsetenv("VAULT_TOKEN")
os.Unsetenv("VAULT_SERVER_URL")
os.Unsetenv("VAULT_SERVER_TOKEN")
return func() {
os.Setenv("VAULT_ADDR", oldURLVal)
os.Setenv("VAULT_SERVER_URL", oldServerURLVal)
os.Setenv("VAULT_TOKEN", oldTokenVal)
os.Setenv("VAULT_SERVER_TOKEN", oldServerTokenVal)
}
}
func TestOpenKeeper(t *testing.T) {
cleanup := fakeConnectionStringInEnv()
defer cleanup()
tests := []struct {
URL string
WantErr bool
}{
// OK.
{"hashivault://mykey", false},
// OK, setting engine.
{"hashivault://mykey?engine=foo", false},
// Invalid parameter.
{"hashivault://mykey?param=value", true},
}
ctx := context.Background()
for _, test := range tests {
keeper, err := secrets.OpenKeeper(ctx, test.URL)
if (err != nil) != test.WantErr {
t.Errorf("%s: got error %v, want error %v", test.URL, err, test.WantErr)
}
if err == nil {
if err = keeper.Close(); err != nil {
t.Errorf("%s: got error during close: %v", test.URL, err)
}
}
}
}
func TestGetVaultConnectionDetails(t *testing.T) {
t.Run("Test Current Env Vars", func(t *testing.T) {
cleanup := fakeConnectionStringInEnv()
defer cleanup()
serverUrl, err := getVaultURL()
if err != nil {
t.Errorf("got unexpected error: %v", err)
}
if serverUrl != "http://myvaultserver" {
t.Errorf("expected 'http://myvaultserver': got %q", serverUrl)
}
vaultToken := getVaultToken()
if vaultToken != "<PASSWORD>" {
t.Errorf("export 'faketoken': got %q", vaultToken)
}
})
t.Run("Test Alternative Env Vars", func(t *testing.T) {
cleanup := alternativeConnectionStringEnvVars()
defer cleanup()
serverUrl, err := getVaultURL()
if err != nil {
t.Errorf("got unexpected error: %v", err)
}
if serverUrl != "http://myalternativevaultserver" {
t.Errorf("export '': got %q", serverUrl)
}
vaultToken := getVaultToken()
if vaultToken != "<PASSWORD>" {
t.Errorf("export 'faketoken2': got %q", vaultToken)
}
})
t.Run("Test Unset Env Vars Throws Error", func(t *testing.T) {
cleanup := unsetConnectionStringEnvVars()
defer cleanup()
serverUrl, err := getVaultURL()
if err == nil {
t.Errorf("expected error but got a url: %s", serverUrl)
}
vaultToken := getVaultToken()
if vaultToken != "" {
t.Errorf("export '': got %q", vaultToken)
}
})
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.