Gray C++ Libraries  0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH > Class Template Reference

#include <cThreadArray.h>

Inheritance diagram for Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >:
Gray::cArraySortHash< TYPE, HASHCODE_t > Gray::cArraySortRef< TYPE, HASHCODE_t > Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY > Gray::cArraySorted< TYPE, TYPE, TYPE > Gray::cArrayTyped< TYPE, TYPE > Gray::CArray< TYPE, ARG_TYPE > Gray::CObject

Public Member Functions

 cThreadLockArrayHash ()
 
 ~cThreadLockArrayHash ()
 
bool IsEmpty () const
 
ITERATE_t GetSize () const
 
cRefPtr< TYPEGetAtCheck (ITERATE_t nIndex) const
 
ITERATE_t Add (TYPE *pObj)
 
cRefPtr< TYPEPopHead ()
 
cRefPtr< TYPEPopTail ()
 
bool RemoveArgKey (TYPE *pObj)
 
void RemoveAll ()
 
void DisposeAll ()
 
cRefPtr< TYPEFindArgForKey (_TYPE_HASH hashcode) const
 

Public Attributes

cThreadLockCount m_Lock
 

Additional Inherited Members

- Protected Types inherited from Gray::cArraySortHash< TYPE, HASHCODE_t >
typedef cArraySortRef< TYPE, HASHCODE_tSUPER_t
 
typedef SUPER_t::REF_t REF_t
 
typedef SUPER_t::KEY_t KEY_t
 
- Protected Types inherited from Gray::cArraySortFacade< TYPE, TYPE_PTR, TYPE_KEY >
typedef cArraySorted< TYPE, TYPE_PTR, TYPE_KEY > SUPER_t
 
typedef SUPER_t::REF_t REF_t
 
typedef SUPER_t::ELEM_t ELEM_t
 
- Protected Types inherited from Gray::cArraySorted< TYPE, TYPE, TYPE >
typedef cArrayTyped< TYPE, TYPESUPER_t
 
typedef TYPE KEY_t
 
typedef SUPER_t::REF_t REF_t
 
- Protected Types inherited from Gray::cArrayTyped< TYPE, TYPE >
typedef CArray< TYPE, TYPESUPER_t
 
typedef cArrayTyped< TYPE, TYPETHIS_t
 
typedef ITERATE_t iterator
 
typedef ITERATE_t const_iterator
 
typedef TYPE ELEM_t
 What type is stored. More...
 
typedef TYPE REF_t
 How to refer to this? value or ref or pointer? More...
 
- Protected Member Functions inherited from Gray::cArraySortHash< TYPE, HASHCODE_t >
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 ~cArraySortHash ()
 
ITERATE_t FindIForAK (const TYPE *pBase) const
 
bool RemoveArgKey (TYPE *pBase)
 
- Protected Member Functions inherited from Gray::cArraySortRef< TYPE, HASHCODE_t >
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_PTR FindArgForKey (TYPE_KEY key1) const noexcept
 
ITERATE_t FindIForAC_BRUTEFORCE (const TYPE_PTR pData) const
 
ELEM_t PopHead ()
 
ELEM_t PopTail ()
 
void DeleteAll ()
 
- Protected Member Functions inherited from Gray::cArraySorted< TYPE, TYPE, TYPE >
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 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)
 
- Protected Member Functions inherited from Gray::cArrayTyped< TYPE, TYPE >
virtual COMPARE_t CompareData (REF_t Data1, REF_t Data2) const noexcept
 
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 TYPEGetAtSecure (ITERATE_t nIndex) const
 
TYPEElementAtSecure (ITERATE_t nIndex)
 
REF_t ConstElementAt (ITERATE_t nIndex) const
 
TYPEoperator[] (ITERATE_t nIndex)
 
const TYPEoperator[] (ITERATE_t nIndex) const
 
TYPEHead ()
 
TYPETail ()
 
TYPEElementAtHead ()
 
TYPEElementAtTail ()
 
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)
 
TYPEget_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 TYPEGetAt (ITERATE_t nIndex) const
 
TYPEElementAt (ITERATE_t nIndex)
 
void SetAt (ITERATE_t nIndex, ARG_TYPE newElement)
 
const TYPEGetData () const
 
TYPEGetData ()
 
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)
 
TYPEoperator[] (ITERATE_t nIndex)
 
const TYPEoperator[] (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 >
TYPEm_pData
 the actual array of data More...
 
ITERATE_t m_nSize
 Number of elements (upperBound - 1) More...
 

Detailed Description

template<class TYPE, typename _TYPE_HASH = HASHCODE_t>
class Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >

Thread safe hash. TYPE must support get_HashCode() and be cRefBase. Does NOT allow dupe hash codes !

Constructor & Destructor Documentation

◆ cThreadLockArrayHash()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::cThreadLockArrayHash ( )
inline

◆ ~cThreadLockArrayHash()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::~cThreadLockArrayHash ( )
inline

Member Function Documentation

◆ Add()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
ITERATE_t Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::Add ( TYPE pObj)
inline

◆ DisposeAll()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
void Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::DisposeAll ( void  )
inline

ASSUME TYPE supports DisposeThis(); like cXObject

◆ FindArgForKey()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
cRefPtr<TYPE> Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::FindArgForKey ( _TYPE_HASH  hashcode) const
inline

◆ GetAtCheck()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
cRefPtr<TYPE> Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::GetAtCheck ( ITERATE_t  nIndex) const
inline

return a reference counted pointer. NOT a bare pointer.

Note
Its slightly dangerous to enum a thread used list. We could read the same entry 2 times !
NEVER NEVER lock the list and the object at the same time! This could create a deadlock!

◆ GetSize()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
ITERATE_t Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::GetSize ( ) const
inline

Used for statistical purposes. This may change of course.

◆ IsEmpty()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
bool Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::IsEmpty ( ) const
inline

Used for statistical purposes. This may change of course.

◆ PopHead()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
cRefPtr<TYPE> Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::PopHead ( )
inline

◆ PopTail()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
cRefPtr<TYPE> Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::PopTail ( )
inline

◆ RemoveAll()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
void Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::RemoveAll ( )
inline

◆ RemoveArgKey()

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
bool Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::RemoveArgKey ( TYPE pObj)
inline

Member Data Documentation

◆ m_Lock

template<class TYPE , typename _TYPE_HASH = HASHCODE_t>
cThreadLockCount Gray::cThreadLockArrayHash< TYPE, _TYPE_HASH >::m_Lock
mutable

The documentation for this class was generated from the following file: