|
| | idVectorSet (void) |
| |
| | idVectorSet (const type &mins, const type &maxs, const int boxHashSize, const int initialSize) |
| |
| size_t | Allocated (void) const |
| |
| size_t | Size (void) const |
| |
| void | Init (const type &mins, const type &maxs, const int boxHashSize, const int initialSize) |
| |
| void | ResizeIndex (const int newSize) |
| |
| void | Clear (void) |
| |
| int | FindVector (const type &v, const float epsilon) |
| |
| | idList (int newgranularity=16) |
| |
| | idList (const idList< type > &other) |
| |
| | ~idList (void) |
| |
| void | Clear (void) |
| |
| int | Num (void) const |
| |
| int | NumAllocated (void) const |
| |
| void | SetGranularity (int newgranularity) |
| |
| int | GetGranularity (void) const |
| |
| size_t | Allocated (void) const |
| |
| size_t | Size (void) const |
| |
| size_t | MemoryUsed (void) const |
| |
| idList< type > & | operator= (const idList< type > &other) |
| |
| const type & | operator[] (int index) const |
| |
| type & | operator[] (int index) |
| |
| void | Condense (void) |
| |
| void | Resize (int newsize) |
| |
| void | Resize (int newsize, int newgranularity) |
| |
| void | SetNum (int newnum, bool resize=true) |
| |
| void | AssureSize (int newSize) |
| |
| void | AssureSize (int newSize, const type &initValue) |
| |
| void | AssureSizeAlloc (int newSize, new_t *allocator) |
| |
| type * | Ptr (void) |
| |
| const type * | Ptr (void) const |
| |
| type & | Alloc (void) |
| |
| int | Append (const type &obj) |
| |
| int | Append (const idList< type > &other) |
| |
| int | AddUnique (const type &obj) |
| |
| int | Insert (const type &obj, int index=0) |
| |
| int | FindIndex (const type &obj) const |
| |
| type * | Find (type const &obj) const |
| |
| int | FindNull (void) const |
| |
| int | IndexOf (const type *obj) const |
| |
| bool | RemoveIndex (int index) |
| |
| bool | Remove (const type &obj) |
| |
| void | Sort (cmp_t *compare=(cmp_t *)&idListSortCompare< type >) |
| |
| void | SortSubSection (int startIndex, int endIndex, cmp_t *compare=(cmp_t *)&idListSortCompare< type >) |
| |
| void | Swap (idList< type > &other) |
| |
| void | DeleteContents (bool clear) |
| |
template<class type, int dimension>
class idVectorSet< type, dimension >
Definition at line 43 of file VectorSet.h.