#include <queue.h>
Collaboration diagram for eastl::queue< T, Container >:
Public Types | |
| typedef queue< T, Container > | this_type |
| typedef Container | container_type |
| typedef Container::value_type | value_type |
| typedef Container::reference | reference |
| typedef Container::const_reference | const_reference |
| typedef Container::size_type | size_type |
Public Member Functions | |
| template<class Allocator > | |
| queue (const Allocator &allocator, typename eastl::enable_if< eastl::uses_allocator< container_type, Allocator >::value >::type *=NULL) | |
| template<class Allocator > | |
| queue (const this_type &x, const Allocator &allocator, typename eastl::enable_if< eastl::uses_allocator< container_type, Allocator >::value >::type *=NULL) | |
| template<class Allocator > | |
| queue (this_type &&x, const Allocator &allocator, typename eastl::enable_if< eastl::uses_allocator< container_type, Allocator >::value >::type *=NULL) | |
| queue (const container_type &x) | |
| queue (container_type &&x) | |
| queue (std::initializer_list< value_type > ilist) | |
| bool | empty () const |
| size_type | size () const |
| reference | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| void | push (const value_type &value) |
| void | push (value_type &&x) |
| template<class... Args> | |
| EA_DEPRECATED void | emplace_back (Args &&... args) |
| template<class... Args> | |
| decltype(auto) | emplace (Args &&... args) |
| void | pop () |
| container_type & | get_container () |
| const container_type & | get_container () const |
| template<class... Args> | |
| void | emplace_back (Args &&... args) |
Public Attributes | |
| container_type | c |
| void swap(this_type &x) EA_NOEXCEPT_IF((eastl bool | validate () const |
Detailed Description
template<typename T, typename Container = eastl::deque<T, EASTLAllocatorType, DEQUE_DEFAULT_SUBARRAY_SIZE(T)>>
class eastl::queue< T, Container >
queue
queue is an adapter class provides a FIFO (first-in, first-out) interface via wrapping a sequence that provides at least the following operations: push_back pop_front front back
In practice this usually means deque, list, intrusive_list. vector and string
cannot be used because they don't provide pop-front. This is reasonable because a vector or string pop_front would be inefficient and could lead to silently poor performance.
The documentation for this class was generated from the following file:
- third_party/EASTL/include/EASTL/queue.h
