bytestring-trie: An efficient finite map from (byte)strings to values.

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.

Modules

[Index]

Downloads

• bytestring-trie-0.1.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

Package maintainers

• WrenThornton, WrenRomano

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates