#include <JArrayIterator.h>
|
| JArrayIterator (const JArray< T > &theArray, const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) |
|
| JArrayIterator (JArray< T > *theArray, const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) |
|
| JArrayIterator (const JArrayIterator< T > &source) |
|
| ~JArrayIterator () override |
|
bool | Prev (T *data, const JListT::Action move=JListT::kMove) override |
|
bool | Next (T *data, const JListT::Action move=JListT::kMove) override |
|
void | SkipPrev (const JSize count=1) override |
|
void | SkipNext (const JSize count=1) override |
|
bool | SetPrev (const T &data, const JListT::Action move=JListT::kMove) override |
|
bool | SetNext (const T &data, const JListT::Action move=JListT::kMove) override |
|
bool | RemovePrev (const JSize count=1) override |
|
bool | RemoveNext (const JSize count=1) override |
|
bool | Insert (const T &data) override |
|
| JListIterator (const JList< T > &theList, const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) |
|
| JListIterator (JList< T > *theList, const JListT::Position start=JListT::kStartAtBeginning, const JIndex index=0) |
|
virtual | ~JListIterator () |
|
const JList< T > * | GetList () const |
|
bool | GetList (JList< T > **obj) const |
|
bool | Prev (std::function< bool(const T &)> match, T *item) |
|
bool | Next (std::function< bool(const T &)> match, T *item) |
|
virtual void | MoveTo (const JListT::Position newPosition, const JIndex index) |
|
bool | AtBeginning () const |
|
bool | AtEnd () const |
|
JIndex | GetPrevItemIndex () const |
|
JIndex | GetNextItemIndex () const |
|
bool | GetPrevItemIndex (JIndex *i) const |
|
bool | GetNextItemIndex (JIndex *i) const |
|
T | operator* () const |
|
JListIterator< T > & | operator++ () |
|
bool | operator== (const JListIterator< T > &it) const |
|
◆ JArrayIterator() [1/3]
◆ JArrayIterator() [2/3]
◆ JArrayIterator() [3/3]
◆ ~JArrayIterator()
◆ Insert()
◆ ListChanged()
◆ Next()
Returns true if there is a next item, fetching the next item in the list and incrementing the iterator position. Otherwise returns false without fetching or incrementing.
Implements JListIterator< T >.
◆ Prev()
Returns true if there is a previous item, fetching the previous item in the list and decrementing the iterator position. Otherwise returns false without fetching or decrementing.
Implements JListIterator< T >.
◆ RemoveNext()
Returns true if we have a non-const JArray<T>* and there is at least one next item.
Implements JListIterator< T >.
◆ RemovePrev()
Returns true if we have a non-const JArray<T>* and there is at least one previous item.
Implements JListIterator< T >.
◆ SetNext()
Returns true if we have a non-const JArray<T>* and there is a next item.
Implements JListIterator< T >.
◆ SetPrev()
Returns true if we have a non-const JArray<T>* and there is a previous item.
Implements JListIterator< T >.
◆ SkipNext()
◆ SkipPrev()
The documentation for this class was generated from the following files: