radix-tree: Radix tree data structive over short byte-strings
This module provides a memory-efficient map from Data.ByteString.Short keys to arbitrary values implemented as a radix tree datastructure. Memory efficiency is achieved by sharing common prefixes of all keys.
Downloads
- radix-tree-0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1, 1.0.0.0, 1.0.0.1, 1.0.0.2, 1.1.0.0 |
|---|---|
| Dependencies | base (>=4.9 && <5), bytestring, containers, deepseq, primitive [details] |
| Tested with | ghc ==8.0.2, ghc ==8.2.2, ghc ==8.4.3 |
| License | BSD-3-Clause |
| Copyright | (c) 2018 Sergey Vinokurov |
| Author | Sergey Vinokurov |
| Maintainer | Sergey Vinokurov <serg.foo@gmail.com> |
| Category | Data Structures |
| Home page | https://github.com/sergv/radix-tree |
| Source repo | head: git clone https://github.com/sergv/radix-tree.git |
| Uploaded | by SergeyVinokurov at 2018-08-26T19:19:29Z |
| Distributions | LTSHaskell:1.1.0.0, NixOS:1.1.0.0, Stackage:1.1.0.0 |
| Reverse Dependencies | 2 direct, 0 indirect [details] |
| Downloads | 966 total (2 in the last 30 days) |
| Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2024-04-20 [all 3 reports] |