![]() |
#include <omalloc/omalloc.h>
#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_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) |
Functions | |
poly | p_Farey (poly p, number N, const ring r) |
poly | p_ChineseRemainder (poly *xx, number *x, number *q, int rl, CFArray &inv_cache, const ring R) |
unsigned long | p_GetShortExpVector (const poly a, const ring r) |
unsigned long | p_GetShortExpVector (const poly p, const poly pp, const ring r) |
p_GetShortExpVector of p * pp More... | |
BOOLEAN | p_DivisibleByRingCase (poly f, poly g, const ring r) |
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 More... | |
poly | p_One (const ring r) |
int | p_MinDeg (poly p, intvec *w, const ring R) |
long | p_DegW (poly p, const short *w, const ring R) |
BOOLEAN | p_OneComp (poly p, const ring r) |
return TRUE if all monoms have the same component More... | |
int | p_IsPurePower (const poly p, const ring r) |
return i, if head depends only on var(i) More... | |
int | p_IsUnivariate (poly p, const ring r) |
return i, if poly depends only on var(i) More... | |
int | p_GetVariables (poly p, int *e, const ring r) |
set entry e[i] to 1 if var(i) occurs in p, ignore var(j) if e[j]>0 return #(e[i]>0) More... | |
poly | p_ISet (long i, const ring r) |
returns the poly representing the integer i More... | |
poly | p_NSet (number n, const ring r) |
returns the poly representing the number n, destroys n More... | |
void | p_Vec2Polys (poly v, poly **p, int *len, const ring r) |
void | p_ShallowDelete (poly *p, const ring r) |
poly | p_Sub (poly a, poly b, const ring r) |
poly | p_Power (poly p, int i, const ring r) |
BOOLEAN | pIsMonomOf (poly p, poly m) |
BOOLEAN | pHaveCommonMonoms (poly p, poly q) |
BOOLEAN | p_LmCheckIsFromRing (poly p, ring r) |
BOOLEAN | p_LmCheckPolyRing (poly p, ring r) |
BOOLEAN | p_CheckIsFromRing (poly p, ring r) |
BOOLEAN | p_CheckPolyRing (poly p, ring r) |
BOOLEAN | p_CheckRing (ring r) |
BOOLEAN | _p_Test (poly p, ring r, int level) |
BOOLEAN | _p_LmTest (poly p, ring r, int level) |
BOOLEAN | _pp_Test (poly p, ring lmRing, ring tailRing, int level) |
static int | pLength (poly a) |
poly | p_Last (const poly a, int &l, const ring r) |
void | p_Norm (poly p1, const ring r) |
void | p_Normalize (poly p, const ring r) |
void | p_ProjectiveUnique (poly p, const ring r) |
void | p_Content (poly p, const ring r) |
void | p_SimpleContent (poly p, int s, const ring r) |
poly | p_Cleardenom (poly p, const ring r) |
void | p_Cleardenom_n (poly p, const ring r, number &c) |
int | p_Size (poly p, const ring r) |
poly | p_Homogen (poly p, int varnum, const ring r) |
BOOLEAN | p_IsHomogeneous (poly p, const ring r) |
static void | p_Setm (poly p, const ring r) |
p_SetmProc | p_GetSetmProc (ring r) |
poly | p_Subst (poly p, int n, poly e, const ring r) |
static unsigned long | p_SetComp (poly p, unsigned long c, ring r) |
static void | p_SetCompP (poly p, int i, ring r) |
static void | p_SetCompP (poly p, int i, ring lmRing, ring tailRing) |
static long | p_MaxComp (poly p, ring lmRing, ring tailRing) |
static long | p_MaxComp (poly p, ring lmRing) |
static long | p_MinComp (poly p, ring lmRing, ring tailRing) |
static long | p_MinComp (poly p, ring lmRing) |
static poly | pReverse (poly p) |
void | pEnlargeSet (poly **p, int length, int increment) |
void | p_String0 (poly p, ring lmRing, ring tailRing) |
print p according to ShortOut in lmRing & tailRing More... | |
char * | p_String (poly p, ring lmRing, ring tailRing) |
void | p_Write (poly p, ring lmRing, ring tailRing) |
void | p_Write0 (poly p, ring lmRing, ring tailRing) |
void | p_wrp (poly p, ring lmRing, ring tailRing) |
void | p_String0Short (const poly p, ring lmRing, ring tailRing) |
print p in a short way, if possible More... | |
void | p_String0Long (const poly p, ring lmRing, ring tailRing) |
print p in a long way More... | |
static long | p_FDeg (const poly p, const ring r) |
static long | p_LDeg (const poly p, int *l, const ring r) |
long | p_WFirstTotalDegree (poly p, ring r) |
long | p_WTotaldegree (poly p, const ring r) |
long | p_WDegree (poly p, const ring r) |
long | pLDeg0 (poly p, int *l, ring r) |
long | pLDeg0c (poly p, int *l, ring r) |
long | pLDegb (poly p, int *l, ring r) |
long | pLDeg1 (poly p, int *l, ring r) |
long | pLDeg1c (poly p, int *l, ring r) |
long | pLDeg1_Deg (poly p, int *l, ring r) |
long | pLDeg1c_Deg (poly p, int *l, ring r) |
long | pLDeg1_Totaldegree (poly p, int *l, ring r) |
long | pLDeg1c_Totaldegree (poly p, int *l, ring r) |
long | pLDeg1_WFirstTotalDegree (poly p, int *l, ring r) |
long | pLDeg1c_WFirstTotalDegree (poly p, int *l, ring r) |
BOOLEAN | p_EqualPolys (poly p1, poly p2, const ring r) |
BOOLEAN | p_EqualPolys (poly p1, poly p2, const ring r1, const ring r2) |
same as the usual p_EqualPolys for polys belonging to equal rings More... | |
long | p_Deg (poly a, const ring r) |
static number | p_SetCoeff (poly p, number n, ring r) |
static long | p_GetOrder (poly p, ring r) |
static unsigned long | p_AddComp (poly p, unsigned long v, ring r) |
static unsigned long | p_SubComp (poly p, unsigned long v, ring r) |
static long | p_GetExp (const poly p, const unsigned long iBitmask, const int VarOffset) |
get a single variable exponent : the integer VarOffset encodes: More... | |
static unsigned long | p_SetExp (poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset) |
set a single variable exponent : VarOffset encodes the position in p->exp More... | |
static long | p_GetExp (const poly p, const ring r, const int VarOffset) |
static long | p_SetExp (poly p, const long e, const ring r, const int VarOffset) |
static long | p_GetExp (const poly p, const int v, const ring r) |
get v^th exponent for a monomial More... | |
static long | p_SetExp (poly p, const int v, const long e, const ring r) |
set v^th exponent for a monomial More... | |
static long | p_IncrExp (poly p, int v, ring r) |
static long | p_DecrExp (poly p, int v, ring r) |
static long | p_AddExp (poly p, int v, long ee, ring r) |
static long | p_SubExp (poly p, int v, long ee, ring r) |
static long | p_MultExp (poly p, int v, long ee, ring r) |
static long | p_GetExpSum (poly p1, poly p2, int i, ring r) |
static long | p_GetExpDiff (poly p1, poly p2, int i, ring r) |
static int | p_Comp_k_n (poly a, poly b, int k, ring r) |
static poly | p_New (const ring, omBin bin) |
static poly | p_New (ring r) |
static void | p_LmFree (poly p, ring) |
static void | p_LmFree (poly *p, ring) |
static poly | p_LmFreeAndNext (poly p, ring) |
static void | p_LmDelete (poly p, const ring r) |
static void | p_LmDelete (poly *p, const ring r) |
static poly | p_LmDeleteAndNext (poly p, const ring r) |
unsigned long | p_GetMaxExpL (poly p, const ring r, unsigned long l_max=0) |
return the maximal exponent of p in form of the maximal long var More... | |
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 More... | |
static unsigned long | p_GetMaxExp (const unsigned long l, const ring r) |
static unsigned long | p_GetMaxExp (const poly p, const ring r) |
static unsigned long | p_GetTotalDegree (const unsigned long l, const ring r, const int number_of_exps) |
static unsigned long | p_GetTotalDegree (const unsigned long l, const ring r) |
static poly | p_Copy_noCheck (poly p, const ring r) |
returns a copy of p (without any additional testing) More... | |
static poly | p_Copy (poly p, const ring r) |
returns a copy of p More... | |
static poly | p_Head (poly p, const ring r) |
static poly | p_Copy (poly p, const ring lmRing, const ring tailRing) |
static void | p_Delete (poly *p, const ring r) |
static void | p_Delete (poly *p, const ring lmRing, const ring tailRing) |
static poly | p_ShallowCopyDelete (poly p, const ring r, omBin bin) |
static poly | p_Add_q (poly p, poly q, const ring r) |
static poly | p_Add_q (poly p, poly q, int &lp, int lq, const ring r) |
like p_Add_q, except that if lp == pLength(lp) lq == pLength(lq) then lp == pLength(p+q) More... | |
static poly | p_Mult_nn (poly p, number n, const ring r) |
static poly | p_Mult_nn (poly p, number n, const ring lmRing, const ring tailRing) |
static poly | pp_Mult_nn (poly p, number n, const ring r) |
static BOOLEAN | p_LmIsConstantComp (const poly p, const ring r) |
static BOOLEAN | p_LmIsConstant (const poly p, const ring r) |
static poly | pp_Mult_mm (poly p, poly m, const ring r) |
static poly | p_Mult_mm (poly p, poly m, const ring r) |
static poly | p_Minus_mm_Mult_qq (poly p, const poly m, const poly q, int &lp, int lq, const poly spNoether, const ring r) |
static poly | p_Minus_mm_Mult_qq (poly p, const poly m, const poly q, const ring r) |
static poly | pp_Mult_Coeff_mm_DivSelect (poly p, const poly m, const ring r) |
static poly | pp_Mult_Coeff_mm_DivSelect (poly p, int &lp, const poly m, const ring r) |
static poly | p_Neg (poly p, const ring r) |
poly | _p_Mult_q (poly p, poly q, const int copy, const ring r) |
Returns: p * q, Destroys: if !copy then p, q Assumes: pLength(p) >= 2 pLength(q) >=2. More... | |
static poly | p_Mult_q (poly p, poly q, const ring r) |
static poly | pp_Mult_qq (poly p, poly q, const ring r) |
static poly | p_Plus_mm_Mult_qq (poly p, poly m, poly q, int &lp, int lq, const ring r) |
static poly | p_Plus_mm_Mult_qq (poly p, poly m, poly q, const ring r) |
static poly | p_Merge_q (poly p, poly q, const ring r) |
static poly | p_SortAdd (poly p, const ring r, BOOLEAN revert=FALSE) |
static poly | p_SortMerge (poly p, const ring r, BOOLEAN revert=FALSE) |
static char * | p_String (poly p, ring p_ring) |
static void | p_String0 (poly p, ring p_ring) |
static void | p_Write (poly p, ring p_ring) |
static void | p_Write0 (poly p, ring p_ring) |
static void | p_wrp (poly p, ring p_ring) |
static void | p_MemAdd_NegWeightAdjust (poly p, const ring r) |
static void | p_MemSub_NegWeightAdjust (poly p, const ring r) |
static void | p_ExpVectorCopy (poly d_p, poly s_p, const ring r) |
static poly | p_Init (const ring r, omBin bin) |
static poly | p_Init (const ring r) |
static poly | p_LmInit (poly p, const ring r) |
static poly | p_LmInit (poly s_p, const ring s_r, const ring d_r, omBin d_bin) |
static poly | p_LmInit (poly s_p, const ring s_r, const ring d_r) |
static poly | p_GetExp_k_n (poly p, int l, int k, const ring r) |
static poly | p_LmShallowCopyDelete (poly p, const ring r) |
static void | p_ExpVectorAdd (poly p1, poly p2, const ring r) |
static void | p_ExpVectorSum (poly pr, poly p1, poly p2, const ring r) |
static void | p_ExpVectorSub (poly p1, poly p2, const ring r) |
static void | p_ExpVectorAddSub (poly p1, poly p2, poly p3, const ring r) |
static void | p_ExpVectorDiff (poly pr, poly p1, poly p2, const ring r) |
static BOOLEAN | p_ExpVectorEqual (poly p1, poly p2, const ring r) |
static long | p_Totaldegree (poly p, const ring r) |
static void | p_GetExpV (poly p, int *ev, const ring r) |
static void | p_SetExpV (poly p, int *ev, const ring r) |
static int | p_LmCmp (poly p, poly q, const ring r) |
BOOLEAN | p_ComparePolys (poly p1, poly p2, const ring r) |
returns TRUE if p1 is a skalar multiple of p2 assume p1 != NULL and p2 != NULL More... | |
static int | p_Cmp (poly p1, poly p2, ring r) |
static BOOLEAN | _p_LmDivisibleByNoComp (poly a, poly b, const ring r) |
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 More... | |
static BOOLEAN | _p_LmDivisibleByNoComp (poly a, const ring r_a, poly b, const ring r_b) |
static BOOLEAN | _p_LmDivisibleByNoCompPart (poly a, const ring r_a, poly b, const ring r_b, const int start, const int end) |
static BOOLEAN | _p_LmDivisibleByPart (poly a, const ring r_a, poly b, const ring r_b, const int start, const int end) |
static BOOLEAN | p_LmDivisibleByPart (poly a, poly b, const ring r, const int start, const int end) |
static BOOLEAN | _p_LmDivisibleBy (poly a, poly b, const ring r) |
static BOOLEAN | _p_LmDivisibleBy (poly a, const ring r_a, poly b, const ring r_b) |
static BOOLEAN | p_LmDivisibleByNoComp (poly a, poly b, const ring r) |
static BOOLEAN | p_LmDivisibleByNoComp (poly a, const ring ra, poly b, const ring rb) |
static BOOLEAN | p_LmDivisibleBy (poly a, poly b, const ring r) |
static BOOLEAN | p_DivisibleBy (poly a, poly b, const ring r) |
static BOOLEAN | p_DivisibleBy (poly a, const ring r_a, poly b, const ring r_b) |
static BOOLEAN | p_LmDivisibleBy (poly a, const ring r_a, poly b, const ring r_b) |
static BOOLEAN | p_LmShortDivisibleBy (poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r) |
static BOOLEAN | p_LmShortDivisibleByNoComp (poly a, unsigned long sev_a, poly b, unsigned long not_sev_b, const ring r) |
static BOOLEAN | p_LmShortDivisibleBy (poly a, unsigned long sev_a, const ring r_a, poly b, unsigned long not_sev_b, const ring r_b) |
static BOOLEAN | p_IsConstantComp (const poly p, const ring r) |
static BOOLEAN | p_IsConstant (const poly p, const ring r) |
static BOOLEAN | p_IsOne (const poly p, const ring R) |
either poly(1) or gen(k)?! More... | |
static BOOLEAN | p_IsConstantPoly (const poly p, const ring r) |
static BOOLEAN | p_IsUnit (const poly p, const ring r) |
static BOOLEAN | p_LmExpVectorAddIsOk (const poly p1, const poly p2, const ring r) |
void | p_Split (poly p, poly *r) |
BOOLEAN | p_HasNotCF (poly p1, poly p2, const ring r) |
poly | p_mInit (const char *s, BOOLEAN &ok, const ring r) |
const char * | p_Read (const char *s, poly &p, const ring r) |
poly | p_Divide (poly a, poly b, const ring r) |
poly | p_DivideM (poly a, poly b, const ring r) |
poly | p_Div_nn (poly p, const number n, const ring r) |
void | p_Lcm (const poly a, const poly b, poly m, const ring r) |
poly | p_LcmRat (const poly a, const poly b, const long lCompM, const ring r) |
poly | p_GetCoeffRat (poly p, int ishift, ring r) |
void | p_LmDeleteAndNextRat (poly *p, int ishift, ring r) |
void | p_ContentRat (poly &ph, const ring r) |
poly | p_Diff (poly a, int k, const ring r) |
poly | p_DiffOp (poly a, poly b, BOOLEAN multiply, const ring r) |
int | p_Weight (int c, const ring r) |
poly | p_PolyDiv (poly &p, const poly divisor, const BOOLEAN needResult, const ring r) |
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: More... | |
BOOLEAN | p_VectorHasUnitB (poly p, int *k, const ring r) |
void | p_VectorHasUnit (poly p, int *k, int *len, const ring r) |
poly | p_TakeOutComp1 (poly *p, int k, const ring r) |
void | p_TakeOutComp (poly *p, long comp, poly *q, int *lq, const ring r) |
poly | p_TakeOutComp (poly *p, int k, const ring r) |
void | p_DeleteComp (poly *p, int k, const ring r) |
void | pSetDegProcs (ring r, pFDegProc new_FDeg, pLDegProc new_lDeg=NULL) |
void | pRestoreDegProcs (ring r, pFDegProc old_FDeg, pLDegProc old_lDeg) |
void | p_SetModDeg (intvec *w, ring r) |
poly | pp_Jet (poly p, int m, const ring R) |
poly | p_Jet (poly p, int m, const ring R) |
poly | pp_JetW (poly p, int m, short *w, const ring R) |
poly | p_JetW (poly p, int m, short *w, const ring R) |
poly | n_PermNumber (const number z, const int *par_perm, const int OldPar, const ring src, const ring dst) |
poly | p_PermPoly (poly p, const int *perm, const ring OldRing, const ring dst, nMapFunc nMap, const int *par_perm=NULL, int OldPar=0) |
poly | p_Series (int n, poly p, poly u, intvec *w, const ring R) |
poly | p_Invers (int n, poly u, intvec *w, const ring R) |
int | p_Var (poly mi, const ring r) |
int | p_LowVar (poly p, const ring r) |
the minimal index of used variables - 1 More... | |
void | p_Shift (poly *p, int i, const ring r) |
shifts components of the vector p by i More... | |
#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) |
Definition at line 1650 of file p_polys.h.
Definition at line 1656 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 1546 of file p_polys.h.
|
inlinestatic |
Definition at line 1595 of file p_polys.h.
|
inlinestatic |
Definition at line 1616 of file p_polys.h.
|
inlinestatic |
Definition at line 1635 of file p_polys.h.
Returns: p * q, Destroys: if !copy then p, q Assumes: pLength(p) >= 2 pLength(q) >=2.
Definition at line 273 of file p_Mult_q.cc.
Definition at line 211 of file pDebug.cc.
Definition at line 332 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 3822 of file p_polys.cc.
|
inlinestatic |
|
inlinestatic |
Definition at line 602 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 94 of file p_polys.cc.
Definition at line 2682 of file p_polys.cc.
Definition at line 2826 of file p_polys.cc.
Definition at line 636 of file p_polys.h.
returns TRUE if p1 is a skalar multiple of p2 assume p1 != NULL and p2 != NULL
Definition at line 4353 of file p_polys.cc.
Definition at line 2182 of file p_polys.cc.
Definition at line 1655 of file p_polys.cc.
returns a copy of p
Definition at line 811 of file p_polys.h.
Definition at line 833 of file p_polys.h.
|
inlinestatic |
Definition at line 594 of file p_polys.h.
Definition at line 586 of file p_polys.cc.
Definition at line 689 of file p_polys.cc.
Definition at line 3426 of file p_polys.cc.
Definition at line 1809 of file p_polys.cc.
Definition at line 1884 of file p_polys.cc.
Definition at line 1480 of file p_polys.cc.
Definition at line 1467 of file p_polys.cc.
Definition at line 1501 of file p_polys.cc.
Definition at line 1685 of file p_polys.h.
Definition at line 1694 of file p_polys.h.
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 1559 of file p_polys.cc.
Definition at line 4289 of file p_polys.cc.
same as the usual p_EqualPolys for polys belonging to equal rings
Definition at line 4327 of file p_polys.cc.
Definition at line 1339 of file p_polys.h.
Definition at line 1384 of file p_polys.h.
Definition at line 1402 of file p_polys.h.
Definition at line 1368 of file p_polys.h.
Definition at line 1353 of file p_polys.h.
Definition at line 61 of file p_polys.cc.
Definition at line 1633 of file p_polys.cc.
|
inlinestatic |
get a single variable exponent : the integer VarOffset encodes:
Definition at line 465 of file p_polys.h.
Definition at line 551 of file p_polys.h.
get v^th exponent for a monomial
Definition at line 568 of file p_polys.h.
Definition at line 1300 of file p_polys.h.
Definition at line 631 of file p_polys.h.
Definition at line 625 of file p_polys.h.
Definition at line 1448 of file p_polys.h.
Definition at line 766 of file p_polys.h.
return the maximal exponent of p in form of the maximal long var
Definition at line 1174 of file p_polys.cc.
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 1137 of file p_polys.cc.
|
inlinestatic |
p_SetmProc p_GetSetmProc | ( | ring | r | ) |
Definition at line 559 of file p_polys.cc.
Definition at line 4557 of file p_polys.cc.
p_GetShortExpVector of p * pp
Definition at line 4609 of file p_polys.cc.
|
inlinestatic |
Definition at line 793 of file p_polys.h.
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 1272 of file p_polys.cc.
Definition at line 1334 of file p_polys.cc.
Definition at line 819 of file p_polys.h.
Definition at line 3138 of file p_polys.cc.
|
inlinestatic |
Definition at line 587 of file p_polys.h.
Definition at line 1248 of file p_polys.h.
Definition at line 4261 of file p_polys.cc.
Definition at line 1778 of file p_polys.h.
Definition at line 1798 of file p_polys.h.
returns the poly representing the integer i
Definition at line 1302 of file p_polys.cc.
Definition at line 3187 of file p_polys.cc.
either poly(1) or gen(k)?!
Definition at line 1792 of file p_polys.h.
return i, if head depends only on var(i)
Definition at line 1224 of file p_polys.cc.
Definition at line 1811 of file p_polys.h.
return i, if poly depends only on var(i)
Definition at line 1252 of file p_polys.cc.
Definition at line 4163 of file p_polys.cc.
Definition at line 4207 of file p_polys.cc.
Definition at line 4398 of file p_polys.cc.
Definition at line 1572 of file p_polys.cc.
Definition at line 1588 of file p_polys.cc.
Definition at line 71 of file pDebug.cc.
Definition at line 707 of file p_polys.h.
Definition at line 713 of file p_polys.h.
Definition at line 721 of file p_polys.h.
void p_LmDeleteAndNextRat | ( | poly * | p, |
int | ishift, | ||
ring | r | ||
) |
Definition at line 1611 of file p_polys.cc.
Definition at line 1676 of file p_polys.h.
Definition at line 1703 of file p_polys.h.
Definition at line 1662 of file p_polys.h.
Definition at line 1669 of file p_polys.h.
|
inlinestatic |
Definition at line 1641 of file p_polys.h.
Definition at line 1274 of file p_polys.h.
Definition at line 954 of file p_polys.h.
Definition at line 1321 of file p_polys.h.
|
inlinestatic |
Definition at line 1710 of file p_polys.h.
|
inlinestatic |
Definition at line 1750 of file p_polys.h.
|
inlinestatic |
Definition at line 1730 of file p_polys.h.
the minimal index of used variables - 1
Definition at line 4457 of file p_polys.cc.
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
|
inlinestatic |
Definition at line 4225 of file p_polys.cc.
Definition at line 1425 of file p_polys.cc.
|
inlinestatic |
Definition at line 973 of file p_polys.h.
Definition at line 902 of file p_polys.h.
Definition at line 1025 of file p_polys.h.
|
inlinestatic |
Definition at line 617 of file p_polys.h.
Definition at line 3565 of file p_polys.cc.
Definition at line 3621 of file p_polys.cc.
returns the poly representing the number n, destroys n
Definition at line 1448 of file p_polys.cc.
Definition at line 1318 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 |
||
) |
Definition at line 3926 of file p_polys.cc.
|
inlinestatic |
Definition at line 1111 of file p_polys.h.
Definition at line 1133 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 1781 of file p_polys.cc.
Definition at line 2100 of file p_polys.cc.
Definition at line 3008 of file p_polys.cc.
Definition at line 1353 of file p_polys.cc.
Definition at line 4247 of file p_polys.cc.
|
inlinestatic |
Definition at line 401 of file p_polys.h.
|
inlinestatic |
|
inlinestatic |
Definition at line 243 of file p_polys.h.
|
inlinestatic |
|
inlinestatic |
Definition at line 558 of file p_polys.h.
set v^th exponent for a monomial
Definition at line 578 of file p_polys.h.
Definition at line 1456 of file p_polys.h.
void p_SetModDeg | ( | intvec * | w, |
ring | r | ||
) |
Definition at line 3517 of file p_polys.cc.
Definition at line 2391 of file p_polys.cc.
Definition at line 3121 of file p_polys.cc.
Definition at line 1147 of file p_polys.h.
Definition at line 1157 of file p_polys.h.
Definition at line 1325 of file p_polys.cc.
char* p_String | ( | poly | p, |
ring | lmRing, | ||
ring | tailRing | ||
) |
Definition at line 186 of file polys0.cc.
|
inlinestatic |
void p_String0 | ( | poly | p, |
ring | lmRing, | ||
ring | tailRing | ||
) |
print p according to ShortOut in lmRing & tailRing
Definition at line 136 of file polys0.cc.
|
inlinestatic |
Definition at line 1172 of file p_polys.h.
print p in a long way
print p in a long way
Definition at line 116 of file polys0.cc.
print p in a short way, if possible
print p in a short way, if possible
Definition at line 97 of file polys0.cc.
Definition at line 1901 of file p_polys.cc.
|
inlinestatic |
|
inlinestatic |
Definition at line 609 of file p_polys.h.
Definition at line 3763 of file p_polys.cc.
Definition at line 3378 of file p_polys.cc.
Definition at line 3317 of file p_polys.cc.
Definition at line 3266 of file p_polys.cc.
Definition at line 1435 of file p_polys.h.
Definition at line 4433 of file p_polys.cc.
Definition at line 3459 of file p_polys.cc.
Definition at line 3234 of file p_polys.cc.
Definition at line 3209 of file p_polys.cc.
Definition at line 713 of file p_polys.cc.
int p_Weight | ( | int | c, |
const ring | r | ||
) |
Definition at line 704 of file p_polys.cc.
long p_WFirstTotalDegree | ( | poly | p, |
ring | r | ||
) |
Definition at line 595 of file p_polys.cc.
|
inlinestatic |
Definition at line 612 of file p_polys.cc.
void pEnlargeSet | ( | poly ** | p, |
int | length, | ||
int | increment | ||
) |
Definition at line 3540 of file p_polys.cc.
long pLDeg0 | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 738 of file p_polys.cc.
long pLDeg0c | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 769 of file p_polys.cc.
long pLDeg1 | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 840 of file p_polys.cc.
long pLDeg1_Deg | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 909 of file p_polys.cc.
long pLDeg1_Totaldegree | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 974 of file p_polys.cc.
long pLDeg1_WFirstTotalDegree | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 1037 of file p_polys.cc.
long pLDeg1c | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 876 of file p_polys.cc.
long pLDeg1c_Deg | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 940 of file p_polys.cc.
long pLDeg1c_Totaldegree | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 1004 of file p_polys.cc.
long pLDeg1c_WFirstTotalDegree | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 1067 of file p_polys.cc.
long pLDegb | ( | poly | p, |
int * | l, | ||
ring | r | ||
) |
Definition at line 810 of file p_polys.cc.
Definition at line 4135 of file p_polys.cc.
Definition at line 4180 of file p_polys.cc.
|
inlinestatic |
Definition at line 962 of file p_polys.h.
Definition at line 927 of file p_polys.h.
Definition at line 1075 of file p_polys.h.
Definition at line 3493 of file p_polys.cc.
Definition at line 3481 of file p_polys.cc.