 |
My Project
debian-1:4.1.1-p2+ds-4build1
|
Go to the documentation of this file.
26 #include "factory/factoryconf.h"
38 # define OSTREAM std::ostream
39 # define ISTREAM std::istream
40 # elif defined(HAVE_IOSTREAM_H)
41 # include <iostream.h>
42 # define OSTREAM ostream
43 # define ISTREAM istream
80 #define LEVELBASE -1000000
81 #define LEVELTRANS -500000
82 #define LEVELQUOT 1000000
83 #define LEVELEXPR 1000001
85 #define UndefinedDomain 32000
86 #define GaloisFieldDomain 4
87 #define FiniteFieldDomain 3
88 #define RationalDomain 2
89 #define IntegerDomain 1
209 return ( ((
int)((intptr_t)ptr)) & 3 );
247 void mpzval(mpz_t val)
const;
493 return power(
f.mvar(),
f.degree() ) *
f.LC();
1116 int igcd (
int a,
int b);
1202 if (
this != &value )
1230 bool removeContents=
true);
1245 bool removeContents=
true);
ListCFList irrCharSeries(const CFList &PS)
irreducible characteristic series
bool hasMipo(const Variable &alpha)
static const int SW_USE_NTL_SORT
set to 1 to sort factors in a factorization
CF_NO_INLINE CanonicalForm div(const CanonicalForm &, const CanonicalForm &)
CF_INLINE CanonicalForm div, mod ( const CanonicalForm & lhs, const CanonicalForm & rhs )
friend bool operator<(const Variable &lhs, const Variable &rhs)
CanonicalForm blcm(const CanonicalForm &f, const CanonicalForm &g)
CFFList factorize(const CanonicalForm &f, bool issqrfree=false)
factorization over or
void error(const char *fmt,...)
CanonicalForm den(const CanonicalForm &f)
CanonicalForm lcm(const CanonicalForm &, const CanonicalForm &)
CanonicalForm lcm ( const CanonicalForm & f, const CanonicalForm & g )
CanonicalForm extgcd(const CanonicalForm &f, const CanonicalForm &g, CanonicalForm &a, CanonicalForm &b)
CanonicalForm extgcd ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm & a,...
static const int SW_USE_EZGCD_P
set to 1 to use EZGCD over F_q
CFList FS2
candidate factors that might get removed
generate random elements in F_p
CFMap(const CanonicalForm &s)
static const int SW_SYMMETRIC_FF
set to 1 for symmetric representation over F_q
const char factoryConfiguration[]
int cf_getBigPrime(int i)
CFList get_Terms(const CanonicalForm &f)
generate integers starting from 0
ListIterator< CFAFactor > CFAFListIterator
static const int SW_USE_FF_MOD_GCD
set to 1 to use modular GCD over F_q
void factoryError_intern(const char *s)
CanonicalForm sqrt(const CanonicalForm &a)
class to iterate through CanonicalForm's
REvaluation & operator=(const REvaluation &e)
CanonicalForm abs(const CanonicalForm &f)
inline CanonicalForm abs ( const CanonicalForm & f )
Varlist neworder(const CFList &PolyList)
ListIterator< MapPair > MPListIterator
void setMipo(const Variable &alpha, const CanonicalForm &mipo)
void getTerms(const CanonicalForm &f, const CanonicalForm &t, CFList &result)
get_Terms: Split the polynomial in the containing terms.
friend bool operator!=(const Variable &lhs, const Variable &rhs)
class to store factors that get removed during char set computation
CFList charSetN(const CFList &PS)
medial set
int taildegree(const CanonicalForm &f)
modpk & operator=(const modpk &m)
CanonicalForm maxNorm(const CanonicalForm &f)
CanonicalForm maxNorm ( const CanonicalForm & f )
friend OSTREAM & operator<<(OSTREAM &s, const MapPair &p)
OSTREAM & operator << ( OSTREAM & s, const MapPair & p )
List< CFAFactor > CFAFList
CanonicalForm vcontent(const CanonicalForm &f, const Variable &x)
CanonicalForm vcontent ( const CanonicalForm & f, const Variable & x )
void print(OSTREAM &) const
IntList neworderint(const CFList &PolyList)
Array< CanonicalForm > CFArray
friend OSTREAM & operator<<(OSTREAM &s, const CFMap &m)
OSTREAM & operator << ( OSTREAM & s, const CFMap & m )
bool linearSystemSolve(CFMatrix &M)
int gf_value(const CanonicalForm &f)
Variable get_max_degree_Variable(const CanonicalForm &f)
get_max_degree_Variable returns Variable with highest degree.
CanonicalForm operator()(const CanonicalForm &f, bool symmetric=true) const
generate random elements in F_p(alpha)
CanonicalForm generate() const
CanonicalForm tailcoeff(const CanonicalForm &f)
CFFList facAlgFunc(const CanonicalForm &f, const CFList &as)
factorize a polynomial f modulo an extension given by an irreducible characteristic set as,...
class to evaluate a polynomial at points
int is_imm(const InternalCF *const ptr)
friend Variable rootOf(const CanonicalForm &, char name)
returns a symbolic root of polynomial with name name.
CanonicalForm pp(const CanonicalForm &)
CanonicalForm pp ( const CanonicalForm & f )
static const int SW_RATIONAL
set to 1 for computations over Q
Variable rootOf(const CanonicalForm &, char name='@')
returns a symbolic root of polynomial with name name Use it to define algebraic variables
CanonicalForm make_cf(const mpz_ptr n)
CFFList sqrFree(const CanonicalForm &f, bool sort=false)
squarefree factorization
CanonicalForm determinant(const CFMatrix &M, int n)
const CanonicalForm CFMap CFMap & N
virtual class for internal CanonicalForm's
bool isPurePoly(const CanonicalForm &f)
friend bool operator<=(const Variable &lhs, const Variable &rhs)
CFList charSetViaCharSetN(const CFList &PS)
compute a characteristic set via medial set
virtual class for generators
static Variable highest()
ListIterator< int > IntListIterator
int getNumVars(const CanonicalForm &f)
int getNumVars ( const CanonicalForm & f )
static const int SW_USE_CHINREM_GCD
set to 1 to use modular gcd over Z
CanonicalForm power(const CanonicalForm &f, int n)
exponentiation
CF_NO_INLINE int hasTerms() const
check if iterator has reached the end of CanonicalForm
CanonicalForm apply(const CanonicalForm &f, void(*mf)(CanonicalForm &, int &))
CanonicalForm apply ( const CanonicalForm & f, void (*mf)( CanonicalForm &, int & ) )
CFMatrix * cf_LLL(CFMatrix &A)
performs LLL reduction.
CFList newordercf(const CFList &PolyList)
AFactor< CanonicalForm > CFAFactor
int ilog2(const CanonicalForm &a)
ListIterator< CFFactor > CFFListIterator
ListIterator< CanonicalForm > CFListIterator
CanonicalForm LC(const CanonicalForm &f)
MapPair & operator=(const MapPair &p)
MapPair & MapPair::operator = ( const MapPair & p )
bool hasFirstAlgVar(const CanonicalForm &f, Variable &a)
check if poly f contains an algebraic variable a
bool tryFdivides(const CanonicalForm &f, const CanonicalForm &g, const CanonicalForm &M, bool &fail)
same as fdivides but handles zero divisors in Z_p[t]/(f)[x1,...,xn] for reducible f
CF_NO_INLINE CanonicalForm operator%(const CanonicalForm &, const CanonicalForm &)
CFMatrix * cf_HNF(CFMatrix &A)
The input matrix A is square matrix of integers output: the Hermite Normal Form of A; that is,...
CanonicalForm getMipo(const Variable &alpha, const Variable &x)
CanonicalForm generate() const
virtual class for random element generation
CanonicalForm gcd(const CanonicalForm &, const CanonicalForm &)
CanonicalForm item() const
CanonicalForm mapdomain(const CanonicalForm &f, CanonicalForm(*mf)(const CanonicalForm &))
CanonicalForm mapdomain ( const CanonicalForm & f, CanonicalForm (*mf)( const CanonicalForm & ) )
void chineseRemainder(const CanonicalForm &x1, const CanonicalForm &q1, const CanonicalForm &x2, const CanonicalForm &q2, CanonicalForm &xnew, CanonicalForm &qnew)
void chineseRemainder ( const CanonicalForm & x1, const CanonicalForm & q1, const CanonicalForm & x2,...
int sign(const CanonicalForm &a)
CanonicalForm operator[](const Variable &v) const
CF_NO_INLINE int exp() const
get the current exponent
CanonicalForm homogenize(const CanonicalForm &f, const Variable &x)
homogenize homogenizes f with Variable x
CFList reorder(const Varlist &betterorder, const CFList &PS)
CanonicalForm replaceLc(const CanonicalForm &f, const CanonicalForm &c)
CanonicalForm replacevar(const CanonicalForm &, const Variable &, const Variable &)
CanonicalForm replacevar ( const CanonicalForm & f, const Variable & x1, const Variable & x2 )
AlgExtRandomF & operator=(const AlgExtRandomF &)
void factoryseed(int s)
random seed initializer
CanonicalForm gcd_poly(const CanonicalForm &f, const CanonicalForm &g)
CanonicalForm gcd_poly ( const CanonicalForm & f, const CanonicalForm & g )
ListIterator< Variable > VarlistIterator
Variable & operator=(const Variable &v)
CFList FS1
factors that were removed
Matrix< CanonicalForm > CFMatrix
CanonicalForm make_cf_from_gf(const int z)
generate all elements in F_p starting from 0
CanonicalForm reduce(const CanonicalForm &f, const CanonicalForm &M)
polynomials in M.mvar() are considered coefficients M univariate monic polynomial the coefficients of...
CFList charSetViaModCharSet(const CFList &PS, StoreFactors &StoredFactors, bool removeContents=true)
modified characteristic set, i.e. a characteristic set with certain factors removed
CanonicalForm num(const CanonicalForm &f)
CanonicalForm item() const
void prune(Variable &alpha)
CFAFList absFactorize(const CanonicalForm &G)
absolute factorization of a multivariate poly over Q
CanonicalForm getpk() const
void psqr(const CanonicalForm &f, const CanonicalForm &g, CanonicalForm &q, CanonicalForm &r, const Variable &x)
void psqr ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm & q, CanonicalForm & r,...
CanonicalForm icontent(const CanonicalForm &f)
CanonicalForm icontent ( const CanonicalForm & f )
friend OSTREAM & operator<<(OSTREAM &os, const Variable &v)
int * degrees(const CanonicalForm &f, int *degs=0)
int * degrees ( const CanonicalForm & f, int * degs )
Variable(const Variable &v)
MapPair(const MapPair &p)
CanonicalForm euclideanNorm(const CanonicalForm &f)
CanonicalForm euclideanNorm ( const CanonicalForm & f )
class to generate random evaluation points
CFList basicSet(const CFList &PS)
basic set in the sense of Wang a.k.a. minimal ascending set in the sense of Greuel/Pfister
CanonicalForm item() const
void setCharacteristic(int c)
int cf_getSmallPrime(int i)
friend bool operator>(const Variable &lhs, const Variable &rhs)
generate random elements in GF
CanonicalForm resultant(const CanonicalForm &f, const CanonicalForm &g, const Variable &x)
CanonicalForm resultant ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x )
friend OSTREAM & operator<<(OSTREAM &s, const Evaluation &e)
void sort(CFArray &A, int l=0)
quick sort A
virtual CFGenerator * clone() const
CanonicalForm head(const CanonicalForm &f)
virtual CFRandom * clone() const
class to do operations mod p^k for int's p and k
int ipower(int b, int n)
int ipower ( int b, int m )
CanonicalForm getVars(const CanonicalForm &f)
CanonicalForm getVars ( const CanonicalForm & f )
virtual CanonicalForm generate() const
CanonicalForm resultantZ(const CanonicalForm &A, const CanonicalForm &B, const Variable &x, bool prob=true)
modular resultant algorihtm over Z
CanonicalForm getGFGenerator()
void setReduce(const Variable &alpha, bool reduce)
virtual bool hasItems() const
CanonicalForm operator()(const CanonicalForm &f) const
Evaluation(int min0, int max0)
int probIrredTest(const CanonicalForm &F, double error)
given some error probIrredTest detects irreducibility or reducibility of F with confidence level 1-er...
AlgExtGenerator & operator=(const AlgExtGenerator &)
static poly normalize(poly next_p, ideal add_generators, syStrategy syzstr, int *g_l, int *p_l, int crit_comp)
List< CanonicalForm > CFList
void chineseRemainderCached(CFArray &a, CFArray &n, CanonicalForm &xnew, CanonicalForm &prod, CFArray &inv)
factory's class for variables
CF_NO_INLINE CanonicalForm coeff() const
get the current coefficient
static const int SW_USE_EZGCD
set to 1 to use EZGCD over Z
CanonicalForm Farey(const CanonicalForm &f, const CanonicalForm &q)
Farey rational reconstruction.
int totaldegree(const CanonicalForm &f)
int totaldegree ( const CanonicalForm & f )
bool fdivides(const CanonicalForm &f, const CanonicalForm &g)
bool fdivides ( const CanonicalForm & f, const CanonicalForm & g )
CanonicalForm item() const
CFMap & operator=(const CFMap &m)
CFMap & CFMap::operator = ( const CFMap & m )
CanonicalForm psq(const CanonicalForm &f, const CanonicalForm &g, const Variable &x)
CanonicalForm psq ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x )
char name(const Variable &v)
Evaluation(const Evaluation &e)
StoreFactors & operator=(const StoreFactors &value)
static const int SW_USE_QGCD
set to 1 to use Encarnacion GCD over Q(a)
CanonicalForm generate() const
CanonicalForm Lc(const CanonicalForm &f)
CanonicalForm inverse(const CanonicalForm &f, bool symmetric=true) const
CanonicalForm subst() const
CanonicalForm leftShift(const CanonicalForm &F, int n)
left shift the main variable of F by n
void(* factoryError)(const char *s)
CanonicalForm bCommonDen(const CanonicalForm &f)
CanonicalForm bCommonDen ( const CanonicalForm & f )
void setValue(int i, const CanonicalForm &f)
static CFRandom * generate()
int level(const Variable &v)
friend void swap_levels()
CFGenerator * clone() const
CanonicalForm Prem(const CanonicalForm &F, const CanonicalForm &G)
pseudo remainder of F by G with certain factors of LC (g) cancelled
ListCFList charSeries(const CFList &L)
characteristic series
int factoryrandom(int n)
random integers with abs less than n
void gmp_denominator(const CanonicalForm &f, mpz_ptr result)
void gmp_numerator(const CanonicalForm &f, mpz_ptr result)
CanonicalForm psr(const CanonicalForm &f, const CanonicalForm &g, const Variable &x)
CanonicalForm psr ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x )
CanonicalForm content(const CanonicalForm &)
CanonicalForm content ( const CanonicalForm & f )
CanonicalForm mapinto(const CanonicalForm &f)
const Variable & v
< [in] a sqrfree bivariate poly
CanonicalForm generate() const
CFArray subResChain(const CanonicalForm &f, const CanonicalForm &g, const Variable &x)
CFArray subResChain ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x )
CFMap(const Variable &v, const CanonicalForm &s)
const CanonicalForm int s
int cf_getNumSmallPrimes()
void newpair(const Variable &v, const CanonicalForm &s)
void CFMap::newpair ( const Variable & v, const CanonicalForm & s )
CF_NO_INLINE CanonicalForm operator/(const CanonicalForm &, const CanonicalForm &)
ListIterator< CFList > ListCFListIterator
CFList charSet(const CFList &PS)
characteristic set
CanonicalForm operator[](int i) const
Evaluation & operator=(const Evaluation &e)
CFGenerator * clone() const
int headdegree(const CanonicalForm &f)
Factor< CanonicalForm > CFFactor
Variable mvar(const CanonicalForm &f)
bool isPurePoly_m(const CanonicalForm &f)
CF_NO_INLINE CanonicalForm mod(const CanonicalForm &, const CanonicalForm &)
CF_NO_INLINE CFIterator & operator++()
CFIterator::operator ++ (), operator ++ ( int )
CF_NO_INLINE CanonicalForm operator-(const CanonicalForm &, const CanonicalForm &)
List< CFList > ListCFList
virtual CanonicalForm item() const
generate all elements in GF starting from 0
CFIterator & operator=(const CFIterator &)
CFFList facAlgFunc2(const CanonicalForm &f, const CFList &as)
factorize a polynomial f that is irreducible over the ground field modulo an extension given by an ir...
CanonicalForm lc(const CanonicalForm &f)
CFList modCharSet(const CFList &PS, StoreFactors &StoredFactors, bool removeContents=true)
modified medial set
CanonicalForm deriv(const CanonicalForm &f, const Variable &x)
static CFGenerator * generate()
CF_INLINE CanonicalForm operator*(const CanonicalForm &, const CanonicalForm &)
REvaluation(int min0, int max0, const CFRandom &sample)
CanonicalForm operator()(const CanonicalForm &f) const
CanonicalForm CFMap::operator () ( const CanonicalForm & f ) const.
void prune1(const Variable &alpha)
friend bool operator>=(const Variable &lhs, const Variable &rhs)
int size(const CanonicalForm &f, const Variable &v)
int size ( const CanonicalForm & f, const Variable & v )
MapPair(const Variable &v, const CanonicalForm &s)
CFGenerator * clone() const
CanonicalForm swapvar(const CanonicalForm &, const Variable &, const Variable &)
swapvar() - swap variables x1 and x2 in f.
CanonicalForm compress(const CanonicalForm &f, CFMap &m)
CanonicalForm compress ( const CanonicalForm & f, CFMap & m )
CF_INLINE CanonicalForm operator+(const CanonicalForm &, const CanonicalForm &)
CF_INLINE CanonicalForm operator +, -, *, /, % ( const CanonicalForm & lhs, const CanonicalForm & rhs...
friend bool operator==(const Variable &lhs, const Variable &rhs)
CFGenerator * clone() const
int degree(const CanonicalForm &f)
generate all elements in F_p(alpha) starting from 0