My Project
Loading...
Searching...
No Matches
Public Member Functions | Data Fields
sleftv Class Reference

Class used for (list of) interpreter objects. More...

#include <subexpr.h>

Public Member Functions

void Init ()
 
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. More...
 
char * String (void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
 Called for conversion to string (used by string(..), write(..),..) More...
 
void Copy (leftv e)
 
attr CopyA ()
 
void * CopyD (int t)
 
void * CopyD ()
 
const char * Name ()
 
const char * Fullname ()
 
int Typ ()
 
int LTyp ()
 
void * Data ()
 
leftv LData ()
 
attrAttribute ()
 
leftv Next ()
 
int listLength ()
 
int Eval ()
 
BOOLEAN RingDependend ()
 

Data Fields

leftv next
 
const char * name
 
void * data
 
attr attribute
 
BITSET flag
 
int rtyp
 
Subexpr e
 
package req_packhdl
 

Detailed Description

Class used for (list of) interpreter objects.

Definition at line 82 of file subexpr.h.

Member Function Documentation

◆ Attribute()

attr * sleftv::Attribute ( )

Definition at line 1462 of file subexpr.cc.

1463{
1464 if (e==NULL) return &attribute;
1465 if ((rtyp==LIST_CMD)
1466 ||((rtyp==IDHDL)&&(IDTYP((idhdl)data)==LIST_CMD))
1467 || (rtyp>MAX_TOK)
1468 || ((rtyp==IDHDL)&&(IDTYP((idhdl)data)>MAX_TOK)))
1469 {
1470 leftv v=LData();
1471 return &(v->attribute);
1472 }
1473 return NULL;
1474}
Definition: idrec.h:35
Class used for (list of) interpreter objects.
Definition: subexpr.h:83
int rtyp
Definition: subexpr.h:91
void * data
Definition: subexpr.h:88
Subexpr e
Definition: subexpr.h:105
leftv LData()
Definition: subexpr.cc:1476
attr attribute
Definition: subexpr.h:89
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:39
#define IDTYP(a)
Definition: ipid.h:119
#define NULL
Definition: omList.c:12
#define IDHDL
Definition: tok.h:31
@ LIST_CMD
Definition: tok.h:118
@ MAX_TOK
Definition: tok.h:218

◆ CleanUp()

void sleftv::CleanUp ( ring  r = currRing)

Definition at line 348 of file subexpr.cc.

349{
350 if (rtyp!=IDHDL)
351 {
352 if ((name!=NULL) && (name!=sNoName_fe) && (rtyp!=ALIAS_CMD))
353 {
354 //::Print("free %x (%s)\n",name,name);
355 omFree((ADDRESS)name); // may be larger >1000 char (large int)
356 }
357 //name=NULL;
358 //flag=0;
359 if (data!=NULL)
360 {
361 //if (rtyp==IDHDL) attribute=NULL; // is only a pointer to attribute of id
363 //data=NULL; // will be done by Init() at the end
364 }
365 if (attribute!=NULL)
366 {
367 switch (rtyp)
368 {
369 case PACKAGE_CMD:
370 //case IDHDL:
371 case ANY_TYPE:
372 case VECHO:
373 case VPRINTLEVEL:
374 case VCOLMAX:
375 case VTIMER:
376 case VRTIMER:
377 case VOICE:
378 case VMAXDEG:
379 case VMAXMULT:
380 case TRACE:
381 case VSHORTOUT:
382 case VNOETHER:
383 case VMINPOLY:
384 case 0:
385 //attribute=NULL; // will be done by Init() at the end
386 break;
387 default:
388 {
389 attribute->killAll(r);
390 }
391 }
392 }
393 }
394 Subexpr h;
395 while (e!=NULL)
396 {
397 h=e->next;
399 e=h;
400 }
401 //rtyp=NONE; // will be done by Init() at the end
402 if (next!=NULL)
403 {
404 leftv tmp_n;
405 do
406 {
407 tmp_n=next->next;
408 //next->name=NULL;
409 next->next=NULL;
410 next->CleanUp(r);
412 next=tmp_n;
413 } while (next!=NULL);
414 }
415 Init();
416}
void * ADDRESS
Definition: auxiliary.h:119
void killAll(const ring r)
Definition: attrib.cc:189
void Init()
Definition: subexpr.h:107
leftv next
Definition: subexpr.h:86
void CleanUp(ring r=currRing)
Definition: subexpr.cc:348
const char sNoName_fe[]
Definition: fevoices.cc:57
@ VMAXMULT
Definition: grammar.cc:307
@ VMAXDEG
Definition: grammar.cc:306
@ VMINPOLY
Definition: grammar.cc:309
@ VNOETHER
Definition: grammar.cc:308
EXTERN_VAR omBin sleftv_bin
Definition: ipid.h:145
STATIC_VAR Poly * h
Definition: janet.cc:971
#define omFree(addr)
Definition: omAllocDecl.h:261
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
void s_internalDelete(const int t, void *d, const ring r)
Definition: subexpr.cc:514
EXTERN_VAR omBin sSubexpr_bin
Definition: subexpr.h:174
int name
New type name for int.
Definition: templateForC.h:21
@ VCOLMAX
Definition: tok.h:209
@ ALIAS_CMD
Definition: tok.h:34
@ VSHORTOUT
Definition: tok.h:214
@ VPRINTLEVEL
Definition: tok.h:215
@ PACKAGE_CMD
Definition: tok.h:149
@ VECHO
Definition: tok.h:208
@ TRACE
Definition: tok.h:212
@ VTIMER
Definition: tok.h:210
@ VRTIMER
Definition: tok.h:211
@ VOICE
Definition: tok.h:213
#define ANY_TYPE
Definition: tok.h:30

◆ Copy()

void sleftv::Copy ( leftv  e)

Definition at line 685 of file subexpr.cc.

686{
687 Init();
688 rtyp=source->Typ();
689 void *d=source->Data();
690 if(!errorreported)
691 {
692 if (rtyp==BUCKET_CMD)
693 {
695 data=(void*)pCopy(sBucketPeek((sBucket_pt)d));
696 }
697 else
699 if ((source->attribute!=NULL)||(source->e!=NULL))
700 attribute=source->CopyA();
701 flag=source->flag;
702 if (source->next!=NULL)
703 {
705 next->Copy(source->next);
706 }
707 }
708}
void * CopyA()
Definition: subexpr.cc:2137
void Copy(leftv e)
Definition: subexpr.cc:685
BITSET flag
Definition: subexpr.h:90
VAR short errorreported
Definition: feFopen.cc:23
@ BUCKET_CMD
Definition: grammar.cc:283
@ POLY_CMD
Definition: grammar.cc:289
#define omAllocBin(bin)
Definition: omAllocDecl.h:205
#define pCopy(p)
return a copy of the poly
Definition: polys.h:185
poly sBucketPeek(sBucket_pt b)
Definition: sbuckets.cc:455
static void * s_internalCopy(const int t, void *d)
Definition: subexpr.cc:430
sleftv * leftv
Definition: subexpr.h:79

◆ CopyA()

attr sleftv::CopyA ( )

Definition at line 753 of file subexpr.cc.

754{
755 attr *a=Attribute();
756 if ((a!=NULL) && (*a!=NULL))
757 return (*a)->Copy();
758 return NULL;
759}
Definition: attrib.h:21
attr * Attribute()
Definition: subexpr.cc:1462

◆ CopyD() [1/2]

void * sleftv::CopyD ( )
inline

Definition at line 119 of file subexpr.h.

119{ return CopyD(Typ()); }
int Typ()
Definition: subexpr.cc:1019
void * CopyD()
Definition: subexpr.h:119

◆ CopyD() [2/2]

void * sleftv::CopyD ( int  t)

Definition at line 710 of file subexpr.cc.

711{
713 {
714 flag&=~Sy_bit(FLAG_OTHER_RING);
715 WerrorS("object from another ring");
716 return NULL;
717 }
718
719 if ((rtyp!=IDHDL)&&(rtyp!=ALIAS_CMD)&&(e==NULL))
720 {
721 if (iiCheckRing(t)) return NULL;
722 void *x = data;
723 if (rtyp==VNOETHER) x = (void *)pCopy((currRing->ppNoether));
724 else if ((rtyp==VMINPOLY) && nCoeff_is_algExt(currRing->cf) && (!nCoeff_is_GF(currRing->cf)))
725 {
726 const ring A = currRing->cf->extRing;
727
728 assume( A != NULL );
729 assume( A->qideal != NULL );
730
731 x=(void *)p_Copy(A->qideal->m[0], A);
732 }
733 data=NULL;
734 return x;
735 }
736 void *d=Data(); // will also do a iiCheckRing
737 if ((!errorreported) && (d!=NULL)) return s_internalCopy(t,d);
738 return NULL;
739}
Variable x
Definition: cfModGcd.cc:4082
void * Data()
Definition: subexpr.cc:1162
static FORCE_INLINE BOOLEAN nCoeff_is_GF(const coeffs r)
Definition: coeffs.h:836
static FORCE_INLINE BOOLEAN nCoeff_is_algExt(const coeffs r)
TRUE iff r represents an algebraic extension field.
Definition: coeffs.h:907
void WerrorS(const char *s)
Definition: feFopen.cc:24
#define FLAG_OTHER_RING
Definition: ipid.h:110
BOOLEAN iiCheckRing(int i)
Definition: ipshell.cc:1586
#define assume(x)
Definition: mod2.h:389
#define Sy_inset(x, s)
Definition: options.h:33
static poly p_Copy(poly p, const ring r)
returns a copy of p
Definition: p_polys.h:844
VAR ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:13
#define A
Definition: sirandom.c:24

◆ Data()

void * sleftv::Data ( )

Definition at line 1162 of file subexpr.cc.

1163{
1164 if ((rtyp!=IDHDL) && iiCheckRing(rtyp))
1165 return NULL;
1167 {
1168 flag&=~Sy_bit(FLAG_OTHER_RING);
1169 WerrorS("object from another ring");
1170 return NULL;
1171 }
1172 if (e==NULL)
1173 {
1174 switch (rtyp)
1175 {
1176 case ALIAS_CMD:
1177 {
1178 idhdl h=(idhdl)data;
1179 return ((idhdl)h->data.ustring)->data.ustring;
1180 }
1181 case VECHO: return (void *)(long)si_echo;
1182 case VPRINTLEVEL:return (void *)(long)printlevel;
1183 case VCOLMAX: return (void *)(long)colmax;
1184 case VTIMER: return (void *)(long)getTimer();
1185 case VRTIMER: return (void *)(long)getRTimer();
1186 case VOICE: return (void *)(long)(myynest+1);
1187 case VMAXDEG: return (void *)(long)Kstd1_deg;
1188 case VMAXMULT: return (void *)(long)Kstd1_mu;
1189 case TRACE: return (void *)(long)traceit;
1190 case VSHORTOUT: return (void *)(long)(currRing != NULL ? currRing->ShortOut : 0);
1191 case VMINPOLY:
1192 if ( (currRing != NULL) && nCoeff_is_algExt(currRing->cf) && !nCoeff_is_GF(currRing->cf))
1193 {
1194 /* Q(a), Fp(a), but not GF(q) */
1195 const ring A = currRing->cf->extRing;
1196
1197 assume( A != NULL );
1198 assume( A->qideal != NULL );
1199
1200 return (void *)A->qideal->m[0];
1201 }
1202 else
1203 return (void *)nInit(0);
1204
1205 case VNOETHER: return (void *) (currRing->ppNoether);
1206 case IDHDL:
1207 return IDDATA((idhdl)data);
1208 case COMMAND:
1209 //return NULL;
1210 default:
1211 return data;
1212 }
1213 }
1214 /* e != NULL : */
1215 int t=rtyp;
1216 void *d=data;
1217 if (t==IDHDL)
1218 {
1219 t=((idhdl)data)->typ;
1220 d=IDDATA((idhdl)data);
1221 }
1222 else if (t==ALIAS_CMD)
1223 {
1225 t=IDTYP(h);
1226 d=IDDATA(h);
1227 }
1228 if (iiCheckRing(t))
1229 return NULL;
1230 char *r=NULL;
1231 int index=e->start;
1232 switch (t)
1233 {
1234 case INTVEC_CMD:
1235 {
1236 intvec *iv=(intvec *)d;
1237 if ((index<1)||(index>iv->length()))
1238 {
1239 if (!errorreported)
1240 Werror("wrong range[%d] in intvec %s(%d)",index,this->Name(),iv->length());
1241 }
1242 else
1243 r=(char *)(long)((*iv)[index-1]);
1244 break;
1245 }
1246 case INTMAT_CMD:
1247 {
1248 intvec *iv=(intvec *)d;
1249 if ((index<1)
1250 ||(index>iv->rows())
1251 ||(e->next->start<1)
1252 ||(e->next->start>iv->cols()))
1253 {
1254 if (!errorreported)
1255 Werror("wrong range[%d,%d] in intmat %s(%dx%d)",index,e->next->start,
1256 this->Name(),iv->rows(),iv->cols());
1257 }
1258 else
1259 r=(char *)(long)(IMATELEM((*iv),index,e->next->start));
1260 break;
1261 }
1262 case BIGINTMAT_CMD:
1263 {
1264 bigintmat *m=(bigintmat *)d;
1265 if ((index<1)
1266 ||(index>m->rows())
1267 ||(e->next->start<1)
1268 ||(e->next->start>m->cols()))
1269 {
1270 if (!errorreported)
1271 Werror("wrong range[%d,%d] in bigintmat %s(%dx%d)",index,e->next->start,
1272 this->Name(),m->rows(),m->cols());
1273 }
1274 else
1275 r=(char *)(BIMATELEM((*m),index,e->next->start));
1276 break;
1277 }
1278#ifdef SINGULAR_4_2
1279 case CMATRIX_CMD:
1280 {
1281 bigintmat *m=(bigintmat *)d;
1282 if ((index<1)
1283 ||(index>m->rows())
1284 ||(e->next->start<1)
1285 ||(e->next->start>m->cols()))
1286 {
1287 if (!errorreported)
1288 Werror("wrong range[%d,%d] in matrix %s(%dx%d)",index,e->next->start,
1289 this->Name(),m->rows(),m->cols());
1290 }
1291 else
1292 {
1293 iiNumber2Data[iiCmatrix_index].cf=m->basecoeffs();
1294 iiNumber2Data[iiCmatrix_index].n=BIMATELEM((*m),index,e->next->start);
1295 r=(char*)&iiNumber2Data[iiCmatrix_index];
1296 iiCmatrix_index=(iiCmatrix_index+1) % 4;
1297 }
1298 break;
1299 }
1300#endif
1301 case IDEAL_CMD:
1302 case MODUL_CMD:
1303 case MAP_CMD:
1304 {
1305 ideal I=(ideal)d;
1306 if ((index<1)||(index>IDELEMS(I)))
1307 {
1308 if (!errorreported)
1309 Werror("wrong range[%d] in ideal/module %s(%d)",index,this->Name(),IDELEMS(I));
1310 }
1311 else
1312 r=(char *)I->m[index-1];
1313 break;
1314 }
1315 case SMATRIX_CMD:
1316 {
1317 ideal I=(ideal)d;
1318 int c;
1319 sleftv tmp;
1320 tmp.Init();
1321 tmp.rtyp=POLY_CMD;
1322 if ((index>0)&& (index<=I->rank)
1323 && (e->next!=NULL)
1324 && ((c=e->next->start)>0) &&(c<=IDELEMS(I)))
1325 {
1326 r=(char*)SMATELEM(I,index-1,c-1,currRing);
1327 }
1328 else
1329 {
1330 r=NULL;
1331 }
1332 tmp.data=r;
1333 if ((rtyp==IDHDL)||(rtyp==SMATRIX_CMD))
1334 {
1335 tmp.next=next; next=NULL;
1336 d=NULL;
1337 CleanUp();
1338 memcpy(this,&tmp,sizeof(tmp));
1339 }
1340 // and, remember, r is also the result...
1341 else
1342 {
1343 // ???
1344 // here we still have a memory leak...
1345 // example: list L="123","456";
1346 // L[1][2];
1347 // therefore, it should never happen:
1348 assume(0);
1349 // but if it happens: here is the temporary fix:
1350 // omMarkAsStaticAddr(r);
1351 }
1352 break;
1353 }
1354 case STRING_CMD:
1355 {
1356 // this was a memory leak
1357 // we evalute it, cleanup and replace this leftv by it's evalutated form
1358 // the evalutated form will be build in tmp
1359 sleftv tmp;
1360 tmp.Init();
1361 tmp.rtyp=STRING_CMD;
1362 r=(char *)omAllocBin(size_two_bin);
1363 if ((index>0)&& (index<=(int)strlen((char *)d)))
1364 {
1365 r[0]=*(((char *)d)+index-1);
1366 r[1]='\0';
1367 }
1368 else
1369 {
1370 r[0]='\0';
1371 }
1372 tmp.data=r;
1373 if ((rtyp==IDHDL)||(rtyp==STRING_CMD))
1374 {
1375 tmp.next=next; next=NULL;
1376 //if (rtyp==STRING_CMD) { omFree((ADDRESS)data); }
1377 //data=NULL;
1378 d=NULL;
1379 CleanUp();
1380 memcpy(this,&tmp,sizeof(tmp));
1381 }
1382 // and, remember, r is also the result...
1383 else
1384 {
1385 // ???
1386 // here we still have a memory leak...
1387 // example: list L="123","456";
1388 // L[1][2];
1389 // therefore, it should never happen:
1390 assume(0);
1391 // but if it happens: here is the temporary fix:
1392 // omMarkAsStaticAddr(r);
1393 }
1394 break;
1395 }
1396 case MATRIX_CMD:
1397 {
1398 if ((index<1)
1399 ||(index>MATROWS((matrix)d))
1400 ||(e->next->start<1)
1401 ||(e->next->start>MATCOLS((matrix)d)))
1402 {
1403 if (!errorreported)
1404 Werror("wrong range[%d,%d] in matrix %s(%dx%d)",
1405 index,e->next->start,
1406 this->Name(),
1407 MATROWS((matrix)d),MATCOLS((matrix)d));
1408 }
1409 else
1410 r=(char *)MATELEM((matrix)d,index,e->next->start);
1411 break;
1412 }
1413 default:
1414 {
1415 blackbox *b=NULL;
1416 if (t>MAX_TOK)
1417 {
1419 }
1420 if ((t==LIST_CMD)||((b!=NULL)&&(BB_LIKE_LIST(b))))
1421 {
1422 lists l=(lists)d;
1423 if ((0<index)&&(index<=l->nr+1))
1424 {
1425 if ((e->next!=NULL)
1426 && (l->m[index-1].rtyp==STRING_CMD))
1427 // string[..].Data() modifies sleftv, so let's do it ourself
1428 {
1429 char *dd=(char *)l->m[index-1].data;
1430 int j=e->next->start-1;
1431 r=(char *)omAllocBin(size_two_bin);
1432 if ((j>=0) && (j<(int)strlen(dd)))
1433 {
1434 r[0]=*(dd+j);
1435 r[1]='\0';
1436 }
1437 else
1438 {
1439 r[0]='\0';
1440 }
1441 }
1442 else
1443 {
1444 Subexpr tmp=l->m[index-1].e;
1445 l->m[index-1].e=e->next;
1446 r=(char *)l->m[index-1].Data();
1447 e->next=l->m[index-1].e;
1448 l->m[index-1].e=tmp;
1449 }
1450 }
1451 else //if (!errorreported)
1452 Werror("wrong range[%d] in list %s(%d)",index,this->Name(),l->nr+1);
1453 }
1454 else
1455 Werror("cannot index %s of type %s(%d)",this->Name(),Tok2Cmdname(t),t);
1456 break;
1457 }
1458 }
1459 return r;
1460}
#define BIMATELEM(M, I, J)
Definition: bigintmat.h:133
blackbox * getBlackboxStuff(const int t)
return the structure to the type given by t
Definition: blackbox.cc:17
#define BB_LIKE_LIST(B)
Definition: blackbox.h:53
int l
Definition: cfEzgcd.cc:100
int m
Definition: cfEzgcd.cc:128
CanonicalForm b
Definition: cfModGcd.cc:4103
Matrices of numbers.
Definition: bigintmat.h:51
Definition: intvec.h:23
int length() const
Definition: intvec.h:94
int cols() const
Definition: intvec.h:95
int rows() const
Definition: intvec.h:96
const char * Name()
Definition: subexpr.h:120
Definition: lists.h:24
int nr
Definition: lists.h:44
int j
Definition: facHensel.cc:110
VAR int printlevel
Definition: febase.cc:36
VAR int si_echo
Definition: febase.cc:35
VAR int myynest
Definition: febase.cc:41
const char * Tok2Cmdname(int tok)
Definition: gentable.cc:140
@ IDEAL_CMD
Definition: grammar.cc:284
@ MATRIX_CMD
Definition: grammar.cc:286
@ BIGINTMAT_CMD
Definition: grammar.cc:278
@ MAP_CMD
Definition: grammar.cc:285
@ INTMAT_CMD
Definition: grammar.cc:279
@ MODUL_CMD
Definition: grammar.cc:287
@ SMATRIX_CMD
Definition: grammar.cc:291
#define IMATELEM(M, I, J)
Definition: intvec.h:85
#define IDDATA(a)
Definition: ipid.h:126
EXTERN_VAR int Kstd1_deg
Definition: kstd1.h:49
EXTERN_VAR int Kstd1_mu
Definition: kstd1.h:49
#define MATELEM(mat, i, j)
1-based access to matrix
Definition: matpol.h:29
#define SMATELEM(A, i, j, R)
Definition: matpol.h:123
#define MATROWS(i)
Definition: matpol.h:26
#define MATCOLS(i)
Definition: matpol.h:27
slists * lists
Definition: mpr_numeric.h:146
#define nInit(i)
Definition: numbers.h:24
static int index(p_Length length, p_Ord ord)
Definition: p_Procs_Impl.h:592
void Werror(const char *fmt,...)
Definition: reporter.cc:189
EXTERN_VAR int traceit
Definition: reporter.h:24
EXTERN_VAR int colmax
Definition: reporter.h:17
idrec * idhdl
Definition: ring.h:21
#define IDELEMS(i)
Definition: simpleideals.h:23
STATIC_VAR omBin size_two_bin
Definition: subexpr.cc:44
int getTimer()
Definition: timer.cc:95
int getRTimer()
Definition: timer.cc:170
@ INTVEC_CMD
Definition: tok.h:101
@ CMATRIX_CMD
Definition: tok.h:46
@ STRING_CMD
Definition: tok.h:185
#define COMMAND
Definition: tok.h:29

◆ Eval()

int sleftv::Eval ( )

Definition at line 1945 of file subexpr.cc.

1946{
1947 BOOLEAN nok=FALSE;
1948 leftv nn=next;
1949 next=NULL;
1950 if(rtyp==IDHDL)
1951 {
1952 int t=Typ();
1953 if (t!=PROC_CMD)
1954 {
1955 void *d=CopyD(t);
1956 data=d;
1957 rtyp=t;
1958 name=NULL;
1959 e=NULL;
1960 }
1961 }
1962 else if (rtyp==COMMAND)
1963 {
1964 command d=(command)data;
1965 if(d->op==PROC_CMD) //assume d->argc==2
1966 {
1967 char *what=(char *)(d->arg1.Data());
1968 idhdl h=ggetid(what);
1969 if((h!=NULL)&&(IDTYP(h)==PROC_CMD))
1970 {
1971 nok=d->arg2.Eval();
1972 if(!nok)
1973 {
1974 nok=iiMake_proc(h,req_packhdl,&d->arg2);
1975 this->CleanUp(currRing);
1976 if (!nok)
1977 {
1978 memcpy(this,&iiRETURNEXPR,sizeof(sleftv));
1980 }
1981 }
1982 }
1983 else nok=TRUE;
1984 }
1985 else if (d->op=='=') //assume d->argc==2
1986 {
1987 if ((d->arg1.rtyp!=IDHDL)&&(d->arg1.rtyp!=DEF_CMD))
1988 {
1989 nok=d->arg1.Eval();
1990 }
1991 if (!nok)
1992 {
1993 const char *n=d->arg1.name;
1994 nok=(n == NULL) || d->arg2.Eval();
1995 if (!nok)
1996 {
1997 int save_typ=d->arg1.rtyp;
1998 omCheckAddr((ADDRESS)n);
1999 if (d->arg1.rtyp!=IDHDL)
2000 syMake(&d->arg1,n);
2001 omCheckAddr((ADDRESS)d->arg1.name);
2002 if (d->arg1.rtyp==IDHDL)
2003 {
2004 n=omStrDup(IDID((idhdl)d->arg1.data));
2005 killhdl((idhdl)d->arg1.data);
2006 d->arg1.Init();
2007 //d->arg1.data=NULL;
2008 d->arg1.name=n;
2009 }
2010 d->arg1.rtyp=DEF_CMD;
2011 sleftv t;
2012 if(save_typ!=PROC_CMD) save_typ=d->arg2.rtyp;
2013 if (::RingDependend(d->arg2.rtyp))
2014 nok=iiDeclCommand(&t,&d->arg1,0,save_typ,&currRing->idroot);
2015 else
2016 nok=iiDeclCommand(&t,&d->arg1,0,save_typ,&IDROOT);
2017 memcpy(&d->arg1,&t,sizeof(sleftv));
2018 omCheckAddr((ADDRESS)d->arg1.name);
2019 nok=nok||iiAssign(&d->arg1,&d->arg2);
2020 omCheckIf(d->arg1.name != NULL, // OB: ????
2021 omCheckAddr((ADDRESS)d->arg1.name));
2022 if (!nok)
2023 {
2024 d->arg1.Init();
2025 this->CleanUp();
2026 rtyp=NONE;
2027 }
2028 }
2029 }
2030 else nok=TRUE;
2031 }
2032 else
2033 {
2034 sleftv tmp; tmp.Init();
2035 int toktype=iiTokType(d->op);
2036 if ((toktype==CMD_M)
2037 ||( toktype==ROOT_DECL_LIST)
2038 ||( toktype==RING_DECL_LIST))
2039 {
2040 if (d->argc <=3)
2041 {
2042 if (d->argc>=1) nok=d->arg1.Eval();
2043 if ((!nok) && (d->argc>=2))
2044 {
2045 nok=d->arg2.Eval();
2046 d->arg1.next=(leftv)omAllocBin(sleftv_bin);
2047 memcpy(d->arg1.next,&d->arg2,sizeof(sleftv));
2048 d->arg2.Init();
2049 }
2050 if ((!nok) && (d->argc==3))
2051 {
2052 nok=d->arg3.Eval();
2053 d->arg1.next->next=(leftv)omAllocBin(sleftv_bin);
2054 memcpy(d->arg1.next->next,&d->arg3,sizeof(sleftv));
2055 d->arg3.Init();
2056 }
2057 if (d->argc==0)
2058 nok=nok||iiExprArithM(&tmp,NULL,d->op);
2059 else
2060 nok=nok||iiExprArithM(&tmp,&d->arg1,d->op);
2061 }
2062 else
2063 {
2064 nok=d->arg1.Eval();
2065 nok=nok||iiExprArithM(&tmp,&d->arg1,d->op);
2066 }
2067 }
2068 else if (d->argc==1)
2069 {
2070 nok=d->arg1.Eval();
2071 nok=nok||iiExprArith1(&tmp,&d->arg1,d->op);
2072 }
2073 else if(d->argc==2)
2074 {
2075 nok=d->arg1.Eval();
2076 nok=nok||d->arg2.Eval();
2077 nok=nok||iiExprArith2(&tmp,&d->arg1,d->op,&d->arg2);
2078 }
2079 else if(d->argc==3)
2080 {
2081 nok=d->arg1.Eval();
2082 nok=nok||d->arg2.Eval();
2083 nok=nok||d->arg3.Eval();
2084 nok=nok||iiExprArith3(&tmp,d->op,&d->arg1,&d->arg2,&d->arg3);
2085 }
2086 else if(d->argc!=0)
2087 {
2088 nok=d->arg1.Eval();
2089 nok=nok||iiExprArithM(&tmp,&d->arg1,d->op);
2090 }
2091 else // d->argc == 0
2092 {
2093 nok = iiExprArithM(&tmp, NULL, d->op);
2094 }
2095 this->CleanUp();
2096 memcpy(this,&tmp,sizeof(tmp));
2097 }
2098 }
2099 else if (((rtyp==0)||(rtyp==DEF_CMD))
2100 &&(name!=NULL))
2101 {
2102 syMake(this,name);
2103 }
2104#ifdef MDEBUG
2105 switch(Typ())
2106 {
2107 case NUMBER_CMD:
2108#ifdef LDEBUG
2109 nTest((number)Data());
2110#endif
2111 break;
2112 case BIGINT_CMD:
2113#ifdef LDEBUG
2114 n_Test((number)Data(),coeffs_BIGINT);
2115#endif
2116 break;
2117 case POLY_CMD:
2118 pTest((poly)Data());
2119 break;
2120 case IDEAL_CMD:
2121 case MODUL_CMD:
2122 case MATRIX_CMD:
2123 {
2124 ideal id=(ideal)Data();
2125 omCheckAddrSize(id,sizeof(*id));
2126 int i=id->ncols*id->nrows-1;
2127 for(;i>=0;i--) pTest(id->m[i]);
2128 }
2129 break;
2130 }
2131#endif
2132 if (nn!=NULL) nok=nok||nn->Eval();
2133 next=nn;
2134 return nok;
2135}
int BOOLEAN
Definition: auxiliary.h:87
#define TRUE
Definition: auxiliary.h:100
#define FALSE
Definition: auxiliary.h:96
int i
Definition: cfEzgcd.cc:132
package req_packhdl
Definition: subexpr.h:106
BOOLEAN RingDependend()
Definition: subexpr.cc:418
int Eval()
Definition: subexpr.cc:1945
#define n_Test(a, r)
BOOLEAN n_Test(number a, const coeffs r)
Definition: coeffs.h:709
@ RING_DECL_LIST
Definition: grammar.cc:322
@ PROC_CMD
Definition: grammar.cc:280
@ ROOT_DECL_LIST
Definition: grammar.cc:320
@ NUMBER_CMD
Definition: grammar.cc:288
@ CMD_M
Definition: grammar.cc:318
BOOLEAN iiExprArith2(leftv res, leftv a, int op, leftv b, BOOLEAN proccall)
Definition: iparith.cc:8924
BOOLEAN iiExprArith1(leftv res, leftv a, int op)
Definition: iparith.cc:9113
BOOLEAN iiExprArithM(leftv res, leftv a, int op)
Definition: iparith.cc:9414
BOOLEAN iiExprArith3(leftv res, int op, leftv a, leftv b, leftv c)
Definition: iparith.cc:9323
int iiTokType(int op)
Definition: iparith.cc:233
BOOLEAN iiAssign(leftv l, leftv r, BOOLEAN toplevel)
Definition: ipassign.cc:1963
idhdl ggetid(const char *n)
Definition: ipid.cc:581
void killhdl(idhdl h, package proot)
Definition: ipid.cc:414
VAR coeffs coeffs_BIGINT
Definition: ipid.cc:50
ip_command * command
Definition: ipid.h:23
#define IDID(a)
Definition: ipid.h:122
#define IDROOT
Definition: ipid.h:19
BOOLEAN iiMake_proc(idhdl pn, package pack, leftv args)
Definition: iplib.cc:504
INST_VAR sleftv iiRETURNEXPR
Definition: iplib.cc:474
int iiDeclCommand(leftv sy, leftv name, int lev, int t, idhdl *root, BOOLEAN isring, BOOLEAN init_b)
Definition: ipshell.cc:1198
#define nTest(a)
Definition: numbers.h:35
#define omStrDup(s)
Definition: omAllocDecl.h:263
#define omCheckAddr(addr)
Definition: omAllocDecl.h:328
#define omCheckIf(cond, test)
Definition: omAllocDecl.h:323
#define omCheckAddrSize(addr, size)
Definition: omAllocDecl.h:327
#define pTest(p)
Definition: polys.h:414
void syMake(leftv v, const char *name, package pa=NULL)
Definition: subexpr.cc:1570
@ BIGINT_CMD
Definition: tok.h:38
@ DEF_CMD
Definition: tok.h:58
#define NONE
Definition: tok.h:221

◆ Fullname()

const char * sleftv::Fullname ( )
inline

Definition at line 125 of file subexpr.h.

126 {
127 if ((name!=NULL) && (e==NULL)) return(this->name);
128 else return sNoName_fe;
129 }

◆ Init()

void sleftv::Init ( )
inline

Definition at line 107 of file subexpr.h.

107{ memset(this,0,sizeof(*this)); }

◆ LData()

leftv sleftv::LData ( )

Definition at line 1476 of file subexpr.cc.

1477{
1478 if (e!=NULL)
1479 {
1480 lists l=NULL;
1481 blackbox *b=getBlackboxStuff(rtyp);
1482
1483 if ((rtyp==LIST_CMD)
1484 || ((b!=NULL)&&(BB_LIKE_LIST(b))))
1485 l=(lists)data;
1486 else if ((rtyp==IDHDL)&& (IDTYP((idhdl)data)==LIST_CMD))
1487 l=IDLIST((idhdl)data);
1488 else if ((rtyp==IDHDL)&& (IDTYP((idhdl)data)>MAX_TOK))
1489 {
1491 if (BB_LIKE_LIST(b)) l=IDLIST((idhdl)data);
1492 }
1493 else if (rtyp==ALIAS_CMD)
1494 {
1495 idhdl h=(idhdl)data;
1496 l= (lists)(((idhdl)h->data.ustring)->data.ustring);
1497 }
1498 if (l!=NULL)
1499 {
1500 if ((0>=e->start)||(e->start>l->nr+1))
1501 return NULL;
1502 if (e->next!=NULL)
1503 {
1504 l->m[e->start-1].e=e->next;
1505 leftv r=l->m[e->start-1].LData();
1506 l->m[e->start-1].e=NULL;
1507 return r;
1508 }
1509 return &(l->m[e->start-1]);
1510 }
1511 }
1512 return this;
1513}
#define IDLIST(a)
Definition: ipid.h:137

◆ listLength()

int sleftv::listLength ( )

Definition at line 51 of file subexpr.cc.

52{
53 int n = 1;
54 leftv sl = next;
55 while (sl!=NULL)
56 {
57 n++;
58 sl=sl->next;
59 }
60 return n;
61}

◆ LTyp()

int sleftv::LTyp ( )

Definition at line 1126 of file subexpr.cc.

1127{
1128 lists l=NULL;
1129 int r;
1130 if (rtyp==LIST_CMD)
1131 l=(lists)data;
1132 else if ((rtyp==IDHDL)&& (IDTYP((idhdl)data)==LIST_CMD))
1133 l=IDLIST((idhdl)data);
1134 else
1135 return Typ();
1136 //if (l!=NULL)
1137 {
1138 if ((e!=NULL) && (e->next!=NULL))
1139 {
1140 if ((0<e->start)&&(e->start<=l->nr+1))
1141 {
1142 l->m[e->start-1].e=e->next;
1143 r=l->m[e->start-1].LTyp();
1144 l->m[e->start-1].e=NULL;
1145 }
1146 else
1147 {
1148 //Warn("out of range: %d not in 1..%d",e->start,l->nr+1);
1149 r=NONE;
1150 }
1151 return r;
1152 }
1153 return LIST_CMD;
1154 }
1155 return Typ();
1156}

◆ Name()

const char * sleftv::Name ( )
inline

Definition at line 120 of file subexpr.h.

121 {
122 if ((name!=NULL) && (e==NULL)) return name;
123 else return sNoName_fe;
124 }
const char * name
Definition: subexpr.h:87

◆ Next()

leftv sleftv::Next ( )
inline

Definition at line 136 of file subexpr.h.

136{ return next; }

◆ Print()

void sleftv::Print ( leftv  store = NULL,
int  spaces = 0 
)

Called by type_cmd (e.g. "r;") or as default in jPRINT.

Definition at line 63 of file subexpr.cc.

64{
65 int t=Typ();
66 if (errorreported) return;
67#ifdef SIQ
68 if (rtyp==COMMAND)
69 {
71 char ch[2];
72 ch[0]=c->op;ch[1]='\0';
73 const char *s=ch;
74 if (c->op>127) s=iiTwoOps(c->op);
75 ::Print("##command %d(%s), %d args\n",
76 c->op, s, c->argc);
77 if (c->argc>0)
78 c->arg1.Print(NULL,spaces+2);
79 if(c->argc<4)
80 {
81 if (c->argc>1)
82 c->arg2.Print(NULL,spaces+2);
83 if (c->argc>2)
84 c->arg3.Print(NULL,spaces+2);
85 }
86 PrintS("##end");
87 }
88 else
89#endif
90 {
91 const char *n=Name();
92 char *s;
93 void *d=Data();
94 if (errorreported) return;
95
96 switch (t /*=Typ()*/)
97 {
98 case CRING_CMD:
99 crPrint((coeffs)d);
100 break;
101#ifdef SINGULAR_4_2
102 case CNUMBER_CMD:
103 n2Print((number2)d);
104 break;
105 case CPOLY_CMD:
106 p2Print((poly2)d);
107 break;
108 case CMATRIX_CMD: // like BIGINTMAT
109#endif
110 case BIGINTMAT_CMD:
111 ((bigintmat *)d)->pprint(colmax);
112 break;
113 case BUCKET_CMD:
114 {
116 if ((e==NULL)
117 && (TEST_V_QRING)
118 &&(currRing->qideal!=NULL))
119 {
120 poly p=pCopy(sBucketPeek(b));
122 PrintNSpaces(spaces);
123 pWrite0(p);
124 pDelete(&p);
125 break;
126 }
127 else
129 }
130 break;
131 case UNKNOWN:
132 case DEF_CMD:
133 PrintNSpaces(spaces);
134 PrintS("`");PrintS(n);PrintS("`");
135 break;
136 case PACKAGE_CMD:
137 PrintNSpaces(spaces);
138 paPrint(n,(package)d);
139 break;
140 case LIB_CMD:
141 case NONE:
142 return;
143 case INTVEC_CMD:
144 case INTMAT_CMD:
145 ((intvec *)d)->show(t,spaces);
146 break;
147 case RING_CMD:
148 {
149 PrintNSpaces(spaces);
150 const ring r = (ring)d;
151 rWrite(r, currRing == r);
152 break;
153 }
154 case MATRIX_CMD:
155 iiWriteMatrix((matrix)d,n,2, currRing, spaces);
156 break;
157 case SMATRIX_CMD:
158 {
160 ipPrint_MA0(m, n);
161 id_Delete((ideal *) &m,currRing);
162 break;
163 }
164 case MODUL_CMD:
165 case IDEAL_CMD:
166 if ((TEST_V_QRING) &&(currRing->qideal!=NULL)
167 &&(!hasFlag(this,FLAG_QRING)))
168 {
169 jjNormalizeQRingId(this);
170 d=Data();
171 }
172 // no break:
173 case MAP_CMD:
174 iiWriteMatrix((matrix)d,n,1, currRing, spaces);
175 break;
176 case POLY_CMD:
177 case VECTOR_CMD:
178 if ((e==NULL)
179 && (TEST_V_QRING)
180 &&(currRing->qideal!=NULL)
181 &&(!hasFlag(this,FLAG_QRING)))
182 {
183 setFlag(this,FLAG_QRING);
184 poly p=(poly)d;
186 if (p!=(poly)d)
187 {
188 d=(void*)p;
189 if ((rtyp==POLY_CMD)||(rtyp==VECTOR_CMD)) data=d;
190 else if (rtyp==IDHDL)
191 {
192 idhdl h=(idhdl)data;
193 IDPOLY(h)=p;
195 }
196 }
197 }
198 PrintNSpaces(spaces);
199 pWrite0((poly)d);
200 break;
201 case RESOLUTION_CMD:
202 {
203 syStrategy tmp=(syStrategy)d;
205 break;
206 }
207 case STRING_CMD:
208 PrintNSpaces(spaces);
209 PrintS((char *)d);
210 break;
211 case INT_CMD:
212 PrintNSpaces(spaces);
213 ::Print("%ld",(long)d);
214 break;
215 case PROC_CMD:
216 {
218
219 PrintNSpaces(spaces);
220 PrintS("// libname : ");
221 PrintS(piProcinfo(pi, "libname"));
222 PrintLn();
223
224 PrintNSpaces(spaces);
225 PrintS("// procname : ");
226 PrintS(piProcinfo(pi, "procname"));
227 PrintLn();
228
229 PrintNSpaces(spaces);
230 PrintS("// type : ");
231 PrintS(piProcinfo(pi, "type"));
232 // ::Print("%-*.*s// ref : %s",spaces,spaces," ",
233 // piProcinfo(pi, "ref"));
234 break;
235 }
236 case LINK_CMD:
237 {
238 si_link l=(si_link)d;
239 PrintNSpaces(spaces);
240 ::Print("// type : %s\n", slStatus(l, "type"));
241 PrintNSpaces(spaces);
242 ::Print("// mode : %s\n", slStatus(l, "mode"));
243 PrintNSpaces(spaces);
244 ::Print("// name : %s\n", slStatus(l, "name"));
245 PrintNSpaces(spaces);
246 ::Print("// open : %s\n", slStatus(l, "open"));
247 PrintNSpaces(spaces);
248 ::Print("// read : %s\n", slStatus(l, "read"));
249 PrintNSpaces(spaces);
250 ::Print("// write: %s", slStatus(l, "write"));
251 break;
252 }
253 case BIGINT_CMD:
254 s=String(d);
255 if (s==NULL) return;
256 PrintNSpaces(spaces);
257 PrintS(s);
258 omFree((ADDRESS)s);
259 break;
260 case NUMBER_CMD:
261 {
262 number n=(number)d;
263 nNormalize(n);
264 if ((number)d !=n)
265 {
266 d=n;
267 if (rtyp==IDHDL) IDNUMBER(((idhdl)data))=n;
268 else if(rtyp==NUMBER_CMD) data=(void*)n;
269 }
270 s=String(d);
271 if (s==NULL) return;
272 PrintS(s);
273 omFree((ADDRESS)s);
274 break;
275 }
276 case LIST_CMD:
277 {
278 lists l=(lists)d;
279 if (lSize(l)<0)
280 {
281 PrintNSpaces(spaces);
282 PrintS("empty list\n");
283 }
284 else
285 {
286 int i=0;
287 for (;i<=l->nr;i++)
288 {
289 if (l->m[i].rtyp!=DEF_CMD)
290 {
291 PrintNSpaces(spaces);
292 ::Print("[%d]:\n",i+1);
293 l->m[i].Print(NULL,spaces+3);
294 }
295 }
296 }
297 break;
298 }
299
300 default:
301 if (t>MAX_TOK)
302 {
303 blackbox * bb=getBlackboxStuff(t);
304 PrintNSpaces(spaces);
305 if (bb!=NULL) { bb->blackbox_Print(bb,d); }
306 else { ::Print("Print: blackbox %d(bb=NULL)",t); }
307 }
308 else
309 ::Print("Print:unknown type %s(%d)", Tok2Cmdname(t),t);
310 } /* end switch: (Typ()) */
311 if ((store!=NULL)&&(store!=this))
312 store->CleanUp();
313 }
314 if (next!=NULL)
315 {
316 if (t==COMMAND) PrintLn();
317 else if (t!=LIST_CMD) PrintS(" ");
318 next->Print(NULL,spaces);
319 }
320 else if ((t!=LIST_CMD)&&(t!=SMATRIX_CMD))
321 {
322 PrintLn();
323 }
324#ifdef SIQ
325 if (rtyp!=COMMAND)
326#endif
327 {
328 if ((store!=NULL)
329 && (store!=this))
330 {
331 if((t/*Typ()*/!=LINK_CMD)
332 && (t/*Typ()*/!=PACKAGE_CMD)
333 && (t/*Typ()*/!=DEF_CMD)
334 )
335 {
336 store->rtyp=t/*Typ()*/;
337 store->data=CopyD();
338 if(attribute!=NULL)
339 {
340 store->attribute=CopyA();
341 }
342 store->flag=flag;
343 }
344 }
345 }
346}
int p
Definition: cfModGcd.cc:4078
char * String(void *d=NULL, BOOLEAN typed=FALSE, int dim=1)
Called for conversion to string (used by string(..), write(..),..)
Definition: subexpr.cc:761
attr CopyA()
Definition: subexpr.cc:753
void Print(leftv store=NULL, int spaces=0)
Called by type_cmd (e.g. "r;") or as default in jPRINT.
Definition: subexpr.cc:63
#define Print
Definition: emacs.cc:80
const CanonicalForm int s
Definition: facAbsFact.cc:51
const char * iiTwoOps(int t)
Definition: gentable.cc:261
@ LIB_CMD
Definition: grammar.cc:327
@ VECTOR_CMD
Definition: grammar.cc:292
@ RESOLUTION_CMD
Definition: grammar.cc:290
@ RING_CMD
Definition: grammar.cc:281
ideal id_Copy(ideal h1, const ring r)
copy an ideal
void jjNormalizeQRingId(leftv I)
Definition: ipassign.cc:2318
VAR idhdl currRingHdl
Definition: ipid.cc:59
#define hasFlag(A, F)
Definition: ipid.h:112
#define setFlag(A, F)
Definition: ipid.h:113
#define IDPOLY(a)
Definition: ipid.h:130
#define FLAG_QRING
Definition: ipid.h:108
#define IDNUMBER(a)
Definition: ipid.h:132
#define jjNormalizeQRingP(p)
Definition: ipid.h:103
void ipPrint_MA0(matrix m, const char *name)
Definition: ipprint.cc:57
void paPrint(const char *n, package p)
Definition: ipshell.cc:6333
#define pi
Definition: libparse.cc:1145
int lSize(lists L)
Definition: lists.cc:25
void iiWriteMatrix(matrix im, const char *n, int dim, const ring r, int spaces)
set spaces to zero by default
Definition: matpol.cc:827
The main handler for Singular numbers which are suitable for Singular polynomials.
void crPrint(coeffs c)
Definition: number2.cc:25
#define nNormalize(n)
Definition: numbers.h:30
#define TEST_V_QRING
Definition: options.h:133
#define pDelete(p_ptr)
Definition: polys.h:186
void pWrite0(poly p)
Definition: polys.h:309
void PrintNSpaces(const int n)
Definition: reporter.cc:364
void PrintS(const char *s)
Definition: reporter.cc:284
void PrintLn()
Definition: reporter.cc:310
void rWrite(ring r, BOOLEAN details)
Definition: ring.cc:226
void sBucketPrint(sBucket_pt bucket)
Definition: sbuckets.cc:466
sBucket * sBucket_pt
Definition: sbuckets.h:16
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
matrix id_Module2Matrix(ideal mod, const ring R)
ip_package * package
Definition: structs.h:43
const char * piProcinfo(procinfov pi, const char *request)
Definition: ipid.cc:723
procinfo * procinfov
Definition: subexpr.h:66
ssyStrategy * syStrategy
Definition: syz.h:36
void syPrint(syStrategy syzstr, const char *currRingName)
Definition: syz1.cc:1934
@ CRING_CMD
Definition: tok.h:56
@ CNUMBER_CMD
Definition: tok.h:47
@ LINK_CMD
Definition: tok.h:117
@ CPOLY_CMD
Definition: tok.h:48
@ INT_CMD
Definition: tok.h:96
#define UNKNOWN
Definition: tok.h:222

◆ RingDependend()

BOOLEAN sleftv::RingDependend ( )

Definition at line 418 of file subexpr.cc.

419{
420 int rt=Typ();
421 if(::RingDependend(rt))
422 return TRUE;
423 if (rt==LIST_CMD)
424 return lRingDependend((lists)Data());
425 if (this->next!=NULL)
426 return this->next->RingDependend();
427 return FALSE;
428}
BOOLEAN lRingDependend(lists L)
Definition: lists.cc:222

◆ String()

char * sleftv::String ( void *  d = NULL,
BOOLEAN  typed = FALSE,
int  dim = 1 
)

Called for conversion to string (used by string(..), write(..),..)

Definition at line 761 of file subexpr.cc.

762{
763#ifdef SIQ
764 if (rtyp==COMMAND)
765 {
766 ::Print("##command %d\n",((command)data)->op);
767 if (((command)data)->arg1.rtyp!=0)
768 ((command)data)->arg1.Print(NULL,2);
769 if (((command)data)->arg2.rtyp!=0)
770 ((command)data)->arg2.Print(NULL,2);
771 if (((command)data)->arg3.rtyp==0)
772 ((command)data)->arg3.Print(NULL,2);
773 PrintS("##end\n");
774 return omStrDup("");
775 }
776#endif
777 if (d==NULL) d=Data();
778 if (!errorreported)
779 {
780 char *s;
781 int t=Typ();
782 switch (t /*Typ()*/)
783 {
784 case INT_CMD:
785 if (typed)
786 {
787 #if SIZEOF_LONG==8
788 s=(char *)omAlloc(MAX_INT_LEN+17);
789 #else
790 s=(char *)omAlloc(MAX_INT_LEN+7);
791 #endif
792 sprintf(s,"int(%ld)",(long)d);
793 }
794 else
795 {
796 #if SIZEOF_LONG==8
797 s=(char *)omAlloc(MAX_INT_LEN+12);
798 #else
799 s=(char *)omAlloc(MAX_INT_LEN+2);
800 #endif
801 sprintf(s,"%ld",(long)d);
802 }
803 return s;
804
805 case STRING_CMD:
806 if (d == NULL)
807 {
808 if (typed) return omStrDup("\"\"");
809 return omStrDup("");
810 }
811 if (typed)
812 {
813 s = (char*) omAlloc(strlen((char*) d) + 3);
814 sprintf(s,"\"%s\"", (char*) d);
815 return s;
816 }
817 else
818 {
819 return omStrDup((char*)d);
820 }
821
822 case POLY_CMD:
823 case VECTOR_CMD:
824 if (typed)
825 {
826 char* ps = pString((poly) d);
827 s = (char*) omAlloc(strlen(ps) + 10);
828 sprintf(s,"%s(%s)", (t /*Typ()*/ == POLY_CMD ? "poly" : "vector"), ps);
829 omFree(ps);
830 return s;
831 }
832 else
833 return pString((poly)d);
834
835 case CRING_CMD:
836 return nCoeffString((coeffs)d);
837 #ifdef SINGULAR_4_2
838 case CNUMBER_CMD:
839 return n2String((number2)d,typed);
840 case CMATRIX_CMD:
841 {
842 bigintmat *b=(bigintmat*)d;
843 return b->String();
844 }
845 #endif
846
847 case NUMBER_CMD:
848 StringSetS((char*) (typed ? "number(" : ""));
850 {
851 nfShowMipo(currRing->cf);
852 }
853 else
854 {
855 nWrite((number)d);
856 }
857 StringAppendS((char*) (typed ? ")" : ""));
858 return StringEndS();
859
860 case BIGINT_CMD:
861 {
862 StringSetS((char*) (typed ? "bigint(" : ""));
863 number nl=(number)d;
865 StringAppendS((char*) (typed ? ")" : ""));
866 return StringEndS();
867 }
868 case BUCKET_CMD:
869 return sBucketString((sBucket_pt)d);
870 case MATRIX_CMD:
872 if (typed)
873 {
874 char* ns = (char*) omAlloc(strlen(s) + 40);
875 sprintf(ns, "matrix(ideal(%s),%d,%d)", s,
876 ((ideal) d)->nrows, ((ideal) d)->ncols);
877 omCheckAddr(ns);
878 return ns;
879 }
880 else
881 {
882 return omStrDup(s);
883 }
884
885 case IDEAL_CMD:
886 case MAP_CMD:
887 case MODUL_CMD:
888 case SMATRIX_CMD:
890 if (typed)
891 {
892 char* ns = (char*) omAlloc(strlen(s) + 10);
893 if ((t/*Typ()*/==IDEAL_CMD)||(t==MAP_CMD))
894 sprintf(ns, "ideal(%s)", s);
895 else /*MODUL_CMD, SMATRIX_CMD */
896 sprintf(ns, "module(%s)", s);
897 omFree(s);
898 omCheckAddr(ns);
899 return ns;
900 }
901 return s;
902
903 case INTVEC_CMD:
904 case INTMAT_CMD:
905 {
906 intvec *v=(intvec *)d;
907 s = v->String(dim);
908 if (typed)
909 {
910 char* ns;
911 if (t/*Typ()*/ == INTMAT_CMD)
912 {
913 ns = (char*) omAlloc(strlen(s) + 40);
914 sprintf(ns, "intmat(intvec(%s),%d,%d)", s, v->rows(), v->cols());
915 }
916 else
917 {
918 ns = (char*) omAlloc(strlen(s) + 10);
919 sprintf(ns, "intvec(%s)", s);
920 }
921 omCheckAddr(ns);
922 omFree(s);
923 return ns;
924 }
925 else
926 return s;
927 }
928 case BIGINTMAT_CMD:
929 {
930 bigintmat *bim=(bigintmat*)d;
931 s = bim->String();
932 if (typed)
933 {
934 char* ns = (char*) omAlloc0(strlen(s) + 40);
935 sprintf(ns, "bigintmat(bigintvec(%s),%d,%d)", s, bim->rows(), bim->cols());
936 omCheckAddr(ns);
937 return ns;
938 }
939 else
940 return omStrDup(s);
941 }
942
943 case RING_CMD:
944 s = rString((ring)d);
945
946 if (typed)
947 {
948 char* ns;
949 ring r=(ring)d;
950 if (r->qideal!=NULL)
951 {
952 char* id = iiStringMatrix((matrix) ((ring) d)->qideal, dim,
953 currRing);
954 ns = (char*) omAlloc(strlen(s) + strlen(id) + 20);
955 sprintf(ns, "\"%s\";%sideal(%s)", s,(dim == 2 ? "\n" : " "), id);
956 }
957 else
958 {
959 ns = (char*) omAlloc(strlen(s) + 4);
960 sprintf(ns, "\"%s\"", s);
961 }
962 omFree(s);
963 omCheckAddr(ns);
964 return ns;
965 }
966 return s;
967 case RESOLUTION_CMD:
968 {
970 s = lString(l, typed, dim);
971 l->Clean();
972 return s;
973 }
974
975 case PROC_CMD:
976 {
977 procinfo* pi = (procinfo*) d;
978 if((pi->language == LANG_SINGULAR) && (pi->data.s.body!=NULL))
979 s = (pi->data.s.body);
980 else
981 s = (char *)"";
982 if (typed)
983 {
984 char* ns = (char*) omAlloc(strlen(s) + 4);
985 sprintf(ns, "\"%s\"", s);
986 omCheckAddr(ns);
987 return ns;
988 }
989 return omStrDup(s);
990 }
991
992 case LINK_CMD:
993 s = slString((si_link) d);
994 if (typed)
995 {
996 char* ns = (char*) omAlloc(strlen(s) + 10);
997 sprintf(ns, "link(\"%s\")", s);
999 omCheckAddr(ns);
1000 return ns;
1001 }
1002 return s;
1003
1004 case LIST_CMD:
1005 return lString((lists) d, typed, dim);
1006
1007 default:
1008 if(t> MAX_TOK)
1009 {
1010 blackbox *bb=getBlackboxStuff(t);
1011 if (bb!=NULL) return bb->blackbox_String(bb,d);
1012 }
1013 } /* end switch: (Typ()) */
1014 }
1015 return omStrDup("");
1016}
int int ncols
Definition: cf_linsys.cc:32
int nrows
Definition: cf_linsys.cc:32
int cols() const
Definition: bigintmat.h:144
int rows() const
Definition: bigintmat.h:145
char * String()
IO: String returns a singular string containing the matrix, needs freeing afterwards.
Definition: bigintmat.cc:436
static FORCE_INLINE char * nCoeffString(const coeffs cf)
TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar.
Definition: coeffs.h:956
static FORCE_INLINE void n_Write(number n, const coeffs r, const BOOLEAN bShortOut=TRUE)
Definition: coeffs.h:588
void nfShowMipo(const coeffs r)
Show the mininimal polynom.... NOTE: this is used by char * sleftv::String(void *d,...
Definition: ffields.cc:547
lists syConvRes(syStrategy syzstr, BOOLEAN toDel, int add_row_shift)
Definition: ipshell.cc:3182
char * lString(lists l, BOOLEAN typed, int dim)
Definition: lists.cc:403
char * iiStringMatrix(matrix im, int dim, const ring r, char ch)
Definition: matpol.cc:848
const int MAX_INT_LEN
Definition: mylimits.h:13
#define nWrite(n)
Definition: numbers.h:29
#define omAlloc(size)
Definition: omAllocDecl.h:210
#define omAlloc0(size)
Definition: omAllocDecl.h:211
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
char * pString(poly p)
Definition: polys.h:306
void StringSetS(const char *st)
Definition: reporter.cc:128
void StringAppendS(const char *st)
Definition: reporter.cc:107
char * StringEndS()
Definition: reporter.cc:151
char * rString(ring r)
Definition: ring.cc:673
static BOOLEAN rField_is_GF(const ring r)
Definition: ring.h:521
char * sBucketString(sBucket_pt bucket)
Definition: sbuckets.cc:461
@ LANG_SINGULAR
Definition: subexpr.h:22
int dim(ideal I, ring r)

◆ Typ()

int sleftv::Typ ( )

Definition at line 1019 of file subexpr.cc.

1020{
1021 if (e==NULL)
1022 {
1023 switch (rtyp)
1024 {
1025 case IDHDL:
1026 return IDTYP((idhdl)data);
1027 case ALIAS_CMD:
1028 {
1029 idhdl h=(idhdl)data;
1030 return ((idhdl)h->data.ustring)->typ;
1031 }
1032 case VECHO:
1033 case VPRINTLEVEL:
1034 case VCOLMAX:
1035 case VTIMER:
1036 case VRTIMER:
1037 case VOICE:
1038 case VMAXDEG:
1039 case VMAXMULT:
1040 case TRACE:
1041 case VSHORTOUT:
1042 return INT_CMD;
1043 case VMINPOLY:
1044 data=NULL;
1045 return NUMBER_CMD;
1046 case VNOETHER:
1047 data=NULL;
1048 return POLY_CMD;
1049 //case COMMAND:
1050 // return COMMAND;
1051 default:
1052 return rtyp;
1053 }
1054 }
1055 int r=0;
1056 int t=rtyp;
1057 void *d=data;
1058 if (t==IDHDL) t=IDTYP((idhdl)d);
1059 else if (t==ALIAS_CMD)
1060 { idhdl h=(idhdl)IDDATA((idhdl)data); t=IDTYP(h);d=IDDATA(h); }
1061 switch (t)
1062 {
1063#ifdef SINGULAR_4_2
1064 case CMATRIX_CMD:
1065 {
1066 bigintmat *b=(bigintmat*)d;
1067 if ((currRing!=NULL)&&(currRing->cf==b->basecoeffs()))
1068 return NUMBER_CMD;
1069 else
1070 return CNUMBER_CMD;
1071 }
1072#endif
1073 case INTVEC_CMD:
1074 case INTMAT_CMD:
1075 r=INT_CMD;
1076 break;
1077 case BIGINTMAT_CMD:
1078 r=BIGINT_CMD;
1079 break;
1080 case IDEAL_CMD:
1081 case MATRIX_CMD:
1082 case MAP_CMD:
1083 case SMATRIX_CMD:
1084 r=POLY_CMD;
1085 break;
1086 case MODUL_CMD:
1087 r=VECTOR_CMD;
1088 break;
1089 case STRING_CMD:
1090 r=STRING_CMD;
1091 break;
1092 default:
1093 {
1094 blackbox *b=NULL;
1095 if (t>MAX_TOK)
1096 {
1098 }
1099 if ((t==LIST_CMD)||((b!=NULL)&&BB_LIKE_LIST(b)))
1100 {
1101 lists l;
1102 if (rtyp==IDHDL) l=IDLIST((idhdl)d);
1103 else l=(lists)d;
1104 if ((0<e->start)&&(e->start<=l->nr+1))
1105 {
1106 Subexpr tmp=l->m[e->start-1].e;
1107 l->m[e->start-1].e=e->next;
1108 r=l->m[e->start-1].Typ();
1109 e->next=l->m[e->start-1].e;
1110 l->m[e->start-1].e=tmp;
1111 }
1112 else
1113 {
1114 //Warn("out of range: %d not in 1..%d",e->start,l->nr+1);
1115 r=DEF_CMD;
1116 }
1117 }
1118 else
1119 Werror("cannot index type %s(%d)",Tok2Cmdname(t),t);
1120 break;
1121 }
1122 }
1123 return r;
1124}

Field Documentation

◆ attribute

attr sleftv::attribute

Definition at line 89 of file subexpr.h.

◆ data

void* sleftv::data

Definition at line 88 of file subexpr.h.

◆ e

Subexpr sleftv::e

Definition at line 105 of file subexpr.h.

◆ flag

BITSET sleftv::flag

Definition at line 90 of file subexpr.h.

◆ name

const char* sleftv::name

Definition at line 87 of file subexpr.h.

◆ next

leftv sleftv::next

Definition at line 86 of file subexpr.h.

◆ req_packhdl

package sleftv::req_packhdl

Definition at line 106 of file subexpr.h.

◆ rtyp

int sleftv::rtyp

Definition at line 91 of file subexpr.h.


The documentation for this class was generated from the following files: