|
|
Whole document tree
Templatestd::priority_queue class Reference
Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
std::priority_queue< _Tp, _Sequence, _Compare > Class Template Reference#include <stl_queue.h>
List of all members.
Public Types |
typedef _Sequence::value_type | value_type |
typedef _Sequence::size_type | size_type |
typedef _Sequence | container_type |
typedef _Sequence::reference | reference |
typedef _Sequence::const_reference | const_reference |
Public Methods |
| priority_queue (const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) |
template<class _InputIterator> | priority_queue (_InputIterator __first, _InputIterator __last, const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) |
bool | empty () const |
size_type | size () const |
const_reference | top () const |
void | push (const value_type &__x) |
void | pop () |
Protected Attributes |
_Sequence | c |
_Compare | comp |
Private Types |
typedef _Sequence::value_type | _Sequence_value_type |
Private Methods |
| __glibcpp_class_requires (_Tp, _SGIAssignableConcept) |
| __glibcpp_class_requires (_Sequence, _SequenceConcept) |
| __glibcpp_class_requires (_Sequence, _RandomAccessContainerConcept) |
| __glibcpp_class_requires2 (_Tp, _Sequence_value_type, _SameTypeConcept) |
| __glibcpp_class_requires4 (_Compare, bool, _Tp, _Tp, _BinaryFunctionConcept) |
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
class std::priority_queue< _Tp, _Sequence, _Compare >
Member Typedef Documentation
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence::value_type std::priority_queue< _Tp, _Sequence, _Compare >::_Sequence_value_type [private]
|
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence::const_reference std::priority_queue< _Tp, _Sequence, _Compare >::const_reference
|
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence std::priority_queue< _Tp, _Sequence, _Compare >::container_type
|
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence::reference std::priority_queue< _Tp, _Sequence, _Compare >::reference
|
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence::size_type std::priority_queue< _Tp, _Sequence, _Compare >::size_type
|
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
typedef _Sequence::value_type std::priority_queue< _Tp, _Sequence, _Compare >::value_type
|
|
Constructor & Destructor Documentation
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue |
( |
const _Compare & |
__x = _Compare(), |
|
|
const _Sequence & |
__s = _Sequence() |
|
) |
[inline, explicit] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
template<class _InputIterator> |
std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue |
( |
_InputIterator |
__first, |
|
|
_InputIterator |
__last, |
|
|
const _Compare & |
__x = _Compare(), |
|
|
const _Sequence & |
__s = _Sequence() |
|
) |
[inline] |
|
Member Function Documentation
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires |
( |
_Sequence |
, |
|
|
_RandomAccessContainerConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires |
( |
_Sequence |
, |
|
|
_SequenceConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires |
( |
_Tp |
, |
|
|
_SGIAssignableConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires2 |
( |
_Tp |
, |
|
|
_Sequence_value_type |
, |
|
|
_SameTypeConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires4 |
( |
_Compare |
, |
|
|
bool |
, |
|
|
_Tp |
, |
|
|
_Tp |
, |
|
|
_BinaryFunctionConcept |
|
|
) |
[private] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
bool std::priority_queue< _Tp, _Sequence, _Compare >::empty |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
void std::priority_queue< _Tp, _Sequence, _Compare >::pop |
( |
|
) |
[inline] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
void std::priority_queue< _Tp, _Sequence, _Compare >::push |
( |
const value_type & |
__x |
) |
[inline] |
|
|
Definition at line 203 of file stl_queue.h.
References __STL_UNWIND, std::priority_queue< _Tp, _Sequence, _Compare >::c, std::priority_queue< _Tp, _Sequence, _Compare >::comp, std::push_heap(), and std::priority_queue< _Tp, _Sequence, _Compare >::value_type. |
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
size_type std::priority_queue< _Tp, _Sequence, _Compare >::size |
( |
|
) |
const [inline] |
|
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
const_reference std::priority_queue< _Tp, _Sequence, _Compare >::top |
( |
|
) |
const [inline] |
|
Member Data Documentation
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
_Sequence std::priority_queue< _Tp, _Sequence, _Compare >::c [protected]
|
|
|
Definition at line 182 of file stl_queue.h.
Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::empty(), std::priority_queue< _Tp, _Sequence, _Compare >::pop(), std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue(), std::priority_queue< _Tp, _Sequence, _Compare >::push(), std::priority_queue< _Tp, _Sequence, _Compare >::size(), and std::priority_queue< _Tp, _Sequence, _Compare >::top(). |
template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> |
_Compare std::priority_queue< _Tp, _Sequence, _Compare >::comp [protected]
|
|
The documentation for this class was generated from the following file:
Generated on Mon Apr 8 03:19:24 2002 for libstdc++-v3 Source by
1.2.15
|