Gray::cPair< _TYPE_A, _TYPE_B > Class Template Reference

#include <cPair.h>

Inheritance diagram for Gray::cPair< _TYPE_A, _TYPE_B >:

Public Member Functions
	cPair () noexcept
	cPair (_TYPE_A a, _TYPE_B b) noexcept
bool	IsValidIndex (ITERATE_t i) const noexcept
ITERATE_t	FindIA (_TYPE_A a) const noexcept
ITERATE_t	FindIB (_TYPE_B b) const noexcept
bool	FindARetB (_TYPE_A a, _TYPE_B *pb) const noexcept
bool	FindBRetA (_TYPE_B b, _TYPE_A *pa) const noexcept
_TYPE_B	FindSortedARetB (_TYPE_A a) const noexcept
Public Member Functions inherited from Gray::cPairT< _TYPE_A, _TYPE_B >
_TYPE_A	get_A () const noexcept
_TYPE_B	get_B () const noexcept
_TYPE_A	get_HashCode () const noexcept
void	put_A (_TYPE_A a) noexcept
void	put_B (_TYPE_B b) noexcept

Additional Inherited Members
Public Attributes inherited from Gray::cPairT< _TYPE_A, _TYPE_B >
_TYPE_A	m_a
	nullptr or 0 = last in array. (typically sorted by A as primary key) More...
_TYPE_B	m_b
	nullptr or 0 = last in array. More...

Detailed Description

template<class _TYPE_A, class _TYPE_B>
class Gray::cPair< _TYPE_A, _TYPE_B >

Associated pair of simple things. Like cArrayVal<> is to cArrayStruct<>

Constructor & Destructor Documentation

cPair() [1/2]

template<class _TYPE_A , class _TYPE_B >

Gray::cPair< _TYPE_A, _TYPE_B >::cPair ( )

inlinenoexcept

cPair() [2/2]

template<class _TYPE_A , class _TYPE_B >

Gray::cPair< _TYPE_A, _TYPE_B >::cPair ( _TYPE_A  a, _TYPE_B  b  )

inlinenoexcept

Member Function Documentation

FindARetB()

template<class _TYPE_A , class _TYPE_B >

bool Gray::cPair< _TYPE_A, _TYPE_B >::FindARetB ( _TYPE_A  a, _TYPE_B *  pb  ) const

inlinenoexcept

ASSUME static array. brute force lookup A to return corresponding B

Returns

<0 = can't find it.

FindBRetA()

template<class _TYPE_A , class _TYPE_B >

bool Gray::cPair< _TYPE_A, _TYPE_B >::FindBRetA ( _TYPE_B  b, _TYPE_A *  pa  ) const

inlinenoexcept

ASSUME static array. brute force lookup B to return corresponding A

FindIA()

template<class _TYPE_A , class _TYPE_B >

ITERATE_t Gray::cPair< _TYPE_A, _TYPE_B >::FindIA ( _TYPE_A  a ) const

inlinenoexcept

ASSUME static array. brute force lookup A

FindIB()

template<class _TYPE_A , class _TYPE_B >

ITERATE_t Gray::cPair< _TYPE_A, _TYPE_B >::FindIB ( _TYPE_B  b ) const

inlinenoexcept

ASSUME static array. brute force lookup B return index

Returns

<0 = can't find it.

FindSortedARetB()

template<class _TYPE_A , class _TYPE_B >

_TYPE_B Gray::cPair< _TYPE_A, _TYPE_B >::FindSortedARetB ( _TYPE_A  a ) const

inlinenoexcept

ASSUME sorted static array. Assume _TYPE_A sorted values from min to max.

Todo:

binary search?

IsValidIndex()

template<class _TYPE_A , class _TYPE_B >

bool Gray::cPair< _TYPE_A, _TYPE_B >::IsValidIndex ( ITERATE_t  i ) const

inlinenoexcept

ASSUME static array. either value is non zero?

---

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

• c:/Dennis/Source/Gray/GrayCore/include/cPair.h