#include <List.h>
|
| T * | addBegin (T *item) |
| |
| T * | add (T *item) |
| |
| T * | addEnd (T *item) |
| |
| T * | addUnique (T *item) |
| |
| T * | addFirst (T *t) |
| | Add an element at the array's beginning.
|
| |
| T * | addLast (T *t) |
| | Add an element at the array's end.
|
| |
| T * | add (T *t) |
| | Add an element at the list's end.
|
| |
| T * | insertBefore (T *item, T *elem) |
| | Insert an element before a given element.
|
| |
| T * | insertAfter (T *item, T *elem) |
| | Insert an element after a given element.
|
| |
| T * | removeFirst () |
| | Remove the first element.
|
| |
| T * | removeLast () |
| | Remove the last element.
|
| |
| void | clearAll () |
| | Remove and delete all elements from the receiver.
|
| |
| void | clear () |
| | Empty the receiver list without freeing the memory of the list elements.
|
| |
| void | clear (int i) |
| | Clear a specified element, thus the element pointer is set to 0.
|
| |
| T * | remove (T *item) |
| | Remove an element.
|
| |
| T * | remove (unsigned int i) |
| | Remove an element using a cursor.
|
| |
| T * | getNth (int n) const |
| | Return the nth element of the list.
|
| |
| int | index (T *t) const |
| | Return the index of a given element.
|
| |
| T * | first () const |
| | Return the first element.
|
| |
| T * | last () const |
| | Return the last element.
|
| |
| T * | overwriteNth (int n, T *t) |
| | Replace the nth element with a given one.
|
| |
| T & | operator[] (int n) const |
| |
| int | trim (int n) |
| | Remove the n elements from the end of the receiver.
|
| |
| int | size () const |
| | Get the element count of the list.
|
| |
| int | empty () const |
| | Check whether the list is empty.
|
| |
| Array< T > * | clone () |
| | Clone the array.
|
| |
| Array< T > & | operator= (const Array< T > &o) |
| |
| | Array () |
| | Default constructor.
|
| |
| | ~Array () |
| | Destructor (deletes all elements of the list)
|
| |
The documentation for this class was generated from the following file: