|
| bool std::is_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Determines whether a range is a heap using comparison functor.
| first | Start of range. | |
| last | End of range. | |
| comp | Comparison functor to use. |
Definition at line 571 of file stl_heap.h.
References std::is_heap_until().
| bool std::is_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Determines whether a range is a heap.
| first | Start of range. | |
| last | End of range. |
Definition at line 558 of file stl_heap.h.
References std::is_heap_until().
| _RandomAccessIterator std::is_heap_until | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Search the end of a heap using comparison functor.
| first | Start of range. | |
| last | End of range. | |
| comp | Comparison functor to use. |
Definition at line 536 of file stl_heap.h.
References std::distance().
Referenced by std::is_heap().
| _RandomAccessIterator std::is_heap_until | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Search the end of a heap.
| first | Start of range. | |
| last | End of range. |
Definition at line 510 of file stl_heap.h.
References std::distance().
| void std::make_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Construct a heap over a range using comparison functor.
| first | Start of heap. | |
| last | End of heap. | |
| comp | Comparison functor to use. |
Definition at line 413 of file stl_heap.h.
Referenced by std::__heap_select(), std::partial_sort_copy(), and std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue().
| void std::make_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Construct a heap over a range.
| first | Start of heap. | |
| last | End of heap. |
Definition at line 373 of file stl_heap.h.
| void std::pop_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Pop an element off a heap using comparison functor.
| first | Start of heap. | |
| last | End of heap. | |
| comp | Comparison functor to use. |
Definition at line 350 of file stl_heap.h.
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::pop().
| void std::pop_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Pop an element off a heap.
| first | Start of heap. | |
| last | End of heap. |
Definition at line 276 of file stl_heap.h.
| void std::push_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Push an element onto a heap using comparison functor.
| first | Start of heap. | |
| last | End of heap + element. | |
| comp | Comparison functor. |
Definition at line 203 of file stl_heap.h.
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::push().
| void std::push_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Push an element onto a heap.
| first | Start of heap. | |
| last | End of heap + element. |
Definition at line 154 of file stl_heap.h.
| void std::sort_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last, | |||
| _Compare | __comp | |||
| ) | [inline] |
Sort a heap using comparison functor.
| first | Start of heap. | |
| last | End of heap. | |
| comp | Comparison functor to use. |
Definition at line 481 of file stl_heap.h.
Referenced by std::partial_sort(), and std::partial_sort_copy().
| void std::sort_heap | ( | _RandomAccessIterator | __first, | |
| _RandomAccessIterator | __last | |||
| ) | [inline] |
Sort a heap.
| first | Start of heap. | |
| last | End of heap. |
Definition at line 452 of file stl_heap.h.
1.5.8