33 #include <Base/Math/Polynom.hh>
40 for (
unsigned int i=0; i<p.
GetOrder(); i++){
66 Polynom c, d, e, f, g, h, i, j, k;
79 cout <<
"polynom a: ";printPolynom(a);
80 cout <<
"polynom b: ";printPolynom(b);
81 cout <<
"double z: " << z << endl;
83 cout <<
"polynom a+b: ";printPolynom(c);
84 cout <<
"polynom b-a: ";printPolynom(d);
85 cout <<
"polynom a-b: ";printPolynom(e);
86 cout <<
"polynom a*b: ";printPolynom(f);
87 cout <<
"polynom z*b: ";printPolynom(g);
88 cout <<
"polynom b*z: ";printPolynom(h);
89 cout <<
"polynom i+=h: (should be b*z)";printPolynom(i);
90 cout <<
"polynom j-=h: (should be -(b*z))";printPolynom(j);
91 cout <<
"polynom k=a k*=b (should be a*b)";printPolynom(k);
class for Polynoms of arbitary order
unsigned int GetOrder() const
void SetOrder(unsigned int i)
sets the order of polynom to i new generated coefficients are 0