Compare(void *Item1, void *Item2, int Mode) const | csStrVector | [virtual] |
CompareKey(void *Item, const void *Key, int Mode) const | csStrVector | [virtual] |
csBasicVector(int ilimit=0, int ithreshold=0) | csBasicVector | |
csStrVector(int ilimit=64, int ithreshold=64) | csStrVector | [inline] |
csVector(int ilimit=8, int ithreshold=16) | csVector | [inline] |
Delete(int n, bool FreeIt=true) | csVector | |
Delete(void *Item, bool FreeIt=true) | csVector | [inline] |
csBasicVector::Delete(int n) | csBasicVector | |
csBasicVector::Delete(void *Item) | csBasicVector | [inline] |
DeleteAll(bool FreeThem=true) | csVector | |
DeleteChunk(int n, int size) | csBasicVector | |
Exchange(int n1, int n2) | csBasicVector | [inline] |
Find(void *which) const | csBasicVector | |
FindKey(const void *Key, int Mode=0) const | csVector | |
FindSortedKey(const void *Key, int Mode=0) const | csVector | |
FreeItem(void *Item) | csStrVector | [virtual] |
Get(int n) const | csStrVector | [inline] |
Insert(int n, void *Item) | csBasicVector | |
InsertChunk(int n, int size, void **Item) | csBasicVector | |
InsertSorted(void *Item, int *oEqual=NULL, int Mode=0) | csVector | |
Length() const | csBasicVector | [inline] |
Limit() const | csBasicVector | [inline] |
operator[](int n) | csBasicVector | [inline] |
operator[](int n) const | csBasicVector | [inline] |
Pop() | csBasicVector | [inline] |
Push(void *what) | csBasicVector | [inline] |
PushSmart(void *what) | csBasicVector | [inline] |
QuickSort(int Left, int Right, int Mode=0) | csVector | |
QuickSort(int Mode=0) | csVector | [inline] |
Replace(int n, void *what, bool FreePrevious=true) | csVector | |
SetLength(int n) | csBasicVector | |
Top() const | csBasicVector | [inline] |
~csBasicVector() | csBasicVector | [virtual] |
~csStrVector() | csStrVector | [virtual] |
~csVector() | csVector | [inline, virtual] |