| Interface | Description |
|---|---|
| MatchCostFunction<K,V> |
Represents the cost of a match
|
| Class | Description |
|---|---|
| ApproxMatch<K,V> |
Represents an approximate match with a cost
|
| BoundedCostOrderedMap<K,V> |
Map that is sorted by cost.
|
| ExactMatchCost<K,V> |
Exact match cost function
|
| Match<K,V> |
Represent a matched span over sequence of elements
|
| MatchCostFunction.AbstractMatchCostFunction<K,V> | |
| MultiMatch<K,V> |
Represent multimatches
|
| TrieMap<K,V> |
Map that takes an Iterable as key, and maps it to an value.
|
| TrieMapMatcher<K,V> |
The
TrieMapMatcher provides functions to match against a trie. |
This package contains classes for finding matches in sequences.