/usr/include/eclib/sifter.h is in libec-dev 2013-01-01-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // sifter.h: declaration of class for sifting E(Q)/2E(Q)
//////////////////////////////////////////////////////////////////////////
//
// Copyright 1990-2012 John Cremona
//
// This file is part of the mwrank package.
//
// mwrank 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.
//
// mwrank 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 mwrank; if not, write to the Free Software Foundation,
// Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
//
//////////////////////////////////////////////////////////////////////////
// NB This is used for proving that points are independent; now
// largely obsolete, being superceded by general saturation algorithms
// allow for multiple includes
#ifndef _SIFTER_
#define _SIFTER_
class sifter {
private:
Curvedata *E;
bigint I, J, disc;
bigint r,s,t; // tranforms E to E_{I,J} (u=6)
int rank;
int verbose;
int num_aux, max_dim_im;
int ** eps_mat;
int * pivcols;
long * auxs; long * all_p; int * nroots;
long ** thetamod; int**squares;
void init(); // define auxiliary moduli and squares
void clear(); // free memory
public:
sifter(Curvedata* EE, int na, int verb=0)
:E(EE), rank(0), verbose(verb), num_aux(na)
{
I = getc4(*E);
J = 2*getc6(*E);
disc = getdiscr(*E);
E->getai(s,r,t,r,r); // r is just a dummy here
r = 3*getb2(*E); // this is its real value
s = 3*s;
t = 108*t;
init();
}
~sifter()
{
clear();
}
int code(const bigint& x, const bigint& z2, int i);
int * eps(const bigint& x, const bigint& z2);
void process(const Point& P);
void process(const vector<Point>& Plist);
int getrank() {return rank;}
void vecout(int* v);
};
#endif
|