Flexible python implementation of red black trees
A pair of python modules implementing red black trees is provided.
Red-black trees are a little slower than treaps (some question this), but they give a nice low standard deviation in operation times, and this code is rather flexible.
A module is provided for red black trees that enforce uniqueness. They allow for set-like use and dictionary-like use.
This code is known to work on CPython 2.x, CPython 3.x, Pypy and Jython.
Much of the work here was done by Duncan G. Smith. Dan just put some finishing touches on it.