A balanced binary search tree library for OCaml
- OCaml 97.8%
- Makefile 2%
- Dune 0.2%
| announcements | ||
| attic | ||
| benchmark | ||
| src | ||
| test | ||
| .gitattributes | ||
| .gitignore | ||
| AUTHORS.md | ||
| CHANGES.md | ||
| dune-project | ||
| HACKING.md | ||
| headache.config | ||
| header.txt | ||
| LICENSE.txt | ||
| Makefile | ||
| play.ml | ||
| README.md | ||
| TODO.md | ||
Baby: Fast Sets Based on Balanced Binary Search Trees
baby is an OCaml library that offers several implementations of
immutable balanced binary search trees.
Height-balanced and weight-balanced binary search trees are offered out of the box. Furthermore, to advanced users, the library offers a lightweight way of implementing other balancing strategies.
Installation and Usage
Type opam install baby.
In your dune file, add (libraries baby) to the description of
your library or executable.
To use baby's ready-made weight-balanced trees,
just use the functor Baby.W.Set.Make
instead of the usual Set.Make.
Documentation
For more information, please see the documentation of the latest released version.
Information for developers
An overview of the architecture of the library is given in HACKING.md.