#include <bslstl_deque.h>
Public Types | |
| typedef VALUE_TYPE & | reference |
| typedef const VALUE_TYPE & | const_reference |
| typedef Iterator | iterator |
| typedef ConstIterator | const_iterator |
| typedef std::size_t | size_type |
| typedef std::ptrdiff_t | difference_type |
| typedef VALUE_TYPE | value_type |
| typedef bsl::reverse_iterator< Iterator > | reverse_iterator |
| typedef bsl::reverse_iterator< ConstIterator > | const_reverse_iterator |
Protected Attributes | |
| BlockPtr * | d_blocks_p |
| std::size_t | d_blocksLength |
| IteratorImp | d_start |
| IteratorImp | d_finish |
Detailed Description
class bsl::Deque_Base< VALUE_TYPE >
This class describes the basic layout for a deque class. It is important that this class has the same layout as the deque class implementation. It is parameterized by VALUE_TYPE only and implements the portion of bsl::deque that does not need to know about its (template parameter) type ALLOCATOR (in order to generate shorter debug strings). Note that this class must have the same layout as Deque_Imp (see implementation file).
See bslstl_deque
Member Typedef Documentation
◆ const_iterator
| typedef ConstIterator bsl::Deque_Base< VALUE_TYPE >::const_iterator |
◆ const_reference
| typedef const VALUE_TYPE& bsl::Deque_Base< VALUE_TYPE >::const_reference |
◆ const_reverse_iterator
| typedef bsl::reverse_iterator<ConstIterator> bsl::Deque_Base< VALUE_TYPE >::const_reverse_iterator |
◆ difference_type
| typedef std::ptrdiff_t bsl::Deque_Base< VALUE_TYPE >::difference_type |
◆ iterator
| typedef Iterator bsl::Deque_Base< VALUE_TYPE >::iterator |
◆ reference
| typedef VALUE_TYPE& bsl::Deque_Base< VALUE_TYPE >::reference |
◆ reverse_iterator
| typedef bsl::reverse_iterator<Iterator> bsl::Deque_Base< VALUE_TYPE >::reverse_iterator |
◆ size_type
| typedef std::size_t bsl::Deque_Base< VALUE_TYPE >::size_type |
◆ value_type
| typedef VALUE_TYPE bsl::Deque_Base< VALUE_TYPE >::value_type |
Member Function Documentation
◆ at() [1/2]
| Deque_Base< VALUE_TYPE >::reference bsl::Deque_Base< VALUE_TYPE >::at | ( | size_type | position | ) |
Return a reference providing modifiable access to the element at the specified position in this deque. Throw a std::out_of_range exception if position >= size().
◆ at() [2/2]
| Deque_Base< VALUE_TYPE >::const_reference bsl::Deque_Base< VALUE_TYPE >::at | ( | size_type | position | ) | const |
Return a reference providing non-modifiable access to the element at the specified position in this deque. Throw a std::out_of_range exception if position >= size().
◆ back() [1/2]
|
inline |
Return a reference providing modifiable access to the last element in this deque. The behavior is undefined unless this deque is not empty.
◆ back() [2/2]
|
inline |
Return a reference providing non-modifiable access to the last element in this deque. The behavior is undefined unless this deque is not empty.
◆ begin() [1/2]
|
inline |
Return an iterator providing modifiable access to the first element in this deque, and the past-the-end iterator if this deque is empty.
◆ begin() [2/2]
|
inline |
◆ capacity()
| Deque_Base< VALUE_TYPE >::size_type bsl::Deque_Base< VALUE_TYPE >::capacity | ( | ) | const |
Return the sum of the current size of this deque plus the minimum number of push_front or push_back operations needed to invalidate iterators in this deque. Note that this method is not part of the C++ standard.
◆ cbegin()
|
inline |
Return an iterator providing non-modifiable access to the first element in this deque, and the past-the-end iterator if this deque is empty.
◆ cend()
|
inline |
Return the past-the-end (forward) iterator providing non-modifiable access to this deque.
◆ crbegin()
|
inline |
Return a reverse iterator providing non-modifiable access to the last element in this deque, and the past-the-end reverse iterator if this deque is empty.
◆ crend()
|
inline |
Return the past-the-end reverse iterator providing non-modifiable access to this deque.
◆ empty()
|
inline |
Return true if this deque contains no elements, and false otherwise.
◆ end() [1/2]
|
inline |
Return the past-the-end (forward) iterator providing modifiable access to this deque.
◆ end() [2/2]
|
inline |
◆ front() [1/2]
|
inline |
Return a reference providing modifiable access to the first element in this deque. The behavior is undefined unless this deque is not empty.
◆ front() [2/2]
|
inline |
Return a reference providing non-modifiable access to the first element in this deque. The behavior is undefined unless this deque is not empty.
◆ operator[]() [1/2]
|
inline |
Return a reference providing modifiable access to the element at the specified position in this deque. The behavior is undefined unless position < size().
◆ operator[]() [2/2]
|
inline |
Return a reference providing non-modifiable access to the element at the specified position in this deque. The behavior is undefined unless position < size().
◆ rbegin() [1/2]
|
inline |
Return a reverse iterator providing modifiable access to the last element in this deque, and the past-the-end reverse iterator if this deque is empty.
◆ rbegin() [2/2]
|
inline |
◆ rend() [1/2]
|
inline |
Return the past-the-end reverse iterator providing modifiable access to this deque.
◆ rend() [2/2]
|
inline |
◆ size()
|
inline |
Member Data Documentation
◆ d_blocks_p
|
protected |
◆ d_blocksLength
|
protected |
◆ d_finish
|
protected |
◆ d_start
|
protected |
The documentation for this class was generated from the following file:
