#include <skValist.h>
Public Member Functions | |
| skTVAList () | |
| Default Constructor - creates an empty list. | |
| skTVAList (const skTVAList< T > &) | |
| Copy Constructor - copies the contents of the other list into this one. | |
| virtual | ~skTVAList () |
| Destructor. | |
| skTVAList & | operator= (const skTVAList< T > &) |
| Assignment operator - copies the contents of the other list. | |
| void | moveFrom (skTVAList< T > &) |
| Moves the contents of another list into this one. | |
| 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 | |
| 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. | |
| 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 | |
| int | index (const T &t) const |
| returns the index of the item within the list. | |
| bool | contains (const T &t) const |
| checks if the given item is in the list | |
| void | growTo (USize new_size) |
| instructs the list to grow to the given size (which must be greater than the current size). | |
| USize | getArraySize () const |
| returns the capacity of the current list - i.e. | |
Protected Member Functions | |
| 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 | |
| void | createArray () |
| Create the underlying array. | |
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 | |
|
||||||||||
|
Copy Constructor - copies the contents of the other list into this one.
|
|
||||||||||
|
adds the given item to the list
|
|
||||||||||
|
checks if the given item is in the list
|
|
|||||||||
|
Create the underlying array.
|
|
||||||||||
|
deletes the nth item in the list
|
|
|||||||||
|
returns the capacity of the current list - i.e. the number of items that can be stored in the underlying array |
|
|||||||||
|
grows the array that represents the list by the growth increment
|
|
||||||||||
|
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.
|
|
||||||||||
|
Moves the contents of another list into this one. The other list will now be empty. |
|
||||||||||
|
Assignment operator - copies the contents of the other list.
|
|
||||||||||
|
retrieves the nth item from the list
|
|
||||||||||
|
Adds the given item to the start of the list.
|
1.3