|
typedef cArraySortRef< TYPE, ITERATE_t > | SUPER_t |
|
typedef SUPER_t::REF_t | REF_t |
|
typedef SUPER_t::KEY_t | KEY_t |
|
typedef cArraySorted< cRefPtr< TYPE >, TYPE *, TYPE_KEY > | SUPER_t |
|
typedef SUPER_t::REF_t | REF_t |
|
typedef SUPER_t::ELEM_t | ELEM_t |
|
typedef cArrayTyped< TYPE, TYPE_ARG > | SUPER_t |
|
typedef TYPE_KEY | KEY_t |
|
typedef SUPER_t::REF_t | REF_t |
|
typedef CArray< TYPE, TYPE_ARG > | SUPER_t |
|
typedef cArrayTyped< TYPE, TYPE_ARG > | THIS_t |
|
typedef ITERATE_t | iterator |
|
typedef ITERATE_t | const_iterator |
|
typedef TYPE | ELEM_t |
| What type is stored. More...
|
|
typedef TYPE_ARG | REF_t |
| How to refer to this? value or ref or pointer? More...
|
|
virtual COMPARE_t | CompareData (REF_t pData1, REF_t pData2) const noexcept override |
|
virtual COMPARE_t | CompareKey (KEY_t key1, REF_t pBase) const override |
|
virtual | ~cArraySortValue () |
|
ITERATE_t | FindIForAK (const TYPE *pBase) const |
|
bool | RemoveArgKey (TYPE *pBase) |
|
ITERATE_t | AddAfter (TYPE *pBase) |
|
void | DisposeAll () |
|
virtual | ~cArraySortFacade () |
|
bool | IsValidIndex (ITERATE_t i) const noexcept |
|
REF_t | GetAt (ITERATE_t index) const noexcept |
|
REF_t | GetAtCheck (ITERATE_t nIndex) const |
|
TYPE * | FindArgForKey (TYPE_KEY key1) const noexcept |
|
ITERATE_t | FindIForAC_BRUTEFORCE (const TYPE * pData) const |
|
ELEM_t | PopHead () |
|
ELEM_t | PopTail () |
|
void | DeleteAll () |
|
virtual COMPARE_t | CompareKey (KEY_t key1, REF_t Data2) const |
|
bool | RemoveArgKey (REF_t pObj, KEY_t key) |
|
virtual | ~cArraySorted () |
|
ITERATE_t | FindINear (REF_t pNew, COMPARE_t &iCompareRes) const |
|
ITERATE_t | FindINearKey (KEY_t key, COMPARE_t &iCompareRes) const |
|
ITERATE_t | FindIForKey (KEY_t key) const |
|
ITERATE_t | FindIFirstForKey (TYPE_KEY nKey) const |
|
ITERATE_t | FindILastForKey (TYPE_KEY nKey) const |
|
ITERATE_t | AddPresorted (ITERATE_t index, COMPARE_t iCompareRes, TYPE_ARG pNew) |
|
bool | RemoveKey (TYPE_KEY key) |
|
ITERATE_t | Add (TYPE_ARG pNew) |
|
void | AddArray (const SUPER_t &a) |
|
ITERATE_t | QSortPartition (ITERATE_t iLeft, ITERATE_t iRight) |
|
void | QSort (ITERATE_t iLeft, ITERATE_t iRight) |
|
void | QSort () |
|
| cArrayTyped () noexcept |
|
| cArrayTyped (const THIS_t &rArray) |
|
| cArrayTyped (ITERATE_t iSize) |
|
virtual | ~cArrayTyped () |
|
bool | isValidCheck () const noexcept |
| < memory allocation and structure definitions are valid. More...
|
|
bool | IsValidIndex (ITERATE_t i) const noexcept |
|
ITERATE_t | ClampValidIndex (ITERATE_t i) const noexcept |
|
size_t | GetHeapStats (OUT ITERATE_t &iAllocCount) const noexcept |
|
void | AssertValidIndex (ITERATE_t nIndex) const |
|
const TYPE & | GetAtSecure (ITERATE_t nIndex) const |
|
TYPE & | ElementAtSecure (ITERATE_t nIndex) |
|
REF_t | ConstElementAt (ITERATE_t nIndex) const |
|
TYPE & | operator[] (ITERATE_t nIndex) |
|
const TYPE & | operator[] (ITERATE_t nIndex) const |
|
TYPE & | Head () |
|
TYPE & | Tail () |
|
TYPE & | ElementAtHead () |
|
TYPE & | ElementAtTail () |
|
REF_t | ConstHead () const |
|
REF_t | ConstTail () const |
|
REF_t | GetAtTail () |
|
void | UnLinkIndex (ITERATE_t nIndex) |
|
void | Swap (ITERATE_t i, ITERATE_t j) |
|
void | SetCopy (const cArrayTyped< TYPE, TYPE_ARG > &aValues) |
|
const cArrayTyped< TYPE, TYPE_ARG > & | operator= (const cArrayTyped< TYPE, TYPE_ARG > &aValues) |
|
ITERATE_t | FindIFor (TYPE_ARG arg) const |
|
bool | HasArg (TYPE_ARG arg) const |
|
void | RemoveLast () |
|
ELEM_t | PopHead () |
|
ELEM_t | PopTail () |
|
bool | RemoveArg (TYPE_ARG arg) |
|
void | UnLinkArg (TYPE_ARG arg) |
|
ITERATE_t | AddTail (TYPE_ARG newElement) |
|
ITERATE_t | PushTail (TYPE_ARG newElement) |
|
void | AddHead (TYPE_ARG newElement) |
|
TYPE * | get_DataWork () const |
|
void | AddArray (const SUPER_t &src) |
|
bool | IsEqualArray (const SUPER_t &aValues) const |
|
bool | isArraySorted () const |
|
bool | isArraySortedND () const |
|
bool | IsValidIndex (ITERATE_t i) const noexcept |
|
| CArray () noexcept |
|
| CArray (THIS_t &&ref) noexcept |
|
virtual | ~CArray () |
|
bool | IsValidMallocSize () const noexcept |
|
ITERATE_t | GetSize () const noexcept |
|
ITERATE_t | GetUpperBound () const noexcept |
|
bool | IsEmpty () const noexcept |
|
void | SetSize (ITERATE_t nNewSize) |
|
ITERATE_t | GetMallocSize () const noexcept |
|
void | RemoveAll () |
| Clean up. More...
|
|
const TYPE & | GetAt (ITERATE_t nIndex) const |
|
TYPE & | ElementAt (ITERATE_t nIndex) |
|
void | SetAt (ITERATE_t nIndex, ARG_TYPE newElement) |
|
const TYPE * | GetData () const |
|
TYPE * | GetData () |
|
void | SetDataArrayPtr (TYPE *pData, ITERATE_t nSize) |
|
void | SetAtGrow (ITERATE_t nIndex, ARG_TYPE newElement) |
|
ITERATE_t | Add (ARG_TYPE newElement) |
|
void | Copy (const CArray &src) |
|
TYPE & | operator[] (ITERATE_t nIndex) |
|
const TYPE & | operator[] (ITERATE_t nIndex) const |
|
void | InsertAt (ITERATE_t nIndex, ARG_TYPE newElement) |
|
void | RemoveAt (ITERATE_t nIndex) |
|
void | RemoveAt (ITERATE_t nIndex, ITERATE_t iQty) |
|
void | MoveElement (ITERATE_t iFrom, ITERATE_t iTo) |
|
virtual | ~CObject () |
|
virtual void | AssertValid () const |
| < memory allocation and structure definitions are valid. More...
|
|
virtual void | Serialize (cArchive &a) |
|
TYPE * | m_pData |
| the actual array of data More...
|
|
ITERATE_t | m_nSize |
| Number of elements (upperBound - 1) More...
|
|
template<class TYPE, class _TYPE_KEY = ITERATE_t>
class Gray::cThreadLockArrayValue< TYPE, _TYPE_KEY >
Thread safe array TYPE must support get_SortValue() and be cRefBase does allow dupe get_SortValue but not dupe objects