[#BloombergLP-bslstl-operator_inc-0e]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::operator++
:relfileprefix: ../../
:mrdocs:

Increment operators

== 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class VALUE_TYPE,
    class DIFFERENCE_TYPE>
xref:BloombergLP/bslstl/HashTableBucketIterator.adoc[HashTableBucketIterator<VALUE_TYPE, DIFFERENCE_TYPE>]
xref:BloombergLP/bslstl/operator_inc-0d9.adoc[operator++](
    xref:BloombergLP/bslstl/HashTableBucketIterator.adoc[HashTableBucketIterator<VALUE_TYPE, DIFFERENCE_TYPE>]& iterator,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-0d9.adoc[_» 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class VALUE_TYPE,
    class DIFFERENCE_TYPE>
xref:BloombergLP/bslstl/HashTableIterator.adoc[HashTableIterator<VALUE_TYPE, DIFFERENCE_TYPE>]
xref:BloombergLP/bslstl/operator_inc-0d3.adoc[operator++](
    xref:BloombergLP/bslstl/HashTableIterator.adoc[HashTableIterator<VALUE_TYPE, DIFFERENCE_TYPE>]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-0d3.adoc[_» 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
xref:BloombergLP/bslstl/BidirectionalIterator.adoc[bslstl::BidirectionalIterator<T, ITER_IMP, TAG_TYPE>]
xref:BloombergLP/bslstl/operator_inc-07.adoc[operator++](
    xref:BloombergLP/bslstl/BidirectionalIterator.adoc[BidirectionalIterator<T, ITER_IMP, TAG_TYPE>]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-07.adoc[_» 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
xref:BloombergLP/bslstl/ForwardIterator.adoc[bslstl::ForwardIterator<T, ITER_IMP, TAG_TYPE>]
xref:BloombergLP/bslstl/operator_inc-008.adoc[operator++](
    xref:BloombergLP/bslstl/ForwardIterator.adoc[ForwardIterator<T, ITER_IMP, TAG_TYPE>]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-008.adoc[_» 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class T,
    class ITER_IMP,
    class TAG_TYPE>
xref:BloombergLP/bslstl/RandomAccessIterator.adoc[bslstl::RandomAccessIterator<T, ITER_IMP, TAG_TYPE>]
xref:BloombergLP/bslstl/operator_inc-005.adoc[operator++](
    xref:BloombergLP/bslstl/RandomAccessIterator.adoc[RandomAccessIterator<T, ITER_IMP, TAG_TYPE>]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-005.adoc[_» 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.


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template<
    class VALUE,
    class NODE,
    class DIFFERENCE_TYPE>
xref:BloombergLP/bslstl/TreeIterator.adoc[TreeIterator<VALUE, NODE, DIFFERENCE_TYPE>]
xref:BloombergLP/bslstl/operator_inc-02.adoc[operator++](
    xref:BloombergLP/bslstl/TreeIterator.adoc[TreeIterator<VALUE, NODE, DIFFERENCE_TYPE>]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-02.adoc[_» more..._]#


[.small]#Created with https://www.mrdocs.com[MrDocs]#