 |
Gray C++ Libraries
0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
|
|
Gray C++ Libraries
0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
|
#include <cArrayNew.h>
Additional Inherited Members | |
 Public Types inherited from Gray::cArrayFacade< cNewPtr< TYPE >, TYPE * > | |
| typedef cArrayTyped< cNewPtr< TYPE >, TYPE * > | SUPER_t |
| typedef cArrayFacade< cNewPtr< TYPE >, TYPE * > | THIS_t |
| typedef SUPER_t::ELEM_t | ELEM_t |
| typedef SUPER_t::REF_t | REF_t |
| Public Types inherited from Gray::cArrayTyped< TYPE, ARG_TYPE > | |
| typedef CArray< TYPE, ARG_TYPE > | SUPER_t |
| typedef cArrayTyped< TYPE, ARG_TYPE > | THIS_t |
| typedef ITERATE_t | iterator |
| typedef ITERATE_t | const_iterator |
| typedef TYPE | ELEM_t |
| What type is stored. More... | |
| typedef ARG_TYPE | REF_t |
| How to refer to this? value or ref or pointer? More... | |
| Public Member Functions inherited from Gray::cArrayFacade< cNewPtr< TYPE >, TYPE * > | |
| virtual | ~cArrayFacade () |
| virtual COMPARE_t | CompareData (REF_t pData1, REF_t pData2) const noexcept override |
| REF_t | GetAt (ITERATE_t index) const |
| REF_t | GetAtCheck (ITERATE_t index) const |
| cNewPtr< TYPE > | PopHead () |
| cNewPtr< TYPE > | PopTail () |
| Public Member Functions inherited from Gray::cArrayTyped< TYPE, ARG_TYPE > | |
| 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, ARG_TYPE > &aValues) |
| const cArrayTyped< TYPE, ARG_TYPE > & | operator= (const cArrayTyped< TYPE, ARG_TYPE > &aValues) |
| ITERATE_t | FindIFor (ARG_TYPE arg) const |
| bool | HasArg (ARG_TYPE arg) const |
| void | RemoveLast () |
| ELEM_t | PopHead () |
| ELEM_t | PopTail () |
| bool | RemoveArg (ARG_TYPE arg) |
| void | UnLinkArg (ARG_TYPE arg) |
| ITERATE_t | AddTail (ARG_TYPE newElement) |
| ITERATE_t | PushTail (ARG_TYPE newElement) |
| void | AddHead (ARG_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 |
| void | QSort () |
| Public Member Functions inherited from Gray::CArray< TYPE, const TYPE & > | |
| 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, const TYPE & newElement) |
| const TYPE * | GetData () const |
| TYPE * | GetData () |
| void | SetDataArrayPtr (TYPE *pData, ITERATE_t nSize) |
| void | SetAtGrow (ITERATE_t nIndex, const TYPE & newElement) |
| ITERATE_t | Add (const TYPE & newElement) |
| void | Copy (const CArray &src) |
| TYPE & | operator[] (ITERATE_t nIndex) |
| const TYPE & | operator[] (ITERATE_t nIndex) const |
| void | InsertAt (ITERATE_t nIndex, const TYPE & newElement) |
| void | RemoveAt (ITERATE_t nIndex) |
| void | RemoveAt (ITERATE_t nIndex, ITERATE_t iQty) |
| void | MoveElement (ITERATE_t iFrom, ITERATE_t iTo) |
| Public Member Functions inherited from Gray::CObject | |
| virtual | ~CObject () |
| virtual void | AssertValid () const |
| < memory allocation and structure definitions are valid. More... | |
| virtual void | Serialize (cArchive &a) |
| Protected Member Functions inherited from Gray::cArrayTyped< TYPE, ARG_TYPE > | |
| ITERATE_t | QSortPartition (ITERATE_t iLeft, ITERATE_t iRight) |
| void | QSort (ITERATE_t iLeft, ITERATE_t iRight) |
| Protected Member Functions inherited from Gray::CArray< TYPE, const TYPE & > | |
| bool | IsValidIndex (ITERATE_t i) const noexcept |
| Protected Attributes inherited from Gray::CArray< TYPE, const TYPE & > | |
| TYPE * | m_pData |
| the actual array of data More... | |
| ITERATE_t | m_nSize |
| Number of elements (upperBound - 1) More... | |
The point of this type is that the array now OWNS the element. It will get deleted when the array is deleted.
1.9.1