Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Namespace Members   Compound Members   File Members  

std::priority_queue 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 ()
 priority_queue (const _Compare &__x)
 priority_queue (const _Compare &__x, const _Sequence &__s)
template<class _InputIterator>  priority_queue (_InputIterator __first, _InputIterator __last)
template<class _InputIterator>  priority_queue (_InputIterator __first, _InputIterator __last, const _Compare &__x)
template<class _InputIterator>  priority_queue (_InputIterator __first, _InputIterator __last, const _Compare &__x, const _Sequence &__s)
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


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]
 

Definition at line 142 of file stl_queue.h.

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
 

Definition at line 152 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
typedef _Sequence std::priority_queue<_Tp, _Sequence, _Compare>::container_type
 

Definition at line 149 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
typedef _Sequence::reference std::priority_queue<_Tp, _Sequence, _Compare>::reference
 

Definition at line 151 of file stl_queue.h.

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
 

Definition at line 148 of file stl_queue.h.

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
 

Definition at line 147 of file stl_queue.h.


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<_Tp, _Sequence, _Compare> ( ) [inline]
 

Definition at line 157 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue<_Tp, _Sequence, _Compare> ( const _Compare & __x ) [inline, explicit]
 

Definition at line 158 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
std::priority_queue<_Tp, _Sequence, _Compare>::priority_queue<_Tp, _Sequence, _Compare> ( const _Compare & __x,
const _Sequence & __s ) [inline]
 

Definition at line 159 of file stl_queue.h.

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<_Tp, _Sequence, _Compare> ( _InputIterator __first,
_InputIterator __last ) [inline]
 

Definition at line 164 of file stl_queue.h.

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<_Tp, _Sequence, _Compare> ( _InputIterator __first,
_InputIterator __last,
const _Compare & __x ) [inline]
 

Definition at line 168 of file stl_queue.h.

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<_Tp, _Sequence, _Compare> ( _InputIterator __first,
_InputIterator __last,
const _Compare & __x,
const _Sequence & __s ) [inline]
 

Definition at line 174 of file stl_queue.h.


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]
 

Definition at line 182 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
void std::priority_queue<_Tp, _Sequence, _Compare>::pop ( ) [inline]
 

Definition at line 192 of file stl_queue.h.

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 185 of file stl_queue.h.

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]
 

Definition at line 183 of file stl_queue.h.

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]
 

Definition at line 184 of file stl_queue.h.


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 154 of file stl_queue.h.

template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>>
_Compare std::priority_queue<_Tp, _Sequence, _Compare>::comp [protected]
 

Definition at line 155 of file stl_queue.h.


The documentation for this class was generated from the following file:
Generated at Tue May 1 16:30:28 2001 for libstdc++-v3 by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001