[issue18241] Add unique option to heapq functions

Change by Raymond Hettinger : -- resolution: -> rejected stage: -> resolved status: open -> closed ___ Python tracker ___ ___

[issue18241] Add unique option to heapq functions

Irit Katriel added the comment: I would dedup when extracting items from the queue, because it is trivial to find duplicates then. It can be done with a simple wrapper, without any changes to the queue. -- nosy: +iritkatriel ___ Python tracker

[issue18241] Add unique option to heapq functions

New submission from Antoine Pitrou: In one application, I would like to use a heap as an allocation pool. I also want to check that a given value isn't released twice, therefore that the heap contains unique values. My use case would be solved nicely if heappush() took an optional

[issue18241] Add unique option to heapq functions

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,

[issue18241] Add unique option to heapq functions

Antoine Pitrou added the comment: No, it's impossible without additional structure. And with a set it is trivial. Yeah, I wanted to avoid the memory overhead of a set. -- ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue18241