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

Increment operators

== Synopses

Declared in `&lt;bslstl&lowbar;bidirectionaliterator&period;h&gt;`

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class VALUE&lowbar;TYPE,
    class DIFFERENCE&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/HashTableBucketIterator.adoc[HashTableBucketIterator&lt;VALUE&lowbar;TYPE, DIFFERENCE&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-0d9.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/HashTableBucketIterator.adoc[HashTableBucketIterator&lt;VALUE&lowbar;TYPE, DIFFERENCE&lowbar;TYPE&gt;]& iterator,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-0d9.adoc[_» more&period;&period;&period;_]#

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class VALUE&lowbar;TYPE,
    class DIFFERENCE&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/HashTableIterator.adoc[HashTableIterator&lt;VALUE&lowbar;TYPE, DIFFERENCE&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-0d3.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/HashTableIterator.adoc[HashTableIterator&lt;VALUE&lowbar;TYPE, DIFFERENCE&lowbar;TYPE&gt;]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-0d3.adoc[_» more&period;&period;&period;_]#

Increment the specified `iter` to the next element&period; Return the previous value of `iter`&period; The behavior is undefined if, on entry, `iter` has the past&hyphen;the&hyphen;end value for an iterator of the underlying sequence&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class T,
    class ITER&lowbar;IMP,
    class TAG&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/BidirectionalIterator.adoc[bslstl::BidirectionalIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-07.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/BidirectionalIterator.adoc[BidirectionalIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-07.adoc[_» more&period;&period;&period;_]#

Increment the specified `iter` to the next element&period; Return the previous value of `iter`&period; The behavior is undefined if, on entry, `iter` has the past&hyphen;the&hyphen;end value for an iterator of the underlying sequence&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class T,
    class ITER&lowbar;IMP,
    class TAG&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/ForwardIterator.adoc[bslstl::ForwardIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-008.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/ForwardIterator.adoc[ForwardIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-008.adoc[_» more&period;&period;&period;_]#

Increment the specified `iter` to next element&period; Return the previous value of `iter`&period; The behavior is undefined if, on entry, `iter` has the past&hyphen;the&hyphen;end value for an iterator of the underlying sequence&period;


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class T,
    class ITER&lowbar;IMP,
    class TAG&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/RandomAccessIterator.adoc[bslstl::RandomAccessIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-005.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/RandomAccessIterator.adoc[RandomAccessIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]& iter,
    int);
----

[.small]#xref:BloombergLP/bslstl/operator_inc-005.adoc[_» more&period;&period;&period;_]#

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


[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
template&lt;
    class VALUE,
    class NODE,
    class DIFFERENCE&lowbar;TYPE&gt;
xref:BloombergLP/bslstl/TreeIterator.adoc[TreeIterator&lt;VALUE, NODE, DIFFERENCE&lowbar;TYPE&gt;]
xref:BloombergLP/bslstl/operator_inc-02.adoc[operator&plus;&plus;](
    xref:BloombergLP/bslstl/TreeIterator.adoc[TreeIterator&lt;VALUE, NODE, DIFFERENCE&lowbar;TYPE&gt;]& iter,
    int);
----

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


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