BloombergLP::bslstl::operator++

Synopses

Declared in <bslstl_bidirectionaliterator.h>

Move the specified iter to the next element in the hash table bucket and return the value of iter prior to this call. The behavior is undefined unless iter refers to a valid (not yet erased) element in a bucket. Note that iter is invalidated when the underlying hash table is rehashed.

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

» more...

Move the specified iter to the next node in the list and return value of iter prior to this call. The behavior is undefined unless iter refers to a valid (not yet erased) node a the list.

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

» more...

Increment the specified iter to the next element. Return the previous value of iter. The behavior is undefined if, on entry, iter has the past-the-end value for an iterator of the underlying sequence.

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

» more...

Increment the specified iter to the next element. Return the previous value of iter. The behavior is undefined if, on entry, iter has the past-the-end value for an iterator of the underlying sequence.

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

» more...

Increment the specified iter to next element. Return the previous value of iter. The behavior is undefined if, on entry, iter has the past-the-end value for an iterator of the underlying sequence.

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

» more...

Move the specified iter to the next element in the tree and return the value of iter prior to this call. The behavior is undefined unless the iterator refers to an element in the tree.

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

» more...