[issue1324770] Adding redblack tree to collections module
Georg Brandl ge...@python.org added the comment: Let's reject it then. -- nosy: +georg.brandl resolution: - rejected status: open - closed ___ 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
[issue1324770] Adding redblack tree to collections module
Daniel Stutzbach dan...@stutzbachenterprises.com added the comment: I agree with Raymond. In general, the collections module should define containers that are named after their function rather than their implementation. That way the implementation can be changed at a later date (or in other Python implementations) without causing confusion, and it makes it more obvious what use-case the new collection is solving. That's my opinion, anyway. As much as I'd love to see more container types in the collections module (my kingdom for a heap with .decrease_key()!), I don't see what use-case this implementation of red-black trees fills. -- nosy: +stutzbach ___ 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
[issue1324770] Adding redblack tree to collections module
Changes by Daniel Diniz aja...@gmail.com: -- stage: - test needed type: - feature request versions: +Python 2.7, Python 3.1 -Python 2.5 ___ 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
[issue1324770] Adding redblack tree to collections module
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
