Simbody
3.7
|
StableArray<T> is like std::vector<T> (or SimTK::Array_<T>) but more stable in two ways: More...
Public Member Functions | |
StableArray () | |
StableArray (size_t z, const T &ival=T()) | |
StableArray (const StableArray &s) | |
StableArray & | operator= (const StableArray &s) |
~StableArray () | |
bool | empty () const |
bool | empty (size_t i) const |
size_t | size () const |
size_t | nItems () const |
void | resize (size_t newz, const T &ival=T()) |
void | clear () |
void | push_back (const T &t) |
void | pop_back () |
void | insertAt (size_t i, const T &t) |
size_t | findFreeSlot () const |
size_t | findNextItem (size_t i) |
size_t | insert (const T &t) |
void | erase (size_t i) |
const T & | front () const |
T & | front () |
const T & | back () const |
T & | back () |
const T & | operator[] (size_t i) const |
T & | operator[] (size_t i) |
StableArray<T> is like std::vector<T> (or SimTK::Array_<T>) but more stable in two ways:
The above means that once you insert an item (meaning that a copy of it resides in the StableArray), you can save the address of that copy and/or its index and be certain that adding or deleting other items will leave those unaffected. Once an item has been erased, however, we will feel free to reuse both the heap it once consumed and its index.
As your punishment for the crime of enjoying this stability guarantee, consecutive elements of a StableArray are not consecutive in memory.
CAUTION: this is not suited for use across binary interfaces because the implementation is fully exposed.
|
inline |
|
inlineexplicit |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |