#include <bslstl_deque.h>
Inheritance diagram for bsl::Deque_Base< VALUE_TYPE >:
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 |
Public Member Functions | |
| iterator | begin () BSLS_KEYWORD_NOEXCEPT |
| iterator | end () BSLS_KEYWORD_NOEXCEPT |
| reverse_iterator | rbegin () BSLS_KEYWORD_NOEXCEPT |
| reverse_iterator | rend () BSLS_KEYWORD_NOEXCEPT |
| reference | operator[] (size_type position) |
| reference | at (size_type position) |
| reference | front () |
| reference | back () |
| const_iterator | begin () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | cbegin () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | end () const BSLS_KEYWORD_NOEXCEPT |
| const_iterator | cend () const BSLS_KEYWORD_NOEXCEPT |
| const_reverse_iterator | rbegin () const BSLS_KEYWORD_NOEXCEPT |
| const_reverse_iterator | crbegin () const BSLS_KEYWORD_NOEXCEPT |
| const_reverse_iterator | rend () const BSLS_KEYWORD_NOEXCEPT |
| const_reverse_iterator | crend () const BSLS_KEYWORD_NOEXCEPT |
| size_type | size () const BSLS_KEYWORD_NOEXCEPT |
| size_type | capacity () const BSLS_KEYWORD_NOEXCEPT |
| bool | empty () const BSLS_KEYWORD_NOEXCEPT |
| const_reference | operator[] (size_type position) const |
| const_reference | at (size_type position) const |
| const_reference | front () const |
| const_reference | back () const |
Protected Attributes | |
| BlockPtr * | d_blocks_p |
| std::size_t | d_blocksLength |
| IteratorImp | d_start |
| IteratorImp | d_finish |
Detailed Description
template<class VALUE_TYPE>
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).
The documentation for this class was generated from the following file:
Generated on Fri Mar 31 2023 13:28:48 for BDE Release 3.115.0.0 Production Release by
1.7.1