Contents
Index
tries-0.0.3: Various trie implementations in Haskell
Index
add
Data.Trie.Pseudo
areDisjoint
Data.Trie.Pseudo
assign
Data.Trie.Pseudo
beginsWith
Data.Trie.Pseudo
BSTrie
1 (Type/Class)
Data.Trie.Class
2 (Data Constructor)
Data.Trie.Class
delete
Data.Trie.Class
elems
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
empty
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
fromAssocs
Data.Trie.Pseudo
fromFoldable
Data.Trie.Class
getBSTrie
Data.Trie.Class
HashMapStep
1 (Type/Class)
Data.Trie.HashMap
2 (Data Constructor)
Data.Trie.HashMap
HashMapTrie
1 (Type/Class)
Data.Trie.HashMap
2 (Data Constructor)
Data.Trie.HashMap
insert
1 (Function)
Data.Trie.Class
2 (Function)
Data.Trie.HashMap
3 (Function)
Data.Trie.Map
intersectionWith
Data.Trie.Pseudo
keys
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
KnuthTrie
1 (Type/Class)
Data.Trie.Knuth
2 (Data Constructor)
Data.Trie.Knuth
ListTrie
1 (Type/Class)
Data.Trie.List
2 (Data Constructor)
Data.Trie.List
lookup
1 (Function)
Data.Trie.Pseudo
2 (Function)
Data.Trie.Class
lookupWithDefault
Data.Trie.Class
makeBSTrie
Data.Trie.Class
MapStep
1 (Type/Class)
Data.Trie.Map
2 (Data Constructor)
Data.Trie.Map
MapTrie
1 (Type/Class)
Data.Trie.Map
2 (Data Constructor)
Data.Trie.Map
match
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
matches
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
member
Data.Trie.Class
merge
Data.Trie.Pseudo
More
Data.Trie.Pseudo
Nil
Data.Trie.Pseudo
notMember
Data.Trie.Class
prune
Data.Trie.Pseudo
PseudoTrie
Data.Trie.Pseudo
Rest
Data.Trie.Pseudo
singleton
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
subtrie
1 (Function)
Data.Trie.HashMap
2 (Function)
Data.Trie.Map
toAssocs
Data.Trie.Pseudo
Trie
Data.Trie.Class
unBSTrie
Data.Trie.Class
unHashMapStep
Data.Trie.HashMap
unHashMapTrie
Data.Trie.HashMap
unKnuthTrie
Data.Trie.Knuth
unListTrie
Data.Trie.List
unMapStep
Data.Trie.Map
unMapTrie
Data.Trie.Map