mirror of
https://gitlab.com/fbb-git/cppannotations
synced 2024-11-18 10:06:54 +01:00
79023426de
git-svn-id: https://cppannotations.svn.sourceforge.net/svnroot/cppannotations/trunk@112 f6dd340e-d3f9-0310-b409-bdd246841980
26 lines
1 KiB
Text
26 lines
1 KiB
Text
hi(sort_heap())
|
|
itemization(
|
|
it() Header file:
|
|
centt(#include <algorithm>)
|
|
it() Function prototypes:
|
|
itemization(
|
|
itt(void sort_heap(RandomAccessIterator first,
|
|
RandomAccessIterator last);)
|
|
itt(void sort_heap+OPENPARRandomAccessIterator first,
|
|
RandomAccessIterator last,)linebreak()tt(Compare comp+CLOSEPAR;)
|
|
)
|
|
it() Description:
|
|
itemization(
|
|
it() The first prototype: assuming the elements in the range
|
|
rangett(first, last) form a valid max-heap, the elements in the range
|
|
rangett(first, last) are sorted using ti(operator<()) of the data type to
|
|
which the iterators point.
|
|
it() The second prototype: assuming the elements in the range
|
|
rangett(first, last) form a valid heap, the elements in the range
|
|
rangett(first, last) are sorted using the binary comparison function
|
|
object tt(comp) to compare elements.
|
|
)
|
|
IFDEF(html)(
|
|
it() Follow this link for a small link(example)(HEAPDEMO) of a program
|
|
using tt(sort_heap()).)()
|
|
)
|