 |
My Project
debian-1:4.1.1-p2+ds-4build3
|
Go to the source code of this file.
|
poly | sm_MultDiv (poly, poly, const poly, const ring) |
|
void | sm_SpecialPolyDiv (poly, poly, const ring) |
|
poly | sm_CallDet (ideal I, const ring) |
|
void | sm_CallBareiss (ideal smat, int x, int y, ideal &M, intvec **iv, const ring) |
|
ideal | sm_CallSolv (ideal I, const ring) |
|
ring | sm_RingChange (const ring, long) |
|
void | sm_KillModifiedRing (ring r) |
|
long | sm_ExpBound (ideal, int, int, int, const ring) |
|
BOOLEAN | sm_CheckDet (ideal, int, BOOLEAN, const ring) |
|
◆ SM_DIV
◆ SM_MULT
◆ sm_CallBareiss()
void sm_CallBareiss |
( |
ideal |
smat, |
|
|
int |
x, |
|
|
int |
y, |
|
|
ideal & |
M, |
|
|
intvec ** |
iv, |
|
|
const |
ring |
|
) |
| |
◆ sm_CallDet()
poly sm_CallDet |
( |
ideal |
I, |
|
|
const |
ring |
|
) |
| |
Definition at line 357 of file sparsmat.cc.
359 if (I->ncols != I->rank)
361 Werror(
"det of %ld x %d module (matrix)",I->rank,I->ncols);
◆ sm_CallSolv()
ideal sm_CallSolv |
( |
ideal |
I, |
|
|
const |
ring |
|
) |
| |
◆ sm_CheckDet()
◆ sm_ExpBound()
long sm_ExpBound |
( |
ideal |
, |
|
|
int |
, |
|
|
int |
, |
|
|
int |
, |
|
|
const |
ring |
|
) |
| |
Definition at line 189 of file sparsmat.cc.
197 al = di*
sizeof(long);
199 bl = ra*
sizeof(long);
201 for (
i=di-1;
i>=0;
i--)
◆ sm_KillModifiedRing()
void sm_KillModifiedRing |
( |
ring |
r | ) |
|
◆ sm_MultDiv()
poly sm_MultDiv |
( |
poly |
, |
|
|
poly |
, |
|
|
const |
poly, |
|
|
const |
ring |
|
) |
| |
◆ sm_RingChange()
ring sm_RingChange |
( |
const |
ring, |
|
|
long |
|
|
) |
| |
Definition at line 259 of file sparsmat.cc.
264 int *block0=(
int*)
omAlloc0(3*
sizeof(
int));
265 int *block1=(
int*)
omAlloc0(3*
sizeof(
int));
274 tmpR->bitmask = 2*
bound;
275 tmpR->wvhdl = (
int **)
omAlloc0((3) *
sizeof(
int*));
281 if (origR->qideal!=
NULL)
286 Print(
"[%ld:%d]", (
long) tmpR->bitmask, tmpR->ExpL_Size);
◆ sm_SpecialPolyDiv()
void sm_SpecialPolyDiv |
( |
poly |
, |
|
|
poly |
, |
|
|
const |
ring |
|
) |
| |
static BOOLEAN sm_IsNegQuot(poly, const poly, const poly, const ring)
static BOOLEAN p_LmIsConstantComp(const poly p, const ring r)
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent @Note: the integer VarOffset encodes:
void p_Normalize(poly p, const ring r)
ideal idrCopyR_NoSort(ideal id, ring src_r, ring dest_r)
void smToIntvec(intvec *)
const CanonicalForm int const CFList const Variable & y
static poly p_Neg(poly p, const ring r)
void rKillModifiedRing(ring r)
BOOLEAN id_IsConstant(ideal id, const ring r)
test if the ideal has only constant polynomials NOTE: zero ideal/module is also constant
static void smMinSelect(long *, int, int)
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static poly pp_Mult_mm(poly p, poly m, const ring r)
ring sm_RingChange(const ring origR, long bound)
static BOOLEAN smCheckSolv(ideal)
ring rCopy0(const ring r, BOOLEAN copy_qideal, BOOLEAN copy_ordering)
poly prMoveR(poly &p, ring src_r, ring dest_r)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static short rVar(const ring r)
#define rVar(r) (r->N)
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
ideal idrMoveR(ideal &id, ring src_r, ring dest_r)
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
#define omFreeSize(addr, size)
static void sm_FindRef(poly *, poly *, poly, const ring)
static BOOLEAN smSmaller(poly, poly)
void smNewBareiss(int, int)
static poly pp_Mult_qq(poly p, poly q, 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 void sm_CombineChain(poly *, poly, const ring)
static poly p_Init(const ring r, omBin bin)
void sm_KillModifiedRing(ring r)
static void sm_PolyDivN(poly, const number, const ring)
static number sm_Cleardenom(ideal, const ring)
static void p_LmFree(poly p, ring)
static poly p_Add_q(poly p, poly q, const ring r)
static poly sm_SelectCopy_ExpMultDiv(poly p, poly m, poly a, poly b, const ring currRing)
static CanonicalForm bound(const CFMatrix &M)
void Werror(const char *fmt,...)
void WerrorS(const char *s)
static void sm_ExactPolyDiv(poly, poly, const ring)
static FORCE_INLINE BOOLEAN n_Equal(number a, number b, const coeffs r)
TRUE iff 'a' and 'b' represent the same number; they may have different representations.
static BOOLEAN p_IsConstantPoly(const poly p, const ring r)
static BOOLEAN p_IsConstant(const poly p, const ring r)
const CanonicalForm int s
long sm_ExpBound(ideal m, int di, int ra, int t, const ring currRing)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static FORCE_INLINE int n_Size(number n, const coeffs r)
return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used fo...
static BOOLEAN p_LmDivisibleByNoComp(poly a, poly b, const ring r)
static poly p_Mult_nn(poly p, number n, const ring r)
ideal idrCopyR(ideal id, ring src_r, ring dest_r)
static BOOLEAN rField_is_Q(const ring r)
BOOLEAN rComplete(ring r, int force)
this needs to be called whenever a new ring is created: new fields in ring are created (like VarOffse...