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 , class = enable_if_t<_Is_swappable<_Container>::value>>
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 , class = enable_if_t<_Is_swappable<_Container>::value && _Is_swappable<_Pr>::value>>
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

    {   // test for queue inequality
    return (!(_Left == _Right));
    }

template<class _Ty , class _Container >

bool operator< ( const queue< _Ty, _Container > &  _Left, const queue< _Ty, _Container > &  _Right  )

inline

    {   // test if _Left < _Right for queues
    return (_Left._Get_container() < _Right._Get_container());
    }

template<class _Ty , class _Container >

bool operator<= ( const queue< _Ty, _Container > &  _Left, const queue< _Ty, _Container > &  _Right  )

inline

    {   // test if _Left <= _Right for queues
    return (!(_Right < _Left));
    }

template<class _Ty , class _Container >

bool operator== ( const queue< _Ty, _Container > &  _Left, const queue< _Ty, _Container > &  _Right  )

inline

    {   // test for queue equality
    return (_Left._Get_container() == _Right._Get_container());
    }

template<class _Ty , class _Container >

bool operator> ( const queue< _Ty, _Container > &  _Left, const queue< _Ty, _Container > &  _Right  )

inline

    {   // test if _Left > _Right for queues
    return (_Right < _Left);
    }

template<class _Ty , class _Container >

bool operator>= ( const queue< _Ty, _Container > &  _Left, const queue< _Ty, _Container > &  _Right  )

inline

    {   // test if _Left >= _Right for queues
    return (!(_Left < _Right));
    }

template<class _Ty , class _Container , class = enable_if_t<_Is_swappable<_Container>::value>>

void swap ( queue< _Ty, _Container > &  _Left, queue< _Ty, _Container > &  _Right  )

inline

    {   // swap _Left and _Right queues
    _Left.swap(_Right);
    }

template<class _Ty , class _Container , class _Pr , class = enable_if_t<_Is_swappable<_Container>::value && _Is_swappable<_Pr>::value>>

void swap ( priority_queue< _Ty, _Container, _Pr > &  _Left, priority_queue< _Ty, _Container, _Pr > &  _Right  )

inline

    {   // swap _Left and _Right queues
    _Left.swap(_Right);
    }