| _Insert(Some Item) | HashVector | [protected] |
| Begin() const | HashVector | [inline] |
| Buckets() | HashVector | [inline] |
| Compare(HashKey_t Key1, HashKey_t Key2) const | HashVector | [virtual] |
| Vector::Compare(Some Item1, Some Item2, int Mode) const | Vector | [protected, virtual] |
| CompareKey(Some Item, ConstSome Key, int Mode) const | Vector | [protected, virtual] |
| Copy(Vector &Other) | Vector | [protected] |
| DefaultHash(HashKey_t Key) | HashVector | [protected, static] |
| Delete(Some Item) | HashVector | |
| Vector::Delete(int n) | Vector | [protected] |
| DeleteAll() | HashVector | |
| End() const | HashVector | [inline] |
| Exchange(Vector &other) | Vector | [inline, protected] |
| Exchange(int n1, int n2) | Vector | [inline, protected] |
| Find(Some which, bool reversedir=false) const | Vector | [protected] |
| FindKey(HashKey_t Key) const | HashVector | |
| Vector::FindKey(ConstSome Key, int Mode=0) const | Vector | [protected] |
| FindSortedKey(ConstSome Key, int Mode=0) const | Vector | [protected] |
| Float(int n, int Mode=0) | Vector | [protected] |
| FreeItem(Some Item) const | HashVector | [virtual] |
| Get(int n) const | Vector | [inline, protected] |
| GetByKey(HashKey_t Key) const | HashVector | |
| Vector::GetByKey(ConstSome Key, int Mode=0) const | Vector | [inline, protected] |
| GetKey(Some Item) const | HashVector | [inline, virtual] |
| Hash | HashVector | |
| HashMask | HashVector | [protected] |
| HashVector(HashVector *other) | HashVector | [protected] |
| HashVector(int MvsS=MVS_NORMAL, int HashBits=10) | HashVector | |
| IncRef() | HashVector | [inline] |
| Insert(Some Item) | HashVector | |
| Vector::Insert(int n, Some Item) | Vector | [protected] |
| InsertSorted(Some Item, int *oEqual=0, int Mode=0) | Vector | [protected] |
| Length() | HashVector | [inline] |
| Vector::Length() const | Vector | [inline, protected] |
| lhbDestroy(LargeHashBucket *lhb) | HashVector | [protected] |
| lhbFind(LargeHashBucket *lhb, HashKey_t Key) const | HashVector | [protected] |
| lhbGetByKey(LargeHashBucket *lhb, HashKey_t Key) const | HashVector | [inline, protected] |
| lhbInsertSorted(LargeHashBucket *lhb, Some Item) | HashVector | [protected] |
| Limit() const | Vector | [inline, protected] |
| MemVsSpeed | HashVector | [protected] |
| operator[](int n) const | Vector | [inline, protected] |
| Pop() | Vector | [inline, protected] |
| Push(Some what) | Vector | [inline, protected] |
| QuickSort(int Left, int Right, int Mode=0) | Vector | [protected] |
| QuickSort(int Mode=0) | Vector | [inline, protected] |
| Replace(int n, Some what) | Vector | [protected] |
| Set(int n, Some Item) | Vector | [inline, protected] |
| SetBuckets(int iBuckets) | HashVector | [protected] |
| SetLength(int n) | Vector | [protected, virtual] |
| SetLimit(int n) | Vector | [protected, virtual] |
| Shift(int n1, int n2) | Vector | [protected] |
| Vector(int ilimit=8, int ithreshold=16) | Vector | [protected] |
| ~HashVector() | HashVector | [virtual] |
| ~Vector() | Vector | [protected, virtual] |