The bytestring-trie package
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.
Properties
| Versions | 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 |
|---|---|
| Dependencies | base, bytestring [details] |
| License | BSD3 |
| Copyright | Copyright (c) 2008--2009 wren ng thornton |
| Author | wren ng thornton |
| Maintainer | wren@community.haskell.org |
| Category | Data, Data Structures |
| Home page | http://code.haskell.org/~wren/ |
| Uploaded | Sat Dec 20 05:26:51 UTC 2008 by WrenThornton |
| Distributions | Fedora:0.2.4.1, LTSHaskell:0.2.4.1, NixOS:0.2.4.1, Stackage:0.2.4.1, Tumbleweed:0.2.4.1 |
| Downloads | 9399 total (605 in the last 30 days) |
| Votes | |
| Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |
Downloads
- bytestring-trie-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)