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 "unique=False" parameter.

Note that I haven't checked if doing so is possible while maintaining the O(log n) complexity :-)