bytestring-trie: An efficient finite map from (byte)strings to values.
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.)
[Skip to Readme]
Downloads
- bytestring-trie-0.2.5.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3, 0.2.4, 0.2.4.1, 0.2.4.3, 0.2.5.0, 0.2.5.1, 0.2.5.2, 0.2.5.3, 0.2.6, 0.2.7, 0.2.7.1, 0.2.7.2, 0.2.7.3 |
|---|---|
| Change log | CHANGELOG |
| Dependencies | base (>=4.5 && <4.16), binary (>=0.5.1 && <0.8.9), bytestring (>=0.9.2 && <0.11) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2008--2021 wren gayle romano |
| Author | wren gayle romano |
| Maintainer | wren@cpan.org |
| Category | Data, Data Structures |
| Home page | http://wrengr.org |
| Source repo | head: git clone https://github.com/wrengr/bytestring-trie.git |
| Uploaded | by WrenRomano at 2021-10-16T21:10:38Z |
| Distributions | Fedora:0.2.7.2, LTSHaskell:0.2.7.2, NixOS:0.2.7.2 |
| Reverse Dependencies | 24 direct, 356 indirect [details] |
| Downloads | 24361 total (92 in the last 30 days) |
| Rating | 2.5 (votes: 4) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-10-16 [all 1 reports] |
Readme for bytestring-trie-0.2.5.1
[back to package description]bytestring-trie
The bytestring-trie package provides an efficient implementation
of tries mapping ByteString to values. The implementation is
based on Okasaki's big-endian patricia trees, à la IntMap. We
first trie on the elements of 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 individual
ByteStrings 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.)
Install
This is a simple package and should be easy to install. You should be able to use one of the following standard methods to install it.
-- With cabal-install and without the source:
$> cabal install bytestring-trie
-- With cabal-install and with the source already:
$> cd bytestring-trie
$> cabal install
-- Without cabal-install, but with the source already:
$> cd bytestring-trie
$> runhaskell Setup.hs configure --user
$> runhaskell Setup.hs build
$> runhaskell Setup.hs haddock --hyperlink-source
$> runhaskell Setup.hs copy
$> runhaskell Setup.hs register
The Haddock step is optional.
Portability
The implementation is quite portable, relying only on a few basic language extensions. The complete list of extensions used is:
- CPP
- MagicHash
- NoImplicitPrelude