Table of Contents - suffix_tree-0.0.3 Documentation
Classes and Modules
- ArrayWordDataSource
- BFS
- BaseDataSource
- BaseVisitor
- BasicDfsTreePrintVisitor
- BitUtil
- DFS
- DataSourceFactory
- DataSourceVisitor
- DeepestValueDepthVisitor
- DelimitedWordDataSource
- DfsTreePrintVisitor
- FileDataSource
- KCommonVisitor
- LeafCountVisitor
- LeafNodeCollector
- LeastCommonAncestorPreprocessing
- Location
- Node
- NodeCountVisitor
- NodeExtensions
- NodeFactory
- NumberingVisitor
- OrderedDFS
- RunBitVisitor
- RunDefiningVisitor
- Searcher
- SingleWordDataSource
- StringDataSource
- SuffixLinker
- SuffixOffsetVisitor
- SuffixTree
- SuffixTreeBuilder
- SuffixTreeDB
- TreePrintVisitor
- ValueDepthVisitor
- ValueRange
- WordDataSource
Methods
- ::new — BaseDataSource
- ::new — FileDataSource
- ::new — StringDataSource
- ::new — WordDataSource
- ::new — SingleWordDataSource
- ::new — ArrayWordDataSource
- ::new — DelimitedWordDataSource
- ::new — SuffixTreeDB
- ::new — SuffixTreeBuilder
- ::new — Searcher
- ::new — SuffixTree
- ::new — Location
- ::new — Node
- ::new — NodeFactory
- ::new — BaseVisitor
- ::new — BFS
- ::new — DataSourceVisitor
- ::new — DFS
- ::new — OrderedDFS
- ::new — ValueRange
- ::new — KCommonVisitor
- ::new — LeafCountVisitor
- ::new — NodeCountVisitor
- ::new — BitUtil
- ::new — NumberingVisitor
- ::new — RunBitVisitor
- ::new — LeafNodeCollector
- ::new — LeastCommonAncestorPreprocessing
- ::new — SuffixOffsetVisitor
- ::new — TreePrintVisitor
- ::new — ValueDepthVisitor
- ::new — DeepestValueDepthVisitor
- #addChild — NodeFactory
- #addDataSource — SuffixTree
- #addLeaf — NodeFactory
- #addValue — SuffixTree
- #bitGreaterThanOrEqualTo — BitUtil
- #bucket — DelimitedWordDataSource
- #buildNode — SuffixTreeBuilder
- #countCommon — KCommonVisitor
- #createAccessor — Node
- #createWordCounts — ArrayWordDataSource
- #depth — Location
- #each_suffix — Node
- #each_with_index — BaseDataSource
- #each_word — ArrayWordDataSource
- #extend — SuffixTree
- #extendDataSource — NodeFactory
- #extendWith — BaseDataSource
- #findAtLocation — Searcher
- #findNode — Searcher
- #findResults — Searcher
- #findString — Searcher
- #findWord — Searcher
- #finish — SuffixTree
- #getBit — RunBitVisitor
- #getMask — BitUtil
- #has_terminator? — BaseDataSource
- #has_terminator? — DelimitedWordDataSource
- #incomingEdgeLength — Node
- #isInternal — Node
- #isLeaf — Node
- #isRoot — Node
- #jumpToNode — Location
- #leftBit — BitUtil
- #leftMostBitToRightOf — BitUtil
- #leftOneBit — BitUtil
- #length — ValueRange
- #longestStringCommonTo — KCommonVisitor
- #matchDataSource — Searcher
- #matchDataSource — Location
- #matchValue — Location
- #metaDataFor — DelimitedWordDataSource
- #newChild — NodeFactory
- #newDataSource — DataSourceFactory
- #newNode — NodeFactory
- #newRoot — NodeFactory
- #nextDataSourceBit — NodeFactory
- #nextDataSourceSetSize — NodeFactory
- #nextDataSourceValueAt — BaseDataSource
- #nodeNeedingSuffixLink — SuffixLinker
- #nodeToStr — TreePrintVisitor
- #nodeToStr — DfsTreePrintVisitor
- #nodeToStr — BasicDfsTreePrintVisitor
- #numberValues — StringDataSource
- #numberValues — WordDataSource
- #numberValues — SingleWordDataSource
- #persist — SuffixTreeDB
- #persist — NodeFactory
- #postVisit — BaseVisitor
- #postVisit — DataSourceVisitor
- #postVisit — KCommonVisitor
- #postVisit — LeafCountVisitor
- #postVisit — NodeCountVisitor
- #postVisit — NumberingVisitor
- #postVisit — RunDefiningVisitor
- #postVisit — RunBitVisitor
- #postVisit — LeafNodeCollector
- #postVisit — SuffixOffsetVisitor
- #postVisit — TreePrintVisitor
- #postVisit — DeepestValueDepthVisitor
- #preVisit — BaseVisitor
- #preVisit — NodeCountVisitor
- #preVisit — NumberingVisitor
- #preVisit — RunDefiningVisitor
- #preVisit — RunBitVisitor
- #preVisit — LeafNodeCollector
- #preVisit — SuffixOffsetVisitor
- #preVisit — TreePrintVisitor
- #preVisit — ValueDepthVisitor
- #preprocessLine — WordDataSource
- #process — WordDataSource
- #process — DelimitedWordDataSource
- #processData — WordDataSource
- #processData — DelimitedWordDataSource
- #readInt — SuffixTreeDB
- #reset — NodeFactory
- #resolve — SuffixTreeBuilder
- #resolveChild — SuffixTreeBuilder
- #resolveEntry — SuffixTreeBuilder
- #resolveNodeId — SuffixTreeBuilder
- #resolveParent — SuffixTreeBuilder
- #resolveSuffixLink — SuffixTreeBuilder
- #reverseAddValues — NodeFactory
- #rightBit — BitUtil
- #rightOneBit — BitUtil
- #save — DelimitedWordDataSource
- #setConfiguration — NodeFactory
- #setDataSource — SuffixTree
- #shiftToByteLeft — BitUtil
- #shiftToByteRight — BitUtil
- #splitEdgeAt — NodeFactory
- #terminator — DelimitedWordDataSource
- #toString — FileDataSource
- #toString — StringDataSource
- #toString — WordDataSource
- #traverse — BFS
- #traverse — DFS
- #traverseChildren — DFS
- #traverseChildren — OrderedDFS
- #traverseDownChildValue — Location
- #traverseDownEdgeValue — Location
- #traverseSkipCountDown — Location
- #traverseSuffixLink — Location
- #traverseToNextSuffix — Location
- #traverseUp — Location
- #update — SuffixLinker
- #val — SuffixTreeDB
- #valueAt — FileDataSource
- #valueAt — StringDataSource
- #valueAt — WordDataSource
- #valueAt — SingleWordDataSource
- #valueAt — ArrayWordDataSource
- #valuePath — NodeFactory
- #valueSequence — BaseDataSource
- #verify — ArrayWordDataSource
- #verify — DelimitedWordDataSource
- #wordCount — DelimitedWordDataSource