|
Embedded Template Library
1.0
|
#include <deque.h>
Public Types | |
| typedef T | value_type |
| typedef T * | pointer |
| typedef const T * | const_pointer |
| typedef T & | reference |
| typedef const T & | const_reference |
| typedef size_t | size_type |
|
typedef std::iterator_traits < pointer >::difference_type | difference_type |
Public Types inherited from etl::ideque< T > | |
| typedef T | value_type |
| typedef size_t | size_type |
| typedef T & | reference |
| typedef const T & | const_reference |
| typedef T * | pointer |
| typedef const T * | const_pointer |
|
typedef std::iterator_traits < pointer >::difference_type | difference_type |
|
typedef std::reverse_iterator < iterator > | reverse_iterator |
|
typedef std::reverse_iterator < const_iterator > | const_reverse_iterator |
Public Types inherited from etl::deque_base | |
| typedef size_t | size_type |
Public Member Functions | |
| deque () | |
| Default constructor. | |
| deque (const deque &other) | |
| Copy constructor. | |
| template<typename TIterator > | |
| deque (TIterator begin, TIterator end) | |
| Assigns data to the deque. | |
| deque (size_t n, typename ideque< T >::parameter_t value=value_type()) | |
| Assigns data to the deque. | |
| deque & | operator= (const deque &other) |
| Assignment operator. | |
| void | swap (deque &other) |
| Swap. | |
Public Member Functions inherited from etl::ideque< T > | |
| ideque & | operator= (const ideque &other) |
| Assignment operator. | |
| template<typename TIterator > | |
| etl::enable_if< is_iterator < TIterator >::value, void > ::type | assign (TIterator range_begin, TIterator range_end) |
| Assigns a range to the deque. | |
| void | assign (size_type n, const value_type &value) |
| reference | at (size_t index) |
| const_reference | at (size_t index) const |
| reference | operator[] (size_t index) |
| const_reference | operator[] (size_t index) const |
| reference | front () |
| const_reference | front () const |
| reference | back () |
| const_reference | back () const |
| iterator | begin () |
| Gets an iterator to the beginning of the deque. | |
| const_iterator | begin () const |
| Gets a const iterator to the beginning of the deque. | |
| const_iterator | cbegin () const |
| Gets a const iterator to the beginning of the deque. | |
| iterator | end () |
| Gets an iterator to the end of the deque. | |
| const_iterator | end () const |
| Gets a const iterator to the end of the deque. | |
| const_iterator | cend () const |
| Gets a const iterator to the end of the deque. | |
| reverse_iterator | rbegin () |
| Gets a reverse iterator to the end of the deque. | |
| const_reverse_iterator | rbegin () const |
| Gets a const reverse iterator to the end of the deque. | |
| const_reverse_iterator | crbegin () const |
| Gets a const reverse iterator to the end of the deque. | |
| reverse_iterator | rend () |
| Gets a reverse iterator to the beginning of the deque. | |
| const_reverse_iterator | rend () const |
| Gets a const reverse iterator to the beginning of the deque. | |
| const_reverse_iterator | crend () const |
| Gets a const reverse iterator to the beginning of the deque. | |
| void | clear () |
| Clears the deque. | |
| iterator | insert (const_iterator insert_position, const value_type &value) |
| iterator | insert (const_iterator insert_position, size_type n, const value_type &value) |
| template<typename TIterator > | |
| enable_if< is_iterator < TIterator >::value, iterator > ::type | insert (const_iterator insert_position, TIterator range_begin, TIterator range_end) |
| iterator | erase (const_iterator erase_position) |
| iterator | erase (const_iterator range_begin, const_iterator range_end) |
| void | push_back (parameter_t item) |
| reference | push_back () |
| void | pop_back () |
| Removes the oldest item from the deque. | |
| void | push_front (parameter_t item) |
| reference | push_front () |
| void | pop_front () |
| Removes the oldest item from the deque. | |
| void | resize (size_t new_size, const value_type &value=value_type()) |
Public Member Functions inherited from etl::deque_base | |
| size_type | size () const |
| bool | empty () const |
| bool | full () const |
| size_type | capacity () const |
| size_type | max_size () const |
| size_t | available () const |
| void | clear () |
| Clears the deque. | |
Static Public Attributes | |
| static const size_t | MAX_SIZE = MAX_SIZE_ |
Additional Inherited Members | |
Protected Types inherited from etl::ideque< T > | |
| typedef parameter_type< T >::type | parameter_t |
Protected Member Functions inherited from etl::ideque< T > | |
| ideque (pointer p_buffer, size_t max_size, size_t buffer_size) | |
| Constructor. | |
Protected Member Functions inherited from etl::deque_base | |
| deque_base (size_t max_size, size_t buffer_size) | |
| Constructor. | |
Protected Attributes inherited from etl::ideque< T > | |
| iterator | first |
| iterator | last |
| Iterator to the first item in the deque. | |
| pointer | p_buffer |
| Iterator to the last item in the deque. | |
Protected Attributes inherited from etl::deque_base | |
| size_type | current_size |
| The current number of elements in the deque. | |
| const size_type | MAX_SIZE |
| The maximum number of elements in the deque. | |
| const size_type | BUFFER_SIZE |
| The of elements in the buffer. | |
A fixed capacity double ended queue. The deque allocates one more element than the specified maximum size.
| T | The type of items this deque holds. |
| MAX_SIZE_ | The capacity of the deque |