bytestring-trie.cabal

name: bytestring-trie
version: 0.2.5
cabal-version: 1.20
build-type: Simple
license: BSD3
license-file: LICENSE
copyright: Copyright (c) 2008-2015 wren gayle romano
maintainer: none
stability: provisional
synopsis: An efficient finite map from (byte)strings to values.
description:
    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.
    .
    If you are only interested in being able to associate
    strings to values, then you may prefer the @hashmap@
    package which is faster for those only needing a
    map-like structure. This package is intended for
    those who need the extra capabilities that a trie-like
    structure can offer (e.g., structure sharing to
    reduce memory costs for highly redundant keys,
    taking the submap of all keys with a given prefix,
    contextual mapping, extracting the minimum and
    maximum keys, etc.)
category: Data, Data Structures
author: wren gayle romano
extra-source-files:
    AUTHORS

library
    exposed-modules:
        Data.Trie
        Data.Trie.Internal
        Data.Trie.Convenience
    build-depends:
        base >=4.0,
        binary -any,
        bytestring -any
    default-language: Haskell2010
    hs-source-dirs: src
    other-modules:
        Data.Trie.BitTwiddle
        Data.Trie.ByteStringInternal
        Data.Trie.Errors