babyversion
Fast sets based on balanced binary search trees
| Author | François Pottier <francois.pottier@inria.fr> |
|---|---|
| License | LGPL-2.0-only WITH OCaml-LGPL-linking-exception |
| Published | |
| Homepage | https://github.com/fpottier/baby/ |
| Issue Tracker | https://github.com/fpottier/baby/issues |
| Maintainer | François Pottier <francois.pottier@inria.fr> |
| Dependencies | |
| Source [http] | https://github.com/fpottier/baby/archive/20241204.tar.gz md5=2f74310d5ed0396592c92982a9181f17 sha512=927eab8e31f05427b54732b80fe81431606a720979dbc6a67ed1bf42e3581a6d76580440bee0835fac8342e8b1407f685ee5ca6d1f78b5e0e576344525f4e525 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/baby/baby.20241204/opam |
No package is dependent
