#include <bits/concept_check.h>#include <debug/debug.h>Go to the source code of this file.
| Namespaces | |
| namespace | std | 
| Classes | |
| class | std::queue< _Tp, _Sequence > | 
| A standard container giving FIFO behavior.  More... | |
| class | std::priority_queue< _Tp, _Sequence, _Compare > | 
| A standard container automatically sorting its contents.  More... | |
| Defines | |
| #define | _QUEUE_H 1 | 
| Functions | |
| template<typename _Tp, typename _Seq> | |
| bool | std::operator== (const queue< _Tp, _Seq > &, const queue< _Tp, _Seq > &) | 
| template<typename _Tp, typename _Seq> | |
| bool | std::operator< (const queue< _Tp, _Seq > &, const queue< _Tp, _Seq > &) | 
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator== (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Queue equality comparison. | |
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator< (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Queue ordering relation. | |
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator!= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Based on operator==. | |
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator> (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Based on operator<. | |
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator<= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Based on operator<. | |
| template<typename _Tp, typename _Sequence> | |
| bool | std::operator>= (const queue< _Tp, _Sequence > &__x, const queue< _Tp, _Sequence > &__y) | 
| Based on operator<. | |
Definition in file stl_queue.h.
| #define _QUEUE_H 1 | 
Definition at line 62 of file stl_queue.h.
 1.4.7
 1.4.7