 | suffixtree-0.2: Efficient, lazy suffix tree implementation | Contents | Index |
| Alphabet | Data.SuffixTree |
| Edge | Data.SuffixTree |
| Leaf | Data.SuffixTree |
| Node | Data.SuffixTree |
| Prefix | Data.SuffixTree |
| STree | Data.SuffixTree |
| construct | Data.SuffixTree |
| constructWith | Data.SuffixTree |
| countLeaves | Data.SuffixTree |
| countRepeats | Data.SuffixTree |
| elem | Data.SuffixTree |
| findEdge | Data.SuffixTree |
| findPath | Data.SuffixTree |
| findTree | Data.SuffixTree |
| fold | Data.SuffixTree |
| foldl | Data.SuffixTree |
| foldr | Data.SuffixTree |
| mkPrefix | Data.SuffixTree |
| prefix | Data.SuffixTree |
| suffixes | Data.SuffixTree |