![]() |
My Project
|
#include "misc/mylimits.h"
#include "misc/intvec.h"
#include "coeffs/coeffs.h"
#include "polys/monomials/monomials.h"
#include "polys/monomials/ring.h"
#include "polys/templates/p_MemAdd.h"
#include "polys/templates/p_MemCmp.h"
#include "polys/templates/p_Procs.h"
#include "polys/sbuckets.h"
#include "polys/nc/nc.h"
Go to the source code of this file.
Macros | |
#define | pIfThen(cond, check) do {if (cond) {check;}} while (0) |
#define | p_Test(p, r) _p_Test(p, r, PDEBUG) |
#define | p_LmTest(p, r) _p_LmTest(p, r, PDEBUG) |
#define | pp_Test(p, lmRing, tailRing) _pp_Test(p, lmRing, tailRing, PDEBUG) |
#define | p_SetmComp p_Setm |
#define | __p_Mult_nn(p, n, r) r->p_Procs->p_Mult_nn(p, n, r) |
#define | __pp_Mult_nn(p, n, r) r->p_Procs->pp_Mult_nn(p, n, r) |
#define | _p_LmCmpAction(p, q, r, actionE, actionG, actionS) |
#define | pDivAssume(x) do {} while (0) |
#define | p_LmCmpAction(p, q, r, actionE, actionG, actionS) _p_LmCmpAction(p, q, r, actionE, actionG, actionS) |
#define | p_LmEqual(p1, p2, r) p_ExpVectorEqual(p1, p2, r) |
#define __pp_Mult_nn | ( | p, | |
n, | |||
r | |||
) | r->p_Procs->pp_Mult_nn(p, n, r) |
Definition at line 1290 of file p_polys.h.
#define p_LmEqual | ( | p1, | |
p2, | |||
r | |||
) | p_ExpVectorEqual(p1, p2, r) |
|
inlinestatic |
return: FALSE, if there exists i, such that a->exp[i] > b->exp[i] TRUE, otherwise (1) Consider long vars, instead of single exponents (2) Clearly, if la > lb, then FALSE (3) Suppose la <= lb, and consider first bits of single exponents in l: if TRUE, then value of these bits is la ^ lb if FALSE, then la-lb causes an "overflow" into one of those bits, i.e., la ^ lb != la - lb
Definition at line 1779 of file p_polys.h.
|
inlinestatic |
Returns: p * q, Destroys: if !copy then p, q Assumes: pLength(p) >= 2 pLength(q) >=2, !rIsPluralRing(r), nCoeff_is_Domain.
Definition at line 309 of file p_Mult_q.cc.
Definition at line 195 of file p_Mult_q.cc.
Definition at line 211 of file pDebug.cc.
poly n_PermNumber | ( | const number | z, |
const int * | par_perm, | ||
const int | OldPar, | ||
const ring | src, | ||
const ring | dst | ||
) |
Definition at line 4048 of file p_polys.cc.
like p_Add_q, except that if lp == pLength(lp) lq == pLength(lq) then lp == pLength(p+q)
poly p_ChineseRemainder | ( | poly * | xx, |
number * | x, | ||
number * | q, | ||
int | rl, | ||
CFArray & | inv_cache, | ||
const ring | R | ||
) |
Definition at line 88 of file p_polys.cc.
Definition at line 2849 of file p_polys.cc.
Definition at line 2958 of file p_polys.cc.
Definition at line 640 of file p_polys.h.
Definition at line 4945 of file p_polys.cc.
returns TRUE if p1 is a skalar multiple of p2 assume p1 != NULL and p2 != NULL
Definition at line 4625 of file p_polys.cc.
Definition at line 2299 of file p_polys.cc.
Definition at line 2359 of file p_polys.cc.
Definition at line 1748 of file p_polys.cc.
returns a copy of p with Lm(p) from lmRing and Tail(p) from tailRing
Definition at line 883 of file p_polys.h.
like p_Head, but with coefficient 1
Definition at line 5029 of file p_polys.cc.
like p_Head, but with coefficient n
Definition at line 5017 of file p_polys.cc.
Definition at line 586 of file p_polys.cc.
Definition at line 691 of file p_polys.cc.
Definition at line 3564 of file p_polys.cc.
Definition at line 1902 of file p_polys.cc.
Definition at line 1977 of file p_polys.cc.
divide polynomial by monomial
Definition at line 1542 of file p_polys.cc.
Definition at line 1506 of file p_polys.cc.
Definition at line 1582 of file p_polys.cc.
divisibility check over ground ring (which may contain zero divisors); TRUE iff LT(f) divides LT(g), i.e., LT(f)*c*m = LT(g), for some coefficient c and some monomial m; does not take components into account
Definition at line 1646 of file p_polys.cc.
Definition at line 4561 of file p_polys.cc.
same as the usual p_EqualPolys for polys belonging to equal rings
Definition at line 4599 of file p_polys.cc.
Definition at line 1425 of file p_polys.h.
Definition at line 1470 of file p_polys.h.
Definition at line 1488 of file p_polys.h.
Definition at line 1454 of file p_polys.h.
Definition at line 1439 of file p_polys.h.
Definition at line 54 of file p_polys.cc.
polynomial gcd for f=mon
Definition at line 4979 of file p_polys.cc.
Definition at line 1726 of file p_polys.cc.
|
inlinestatic |
get a single variable exponent @Note: the integer VarOffset encodes:
Definition at line 1386 of file p_polys.h.
Definition at line 804 of file p_polys.h.
return the maximal exponent of p in form of the maximal long var
Definition at line 1176 of file p_polys.cc.
poly p_GetMaxExpP | ( | poly | p, |
ring | r | ||
) |
return monomial r such that GetExp(r,i) is maximum of all monomials in p; coeff == 0, next == NULL, ord is not set
Definition at line 1139 of file p_polys.cc.
p_SetmProc p_GetSetmProc | ( | const ring | r | ) |
Definition at line 559 of file p_polys.cc.
Definition at line 4829 of file p_polys.cc.
Definition at line 4880 of file p_polys.cc.
Definition at line 4895 of file p_polys.cc.
|
inlinestatic |
set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0 return #(e[i]>0)
Definition at line 1268 of file p_polys.cc.
Definition at line 1330 of file p_polys.cc.
Definition at line 1346 of file p_polys.cc.
copy the (leading) term of p
Definition at line 860 of file p_polys.h.
Definition at line 3274 of file p_polys.cc.
Definition at line 2639 of file p_polys.cc.
returns the poly representing the integer i
Definition at line 1298 of file p_polys.cc.
Definition at line 3323 of file p_polys.cc.
Definition at line 3364 of file p_polys.cc.
Definition at line 3347 of file p_polys.cc.
return i, if poly depends only on var(i)
Definition at line 1248 of file p_polys.cc.
Definition at line 4435 of file p_polys.cc.
Definition at line 4479 of file p_polys.cc.
Definition at line 1659 of file p_polys.cc.
Definition at line 1681 of file p_polys.cc.
Definition at line 1594 of file p_polys.h.
Definition at line 1704 of file p_polys.cc.
|
inlinestatic |
Definition at line 2013 of file p_polys.h.
Definition at line 1349 of file p_polys.h.
|
inlinestatic |
Definition at line 1924 of file p_polys.h.
|
inlinestatic |
Definition at line 1944 of file p_polys.h.
the minimal index of used variables - 1
Definition at line 4729 of file p_polys.cc.
Definition at line 1493 of file p_polys.cc.
Definition at line 4497 of file p_polys.cc.
Definition at line 1443 of file p_polys.cc.
Definition at line 1118 of file p_polys.h.
Definition at line 3740 of file p_polys.cc.
Definition at line 3834 of file p_polys.cc.
returns the poly representing the number n, destroys n
Definition at line 1474 of file p_polys.cc.
Definition at line 1314 of file p_polys.cc.
poly p_PermPoly | ( | poly | p, |
const int * | perm, | ||
const ring | OldRing, | ||
const ring | dst, | ||
nMapFunc | nMap, | ||
const int * | par_perm = NULL , |
||
int | OldPar = 0 , |
||
BOOLEAN | use_mult = FALSE |
||
) |
Definition at line 4151 of file p_polys.cc.
|
inlinestatic |
Definition at line 1197 of file p_polys.h.
assumes that p and divisor are univariate polynomials in r, mentioning the same variable; assumes divisor != NULL; p may be NULL; assumes a global monomial ordering in r; performs polynomial division of p by divisor:
Definition at line 1874 of file p_polys.cc.
Definition at line 2201 of file p_polys.cc.
Definition at line 3147 of file p_polys.cc.
Definition at line 1371 of file p_polys.cc.
Definition at line 4547 of file p_polys.cc.
Definition at line 254 of file p_polys.h.
|
inlinestatic |
set a single variable exponent @Note: VarOffset encodes the position in p->exp
Definition at line 3694 of file p_polys.cc.
shifts components of the vector p by i
Definition at line 4755 of file p_polys.cc.
Definition at line 2568 of file p_polys.cc.
Definition at line 3257 of file p_polys.cc.
Definition at line 1233 of file p_polys.h.
Definition at line 1243 of file p_polys.h.
void p_Split | ( | poly | p, |
poly * | r | ||
) |
Definition at line 322 of file polys0.cc.
print p according to ShortOut in lmRing & tailRing
Definition at line 223 of file polys0.cc.
print p in a long way
print p in a long way
Definition at line 203 of file polys0.cc.
print p in a short way, if possible
print p in a short way, if possible
Definition at line 184 of file polys0.cc.
Definition at line 1994 of file p_polys.cc.
Definition at line 3979 of file p_polys.cc.
Definition at line 3439 of file p_polys.cc.
Splits *p into two polys: *q which consists of all monoms with component == comp and *p of all other monoms *lq == pLength(*q) On return all components pf *q == 0.
Definition at line 3516 of file p_polys.cc.
Definition at line 4705 of file p_polys.cc.
julia: vector to already allocated array (len=p_MaxComp(v,r))
julia: vector to already allocated array (len=p_MaxComp(v,r))
Definition at line 3616 of file p_polys.cc.
Definition at line 3594 of file p_polys.cc.
Definition at line 3646 of file p_polys.cc.
Definition at line 3406 of file p_polys.cc.
Definition at line 3383 of file p_polys.cc.
Definition at line 715 of file p_polys.cc.
Definition at line 706 of file p_polys.cc.
Definition at line 612 of file p_polys.cc.
Definition at line 3717 of file p_polys.cc.
BOOLEAN pHaveCommonMonoms | ( | poly | p, |
poly | q | ||
) |
BOOLEAN pIsMonomOf | ( | poly | p, |
poly | m | ||
) |
Definition at line 740 of file p_polys.cc.
Definition at line 911 of file p_polys.cc.
Definition at line 976 of file p_polys.cc.
Definition at line 1039 of file p_polys.cc.
Definition at line 878 of file p_polys.cc.
Definition at line 942 of file p_polys.cc.
Definition at line 1006 of file p_polys.cc.
Definition at line 1069 of file p_polys.cc.
Definition at line 812 of file p_polys.cc.
Definition at line 1637 of file p_polys.cc.
Definition at line 1160 of file p_polys.h.
|
inlinestatic |