37 Print(
"\nexp[0..%d]\n", R->ExpL_Size - 1);
38 for(
int i = 0;
i < R->ExpL_Size;
i++)
60 if( (p !=
NULL) && (nTerms > 0) )
71 for(
int j = nTerms - 1; (q !=
NULL) && (
j > 0);
pIter(q), --
j)
83 void dPrint(
const ideal
id,
const ring lmRing,
const ring tailRing,
const int nTerms)
91 Print(
"Module of rank %ld,real rank %ld and %d generators.\n",
94 int j = (
id->ncols*
id->nrows) - 1;
95 while ((j > 0) && (
id->m[
j]==
NULL)) j--;
96 for (
int i = 0;
i <=
j;
i++)
98 Print(
"generator %d: ",
i);
dPrint(id->m[
i], lmRing, tailRing, nTerms);
BEGIN_NAMESPACE_SINGULARXX const ring lmRing
Detailed print for debugging.
BEGIN_NAMESPACE_SINGULARXX const ring const ring tailRing
static void m_DebugPrint(const poly p, const ring R)
debug-print monomial poly/vector p, assuming that it lives in the ring R
const ring R Print("\nexp[0..%d]\n", R->ExpL_Size-1)
#define BEGIN_NAMESPACE_SINGULARXX
long id_RankFreeModule(ideal s, ring lmRing, ring tailRing)
return the maximal component number found in any polynomial in s
static long p_GetExp(const poly p, const unsigned long iBitmask, const int VarOffset)
get a single variable exponent : the integer VarOffset encodes:
#define END_NAMESPACE_SINGULARXX
BEGIN_NAMESPACE_SINGULARXX const ring const ring const int nTerms
void PrintS(const char *s)
BEGIN_NAMESPACE() static inline void m_DebugPrint(const poly p
debug-print monomial poly/vector p, assuming that it lives in the ring R
void p_Write(poly p, ring lmRing, ring tailRing)
void dPrint(const ideal id, const ring lmRing=currRing, const ring tailRing=currRing, const int nTerms=0)
prints an ideal, optionally with details