down_heap overloads

Synopses

Declared in <folly/algorithm/BinaryHeap.h>

Companion to std::push/pop_heap(). Restores the heap property if the heap's top is modified, using std::less as the comparator.

template<class RandomIt>
void
down_heap(
    RandomIt first,
    RandomIt last);

Companion to std::push/pop_heap(). Restores the heap property if the heap's top is modified.

template<
    class RandomIt,
    class Compare>
void
down_heap(
    RandomIt first,
    RandomIt last,
    Compare comp);

Parameters

Name

Description

first

Iterator to the first element of the heap range.

last

Iterator past the last element of the heap range.

comp

Comparator defining the heap ordering.

Created with MrDocs