----------------------------------------------------------------
-- wren ng thornton <wren@community.haskell.org> ~ 2008.12.19
----------------------------------------------------------------
Name: bytestring-trie
Version: 0.1
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: Efficient map from strings to values.
Description: Efficient map from 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.
Library
Exposed-Modules: Data.Trie
, Data.Trie.Convenience
Other-Modules: Data.Trie.BitTwiddle
, Data.Trie.ByteStringInternal
Build-Depends: base, bytestring
----------------------------------------------------------------
----------------------------------------------------------- fin.