The bytestring-trie package
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.
Properties
| Versions | 0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2.2, 0.2.3 |
|---|---|
| Dependencies | base, binary, bytestring |
| License | BSD3 |
| Copyright | Copyright (c) 2008--2009 wren ng thornton |
| Author | wren ng thornton |
| Maintainer | wren@community.haskell.org |
| Stability | beta |
| Category | Data, Data Structures |
| Home page | http://code.haskell.org/~wren/ |
| Upload date | Tue Jan 6 01:02:29 UTC 2009 |
| Uploaded by | WrenThornton |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Fedora: 0.2.3, NixOS: 0.2.3 |
Modules
Downloads
- bytestring-trie-0.1.2.tar.gz (Cabal source package)
- package description (included in the package)