babyversion Documentation on ocaml.org
Fast sets based on balanced binary search trees
| Author | François Pottier |
|---|---|
| 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 |
| Dependencies | |
| Source [http] | https://github.com/fpottier/baby/archive/20240619.tar.gz md5=a4cac6451fdd5e43151912e47c64971f sha512=3f6bd90cd53ee9eec7a1840a84c2f3fc39a67cd3c2129bce0efde4ec2f7005b18460a844a56c6f2d78608680814e649a998d22e724ee911c192c6e8f5b092d8a |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/baby/baby.20240619/opam |
No package is dependent


