I have just released rbdict, a dictionary as a Red-Black tree.<br><br>This is a dict compatible dictionary based on Red-Black trees. It
supports the full dict interface and is drop-in compatible with both
dict and orddict. Documentation is included.
<br>There is also an alternate implementation, in rbdict1, which is a
little slower but is included as another example of working on
red-black trees. These are tricky little bastards so it is helpful to
see other implementations.<br><br>It is down-loadable from <a href="http://trapext.org">trapext.org</a>:<br><br><a href="http://forum.trapexit.org/viewtopic.php?p=43948#43948">http://forum.trapexit.org/viewtopic.php?p=43948#43948</a><br>
<br>It would be good to see how it fares under the same unit tests as dict, and orddict. Hint, hint!<br><br>