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
|
/*
The main procedure multiplies every successive pair of polynomials and records the result.
Called in multiplyTest.mpl as part of make check
*/
#include "multiply.h"
#include "../timing.h"
#include <iostream>
#include <fstream>
#include <climits>
#include <NTL/ZZ.h>
using namespace std;
int main(int argc, char *argv[])
{
if (argc < 3) { cout << "Usage: " << argv[0] << " fileIn fileOut" << endl; return 1; }
bool first = true;
string line;
monomialSum firstPoly, secondPoly, product;
ifstream myStream (argv[1]);
ofstream outStream(argv[2]);
if (!myStream.is_open()) { cout << "Error opening file " << argv[1] << ", please make sure it is spelled correctly." << endl; return 1; }
int polyCount = 0;
string testForms;
int *low, *high;
MonomialLoadConsumer<RationalNTL>* myLoader = new MonomialLoadConsumer<RationalNTL>();
BTrieIterator<RationalNTL, int>* it = new BTrieIterator<RationalNTL, int>();
BTrieIterator<RationalNTL, int>* it2 = new BTrieIterator<RationalNTL, int>();
while (!myStream.eof())
{
getline(myStream, line, '\n');
if (!line.empty())
{
if (first) //first polynomial
{
firstPoly.termCount = 0;
myLoader->setMonomialSum(firstPoly);
parseMonomials(myLoader, line);
if (firstPoly.termCount == 0 || firstPoly.varCount == 0)
{
cout << "Error: loaded invalid monomial sum." << endl;
return 1;
}
first = false;
}
else //second polynomial
{
secondPoly.termCount = 0;
myLoader->setMonomialSum(secondPoly);
parseMonomials(myLoader, line);
if (secondPoly.termCount == 0 || secondPoly.varCount == 0)
{
cout << "Error: loaded invalid monomial sum." << endl;
return 1;
}
else
{ product.varCount = secondPoly.varCount; }
first = true;
low = new int[product.varCount];
high = new int[product.varCount];
for (int i = 0; i < product.varCount; i++)
{
low[i] = INT_MIN;
high[i] = INT_MAX;
}
it->setTrie(firstPoly.myMonomials, firstPoly.varCount);
it2->setTrie(secondPoly.myMonomials, secondPoly.varCount);
multiply<RationalNTL>(it, it2, product, low, high);
outStream << printMonomials(product) << endl;
destroyMonomials(firstPoly);
destroyMonomials(secondPoly);
destroyMonomials(product);
delete[] low;
delete[] high;
}
}
}
delete myLoader;
myStream.close();
outStream.close();
return 0;
}
|
