bsl::Deque_Base

Synopsis

Declared in <bslstl_deque.h>

template<class VALUE_TYPE>
class Deque_Base;

Description

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).

Type Aliases

Name	Description
`const_iterator`	This `typedef` is an alias for `const_iterator`.
`const_reference`	This `typedef` is an alias for `const_reference`.
`const_reverse_iterator`	This `typedef` is an alias to `bsl::reverse_iterator<const_iterator>`.
`difference_type`	This `typedef` is an alias for `difference_type`.
`iterator`	This `typedef` is an alias for `iterator`.
`reference`	This `typedef` is an alias for `reference`.
`reverse_iterator`	This `typedef` is an alias to `bsl::reverse_iterator<iterator>`.
`size_type`	This `typedef` is an alias for `size_type`.
`value_type`	This `typedef` is an alias for `value_type`.

Member Functions

Name	Description
`at`	`at` overloads
`back`	`back` overloads
`begin`	`begin` overloads
`capacity`	Return how many end insertions remain before iterators are invalidated.
`cbegin`	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`	Return the past-the-end (forward) iterator providing non-modifiable access to this deque.
`crbegin`	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`	Return the past-the-end reverse iterator providing non-modifiable access to this deque.
`empty`	Return `true` if this deque contains no elements, and `false` otherwise.
`end`	`end` overloads
`front`	`front` overloads
`operator[]`	Subscript operators
`rbegin`	`rbegin` overloads
`rend`	`rend` overloads
`size`	Return the number of elements contained by this deque.

Protected Data Members

Name	Description
`d_blocksLength`	Length of the `d_blocks_p` array.
`d_blocks_p`	Array of pointers to blocks (owned).
`d_finish`	The `d_finish` data member.
`d_start`	The `d_start` data member.

Derived Classes

Name	Description
`deque`	STL-compliant double-ended sequence container using the `bslma` model.