The bytestring-trie package

[Tags: bsd3, library]

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.


Properties

Versions0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3
Dependenciesbase, 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/
Upload dateSat Dec 20 05:26:51 UTC 2008
Uploaded byWrenThornton
DistributionsFedora:0.2.3, NixOS:0.2.3
Downloads2787 total (377 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees