forked from JohnCremona/eclib
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mvector.cc
399 lines (346 loc) · 9.9 KB
/
mvector.cc
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
// mvector.cc: implementations of multiprecision integer vector class
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the eclib package.
//
// eclib 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.
//
// eclib 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 eclib; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
#include <eclib/marith.h>
#include <eclib/mvector.h>
// Definitions of member operators and functions:
vec_m::~vec_m()
{
delete[] entries;
}
vec_m::vec_m(long n)
{
d=n;
entries=new bigint[n];
if (!entries) {cout<<"Out of memory!\n"; abort();}
bigint *v=entries; while(n--) *v++=0;
}
vec_m::vec_m(long n, bigint* array) //array must have at least n elements!
{
d=n;
entries=new bigint[n];
if (!entries) {cout<<"Out of memory!\n"; abort();}
bigint *v=entries; while(n--) *v++=*array++;
}
vec_m::vec_m(const vec_m& v) // copy constructor
{
d=v.d;
entries=new bigint[d];
if (!entries) {cout<<"Out of memory!\n"; abort();}
bigint *v1=entries, *v2=v.entries; long n=d;
while(n--) *v1++=*v2++;
}
vec_m::vec_m(const vec_i& v)
{
d=v.d;
entries=new bigint[d];
if (!entries) {cout<<"Out of memory!\n"; abort();}
bigint *v1=entries; int *v2=v.entries; long n=d;
while(n--) *v1++=*v2++;
}
vec_m::vec_m(const vec_l& v)
{
d=v.d;
entries=new bigint[d];
if (!entries) {cout<<"Out of memory!\n"; abort();}
bigint *v1=entries; long *v2=v.entries; long n=d;
while(n--) *v1++=*v2++;
}
void vec_m::init(long n) // (re)-initializes
{
if (d!=n) // no point in deleting if same size
{
delete[] entries;
d = n;
entries=new bigint[d];
if (!entries) {cout<<"Out of memory!\n"; abort();}
}
bigint *v=entries; while(n--) *v++=0;
}
vec_m& vec_m::operator=(const vec_m& v) // assignment
{
if (this==&v) return *this;
if (d!=v.d) // no point in deleting if new is same size
{
delete[] entries;
d = v.d;
entries=new bigint[d];
if (!entries) {cout<<"Out of memory!\n"; abort();}
}
bigint *v1=entries, *v2=v.entries; long n=d;
while(n--) *v1++=*v2++;
return *this;
}
bigint& vec_m::operator[](long i) const
{
if ((i>0) && (i<=d)) return entries[i-1];
else {cout << "bad subscript in vec_m::operator[]\n"; abort(); return entries[0];}
}
vec_m& vec_m::operator+=(const vec_m& q2)
{
bigint* vi=entries, *wi=q2.entries; long i=d;
if (d==q2.d) {while(i--)(*vi++)+=(*wi++);}
else {cout << "Incompatible vec_ms in vec_m::operator+=\n"; abort();}
return *this;
}
void vec_m::addmodp(const vec_m& w, const bigint& pr)
{
bigint* vi=entries, *wi=w.entries; long i=d;
if (d==w.d) {while(i--) {*vi = mod((*wi++)+(*vi),pr);vi++;}}
else {cout << "Incompatible vec_ms in vec_m::addmodp\n";abort();}
}
vec_m& vec_m::operator-=(const vec_m& q2)
{
bigint* vi=entries; bigint* wi=q2.entries; long i=d;
if (d==q2.d) {while(i--)(*vi++)-=(*wi++);}
else {cout << "Incompatible vec_ms in vec_m::operator-=\n";abort();}
return *this;
}
vec_m& vec_m::operator*=(const bigint& scal)
{
bigint* vi=entries; long i=d;
while (i--) (*vi++) *= scal;
return *this;
}
vec_m& vec_m::operator/=(const bigint& scal)
{
bigint* vi=entries; long i=d;
while (i--) (*vi++) /= scal;
return *this;
}
vec_m vec_m::slice(long first, long last) const // returns subvec_m
{
if (last==-1) {last=first; first=1;}
long n = last-first+1;
vec_m ans(n);
bigint *entriesi=entries+(first-1), *ansi=ans.entries; long i=n;
while (i--) *ansi++ = *entriesi++;
return ans;
}
vec_m vec_m::operator[](const vec_i& index) const//returns v[index[j]]
{long dd = dim(index); vec_m w(dd);
for(long i=1; i<=dd;i++) w[i] = entries[index[i]-1];
return w;
}
vec_m vec_m::operator[](const vec_l& index) const
{long dd = dim(index); vec_m w(dd);
for(long i=1; i<=dd;i++) w[i] = entries[index[i]-1];
return w;
}
bigint vec_m::sub(long i) const
{
if ((i>0) && (i<=d)) return entries[i-1];
else {bigint zero; cout << "bad subscript in vec_m::sub\n"; abort(); return zero;}
}
void vec_m::set(long i, const bigint& x)
{
if ((i>0) && (i<=d)) entries[i-1]=x;
else {cout << "bad subscript in vec_m::set\n";abort();}
}
void vec_m::add(long i, const bigint& x)
{
if ((i>0) && (i<=d)) entries[i-1]+=x;
else {cout << "bad subscript in vec_m::add\n";abort();}
}
vec_l vec_m::shorten(long x) const //converts to a vector of longs
{
vec_l ans(d);
bigint *v1=entries; long *v2=ans.entries; long n=d;
while(n--)
{
bigint& veci = *v1++;
if(is_long(veci))
*v2 = I2long(veci);
else
{
cout << "Problem shortening bigint " << veci << " to a long!" << endl;
abort();
}
v2++;
}
return ans;
}
vec_i vec_m::shorten(int x) const //converts to a vector of ints
{
vec_i ans(d);
bigint *v1=entries; int *v2=ans.entries; long n=d;
while(n--)
{
bigint& veci = *v1++;
if(is_int(veci))
*v2 = I2int(veci);
else
{
cout << "Problem shortening bigint " << veci << " to an int!" << endl;
abort();
}
v2++;
}
return ans;
}
// Definitions of non-member, friend operators and functions
bigint operator*(const vec_m& v, const vec_m& w)
{
long dim=v.d; bigint dot;
bigint* vi=v.entries, *wi=w.entries;
if (dim==w.d)
while (dim--) dot+= (*vi++)*(*wi++);
else
{
cout << "Unequal dimensions in dot product\n";
abort();
}
return dot;
}
int operator==(const vec_m& v, const vec_m& w)
{
long dim=v.d;
long equal = (dim==w.d);
bigint* vi=v.entries, *wi=w.entries;
while ((dim--) && equal) equal = ((*vi++)==(*wi++));
return equal;
}
int trivial(const vec_m& v)
{
int ans=1, i=v.d; bigint* vi=v.entries;
while ((i--)&&ans) ans=(is_zero(*vi++));
return ans;
}
ostream& operator<<(ostream& s, const vec_m& v)
{
long i=v.d; bigint* vi=v.entries;
s << "[";
while (i--) {s<<(*vi++); if(i)s<<",";}
s << "]";
return s;
}
istream& operator>>(istream& s, vec_m& v)
{
long i = v.d;
bigint* vi = v.entries;
while (i--) s >> (*vi++);
return s;
}
bigint mvecgcd(const vec_m& v)
{
long i=v.d; bigint g; bigint *vi=v.entries;
while ((i--)&&(!is_one(g))) g=gcd(g,*vi++);
return g;
}
void swapvec(vec_m& v, vec_m& w)
{bigint *temp;
if (v.d==w.d) {temp=v.entries; v.entries=w.entries; w.entries=temp;}
else {cout << "Attempt to swap vec_ms of different lengths!\n";abort();}
}
int member(const bigint& a, const vec_m& v)
{int ans=0; long i=dim(v); bigint* vi=v.entries;
while (i--&&!ans) ans=(a==(*vi++));
return ans;
}
// Definition of non-friend operators and functions
vec_m express(const vec_m& v, const vec_m& v1, const vec_m& v2)
{
vec_m ans(3);
static bigint one; one=1;
bigint v1v1 = v1 * v1;
bigint v1v2 = v1 * v2;
bigint v2v2 = v2 * v2;
bigint vv1 = v * v1;
bigint vv2 = v * v2;
ans[1]= vv1*v2v2 - vv2*v1v2;
ans[2]= vv2*v1v1 - vv1*v1v2;
ans[3]= v1v1*v2v2 - v1v2*v1v2;
bigint g = mvecgcd(ans);
if (g>one) ans/=g;
if (ans[3]*v!=ans[1]*v1+ans[2]*v2)
{
cout << "Error in express: v is not in <v1,v2>\n";
abort();
}
return ans;
}
vec_m lift(const vec_m& v, const bigint& pr)
{
long i, d = dim(v);
vec_m nums(d);
bigint lim = sqrt(pr>>1), nu, de, g;
g=1; // g = least common denom. after lifting via modrat
vec_m denoms(d);
for (i=1; i<=d; i++)
{
bigint& vi=v[i];
modrat(vi,pr,lim,nu,de);
nums[i]=nu; denoms[i]=de;
g=lcm(g,de);
}
for (i=1; i<=d; i++) nums[i]*=(g/denoms[i]);
return nums;
}
int liftok(vec_m& v, const bigint& pr)
{
long i, d = dim(v); bigint g, nu, de; int success=1, succ;
bigint lim = sqrt(pr>>1);
for (i=1, g=1; i<=d; i++)
{
bigint& vi=v[i]; succ=modrat(vi,pr,lim,nu,de);
success = success && succ;
// Can't say success=success&&modrat(...) as then after first fail it does
// not call modrat at all due to clever compiler!
g=lcm(g,de);
}
for (i=1; i<=d; i++) v[i] = mod(g*v[i],pr);
return success;
}
bigint dotmodp(const vec_m& v1, const vec_m& v2, const bigint& pr)
{
bigint ans;
for(long i=1; i<=dim(v1); i++) ans=mod(ans+mod(v1[i]*v2[i],pr),pr);
return ans;
}
long dim(const vec_m& v) {return v.d;}
int operator!=(const vec_m& v, const vec_m& w) { return !(v==w);}
vec_m operator+(const vec_m& v)
{return v;}
vec_m operator-(const vec_m& v)
{vec_m ans(v); ans*=BIGINT(-1); return ans;}
vec_m operator+(const vec_m& v1, const vec_m& v2)
{vec_m ans(v1); ans+=v2; return ans;}
vec_m addmodp(const vec_m& v1, const vec_m& v2, const bigint& pr)
{vec_m ans(v1); ans.addmodp(v2,pr); return ans;}
vec_m operator-(const vec_m& v1, const vec_m& v2)
{vec_m ans(v1); ans-=v2; return ans;}
vec_m operator*(const bigint& scal, const vec_m& v)
{vec_m ans(v); ans*=scal; return ans;}
// NB cannot rely on coercion for next function as compiler tends to
// construct a zero vector from the long and use dot product!
vec_m operator*(long scal, const vec_m& v)
{vec_m ans(v); ans*=BIGINT(scal); return ans;}
vec_m operator/(const vec_m& v, const bigint& scal)
{vec_m ans(v); ans/=scal; return ans;}
void makeprimitive(vec_m& v)
{ bigint g=mvecgcd(v); if(!(is_one(g)||is_zero(g))) v/=g;}
void elim(const vec_m& a, vec_m& b, long pos)
{ (b*=a[pos])-=(b[pos]*a);}
void elim1(const vec_m& a, vec_m& b, long pos)
{ (b*=a[pos])-=(b[pos]*a); makeprimitive(b);}
void elim2(const vec_m& a, vec_m& b, long pos, const bigint& lastpivot)
{ ((b*=a[pos])-=(b[pos]*a))/=lastpivot;}