80 |
|
assert (n <= maxPower_ && n >=0); |
81 |
|
return polyList_[n]; |
82 |
|
} |
83 |
< |
|
83 |
> |
|
84 |
> |
protected: |
85 |
> |
|
86 |
> |
std::vector<DoublePolynomial> polyList_; |
87 |
> |
|
88 |
|
private: |
89 |
|
|
90 |
|
void GeneratePolynomials(int maxPower); |
91 |
< |
|
92 |
< |
std::vector<DoublePolynomial> polyList_; |
91 |
> |
virtual void GenerateFirstTwoTerms() = 0; |
92 |
> |
|
93 |
|
int maxPower_; |
94 |
|
}; |
95 |
|
|
96 |
+ |
/** |
97 |
+ |
* @class ChebyshevT |
98 |
+ |
* @todo document |
99 |
+ |
*/ |
100 |
+ |
class ChebyshevT : public ChebyshevPolynomials { |
101 |
+ |
public: |
102 |
+ |
ChebyshevT(int maxPower) :ChebyshevPolynomials(maxPower) {} |
103 |
|
|
104 |
+ |
private: |
105 |
+ |
virtual void GenerateFirstTwoTerms(); |
106 |
+ |
}; |
107 |
+ |
|
108 |
+ |
/** |
109 |
+ |
* @class ChebyshevU |
110 |
+ |
* @todo document |
111 |
+ |
*/ |
112 |
+ |
class ChebyshevU : public ChebyshevPolynomials { |
113 |
+ |
public: |
114 |
+ |
ChebyshevU(int maxPower) :ChebyshevPolynomials(maxPower) {} |
115 |
+ |
|
116 |
+ |
private: |
117 |
+ |
virtual void GenerateFirstTwoTerms(); |
118 |
+ |
}; |
119 |
+ |
|
120 |
+ |
|
121 |
|
} //end namespace oopse |
122 |
|
#endif //MATH_CHEBYSHEVPOLYNOMIALS_HPP |