#include <ArrayList.hpp>

Public Member Functions | |
| TArrayList (Int iSize=20, EArrayCopyMode eCopyMode=etDeepCopy) | |
| TArrayList (const T *pArray, Int iSize, EArrayCopyMode eCopyMode, bool bAttachPointer=false) | |
| TArrayList (const T &rEmptyItem, Int iSize, EArrayCopyMode eCopyMode) | |
| virtual | ~TArrayList () |
| TArrayList (const TArrayList< T > &rList) | |
| Copy constructors. | |
| TArrayList (const IArray< T > *pList) | |
| virtual T *MQUALIFIER | getArray () const |
| virtual const T *MQUALIFIER | getArrayConst () const |
| virtual Int MQUALIFIER | getArraySize () const |
| virtual Retval MQUALIFIER | setArray (const T *pArray, Int iSize, bool bAttachPointer=false) |
| virtual Retval MQUALIFIER | appendArray (const T *pArray, Int iSize) |
| virtual Retval MQUALIFIER | copyToArray (IArray< T > &rDest, Int iStart, Int iEnd) const |
| virtual EArrayCopyMode MQUALIFIER | getCopyMode () const |
| virtual Retval MQUALIFIER | overwrite (const IArray< T > &rSrc, Int iSrcStart, Int iSrcEnd, Int iDestStart) |
| 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) |
| TArrayList< T > & | operator= (const IList< T > &rList) |
| TArrayList< T > & | operator= (const IList< T > *pList) |
| TArrayList< T > & | operator= (const TArrayList< T > &rList) |
| TArrayList< T > & | operator= (const TArrayList< T > *pList) |
| bool | operator== (const TArrayList< T > &rList) const |
| bool | operator!= (const TArrayList< T > &rList) const |
| void | addEmptyItems (Int iCount) |
| T & | getEmptyItem () |
| Retval | copyToArray (TArrayList< T > &rDest, Int iStart=0, Int iEnd=INVALID_INDEX) const |
| Retval | copyToArray (T *pBuffer, Int iBufferSize, Int &rCopiedSize, Int iStart=0, Int iEnd=INVALID_INDEX) const |
| Retval | setArray2 (const T *pArray, Int iSize, bool bAttachPointer=false) |
| void | resize (Int iNewSize) |
| zeus::TArrayList< T >::TArrayList | ( | Int | iSize = 20, |
|
| EArrayCopyMode | eCopyMode = etDeepCopy | |||
| ) | [inline] |
Creates an array list.
| iSize | : Size of the array | |
| eCopyMode | : Copy mode of the array. Deep copy uses the copy constructor of the objects, shallow copy uses the memory copy function |
| zeus::TArrayList< T >::TArrayList | ( | const T * | pArray, | |
| Int | iSize, | |||
| EArrayCopyMode | eCopyMode, | |||
| bool | bAttachPointer = false | |||
| ) | [inline] |
Creates an array list
| pArray | : Array to be wrapped | |
| iSize | : Size of the array | |
| eCopyMode | : Copy mode of the array. Deep copy uses the copy constructor of the objects, shallow copy uses the memory copy function | |
| bAttachPointer | : if this flag is set the pointer of the array will be attached (managed by the array class). |
| zeus::TArrayList< T >::TArrayList | ( | const T & | rEmptyItem, | |
| Int | iSize, | |||
| EArrayCopyMode | eCopyMode | |||
| ) | [inline] |
Creates an array list. Using this constructor the empty item can be set. The empty element is returned if there is an index error
| rEmptyItem | : Empty element. | |
| iSize | : Size of the array list | |
| eCopyMode | : Copy mode of the array. Deep copy uses the copy constructor of the objects, shallow copy uses the memory copy function |
| zeus::TArrayList< T >::~TArrayList | ( | ) | [inline, virtual] |
Destroys the array list
| zeus::TArrayList< T >::TArrayList | ( | const TArrayList< T > & | rList | ) | [inline] |
Copy constructors.
Copy constructor
| rList | : ArrayList to copy |
| zeus::TArrayList< T >::TArrayList | ( | const IArray< T > * | pList | ) | [inline] |
Copy constructor
| pList | : ArrayList to copy |
| T *MQUALIFIER zeus::TArrayList< T >::getArray | ( | ) | const [inline, virtual] |
| const T *MQUALIFIER zeus::TArrayList< T >::getArrayConst | ( | ) | const [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::getArraySize | ( | ) | const [inline, virtual] |
This returns the allocated size of the array. The difference between the getCount() method and getArraySize() is, that getCount() returns the count of items in an array, and getArraySize() returns the size of the array, which is normaly bigger or equal to the count.
Implements zeus::IArray< T >.
| Retval MQUALIFIER zeus::TArrayList< T >::setArray | ( | const T * | pArray, | |
| Int | iSize, | |||
| bool | bAttachPointer = false | |||
| ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::appendArray | ( | const T * | pArray, | |
| Int | iSize | |||
| ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::copyToArray | ( | IArray< T > & | rDest, | |
| Int | iStart, | |||
| Int | iEnd | |||
| ) | const [inline, virtual] |
| EArrayCopyMode MQUALIFIER zeus::TArrayList< T >::getCopyMode | ( | ) | const [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::overwrite | ( | const IArray< T > & | rSrc, | |
| Int | iSrcStart, | |||
| Int | iSrcEnd, | |||
| Int | iDestStart | |||
| ) | [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::add | ( | const T & | rItem | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::addAll | ( | const IList< T > & | rlstItems | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::addEmptyItem | ( | ) | [inline, virtual] |
| void MQUALIFIER zeus::TArrayList< T >::copyToList | ( | IList< T > & | rList | ) | const [inline, virtual] |
| void MQUALIFIER zeus::TArrayList< T >::clear | ( | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::deleteItem | ( | Int | iIndex | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::remove | ( | const T & | rItem | ) | [inline, virtual] |
| Retval MQUALIFIER zeus::TArrayList< T >::removeAll | ( | const IList< T > & | rlstItems | ) | [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::getCount | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TArrayList< T >::getItem | ( | Int | iIndex | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TArrayList< T >::getItemConst | ( | Int | iIndex | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TArrayList< T >::equalsItem | ( | Int | iIndex, | |
| const T & | rItem | |||
| ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TArrayList< T >::equals | ( | const IList< T > & | rList | ) | const [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::indexOf | ( | const T & | rItem | ) | const [inline, virtual] |
| Int MQUALIFIER zeus::TArrayList< T >::insert | ( | Int | iIndex, | |
| const T & | rItem | |||
| ) | [inline, virtual] |
| IListIterator< T > *MQUALIFIER zeus::TArrayList< T >::getIterator | ( | ) | const [inline, virtual] |
| const IListIterator< T > *MQUALIFIER zeus::TArrayList< T >::getConstIterator | ( | ) | const [inline, virtual] |
| void MQUALIFIER zeus::TArrayList< T >::releaseIterator | ( | const IListIterator< T > * | pIterator | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TArrayList< T >::isEmpty | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TArrayList< T >::getFirstItem | ( | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TArrayList< T >::getFirstItemConst | ( | ) | const [inline, virtual] |
| T &MQUALIFIER zeus::TArrayList< T >::getLastItem | ( | ) | [inline, virtual] |
| const T &MQUALIFIER zeus::TArrayList< T >::getLastItemConst | ( | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TArrayList< T >::hasItem | ( | const T & | rItem | ) | const [inline, virtual] |
| bool MQUALIFIER zeus::TArrayList< T >::hasAllItems | ( | const IList< T > & | rlstItems | ) | const [inline, virtual] |
| T & zeus::TArrayList< T >::operator[] | ( | Int | iIndex | ) | [inline] |
Operator to index an item of the array
| iIndex | : Index of the requested item |
| TArrayList< T > & zeus::TArrayList< T >::operator= | ( | const IList< T > & | rList | ) | [inline] |
operator copies a list into this list object
| rList | : source |
| TArrayList< T > & zeus::TArrayList< T >::operator= | ( | const IList< T > * | pList | ) | [inline] |
operator copies a list into this list object
| pList | : source |
| TArrayList< T > & zeus::TArrayList< T >::operator= | ( | const TArrayList< T > & | rList | ) | [inline] |
operator copies a list into this list object
| rList | : source |
| TArrayList< T > & zeus::TArrayList< T >::operator= | ( | const TArrayList< T > * | pList | ) | [inline] |
operator copies a list into this list object
| pList | : source |
| bool zeus::TArrayList< T >::operator== | ( | const TArrayList< T > & | rList | ) | const [inline] |
Operator to check equality of two lists
| rList | : list to check |
| true | : Equal | |
| false | : not equal |
| bool zeus::TArrayList< T >::operator!= | ( | const TArrayList< T > & | rList | ) | const [inline] |
Checks if two list are not equal
| rList | : list to check |
| void zeus::TArrayList< T >::addEmptyItems | ( | Int | iCount | ) | [inline] |
adds empty items to an array
| iCount | : number of empty items to add |
| T & zeus::TArrayList< T >::getEmptyItem | ( | ) | [inline] |
Returns the empty data element
| Retval zeus::TArrayList< T >::copyToArray | ( | TArrayList< T > & | rDest, | |
| Int | iStart = 0, |
|||
| Int | iEnd = INVALID_INDEX | |||
| ) | const [inline] |
copies the data to an array list
| rDest | : Destination | |
| iStart | : Start index to copy from (default = 0) | |
| iEnd | : End index (default = INVALID_INDEX, copies to the end) |
| RET_INVALID_PARAMETER | : Invalid index iStart > iEnd | |
| RET_REQUEST_FAILED | : indices are out of bounds | |
| RET_NOERROR | : Array copied |
| Retval zeus::TArrayList< T >::copyToArray | ( | T * | pBuffer, | |
| Int | iBufferSize, | |||
| Int & | rCopiedSize, | |||
| Int | iStart = 0, |
|||
| Int | iEnd = INVALID_INDEX | |||
| ) | const [inline] |
copies the data to an array or buffer
| pBuffer | : Destination Buffer | |
| iBufferSize | : Size of the buffer | |
| iStart | : Start index to copy from (default = 0) | |
| iEnd | : End index (default = INVALID_INDEX, copies to the end) |
| RET_INVALID_PARAMETER | : Invalid index iStart > iEnd | |
| RET_REQUEST_FAILED | : indices are out of bounds | |
| RET_NOERROR | : Array copied |
| Retval zeus::TArrayList< T >::setArray2 | ( | const T * | pArray, | |
| Int | iSize, | |||
| bool | bAttachPointer = false | |||
| ) | [inline] |
| void zeus::TArrayList< T >::resize | ( | Int | iNewSize | ) | [inline] |
Resizes the array. Note that if the resize is smaller than the current size, data will be lost.
| iNewSize | : New size of the array list |