This is my implementation of Red-Black Trees for OCaml. It is based upon Red-Black Trees in a Functional Setting by Chris Okasaki in Journal of Functional Programming, 9(4):471-477, July 1999.
The Red-Black Trees are exposed via a map and a set API, which is designed to be compatible with the Map and Set modules in the OCaml standard library (which are implemented using AVL trees). You can use the Rbmap and Rbset modules as drop-in replacement for the Map and Set modules.
This implementation is licensed under the Simplified BSD License. See the LICENSE file for details.
If you come across any problems, please create a ticket and we will try to get it fixed as soon as possible.
Once you've made your commits:
- Fork ocaml-rbtrees.
- Create a topic branch -
git checkout -b my_branch. - Push to your topic branch -
git push origin my_branch. - Create a Pull Request from your topic branch.
- That's it!
Benedikt Meurer :: benedikt.meurer@googlemail.com :: @bmeurer
Copyright (c) 2007-2011 Benedikt Meurer. See the License file for details.