Decrement operators
Synopses
Declared in <bslstl_bidirectionaliterator.h>
Post‐decrement 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);
Regress iter to the previous 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);
Move iter to the previous 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);
Return Value
-
previous value of
iter -
previous value of
iterbefore the decrement
Parameters
Name |
Description |
iter |
iterator to decrement |
unused |
ignored; distinguishes post‐decrement |
postfix |
unused parameter distinguishing the postfix operator |
Created with MrDocs