Lines Matching defs:tree
25 ** Construct a suffix tree for a source string
27 ** This is based on the suffix tree algorithm of E. McCreight.
40 ** tree. In the latter case, the tree can be destroyed by free()-ing
46 /* Delete a suffix tree */
82 /* Get space for tree nodes. */
106 /* Build the tree.
109 ** tree node that points to the longest prefix
110 ** that terminates at a node in the current tree.
111 ** locus: defines a tree node to be constructed that
130 /* get initial space for the tree nodes */
156 /* now build the tree */
311 /* Given a raw string and a string represented in a suffix tree,
312 match the string against the tree to find a longest matching
315 string represented by the tree.
317 long mtchsuftree(Suftree* tree, Element* str, long len, Element** mtchp)
327 if(!(match = child_find(tree,*str)))
341 tree = match;
354 while(CHILD(tree))
355 tree = CHILD(tree);
356 *mtchp = SUFFIX(tree);