mirror of
https://gitlab.com/fbb-git/cppannotations
synced 2024-11-16 07:48:44 +01:00
6881bc3814
Annotations. The branches and tags directory are empty, since I couldn't svnadmin import a repostitory dump. Many earlier versions exist, though, and if you want the full archive, just let me know and I'll send you the svnadmin dump of my full C++ Annotations archive. Frank B. Brokken <f.b.brokken@rug.nl> git-svn-id: https://cppannotations.svn.sourceforge.net/svnroot/cppannotations/trunk@3 f6dd340e-d3f9-0310-b409-bdd246841980
26 lines
1.1 KiB
Text
26 lines
1.1 KiB
Text
hi(pop_heap())
|
|
itemization(
|
|
it() Header file:
|
|
centt(#include <algorithm>)
|
|
it() Function prototypes:
|
|
itemization(
|
|
itt(void pop_heap(RandomAccessIterator first,
|
|
RandomAccessIterator last);)
|
|
itt(void pop_heap+OPENPARRandomAccessIterator first,
|
|
RandomAccessIterator last,)linebreak()tt(Compare comp+CLOSEPAR;)
|
|
)
|
|
it() Description:
|
|
itemization(
|
|
it() The first prototype: the first element in the range
|
|
rangett(first, last) is moved to tt(last - 1). Then, the elements in the range
|
|
rangett(first, last - 1) are reordered to form a max-heap, using the
|
|
tt(operator<()) of the data type to which the iterators point.
|
|
it() The second prototype: the first element in the range
|
|
rangett(first, last) is moved to tt(last - 1). Then, the elements in the range
|
|
rangett(first, last - 1) are reordered to form a max-heap, 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(pop_heap()).)()
|
|
)
|