-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPolynomialFraction.h
198 lines (158 loc) · 5.58 KB
/
PolynomialFraction.h
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
#ifndef POLYNOMIALFRACTION_H
#define POLYNOMIALFRACTION_H
#include "Polynomial.h"
class PolynomialFraction
{
private:
Polynomial numerator, denominator;
public:
// Begin constructors
PolynomialFraction();
PolynomialFraction(Polynomial inNumerator){
this->numerator = inNumerator;
this->denominator = Polynomial(to_ZZ_p(1));
}
PolynomialFraction(Polynomial inNumerator, Polynomial inDenominator){
this->numerator = inNumerator;
this->denominator = inDenominator;
}
PolynomialFraction (string S) {
stringstream Sstream(S);
assert( readStream(Sstream) );
}
// End constructors
// Begin operators
PolynomialFraction operator + (PolynomialFraction const &A) const{
Polynomial newNumerator;
Polynomial newDenominator;
if(A.denominator==denominator){
newNumerator = numerator + A.numerator;
newDenominator = denominator;
}
else{
newNumerator = numerator*A.denominator + A.numerator*denominator;
newDenominator = denominator*A.denominator;
}
PolynomialFraction res(newNumerator,newDenominator);
res.normalize();
return res;//(PolynomialFraction(newNumerator,newDenominator)).normalize();//PolynomialFraction(newNumerator/gcd(newNumerator,newDenominator),newDenominator/gcd(newNumerator,newDenominator));
}
PolynomialFraction operator - (PolynomialFraction const &A) const{
Polynomial newNumerator;
Polynomial newDenominator;
if(A.denominator==denominator){
newNumerator = numerator - A.numerator;
newDenominator = denominator;
}
else{
newNumerator = numerator*A.denominator - A.numerator*denominator;
newDenominator = denominator*A.denominator;
}
PolynomialFraction res(newNumerator,newDenominator);
res.normalize();
return res;//(PolynomialFraction(newNumerator,newDenominator)).normalize();//PolynomialFraction(newNumerator/gcd(newNumerator,newDenominator),newDenominator/gcd(newNumerator,newDenominator));
}
PolynomialFraction operator - () const{//unary operator -
PolynomialFraction res(*this);
res.numerator = - res.numerator;
return res;
}
void operator -= (PolynomialFraction const &A) {
(*this) = (*this) - A;
}
void operator += (PolynomialFraction const &A) {
(*this) = (*this) + A;
}
void operator *= (PolynomialFraction const &A) {
(*this) = (*this) * A;
}
PolynomialFraction operator * (ZZ_p c) const{
if ( c == to_ZZ_p(0) ) return PolynomialFraction();
PolynomialFraction res(numerator*c ,denominator);//(PolynomialFraction(numerator*c ,denominator)).normalize();
res.normalize();
return res;
}
PolynomialFraction operator * (PolynomialFraction const &A) const;
PolynomialFraction operator / (PolynomialFraction const &A) const;
bool operator == (PolynomialFraction const &A) const{
return (numerator.coef == A.numerator.coef)&&(denominator.coef == A.denominator.coef);
}
bool operator != (PolynomialFraction const &A) const{
return !((*this)==A);
}
PolynomialFraction operator()(map <Variable, PolynomialFraction> &val) const;
void normalize(){
//cout<<"denominator.degree()"<<denominator.degree()<<endl;
//reduces numerator with denominator
if(numerator==Polynomial(to_ZZ_p(0))){
denominator = Polynomial(to_ZZ_p(1));
}
if(denominator.degree()==0){
numerator = numerator* inv(denominator.getCoefficientOfTermWithMonomial(Monomial(string("1"))));
denominator = Polynomial(to_ZZ_p(1));
}
if(numerator==denominator){
numerator = Polynomial(to_ZZ_p(1));
denominator = Polynomial(to_ZZ_p(1));
}
//if denomiator and numerator have common divisor we need remove it...
}
// End operators
//Begin getters
Polynomial getNumerator(){
return this->numerator;
}
Polynomial getDenominator(){
return this->denominator;
}
//End getters
// Begin input output
bool readStream(istream &in) {
char c;
if(!in.get(c)) {return false;}
if(c== '('){//we have two-floor fraction
Polynomial temp;
in >> temp;
numerator = temp;
in.get(c);
if(c!= ')') {return false;}
in.get(c);
if(c!= '/') {return false;}
in.get(c);
if(c!= '(') {return false;}
in >> temp;
denominator = temp;
in.get(c);
if(c!= ')') {return false;}
}
else{
//assume we have one-floor fraction
in.unget();
Polynomial temp;
in >> temp;
numerator = temp;
denominator = Polynomial(to_ZZ_p(1));
}
return true;
//if not "(" and not "/"
//read as usual polynomial with 1 in denominator
//else distribute numerator and denominator
}
void writeStream(ostream &out) const{
if(denominator!=Polynomial(to_ZZ_p(1))){
out<<"(";
numerator.writeStream(out);
out<<")/(";
denominator.writeStream(out);
out<<")";
}
else{
numerator.writeStream(out);
}
}
friend ostream & operator << (ostream &out, PolynomialFraction const &A) {
A.writeStream(out);
return out;
}
};
#endif // POLYNOMIALFRACTION_H