| adjust | Data.Trie.Internal, Data.Trie |
| adjustBy | Data.Trie |
| adjustWithKey | Data.Trie.Convenience |
| alterBy | Data.Trie.Internal, Data.Trie |
| alterBy_ | Data.Trie.Internal |
| breakMaximalPrefix | Data.Trie.Internal |
| cata | Data.Trie.Internal |
| cata_ | Data.Trie.Internal |
| contextualFilterMap | Data.Trie.Internal |
| contextualMap | Data.Trie.Internal |
| contextualMap' | Data.Trie.Internal |
| contextualMapBy | Data.Trie.Internal |
| delete | Data.Trie |
| deleteSubmap | Data.Trie |
| disunion | Data.Trie.Convenience |
| elems | Data.Trie.Internal, Data.Trie |
| empty | Data.Trie.Internal, Data.Trie |
| filter | Data.Trie.Internal |
| filterA | Data.Trie.Internal |
| filterMap | Data.Trie.Internal, Data.Trie |
| foldlWithKey | Data.Trie.Internal |
| foldlWithKey' | Data.Trie.Internal |
| foldrWithKey | Data.Trie.Internal |
| foldrWithKey' | Data.Trie.Internal |
| fromList | Data.Trie.Internal, Data.Trie |
| fromListL | Data.Trie.Convenience |
| fromListR | Data.Trie.Convenience |
| fromListS | Data.Trie.Convenience |
| fromListWith | Data.Trie.Convenience |
| fromListWith' | Data.Trie.Convenience |
| fromListWithL | Data.Trie.Convenience |
| fromListWithL' | Data.Trie.Convenience |
| insert | Data.Trie |
| insertIfAbsent | Data.Trie.Convenience |
| insertWith | Data.Trie.Convenience |
| insertWith' | Data.Trie.Convenience |
| insertWithKey | Data.Trie.Convenience |
| insertWithKey' | Data.Trie.Convenience |
| intersectBy | Data.Trie.Internal, Data.Trie |
| intersectL | Data.Trie |
| intersectR | Data.Trie |
| intersectWith | Data.Trie.Convenience |
| intersectWith' | Data.Trie.Convenience |
| keys | Data.Trie |
| lookup | Data.Trie |
| lookupBy | Data.Trie |
| lookupBy_ | Data.Trie.Internal |
| lookupWithDefault | Data.Trie.Convenience |
| mapBy | Data.Trie.Internal, Data.Trie |
| match | Data.Trie |
| matches | Data.Trie |
| matches_ | Data.Trie.Internal |
| match_ | Data.Trie.Internal |
| maxAssoc | Data.Trie.Internal |
| member | Data.Trie |
| mergeBy | Data.Trie.Internal, Data.Trie |
| minAssoc | Data.Trie.Internal |
| minMatch | Data.Trie |
| null | Data.Trie.Internal, Data.Trie |
| showTrie | Data.Trie.Internal |
| singleton | Data.Trie.Internal, Data.Trie |
| size | Data.Trie.Internal, Data.Trie |
| submap | Data.Trie.Internal, Data.Trie |
| toList | Data.Trie.Internal, Data.Trie |
| toListBy | Data.Trie.Internal, Data.Trie |
| traverseWithKey | Data.Trie.Internal |
| Trie | Data.Trie.Internal, Data.Trie |
| unionL | Data.Trie |
| unionR | Data.Trie |
| unionWith | Data.Trie.Convenience |
| unionWith' | Data.Trie.Convenience |
| update | Data.Trie.Convenience |
| updateMaxViewBy | Data.Trie.Internal |
| updateMinViewBy | Data.Trie.Internal |
| updateWithKey | Data.Trie.Convenience |
| wip_unionWith | Data.Trie.Internal |
| wither | Data.Trie.Internal |