[issue1324770] Adding redblack tree to collections module

[Raymond Hettinger]

Raymond Hettinger <rhettinger at users.sourceforge.net> added the comment:

I'm curious what the use case is for this.  It is not the purpose of the
collections module to implement all possible storage techniques
(b-trees, pairing heaps and whatnot).  What problem is being solved?

AFAICT, this offers a ordered dictionary style API without the
restriction of hashability, instead using the typically much more
expensive compare operation.  Also, the big-oh times degrade from O(1)
so that now we have O(log n) searches, insertions, and deletions.

----------
nosy: +rhettinger

_______________________________________
Python tracker <report at bugs.python.org>
<http://bugs.python.org/issue1324770>
_______________________________________