An RBTree is a fast, balanced efficient data structure with the
following properties:
get O(log n)
set O(log n)
delete O(log n)
min O(log n)
max O(log n)
contains O(log n)
Because the worst case timing is minimal across the range of standard
dict and ordered data operations it makes sense to use this when you
have volatile/dynamic sorted data.
In common usage its nearly as fast as the Python dict impl but has a
slightly more expensive usage of the compare function as the keys are
ordered and not hashed.
WWW: http://www.python.org/pypi/RBTree/
03ad0df1b9