![]() |
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 1276 of file p_polys.h.
#define p_LmEqual | ( | p1, | |
p2, | |||
r ) p_ExpVectorEqual(p1, p2, r) |
Definition at line 1871 of file p_polys.h.
|
inlinestatic |
Definition at line 1814 of file p_polys.h.
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 1765 of file p_polys.h.
|
inlinestatic |
|
inlinestatic |
Definition at line 1856 of file p_polys.h.
Returns: p * q, Destroys: if !copy then p, q Assumes: pLength(p) >= 2 pLength(q) >=2, !rIsPluralRing(r)
Definition at line 313 of file p_Mult_q.cc.
Definition at line 215 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 4049 of file p_polys.cc.
like p_Add_q, except that if lp == pLength(lp) lq == pLength(lq) then lp == pLength(p+q)
Definition at line 606 of file p_polys.h.
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 2851 of file p_polys.cc.
Definition at line 2960 of file p_polys.cc.
Definition at line 1739 of file p_polys.h.
Definition at line 640 of file p_polys.h.
Definition at line 4946 of file p_polys.cc.
returns TRUE if p1 is a skalar multiple of p2 assume p1 != NULL and p2 != NULL
Definition at line 4626 of file p_polys.cc.
Definition at line 2301 of file p_polys.cc.
Definition at line 2361 of file p_polys.cc.
Definition at line 1750 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.
returns a copy of p
like p_Head, but with coefficient 1
Definition at line 5030 of file p_polys.cc.
like p_Head, but with coefficient n
Definition at line 5018 of file p_polys.cc.
Definition at line 587 of file p_polys.cc.
Definition at line 693 of file p_polys.cc.
Definition at line 3565 of file p_polys.cc.
Definition at line 1904 of file p_polys.cc.
Definition at line 1979 of file p_polys.cc.
divide polynomial by monomial
Definition at line 1544 of file p_polys.cc.
Definition at line 1508 of file p_polys.cc.
Definition at line 1584 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 1648 of file p_polys.cc.
Definition at line 4562 of file p_polys.cc.
same as the usual p_EqualPolys for polys belonging to equal rings
Definition at line 4600 of file p_polys.cc.
Definition at line 1411 of file p_polys.h.
Definition at line 1456 of file p_polys.h.
Definition at line 1474 of file p_polys.h.
Definition at line 1440 of file p_polys.h.
Definition at line 1425 of file p_polys.h.
Definition at line 54 of file p_polys.cc.
polynomial gcd for f=mon
Definition at line 4980 of file p_polys.cc.
Definition at line 1728 of file p_polys.cc.
|
inlinestatic |
get a single variable exponent @Note: the integer VarOffset encodes:
Definition at line 1372 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 1178 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 1141 of file p_polys.cc.
p_SetmProc p_GetSetmProc | ( | const ring | r | ) |
Definition at line 560 of file p_polys.cc.
Definition at line 4830 of file p_polys.cc.
Definition at line 4881 of file p_polys.cc.
Definition at line 4896 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 1270 of file p_polys.cc.
Definition at line 1332 of file p_polys.cc.
Definition at line 1348 of file p_polys.cc.
copy the (leading) term of p
Definition at line 860 of file p_polys.h.
Definition at line 3276 of file p_polys.cc.
Definition at line 2641 of file p_polys.cc.
like the respective p_LmIs* routines, except that p might be empty
returns the poly representing the integer i
Definition at line 1300 of file p_polys.cc.
Definition at line 3325 of file p_polys.cc.
Definition at line 3366 of file p_polys.cc.
Definition at line 3349 of file p_polys.cc.
Definition at line 1991 of file p_polys.h.
return i, if poly depends only on var(i)
Definition at line 1250 of file p_polys.cc.
Definition at line 4436 of file p_polys.cc.
Definition at line 4480 of file p_polys.cc.
Definition at line 1661 of file p_polys.cc.
Definition at line 1683 of file p_polys.cc.
Definition at line 1580 of file p_polys.h.
Definition at line 1706 of file p_polys.cc.
|
inlinestatic |
Definition at line 1999 of file p_polys.h.
Definition at line 1335 of file p_polys.h.
|
inlinestatic |
Definition at line 1910 of file p_polys.h.
|
inlinestatic |
Definition at line 1930 of file p_polys.h.
the minimal index of used variables - 1
Definition at line 4730 of file p_polys.cc.
Definition at line 1621 of file p_polys.h.
Definition at line 1495 of file p_polys.cc.
Definition at line 4498 of file p_polys.cc.
Definition at line 1445 of file p_polys.cc.
Definition at line 1114 of file p_polys.h.
Definition at line 3741 of file p_polys.cc.
Definition at line 3835 of file p_polys.cc.
returns the poly representing the number n, destroys n
Definition at line 1476 of file p_polys.cc.
Definition at line 1316 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 4152 of file p_polys.cc.
Definition at line 1205 of file p_polys.h.
|
inlinestatic |
Definition at line 1183 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 1876 of file p_polys.cc.
Definition at line 2203 of file p_polys.cc.
Definition at line 3149 of file p_polys.cc.
Definition at line 1373 of file p_polys.cc.
Definition at line 4548 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 3695 of file p_polys.cc.
shifts components of the vector p by i
Definition at line 4756 of file p_polys.cc.
Definition at line 2570 of file p_polys.cc.
Definition at line 3259 of file p_polys.cc.
Definition at line 1219 of file p_polys.h.
Definition at line 1229 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 1996 of file p_polys.cc.
Definition at line 3980 of file p_polys.cc.
Definition at line 3441 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 3517 of file p_polys.cc.
Definition at line 1507 of file p_polys.h.
Definition at line 4706 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 3617 of file p_polys.cc.
Definition at line 3595 of file p_polys.cc.
Definition at line 3647 of file p_polys.cc.
Definition at line 3408 of file p_polys.cc.
Definition at line 3385 of file p_polys.cc.
Definition at line 717 of file p_polys.cc.
Definition at line 708 of file p_polys.cc.
Definition at line 613 of file p_polys.cc.
Definition at line 3718 of file p_polys.cc.
BOOLEAN pHaveCommonMonoms | ( | poly | p, |
poly | q ) |
BOOLEAN pIsMonomOf | ( | poly | p, |
poly | m ) |
Definition at line 742 of file p_polys.cc.
Definition at line 913 of file p_polys.cc.
Definition at line 978 of file p_polys.cc.
Definition at line 1041 of file p_polys.cc.
Definition at line 880 of file p_polys.cc.
Definition at line 944 of file p_polys.cc.
Definition at line 1008 of file p_polys.cc.
Definition at line 1071 of file p_polys.cc.
Definition at line 814 of file p_polys.cc.
Definition at line 1639 of file p_polys.cc.
Definition at line 1151 of file p_polys.h.
|
inlinestatic |