/usr/include/eclib/sqfdiv.h is in libec-dev 20160720-2.
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 | // sqfdiv.h : declaration of class sqfdiv for managing square-free divisors
//////////////////////////////////////////////////////////////////////////
//
// 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
//
//////////////////////////////////////////////////////////////////////////
class sqfdiv {
vector<bigint>* primebase; // includes all relevant primes
bigint d; // product of current subset
long np; // number in current subset
int positive; // flag for sign
long factor; // counts log_2 of saving index since initialisation
vector<bigint> subgp; // subgp factored out (complete)
vector<bigint> gens; // generators of latter
long nsub, maxnsub, ngens, maxngens; // current, max number in subgp
vector<long> pivs;
public:
sqfdiv(const bigint& dd, int posd, vector<bigint>* plist);
void usediv(const bigint& e);
vector<bigint> getdivs() const;
vector<bigint> getsupp(int bothsigns=0) const;
vector<bigint> getsubgp() {return vector<bigint>(subgp.begin(),subgp.begin()+nsub);}
long getfactor() {return factor;}
void display();
};
bigint sqfred(const bigint& a, const vector<bigint>& plist);
inline bigint sqfred(const bigint& a) { return sqfred(a,pdivs(a));}
bigint sqfmul(const bigint& a, const bigint& b);
bigint makenum(const vector<bigint>& supp, long mask);
long makeindex(const vector<bigint>& supp, const bigint& n, bigint& n0);
// support(n) is like pdivs(n) but includes -1 always
// (except for n=0, but it should never be called with 0)
vector<bigint> support(const bigint& n);
|