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]

Flags

Automatic Flags

Name	Description	Default
base4	base-4.0 deprecated Prelude which is imported qualified	Enabled
usecinternal	Use optimized C implementation for indexOfDifference. See notes in Data.Trie.ByteStringInternal.	Disabled
applicativeinbase	Applicative functors were added in base-2.0	Enabled
bytestringinbase	The bytestring library was included in base-2.0 and base-2.1.1, but for base-1.0 and base-3.0 it was a separate package	Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

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