C++ Reference: class PriorityQueueWithRestrictedPush
This documentation is automatically generated.
Clears the queue.
Is the queue empty?
Returns the element with highest priority and remove it from the queue. IsEmpty() must be false, this condition is DCHECKed.
Push a new element in the queue. Its priority must be greater or equal to the highest priority present in the queue, minus one. This condition is DCHECKed, and violating it yields erroneous queue behavior in NDEBUG mode.