DequeIterator specialization for a single element per block.
Synopsis
Declared in <bslalg_dequeiterator.h>
template<class VALUE_TYPE>
class DequeIterator<VALUE_TYPE, 1>;
Description
This partial specialization of DequeIterator for the case when there is a single element per block uses simpler storage and a simpler implementation. The contract for all functions is the same, and so not repeated.
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. |
Friends
Name |
Description |
Return the result of comparing the block pointers of the specified |
|
Return |
Created with MrDocs