46 for(
i=0;
i<
v->rows();
i++)
48 for(
j=0;
j<
v->cols();
j++)
73 vl=
si_max(vl,(
int)strlen(ss));
101 sprintf(ss,
"%s[%d,%d]",
name,
i+1,
j+1);
105 vl=
si_max(vl,(
int)strlen(ss));
135 sprintf(ss,
"%s[%d,%d]",
name,
i+1,
j+1);
198 ring
r=(ring)u->
Data();
199 PrintS(
"polynomial ring, over a ");
203 else PrintS(
"ring (with zero-divisors)");
206 if (
r->OrdSgn==1)
PrintS(
", global");
207 else if (
r->MixedOrder==1)
PrintS(
", mixed");
220 else PrintS(
"ring (with zero-divisors): ");
310 if (
s[
l-1]==
'\n')
s[
l-1]=
'\0';
325 print= (((int)((
long)(u->
Data()))) > 0);
351 int row_shift=(int)((
long)(
atGet(u,
"rowShift",
INT_CMD)));
362 Print(
"%5d:",
i+row_shift);
396 if ((u->
Typ()==
INTMAT_CMD)&&(strcmp((
char *)
v->Data(),
"betti")==0))
409 if (strlen(ns) == 3 && ns[1] ==
'2')
415 if (strcmp(ns,
"%l") == 0)
420 char* ns = (
char*)
omAlloc(strlen((
char*)
res->data) + 2);
421 strcpy(ns, (
char*)
res->data);
427 else if (strcmp(ns,
"%t") == 0)
433 ((
char*)
res->data)[strlen((
char*)
res->data) -1] =
'\0';
435 else if (strcmp(ns,
"%;") == 0)
442 else if (strcmp(ns,
"%p") == 0)
458 char* ns = (
char*)
omAlloc(strlen((
char*)
res->data) + 2);
459 strcpy(ns, (
char*)
res->data);
const CanonicalForm int s
Class used for (list of) interpreter objects.
BOOLEAN iiExprArith1(leftv res, leftv a, int op)
Compatiblity layer for legacy polynomial operations (over currRing)
ideal id_Copy(ideal h1, const ring r)
copy an ideal
static BOOLEAN ipPrint_MA(leftv u)
#define omFreeSize(addr, size)
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
static BOOLEAN ipPrint_RING(leftv u)
static BOOLEAN rField_is_Domain(const ring r)
static void ipPrint_MA0(matrix m, const char *name)
void Print(leftv store=NULL, int spaces=0)
Called by type_cmd (e.g. "r;") or as default in jPRINT.
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
char * String(void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
Called for conversion to string (used by string(..), write(..),..)
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
BOOLEAN jjPRINT(leftv res, leftv u)
static BOOLEAN ipPrint_V(leftv u)
The main handler for Singular numbers which are suitable for Singular polynomials.
void StringSetS(const char *st)
void StringAppendS(const char *st)
void p_Vec2Polys(poly v, poly **p, int *len, const ring r)
static FORCE_INLINE char * nCoeffName(const coeffs cf)
static BOOLEAN ipPrint_INTMAT(leftv u)
static int si_max(const int a, const int b)
void PrintS(const char *s)
char name(const Variable &v)
matrix id_Module2Matrix(ideal mod, const ring R)
void rWrite(ring r, BOOLEAN details)
static BOOLEAN ipPrint_CRING(leftv u)
const Variable & v
< [in] a sqrfree bivariate poly
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
static BOOLEAN rField_is_Ring(const ring r)
static FORCE_INLINE BOOLEAN nCoeff_is_Domain(const coeffs r)
returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)
static BOOLEAN ipPrint_INTVEC(leftv u)
static void ipPrintBetti(leftv u)
BOOLEAN jjDBPRINT(leftv res, leftv u)
BOOLEAN jjPRINT_FORMAT(leftv res, leftv u, leftv v)
#define IMATELEM(M, I, J)