 | list-tries-0.1: Tries and Patricia tries: finite sets and maps for list keys | Source code | Contents | Index |
| Data.ListTrie.Set.Ord |
| type TrieSet = TrieSet Map | Source |
| |||||
| |||||
| Description | |||||
| A set of lists of elements that can be totally ordered, based on a trie. | |||||
| Documentation | |||||
| |||||
| module Data.ListTrie.Set | |||||
| Produced by Haddock version 2.6.0 |