bytestring-trie: Efficient map from strings to values.
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.
| 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 (<4.8), bytestring [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2008--2009 wren ng thornton |
| Author | wren ng thornton |
| Maintainer | wren@community.haskell.org |
| Revised | Revision 1 made by phadej at Tue Apr 3 11:26:56 UTC 2018 |
| Category | Data, Data Structures |
| Home page | http://code.haskell.org/~wren/ |
| Uploaded | by WrenThornton at Sat Dec 20 05:26:51 UTC 2008 |
| Distributions | Fedora:0.2.4.1, LTSHaskell:0.2.4.1, NixOS:0.2.4.1, openSUSE:0.2.4.1 |
| Downloads | 12488 total (39 in the last 30 days) |
| Rating | 2.25 (votes: 2) [estimated by rule of succession] |
| Your Rating | |
| 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 (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.