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

Versions 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
Dependencies base, binary, bytestring [details]
License BSD3
Copyright Copyright (c) 2008--2009 wren ng thornton
Author wren ng thornton
Maintainer wren@community.haskell.org
Stability beta
Category Data, Data Structures
Home page http://code.haskell.org/~wren/
Uploaded Tue Jan 6 01:02:29 UTC 2009 by WrenThornton
Distributions Fedora:0.2.4.1, LTSHaskell:0.2.4.1, NixOS:0.2.4.1, Stackage:0.2.4.1, Tumbleweed:0.2.4.1
Downloads 7393 total (22 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees