/
test.cpp
158 lines (119 loc) · 2.8 KB
/
test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#include "Polynomial.h"
#include <complex>
#include <iostream>
#define BOOST_TEST_MODULE Polynomial
#include <boost/test/included/unit_test.hpp>
using namespace std;
using namespace Storage_B::Polynomials;
// 0 degree polynomial
BOOST_AUTO_TEST_CASE(zero_degree)
{
Polynomial<double> p0(42.0);
BOOST_CHECK(p0.degree() == 0);
BOOST_CHECK(p0[0] == 42.0);
BOOST_CHECK(p0(0.123) == 42.0);
}
// first degree polynomial
BOOST_AUTO_TEST_CASE(first_degree)
{
Polynomial<double> p1(0.0, 1);
p1[0] = -1.0;
p1[1] = 1.0;
BOOST_CHECK(p1.degree() == 1);
BOOST_CHECK(p1(0.0) == -1.0);
BOOST_CHECK(p1(1.0) == 0.0);
BOOST_CHECK(p1(2.0) == 1.0);
BOOST_CHECK(p1(-1.0) == -2.0);
}
// second degree polynomial
BOOST_AUTO_TEST_CASE(second_degree)
{
double c[3] ;
c[0] = 2.0 ;
c[1] = -1.0;
c[2] = 3.0 ;
Polynomial<double> p2(c, 2) ;
BOOST_CHECK(p2.degree() == 2);
BOOST_CHECK(p2(0.0) == 2.0);
BOOST_CHECK(p2(1.0) == 4.0);
BOOST_CHECK(p2(2.0) == 12.0);
}
// third degree polynomial
BOOST_AUTO_TEST_CASE(third_degree)
{
vector<float> c;
c.push_back(-1.0);
c.push_back(1.0);
c.push_back(-2.0);
c.push_back(3.0);
Polynomial<float> p3(c);
BOOST_CHECK(p3.degree() == 3);
BOOST_CHECK(p3(0.0) == -1.0);
BOOST_CHECK(p3(1.0) == 1.0);
BOOST_CHECK(p3(-1.0) == -7.0);
}
// increment degree
BOOST_AUTO_TEST_CASE(increment_degree)
{
double c[3] ;
c[0] = 2.0 ;
c[1] = -1.0;
c[2] = 3.0 ;
Polynomial<double> p(c, 2) ;
BOOST_CHECK(p.degree() == 2);
p.IncrementDegree(12.0);
BOOST_CHECK(p.degree() == 3);
BOOST_CHECK(p[0] == 2);
BOOST_CHECK(p[1] == -1.0);
BOOST_CHECK(p[2] == 3.0);
BOOST_CHECK(p[3] == 12.0);
}
// decrement degree
BOOST_AUTO_TEST_CASE(decrement_degree)
{
double c[3] ;
c[0] = 2.0 ;
c[1] = -1.0;
c[2] = 3.0 ;
Polynomial<double> p(c, 2);
BOOST_CHECK(p.degree() == 2);
auto val = p.DecrementDegree();
BOOST_CHECK(p.degree() == 1);
BOOST_CHECK(p[0] == 2);
BOOST_CHECK(p[1] == -1.0);
BOOST_CHECK(val == 3.0);
}
// complex polynomial
BOOST_AUTO_TEST_CASE(complex_poly)
{
Polynomial<complex<double> > p;
p[0] = 1.0;
p.IncrementDegree(0.0);
p.IncrementDegree(1.0);
BOOST_CHECK(p.degree() == 2);
BOOST_CHECK(p(1.0i) == 0.0);
p.IncrementDegree();
BOOST_CHECK(p.degree() == 3);
BOOST_CHECK(p[3] == 0.0);
p[3] = 2.0 - 3.0i;
complex<double> result = p(2.0 + 1.0i);
BOOST_CHECK(result.real() == 41);
BOOST_CHECK(result.imag() == 20);
}
// Evaluate
BOOST_AUTO_TEST_CASE(derivative)
{
vector<double> c;
c.push_back(2.0) ;
c.push_back(-1.0);
c.push_back(3.0) ;
Polynomial<double> f(c);
c.clear();
c.push_back(f[1]);
c.push_back(2.0 * f[2]);
Polynomial<double> fprime(c);
double x = 42.0;
auto res = f.eval(x);
BOOST_CHECK(res.y == f(x)); // y = f(x)
BOOST_CHECK(res.dy == fprime(x)); // dy/dx = f'(x)
}