m_tree
An implementation of M-trees
Description
M-trees are an index for metric data that support efficient insertion and range queries.
Install
copied = false, 2000)"
:class="{ 'border-gray-700': !copied, 'text-gray-100': !copied, 'focus:ring-orange-500': !copied, 'focus:border-orange-500': !copied, 'border-green-600': copied, 'text-green-600': copied, 'focus:ring-green-500': copied, 'focus:border-green-500': copied }">
- Published
- 31 Mar 2022
- Authors
- Maintainers
Sources
m_tree-0.1.tbz
sha256=21afe9d04e0fb539a1fff94efdce893e1763ae8f9807c757b40e315d38292d66
sha512=e778037047e3f8a3e53c8799fdf9d270149305d70b24d1dd6a5c76081a2b69698b43ecbc04073a5f78da9855b13c7376076fd1e468153579fe400b0860ec6c5e
Dependencies
odoc
with-doc
ppx_assert
with-test & >= "v0.14"
ppx_compare
with-test & >= "v0.14"
ppx_sexp_conv
with-test & >= "v0.14"
ppx_sexp_message
with-test & >= "v0.14"
ppx_expect
with-test & >= "v0.14"
core_bench
with-test & >= "v0.14"
core
with-test & >= "v0.14"
iter
>= "1.4"
dune
>= "3.0"
ocaml
>= "4.12"
Reverse Dependencies