Raymond Hettinger <rhettin...@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 <rep...@bugs.python.org> <http://bugs.python.org/issue1324770> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com