sift_down()

template<typename Iterator, typename Compare>

void fl::sift_down	(	Iterator	first,
		Iterator	last,
		Iterator	start,
		Compare	comp )

Definition at line 10 of file priority_queue.h.

                                                                            {
    auto root = start;
    auto child = first + 2 * (root - first) + 1;
 
    while (child < last) {
        if (child + 1 < last && comp(*child, *(child + 1))) {
            ++child;
        }
 
        if (comp(*root, *child)) {
            auto tmp = *root;
            *root = *child;
            *child = tmp;
 
            root = child;
            child = first + 2 * (root - first) + 1;
        } else {
            break;
        }
    }
}

Referenced by pop_heap().

Here is the caller graph for this function: