libstdc++
|
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 566 of file stl_heap.h.
References std::is_heap_until().
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 579 of file stl_heap.h.
References std::is_heap_until().
_RandomAccessIterator std::is_heap_until | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
Search the end of a heap.
__first | Start of range. |
__last | End of range. |
This operation returns the last iterator i in [__first, __last) for which the range [__first, i) is a heap.
Definition at line 518 of file stl_heap.h.
References std::distance().
_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. |
This operation returns the last iterator i in [__first, __last) for which the range [__first, i) is a heap. Comparisons are made using __comp.
Definition at line 544 of file stl_heap.h.
References std::distance().
Referenced by std::is_heap().
void std::make_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
Construct a heap over a range.
__first | Start of heap. |
__last | End of heap. |
This operation makes the elements in [first,last) into a heap.
Definition at line 381 of file stl_heap.h.
void std::make_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
Construct a heap over a range using comparison functor.
__first | Start of heap. |
__last | End of heap. |
__comp | Comparison functor to use. |
This operation makes the elements in [first,last) into a heap. Comparisons are made using __comp.
Definition at line 421 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::pop_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
Pop an element off a heap.
__first | Start of heap. |
__last | End of heap. |
This operation pops the top of the heap. The elements first and __last-1 are swapped and [__first,last-1) is made into a heap.
Definition at line 282 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. |
This operation pops the top of the heap. The elements first and __last-1 are swapped and [__first,last-1) is made into a heap. Comparisons are made using comp.
Definition at line 357 of file stl_heap.h.
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::pop().
void std::push_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) | [inline] |
Push an element onto a heap.
__first | Start of heap. |
__last | End of heap + element. |
This operation pushes the element at last-1 onto the valid heap over the range [first,last-1). After completion, [first,last) is a valid heap.
Definition at line 157 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. |
This operation pushes the element at last-1 onto the valid heap over the range [__first,last-1). After completion, [first,last) is a valid heap. Compare operations are performed using comp.
Definition at line 207 of file stl_heap.h.
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::push().
void std::sort_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last | ||
) |
Sort a heap.
__first | Start of heap. |
__last | End of heap. |
This operation sorts the valid heap in the range [first,last).
Definition at line 460 of file stl_heap.h.
void std::sort_heap | ( | _RandomAccessIterator | __first, |
_RandomAccessIterator | __last, | ||
_Compare | __comp | ||
) |
Sort a heap using comparison functor.
__first | Start of heap. |
__last | End of heap. |
__comp | Comparison functor to use. |
This operation sorts the valid heap in the range [first,last). Comparisons are made using __comp.
Definition at line 489 of file stl_heap.h.
Referenced by std::partial_sort(), and std::partial_sort_copy().