package camldiets
A highly efficient OCaml set implementation for fat sets, i.e. densely populated sets over a discrete linear order
Install
Dune Dependency
Authors
Maintainers
Sources
camldiets-0.3.tbz
sha256=53835314f6a6a15ef01790a5a1aa1e2097566de9b4bc0c424e9a694fcaa90c7f
sha512=0de67240cdb1fa582e43c7580875cdcdcb18cc4a1bacf46b395c26608009319c3d1474d1463ad5c552b367f3b3110ef50de8abeb058184f66b5dd1d70abea810
Description
A highly efficient OCaml set implementation for fat sets, i.e. densely populated sets over a discrete linear order.
Published: 07 Apr 2025
README
Camldiets
Version 0.3, Copyright (c) 2013-2025
A highly efficient OCaml set implementation for fat sets, i.e. densely populated sets over a discrete linear order.
It is developed and maintained by:
- (c) Oliver Friedmann, University of Munich (http://oliverfriedmann.com)
- (c) Martin Lange, University of Kassel (http://carrick.fmv.informatik.uni-kassel.de/~mlange/)
OPAM
You can install this package via OPAM under the name Camldiets
.
Credits
The code for handling the AVL trees is borrowed from the Objective Caml Standard Library Set module. (c) Xavier Leroy, projet Cristal, INRIA Rocquencourt
Commands
Build
dune build
Release
- Change version in
dune-project
. - Update
CHANGES.md
. - Run
dune build
. - Commit
git status
git add -A
git commit -m "message"
git tag v0.x [--force]
git push origin master --tags [--force]
- Release
dune-release tag
dune-release distrib
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page