The bytestring-trie package
An efficient finite map from (byte)strings to values.
The implementation is based on big-endian patricia trees, like Data.IntMap. We first trie on the elements of Data.ByteString and then trie on the big-endian bit representation of those elements. Patricia trees have efficient algorithms for union and other merging operations, but they're also quick for lookups and insertions.
If you are only interested in being able to associate strings to values, then you may prefer the hashmap package which is faster for those only needing a map-like structure. This package is intended for those who need the extra capabilities that a trie-like structure can offer (e.g., structure sharing to reduce memory costs for highly redundant keys, taking the submap of all keys with a given prefix, contextual mapping, extracting the minimum and maximum keys, etc.)
|Versions||0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3|
|Dependencies||base (<2.0), binary, bytestring or|
base (≥2.0 & <2.2), binary or
base (3.*), binary, bytestring or
base (4.*), binary, bytestring
|Copyright||Copyright (c) 2008--2011 wren ng thornton|
|Author||wren ng thornton|
|Category||Data, Data Structures|
|Source repository||darcs get http://community.haskell.org/~wren/bytestring-trie|
|Upload date||Sat Feb 12 11:07:27 UTC 2011|
|Built on||ghc-7.0, ghc-7.2|
|Distributions||Fedora: 0.2.3, NixOS: 0.2.3|