#include <SingleLinkedList.hpp>

Public Member Functions | |
| TSingleLinkedList () | |
| TSingleLinkedList (const T &rEmptyItem) | |
| TSingleLinkedList (const TSingleLinkedList< T > &rList) | |
| virtual | ~TSingleLinkedList () |
| virtual Int MQUALIFIER | add (const T &rItem) |
| virtual Int MQUALIFIER | addAll (const IList< T > &rlstItems) |
| virtual Int MQUALIFIER | addEmptyItem () |
| virtual void MQUALIFIER | copyToList (IList< T > &rList) const |
| virtual void MQUALIFIER | clear () |
| virtual Retval MQUALIFIER | deleteItem (Int iIndex) |
| virtual Retval MQUALIFIER | remove (const T &rItem) |
| virtual Retval MQUALIFIER | removeAll (const IList< T > &rlstItems) |
| virtual Int MQUALIFIER | getCount () const |
| virtual T &MQUALIFIER | getItem (Int iIndex) |
| virtual const T &MQUALIFIER | getItemConst (Int iIndex) const |
| virtual bool MQUALIFIER | equalsItem (Int iIndex, const T &rItem) const |
| virtual bool MQUALIFIER | equals (const IList< T > &rList) const |
| virtual Int MQUALIFIER | indexOf (const T &rItem) const |
| virtual Int MQUALIFIER | insert (Int iIndex, const T &rItem) |
| virtual IListIterator< T > *MQUALIFIER | getIterator () const |
| virtual const IListIterator< T > *MQUALIFIER | getConstIterator () const |
| virtual void MQUALIFIER | releaseIterator (const IListIterator< T > *pIterator) const |
| virtual bool MQUALIFIER | isEmpty () const |
| virtual T &MQUALIFIER | getFirstItem () |
| virtual const T &MQUALIFIER | getFirstItemConst () const |
| virtual T &MQUALIFIER | getLastItem () |
| virtual const T &MQUALIFIER | getLastItemConst () const |
| virtual bool MQUALIFIER | hasItem (const T &rItem) const |
| virtual bool MQUALIFIER | hasAllItems (const IList< T > &rlstItems) const |
| T & | operator[] (Int iIndex) |
| TSingleLinkedList< T > & | operator= (const TSingleLinkedList< T > &rList) |
| bool | operator== (const TSingleLinkedList< T > &rList) const |
| bool | operator!= (const TSingleLinkedList< T > &rList) const |
| TSingleLinkedListElement * | getHeadElement () const |
| T & | getEmptyElement () |
Protected Member Functions | |
| void | resetAllIterators () |
Protected Attributes | |
| T | m_tEmpty |
| Empty element in case an error occures. | |
Classes | |
| struct | TSingleLinkedListElement |
| class | TSingleListIterator |
| zeus::TSingleLinkedList< T >::TSingleLinkedList | ( | ) | [inline] |
Creates an empty list
| zeus::TSingleLinkedList< T >::TSingleLinkedList | ( | const T & | rEmptyItem | ) | [inline] |
Creates an empty list with a special empty element. The given element will be returned if an index error occures
| rEmptyItem | : Empty element |
| zeus::TSingleLinkedList< T >::TSingleLinkedList | ( | const TSingleLinkedList< T > & | rList | ) | [inline] |
Copy constructor
| rList | : List to copy |
| zeus::TSingleLinkedList< T >::~TSingleLinkedList | ( | ) | [inline, virtual] |
Destroys the list. Objects will be destroyed as well. Pointers must be released before killing the list.
| Int MQUALIFIER zeus::TSingleLinkedList< T >::add | ( | const T & | rItem | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TSingleLinkedList< T >::addAll | ( | const IList< T > & | rlstItems | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TSingleLinkedList< T >::addEmptyItem | ( | ) | [inline, virtual] |
| void MQUALIFIER zeus::TSingleLinkedList< T >::copyToList | ( | IList< T > & | rList | ) | const [inline, virtual] |
| void MQUALIFIER zeus::TSingleLinkedList< T >::clear | ( | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TSingleLinkedList< T >::deleteItem | ( | Int | iIndex | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TSingleLinkedList< T >::remove | ( | const T & | rItem | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TSingleLinkedList< T >::removeAll | ( | const IList< T > & | rlstItems | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TSingleLinkedList< T >::getCount | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TSingleLinkedList< T >::getItem | ( | Int | iIndex | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TSingleLinkedList< T >::getItemConst | ( | Int | iIndex | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TSingleLinkedList< T >::equalsItem | ( | Int | iIndex, | |
| const T & | rItem | |||
| ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TSingleLinkedList< T >::equals | ( | const IList< T > & | rList | ) | const [inline, virtual] |
| Int MQUALIFIER zeus::TSingleLinkedList< T >::indexOf | ( | const T & | rItem | ) | const [inline, virtual] |
| Int MQUALIFIER zeus::TSingleLinkedList< T >::insert | ( | Int | iIndex, | |
| const T & | rItem | |||
| ) | [inline, virtual] |
| IListIterator< T > *MQUALIFIER zeus::TSingleLinkedList< T >::getIterator | ( | ) | const [inline, virtual] |
| const IListIterator< T > *MQUALIFIER zeus::TSingleLinkedList< T >::getConstIterator | ( | ) | const [inline, virtual] |
| void MQUALIFIER zeus::TSingleLinkedList< T >::releaseIterator | ( | const IListIterator< T > * | pIterator | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TSingleLinkedList< T >::isEmpty | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TSingleLinkedList< T >::getFirstItem | ( | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TSingleLinkedList< T >::getFirstItemConst | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TSingleLinkedList< T >::getLastItem | ( | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TSingleLinkedList< T >::getLastItemConst | ( | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TSingleLinkedList< T >::hasItem | ( | const T & | rItem | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TSingleLinkedList< T >::hasAllItems | ( | const IList< T > & | rlstItems | ) | const [inline, virtual] |
| T & zeus::TSingleLinkedList< T >::operator[] | ( | Int | iIndex | ) | [inline] |
Operator for selection an indexed item
| iIndex | : Index of the item |
| TSingleLinkedList< T > & zeus::TSingleLinkedList< T >::operator= | ( | const TSingleLinkedList< T > & | rList | ) | [inline] |
Operator to copy from a list
| rList | : List to copy |
| bool zeus::TSingleLinkedList< T >::operator== | ( | const TSingleLinkedList< T > & | rList | ) | const [inline] |
Operator to check equality of two lists
| list | : list to check |
| true | : Equal | |
| false | : not equal |
| bool zeus::TSingleLinkedList< T >::operator!= | ( | const TSingleLinkedList< T > & | rList | ) | const [inline] |
Checks if two list are not equal
| rList | : list to check |
| TSingleLinkedList< T >::TSingleLinkedListElement * zeus::TSingleLinkedList< T >::getHeadElement | ( | ) | const [inline] |
Gets the Headelement of the list
| T & zeus::TSingleLinkedList< T >::getEmptyElement | ( | ) | [inline] |
Gets the Empty data element
| void zeus::TSingleLinkedList< T >::resetAllIterators | ( | ) | [inline, protected] |
Resets all iterators
T zeus::TSingleLinkedList< T >::m_tEmpty [protected] |
Empty element in case an error occures.