Module bcmp::treematch [−] [src]

TreeMatch is a binary matching algorithm based on a suffix tree to retrieve matching strings.

The suffix tree is built in linear time using Ukkonen's algorithm.

Structs

Node	A node in the `SuffixTree`
SuffixTree	A suffix tree.
TreeMatchIterator	An iterator over all the `Match` bewteen two pieces of data.

Keyboard Shortcuts

?: Show this help dialog
S: Focus the search field
⇤: Move up in search results
⇥: Move down in search results
⏎: Go to active search result
+: Collapse/expand all sections

Search Tricks

Prefix searches with a type followed by a colon (e.g. fn:) to restrict the search to a given type.

Accepted types are: fn, mod, struct, enum, trait, type, macro, and const.

Search functions by type signature (e.g. vec -> usize or * -> vec)