[#BloombergLP-bslstl-operator_dec-00]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bslstl.adoc[bslstl]::operator&hyphen;&hyphen;
:relfileprefix: ../../
:mrdocs:

Decrement operators

== Synopses

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

Decrement the specified `iter` to the previous element&period; Return the previous value of `iter`&period; The behavior is undefined if, on entry, `iter` has the same value as an iterator to the start 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_dec-08.adoc[operator&hyphen;&hyphen;](
    xref:BloombergLP/bslstl/BidirectionalIterator.adoc[BidirectionalIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]& iter,
    int);
----

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

Decrement the specified `iter` to previous element&period; Return the previous value of `iter`&period; The behavior is undefined if, on entry, `iter` has the same value as an iterator to the start 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_dec-05.adoc[operator&hyphen;&hyphen;](
    xref:BloombergLP/bslstl/RandomAccessIterator.adoc[RandomAccessIterator&lt;T, ITER&lowbar;IMP, TAG&lowbar;TYPE&gt;]& iter,
    int);
----

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

Move the specified `iter` to the previous element in the tree and return the value of `iter` prior to this call&period; The behavior is undefined unless the iterator refers to the past&hyphen;the&hyphen;end or the non&hyphen;leftmost 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_dec-03.adoc[operator&hyphen;&hyphen;](
    xref:BloombergLP/bslstl/TreeIterator.adoc[TreeIterator&lt;VALUE, NODE, DIFFERENCE&lowbar;TYPE&gt;]& iter,
    int);
----

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


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