radix-tree: Radix tree data structive over short byte-strings

[ bsd3, data-structures, library ] [ Propose Tags ]

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.


  • Data
    • Data.RadixTree
      • Data.RadixTree.Internal


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 0.1
Dependencies base (>=4.9 && <5), bytestring, containers, deepseq, primitive [details]
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 NixOS:0.1
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 616 total (8 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
Last success reported on 2018-08-26 [all 2 reports]