Primitive random‐access iterator over a block‐based deque.
Synopsis
Declared in <bslalg_dequeiterator.h>
template<
class VALUE_TYPE,
int BLOCK_LENGTH>
class DequeIterator;
Description
Implementation of a deque iterator, parameterized by the VALUE_TYPE, for a deque with the parameterized BLOCK_LENGTH, and suitable for use by the bslstl::RandomAccessIterator adapter. Note that BLOCK_LENGTH is the number of items of VALUE_TYPE within a block, not the size of a block in bytes.
Member Functions
Name |
Description |
|
Constructors |
Return the address of the first element in the block pointed to by this iterator. |
|
Return the address of (one‐past) the last element in the block pointed to by this iterator. |
|
Return the address of the block pointer for this iterator. |
|
Set this iterator to point to the first element of the next block. |
|
Return the offset of the element pointed to by this iterator, from the beginning of the block containing it. |
|
Return a reference to the element pointed to by this iterator. |
|
Return an iterator pointing the element at the specified |
|
Increment this iterator to the next element in the deque. |
|
Advance this iterator by the specified |
|
Subtraction operators |
|
Decrement this iterator to the previous element in the deque. |
|
Move this iterator backward by the specified |
|
Set this iterator to point to the first (not the last) element of the previous block. |
|
Return how many elements remain in this block from the current position. |
|
Set this iterator to point to the first element of the block pointed to by the specified |
|
Return the address of the parameterized |
|
Decrement the value pointer within the current block. |
|
Increment the value pointer within the current block. |
Specializations
Name |
Description |
|
Friends
Name |
Description |
Perform a three‐way comparison between the specified |
|
Return |
Created with MrDocs