Serhiy Storchaka added the comment:
No, it's impossible without additional structure. And with a set it is trivial.
def uniqueheappush(heap, inheap, item):
if id(item) in inheap:
return False
heappush(heap, item)
inheap.add(id(item))
return True
def uniqueheappop(heap, inheap):
item = heappop(heap, inheap)
inheap.discard(id(item))
return item
I recomend reject this issue.
----------
nosy: +serhiy.storchaka
_______________________________________
Python tracker <rep...@bugs.python.org>
<http://bugs.python.org/issue18241>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe:
http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
