Module bcmp::hashmatch
[−]
[src]
HashMatch is a binary matching algorithm based on a HashMap to retrieve the begining of
matching strings.
It relies on using a HashMatchKey long enough to
weed out "random" matches to obtain linear time performances. This
HashMatchKey offers a tradeoff between the speed and the minimal
matching length.
Structs
| HashMatchIterator |
An iterator over all the |
Traits
| HashMatchKey |
Trait marking types which can be used as a matching key in the |