fib::algorithms::nLinearInequation::cRangeFactor< tFactors > Class Template Reference

#include <cRangeFactor.h>

Collaboration diagram for fib::algorithms::nLinearInequation::cRangeFactor< tFactors >:

List of all members.

Public Member Functions
	cRangeFactor ()
	cRangeFactor (tFactors inMin, tFactors inMax)
tFactors	diff () const
bool	diffIsNull () const
bool	isInf () const
bool	operator== (const cRangeFactor &rangeFactor) const
void	setMin (tFactors inMin)
void	setMax (tFactors inMax)

Public Attributes
tFactors	min
bool	bMinIsInf
tFactors	max
bool	bMaxIsInf

---

Detailed Description

template<class tFactors>
class fib::algorithms::nLinearInequation::cRangeFactor< tFactors >

Definition at line 55 of file cRangeFactor.h.

---

Constructor & Destructor Documentation

template<class tFactors >

fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::cRangeFactor

(

)

The standardconstructor for the range factor. The range for the created factor will be from negativ to positiv infinity.

template<class tFactors >

fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::cRangeFactor	(	tFactors	inMin,
		tFactors	inMax
	)

A constructor for the range factor.

Parameters:

inMin

the minimal value for the range of the factor (

See also:

min)

Parameters:

inMax

the maximal value for the range of the factor (

See also:

max)

---

Member Function Documentation

template<class tFactors >

tFactors fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::diff

(

)

const

This method will evalue the size of the range, if not one boundery is infinifty. Beware: Check with

See also:

isInf() if the range size is infinity, if you are not shure, befor using this method.

diffIsNull()

isInf()

min

max

Returns:

the difference betwean the minimal and maximal value in the range of the factor, respectively the size of the range;

template<class tFactors >

bool fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::diffIsNull

(

)

const

This method will return true if the size of the range is 0, if not one boundery is infinifty.

See also:

diff()

isInf()

min

max

Returns:

true if the difference betwean the minimal and maximal value is 0, respectively if the bounderies have not the same value, else false is returned

template<class tFactors >

bool fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::isInf

(

)

const

Returns:

true if one boundery is infinity (if

See also:

bMinIsInf or

bMaxIsInf is true), else false

template<class tFactors >

bool fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::operator==

(

const cRangeFactor< tFactors > &

rangeFactor

)

const

Equal comparrisson operator for two range factors.

Parameters:

rangeFactor

the range factor to compare this rangefactor to

Returns:

true if the given range factor rangeFactor is equal to this range factor, else false

template<class tFactors >

void fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::setMax

(

tFactors

inMax

)

This method sets the maximal boundery of the range factor to the given value. (It will also set

See also:

bMaxIsInf to false)

max

bMaxIsInf

Parameters:

inMax

the value to set the maximal boundery to

template<class tFactors >

void fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::setMin

(

tFactors

inMin

)

This method sets the minimal boundery of the range factor to the given value. (It will also set

See also:

bMinIsInf to false)

min

bMinIsInf

Parameters:

inMin

the value to set the minimal boundery to

---

Member Data Documentation

template<class tFactors >

bool fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::bMaxIsInf

The maximal value for the factor is infinity.

See also:

max

Definition at line 80 of file cRangeFactor.h.

template<class tFactors >

bool fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::bMinIsInf

The minimal value for the factor is (negativ) infinity.

See also:

min

Definition at line 68 of file cRangeFactor.h.

template<class tFactors >

tFactors fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::max

The maxmal possible number for the factor. (if not infinity

See also:

bMaxIsInf)

Definition at line 74 of file cRangeFactor.h.

template<class tFactors >

tFactors fib::algorithms::nLinearInequation::cRangeFactor< tFactors >::min

The minimal possible number for the factor. (if not infinity

See also:

bMinIsInf)

Definition at line 62 of file cRangeFactor.h.

---

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

• fib.algorithms/nLinearInequation/incl/cRangeFactor.h