STLdoc
STLdocumentation
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Classes | Macros | Functions
queue File Reference
#include <algorithm>
#include <deque>
#include <vector>

Classes

class  queue< _Ty, _Container >
 
class  priority_queue< _Ty, _Container, _Pr >
 
struct  std::uses_allocator< queue< _Ty, _Container >, _Alloc >
 
struct  std::uses_allocator< priority_queue< _Ty, _Container, _Pr >, _Alloc >
 

Macros

#define _QUEUE_
 

Functions

template<class _Ty , class _Container >
void swap (queue< _Ty, _Container > &_Left, queue< _Ty, _Container > &_Right) _NOEXCEPT_OP(_NOEXCEPT_OP(_Left.swap(_Right)))
 
template<class _Ty , class _Container >
bool operator== (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container >
bool operator!= (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container >
bool operator< (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container >
bool operator> (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container >
bool operator<= (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container >
bool operator>= (const queue< _Ty, _Container > &_Left, const queue< _Ty, _Container > &_Right)
 
template<class _Ty , class _Container , class _Pr >
void swap (priority_queue< _Ty, _Container, _Pr > &_Left, priority_queue< _Ty, _Container, _Pr > &_Right) _NOEXCEPT_OP(_NOEXCEPT_OP(_Left.swap(_Right)))
 

Macro Definition Documentation

#define _QUEUE_

Function Documentation

template<class _Ty , class _Container >
bool operator!= ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
197  { // test for queue inequality
198  return (!(_Left == _Right));
199  }
template<class _Ty , class _Container >
bool operator< ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
205  { // test if _Left < _Right for queues
206  return (_Left._Get_container() < _Right._Get_container());
207  }
const _Container & _Get_container() const
Definition: queue:160
template<class _Ty , class _Container >
bool operator<= ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
221  { // test if _Left <= _Right for queues
222  return (!(_Right < _Left));
223  }
template<class _Ty , class _Container >
bool operator== ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
189  { // test for queue equality
190  return (_Left._Get_container() == _Right._Get_container());
191  }
const _Container & _Get_container() const
Definition: queue:160
template<class _Ty , class _Container >
bool operator> ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
213  { // test if _Left > _Right for queues
214  return (_Right < _Left);
215  }
template<class _Ty , class _Container >
bool operator>= ( const queue< _Ty, _Container > &  _Left,
const queue< _Ty, _Container > &  _Right 
)
inline
229  { // test if _Left >= _Right for queues
230  return (!(_Left < _Right));
231  }
template<class _Ty , class _Container >
void swap ( queue< _Ty, _Container > &  _Left,
queue< _Ty, _Container > &  _Right 
)
inline
181  { // swap _Left and _Right queues
182  _Left.swap(_Right);
183  }
void swap(_Myt &_Right) _NOEXCEPT_OP(_NOEXCEPT_OP(_Swap_adl(c
template<class _Ty , class _Container , class _Pr >
void swap ( priority_queue< _Ty, _Container, _Pr > &  _Left,
priority_queue< _Ty, _Container, _Pr > &  _Right 
)
inline
448  { // swap _Left and _Right queues
449  _Left.swap(_Right);
450  }
void swap(_Myt &_Right)&&_NOEXCEPT_OP(_Swap_adl(comp