6 void traverseXML(XMLTree *X, treeNode x)
\r
9 int d = X->NumChildren(x);
\r
12 y = X->FirstChild(x);
\r
13 for (j = 0; j < d; j++) {
\r
15 y = X->NextSibling(y);
\r
24 unsigned char openTag[]="A", closeTag[]="/A", filename[]="testXML", text[]="Hello World";
\r
33 X->OpenDocument(false, 32);
\r
36 for (i = 1; i < n; i++) {
\r
37 //if (rand() % 100 < r) setbit(B,i,1);
\r
39 printf("???? rr=%d n=%d i=%d\n",rr,n,i);
\r
41 } else if (rr >= (n-i)) {
\r
42 X->NewClosingTag(closeTag);
\r
43 if ((1+(int) (2.0*rand()/(RAND_MAX+1.0))) == 1)
\r
45 else X->NewText(text);
\r
49 if (rand() % (rr+1) < (rr+1)/2 || (rr<=1)) {
\r
50 X->NewOpenTag(openTag);
\r
51 if ((1+(int) (2.0*rand()/(RAND_MAX+1.0))) == 1)
\r
53 else X->NewText(text);
\r
57 X->NewClosingTag(closeTag);
\r
58 if ((1+(int) (2.0*rand()/(RAND_MAX+1.0))) <= 1)
\r
60 else X->NewText(text);
\r
68 for (i=0; i <= (n+1)/2; i++)
\r
79 // X = XMLTree::Load(filename, 32);
\r
83 //traverseXML(X, x);
\r