Quick Links: |
#include <bslalg_dequeiterator.h>
Public Member Functions | |
DequeIterator () | |
DequeIterator (BlockPtr *blockPtrPtr) | |
DequeIterator (BlockPtr *blockPtrPtr, VALUE_TYPE *valuePtr) | |
void | operator++ () |
void | operator-- () |
void | operator+= (std::ptrdiff_t offset) |
void | operator-= (std::ptrdiff_t offset) |
void | nextBlock () |
void | previousBlock () |
void | setBlock (BlockPtr *blockPtrPtr) |
void | valuePtrDecrement () |
void | valuePtrIncrement () |
VALUE_TYPE & | operator* () const |
DequeIterator | operator+ (std::ptrdiff_t offset) const |
DequeIterator | operator- (std::ptrdiff_t offset) const |
std::ptrdiff_t | operator- (const DequeIterator &rhs) const |
VALUE_TYPE * | blockBegin () const |
VALUE_TYPE * | blockEnd () const |
BlockPtr * | blockPtr () const |
std::size_t | offsetInBlock () const |
std::size_t | remainingInBlock () const |
VALUE_TYPE * | valuePtr () const |
Friends | |
bool | operator== (const DequeIterator &lhs, const DequeIterator &rhs) |
bool | operator!= (const DequeIterator &lhs, const DequeIterator &rhs) |
bool | operator< (const DequeIterator &lhs, const DequeIterator &rhs) |
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.
See Component bslalg_dequeiterator
bslalg::DequeIterator< VALUE_TYPE, 1 >::DequeIterator | ( | ) |
bslalg::DequeIterator< VALUE_TYPE, 1 >::DequeIterator | ( | BlockPtr * | blockPtrPtr | ) |
bslalg::DequeIterator< VALUE_TYPE, 1 >::DequeIterator | ( | BlockPtr * | blockPtrPtr, | |
VALUE_TYPE * | valuePtr | |||
) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::operator++ | ( | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::operator-- | ( | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::operator+= | ( | std::ptrdiff_t | offset | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::operator-= | ( | std::ptrdiff_t | offset | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::nextBlock | ( | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::previousBlock | ( | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::setBlock | ( | BlockPtr * | blockPtrPtr | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::valuePtrDecrement | ( | ) |
void bslalg::DequeIterator< VALUE_TYPE, 1 >::valuePtrIncrement | ( | ) |
VALUE_TYPE& bslalg::DequeIterator< VALUE_TYPE, 1 >::operator* | ( | ) | const |
DequeIterator bslalg::DequeIterator< VALUE_TYPE, 1 >::operator+ | ( | std::ptrdiff_t | offset | ) | const |
DequeIterator bslalg::DequeIterator< VALUE_TYPE, 1 >::operator- | ( | std::ptrdiff_t | offset | ) | const |
std::ptrdiff_t bslalg::DequeIterator< VALUE_TYPE, 1 >::operator- | ( | const DequeIterator< VALUE_TYPE, 1 > & | rhs | ) | const |
VALUE_TYPE* bslalg::DequeIterator< VALUE_TYPE, 1 >::blockBegin | ( | ) | const |
VALUE_TYPE* bslalg::DequeIterator< VALUE_TYPE, 1 >::blockEnd | ( | ) | const |
BlockPtr* bslalg::DequeIterator< VALUE_TYPE, 1 >::blockPtr | ( | ) | const |
std::size_t bslalg::DequeIterator< VALUE_TYPE, 1 >::offsetInBlock | ( | ) | const |
std::size_t bslalg::DequeIterator< VALUE_TYPE, 1 >::remainingInBlock | ( | ) | const |
VALUE_TYPE* bslalg::DequeIterator< VALUE_TYPE, 1 >::valuePtr | ( | ) | const |
bool operator== | ( | const DequeIterator< VALUE_TYPE, 1 > & | lhs, | |
const DequeIterator< VALUE_TYPE, 1 > & | rhs | |||
) | [friend] |
bool operator!= | ( | const DequeIterator< VALUE_TYPE, 1 > & | lhs, | |
const DequeIterator< VALUE_TYPE, 1 > & | rhs | |||
) | [friend] |
bool operator< | ( | const DequeIterator< VALUE_TYPE, 1 > & | lhs, | |
const DequeIterator< VALUE_TYPE, 1 > & | rhs | |||
) | [friend] |