 |
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 <cThreadArrayString.h>
Public Attributes | |
| cThreadLockCount | m_Lock |
Additional Inherited Members | |
 Protected Types inherited from Gray::cArraySortString< TYPE > | |
| typedef cArraySorted< cStringT< TYPE >, cStringT< TYPE >, const TYPE * > | SUPER_t |
| typedef cStringT< TYPE > | STR_t |
| typedef SUPER_t::REF_t | REF_t |
| typedef SUPER_t::KEY_t | KEY_t |
| Protected Types inherited from Gray::cArraySorted< TYPE, TYPE_ARG, TYPE_KEY > | |
| typedef cArrayTyped< TYPE, TYPE_ARG > | SUPER_t |
| typedef TYPE_KEY | KEY_t |
| typedef SUPER_t::REF_t | REF_t |
| Protected Types inherited from Gray::cArrayTyped< TYPE, TYPE_ARG > | |
| 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... | |
| Protected Member Functions inherited from Gray::cArraySortString< TYPE > | |
| virtual | ~cArraySortString () |
| virtual COMPARE_t | CompareKey (KEY_t pszID1, REF_t sID2) const override |
| virtual COMPARE_t | CompareData (REF_t sID1, REF_t sID2) const noexcept override |
| ITERATE_t | AddStr (const TYPE *pszStr) |
| ITERATE_t | FindKeyRoot (const TYPE *pszRoot) |
| ITERATE_t | FindKeyDerived (const TYPE *pszDerived) |
| Protected Member Functions inherited from Gray::cArraySorted< TYPE, TYPE_ARG, TYPE_KEY > | |
| 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) |
| Protected Member Functions inherited from Gray::cArrayTyped< TYPE, TYPE_ARG > | |
| 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 |
| Protected Member Functions inherited from Gray::CArray< TYPE, ARG_TYPE > | |
| 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) |
| Protected 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 Attributes inherited from Gray::CArray< TYPE, ARG_TYPE > | |
| TYPE * | m_pData |
| the actual array of data More... | |
| ITERATE_t | m_nSize |
| Number of elements (upperBound - 1) More... | |
Thread safe array of strings Create an alpha sorted string lookup table. CASE IGNORED !
|
mutable |
1.9.1