pred-trie-0.0.9: Predicative tries

Index

areDisjoint 
1 (Function)Data.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
childrenData.Trie.Pred.Unified
DMoreData.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
DPredData.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
DPTrieData.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
litExtrude 
1 (Function)Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified
litExtrudeTail 
1 (Function)Data.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
litSingleton 
1 (Function)Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified
litSingletonTail 
1 (Function)Data.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
lookup 
1 (Function)Data.Trie.Pred.Disjoint.Tail
2 (Function)Data.Trie.Pred.Disjoint
3 (Function)Data.Trie.Pred.Unified.Tail
4 (Function)Data.Trie.Pred.Unified
lookupNearestParent 
1 (Function)Data.Trie.Pred.Disjoint.Tail
2 (Function)Data.Trie.Pred.Disjoint
3 (Function)Data.Trie.Pred.Unified.Tail
4 (Function)Data.Trie.Pred.Unified
merge 
1 (Function)Data.Trie.Pred.Disjoint.Tail
2 (Function)Data.Trie.Pred.Disjoint
3 (Function)Data.Trie.Pred.Unified.Tail
4 (Function)Data.Trie.Pred.Unified
RDPTrieData.Trie.Pred.Disjoint
rootData.Trie.Pred.Unified
Rooted 
1 (Data Constructor)Data.Trie.Pred.Disjoint
2 (Data Constructor)Data.Trie.Pred.Unified
RUPTrieData.Trie.Pred.Unified
sort 
1 (Function)Data.Trie.Pred.Disjoint.Tail, Data.Trie.Pred.Disjoint
2 (Function)Data.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
UMoreData.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
UPredData.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified
UPTrieData.Trie.Pred.Unified.Tail, Data.Trie.Pred.Unified