| BaseVector(int ilimit=8, int ithreshold=16) | BaseVector | [inline] |
| Compare(Some Item1, Some Item2, int Mode) const | Vector | [virtual] |
| CompareKey(Some Item, ConstSome Key, int Mode) const | Vector | [virtual] |
| Copy(Vector &Other) | Vector | |
| Delete(int n) | Vector | |
| DeleteAll() | Vector | |
| Exchange(Vector &other) | Vector | [inline] |
| Exchange(int n1, int n2) | Vector | [inline] |
| Find(Some which, bool reversedir=false) const | Vector | |
| FindKey(ConstSome Key, int Mode=0) const | Vector | |
| FindSortedKey(ConstSome Key, int Mode=0) const | Vector | |
| Float(int n, int Mode=0) | Vector | |
| FreeItem(Some Item) const | BaseVector | [virtual] |
| Get(int iIndex) const | BaseVector | [inline] |
| GetByKey(ConstSome Key, int Mode=0) const | Vector | [inline] |
| Insert(int n, Base *Item) | BaseVector | [inline] |
| Vector::Insert(int n, Some Item) | Vector | |
| InsertSorted(Base *Item, int *oEqual=0, int Mode=0) | BaseVector | [inline] |
| Vector::InsertSorted(Some Item, int *oEqual=0, int Mode=0) | Vector | |
| Length() const | Vector | [inline] |
| Limit() const | Vector | [inline] |
| operator[](int n) const | Vector | [inline] |
| Pop() | BaseVector | [inline] |
| Push(Base *what) | BaseVector | [inline] |
| Vector::Push(Some what) | Vector | [inline] |
| QuickSort(int Left, int Right, int Mode=0) | Vector | |
| QuickSort(int Mode=0) | Vector | [inline] |
| Replace(int n, Some what) | Vector | |
| Set(int n, Some Item) | Vector | [inline] |
| SetLength(int n) | Vector | [virtual] |
| SetLimit(int n) | Vector | [virtual] |
| Shift(int n1, int n2) | Vector | |
| Vector(int ilimit=8, int ithreshold=16) | Vector | |
| ~BaseVector() | BaseVector | [virtual] |
| ~Vector() | Vector | [virtual] |
