var searchIndex = {};
searchIndex["suffix_tree"] = {"doc":"Suffix tree construction in linear time. Usage is very simple:","items":[[3,"SuffixTree","suffix_tree","A suffix tree.",null,null],[3,"Node","","A node in a suffix tree.",null,null],[3,"Ancestors","","An iterator over ancestors of a node.",null,null],[3,"Children","","An iterator over all children of a node.",null,null],[3,"Preorder","","An iterator over all children of a node in preorder.",null,null],[3,"Leaves","","An iterator over all leaves of a node.",null,null],[3,"SuffixTreeIndices","","An iterator over all suffix indices below a node.",null,null],[11,"new","","",0,{"inputs":[{"name":"s"}],"output":{"name":"suffixtree"}}],[11,"from_suffix_table","","",0,{"inputs":[{"name":"suffixtable"}],"output":{"name":"suffixtree"}}],[11,"text","","Get the text that is indexed by this suffix tree.",0,null],[11,"root","","Retrieve the root node.",0,null],[11,"label","","Get the path label *into* `node`.",0,null],[11,"children","","An iterator over all children of this node.",1,null],[11,"ancestors","","An iterator over all ancestors of this node.",1,null],[11,"preorder","","Traverse all children nodes in preorder.",1,null],[11,"leaves","","An iterator over all leaves below this node.",1,null],[11,"suffix_indices","","An iterator over all suffix indices.",1,null],[11,"len","","The size of the path label into this node.",1,null],[11,"depth","","The depth of this node (number of ancestors, not including self).",1,null],[11,"has_terminals","","Returns true if and only if this node has some terminals.",1,null],[11,"suffixes","","Returns all terminal suffix indices.",1,null],[11,"fmt","","",0,null],[11,"fmt","","",1,null],[11,"next","","",2,null],[11,"next","","",3,null],[11,"size_hint","","",3,null],[11,"next_back","","",3,null],[11,"next","","",4,null],[11,"next","","",5,null],[11,"next","","",6,null]],"paths":[[3,"SuffixTree"],[3,"Node"],[3,"Ancestors"],[3,"Children"],[3,"Preorder"],[3,"Leaves"],[3,"SuffixTreeIndices"]]};
initSearch(searchIndex);