fib::algorithms::nD1::cPolynomRange< tX, tY > Class Template Reference

#include <cPolynomRange.h>

Inheritance diagram for fib::algorithms::nD1::cPolynomRange< tX, tY >:

Collaboration diagram for fib::algorithms::nD1::cPolynomRange< tX, tY >:

List of all members.

Public Member Functions
	cPolynomRange ()
virtual void	print (ostream &outputStream) const
virtual vector < cLinearConstrainFix< tY > >	createLinearInequations (const vector< cDataPointRange< tX, tY > > &vecData, unsigned int uiMaxPolynomOrder)
virtual void	evalue (const vector< cDataPointRange< tX, tY > > &vecData, unsigned int uiMaxPolynomOrder)
virtual tY	getRangeSizeSum () const
virtual bool	getRangeSizeSumIsNull () const

Public Attributes
vector< cRangeFactor< tY > >	vecFactors

---

Detailed Description

template<class tX, class tY>
class fib::algorithms::nD1::cPolynomRange< tX, tY >

Definition at line 62 of file cPolynomRange.h.

---

Constructor & Destructor Documentation

template<class tX , class tY >

fib::algorithms::nD1::cPolynomRange< tX, tY >::cPolynomRange

(

)

Standartconstructor

---

Member Function Documentation

template<class tX , class tY >

virtual vector< cLinearConstrainFix<tY> > fib::algorithms::nD1::cPolynomRange< tX, tY >::createLinearInequations ( const vector< cDataPointRange< tX, tY > > &  vecData, unsigned int  uiMaxPolynomOrder  )

virtual

This methods creats the linear inequiations (

See also:

cLinearConstrainFix ) for the given datapoints. The i'th linear inequiations will have the form: vecData[i].minY * yu_i <= x_0 + vecData.x * x_1 + vecData.x^2 * x_2 + ... + vecData[uiMaxPolynomOrder - 1] * x_{uiMaxPolynomOrder - 1} <= vecData[i].maxY * yu_i

Parameters:

vecData	the with the datapoints, for which to evalue the linear equiations should be evalued
uiMaxPolynomOrder	the maximal order of the polynom to generate the factor ranges for

Returns:

a vector with the linear equiations for the datapoints

template<class tX , class tY >

virtual void fib::algorithms::nD1::cPolynomRange< tX, tY >::evalue ( const vector< cDataPointRange< tX, tY > > &  vecData, unsigned int  uiMaxPolynomOrder  )

virtual

This functions evalues the ranges for the possible factors for a polynom which matches the given data vecData. The returned ranges don't have to include the factors for polynom which match the data, if ther isn't a possible polynome of the maximal range given for the data.

See also:

evalue()

Parameters:

vecData	the data which the returend polynom should match
uiMaxPolynomOrder	the maximal order of the polynom to generate the factor ranges for

Returns:

ranges in which the factors of a polynom should lay, if possible (

See also:

evalue()) in this cOneAryRangeFunction

Implements fib::algorithms::nD1::cOneAryRangeFunction< tX, tY >.

template<class tX , class tY >

virtual tY fib::algorithms::nD1::cPolynomRange< tX, tY >::getRangeSizeSum ( ) const

virtual

Returns:

the sum of the ranges of this function.

Implements fib::algorithms::nD1::cOneAryRangeFunction< tX, tY >.

template<class tX , class tY >

virtual bool fib::algorithms::nD1::cPolynomRange< tX, tY >::getRangeSizeSumIsNull ( ) const

virtual

Returns:

if the sum of the ranges of this function is 0

Implements fib::algorithms::nD1::cOneAryRangeFunction< tX, tY >.

template<class tX , class tY >

virtual void fib::algorithms::nD1::cPolynomRange< tX, tY >::print ( ostream &  outputStream ) const

virtual

This method prints the given this polynom to the given stream.

Parameters:

outputStream

the stream wher to print this polynom to

Implements fib::algorithms::nD1::cOneAryRangeFunction< tX, tY >.

---

Member Data Documentation

template<class tX , class tY >

vector< cRangeFactor<tY> > fib::algorithms::nD1::cPolynomRange< tX, tY >::vecFactors

The factors for the polynom.

See also:

evalue()

Definition at line 69 of file cPolynomRange.h.

---

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

• fib.algorithms/nD1/incl/cPolynomRange.h