Message83895
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. |
|
Date |
User |
Action |
Args |
2009-03-21 00:14:35 | rhettinger | set | recipients:
+ rhettinger, loewis, hyeshik.chang |
2009-03-21 00:14:35 | rhettinger | set | messageid: <1237594475.05.0.6453245892.issue1324770@psf.upfronthosting.co.za> |
2009-03-21 00:14:33 | rhettinger | link | issue1324770 messages |
2009-03-21 00:14:32 | rhettinger | create | |
|