tries-0.0.3: Various trie implementations in Haskell

Index

addData.Trie.Pseudo
areDisjointData.Trie.Pseudo
assignData.Trie.Pseudo
beginsWithData.Trie.Pseudo
BSTrie 
1 (Type/Class)Data.Trie.Class
2 (Data Constructor)Data.Trie.Class
deleteData.Trie.Class
elems 
1 (Function)Data.Trie.HashMap
2 (Function)Data.Trie.Map
empty 
1 (Function)Data.Trie.HashMap
2 (Function)Data.Trie.Map
fromAssocsData.Trie.Pseudo
fromFoldableData.Trie.Class
getBSTrieData.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
intersectionWithData.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
lookupWithDefaultData.Trie.Class
makeBSTrieData.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
memberData.Trie.Class
mergeData.Trie.Pseudo
MoreData.Trie.Pseudo
NilData.Trie.Pseudo
notMemberData.Trie.Class
pruneData.Trie.Pseudo
PseudoTrieData.Trie.Pseudo
RestData.Trie.Pseudo
singleton 
1 (Function)Data.Trie.HashMap
2 (Function)Data.Trie.Map
subtrie 
1 (Function)Data.Trie.HashMap
2 (Function)Data.Trie.Map
toAssocsData.Trie.Pseudo
TrieData.Trie.Class
unBSTrieData.Trie.Class
unHashMapStepData.Trie.HashMap
unHashMapTrieData.Trie.HashMap
unKnuthTrieData.Trie.Knuth
unListTrieData.Trie.List
unMapStepData.Trie.Map
unMapTrieData.Trie.Map