|
virtual | ~cArraySortVal () |
|
bool | RemoveArgKey (TYPE Data1) |
|
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 nKey) const |
|
ITERATE_t | FindILastForKey (TYPE nKey) const |
|
ITERATE_t | AddPresorted (ITERATE_t index, COMPARE_t iCompareRes, TYPE pNew) |
|
bool | RemoveKey (TYPE key) |
|
ITERATE_t | Add (TYPE pNew) |
|
void | AddArray (const SUPER_t &a) |
|
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 > &aValues) |
|
const cArrayTyped< TYPE, TYPE > & | operator= (const cArrayTyped< TYPE, TYPE > &aValues) |
|
ITERATE_t | FindIFor (TYPE arg) const |
|
bool | HasArg (TYPE arg) const |
|
void | RemoveLast () |
|
ELEM_t | PopHead () |
|
ELEM_t | PopTail () |
|
bool | RemoveArg (TYPE arg) |
|
void | UnLinkArg (TYPE arg) |
|
ITERATE_t | AddTail (TYPE newElement) |
|
ITERATE_t | PushTail (TYPE newElement) |
|
void | AddHead (TYPE newElement) |
|
TYPE * | get_DataWork () const |
|
void | AddArray (const SUPER_t &src) |
|
bool | IsEqualArray (const SUPER_t &aValues) const |
|
bool | isArraySorted () const |
|
bool | isArraySortedND () const |
|
| 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) |
|
template<class TYPE>
class Gray::cArraySortVal< TYPE >
A sorted array of some native/simple TYPE of values (NOT Pointers) No duplicates allowed. ASSUME TYPE supports cValT::Compare() DEFAULT = sort is low to high