![]() |
Public API Reference |
| csRefArray(int ilimit=0, int ithreshold=0) | csRefArray< iSector > | [inline] |
| Delete(int n) | csRefArray< iSector > | [inline] |
| Delete(iSector *item) | csRefArray< iSector > | [inline] |
| DeleteAll() | csRefArray< iSector > | [inline] |
| Find(iSector *which) const | csRefArray< iSector > | [inline] |
| FindSortedKey(void *key, ArrayCompareKeyFunction *comparekey) const | csRefArray< iSector > | [inline] |
| Get(int n) const | csRefArray< iSector > | [inline] |
| Insert(int n, iSector *item) | csRefArray< iSector > | [inline] |
| InsertSorted(iSector *item, ArrayCompareFunction *compare) | csRefArray< iSector > | [inline] |
| Length() const | csRefArray< iSector > | [inline] |
| Limit() const | csRefArray< iSector > | [inline] |
| operator[](int n) const | csRefArray< iSector > | [inline] |
| operator[](int n) | csRefArray< iSector > | [inline] |
| Pop() | csRefArray< iSector > | [inline] |
| Push(iSector *what) | csRefArray< iSector > | [inline] |
| PushSmart(iSector *what) | csRefArray< iSector > | [inline] |
| QuickSort(ArrayCompareFunction *compare) | csRefArray< iSector > | [inline] |
| QuickSort(int Left, int Right, ArrayCompareFunction *compare) | csRefArray< iSector > | [inline] |
| SetLength(int n) | csRefArray< iSector > | [inline] |
| Top() const | csRefArray< iSector > | [inline] |
| TransferTo(csRefArray< iSector > &destination) | csRefArray< iSector > | [inline] |
| ~csRefArray() | csRefArray< iSector > | [inline] |