feedc0de/boost_range
1
0 Fork 0
forked from boostorg/range
Code Pull Requests Activity

[range] fixed #5775 (typo in the documentation of pop_heap())

Browse Source 
[SVN r82313]
This commit is contained in:
Nathan Ridge committed 2013-01-02 05:27:02 +00:00
1 parent b7f443e583
commit 1d51c3afb2
3 files changed
+4 -4
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

doc/reference/algorithm/pop_heap.qbk
+1 -1
View File
@@ -23,7 +23,7 @@ const RandomAccessRange& pop_heap(const RandomAccessRange& rng, Compare pred);
[heading Description]
`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap and that the element to be added is `*prior(end(rng))`.
`pop_heap` removes the largest element from the heap. It is assumed that `begin(rng), prior(end(rng))` is already a heap (and therefore the largest element is `*begin(rng)`).
The ordering relationship is determined by using `operator<` in the non-predicate versions, and by evaluating `pred` in the predicate versions.