void testFailureArray()
{
{
setup ("array failure append");
auto& root = makeRoot();
auto array = root.setArray ("array");
auto subarray = array.appendArray ();
auto fail = [&]() { array.append ("fail"); };
expectException (fail);
}
{
setup ("array failure appendArray");
auto& root = makeRoot();
auto array = root.setArray ("array");
auto subarray = array.appendArray ();
auto fail = [&]() { array.appendArray (); };
expectException (fail);
}
{
setup ("array failure appendObject");
auto& root = makeRoot();
auto array = root.setArray ("array");
auto subarray = array.appendArray ();
auto fail = [&]() { array.appendObject (); };
expectException (fail);
}
}
inline int query(Node* u,Node* v)
{
makeRoot(u);
access(v);
splay(v);
return v->xsum;
}
// create root at end of chain then build it up
treeNode *choiceNode(int tok,treeNode *choice,treeNode *root){
if(!root)
root = makeRoot();
rootData *data = root->data;
if(tok == TRANSFORM || tok == REQUIRE || tok == OPTION){
if(!choice->stages){
nodeStages *stages = Malloc(sizeof(nodeStages));
stages->start = 0;
stages->end = numStagesGlobal;
choice->stages = stages;
}
}
switch(tok){
case TRANSFORM: pushLinked(data->transNodes,choice); break;
case OBJECT: pushLinked(data->objNodes,choice); break;
case DESOBJECT: pushLinked(data->desObjNodes,choice); break;
case ALLDIF: pushLinked(data->allDifNodes,choice); break;
case REQUIRE: pushLinked(data->reqNodes,choice); break;
case OPTION: pushLinked(data->optNodes,choice); break;
default: assert(NULL,"Node Error");
}
return root;
}
void testSubsShort ()
{
setup ("subsShort");
{
auto& root = makeRoot();
{
// Add an array with three entries.
auto array = root.setArray ("ar");
array.append (23);
array.append (false);
array.append (23.5);
}
// Add an object with one entry.
root.setObject ("obj")["hello"] = "world";
{
// Add another object with two entries.
auto object = root.setObject ("obj2");
object.set("h", "w");
object.set("f", false);
}
}
expectResult (
"{\"ar\":[23,false,23.5],"
"\"obj\":{\"hello\":\"world\"},"
"\"obj2\":{\"h\":\"w\",\"f\":false}}");
}
int main()
{
int n, m, op;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", K + i);
for (int i = 0; i < n; i++) Link(&T[i], &T[min(i + K[i], n)]);
scanf("%d", &m);
while (m--)
{
scanf("%d", &op);
if (op == 1)
{
int x;
scanf("%d", &x);
makeRoot(&T[n]);
access(&T[x]), splay(&T[x]);
printf("%d\n", T[x].ch[0] ? T[x].ch[0]->sz : 0);
}
if (op == 2)
{
int x, y;
scanf("%d%d", &x, &y);
Cut(&T[x], &T[min(x + K[x], n)]);
K[x] = y;
Link(&T[x], &T[min(x + K[x], n)]);
}
}
return 0;
}
void testOneSub ()
{
setup ("oneSub");
{
auto& root = makeRoot();
root.setArray ("ar");
}
expectResult ("{\"ar\":[]}");
}
void testTrivial ()
{
setup ("trivial");
{
auto& root = makeRoot();
(void) root;
}
expectResult ("{}");
}
void testKeyFailure ()
{
#ifdef DEBUG
setup ("repeating keys");
auto& root = makeRoot();
root.set ("foo", "bar");
root.set ("baz", 0);
auto fail = [&]() { root.set ("foo", "bar"); };
expectException (fail);
#endif
}
void testFailureObject()
{
{
setup ("object failure assign");
auto& root = makeRoot();
auto obj = root.setObject ("o1");
expectException ([&]() { root["fail"] = "complete"; });
}
{
setup ("object failure object");
auto& root = makeRoot();
auto obj = root.setObject ("o1");
expectException ([&] () { root.setObject ("o2"); });
}
{
setup ("object failure Array");
auto& root = makeRoot();
auto obj = root.setArray ("o1");
expectException ([&] () { root.setArray ("o2"); });
}
}
//进行初始化
void refresh(int result, string& q1)
{
cout<<"正在初始化---------------------"<<endl;
switch(result)
{
case -1://没有memory manager root
makeMemoryManager();
MM.open(0);
makeRoot(q1);
break;
case -2://没有memory manager
makeMemoryManager();
MM.open(0);
break;
case -3://没有root
MM.open(0);
makeRoot(q1);
break;
}
}
inline void cut(Node* u,Node* v)
{
if(u==v || getRoot(u)!=getRoot(v)) return;
makeRoot(u);
access(v);
splay(v);
if(v->ch[0]==u)
{
u->p=null;
v->setc(null,0);
v->maintain();
}
}
bool NETLIST_EXPORTER_GENERIC::WriteNetlist( const wxString& aOutFileName, unsigned aNetlistOptions )
{
// Prepare list of nets generation
for( unsigned ii = 0; ii < m_masterList->size(); ii++ )
m_masterList->GetItem( ii )->m_Flag = 0;
// output the XML format netlist.
wxXmlDocument xdoc;
xdoc.SetRoot( makeRoot( GNL_ALL ) );
return xdoc.Save( aOutFileName, 2 /* indent bug, today was ignored by wxXml lib */ );
}
t_rc INXM_IndexHandle::InsertEntry(void *pData, const REM_RecordID &rid){
t_rc rc;
STORM_PageHandle pageHandle;
/*
* Έλεγχος αν υπάρχει δέντρο
* Δημιουργία νέου δέντρου/ρίζας
*/
if( this->isOpen && this->fileHeader.numberOfNodes == 0 ){
makeRoot(pData, rid);
return(OK);
}
/*
* Υπάρχει ήδη δέντρο
*/
// Αναζήτηση για την εύρεση της ΣΩΣΤΗΣ σελίδας/φύλλου όπου θα μπεί ή νέα εγγραφή
int rightPageID = searchRightPage( fileHeader.rootPage , pData);
// Διαβάζω τον header αυτής της σελίδας
char* data;
rc = fh.GetPage(rightPageID, pageHandle);
if (rc != OK) return rc;
rc = pageHandle.GetDataPtr(&data);
if (rc != OK) return rc;
NodeHeader rightPageHeader;
memcpy(&rightPageHeader, &data[0], sizeof(NodeHeader));
// Έλεγχος αν η σελίδα έχει χώρο
bool freeSpace = checkLeafNodeForSpace(rightPageHeader);
if(freeSpace){ // περίπτωση που η σελίδα έχει χώρο
insert(rightPageID, pData, rid);
return (OK);
} else { // περίπτωση που η σελίδα ΔΕΝ έχει χώρο
rc = splitLeafNode(rightPageID);
if (rc != OK) return rc;
int pageAfterSplitID = searchRightPage( fileHeader.rootPage , pData);
insert(pageAfterSplitID, pData, rid);
return (OK);
}
}
treeNode *statementNodes(treeNode *symbols,treeNode *board,treeNode *start,treeNode *end,treeNode *root){
if(!root)
root = makeRoot();
rootData *data = root->data;
data->symLists = symbols->data;
data->boardNode = board;
data->startNode = start;
data->endNode = end;
Free(symbols);
return root;
}
void runVaultUnitTests(int *count, int *pass){
makeRoot();
*pass += TestSanity0(); (*count)++;
*pass += TestTriangleDistance(10500,10501,0.0); (*count)++;
*pass += TestTriangleDistance(10500,6098,17.37815); (*count)++;
*pass += TestTriangleDistance(10500,20226,12.96148); (*count)++;
*pass += TestTriangleDistance(6098,20227,15.55635); (*count)++;
*pass += TestToZZTriangles(); (*count)++;
*pass += TestBFDistance(39908,48188,60.21628); (*count)++;
*pass += TestBFDistance(39908,3441,52.48809); (*count)++;
*pass += TestBFDistance(48188,3441,49.56814); (*count)++;
//*pass += TestToZZBF(); (*count)++;
*pass += TestBF(); (*count)++;
}
void testSimple ()
{
setup ("simple");
{
auto& root = makeRoot();
root["hello"] = "world";
root["skidoo"] = 23;
root["awake"] = false;
root["temperature"] = 98.6;
}
expectResult (
"{\"hello\":\"world\","
"\"skidoo\":23,"
"\"awake\":false,"
"\"temperature\":98.6}");
}
void testSubs ()
{
setup ("subs");
{
auto& root = makeRoot();
{
// Add an array with three entries.
auto array = root.setArray ("ar");
array.append (23);
array.append (false);
array.append (23.5);
}
{
// Add an object with one entry.
auto obj = root.setObject ("obj");
obj["hello"] = "world";
}
{
// Add another object with two entries.
Json::Value value;
value["h"] = "w";
value["f"] = false;
root["obj2"] = value;
}
}
// Json::Value has an unstable order...
auto case1 = "{\"ar\":[23,false,23.5],"
"\"obj\":{\"hello\":\"world\"},"
"\"obj2\":{\"h\":\"w\",\"f\":false}}";
auto case2 = "{\"ar\":[23,false,23.5],"
"\"obj\":{\"hello\":\"world\"},"
"\"obj2\":{\"f\":false,\"h\":\"w\"}}";
writerObject_.reset();
expect (output_ == case1 || output_ == case2,
"Got wrong object:\n " + output_ + "\nShould be either\n " +
case1 + "\nor\n " + case2);
}
void loadIndex(BTree *tree, FILE *base) {
int temp;
int key, nrr = 0;
BTNode *root = makeNode();
temp = readNode(root, tree->root);
if (!temp) { /* nao existe arquivo zero. */
makeRoot();
while(!feof(base)) {
fscanf(base, "%04d", &key);
BTreeInsert(tree, key);
nrr++;
}
}
free(root);
}
inline void Link(node *x, node *f)
{
makeRoot(x), x->fa = f;
}
inline node *Select(node *x, node *y)
{
return makeRoot(x), findRoot(y);
}
inline void Cut(node *x, node *y)
{
makeRoot(x), access(y), splay(y);
x->fa = y->ch[0] = 0;
}
inline void link(Node* u,Node* v)
{
if(getRoot(u)==getRoot(v)) return;
makeRoot(u);
u->p=v;
}
void makeAll(){
// makeRoot("Elec","All","","Barrel");
// makeRoot("Tau","All","","Barrel");
// makeRoot("Elec","All","","Endcap");
// makeRoot("Tau","All","","Endcap");
// makeRoot("Elec","NoEleMatch_woGwoGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_woGwoGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_woGwGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_woGwGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_wGwoGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_wGwoGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_wGwGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_wGwGSF","","Barrel");
// makeRoot("Elec","woGwoGSF","","Barrel");
// makeRoot("Tau","woGwoGSF","","Barrel");
// makeRoot("Elec","woGwGSF","","Barrel");
// makeRoot("Tau","woGwGSF","","Barrel");
// makeRoot("Elec","wGwoGSF","","Barrel");
// makeRoot("Tau","wGwoGSF","","Barrel");
// makeRoot("Elec","wGwGSF","","Barrel");
// makeRoot("Tau","wGwGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_woGwoGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_woGwoGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_woGwGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_woGwGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_wGwoGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_wGwoGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_wGwGSF","","Endcap");
makeRoot("Tau","NoEleMatch_wGwGSF","","Endcap");
makeRoot("Elec","woGwoGSF","","Endcap");
makeRoot("Tau","woGwoGSF","","Endcap");
makeRoot("Elec","woGwGSF","","Endcap");
makeRoot("Tau","woGwGSF","","Endcap");
makeRoot("Elec","wGwoGSF","","Endcap");
makeRoot("Tau","wGwoGSF","","Endcap");
makeRoot("Elec","wGwGSF","","Endcap");
makeRoot("Tau","wGwGSF","","Endcap");
// //MVAIso
// makeRoot("Elec","All","MVAIso","Barrel");
// makeRoot("Tau","All","MVAIso","Barrel");
// makeRoot("Elec","NoEleMatch","MVAIso","Barrel");
// makeRoot("Tau","NoEleMatch","MVAIso","Barrel");
// makeRoot("Elec","woG","MVAIso","Barrel");
// makeRoot("Tau","woG","MVAIso","Barrel");
// makeRoot("Elec","wGwoGSF","MVAIso","Barrel");
// makeRoot("Tau","wGwoGSF","MVAIso","Barrel");
// makeRoot("Elec","wGwGSFwoPFMVA","MVAIso","Barrel");
// makeRoot("Tau","wGwGSFwoPFMVA","MVAIso","Barrel");
// makeRoot("Elec","wGwGSFwPFMVA","MVAIso","Barrel");
// makeRoot("Tau","wGwGSFwPFMVA","MVAIso","Barrel");
//v9
// makeRoot("Elec","NoEleMatch_woGwoGSF","MVAIso","Barrel");
// makeRoot("Tau","NoEleMatch_woGwoGSF","MVAIso","Barrel");
// makeRoot("Elec","NoEleMatch_woGwGSF","MVAIso","Barrel");
// makeRoot("Tau","NoEleMatch_woGwGSF","MVAIso","Barrel");
// makeRoot("Elec","NoEleMatch_wGwoGSF","MVAIso","Barrel");
// makeRoot("Tau","NoEleMatch_wGwoGSF","MVAIso","Barrel");
// makeRoot("Elec","NoEleMatch_wGwGSF","MVAIso","Barrel");
// makeRoot("Tau","NoEleMatch_wGwGSF","MVAIso","Barrel");
// makeRoot("Elec","woGwoGSF","MVAIso","Barrel");
// makeRoot("Tau","woGwoGSF","MVAIso","Barrel");
// makeRoot("Elec","woGwGSF","MVAIso","Barrel");
// makeRoot("Tau","woGwGSF","MVAIso","Barrel");
// makeRoot("Elec","wGwoGSF","MVAIso","Barrel");
// makeRoot("Tau","wGwoGSF","MVAIso","Barrel");
// makeRoot("Elec","wGwGSF","MVAIso","Barrel");
// makeRoot("Tau","wGwGSF","MVAIso","Barrel");
// makeRoot("Elec","All","MVAIso","Endcap");
// makeRoot("Tau","All","MVAIso","Endcap");
// makeRoot("Elec","NoEleMatch","MVAIso","Endcap");
// makeRoot("Tau","NoEleMatch","MVAIso","Endcap");
// makeRoot("Elec","woG","MVAIso","Endcap");
// makeRoot("Tau","woG","MVAIso","Endcap");
// makeRoot("Elec","wGwoGSF","MVAIso","Endcap");
// makeRoot("Tau","wGwoGSF","MVAIso","Endcap");
// makeRoot("Elec","wGwGSFwoPFMVA","MVAIso","Endcap");
// makeRoot("Tau","wGwGSFwoPFMVA","MVAIso","Endcap");
// makeRoot("Elec","wGwGSFwPFMVA","MVAIso","Endcap");
// makeRoot("Tau","wGwGSFwPFMVA","MVAIso","Endcap");
//v9
// makeRoot("Elec","NoEleMatch_woGwoGSF","MVAIso","Endcap");
// makeRoot("Tau","NoEleMatch_woGwoGSF","MVAIso","Endcap");
// makeRoot("Elec","NoEleMatch_woGwGSF","MVAIso","Endcap");
// makeRoot("Tau","NoEleMatch_woGwGSF","MVAIso","Endcap");
// makeRoot("Elec","NoEleMatch_wGwoGSF","MVAIso","Endcap");
// makeRoot("Tau","NoEleMatch_wGwoGSF","MVAIso","Endcap");
// makeRoot("Elec","NoEleMatch_wGwGSF","MVAIso","Endcap");
// makeRoot("Tau","NoEleMatch_wGwGSF","MVAIso","Endcap");
// makeRoot("Elec","woGwoGSF","MVAIso","Endcap");
// makeRoot("Tau","woGwoGSF","MVAIso","Endcap");
// makeRoot("Elec","woGwGSF","MVAIso","Endcap");
// makeRoot("Tau","woGwGSF","MVAIso","Endcap");
// makeRoot("Elec","wGwoGSF","MVAIso","Endcap");
// makeRoot("Tau","wGwoGSF","MVAIso","Endcap");
// makeRoot("Elec","wGwGSF","MVAIso","Endcap");
// makeRoot("Tau","wGwGSF","MVAIso","Endcap");
// makeRoot("Elec","All","","Barrel");
// makeRoot("Tau","All","","Barrel");
// makeRoot("Elec","NoEleMatch","","Barrel");
// makeRoot("Tau","NoEleMatch","","Barrel");
// makeRoot("Elec","woG","","Barrel");
// makeRoot("Tau","woG","","Barrel");
// makeRoot("Elec","wGwoGSF","","Barrel");
// makeRoot("Tau","wGwoGSF","","Barrel");
// makeRoot("Elec","wGwGSFwoPFMVA","","Barrel");
// makeRoot("Tau","wGwGSFwoPFMVA","","Barrel");
// makeRoot("Elec","wGwGSFwPFMVA","","Barrel");
// makeRoot("Tau","wGwGSFwPFMVA","","Barrel");
// makeRoot("Elec","NoEleMatch_woGwoGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_woGwoGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_woGwGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_woGwGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_wGwoGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_wGwoGSF","","Barrel");
// makeRoot("Elec","NoEleMatch_wGwGSF","","Barrel");
// makeRoot("Tau","NoEleMatch_wGwGSF","","Barrel");
// makeRoot("Elec","woGwoGSF","","Barrel");
// makeRoot("Tau","woGwoGSF","","Barrel");
// makeRoot("Elec","woGwGSF","","Barrel");
// makeRoot("Tau","woGwGSF","","Barrel");
// makeRoot("Elec","wGwoGSF","","Barrel");
// makeRoot("Tau","wGwoGSF","","Barrel");
// makeRoot("Elec","wGwGSF","","Barrel");
// makeRoot("Tau","wGwGSF","","Barrel");
// makeRoot("Elec","All","","Endcap");
// makeRoot("Tau","All","","Endcap");
// makeRoot("Elec","NoEleMatch","","Endcap");
// makeRoot("Tau","NoEleMatch","","Endcap");
// makeRoot("Elec","woG","","Endcap");
// makeRoot("Tau","woG","","Endcap");
// makeRoot("Elec","wGwoGSF","","Endcap");
// makeRoot("Tau","wGwoGSF","","Endcap");
// makeRoot("Elec","wGwGSFwoPFMVA","","Endcap");
// makeRoot("Tau","wGwGSFwoPFMVA","","Endcap");
// makeRoot("Elec","wGwGSFwPFMVA","","Endcap");
// makeRoot("Tau","wGwGSFwPFMVA","","Endcap");
// makeRoot("Elec","NoEleMatch_woGwoGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_woGwoGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_woGwGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_woGwGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_wGwoGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_wGwoGSF","","Endcap");
// makeRoot("Elec","NoEleMatch_wGwGSF","","Endcap");
// makeRoot("Tau","NoEleMatch_wGwGSF","","Endcap");
// makeRoot("Elec","woGwoGSF","","Endcap");
// makeRoot("Tau","woGwoGSF","","Endcap");
// makeRoot("Elec","woGwGSF","","Endcap");
// makeRoot("Tau","woGwGSF","","Endcap");
// makeRoot("Elec","wGwoGSF","","Endcap");
// makeRoot("Tau","wGwoGSF","","Endcap");
// makeRoot("Elec","wGwGSF","","Endcap");
// makeRoot("Tau","wGwGSF","","Endcap");
// makeRoot("Elec","All","-AntiEMed");
// makeRoot("Tau","All","-AntiEMed");
// makeRoot("Elec","NoEleMatch","-AntiEMed");
// makeRoot("Tau","NoEleMatch","-AntiEMed");
// makeRoot("Elec","woG","-AntiEMed");
// makeRoot("Tau","woG","-AntiEMed");
// makeRoot("Elec","wGwoGSF","-AntiEMed");
// makeRoot("Tau","wGwoGSF","-AntiEMed");
// makeRoot("Elec","wGwGSFwoPFMVA","-AntiEMed");
// makeRoot("Tau","wGwGSFwoPFMVA","-AntiEMed");
// makeRoot("Elec","wGwGSFwPFMVA","-AntiEMed");
// makeRoot("Tau","wGwGSFwPFMVA","-AntiEMed");
}