Paul Rubin wrote: > "zooko" <[EMAIL PROTECTED]> writes: > > I haven't benchmarked it against Evan Podromou's heap implementation > > yet, but obviously inserting and removing things from a heapq heap is > > O(N). > > Good heavens, I should hope not. The whole point of heaps is that > those operations are O(log(N)).
Oh, you are right -- Python's heapq implementation does not naively do list.pop(0). How silly of me to think that Kevin O'Connor, Tim Peters, and Raymond Hettinger would be so silly. Regards, Zooko -- http://mail.python.org/mailman/listinfo/python-list
