17 WerrorS(
"janet only for well-orderings");
56 ideal I=(ideal)v->
Data();
78 result=
idInit(ideal_length,1);
86 pTest(iT->info->root);
92 result->m[ideal_length-ideal_index-1]=
pCopy(iT->info->root);
94 result->m[ideal_length-ideal_index-1]
95 =
pNeg(result->m[ideal_length-ideal_index-1]);
102 result->m[ideal_length-ideal_index-1]=
pCopy(iT->info->root);
104 result->m[ideal_length-ideal_index-1]
105 =
pNeg(result->m[ideal_length-ideal_index-1]);
112 if ((flag==1) && (dpO==0))
118 res->
data = (
char *)result;
129 if (!is_zero) result->m[0]=
pOne();
130 res->
data = (
char *)result;
BOOLEAN rHasLocalOrMixedOrdering(const ring r)
Class used for (list of) interpreter objects.
static BOOLEAN jInitBasis(ideal v, jList **TT, jList **QQ)
Compatiblity layer for legacy polynomial operations (over currRing)
void DestroyList(jList *x)
void WerrorS(const char *s)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
long p_Deg(poly a, const ring r)
#define pIsConstant(p)
like above, except that Comp must be 0
BOOLEAN jjStdJanetBasis(leftv res, leftv v, int flag)
flag: 0: JB, 1: SB
ideal kInterRedOld(ideal F, ideal Q)
void idSkipZeroes(ideal ide)
gives an ideal/module the minimal possible size
ideal idInit(int idsize, int rank)
initialise an ideal / module
const Variable & v
< [in] a sqrfree bivariate poly
void InsertInCount(jList *x, Poly *y)
void Initialization(char *Ord)
void InitHistory(Poly *p)
int ComputeBasis(jList *_lT, jList *_lQ)
#define pCopy(p)
return a copy of the poly