#include <b2GrowableBuffer.h>
Public Member Functions | |
| b2GrowableBuffer (b2BlockAllocator &allocator) | |
| b2GrowableBuffer (const b2GrowableBuffer< T > &rhs) | |
| T & | Append () |
| void | Reserve (int32 newCapacity) |
| void | Grow () |
| void | Free () |
| void | Shorten (const T *newEnd) |
| T & | operator[] (int i) |
| const T & | operator[] (int i) const |
| T * | Data () |
| const T * | Data () const |
| T * | Begin () |
| const T * | Begin () const |
| T * | End () |
| const T * | End () const |
| int32 | GetCount () const |
| void | SetCount (int32 newCount) |
| int32 | GetCapacity () const |
| template<class UnaryPredicate > | |
| T * | RemoveIf (UnaryPredicate pred) |
| template<class BinaryPredicate > | |
| T * | Unique (BinaryPredicate pred) |
A simple array-like container, similar to std::vector. If we ever start using stl, we should replace this with std::vector.