Heap functions

Functions
template<class RandomAccessIterator >
constexpr void	AZStd::push_heap (RandomAccessIterator first, RandomAccessIterator last)
	Pushes values to the heap using AZStd::less predicate. CStd.
template<class RandomAccessIterator , class Compare >
constexpr void	AZStd::push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	Pushes values to the heap using provided binary predicate Compare. CStd.
template<class RandomAccessIterator >
constexpr void	AZStd::pop_heap (RandomAccessIterator first, RandomAccessIterator last)
	Prepares heap for popping a value using AZStd::less predicate. CStd.
template<class RandomAccessIterator , class Compare >
constexpr void	AZStd::pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	Prepares heap for popping a value using Compare predicate. CStd.
template<class RandomAccessIterator >
constexpr void	AZStd::pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator result)
	[Extension] Same as AZStd::pop_heap using AZStd::less predicate, but allows you to provide iterator where to store the result.
template<class RandomAccessIterator , class Compare >
constexpr void	AZStd::pop_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator result, Compare comp)
	[Extension] Same as AZStd::pop_heap using Compare predicate, but allows you to provide iterator where to store the result.
template<class RandomAccessIterator >
constexpr void	AZStd::make_heap (RandomAccessIterator first, RandomAccessIterator last)
	Make a heap from an array of values, using AZStd::less predicate. CStd.
template<class RandomAccessIterator , class Compare >
constexpr void	AZStd::make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	Make a heap from an array of values, using Compare predicate. CStd.
template<class RandomAccessIterator >
constexpr void	AZStd::sort_heap (RandomAccessIterator first, RandomAccessIterator last)
	Preforms a heap sort on a range of values, using AZStd::less predicate. CStd.
template<class RandomAccessIterator , class Compare >
constexpr void	AZStd::sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	Preforms a heap sort on a range of values, using Compare predicate. CStd.

Detailed Description