Skip to content
Red-black tree implementation in C with OCaml
OCaml C
Find file
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.
bin
lib
.gitignore
.merlin
LICENSE
Makefile
README.md
_oasis
_tags
configure
logo.gif
myocamlbuild.ml
setup.ml

README.md

RainBow

Rainbow

This is an imperfect implementation of red-black tree in C with OCaml. I wanted to see if a C implementation would be faster than OCaml but I don’t know because I’m too lazy to do the benchmark. Then it is imperfect because for Poney module, it misses the remove (for those who have already implemented a red-black tree know what I mean) because it would keep up with the garbage collector.

So if you have ideas to save the little Poney, I’m listening.

Finally, there is the Unicorn module. It almost works, we can notify a bug in main.ml by adding Gc.compact (). So for those who are curious, here is my super implementation. Of course, the image is linked to the horror that you can see in this code.

Something went wrong with that request. Please try again.