boostorg/range
1
0
Fork 1
mirror of https://github.com/boostorg/range.git synced 2025-07-29 04:17:39 +02:00
Code Issues Packages Projects Releases Wiki Activity

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

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

2
doc/reference/algorithm/pop_heap.qbk
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.