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.


Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3, 0.2.4
Dependenciesbase, binary, bytestring
LicenseBSD3
CopyrightCopyright (c) 2008--2009 wren ng thornton
Authorwren ng thornton
Maintainerwren@community.haskell.org
Stabilitybeta
CategoryData, Data Structures
Home pagehttp://code.haskell.org/~wren/
UploadedTue Jan 6 01:02:29 UTC 2009 by WrenThornton
DistributionsFedora:0.2.3, NixOS:0.2.4, Stackage:0.2.4
Downloads4060 total (346 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees