babyversion Documentation on ocaml.org
Fast sets and maps 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/20260620.tar.gz md5=594038f60703b23c3e3525bb6ef0ecdb sha512=72afda3356f029900112973f8dea89a9a5758d5aaa4c3408b78de80ecf8eefe2d230ba679c0f71b5f90c72d3c3158c8f32b9c9e894ad8b18a8df88ec732455d5 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/baby/baby.20260620/opam |
No package is dependent
