Data Abstraction and Problem Solving with C++
Walls and Mirrors
by Frank M. Carrano
c11p644a.h
Go to the documentation of this file.00001 00015 void push_heap(RandomIter first, RandomIter last); 00016 void push_heap(RandomIter first, RandomIter last, Compare cmp); 00017 // Push an item onto the heap. 00018 // The value pushed is *(last-1). 00019 // A comparison function object may be supplied. 00020 00021 void pop_heap(RandomIter first, RandomIter last); 00022 void pop_heap(RandomIter first, RandomIter last, Compare cmp); 00023 // Push an item onto the heap. 00024 // Swaps first element with *(last-1) and makes [first, last-1] 00025 // into a heap. 00026 // A comparison function object may be supplied. 00027 00028 void make_heap(RandomIter first, RandomIter last); 00029 void make_heap(RandomIter first, RandomIter last, Compare cmp); 00030 // Turns an existing container into a heap. 00031 // A comparison function object may be supplied. 00032 00033 void sort_heap(RandomIter first, RandomIter last); 00034 void sort_heap(RandomIter first, RandomIter last, Compare cmp); 00035 // Turns the heap back into the original container. 00036 // A comparison function object may be supplied.
