pop_heap() [1/2]

template<typename Iterator>

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

Definition at line 61 of file priority_queue.h.

                                                                          {
    pop_heap(first, last, [](const auto &a, const auto &b) { return a < b; });
}

References pop_heap().

Here is the call graph for this function: