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

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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.

Downloads

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

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 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, 0.2.4.3, 0.2.5.0, 0.2.5.1, 0.2.5.2, 0.2.5.3, 0.2.6, 0.2.7, 0.2.7.1, 0.2.7.2
Dependencies base (<4.8), binary, bytestring [details]
License BSD-3-Clause
Copyright Copyright (c) 2008--2009 wren ng thornton
Author wren ng thornton
Maintainer wren@community.haskell.org
Revised Revision 1 made by phadej at 2018-04-03T11:24:11Z
Category Data, Data Structures
Home page http://code.haskell.org/~wren/
Uploaded by WrenThornton at 2009-01-04T03:25:22Z
Distributions Fedora:0.2.7.2, LTSHaskell:0.2.7.2, NixOS:0.2.7.2
Reverse Dependencies 24 direct, 356 indirect [details]
Downloads 24234 total (75 in the last 30 days)
Rating 2.5 (votes: 4) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]