 |
My Project
debian-1:4.1.1-p2+ds-4
|
Go to the source code of this file.
|
BOOLEAN | hasTermOfDegree (poly h, int d, const ring r) |
|
static BOOLEAN | hasConstTerm (poly h, const ring r) |
|
static BOOLEAN | hasLinearTerm (poly h, const ring r) |
|
BOOLEAN | hasAxis (ideal J, int k, const ring r) |
|
int | hasOne (ideal J, const ring r) |
|
int | isMultiple (poly f, poly m, const ring r) |
|
poly | computeWC (const newtonPolygon &np, Rational max_weight, const ring r) |
|
static poly | normalFormHC (poly f, poly hc, const ring r) |
|
static poly | normalFormZ (poly f, poly Z, const ring r) |
|
static int | isLeadMonomial (poly m, ideal stdJ, const ring r) |
|
static void | setExp (poly m, int *r, const ring s) |
|
static BOOLEAN | isWell (const ring r) |
|
void | computeNF (ideal stdJ, poly hc, poly wc, spectrumPolyList *NF, const ring r) |
|
BOOLEAN | ringIsLocal (const ring r) |
|
◆ SPECTRUM_CC
◆ computeNF()
Definition at line 309 of file spectrum.cc.
427 while( C.inc( carry ) );
435 not_finished =
FALSE;
452 }
while( not_finished );
◆ computeWC()
◆ hasAxis()
◆ hasConstTerm()
◆ hasLinearTerm()
◆ hasOne()
int hasOne |
( |
ideal |
J, |
|
|
const ring |
r |
|
) |
| |
◆ hasTermOfDegree()
◆ isLeadMonomial()
static int isLeadMonomial |
( |
poly |
m, |
|
|
ideal |
stdJ, |
|
|
const ring |
r |
|
) |
| |
|
inlinestatic |
◆ isMultiple()
int isMultiple |
( |
poly |
f, |
|
|
poly |
m, |
|
|
const ring |
r |
|
) |
| |
◆ isWell()
Definition at line 274 of file spectrum.cc.
288 && r->block1[0]==r->N )
290 && r->block1[0]==r->N*r->N )))
292 for(
int i=r->N-1;
i>=0;
i-- )
294 if( r->wvhdl[0][
i]>=0 )
◆ normalFormHC()
static poly normalFormHC |
( |
poly |
f, |
|
|
poly |
hc, |
|
|
const ring |
r |
|
) |
| |
|
inlinestatic |
◆ normalFormZ()
static poly normalFormZ |
( |
poly |
f, |
|
|
poly |
Z, |
|
|
const ring |
r |
|
) |
| |
|
inlinestatic |
◆ ringIsLocal()
◆ setExp()
static void setExp |
( |
poly |
m, |
|
|
int * |
r, |
|
|
const ring |
s |
|
) |
| |
|
static |
static BOOLEAN isWell(const ring r)
int isMultiple(poly f, poly m, const ring r)
static poly p_Head(poly p, const ring r)
static poly p_Mult_mm(poly p, poly m, const ring r)
static void setExp(poly m, int *r, const ring s)
static BOOLEAN length(leftv result, leftv arg)
static poly normalFormZ(poly f, poly Z, const ring r)
static unsigned long p_SetExp(poly p, const unsigned long e, const unsigned long iBitmask, const int VarOffset)
set a single variable exponent @Note: VarOffset encodes the position in p->exp
static unsigned pLength(poly a)
static int isLeadMonomial(poly m, ideal stdJ, const ring r)
static poly p_Copy(poly p, const ring r)
returns a copy of p
static int p_Cmp(poly p1, poly p2, ring r)
poly p_MDivide(poly a, poly b, const ring r)
void delete_monomial(poly, const ring)
static void p_LmDelete(poly p, const ring r)
static poly normalFormHC(poly f, poly hc, const ring r)
static FORCE_INLINE number n_Init(long i, const coeffs r)
a number representing i in the given coeff field/ring r
static BOOLEAN p_DivisibleBy(poly a, poly b, const ring r)
static int p_LmCmp(poly p, poly q, const ring r)
static int rBlocks(ring r)
poly kNF(ideal F, ideal Q, poly p, int syzComp, int lazyReduce)
int p_IsPurePower(const poly p, const ring r)
return i, if head depends only on var(i)
static void p_Delete(poly *p, const ring r)
static poly p_Add_q(poly p, poly q, const ring r)
void insert_node(poly, poly, const ring)
BOOLEAN hasTermOfDegree(poly h, int d, const ring r)
static void p_Setm(poly p, const ring r)
static long p_Totaldegree(poly p, const ring r)
static BOOLEAN p_IsConstant(const poly p, const ring r)
const CanonicalForm int s
void p_Norm(poly p1, const ring r)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static BOOLEAN p_LmDivisibleByNoComp(poly a, poly b, const ring r)
Rational weight_shift(poly, const ring r) const