Source Package: ghc-bytestring-trie (0.2.7.6-5.fc44)
An efficient finite map from bytestrings to values
An efficient finite map from bytestrings 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.).
Package information
- Homepage
- [https://hackage.haskell.org/package/bytestring-trie]
- License
- BSD-3-Clause
- Downstream-Paketbetreuer
- mathstufObserved Nov 20, 2026 [source]
The following binary packages are built from this source package:
- ghc-bytestring-trie
An efficient finite map from bytestrings to values
- ghc-bytestring-trie-devel
Haskell bytestring-trie library development files
- ghc-bytestring-trie-doc
Haskell bytestring-trie library documentation
- ghc-bytestring-trie-prof
Haskell bytestring-trie profiling library
