Starshatter_Open
Open source Starshatter engine
|
#include <List.h>
Public Member Functions | |
List () | |
List (const List< T > &l) | |
~List () | |
T *& | operator[] (int i) |
T * | operator[] (int i) const |
T *& | at (int i) |
T * | at (int i) const |
void | append (List< T > &list) |
void | append (const T *val) |
void | insert (const T *val, int index=0) |
void | insertSort (const T *val) |
T * | first () const |
T * | last () const |
T * | remove (const T *val) |
T * | removeIndex (int index) |
void | clear () |
void | destroy () |
int | size () const |
bool | isEmpty () const |
bool | contains (const T *val) const |
int | count (const T *val) const |
int | index (const T *val) const |
T * | find (const T *val) const |
void | sort () |
void | shuffle () |
Friends | |
class | ListIter< T > |
bool List< T >::contains | ( | const T * | val | ) | const |
int List< T >::count | ( | const T * | val | ) | const |
T * List< T >::find | ( | const T * | val | ) | const |
int List< T >::index | ( | const T * | val | ) | const |
void List< T >::insert | ( | const T * | val, |
int | index = 0 |
||
) |
void List< T >::insertSort | ( | const T * | val | ) |