pseudo-trie-0.0.4.3: A tagged rose-tree with short circuited unique leaves

Index

addData.Trie.Pseudo
areDisjointData.Trie.Pseudo
assign 
1 (Function)Data.Trie.Pseudo
2 (Function)Data.Trie.Rooted
beginsWithData.Trie.Pseudo
childrenData.Trie.Rooted
fromAssocsData.Trie.Pseudo
intersectionWithData.Trie.Pseudo
lookup 
1 (Function)Data.Trie.Pseudo
2 (Function)Data.Trie.Rooted
lookupNearestParent 
1 (Function)Data.Trie.Pseudo
2 (Function)Data.Trie.Rooted
merge 
1 (Function)Data.Trie.Pseudo
2 (Function)Data.Trie.Rooted
MergeRooted 
1 (Type/Class)Data.Trie.Rooted
2 (Data Constructor)Data.Trie.Rooted
MoreData.Trie.Pseudo
NilData.Trie.Pseudo
pruneData.Trie.Pseudo
PseudoTrieData.Trie.Pseudo
pushData.Trie.Rooted
RestData.Trie.Pseudo
rootData.Trie.Rooted
Rooted 
1 (Type/Class)Data.Trie.Rooted
2 (Data Constructor)Data.Trie.Rooted
toAssocsData.Trie.Pseudo
unionWithData.Trie.Rooted
unMergeRootedData.Trie.Rooted