#include <cPairSort.h>

Inheritance diagram for Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >:

Public Member Functions
virtual	~cPairSortBase ()

ITERATE_t	InitAssocElements (const _TYPE_PAIR *pInit, size_t iSizeElement=sizeof(_TYPE_PAIR))

virtual COMPARE_t	CompareKey (KEY_t Key, REF_t Data2) const override

virtual COMPARE_t	CompareData (REF_t Data1, REF_t Data2) const noexcept override

_TYPE_PAIR *	FindArgForKey (_TYPE_KEY Key) const

Public Member Functions inherited from Gray::cArraySorted< _TYPE_PAIR , _TYPE_PAIR , _TYPE_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_PAIR * pNew)

bool	RemoveKey (_TYPE_KEY key)

ITERATE_t	Add (_TYPE_PAIR * pNew)

void	AddArray (const SUPER_t &a)

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)

Additional Inherited Members
Public Types inherited from Gray::cArraySorted< _TYPE_PAIR , _TYPE_PAIR , _TYPE_KEY >
typedef cArrayTyped< _TYPE_PAIR , _TYPE_PAIR >	SUPER_t

typedef _TYPE_KEY	KEY_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...

Protected Member Functions inherited from Gray::cArraySorted< _TYPE_PAIR , _TYPE_PAIR , _TYPE_KEY >
bool	RemoveArgKey (REF_t pObj, KEY_t key)

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...

Detailed Description

template<class _TYPE_PAIR, class _TYPE_KEY>
class Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >

array sorted by _TYPE_KEY numeric or string. ITERATE_t FindIForKey("Text") will just find the index to the pointer

Constructor & Destructor Documentation

◆ ~cPairSortBase()

template<class _TYPE_PAIR , class _TYPE_KEY >

virtual Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >::~cPairSortBase ( )

inlinevirtual

Member Function Documentation

◆ CompareData()

template<class _TYPE_PAIR , class _TYPE_KEY >

virtual COMPARE_t Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >::CompareData	(	REF_t	Data1,
		REF_t	Data2
	)		const

inlineoverridevirtualnoexcept

Compare a data record to another data record.

Reimplemented from Gray::cArrayTyped< TYPE, ARG_TYPE >.

Reimplemented in Gray::cPairSortStr< _TYPE_A, _TYPE_B >.

◆ CompareKey()

template<class _TYPE_PAIR , class _TYPE_KEY >

virtual COMPARE_t Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >::CompareKey	(	KEY_t	Key,
		REF_t	Data2
	)		const

inlineoverridevirtual

Compare by a key that may not be part of a data record yet.

Note: If we reach here assume the key is the whole record !

Reimplemented from Gray::cArraySorted< _TYPE_PAIR *, _TYPE_PAIR *, _TYPE_KEY >.

Reimplemented in Gray::cPairSortStr< _TYPE_A, _TYPE_B >.

◆ FindArgForKey()

template<class _TYPE_PAIR , class _TYPE_KEY >

_TYPE_PAIR* Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >::FindArgForKey ( _TYPE_KEY Key ) const

inline

Note: we should put the result in cRefPtr derived pointer.

◆ InitAssocElements()

template<class _TYPE_PAIR , class _TYPE_KEY >

ITERATE_t Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >::InitAssocElements	(	const _TYPE_PAIR *	pInit,
		size_t	iSizeElement = `sizeof(_TYPE_PAIR)`
	)

inline

Init the sorted array with a static array of values.

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

c:/Dennis/Source/Gray/GrayCore/include/cPairSort.h

Public Member Functions

Additional Inherited Members

Detailed Description

template<class _TYPE_PAIR, class _TYPE_KEY> class Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >

Constructor & Destructor Documentation

◆ ~cPairSortBase()

Member Function Documentation

◆ CompareData()

◆ CompareKey()

◆ FindArgForKey()

◆ InitAssocElements()

template<class _TYPE_PAIR, class _TYPE_KEY>
class Gray::cPairSortBase< _TYPE_PAIR, _TYPE_KEY >