heapify()

template<typename Iterator, typename Compare>

void fl::detail::heapify	(	Iterator	first,
		Iterator	last,
		Compare	comp )

Definition at line 385 of file algorithm.h.

                                                                       {
    Iterator start = first + (last - first - 2) / 2;
    
    while (true) {
        sift_down(first, start, last - 1, comp);
        if (start == first) {
            break;
        }
        --start;
    }
}

References fl::FL_NO_EXCEPT, and sift_down().

Referenced by heap_sort().

Here is the call graph for this function:

Here is the caller graph for this function: