----------------------------------------------------------------
-- wren ng thornton <wren@community.haskell.org> ~ 2009.01.04
----------------------------------------------------------------
Name: bytestring-trie
Version: 0.1.4
Cabal-Version: >= 1.2
Build-Type: Simple
Stability: beta
Copyright: Copyright (c) 2008--2009 wren ng thornton
License: BSD3
License-File: LICENSE
Author: wren ng thornton
Maintainer: wren@community.haskell.org
Homepage: http://code.haskell.org/~wren/
Category: Data, Data Structures
Synopsis: An efficient finite map from (byte)strings to values.
Description: 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.
Library
Hs-Source-Dirs: src
Exposed-Modules: Data.Trie
, Data.Trie.Internal
, Data.Trie.Convenience
Other-Modules: Data.Trie.BitTwiddle
, Data.Trie.ByteStringInternal
Build-Depends: base, bytestring, binary
----------------------------------------------------------------
----------------------------------------------------------- fin.