radisversion
Radix tree implementation
Radis is a little library to provide an implementation of a Radix tree (specialized with a scalar key - like a string, bigarray or array). This project is a part of ocaml-git to have a fast access to an immutable store. In this way, remove operation should be the slowest operation and this data-structure is focused on lookup operation when the key is specifically a hash (see digestif).
The idea behind this library is to provide a fast access to an immutable store
(like git). So, in my mind, if we put a new object in this store, it can not be
deleted. It's why remove operation should be slow - of course, in a git store,
it's possible to delete an useless object (see git gc
), however this
computation does not appear in this way.
Author | Romain Calascibetta <romain.calascibetta@gmail.com> |
---|---|
License | MIT |
Published | |
Homepage | https://github.com/dinosaure/radis |
Issue Tracker | https://github.com/dinosaure/radis/issues |
Maintainer | Romain Calascibetta <romain.calascibetta@gmail.com> |
Dependencies | |
Source [http] | https://github.com/dinosaure/radis/releases/download/v0.1/radis-0.1.tbz sha256=d16b9fa66a922960fd25d8c80510ddb6264b11baab9ff966f41542111f80b93d md5=1a8b674f1159f67acb8d03fa46c5d5e7 |
Edit | https://github.com/ocaml/opam-repository/tree/master/packages/radis/radis.0.1/opam |
No package is dependent