#define REGISTER_TAG(v,h,t) do { (h)->insert(std::make_pair((t),(v)->size()));\\r
(v)->push_back(t); } while (false)\r
\r
-\r
// returns NULLT if the test is true\r
#define NULLT_IF(x) do { if (x) return NULLT; } while (0)\r
\r
-\r
-\r
-\r
+// Direct calls to sarray library\r
+\r
+static inline int fast_find_close(bp *b,int s)\r
+{\r
+ return fwd_excess(b,s,-1);\r
+}\r
+\r
+static inline int fast_inspect(bp* Par,treeNode i)\r
+{\r
+ int j,l;\r
+ j = i >> logD;\r
+ l = i & (D-1);\r
+ return (Par->B[j] >> (D-1-l)) & 1;\r
+}\r
+\r
+static treeNode fast_first_child(bp *Par, treeNode x)\r
+{\r
+ x = x+1;\r
+ return (fast_inspect(Par,x) == OP) ? x : NULLT;\r
+}\r
+\r
+inline static treeNode fast_next_sibling(bp* Par,treeNode x)\r
+{\r
+ treeNode y = fast_find_close(Par,x)+1;\r
+ return (fast_inspect(Par, y) == OP) ? y : NULLT;\r
+}\r
+\r
+inline static bool fast_is_ancestor(bp * Par,treeNode x,treeNode y){\r
+ return (x <= y) && ((x==0) || (y <= fast_find_close(Par,x)));\r
+}\r
+\r
+// tag position -> tree node\r
+static treeNode tagpos2node(int t) \r
+ {\r
+ return (treeNode) t;\r
+ }\r
+// tree node -> tag position\r
+static int node2tagpos(treeNode x) \r
+{\r
+ return (int)x;\r
+}\r
\r
\r
class XMLTreeBuilder;\r
return tags_len/2;\r
}\r
\r
+\r
+ /** NumTags() : Number of distinct tags */\r
+ unsigned int NumTags() {\r
+ return TagName->size();\r
+ }\r
+\r
/** SubtreeSize(x): the number of nodes (and attributes) in the subtree of \r
* node x. */\r
int SubtreeSize(treeNode x);\r
\r
/** IsFirstChild(x): returns whether node x is the first child of its parent. */\r
/* OCAML */\r
- bool IsFirstChild(treeNode x);\r
+ bool IsFirstChild(treeNode x) { \r
+ return ((x != NULLT)&&(x==Root() || prev_sibling(Par,x) == (treeNode)-1));\r
+ };\r
\r
/** NumChildren(x): number of children of node x. Constant time with the \r
* data structure of Sadakane. */\r
* tree nodes (and not texts). */\r
int Postorder(treeNode x);\r
\r
- /** Tag(x): returns the tag identifier of node x. */\r
- TagType Tag(treeNode x) {\r
- if (tags_blen == 8)\r
- return (TagType) (((uchar*)tags_fix)[(int) x]);\r
- else\r
- return (TagType) get_field(tags_fix,tags_blen, (int) x);\r
- }\r
\r
/** DocIds(x): returns the range (i.e., a pair of integers) of document \r
* identifiers that descend from node x. */\r
range DocIds(treeNode x);\r
\r
/** Parent(x): returns the parent node of node x. */\r
- treeNode Parent(treeNode x);\r
+ treeNode Parent(treeNode x) { \r
+ if (x == Root())\r
+ return NULLT;\r
+ else\r
+ return parent(Par, x);\r
+ };\r
/* Assumes x is neither 0 nor -1 */\r
\r
/** Child(x,i): returns the i-th child of node x, assuming it exists. */ \r
treeNode Child(treeNode x, int i);\r
\r
- /** FirstChild(x): returns the first child of node x, or NULLT if the node is a leaf\r
- */\r
- treeNode FirstChild(treeNode x);\r
\r
- /** FirstElement(x): returns the first non text, non attribute child of node x, or NULLT\r
- * if none.\r
- */\r
- treeNode FirstElement(treeNode x);\r
\r
/** LastChild(x): returns the last child of node x. */\r
treeNode LastChild(treeNode x);\r
\r
- /** NextSibling(x): returns the next sibling of node x, or NULLT if none \r
- * exists. */\r
\r
- treeNode NextSibling(treeNode x);\r
-\r
- /** NextElement(x): returns the first non text, non attribute sibling of node x, or NULLT\r
- * if none.\r
- */\r
- treeNode NextElement(treeNode x);\r
\r
/** PrevSibling(x): returns the previous sibling of node x, assuming it \r
* exists. */\r
\r
treeNode SelectFollowingSibling(treeNode x, TagIdSet * tags);\r
\r
- /** TaggedDesc(x,tag): returns the first node tagged tag with larger \r
- * preorder than x and within the subtree of x. Returns NULT if there \r
- * is none. */\r
- treeNode TaggedDescendant(treeNode x, TagType tag);\r
\r
- treeNode SelectDescendant(treeNode x, TagIdSet * tags);\r
+\r
+\r
+ treeNode SelectDescendant(treeNode x, TagIdSet * tags);\r
\r
/** TaggedPrec(x,tag): returns the first node tagged tag with smaller \r
* preorder than x and not an ancestor of x. Returns NULLT if there \r
* is none. */\r
treeNode TaggedFollowing(treeNode x, TagType tag);\r
\r
- treeNode TaggedFollowingBelow(treeNode x, TagType tag,treeNode ancestor); \r
+\r
\r
treeNode SelectFollowingBelow(treeNode x, TagIdSet * tags, treeNode ancestor);\r
\r
void Print(int fd,treeNode x, bool no_text);\r
void Print(int fd,treeNode x) { Print(fd,x,false); }\r
\r
+ // The following are inlined here for speed\r
+ /** Tag(x): returns the tag identifier of node x. */\r
+\r
+ inline TagType Tag(treeNode x) const throw () {\r
+ if (tags_blen == 8)\r
+ return (TagType) (((uchar*)tags_fix)[(int) x]);\r
+ else { \r
+ size_t idxlen = x * tags_blen;\r
+ size_t j = idxlen % W;\r
+ size_t i = idxlen / W; \r
+ size_t offset = W - tags_blen;\r
+ size_t offset2 = offset - j;\r
+ size_t w = tags_fix[i];\r
+ return (offset2 >= 0)\r
+ ? ( w << offset2 ) >> offset\r
+ : ( w >> j) | (tags_fix[i+1] << (W+offset2)) >> offset;\r
+ }; \r
+\r
+ }\r
+\r
+ /** FirstChild(x): returns the first child of node x, or NULLT if the node is a leaf\r
+ */\r
+ treeNode FirstChild(treeNode x) {\r
+ NULLT_IF(x==NULLT);\r
+ return fast_first_child(Par, x);\r
+ };\r
+\r
+\r
+ /** FirstElement(x): returns the first non text, non attribute child of node x, or NULLT\r
+ * if none.\r
+ */\r
+ treeNode FirstElement(treeNode x){\r
+ {\r
+ NULLT_IF(x==NULLT);\r
+ x = fast_first_child(Par, x);\r
+ NULLT_IF(x == NULLT);\r
+ switch (Tag(x)){\r
+ \r
+ case PCDATA_TAG_ID:\r
+ x = x+2;\r
+ return (fast_inspect(Par,x)==OP)? x : NULLT;\r
+ \r
+ case ATTRIBUTE_TAG_ID: \r
+ x = fast_next_sibling(Par,x);\r
+ if (x != NULLT && Tag(x) == PCDATA_TAG_ID){\r
+ x = x+2;\r
+ return (fast_inspect(Par,x)==OP)? x : NULLT;\r
+ } \r
+ else return x; \r
+ default:\r
+ return x;\r
+ }\r
+ }\r
+ };\r
+\r
+ /** NextSibling(x): returns the next sibling of node x, or NULLT if none \r
+ * exists. */\r
+ \r
+ treeNode NextSibling(treeNode x) {\r
+ NULLT_IF (x <= 0);\r
+ return fast_next_sibling(Par, x);\r
+ };\r
+ \r
+ /** NextElement(x): returns the first non text, non attribute sibling of node x, or NULLT\r
+ * if none.\r
+ */\r
+ treeNode NextElement(treeNode x)\r
+ {\r
+ NULLT_IF(x <= 0);\r
+ x = fast_next_sibling(Par, x);\r
+ NULLT_IF(x == NULLT); \r
+ if (Tag(x) == PCDATA_TAG_ID){\r
+ x = x+2;\r
+ return (fast_inspect(Par,x)==OP)? x : NULLT;\r
+ }\r
+ else return x; \r
+ };\r
+ /** TaggedDesc(x,tag): returns the first node tagged tag with larger \r
+ * preorder than x and within the subtree of x. Returns NULT if there \r
+ * is none. */\r
+ inline treeNode TaggedDescendant(treeNode x, TagType tag)\r
+ {\r
+ \r
+ int s = (int) Tags->select_next(tag,node2tagpos(x));\r
+ NULLT_IF (s == -1);\r
+ \r
+ treeNode y = tagpos2node(s); // transforms the tag position into a node position\r
+ \r
+ return (fast_is_ancestor(Par,x,y) ? y : NULLT);\r
+ };\r
+ \r
+ inline treeNode TaggedFollowingBelow(treeNode x, TagType tag,treeNode ancestor)\r
+ {\r
+ treeNode close = fast_find_close(Par, x);\r
+ treeNode s = tagpos2node(Tags->select_next(tag, close));\r
+ \r
+ if (ancestor == Root() || s == NULLT || s < fast_find_close(Par,ancestor)) return s;\r
+ else return NULLT;\r
+ };\r
+ \r
};\r
\r
\r
projects / SXSI / XMLTree.git / blobdiff