#include <cArraySort.h>

Inheritance diagram for Gray::cArraySortStructName< TYPE, _TYPECH >:

Public Types
typedef cArraySorted< TYPE, const TYPE &, const _TYPECH * >	SUPER_t

typedef SUPER_t::REF_t	REF_t

typedef SUPER_t::KEY_t	KEY_t

Public Types inherited from Gray::cArraySorted< TYPE, const TYPE &, const char * >
typedef cArrayTyped< TYPE, const TYPE & >	SUPER_t

typedef const char *	KEY_t

typedef SUPER_t::REF_t	REF_t

Public Types inherited from Gray::cArrayTyped< TYPE, const TYPE & >
typedef CArray< TYPE, const TYPE & >	SUPER_t

typedef cArrayTyped< TYPE, const TYPE & >	THIS_t

typedef ITERATE_t	iterator

typedef ITERATE_t	const_iterator

typedef TYPE	ELEM_t
	What type is stored. More...

typedef const TYPE &	REF_t
	How to refer to this? value or ref or pointer? More...

Public Member Functions
virtual	~cArraySortStructName ()

const TYPE *	FindArgForKey (KEY_t key1) const

Public Member Functions inherited from Gray::cArraySorted< TYPE, const TYPE &, const char * >
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 (const char * nKey) const

ITERATE_t	FindILastForKey (const char * nKey) const

ITERATE_t	AddPresorted (ITERATE_t index, COMPARE_t iCompareRes, const TYPE & pNew)

bool	RemoveKey (const char * key)

ITERATE_t	Add (const TYPE & pNew)

void	AddArray (const SUPER_t &a)

Public Member Functions inherited from Gray::cArrayTyped< TYPE, const TYPE & >
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, const TYPE & > &aValues)

const cArrayTyped< TYPE, const TYPE & > &	operator= (const cArrayTyped< TYPE, const TYPE & > &aValues)

ITERATE_t	FindIFor (const TYPE & arg) const

bool	HasArg (const TYPE & arg) const

void	RemoveLast ()

ELEM_t	PopHead ()

ELEM_t	PopTail ()

bool	RemoveArg (const TYPE & arg)

void	UnLinkArg (const TYPE & arg)

ITERATE_t	AddTail (const TYPE & newElement)

ITERATE_t	PushTail (const TYPE & newElement)

void	AddHead (const 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

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

Protected Member Functions inherited from Gray::cArraySorted< TYPE, const TYPE &, const char * >
virtual COMPARE_t	CompareKey (KEY_t key1, REF_t Data2) const

bool	RemoveArgKey (REF_t pObj, KEY_t key)

Protected Member Functions inherited from Gray::cArrayTyped< TYPE, const 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)

Protected Member Functions inherited from Gray::CArray< TYPE, const TYPE & >
bool	IsValidIndex (ITERATE_t i) const noexcept

Additional Inherited Members
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, typename _TYPECH = char>
class Gray::cArraySortStructName< TYPE, _TYPECH >

A get_Name() sorted array of some type of structure (Non dynamic structure,NOT Pointer) ASSUME TYPE supports get_Name() DEFAULT = Alphabetic Non cased sort is low to high. A-Z