#include <List.h>
This container makes randomly accessible lists of any object, abstract or concrete but as a consequence can make no guarantees about adjacent List items being adjacent in memory.
Because the implementation is opaque, List<T> is an acceptable data type for passing across a binary interface, while STL's vector<T> is not.
Public Member Functions | |
List () | |
List (int n) | |
~List () | |
List (int n, const T &initVal) | |
List (int n, const T *initVal) | |
List (int n, const T *const *initVals) | |
List (int n, T **pp) | |
List (const List &l, int offset, int length) | |
List (List &l, int offset, int length) | |
const ListView< T > | operator() (int offset, int length) const |
ListView< T > | operator() (int offset, int length) |
List & | operator+= (const T &x) |
List & | operator+= (T *p) |
List & | operator+= (T *&x) |
operator const ListView< T > & () const | |
operator ListView< T > & () |
List | ( | ) | [inline] |
List | ( | int | n | ) | [inline, explicit] |
~List | ( | ) | [inline] |
List | ( | int | n, | |
const T & | initVal | |||
) | [inline] |
List | ( | int | n, | |
const T * | initVal | |||
) | [inline] |
List | ( | int | n, | |
const T *const * | initVals | |||
) | [inline] |
List | ( | int | n, | |
T ** | pp | |||
) | [inline] |
const ListView<T> operator() | ( | int | offset, | |
int | length | |||
) | const [inline] |
ListView<T> operator() | ( | int | offset, | |
int | length | |||
) | [inline] |
List& operator+= | ( | const T & | x | ) | [inline] |
List& operator+= | ( | T * | p | ) | [inline] |
List& operator+= | ( | T *& | x | ) | [inline] |
operator const ListView< T > & | ( | ) | const [inline] |
operator ListView< T > & | ( | ) | [inline] |