pop_heap() [2/2]

template<typename Iterator, typename Compare>

void fl::pop_heap	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 52 of file priority_queue.h.

                                                           {
    --last;
    auto tmp = *first;
    *first = *last;
    *last = tmp;
 
    sift_down(first, last, first, comp);
}

References sift_down().

Referenced by fl::PriorityQueue< T, Compare, VectorT >::pop(), and pop_heap().

Here is the call graph for this function:

Here is the caller graph for this function: