Red Black Tree implementation?

[Dan Stromberg]

On Wed, May 1, 2013 at 7:06 PM, duncan smith <buzzard at invalid.invalid>wrote:

> I have an implementation that you can try out. It's not based on any other
> implementation, so my bugs will be independent of any bugs in the code
> you're currently using. It looks more like a set - add, remove, discard.
> Not tried on Python 3 or run through pylint. I just tried adding a million
> items to a tree, and it takes about 25% longer to add items at the end
> compared to those at the beginning. Timing removals uncovered a bug. So if
> you want the code I'll fix the bug and send it (to your gmail e-mail
> address?). Cheers.
>
> Duncan
> --
> http://mail.python.org/**mailman/listinfo/python-list<http://mail.python.org/mailman/listinfo/python-list>
>

What license?

Thanks!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/python-list/attachments/20130502/c95e7b6f/attachment.html>