![]() |
Gray C++ Libraries
0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
|
#include <cIniMap.h>
Public Member Functions | |
cIniMap () | |
virtual | ~cIniMap () |
ITERATE_t | Find (const IniChar_t *pszPropTag) const |
const IniChar_t * | GetVal (const IniChar_t *pszPropTag) const |
HRESULT | SetVal (const IniChar_t *pszPropTag, cStringI sValue) |
virtual HRESULT | PropSet (const IniChar_t *pszPropTag, const IniChar_t *pszValue) override |
virtual HRESULT | PropGet (const IniChar_t *pszPropTag, OUT cStringI &rsValue) const override |
virtual HRESULT | PropEnum (IPROPIDX_t ePropIdx, OUT cStringI &rsValue, cStringI *psKey=nullptr) const override |
void | SetCopy (const cIniMap &rAttribs) |
HRESULT | GetValInt (const IniChar_t *pszPropTag, int *piValue) const |
HRESULT | GetValDouble (const IniChar_t *pszPropTag, double *pdValue) const |
HRESULT | SetValInt (const IniChar_t *pszPropTag, int iVal) |
![]() | |
virtual | ~cArraySortStructHash () |
const cIniKeyValue * | FindArgForKey (KEY_t key1) const |
![]() | |
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) |
![]() | |
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 |
![]() | |
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) |
Additional Inherited Members | |
![]() | |
typedef cArraySorted< cIniKeyValue, const cIniKeyValue &, HASHCODE_t > | SUPER_t |
typedef SUPER_t::REF_t | REF_t |
typedef SUPER_t::KEY_t | KEY_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 Data1, REF_t Data2) const noexcept override |
virtual COMPARE_t | CompareKey (KEY_t key1, REF_t Data2) const override |
![]() | |
virtual COMPARE_t | CompareKey (KEY_t key1, REF_t Data2) const |
bool | RemoveArgKey (REF_t pObj, KEY_t key) |
![]() | |
ITERATE_t | QSortPartition (ITERATE_t iLeft, ITERATE_t iRight) |
void | QSort (ITERATE_t iLeft, ITERATE_t iRight) |
![]() | |
bool | IsValidIndex (ITERATE_t i) const noexcept |
![]() | |
TYPE * | m_pData |
the actual array of data More... | |
ITERATE_t | m_nSize |
Number of elements (upperBound - 1) More... | |
A bag of tuples. A collection of key/value pairs stored as strings. Can be used for HTTP cookie sets, cXmlAttributeSet, JSON objects. ASSUME NO duplicated keys. Similar to cIniObject but props are NOT known/predefined.
|
inline |
|
inlinevirtual |
get the value of a named attribute.
error as if using scanf("%lf")
error as if using scanf("%d")
|
overridevirtual |
IIniBaseEnumerator Enum the values and keys of the map.
Implements Gray::IIniBaseEnumerator.
|
overridevirtual |
Implements Gray::IIniBaseGetter.
|
overridevirtual |
IIniBaseSetter will replace if existing key.
Implements Gray::IIniBaseSetter.
void Gray::cIniMap::SetCopy | ( | const cIniMap & | rAttribs | ) |
Copy the attributes from rAttribs to this.
will replace if existing key.