s_tree+= XML_Tree->Tags->size();\r
\r
/// FIXME:UGLY tests!\r
- /*uint * seq = new uint[XML_Tree->tags_len];\r
+ uint * seq = new uint[XML_Tree->tags_len];\r
for(uint i=0;i<XML_Tree->tags_len;i++)\r
seq[i] = get_field(XML_Tree->tags_fix,XML_Tree->tags_blen,i);\r
cout << "Tags test: " << XML_Tree->Tags->test(seq,XML_Tree->tags_len) << endl;\r
- delete [] seq;*/\r
+ delete [] seq;\r
/// End ugly tests\r
\r
s_text = ftell(fp);\r
if (!is_ancestor(Par, x, y)) return false;\r
return depth(Par, x) == (depth(Par, y) + 1);\r
}\r
-\r
+bool XMLTree::IsFirstChild(treeNode x){\r
+ return ((x != NULLT)&&(x==Root() || prev_sibling(Par,x) == NULLT));\r
+}\r
// NumChildren(x): number of children of node x. Constant time with the data structure\r
// of Sadakane.\r
int XMLTree::NumChildren(treeNode x) \r
return first_child(Par, x);\r
}\r
\r
+treeNode XMLTree::LastChild(treeNode x) \r
+{\r
+ if (x == Root() || isleaf(Par,x) || x == NULLT)\r
+ return x;\r
+ else\r
+ return find_open(Par,find_close(Par,parent(Par,x))-1);\r
+}\r
+\r
// NextSibling(x): returns the next sibling of node x, assuming it exists.\r
treeNode XMLTree::NextSibling(treeNode x) \r
{\r