push_heap() [1/2]

template<typename Iterator>

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

Definition at line 52 of file priority_queue.h.

                                                                           {
    using value_type = typename fl::remove_reference<decltype(*first)>::type;
    push_heap(first, last, [](const value_type &a, const value_type &b) { return a < b; });
}

References push_heap().

Here is the call graph for this function: