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
|
/* Frobby: Software for monomial ideal computations.
Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.com)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/.
*/
#include "stdinc.h"
#include "BigPolynomial.h"
#include "Term.h"
#include "TermTranslator.h"
#include "VarSorter.h"
#include <algorithm>
#include <sstream>
BigPolynomial::BigPolynomial() {
}
BigPolynomial::BigPolynomial(const VarNames& names):
_names(names) {
}
size_t BigPolynomial::getTermCount() const {
return _coefTerms.size();
}
size_t BigPolynomial::getVarCount() const {
return _names.getVarCount();
}
const VarNames& BigPolynomial::getNames() const {
return _names;
}
void BigPolynomial::sortTermsReverseLex() {
sort(_coefTerms.begin(), _coefTerms.end(), compareCoefTermsReverseLex);
}
void BigPolynomial::sortVariables() {
VarSorter sorter(_names);
sorter.getOrderedNames(_names);
for (size_t i = 0; i < _coefTerms.size(); ++i)
sorter.permute(_coefTerms[i].term);
}
void BigPolynomial::clear() {
_coefTerms.clear();
}
void BigPolynomial::clearAndSetNames(const VarNames& names) {
clear();
_names = names;
}
const mpz_class& BigPolynomial::getCoef(size_t index) const {
ASSERT(index < getTermCount());
return _coefTerms[index].coef;
}
const vector<mpz_class>& BigPolynomial::getTerm(size_t index) const {
ASSERT(index < getTermCount());
return _coefTerms[index].term;
}
void BigPolynomial::newLastTerm() {
_coefTerms.resize(_coefTerms.size() + 1);
_coefTerms.back().term.resize(getVarCount());
}
vector<mpz_class>& BigPolynomial::getLastTerm() {
ASSERT(getTermCount() > 0);
return _coefTerms.back().term;
}
mpz_class& BigPolynomial::getLastCoef() {
ASSERT(getTermCount() > 0);
return _coefTerms.back().coef;
}
void BigPolynomial::renameVars(const VarNames& names) {
ASSERT(names.getVarCount() == _names.getVarCount());
_names = names;
}
void BigPolynomial::add(const mpz_class& coef,
const vector<mpz_class> term) {
ASSERT(term.size() == getVarCount());
_coefTerms.resize(_coefTerms.size() + 1);
_coefTerms.back().coef = coef;
_coefTerms.back().term = term;
}
void BigPolynomial::add(const mpz_class& coef,
const Term& term,
const TermTranslator& translator) {
ASSERT(term.getVarCount() == getVarCount());
ASSERT(translator.getVarCount() == getVarCount());
_coefTerms.resize(_coefTerms.size() + 1);
_coefTerms.back().coef = coef;
vector<mpz_class>& bigTerm = _coefTerms.back().term;
bigTerm.reserve(term.getVarCount());
for (size_t var = 0; var < term.getVarCount(); ++var)
bigTerm.push_back(translator.getExponent(var, term));
}
bool BigPolynomial::operator==(const BigPolynomial& poly) const {
return _names == poly._names && _coefTerms == poly._coefTerms;
}
bool BigPolynomial::BigCoefTerm::operator==(const BigCoefTerm& coefTerm) const {
return coef == coefTerm.coef && term == coefTerm.term;
}
void BigPolynomial::print(FILE* file) const {
ostringstream out;
out << *this;
fputs(out.str().c_str(), file);
}
void BigPolynomial::print(ostream& out) const {
out << "/---- BigPolynomial of " << _coefTerms.size() << " terms:\n";
for (vector<BigCoefTerm>::const_iterator it = _coefTerms.begin();
it != _coefTerms.end(); ++it) {
out << ' ' << it->coef << " ";
for (vector<mpz_class>::const_iterator entry = it->term.begin();
entry != it->term.end(); ++entry)
out << ' ' << *entry;
out << '\n';
}
out << "----/ End of list.\n";
}
bool BigPolynomial::compareCoefTermsReverseLex(const BigCoefTerm& a,
const BigCoefTerm& b) {
for (size_t var = 0; var < a.term.size(); ++var)
if (a.term[var] != b.term[var])
return a.term[var] > b.term[var];
return a.coef < b.coef;
}
ostream& operator<<(ostream& out, const BigPolynomial& poly) {
poly.print(out);
return out;
}
|
