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

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.


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.


Versions0.1, 0.1
Change logNone available
Dependenciesbase (>=4.9 && <5), bytestring, containers, deepseq, primitive [details]
Copyright(c) 2018 Sergey Vinokurov
AuthorSergey Vinokurov
MaintainerSergey Vinokurov <serg.foo@gmail.com>
CategoryData Structures
Home pagehttps://github.com/sergv/radix-tree
Source repositoryhead: git clone https://github.com/sergv/radix-tree.git
UploadedSun Aug 26 19:19:16 UTC 2018 by SergeyVinokurov



Maintainers' corner

For package maintainers and hackage trustees