trie-simple
Simple Map-based Trie
| Version on this page: | 0.4.2@rev:5 |
| LTS Haskell 23.1: | 0.4.3 |
| Stackage Nightly 2024-12-27: | 0.4.3 |
| Latest on Hackage: | 0.4.3 |
trie-simple-0.4.2@sha256:0b7bbdd8b88eea81c99302754442b5724bf376f359c901bcb8288103d4cde6b3,3096Module documentation for 0.4.2
trie-simple
Trie data structure TMap to hold mapping from list of characters to
something, i.e. isomorphic to Map [c] v.
This package also contains TSet, which is isomorphic to Set of lists of
characters.
This package implements these structures using Map from containers
package, and require the character type to be only Ord.
Advantages of using this package over Map or Set are:
- 2x Faster
lookup(member) operation - Retrieving subset of map or set with given prefix
append,prefixes, andsuffixessupport- Can be more memory-efficient (but not always; needs benchmark anyway).
Benchmarks
Benchmarks compared against plain Map and Set.
Each of these benchmarks has two sets of point and errorbars, representing two datasets they are run against.
About License
LICENSE tells the licence of this project, EXCEPT one file for benchmark input data. See ABOUT for that file.
If you install trie-simple from Hackage, that input data is not
included in the distributed files.