/usr/include/eclib/mglobsol.h is in libec-dev 20160101-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 | // mglobsol.h: declaration of class quartic_sieve and functions for quartic solubility testing
//////////////////////////////////////////////////////////////////////////
//
// 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 "mquartic.h"
#include "sieve_search.h"
// Function for naive search, no sieving:
int ratpoint(const quartic& g, const bigint& min, const bigint& max, bigint& xx, bigint&yy, bigint& zz);
// class for fancier sieve-assisted search
class quartic_sieve : public point_processor {
private:
quartic *g;
bigint a,b,c,d,e,roota,roote;
bigint pu,pv,pw; // coords of point found
int verbose, easy, use_stoll;
long ulim;
int num_aux;
long* auxs;
int** xgood_mod_aux;
int** squares;
long* umod;
long nwprimes; long* wprimes; long* uprimes;
long npoints, maxnpoints;
int process(const bigint& x, const bigint& y, const bigint& z)
{pu=x; pv=y; pw=z; npoints++;
//cout<<"[x,y,z]=["<<x<<","<<y<<","<<z<<"]\n";
return (npoints>=maxnpoints);
}
// (x,y,z) as returned by ms's sieve; the point is (x/z,y/z^2)
public:
quartic_sieve(void) {;}
quartic_sieve(quartic * gg, int moduli_option=2, int verb=0);
~quartic_sieve();
long search(double h_lim, long maxnpts=1, int posxonly=0);
long stoll_search(double h_lim, int posxonly=0);
long search_range(int lower, bigfloat lower_bound,
int upper, bigfloat upper_bound, int posxonly=0);
void getpoint(bigint& x, bigint& y, bigint& z) {x=pu;y=pv;z=pw;}
};
|