-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest.cpp
More file actions
217 lines (166 loc) · 7.41 KB
/
Copy pathtest.cpp
File metadata and controls
217 lines (166 loc) · 7.41 KB
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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
/******************************************************
* Test program for the expressions hierarchy *
* Author: Aida Nordman *
* TNG033: Lab 2 *
******************************************************/
#include <iostream>
#include <iomanip>
#include <cmath> //abs
// using namespace std;
#include "polynomial.h"
#include "logarithm.h"
/**************************************************
* main(): incremental tests of lab 3 *
* Do NOT MODIFY *
**************************************************/
int main() {
/*****************************************************
* TEST PHASE 0 *
* Polynomial: constructors and operator<< *
*****************************************************/
std::cout << "TEST PHASE 0\n";
// coefficients of polynomials
double v1[4]{ 2.2, 4.4, 2.0, 5.0 };
double v2[3]{ 2.2, 4.4, 2.0 };
const Polynomial p1{ 3, v1 }; // create a polynomial of degree 3
const Polynomial p2{ 2, v2 }; // create a polynomial of degree 2
std::cout << "p1 = " << p1 << '\n';
std::cout << "p2 = " << p2 << '\n';
Polynomial p3{ 6.6 }; // conversion constructor: convert a double to a Polynomial
Polynomial p4{ p1 }; // copy constructor
std::cout << "p3 = " << p3 << '\n';
std::cout << "p4 = " << p4 << '\n';
/*****************************************************
* TEST PHASE 1 *
* Polynomial: operator= *
*****************************************************/
std::cout << "\nTEST PHASE 1\n";
p4 = p4; // self-assignement
std::cout << "p4 = " << p4 << '\n';
// coefficients of polynomials
double v3[3]{-1, 0, 1};
Polynomial p5{2, v3};
p3 = p4 = p5;
std::cout << "p3 = " << p3 << '\n';
std::cout << "p4 = " << p4 << '\n';
std::cout << "p5 = " << p5 << '\n';
/*****************************************************
* TEST PHASE 2 *
* Polynomial: operator() *
*****************************************************/
std::cout << "\nTEST PHASE 2\n";
std::cout << "p5(1) = " << p5(1) << '\n';
std::cout << "p1(3.3) = " << p1(3.3) << '\n';
/*****************************************************
* TEST PHASE 3 *
* Polynomial: isRoot *
*****************************************************/
std::cout << "\nTEST PHASE 3\n";
if (p5.isRoot(1)) {
std::cout << "One is a root of " << p5 << '\n';
} else {
std::cout << "One is a not root of " << p5 << '\n';
}
/*****************************************************
* TEST PHASE 4 *
* Polynomial: operator[] *
*****************************************************/
std::cout << "\nTEST PHASE 4\n";
p4[2] = 8;
std::cout << "p4 = " << p4 << '\n';
if (abs(p4[1]) < EPSILON) // compare a double with zero
{
std::cout << "Coefficient 1 of p4 is zero!\n";
}
std::cout << "Coefficient zero of p1: " << p1[0] << '\n';
/*
p1[2] = 4.4; //this should not compile <-- test
*/
/*****************************************************
* TEST PHASE 5 *
* Polynomial: P1+P2 *
*****************************************************/
std::cout << "\nTEST PHASE 5\n";
p4 = p1 + p2;
std::cout << "p4 = " << p4 << '\n' << '\n';
std::cout << "p1 = " << p1 << '\n';
std::cout << "p2 = " << p2 << '\n';
std::cout << "p3 = " << p3 << '\n';
std::cout << "p1 + p3 + p2 = " << p1 + p3 + p2 << '\n';
/*****************************************************
* TEST PHASE 6 *
* Polynomial: const+P and P+const *
******************************************************/
std::cout << "\nTEST PHASE 6\n";
p4 = 2.0 + p4; //Kompilatorn ser 2.0 och gör om detta till polynomial
std::cout << "p4 = " << p4 << '\n';
p4 = 0 + p4 + 3.3;
std::cout << "p4 = " << p4 << '\n';
/*****************************************************
* TEST PHASE 7 *
* Logarithm: constructors and operator<< *
*****************************************************/
std::cout << "\nTEST PHASE 7\n";
Logarithm l0; // default constructor
// Logarithm l1{p3 + 2, 2, 3, 10};
// Logarithm l2{l1}; // copy constructor
std::cout << "l0 = " << l0 << '\n';
// std::cout << "l1 = " << l1 << '\n';
// std::cout << "l2 = " << l2 << '\n';
// // Expression* e1 = new Polynomial(p4);
// // Expression* e2 = new Logarithm(l1);
// // *e1 = *e2; //<-- should not compile!!
// /*****************************************************
// * TEST PHASE 8 *
// * Logarithm: assignment operator *
// *****************************************************/
// std::cout << "\nTEST PHASE 8\n";
// Logarithm l3{p4, 1, 1, 2};
// l2 = l0 = l3;
// // Test that memory is not shared between expressions
// p4[0] = 2;
// std::cout << "p4 = " << p4 << '\n';
// std::cout << "l0 = " << l0 << '\n';
// std::cout << "l2 = " << l2 << '\n';
// std::cout << "l3 = " << l3 << '\n';
// /*****************************************************
// * TEST PHASE 9 *
// * Logarithm: operator() *
// *****************************************************/
// std::cout << "\nTEST PHASE 9\n";
// std::cout << "l1(1) = " << l1(1) << '\n';
// std::cout << "l3(1) = " << l3(1) << '\n';
// /*****************************************************
// * TEST PHASE 10 *
// * Logarithm: isRoot *
// *****************************************************/
// std::cout << "\nTEST PHASE 10\n";
// const Logarithm l4;
// if (l4.isRoot(1)) {
// std::cout << "One is a root of " << l4 << '\n';
// } else {
// std::cout << "One is not a root of " << l4 << '\n';
// }
// /*****************************************************
// * TEST PHASE 11 *
// * Expressions: dynamic binding *
// *****************************************************/
// std::cout << "\nTEST PHASE 11\n";
// Polynomial p6{p4};
// Polynomial p7{p2};
// Expression *E[4]{&p6, &l1, &p7, &l0};
// std::cout << "** evaluate " << '\n';
// for (int i = 0; i < 4; i++) {
// std::cout << "(" << *E[i] << ")"
// << "(1) = " << (*E[i])(1) << '\n';
// }
// std::cout << "\n** isRoot " << '\n';
// for (int i = 0; i < 4; i++) {
// if (E[i]->isRoot(1)) {
// std::cout << "1 is a root of " << *E[i] << '\n';
// } else {
// std::cout << "1 is not a root of " << *E[i] << '\n';
// }
// }
return 0;
}