Documentation
A map from keys k
to values a
, backed by a trie.
A set of values a
, backed by a trie.
class (Ord k, Buildable (TrieMap k) k, Subset (TrieMap k), Traversable (TrieMap k), SetOp (TrieMap k), Project (TrieMap k)) => TrieKey k Source
A TrieKey k
instance implies that k
is a standardized representation for which a
generalized trie structure can be derived.
TrieKey Word |
|
TrieKey () | |
TrieKey k => TrieKey (Vector k) | |
TrieKey (Vector Word) |
|
Ord k => TrieKey (Ordered k) | |
TrieKey k => TrieKey (Rev k) |
|
TKey k => TrieKey (Key k) | |
(TrieKey k1, TrieKey k2) => TrieKey (Either k1 k2) |
|
(TrieKey k1, TrieKey k2) => TrieKey (k1, k2) |
|