title: Is there a heap class in C++ that supports changing the priority of elements other than the head?
body: <p>I have a priority queue of events, but sometimes the event priorities change, so I'd like to maintain iterators from the event requesters into the heap.  If the priority changes, I'd like the heap to be adjusted in log(n) time.  I will always have exactly one iterator pointing to each element in the heap.</p>