#include <skValist.h>
Inheritance diagram for skTVAList:
Public Methods | |
skTVAList () | |
Default Constructor - creates an empty list. | |
skTVAList (const skTVAList<T>&) | |
Copy Constructor - copies the contents of the other list into this one. | |
skTVAList (USize initial_size,USize growth_increment) | |
Constructor - taking initial size and growth increment for the list. | |
virtual | ~skTVAList () |
Destructor. | |
skTVAList& | operator= (const skTVAList<T>&) |
Assignment operator - copies the contents of the other list. | |
void | clear () |
Clears this list. | |
USize | entries () const |
Returns the number of entries in the list. | |
void | deleteElt (USize n) |
deletes the nth item in the list. More... | |
void | prepend (const T &t) |
Adds the given item to the start of the list. | |
void | insert (const T &t,USize index) |
Inserts the given item *before* the specified index. More... | |
void | append (const T &t) |
adds the given item to the list. | |
void | remove (const T &t) |
removes the given item from the list. | |
T& | operator[] (USize n) const |
retrieves the nth item from the list. More... | |
int | index (const T &t) const |
returns the index of the item within the list. More... | |
bool | contains (const T &t) const |
checks if the given item is in the list. More... | |
void | growTo (USize new_size) |
instructs the list to grow to the given size (which must be greater than the current size). More... | |
Protected Methods | |
int | findElt (const T &t) const |
returns the index of the given item in the list, or -1 if not found. | |
void | grow () |
grows the array that represents the list by the growth increment. | |
Protected Attributes | |
T* | m_Array |
the array used to represent the list. | |
USize | m_ArraySize |
the size of the array. | |
USize | m_Entries |
the number of items being used in the list. | |
USize | m_GrowthIncrement |
the amount to grow the array by. |
|
checks if the given item is in the list.
|
|
deletes the nth item in the list.
|
|
instructs the list to grow to the given size (which must be greater than the current size). The existing items are copied across |
|
returns the index of the item within the list.
|
|
Inserts the given item *before* the specified index.
|
|
retrieves the nth item from the list.
|