The bytestring-trie package

[Tags: bsd3, library]

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.


Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3, 0.2.4,
Change logNone available
Dependenciesbase, binary, bytestring [details]
CopyrightCopyright (c) 2008--2009 wren ng thornton
Authorwren ng thornton
CategoryData, Data Structures
Home page
UploadedSat Jan 10 12:59:00 UTC 2009 by WrenThornton
DistributionsFedora:0.2.4, LTSHaskell:, NixOS:, Stackage:
Downloads7022 total (53 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees