72 ch[0]=c->op;ch[1]=
'\0';
75 ::Print(
"##command %d(%s), %d args\n",
78 c->arg1.Print(
NULL,spaces+2);
82 c->arg2.Print(
NULL,spaces+2);
84 c->arg3.Print(
NULL,spaces+2);
145 ((
intvec *)d)->show(t,spaces);
150 const ring r = (ring)d;
293 l->m[
i].Print(
NULL,spaces+3);
305 if (bb!=
NULL) { bb->blackbox_Print(bb,d); }
306 else {
::Print(
"Print: blackbox %d(bb=NULL)",t); }
311 if ((store!=
NULL)&&(store!=
this))
442 return (
void*)n2Copy((number2)d);
444 return (
void*)p2Copy((poly2)d);
459 return (
void *)
idCopy((ideal)d);
468 return (
void *)
pCopy((poly)d);
472 return (
void *)
nCopy((number)d);
503 if (
b!=
NULL)
return b->blackbox_Copy(
b,d);
507 Warn(
"s_internalCopy: cannot copy type %s(%d)",
535 number2 n=(number2)d;
628 Print(
"currRing? ref=%d\n",
R->ref);
641 if (cmd->arg1.rtyp!=0) cmd->arg1.CleanUp(r);
642 if (cmd->arg2.rtyp!=0) cmd->arg2.CleanUp(r);
643 if (cmd->arg3.rtyp!=0) cmd->arg3.CleanUp(r);
675 if (
b!=
NULL)
b->blackbox_destroy(
b,d);
679 Warn(
"s_internalDelete: cannot delete type %s(%d)",
689 void *d=source->
Data();
715 WerrorS(
"object from another ring");
788 sprintf(
s,
"int(%d)",(
int)(
long)d);
793 sprintf(
s,
"%d",(
int)(
long)d);
805 s = (
char*)
omAlloc(strlen((
char*) d) + 3);
806 sprintf(
s,
"\"%s\"", (
char*) d);
819 s = (
char*)
omAlloc(strlen(ps) + 10);
820 sprintf(
s,
"%s(%s)", (t ==
POLY_CMD ?
"poly" :
"vector"), ps);
831 return n2String((number2)d,typed);
866 char* ns = (
char*)
omAlloc(strlen(
s) + 40);
867 sprintf(ns,
"matrix(ideal(%s),%d,%d)",
s,
884 char* ns = (
char*)
omAlloc(strlen(
s) + 10);
886 sprintf(ns,
"ideal(%s)",
s);
888 sprintf(ns,
"module(%s)",
s);
905 ns = (
char*)
omAlloc(strlen(
s) + 40);
906 sprintf(ns,
"intmat(intvec(%s),%d,%d)",
s,
v->rows(),
v->cols());
910 ns = (
char*)
omAlloc(strlen(
s) + 10);
911 sprintf(ns,
"intvec(%s)",
s);
926 char* ns = (
char*)
omAlloc0(strlen(
s) + 40);
927 sprintf(ns,
"bigintmat(bigintvec(%s),%d,%d)",
s, bim->
rows(), bim->
cols());
946 ns = (
char*)
omAlloc(strlen(
s) + strlen(
id) + 20);
947 sprintf(ns,
"\"%s\";%sideal(%s)",
s,(
dim == 2 ?
"\n" :
" "),
id);
951 ns = (
char*)
omAlloc(strlen(
s) + 4);
952 sprintf(ns,
"\"%s\"",
s);
971 s = (
pi->data.s.body);
976 char* ns = (
char*)
omAlloc(strlen(
s) + 4);
977 sprintf(ns,
"\"%s\"",
s);
988 char* ns = (
char*)
omAlloc(strlen(
s) + 10);
989 sprintf(ns,
"link(\"%s\")",
s);
1003 if (bb!=
NULL)
return bb->blackbox_String(bb,d);
1022 return ((
idhdl)
h->data.ustring)->typ;
1096 if ((0<
e->start)&&(
e->start<=
l->nr+1))
1098 Subexpr tmp=
l->m[
e->start-1].e;
1099 l->m[
e->start-1].e=
e->next;
1100 r=
l->m[
e->start-1].Typ();
1101 e->next=
l->m[
e->start-1].e;
1102 l->m[
e->start-1].e=tmp;
1132 if ((0<
e->start)&&(
e->start<=
l->nr+1))
1134 l->m[
e->start-1].e=
e->next;
1135 r=
l->m[
e->start-1].LTyp();
1161 WerrorS(
"object from another ring");
1171 return ((
idhdl)
h->data.ustring)->
data.ustring;
1192 return (
void *)
A->qideal->m[0];
1195 return (
void *)
nInit(0);
1235 r=(
char *)(
long)((*iv)[
index-1]);
1243 ||(
e->next->start<1)
1244 ||(
e->next->start>iv->
cols()))
1247 Werror(
"wrong range[%d,%d] in intmat %s(%dx%d)",
index,
e->next->start,
1248 this->Name(),iv->
rows(),iv->
cols());
1259 ||(
e->next->start<1)
1260 ||(
e->next->start>
m->cols()))
1263 Werror(
"wrong range[%d,%d] in bigintmat %s(%dx%d)",
index,
e->next->start,
1264 this->Name(),
m->rows(),
m->cols());
1276 ||(
e->next->start<1)
1277 ||(
e->next->start>
m->cols()))
1280 Werror(
"wrong range[%d,%d] in matrix %s(%dx%d)",
index,
e->next->start,
1281 this->Name(),
m->rows(),
m->cols());
1285 iiNumber2Data[iiCmatrix_index].cf=
m->basecoeffs();
1287 r=(
char*)&iiNumber2Data[iiCmatrix_index];
1288 iiCmatrix_index=(iiCmatrix_index+1) % 4;
1304 r=(
char *)I->m[
index-1];
1316 && ((c=
e->next->start)>0) &&(c<=
IDELEMS(I)))
1330 memcpy(
this,&tmp,
sizeof(tmp));
1355 if ((
index>0)&& (
index<=(int)strlen((
char *)d)))
1357 r[0]=*(((
char *)d)+
index-1);
1372 memcpy(
this,&tmp,
sizeof(tmp));
1392 ||(
e->next->start<1)
1396 Werror(
"wrong range[%d,%d] in matrix %s(%dx%d)",
1421 char *dd=(
char *)
l->m[
index-1].data;
1422 int j=
e->next->start-1;
1424 if ((
j>=0) && (
j<(
int)strlen(dd)))
1436 Subexpr tmp=
l->m[
index-1].e;
1438 r=(
char *)
l->m[
index-1].Data();
1463 return &(
v->attribute);
1492 if ((0>=
e->start)||(
e->start>
l->nr+1))
1496 l->m[
e->start-1].e=
e->next;
1497 leftv r=
l->m[
e->start-1].LData();
1501 return &(
l->m[
e->start-1]);
1520 if ((0>=
e->start)||(
e->start>
l->nr+1))
1524 l->m[
e->start-1].e=
e->next;
1525 leftv r=
l->m[
e->start-1].LHdl();
1529 return &(
l->m[
e->start-1]);
1550 Warn(
"%s is no standard basis",
h->Name());
1579 if ((*
id<
' ')||(*
id>(
char)126))
1581 Print(
"wrong id :%s:\n",
id);
1588 v->req_packhdl =
pa;
1598 if (strcmp(
id,
"basering")==0)
1612 else if (strcmp(
id,
"Current")==0)
1628 h=
v->req_packhdl->idroot->get(
id,
myynest);
1654 v->data = (
void *)
p;
1665 if (ok && (
p!=
NULL))
1692 v->data = (
void *)
nInit(0);
1712 #ifdef HAVE_SHIFTBBA
1739 v->data = (
void *)
nInit(0);
1796 if (strcmp(
id,
"_")==0)
1821 v->data = (
char *)
h;
1827 if (!isdigit(
id[0]))
1829 Print(
"non-digit:%s\n",
id);
1837 if ((*
id<
' ')||(*
id>(
char)126))
1839 Print(
"wrong id :%s:\n",
id);
1856 v->data = (
void *)
nInit(0);
1873 #ifdef HAVE_SHIFTBBA
1895 if (strcmp(
id,
"_")==0)
1930 char *what=(
char *)(d->arg1.Data());
1948 else if (d->op==
'=')
1956 const char *n=d->arg1.name;
1957 nok=(n ==
NULL) || d->arg2.Eval();
1960 int save_typ=d->arg1.rtyp;
1962 if (d->arg1.rtyp!=
IDHDL)
1965 if (d->arg1.rtyp==
IDHDL)
1980 memcpy(&d->arg1,&t,
sizeof(
sleftv));
1982 nok=nok||
iiAssign(&d->arg1,&d->arg2);
1999 if ((toktype==
CMD_M)
2005 if (d->argc>=1) nok=d->arg1.Eval();
2006 if ((!nok) && (d->argc>=2))
2010 memcpy(d->arg1.next,&d->arg2,
sizeof(
sleftv));
2013 if ((!nok) && (d->argc==3))
2017 memcpy(d->arg1.next->next,&d->arg3,
sizeof(
sleftv));
2031 else if (d->argc==1)
2039 nok=nok||d->arg2.Eval();
2045 nok=nok||d->arg2.Eval();
2046 nok=nok||d->arg3.Eval();
2047 nok=nok||
iiExprArith3(&tmp,d->op,&d->arg1,&d->arg2,&d->arg3);
2059 memcpy(
this,&tmp,
sizeof(tmp));
2087 ideal
id=(ideal)
Data();
2089 int i=
id->ncols*
id->nrows-1;
bigintmat * bimCopy(const bigintmat *b)
same as copy constructor - apart from it being able to accept NULL as input
#define BIMATELEM(M, I, J)
blackbox * getBlackboxStuff(const int t)
return the structure to the type given by t
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
char * String()
IO: String returns a singular string containing the matrix, needs freeing afterwards.
void killAll(const ring r)
Class used for (list of) interpreter objects.
char * String(void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
Called for conversion to string (used by string(..), write(..),..)
void CleanUp(ring r=currRing)
void Print(leftv store=NULL, int spaces=0)
Called by type_cmd (e.g. "r;") or as default in jPRINT.
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
static FORCE_INLINE BOOLEAN nCoeff_is_GF(const coeffs r)
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
@ n_long_C
complex floating point (GMP) numbers
static FORCE_INLINE char * nCoeffString(const coeffs cf)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete 'p'
static FORCE_INLINE char * nCoeffName(const coeffs cf)
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
void nKillChar(coeffs r)
undo all initialisations
BOOLEAN pa(leftv res, leftv args)
const CanonicalForm int s
const Variable & v
< [in] a sqrfree bivariate poly
void WerrorS(const char *s)
VAR char my_yylinebuf[80]
void nfShowMipo(const coeffs r)
Show the mininimal polynom.... NOTE: this is used by char * sleftv::String(void *d,...
const char * iiTwoOps(int t)
const char * Tok2Cmdname(int tok)
VAR BOOLEAN yyInRingConstruction
ideal id_Copy(ideal h1, const ring r)
copy an ideal
intvec * ivCopy(const intvec *o)
#define IMATELEM(M, I, J)
BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
BOOLEAN iiExprArith1(leftv res, leftv a, int op)
BOOLEAN iiExprArithM(leftv res, leftv a, int op)
BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
void jjNormalizeQRingId(leftv I)
BOOLEAN iiAssign(leftv l, leftv r, BOOLEAN toplevel)
VAR omBin sip_command_bin
idhdl ggetid(const char *n)
void killhdl(idhdl h, package proot)
BOOLEAN piKill(procinfov pi)
const char * piProcinfo(procinfov pi, const char *request)
#define jjNormalizeQRingP(p)
package paCopy(package pack)
BOOLEAN iiMake_proc(idhdl pn, package pack, leftv args)
INST_VAR sleftv iiRETURNEXPR
void ipPrint_MA0(matrix m, const char *name)
int iiDeclCommand(leftv sy, leftv name, int lev, int t, idhdl *root, BOOLEAN isring, BOOLEAN init_b)
BOOLEAN iiCheckRing(int i)
lists syConvRes(syStrategy syzstr, BOOLEAN toDel, int add_row_shift)
void paPrint(const char *n, package p)
char * lString(lists l, BOOLEAN typed, int dim)
BOOLEAN lRingDependend(lists L)
map maCopy(map theMap, const ring r)
char * iiStringMatrix(matrix im, int dim, const ring r, char ch)
matrix mp_Copy(matrix a, const ring r)
copies matrix a (from ring r to r)
void iiWriteMatrix(matrix im, const char *n, int dim, const ring r, int spaces)
set spaces to zero by default
#define MATELEM(mat, i, j)
1-based access to matrix
#define SMATELEM(A, i, j, R)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
The main handler for Singular numbers which are suitable for Singular polynomials.
#define omCheckAddr(addr)
#define omCheckIf(cond, test)
#define omCheckAddrSize(addr, size)
#define omFreeBin(addr, bin)
#define omFreeBinAddr(addr)
#define omGetSpecBin(size)
static int index(p_Length length, p_Ord ord)
static void p_LmDelete(poly p, const ring r)
static void p_Delete(poly *p, const ring r)
static poly p_Copy(poly p, const ring r)
returns a copy of p
static long p_Totaldegree(poly p, const ring r)
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Compatiblity layer for legacy polynomial operations (over currRing)
#define pIsConstant(p)
like above, except that Comp must be 0
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced
#define pCopy(p)
return a copy of the poly
void StringSetS(const char *st)
void StringAppendS(const char *st)
void PrintNSpaces(const int n)
void PrintS(const char *s)
void Werror(const char *fmt,...)
void rWrite(ring r, BOOLEAN details)
int r_IsRingVar(const char *n, char **names, int N)
static BOOLEAN rIsPluralRing(const ring r)
we must always have this test!
static ring rIncRefCnt(ring r)
static BOOLEAN rField_is_GF(const ring r)
void sBucketPrint(sBucket_pt bucket)
char * sBucketString(sBucket_pt bucket)
void sBucketDeleteAndDestroy(sBucket_pt *bucket_pt)
sBucket_pt sBucketCopy(const sBucket_pt bucket)
Copy sBucket non-intrusive!!!
poly sBucketPeek(sBucket_pt b)
const char * slStatus(si_link l, const char *request)
static si_link slCopy(si_link l)
static char * slString(si_link l)
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
matrix id_Module2Matrix(ideal mod, const ring R)
void syMake(leftv v, const char *id, package pa)
void s_internalDelete(const int t, void *d, const ring r)
STATIC_VAR omBin size_two_bin
INST_VAR sleftv sLastPrinted
static void * s_internalCopy(const int t, void *d)
BOOLEAN assumeStdFlag(leftv h)
void syMakeMonom(leftv v, const char *id)
procinfov piCopy(procinfov pi)
syStrategy syCopy(syStrategy syzstr)
void syKillComputation(syStrategy syzstr, ring r=currRing)
void syPrint(syStrategy syzstr, const char *currRingName)