|
PLearn 0.1
|
#include <algorithm>#include <iterator>#include <functional>

Go to the source code of this file.
Namespaces | |
| namespace | PLearn |
< for swap | |
Functions | |
| template<typename RandomAccessIterator , typename StrictWeakOrdering > | |
| void | PLearn::update_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator damaged, StrictWeakOrdering comp) |
| This function restores the heap condition for a heap that has been "damaged" (i.e. | |
| template<typename RandomAccessIterator > | |
| void | PLearn::update_heap (RandomAccessIterator first, RandomAccessIterator last, RandomAccessIterator damaged) |
| Version of update_heap that uses less<T> as the strict weak ordering. | |
| template<typename RandomAccessIterator , typename StrictWeakOrdering > | |
| bool | PLearn::is_valid_heap (RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp) |
| Verify that the heap condition is satisfied. | |
| template<typename RandomAccessIterator > | |
| bool | PLearn::is_valid_heap (RandomAccessIterator first, RandomAccessIterator last) |
| Version of is_valid_heap that uses less<T> as the strict weak ordering. | |
Definition in file heap_utilities.h.
1.7.4