Most fundamental container class. The list is like an array that can grow.
public void |
Add(T&& item) |
public void |
Add(const T& item) |
public inline T& |
Back() |
public inline const T& |
Back() const |
public inline nothrow RandomAccessIter<T, T&, T*> |
Begin() |
public inline nothrow RandomAccessIter<T, const T&, const T*> |
Begin() const |
public inline nothrow RandomAccessIter<T, const T&, const T*> |
CBegin() const |
public inline nothrow RandomAccessIter<T, const T&, const T*> |
CEnd() const |
public inline nothrow long |
Capacity() const |
public nothrow void |
Clear() |
public inline nothrow long |
Count() const |
private nothrow void |
Destroy() |
public inline nothrow RandomAccessIter<T, T&, T*> |
End() |
public inline nothrow RandomAccessIter<T, const T&, const T*> |
End() const |
public inline T& |
Front() |
public inline const T& |
Front() const |
private void |
Grow(long minRes) |
public RandomAccessIter<T, T&, T*> |
Insert(RandomAccessIter<T, T&, T*> pos, T&& item) |
public RandomAccessIter<T, T&, T*> |
Insert(RandomAccessIter<T, T&, T*> pos, const T& item) |
public RandomAccessIter<T, T&, T*> |
InsertFront(T&& item) |
public RandomAccessIter<T, T&, T*> |
InsertFront(const T& item) |
public inline nothrow bool |
IsEmpty() const |
public T |
Remove(RandomAccessIter<T, T&, T*> pos) |
public void |
Remove(const T& item) |
public T |
RemoveFirst() |
public T |
RemoveLast() |
public void |
Reserve(long minRes) |
public void |
Resize(long newCount) |
public nothrow void |
operator=(List&& that) |
public void |
operator=(const List& that) |
public inline T& |
operator[](long index) |
public inline const T& |
operator[](long index) const |