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.

[maintain] [Publish]

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.


Versions 0.1, 0.1
Change log None available
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:16Z



Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees