Message191371
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. |
|
Date |
User |
Action |
Args |
2013-06-17 20:05:03 | serhiy.storchaka | set | recipients:
+ serhiy.storchaka, rhettinger, pitrou |
2013-06-17 20:05:03 | serhiy.storchaka | set | messageid: <1371499503.0.0.702836521951.issue18241@psf.upfronthosting.co.za> |
2013-06-17 20:05:02 | serhiy.storchaka | link | issue18241 messages |
2013-06-17 20:05:02 | serhiy.storchaka | create | |
|