Om
1.0.0
A universal framework for multimedia simulation
|
Iterator class for a linked list. More...
#include <omLinkedList.h>
Public Member Functions | |
Iterator (LinkedList< T > &newList) | |
create a new linked list iterator from a reference to a list. More... | |
operator Bool () const | |
Return whether or not the iterator is at the end of the list. More... | |
void | operator++ () |
Prefix increment operator. More... | |
void | operator++ (int) |
Postfix increment operator. More... | |
T & | operator* () |
Return a reference to the current iterator element. More... | |
T * | operator-> () |
Access the current iterator element. More... | |
void | remove () |
Remove the current element from the list. More... | |
void | insertBefore (const T &data) |
Insert a data element before the current iterator element. More... | |
void | insertAfter (const T &data) |
Insert a data element after the current iterator element. More... | |
void | reset () |
Reset the iterator to the beginning of the list. More... | |
Iterator class for a linked list.
It's purpose is to efficiently iterate through all or some of the elements in the linked list, making changes as necessary. It avoids the O(n) time of removing or adding elements to the list under ordinary situations.
|
inline |
create a new linked list iterator from a reference to a list.
|
inline |
Return whether or not the iterator is at the end of the list.
If the iterator is at the end of the list, return FALSE. Otherwise, return TRUE.
|
inline |
Prefix increment operator.
|
inline |
Postfix increment operator.
|
inline |
Return a reference to the current iterator element.
|
inline |
Access the current iterator element.
|
inline |
Remove the current element from the list.
This method removes an element in constant time.
|
inline |
Insert a data element before the current iterator element.
This method inserts an element in constant time.
|
inline |
Insert a data element after the current iterator element.
This method inserts an element in constant time.
|
inline |
Reset the iterator to the beginning of the list.