SourcePro® 2024.1 |
SourcePro® API Reference Guide |
The random access iterator for the RWMathArray collection class. More...
#include <rw/math/mtharray.h>
Friends | |
class | RWMathArray< T > |
Additional Inherited Members | |
Public Types inherited from RWMathArrayIteratorBase< T > | |
typedef RWMathArray< T >::const_pointer | const_pointer |
typedef RWMathArray< T >::difference_type | difference_type |
typedef RWMathArray< T >::value_type | value_type |
Class RWMathArray is the random access iterator for the RWMathArray collection class. The RWMathArrayConstIterator class behaves like a pointer to type T
and is used to increment through elements of an RWMathArray. The RWMathArrayConstIterator differs from a plain iterator in that the value in a dereferenced RWMathArrayConstIterator may not be changed.
|
inline |
Constructs an iterator that is in an uninitialized state. The iterator must be initialized before it is dereferenced.
|
inline |
Constructs a RWMathArrayConstIterator from another RWMathArrayIterator or RWMathArrayConstIterator. Initialized RWMathArrayIterator and RWMathArrayConstIterator instances can be obtained via the RWMathArray::begin() and RWMathArray::end() member functions of RWMathArray.
|
inline |
Returns a reference to the element pointed to by self.
|
inline |
Returns a RWMathArrayConstIterator that is d elements past (or before) self.
|
inline |
Prefix or postfix increment or decrement operator. The RWMathArrayConstIterator points to the next or previous element in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Compare to RWMathArray::begin() and RWMathArray::end() to check that the RWMathArrayConstIterator position is valid.
|
inline |
Prefix or postfix increment or decrement operator. The RWMathArrayConstIterator points to the next or previous element in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Compare to RWMathArray::begin() and RWMathArray::end() to check that the RWMathArrayConstIterator position is valid.
|
inline |
The RWMathArrayConstIterator is moved forward or backward d elements in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Incrementing by d and then decrementing by d returns the RWMathArrayConstIterator to its original position, even if doing so takes it past the bounds of the array.
|
inline |
If the return value is positive, the RWMathArrayConstIterator is that many elements past the RWMathArrayConstIterator i
. If the return value is negative, the RWMathArrayConstIterator is that many elements before the RWMathArrayConstIterator i.
|
inline |
Returns a RWMathArrayConstIterator that is d elements past (or before) self.
|
inline |
Prefix or postfix increment or decrement operator. The RWMathArrayConstIterator points to the next or previous element in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Compare to RWMathArray::begin() and RWMathArray::end() to check that the RWMathArrayConstIterator position is valid.
|
inline |
Prefix or postfix increment or decrement operator. The RWMathArrayConstIterator points to the next or previous element in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Compare to RWMathArray::begin() and RWMathArray::end() to check that the RWMathArrayConstIterator position is valid.
|
inline |
The RWMathArrayConstIterator is moved forward or backward d elements in the RWMathArray. No error condition is set if the RWMathArrayConstIterator goes past the bounds of the array. Incrementing by d and then decrementing by d returns the RWMathArrayConstIterator to its original position, even if doing so takes it past the bounds of the array.
|
inline |
For iterator a, and identifier m, a->m is equivalent to (*a).m.
|
inline |
Sets the RWMathArrayConstIterator state to be the same state as i.
|
inline |
Returns a reference to the element that is n
elements after self if n
is positive, or n
elements before self if n
is negative.
Copyright © 2024 Rogue Wave Software, Inc., a Perforce company. All Rights Reserved. |