From 1d51c3afb22b51293c36ab18b8b4bc518d3dee99 Mon Sep 17 00:00:00 2001
From: Nathan Ridge
Last revised: December 13, 2012 at 06:53:49 GMT |
+Last revised: January 02, 2013 at 05:22:10 GMT |
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))
.
+ 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
diff --git a/doc/reference/algorithm/pop_heap.qbk b/doc/reference/algorithm/pop_heap.qbk
index 6950704..9008de4 100644
--- a/doc/reference/algorithm/pop_heap.qbk
+++ b/doc/reference/algorithm/pop_heap.qbk
@@ -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.