BloombergLP::bslstl::operator++

Synopses

Declared in <bslstl_bidirectionaliterator.h>

Move the specified iterator to the next element and return its prior value.

template<
    class VALUE_TYPE,
    class DIFFERENCE_TYPE>
HashTableBucketIterator<VALUE_TYPE, DIFFERENCE_TYPE>
operator++(
    HashTableBucketIterator<VALUE_TYPE, DIFFERENCE_TYPE>& iterator,
    int postfix);

» more...

Advance iter to the next node and return its previous value.

template<
    class VALUE_TYPE,
    class DIFFERENCE_TYPE>
HashTableIterator<VALUE_TYPE, DIFFERENCE_TYPE>
operator++(
    HashTableIterator<VALUE_TYPE, DIFFERENCE_TYPE>& iter,
    int postfix);

» more...

Post-increment the specified iterator and return its previous value.

template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
bslstl::BidirectionalIterator<T, ITER_IMP, TAG_TYPE>
operator++(
    BidirectionalIterator<T, ITER_IMP, TAG_TYPE>& iter,
    int unused);

» more...

Advance iter to the next element and return its previous value.

template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
bslstl::ForwardIterator<T, ITER_IMP, TAG_TYPE>
operator++(
    ForwardIterator<T, ITER_IMP, TAG_TYPE>& iter,
    int postfix);

» more...

Advance iter to the next element and return its previous value.

template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
bslstl::RandomAccessIterator<T, ITER_IMP, TAG_TYPE>
operator++(
    RandomAccessIterator<T, ITER_IMP, TAG_TYPE>& iter,
    int postfix);

» more...

Advance iter to the next element and return its previous value.

template<
    class VALUE,
    class NODE,
    class DIFFERENCE_TYPE>
TreeIterator<VALUE, NODE, DIFFERENCE_TYPE>
operator++(
    TreeIterator<VALUE, NODE, DIFFERENCE_TYPE>& iter,
    int postfix);

» more...