| Add(TYPE pNew) | Gray::cArraySorted< TYPE, TYPE, TYPE > | |
| cArrayTyped< TYPE, TYPE >::Add(ARG_TYPE newElement) | Gray::CArray< TYPE, ARG_TYPE > | inline |
| AddArray(const SUPER_t &a) | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| AddHead(TYPE newElement) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| AddPresorted(ITERATE_t index, COMPARE_t iCompareRes, TYPE pNew) | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| AddTail(TYPE newElement) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| AssertValid() const | Gray::CObject | inlinevirtual |
| AssertValidIndex(ITERATE_t nIndex) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| CArray() noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| CArray(THIS_t &&ref) noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| cArrayTyped() noexcept | Gray::cArrayTyped< TYPE, TYPE > | inline |
| cArrayTyped(const THIS_t &rArray) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| cArrayTyped(ITERATE_t iSize) | Gray::cArrayTyped< TYPE, TYPE > | inlineexplicit |
| ClampValidIndex(ITERATE_t i) const noexcept | Gray::cArrayTyped< TYPE, TYPE > | inline |
| CompareData(REF_t pData1, REF_t pData2) const noexcept override | Gray::cArraySortHash< TYPE, _TYPE_HASH > | inlineprotectedvirtual |
| cArraySorted< TYPE, TYPE, TYPE >::CompareData(REF_t Data1, REF_t Data2) const noexcept | Gray::cArrayTyped< TYPE, TYPE > | inlineprotectedvirtual |
| CompareKey(KEY_t key1, REF_t pBase) const override | Gray::cArraySortHash< TYPE, _TYPE_HASH > | inlineprotectedvirtual |
| cArraySortRef< TYPE, HASHCODE_t >::CompareKey(KEY_t key1, REF_t Data2) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | inlineprotectedvirtual |
| const_iterator typedef | Gray::cArrayTyped< TYPE, TYPE > | |
| ConstElementAt(ITERATE_t nIndex) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| ConstHead() const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| ConstTail() const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| Copy(const CArray &src) | Gray::CArray< TYPE, ARG_TYPE > | |
| DeleteAll() | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| DisposeAll() | Gray::cArraySortRef< TYPE, HASHCODE_t > | inline |
| ELEM_t typedef | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | |
| ElementAt(ITERATE_t nIndex) | Gray::CArray< TYPE, ARG_TYPE > | inline |
| ElementAtHead() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| ElementAtSecure(ITERATE_t nIndex) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| ElementAtTail() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| FindArgForKey(TYPE_KEY key1) const noexcept | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| FindIFirstForKey(TYPE nKey) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| FindIFor(TYPE arg) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| FindIForAC_BRUTEFORCE(const TYPE_PTR pData) const | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| FindIForAK(const TYPE *pBase) const | Gray::cArraySortHash< TYPE, _TYPE_HASH > | inline |
| FindIForKey(KEY_t key) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| FindILastForKey(TYPE nKey) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| FindINear(REF_t pNew, COMPARE_t &iCompareRes) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | |
| FindINearKey(KEY_t key, COMPARE_t &iCompareRes) const | Gray::cArraySorted< TYPE, TYPE, TYPE > | |
| get_DataWork() const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| GetAt(ITERATE_t index) const noexcept | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| GetAtCheck(ITERATE_t nIndex) const | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| GetAtSecure(ITERATE_t nIndex) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| GetAtTail() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| GetData() const | Gray::CArray< TYPE, ARG_TYPE > | inline |
| GetData() | Gray::CArray< TYPE, ARG_TYPE > | inline |
| GetHeapStats(OUT ITERATE_t &iAllocCount) const noexcept | Gray::cArrayTyped< TYPE, TYPE > | inline |
| GetMallocSize() const noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| GetSize() const noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| GetUpperBound() const noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| HasArg(TYPE arg) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| Head() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| InsertAt(ITERATE_t nIndex, ARG_TYPE newElement) | Gray::CArray< TYPE, ARG_TYPE > | |
| isArraySorted() const | Gray::cArrayTyped< TYPE, TYPE > | |
| isArraySortedND() const | Gray::cArrayTyped< TYPE, TYPE > | |
| IsEmpty() const noexcept | Gray::CArray< TYPE, ARG_TYPE > | inline |
| IsEqualArray(const SUPER_t &aValues) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| isValidCheck() const noexcept | Gray::cArrayTyped< TYPE, TYPE > | inlinevirtual |
| IsValidIndex(ITERATE_t i) const noexcept | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| IsValidMallocSize() const noexcept | Gray::CArray< TYPE, ARG_TYPE > | |
| iterator typedef | Gray::cArrayTyped< TYPE, TYPE > | |
| KEY_t typedef | Gray::cArraySortHash< TYPE, _TYPE_HASH > | |
| m_nSize | Gray::CArray< TYPE, ARG_TYPE > | protected |
| m_pData | Gray::CArray< TYPE, ARG_TYPE > | protected |
| MoveElement(ITERATE_t iFrom, ITERATE_t iTo) | Gray::CArray< TYPE, ARG_TYPE > | |
| operator=(const cArrayTyped< TYPE, TYPE > &aValues) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| operator[](ITERATE_t nIndex) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| operator[](ITERATE_t nIndex) const | Gray::cArrayTyped< TYPE, TYPE > | inline |
| PopHead() | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| PopTail() | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inline |
| PushTail(TYPE newElement) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| QSort(ITERATE_t iLeft, ITERATE_t iRight) | Gray::cArrayTyped< TYPE, TYPE > | protected |
| QSort() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| QSortPartition(ITERATE_t iLeft, ITERATE_t iRight) | Gray::cArrayTyped< TYPE, TYPE > | protected |
| REF_t typedef | Gray::cArraySortHash< TYPE, _TYPE_HASH > | |
| RemoveAll() | Gray::CArray< TYPE, ARG_TYPE > | |
| RemoveArg(TYPE arg) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| RemoveArgKey(TYPE *pBase) | Gray::cArraySortHash< TYPE, _TYPE_HASH > | inline |
| cArraySortRef< TYPE, HASHCODE_t >::RemoveArgKey(REF_t pObj, KEY_t key) | Gray::cArraySorted< TYPE, TYPE, TYPE > | inlineprotected |
| RemoveAt(ITERATE_t nIndex) | Gray::CArray< TYPE, ARG_TYPE > | |
| RemoveAt(ITERATE_t nIndex, ITERATE_t iQty) | Gray::CArray< TYPE, ARG_TYPE > | |
| RemoveKey(TYPE key) | Gray::cArraySorted< TYPE, TYPE, TYPE > | inline |
| RemoveLast() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| Serialize(cArchive &a) | Gray::CObject | virtual |
| SetAt(ITERATE_t nIndex, ARG_TYPE newElement) | Gray::CArray< TYPE, ARG_TYPE > | inline |
| SetAtGrow(ITERATE_t nIndex, ARG_TYPE newElement) | Gray::CArray< TYPE, ARG_TYPE > | |
| SetCopy(const cArrayTyped< TYPE, TYPE > &aValues) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| SetDataArrayPtr(TYPE *pData, ITERATE_t nSize) | Gray::CArray< TYPE, ARG_TYPE > | inline |
| SetSize(ITERATE_t nNewSize) | Gray::CArray< TYPE, ARG_TYPE > | |
| SUPER_t typedef | Gray::cArraySortHash< TYPE, _TYPE_HASH > | |
| Swap(ITERATE_t i, ITERATE_t j) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| Tail() | Gray::cArrayTyped< TYPE, TYPE > | inline |
| THIS_t typedef | Gray::cArrayTyped< TYPE, TYPE > | |
| UnLinkArg(TYPE arg) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| UnLinkIndex(ITERATE_t nIndex) | Gray::cArrayTyped< TYPE, TYPE > | inline |
| ~CArray() | Gray::CArray< TYPE, ARG_TYPE > | inlinevirtual |
| ~cArraySorted() | Gray::cArraySorted< TYPE, TYPE, TYPE > | inlinevirtual |
| ~cArraySortFacade() | Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > | inlinevirtual |
| ~cArraySortHash() | Gray::cArraySortHash< TYPE, _TYPE_HASH > | inlinevirtual |
| ~cArrayTyped() | Gray::cArrayTyped< TYPE, TYPE > | inlinevirtual |
| ~CObject() | Gray::CObject | inlinevirtual |
1.9.1