Dela via

make_heap (STL/CLR)

  • Artikel

Converts elements from a specified range into a heap in which the first element is the largest and for which a sorting criterion may be specified with a binary predicate.

template<class _RanIt> inline
    void make_heap(_RanIt _First, _RanIt _Last);
template<class _RanIt, class _Pr> inline
    void make_heap(_RanIt _First, _RanIt _Last, _Pr _Pred);

Remarks

This function behaves the same as the STL function make_heap. For more information, see make_heap.

Requirements

Header: <cliext/algorithm>

Namespace: cliext

See Also

Reference

algorithm (STL/CLR)