-
Notifications
You must be signed in to change notification settings - Fork 0
/
func.cpp
214 lines (182 loc) · 3.56 KB
/
func.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
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
#include "func.h"
class Polynom::PolynomIm
{
public:
PolynomIm(int a);
~ PolynomIm();
PolynomIm(const PolynomIm &org);
PolynomIm &operator=(const PolynomIm &org);
PolynomIm operator+(const PolynomIm &sum);
PolynomIm operator*(const PolynomIm &ar);
PolynomIm proizvodnaya (const PolynomIm &ar);
PolynomIm integral (const PolynomIm &ar);
int get_n()const;
double *get_x()const;
private:
int n;
double *x;
};
//***********************************
Polynom::Polynom(int a):
pimpl(0)
{
pimpl = new PolynomIm(a);
}
Polynom::~Polynom()
{
delete pimpl;
pimpl=0;
}
Polynom::Polynom(const Polynom &org):
pimpl(0)
{
pimpl = new PolynomIm(*(org.pimpl));
}
Polynom &Polynom::operator=(const Polynom &org)
{
*(this->pimpl) = *(org.pimpl);
return *this;
}
Polynom Polynom::operator+(const Polynom &sum)
{
return Polynom(pimpl->operator+(*(sum.pimpl)));
}
Polynom Polynom::operator*(const Polynom &ar)
{
return Polynom(pimpl->operator*(*(ar.pimpl)));
}
Polynom Polynom::proizvodnaya(const Polynom &ar)
{
return Polynom(pimpl->proizvodnaya(*(ar.pimpl)));
}
Polynom Polynom::integral(const Polynom &ar)
{
return Polynom(pimpl->integral(*(ar.pimpl)));
}
int Polynom::get_n()const
{
return pimpl->get_n();
}
double *Polynom::get_x()const
{
return pimpl->get_x();
}
//***********************************
Polynom::PolynomIm::PolynomIm(int a):
n(a), x(0)
{
x=new double[n+1];
};
Polynom::PolynomIm::~PolynomIm()
{
delete[]x;
x=0;
}
Polynom::Polynom(const PolynomIm &org):
pimpl(0)
{
pimpl = new PolynomIm(org);
}
Polynom::PolynomIm::PolynomIm(const PolynomIm& org):
n(org.n), x(0)
{
x=new double[n+1];
for(int i=n; i>=0; i--)
x[i]=org.x[i];
}
Polynom::PolynomIm &Polynom::PolynomIm::operator=(const PolynomIm &org)
{
if(this==&org)
return *this;
delete [] x;
n=org.n;
x=new double[n+1];
for(int i=0; i<n+1; ++i)
x[i]=org.x[i];
return *this;
}
Polynom::PolynomIm Polynom::PolynomIm::operator*(const PolynomIm&ar)
{
PolynomIm temp(n+ar.n-1);
for(int i=n; i>=0; --i)
{
for(int j=ar.n; j>=0; --j)
{
temp.x[i+j]+=x[i]*ar.x[j];
}
}
return temp;
}
Polynom::PolynomIm Polynom::PolynomIm::operator+(const PolynomIm &sum)
{
int max;
if( n>sum.n) max=n;
else max=sum.n;
PolynomIm temp(max);
int i, j;
if(n==sum.n)
{
for(i=0; i<sum.n+1; ++i)
temp.x[i]=x[i]+sum.x[i];
}
if(n>sum.n)
{
for(i=0; i<sum.n+1; i++)
{
temp.x[i]=x[i]+sum.x[i];
}
for(j=i; j<n+1; j++)
{
temp.x[j]=x[j];
}
}
if(n<sum.n)
{
for( i=0; i<n+1; i++)
{
temp.x[i]=x[i]+sum.x[i];
}
for( j=i; j<sum.n+1; j++)
{
temp.x[j]=sum.x[j];
}
}
return temp;
}
Polynom::PolynomIm Polynom::PolynomIm::proizvodnaya (const PolynomIm &ar)
{
PolynomIm result(n-1);
int j=n;
for ( int i=n-1; i>=0; --i)
{
result.x[i]=ar.x[j]*j;
--j ;
}
return result;
}
Polynom::PolynomIm Polynom::PolynomIm::integral (const PolynomIm &ar )
{
PolynomIm result(n+1);
int j=n;
for ( int i=n+1; i>=0; --i)
{
if(i==0)
{
result.x[i]=0;
}
else
{
result.x[i]=ar.x[j]/(j+1);
--j ;
}
}
return result;
}
double *Polynom::PolynomIm::get_x()const
{
return x;
}
int Polynom::PolynomIm::get_n()const
{
return n;
}