bytestring-trie: Efficient map from strings to values.
Efficient map from 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.
Downloads
- bytestring-trie-0.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
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, 0.2.7.4, 0.2.7.5, 0.2.7.6 |
---|---|
Dependencies | base (<4.8), bytestring [details] |
License | BSD-3-Clause |
Copyright | Copyright (c) 2008--2009 wren ng thornton |
Author | wren ng thornton |
Maintainer | wren@community.haskell.org |
Revised | Revision 1 made by phadej at 2018-04-03T11:26:56Z |
Category | Data, Data Structures |
Home page | http://code.haskell.org/~wren/ |
Uploaded | by WrenThornton at 2008-12-20T05:26:51Z |
Distributions | Fedora:0.2.7.2, LTSHaskell:0.2.7.6, NixOS:0.2.7.5, Stackage:0.2.7.6 |
Reverse Dependencies | 24 direct, 361 indirect [details] |
Downloads | 25342 total (138 in the last 30 days) |
Rating | 2.5 (votes: 4) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |