#include <SimObjectList.h>
|
| void | pushBack (SimObject *) |
| | Add the SimObject* to the end of the list, unless it's already in the list.
|
| void | pushBackForce (SimObject *) |
| | Add the SimObject* to the end of the list, moving it there if it's already present in the list.
|
| void | pushFront (SimObject *) |
| | Add the SimObject* to the start of the list.
|
| void | remove (SimObject *) |
| | Remove the SimObject* from the list; may disrupt order of the list.
|
| SimObject * | at (S32 index) const |
| void | removeStable (SimObject *pObject) |
| | Remove the SimObject* from the list; guaranteed to preserve list order.
|
| void | sortId () |
| | Sort the list by object ID.
|
| iterator | begin () |
| iterator | end () |
| void | insert (iterator, const SimObject *&) |
| void | erase (iterator) |
| SimObject *& | front () |
| SimObject *& | back () |
| void | push_front (const SimObject *&) |
| void | push_back (const SimObject *&) |
| SimObject *& | operator[] (U32) |
| SimObject *& | first () |
| SimObject *& | last () |
| void | erase_fast (U32) |
| | Vector (const U32 initialSize=0) |
| | Vector (const U32 initialSize, const char *fileName, const U32 lineNum) |
| | Vector (const char *fileName, const U32 lineNum) |
| | Vector (const Vector &) |
| | ~Vector () |
| void | setFileAssociation (const char *file, const U32 line) |
| U32 | memSize () const |
| void ** | address () const |
| U32 | setSize (U32) |
| void | increment (U32=1) |
| void | increment (const void **array, U32=1) |
| void | decrement (U32=1) |
| void | insert (U32) |
| void | erase (U32) |
| void | erase_fast (U32) |
| void | erase_fast (iterator) |
| void | clear () |
| void | compact () |
| void | sort (compare_func f) |
| void *& | first () |
| void *& | last () |
| const void *& | first () const |
| const void *& | last () const |
| void | set (void *addr, U32 sz) |
| void | merge (const Vector &p) |
| Vector< void * > & | operator= (const Vector< void * > &p) |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
| S32 | size () const |
| bool | empty () const |
| bool | contains (const void *&) const |
| void | insert (iterator, const void *&) |
| void | erase (iterator) |
| void *& | front () |
| const void *& | front () const |
| void *& | back () |
| const void *& | back () const |
| void | push_front (const void *&) |
| void | push_back (const void *&) |
| U32 | push_front_unique (const void *&) |
| U32 | push_back_unique (const void *&) |
| S32 | find_next (const void *&, U32 start=0) const |
| void | pop_front () |
| void | pop_back () |
| void *& | operator[] (U32) |
| const void *& | operator[] (U32) const |
| void *& | operator[] (S32 i) |
| const void *& | operator[] (S32 i) const |
| void *& | at (U32) |
| const void *& | at (U32) const |
| void | reserve (U32) |
| U32 | capacity () const |
◆ at()
◆ pushBack()
Add the SimObject* to the end of the list, unless it's already in the list.
◆ pushBackForce()
Add the SimObject* to the end of the list, moving it there if it's already present in the list.
◆ pushFront()
Add the SimObject* to the start of the list.
◆ remove()
Remove the SimObject* from the list; may disrupt order of the list.
◆ removeStable()
Remove the SimObject* from the list; guaranteed to preserve list order.
◆ sortId()
Sort the list by object ID.
The documentation for this class was generated from the following files:
- sim/SimObjectList.h
- sim/SimObjectList.cc