43 for(
i=0;
i<
v->rows();
i++)
45 for(
j=0;
j<
v->cols();
j++)
68 size_t len=14+strlen(
name);
71 vl=
si_max(vl,(
int)strlen(ss));
99 snprintf(ss,len,
"%s[%d,%d]",
name,
i+1,
j+1);
103 vl=
si_max(vl,(
int)strlen(ss));
122 size_t len=14+strlen(
name);
134 snprintf(ss,len,
"%s[%d,%d]",
name,
i+1,
j+1);
197 PrintS(
"polynomial ring, over a ");
201 else PrintS(
"ring (with zero-divisors)");
204 if (r->OrdSgn==1)
PrintS(
", global");
205 else if (r->MixedOrder==1)
PrintS(
", mixed");
217 else PrintS(
"ring (with zero-divisors): ");
308 if (
s[
l-1]==
'\n')
s[
l-1]=
'\0';
323 print= (((int)((long)(u->
Data()))) > 0);
349 int row_shift=(int)((
long)(
atGet(u,
"rowShift",
INT_CMD)));
360 Print(
"%5d:",
i+row_shift);
394 if ((u->
Typ()==
INTMAT_CMD)&&(strcmp((
char *)
v->Data(),
"betti")==0))
407 if (strlen(ns) == 3 && ns[1] ==
'2')
413 if (strcmp(ns,
"%l") == 0)
418 char* ns = (
char*)
omAlloc(strlen((
char*)
res->data) + 2);
419 strcpy(ns, (
char*)
res->data);
425 else if (strcmp(ns,
"%t") == 0)
431 ((
char*)
res->data)[strlen((
char*)
res->data) -1] =
'\0';
433 else if (strcmp(ns,
"%;") == 0)
440 else if (strcmp(ns,
"%p") == 0)
456 char* ns = (
char*)
omAlloc(strlen((
char*)
res->data) + 2);
457 strcpy(ns, (
char*)
res->data);
void * atGet(idhdl root, const char *name, int t, void *defaultReturnValue)
static int si_max(const int a, const int b)
char * String(void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
Called for conversion to string (used by string(..), write(..),..)
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_Domain(const coeffs r)
returns TRUE, if r is a field or r has no zero divisors (i.e is a domain)
static FORCE_INLINE BOOLEAN nCoeff_is_Ring(const coeffs r)
static FORCE_INLINE char * nCoeffName(const coeffs cf)
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
ideal id_Copy(ideal h1, const ring r)
copy an ideal
#define IMATELEM(M, I, J)
BOOLEAN iiExprArith1(leftv res, leftv a, int op)
static BOOLEAN ipPrint_RING(ring r)
void ipPrint_MA0(matrix m, const char *name)
BOOLEAN jjPRINT(leftv res, leftv u)
static BOOLEAN ipPrint_V(poly u)
static BOOLEAN ipPrint_MA(leftv u)
static void ipPrintBetti(leftv u)
static BOOLEAN ipPrint_INTVEC(intvec *v)
BOOLEAN jjPRINT_FORMAT(leftv res, leftv u, leftv v)
static BOOLEAN ipPrint_INTMAT(intvec *v)
static BOOLEAN ipPrint_CRING(coeffs r)
BOOLEAN jjDBPRINT(leftv res, leftv u)
The main handler for Singular numbers which are suitable for Singular polynomials.
#define omFreeSize(addr, size)
#define omFreeBinAddr(addr)
void p_Vec2Polys(poly v, poly **p, int *len, const ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatibility layer for legacy polynomial operations (over currRing)
void StringSetS(const char *st)
void StringAppendS(const char *st)
void PrintS(const char *s)
void rWrite(ring r, BOOLEAN details)
static BOOLEAN rField_is_Domain(const ring r)
#define rField_is_Ring(R)
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
matrix id_Module2Matrix(ideal mod, const ring R)
int name
New type name for int.