Definition at line 760 of file fglmzero.cc.
◆ fglmDdata()
fglmDdata::fglmDdata |
( |
int |
dimension | ) |
|
Definition at line 795 of file fglmzero.cc.
801 #ifndef HAVE_EXPLICIT_CONSTR
BOOLEAN dimension(leftv res, leftv args)
#define idDelete(H)
delete an ideal
static intvec * idSort(ideal id, BOOLEAN nolex=TRUE)
#define idMaxIdeal(D)
initialise the maximal ideal (at 0)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
ideal idInit(int idsize, int rank)
initialise an ideal / module
◆ ~fglmDdata()
fglmDdata::~fglmDdata |
( |
| ) |
|
Definition at line 823 of file fglmzero.cc.
829 #ifndef HAVE_EXPLICIT_CONSTR
#define omFreeSize(addr, size)
#define pLmDelete(p)
assume p != NULL, deletes Lm(p)->coef and Lm(p)
◆ buildIdeal()
ideal fglmDdata::buildIdeal |
( |
| ) |
|
|
inline |
Definition at line 788 of file fglmzero.cc.
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
◆ candidatesLeft()
BOOLEAN fglmDdata::candidatesLeft |
( |
| ) |
const |
|
inline |
◆ gaussreduce()
Definition at line 981 of file fglmzero.cc.
986 fglmASSERT( pdenom ==
NULL,
"pdenom in gaussreduce should be NULL" );
988 number vdenom =
v.clearDenom();
990 p.setelem(
p.size(), vdenom );
995 number
gcd =
v.gcd();
1006 if ( !
v.elemIsZero(
perm[
k] ) ) {
1009 v.nihilate( fac1, fac2,
gauss[
k].
v );
1011 temp=
nMult( fac2, pdenom );
1014 p.nihilate( fac1, fac2,
gauss[
k].
p );
1021 number
gcd =
v.gcd();
static FORCE_INLINE number n_SubringGcd(number a, number b, const coeffs r)
const Variable & v
< [in] a sqrfree bivariate poly
#define fglmASSERT(ignore1, ignore2)
◆ getBasisSize()
int fglmDdata::getBasisSize |
( |
| ) |
const |
|
inline |
◆ newBasisElem()
Definition at line 856 of file fglmzero.cc.
868 number
pivot=
v.getconstelem(
k );
885 #ifndef HAVE_EXPLICIT_CONSTR
oldGaussElem(const fglmVector newv, const fglmVector newp, number &newpdenom, number &newfac)
bool pivot(const matrix aMat, const int r1, const int r2, const int c1, const int c2, int *bestR, int *bestC, const ring R)
This code computes a score for each non-zero matrix entry in aMat[r1..r2, c1..c2].
◆ newGroebnerPoly()
void fglmDdata::newGroebnerPoly |
( |
fglmVector & |
v, |
|
|
poly & |
p |
|
) |
| |
Definition at line 938 of file fglmzero.cc.
964 if ( !
nIsZero(
p.getconstelem(
k ) ) ) {
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
void pEnlargeSet(poly **p, int l, int increment)
#define pSetCoeff(p, n)
deletes old coeff before setting the new one
#define pCopy(p)
return a copy of the poly
◆ nextCandidate()
◆ updateCandidates()
Definition at line 893 of file fglmzero.cc.
896 poly newmonom =
NULL;
906 while ( list.
hasItem() && (!done) )
908 if ( (state=
pCmp( list.
getItem().monom, newmonom )) < 0 )
#define pCmp(p1, p2)
pCmp: args may be NULL returns: (p2==NULL ? 1 : (p1 == NULL ? -1 : p_LmCmp(p1, p2)))
◆ basis
◆ basisSize
◆ destId
◆ dimen
◆ gauss
◆ groebnerBS
int fglmDdata::groebnerBS |
|
private |
◆ groebnerSize
int fglmDdata::groebnerSize |
|
private |
◆ isPivot
◆ nlist
◆ perm
◆ varpermutation
int* fglmDdata::varpermutation |
|
private |
The documentation for this class was generated from the following file: