Data Structures | Typedefs | Enumerations | Functions | Variables
subexpr.h File Reference
#include <string.h>
#include <polys/monomials/ring.h>
#include <Singular/grammar.h>
#include <Singular/tok.h>
#include <Singular/attrib.h>

Go to the source code of this file.

Data Structures

class  proc_singular
 
struct  proc_object
 
union  procinfodata
 
class  procinfo
 
struct  Subexpr
 
class  sleftv
 Class used for (list of) interpreter objects. More...
 
class  libstack
 

Typedefs

typedef procinfoprocinfov
 
typedef sleftvleftv
 
typedef libstacklibstackv
 

Enumerations

enum  language_defs {
  LANG_NONE, LANG_TOP, LANG_SINGULAR, LANG_C,
  LANG_MAX
}
 

Functions

const char * iiSleftv2name (leftv v)
 
BOOLEAN RingDependend (int t)
 
void syMake (leftv v, const char *name, package pa=NULL)
 
BOOLEAN assumeStdFlag (leftv h)
 
procinfov piCopy (procinfov pi)
 
BOOLEAN piKill (procinfov l)
 
const char * piProcinfo (procinfov pi, const char *request)
 
void piShowProcinfo (procinfov pi, char *txt)
 
void s_internalDelete (const int t, void *d, const ring r)
 

Variables

const char sNoName []
 
BOOLEAN siq
 
sleftv sLastPrinted
 
omBin sSubexpr_bin
 
omBin procinfo_bin
 
omBin libstack_bin
 

Data Structure Documentation

class proc_singular

Definition at line 21 of file subexpr.h.

Data Fields
char * body
long body_end
int body_lineno
long body_start
long def_end
int example_lineno
long example_start
long help_chksum
long help_end
long help_start
long proc_end
int proc_lineno
long proc_start
union uprocinfodata

Definition at line 44 of file subexpr.h.

Data Fields
struct proc_object o
proc_singular s
class procinfo

Definition at line 52 of file subexpr.h.

Data Fields
procinfodata data
char is_static
language_defs language
char * libname
package pack
char * procname
short ref
char trace_flag
struct _ssubexpr

Definition at line 67 of file subexpr.h.

Data Fields
struct _ssubexpr * next
int start

Typedef Documentation

typedef sleftv* leftv

Definition at line 79 of file subexpr.h.

typedef libstack* libstackv

Definition at line 158 of file subexpr.h.

typedef procinfo* procinfov

Definition at line 65 of file subexpr.h.

Enumeration Type Documentation

Enumerator
LANG_NONE 
LANG_TOP 
LANG_SINGULAR 
LANG_C 
LANG_MAX 

Definition at line 20 of file subexpr.h.

Function Documentation

BOOLEAN assumeStdFlag ( leftv  h)

Definition at line 1455 of file subexpr.cc.

1456 {
1457  if (h->e!=NULL)
1458  {
1459  leftv hh=h->LData();
1460  if (h!=hh) return assumeStdFlag(h->LData());
1461  }
1462  if (!hasFlag(h,FLAG_STD))
1463  {
1464  if (!TEST_VERB_NSB)
1465  {
1466  if (TEST_V_ALLWARN)
1467  Warn("%s is no standard basis in >>%s<<",h->Name(),my_yylinebuf);
1468  else
1469  Warn("%s is no standard basis",h->Name());
1470  }
1471  return FALSE;
1472  }
1473  return TRUE;
1474 }
#define TEST_VERB_NSB
Definition: options.h:129
Class used for (list of) interpreter objects.
Definition: subexpr.h:83
Subexpr e
Definition: subexpr.h:106
#define FALSE
Definition: auxiliary.h:140
#define TRUE
Definition: auxiliary.h:144
const char * Name()
Definition: subexpr.h:121
char my_yylinebuf[80]
Definition: febase.cc:48
BOOLEAN assumeStdFlag(leftv h)
Definition: subexpr.cc:1455
#define FLAG_STD
Definition: ipid.h:108
#define NULL
Definition: omList.c:10
#define hasFlag(A, F)
Definition: ipid.h:111
leftv LData()
Definition: subexpr.cc:1387
#define TEST_V_ALLWARN
Definition: options.h:135
#define Warn
Definition: emacs.cc:80
const char* iiSleftv2name ( leftv  v)

Definition at line 1933 of file subexpr.cc.

1934 {
1935  return(v->name);
1936 }
const char * name
Definition: subexpr.h:88
procinfov piCopy ( procinfov  pi)
inline

Definition at line 149 of file subexpr.h.

150 {
151  pi->ref++;
152  return pi;
153 }
short ref
Definition: subexpr.h:59
#define pi
Definition: libparse.cc:1143
BOOLEAN piKill ( procinfov  l)

Definition at line 647 of file ipid.cc.

648 {
650  while (p!=NULL)
651  {
652  if (p->pi==pi && pi->ref <= 1)
653  {
654  Warn("`%s` in use, can not be killed",pi->procname);
655  return TRUE;
656  }
657  p=p->next;
658  }
659  (pi->ref)--;
660  if (pi->ref <= 0)
661  {
662  if (pi->libname != NULL) // OB: ????
663  omFree((ADDRESS)pi->libname);
664  if (pi->procname != NULL) // OB: ????
665  omFree((ADDRESS)pi->procname);
666 
667  if( pi->language == LANG_SINGULAR)
668  {
669  if (pi->data.s.body != NULL) // OB: ????
670  omFree((ADDRESS)pi->data.s.body);
671  }
672  if( pi->language == LANG_C)
673  {
674  }
675  memset((void *) pi, 0, sizeof(procinfo));
676  pi->language=LANG_NONE;
678  }
679  return FALSE;
680 }
#define FALSE
Definition: auxiliary.h:140
return P p
Definition: myNF.cc:203
#define TRUE
Definition: auxiliary.h:144
void * ADDRESS
Definition: auxiliary.h:161
Definition: fevoices.h:57
Voice * next
Definition: fevoices.h:60
omBin procinfo_bin
Definition: subexpr.cc:51
Definition: subexpr.h:20
procinfo * pi
Definition: fevoices.h:63
#define omFree(addr)
Definition: omAllocDecl.h:261
#define pi
Definition: libparse.cc:1143
#define NULL
Definition: omList.c:10
Voice * currentVoice
Definition: fevoices.cc:57
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
#define Warn
Definition: emacs.cc:80
const char* piProcinfo ( procinfov  pi,
const char *  request 
)

Definition at line 623 of file ipid.cc.

624 {
625  if((pi == NULL)||(pi->language==LANG_NONE)) return "empty proc";
626  else if (strcmp(request, "libname") == 0) return pi->libname;
627  else if (strcmp(request, "procname") == 0) return pi->procname;
628  else if (strcmp(request, "type") == 0)
629  {
630  switch (pi->language)
631  {
632  case LANG_SINGULAR: return "singular"; break;
633  case LANG_C: return "object"; break;
634  case LANG_NONE: return "none"; break;
635  default: return "unknown language";
636  }
637  }
638  else if (strcmp(request, "ref") == 0)
639  {
640  char p[8];
641  sprintf(p, "%d", pi->ref);
642  return omStrDup(p); // MEMORY-LEAK
643  }
644  return "??";
645 }
return P p
Definition: myNF.cc:203
language_defs language
Definition: subexpr.h:58
short ref
Definition: subexpr.h:59
char * procname
Definition: subexpr.h:56
Definition: subexpr.h:20
char * libname
Definition: subexpr.h:55
#define NULL
Definition: omList.c:10
#define omStrDup(s)
Definition: omAllocDecl.h:263
void piShowProcinfo ( procinfov  pi,
char *  txt 
)
BOOLEAN RingDependend ( int  t)
inline

Definition at line 143 of file subexpr.h.

143 { return (BEGIN_RING<t)&&(t<END_RING); }
void s_internalDelete ( const int  t,
void *  d,
const ring  r 
)

Definition at line 478 of file subexpr.cc.

479 {
480  assume(d!=NULL);
481  switch (t)
482  {
483 #ifdef SINGULAR_4_1
484  case CRING_CMD:
485  nKillChar((coeffs)d);
486  break;
487  case CNUMBER_CMD:
488  {
489  number2 n=(number2)d;
490  n2Delete(n);
491  break;
492  }
493  case CMATRIX_CMD: //like BIGINTMAT
494 #endif
495  case BIGINTMAT_CMD:
496  {
497  bigintmat *v=(bigintmat*)d;
498  delete v;
499  break;
500  }
501  case INTVEC_CMD:
502  case INTMAT_CMD:
503  {
504  intvec *v=(intvec*)d;
505  delete v;
506  break;
507  }
508  case MAP_CMD:
509  {
510  map m=(map)d;
511  omFreeBinAddr((ADDRESS)m->preimage);
512  m->preimage=NULL;
513  /* no break: continue as IDEAL*/
514  }
515  case MATRIX_CMD:
516  case IDEAL_CMD:
517  case MODUL_CMD:
518  {
519  ideal i=(ideal)d;
520  id_Delete(&i,r);
521  break;
522  }
523  case STRING_CMD:
524  omFree(d);
525  break;
526  //case PACKAGE_CMD:
527  // return (void *)paCopy((package) d);
528  case PROC_CMD:
529  piKill((procinfo*)d);
530  break;
531  case POLY_CMD:
532  case VECTOR_CMD:
533  {
534  poly p=(poly)d;
535  p_Delete(&p,r);
536  break;
537  }
538  case NUMBER_CMD:
539  {
540  number n=(number)d;
541  n_Delete(&n,r);
542  break;
543  }
544  case BIGINT_CMD:
545  {
546  number n=(number)d;
548  break;
549  }
550  case LIST_CMD:
551  {
552  lists l=(lists)d;
553  l->Clean(r);
554  break;
555  }
556  case LINK_CMD:
557  {
558  si_link l=(si_link)d;
559  slKill(l);
560  break;
561  }
562  case RING_CMD:
563  case QRING_CMD:
564  {
565  ring R=(ring)d;
566  if ((R!=currRing)||(R->ref>=0))
567  rKill(R);
568  #ifdef TEST
569  else
570  Print("currRing? ref=%d\n",R->ref);
571  #endif
572  break;
573  }
574  case RESOLUTION_CMD:
575  {
577  if (s!=NULL) syKillComputation(s,r);
578  break;
579  }
580  case COMMAND:
581  {
582  command cmd=(command)d;
583  if (cmd->arg1.rtyp!=0) cmd->arg1.CleanUp(r);
584  if (cmd->arg2.rtyp!=0) cmd->arg2.CleanUp(r);
585  if (cmd->arg3.rtyp!=0) cmd->arg3.CleanUp(r);
587  break;
588  }
589  case INT_CMD:
590  case DEF_CMD:
591  case ALIAS_CMD:
592  case PACKAGE_CMD:
593  case IDHDL:
594  case NONE:
595  case ANY_TYPE:
596  case VECHO:
597  case VPRINTLEVEL:
598  case VCOLMAX:
599  case VTIMER:
600  case VRTIMER:
601  case VOICE:
602  case VMAXDEG:
603  case VMAXMULT:
604  case TRACE:
605  case VSHORTOUT:
606  case VNOETHER:
607  case VMINPOLY:
608  case LIB_CMD:
609  case 0: /* type in error case */
610  break; /* error recovery: do nothing */
611  //case COMMAND:
612  //case COMMAND:
613  default:
614  {
615  if (t>MAX_TOK)
616  {
617  blackbox *b=getBlackboxStuff(t);
618  if (b!=NULL) b->blackbox_destroy(b,d);
619  break;
620  }
621  else
622  Warn("s_internalDelete: cannot delete type %s(%d)",
623  Tok2Cmdname(t),t);
624  }
625  }
626 }
CanonicalForm map(const CanonicalForm &primElem, const Variable &alpha, const CanonicalForm &F, const Variable &beta)
map from to such that is mapped onto
Definition: cf_map_ext.cc:400
Definition: tok.h:211
const CanonicalForm int s
Definition: facAbsFact.cc:55
Definition: tok.h:207
ip_command * command
Definition: ipid.h:24
#define ANY_TYPE
Definition: tok.h:34
#define Print
Definition: emacs.cc:83
Definition: tok.h:98
Definition: tok.h:208
Definition: lists.h:22
Definition: tok.h:42
return P p
Definition: myNF.cc:203
Matrices of numbers.
Definition: bigintmat.h:51
void n2Delete(number2 &d)
Definition: number2.cc:285
Definition: tok.h:217
void id_Delete(ideal *h, ring r)
deletes an ideal/module/matrix
void * ADDRESS
Definition: auxiliary.h:161
coeffs coeffs_BIGINT
Definition: ipid.cc:54
BOOLEAN piKill(procinfov pi)
Definition: ipid.cc:647
#define IDHDL
Definition: tok.h:35
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:12
Definition: tok.h:212
Definition: tok.h:59
const ring r
Definition: syzextra.cc:208
Definition: intvec.h:14
void rKill(ring r)
Definition: ipshell.cc:6057
Definition: tok.h:61
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
#define omFree(addr)
Definition: omAllocDecl.h:261
#define assume(x)
Definition: mod2.h:405
The main handler for Singular numbers which are suitable for Singular polynomials.
const ring R
Definition: DebugPrint.cc:36
int m
Definition: cfEzgcd.cc:119
int i
Definition: cfEzgcd.cc:123
Definition: tok.h:210
Definition: tok.h:38
static void p_Delete(poly *p, const ring r)
Definition: p_polys.h:849
Definition: tok.h:213
const Variable & v
< [in] a sqrfree bivariate poly
Definition: facBivar.h:37
Definition: tok.h:119
#define NULL
Definition: omList.c:10
slists * lists
Definition: mpr_numeric.h:146
omBin sip_command_bin
Definition: ipid.cc:49
const char * Tok2Cmdname(int tok)
Definition: gentable.cc:128
void Clean(ring r=currRing)
Definition: lists.h:25
Definition: tok.h:120
Definition: tok.h:159
static FORCE_INLINE void n_Delete(number *p, const coeffs r)
delete &#39;p&#39;
Definition: coeffs.h:456
polyrec * poly
Definition: hilb.h:10
#define omFreeBin(addr, bin)
Definition: omAllocDecl.h:259
Definition: tok.h:209
const poly b
Definition: syzextra.cc:213
#define NONE
Definition: tok.h:220
void nKillChar(coeffs r)
undo all initialisations
Definition: numbers.cc:488
void syKillComputation(syStrategy syzstr, ring r=currRing)
Definition: syz1.cc:1497
int l
Definition: cfEzgcd.cc:94
#define COMMAND
Definition: tok.h:33
blackbox * getBlackboxStuff(const int t)
return the structure to the type given by t
Definition: blackbox.cc:20
ssyStrategy * syStrategy
Definition: syz.h:35
#define Warn
Definition: emacs.cc:80
void syMake ( leftv  v,
const char *  name,
package  pa = NULL 
)

Definition at line 1481 of file subexpr.cc.

1482 {
1483  /* resolv an identifier: (to DEF_CMD, if siq>0)
1484  * 1) reserved id: done by scanner
1485  * 2) `basering` / 'Current`
1486  * 3) existing identifier, local
1487  * 4) ringvar, ringpar, local ring
1488  * 5) existing identifier, global
1489  * 6) monom (resp. number), local ring: consisting of:
1490  * 6') ringvar, ringpar,global ring
1491  * 6'') monom (resp. number), local ring
1492  * 7) monom (resp. number), non-local ring
1493  * 8) basering
1494  * 9) `_`
1495  * 10) everything else is of type 0
1496  */
1497 #ifdef TEST
1498  if ((*id<' ')||(*id>(char)126))
1499  {
1500  Print("wrong id :%s:\n",id);
1501  }
1502 #endif
1503  idhdl save_ring=currRingHdl;
1504  v->Init();
1505  if(pa != NULL)
1506  {
1507  v->req_packhdl = pa;
1508  }
1509  else v->req_packhdl = currPack;
1510 // if (v->req_packhdl!=basePack)
1511 // Print("search %s in %s\n",id,v->req_packhdl->libname);
1512  idhdl h=NULL;
1513 #ifdef SIQ
1514  if (siq<=0)
1515 #endif
1516  {
1517  if (!isdigit(id[0]))
1518  {
1519  if (strcmp(id,"basering")==0)
1520  {
1521  if (currRingHdl!=NULL)
1522  {
1523  if (id!=IDID(currRingHdl)) omFreeBinAddr((ADDRESS)id);
1524  h=currRingHdl;
1525  goto id_found;
1526  }
1527  else
1528  {
1529  v->name = id;
1530  return; /* undefined */
1531  }
1532  }
1533  else if (strcmp(id,"Current")==0)
1534  {
1535  if (currPackHdl!=NULL)
1536  {
1537  omFreeBinAddr((ADDRESS)id);
1538  h=currPackHdl;
1539  goto id_found;
1540  }
1541  else
1542  {
1543  v->name = id;
1544  return; /* undefined */
1545  }
1546  }
1547  if(v->req_packhdl!=currPack)
1548  {
1549  h=v->req_packhdl->idroot->get(id,myynest);
1550  }
1551  else
1552  h=ggetid(id);
1553  /* 3) existing identifier, local */
1554  if ((h!=NULL) && (IDLEV(h)==myynest))
1555  {
1556  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1557  goto id_found;
1558  }
1559  }
1561  {
1562  currRingHdl=NULL;
1563  }
1564  /* 4. local ring: ringvar */
1565  if ((currRingHdl!=NULL) && (IDLEV(currRingHdl)==myynest)
1566  /*&& (!yyInRingConstruction)*/)
1567  {
1568  int vnr;
1569  if ((vnr=r_IsRingVar(id, currRing->names,currRing->N))>=0)
1570  {
1571  poly p=pOne();
1572  pSetExp(p,vnr+1,1);
1573  pSetm(p);
1574  v->data = (void *)p;
1575  v->name = id;
1576  v->rtyp = POLY_CMD;
1577  return;
1578  }
1579  if((n_NumberOfParameters(currRing->cf)>0)
1580  &&((vnr=r_IsRingVar(id, (char**)n_ParameterNames(currRing->cf),
1581  n_NumberOfParameters(currRing->cf))>=0)))
1582  {
1583  BOOLEAN ok=FALSE;
1584  poly p = pmInit(id,ok);
1585  if (ok && (p!=NULL))
1586  {
1587  v->data = pGetCoeff(p);
1588  pGetCoeff(p)=NULL;
1589  pLmFree(p);
1590  v->rtyp = NUMBER_CMD;
1591  v->name = id;
1592  return;
1593  }
1594  }
1595  }
1596  /* 5. existing identifier, global */
1597  if (h!=NULL)
1598  {
1599  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1600  goto id_found;
1601  }
1602  /* 6. local ring: number/poly */
1603  if ((currRingHdl!=NULL) && (IDLEV(currRingHdl)==myynest))
1604  {
1605  BOOLEAN ok=FALSE;
1606  /*poly p = (!yyInRingConstruction) ? pmInit(id,ok) : (poly)NULL;*/
1607  poly p = pmInit(id,ok);
1608  if (ok)
1609  {
1610  if (p==NULL)
1611  {
1612  v->data = (void *)nInit(0);
1613  v->rtyp = NUMBER_CMD;
1614  #ifdef HAVE_PLURAL
1615  // in this case we may have monomials equal to 0 in p_Read
1616  v->name = id;
1617  #else
1618  omFreeBinAddr((ADDRESS)id);
1619  #endif
1620  }
1621  else if (pIsConstant(p))
1622  {
1623  v->data = pGetCoeff(p);
1624  pGetCoeff(p)=NULL;
1625  pLmFree(p);
1626  v->rtyp = NUMBER_CMD;
1627  v->name = id;
1628  }
1629  else
1630  {
1631  v->data = p;
1632  v->rtyp = POLY_CMD;
1633  v->name = id;
1634  }
1635  return;
1636  }
1637  }
1638  /* 7. non-local ring: number/poly */
1639  {
1640  BOOLEAN ok=FALSE;
1641  poly p = ((currRing!=NULL) /* ring required */
1642  && (currRingHdl!=NULL)
1643  /*&& (!yyInRingConstruction) - not in decl */
1644  && (IDLEV(currRingHdl)!=myynest)) /* already in case 4/6 */
1645  ? pmInit(id,ok) : (poly)NULL;
1646  if (ok)
1647  {
1648  if (p==NULL)
1649  {
1650  v->data = (void *)nInit(0);
1651  v->rtyp = NUMBER_CMD;
1652  #ifdef HAVE_PLURAL
1653  // in this case we may have monomials equal to 0 in p_Read
1654  v->name = id;
1655  #else
1656  omFreeBinAddr((ADDRESS)id);
1657  #endif
1658  }
1659  else
1660  if (pIsConstant(p))
1661  {
1662  v->data = pGetCoeff(p);
1663  pGetCoeff(p)=NULL;
1664  pLmFree(p);
1665  v->rtyp = NUMBER_CMD;
1666  v->name = id;
1667  }
1668  else
1669  {
1670  v->data = p;
1671  v->rtyp = POLY_CMD;
1672  v->name = id;
1673  }
1674  //if (TEST_V_ALLWARN /*&& (myynest>0)*/
1675  //&& ((r_IsRingVar(id, currRing->names,currRing->N)>=0)
1676  // || ((n_NumberOfParameters(currRing->cf)>0)
1677  // &&(r_IsRingVar(id, (char**)n_ParameterNames(currRing->cf),
1678  // n_NumberOfParameters(currRing->cf))>=0))))
1679  //{
1680  //// WARNING: do not use ring variable names in procedures
1681  // Warn("use of variable >>%s<< in a procedure in line %s",id,my_yylinebuf);
1682  //}
1683  return;
1684  }
1685  }
1686  /* 8. basering ? */
1687  if ((myynest>1)&&(currRingHdl!=NULL))
1688  {
1689  if (strcmp(id,IDID(currRingHdl))==0)
1690  {
1691  if (IDID(currRingHdl)!=id) omFreeBinAddr((ADDRESS)id); /*assume strlen (id) <1000 */
1692  h=currRingHdl;
1693  goto id_found;
1694  }
1695  }
1696  if((v->req_packhdl!=basePack) && (v->req_packhdl==currPack))
1697  {
1698  h=basePack->idroot->get(id,myynest);
1699  if (h!=NULL)
1700  {
1701  if (id!=IDID(h)) omFreeBinAddr((ADDRESS)id); /*assume strlen(id) <1000 */
1702  v->req_packhdl=basePack;
1703  goto id_found;
1704  }
1705  }
1706  }
1707 #ifdef SIQ
1708  else
1709  v->rtyp=DEF_CMD;
1710 #endif
1711  /* 9: _ */
1712  if (strcmp(id,"_")==0)
1713  {
1714  omFreeBinAddr((ADDRESS)id);
1715  v->Copy(&sLastPrinted);
1716  }
1717  else
1718  {
1719  /* 10: everything else */
1720  /* v->rtyp = UNKNOWN;*/
1721  v->name = id;
1722  }
1723  currRingHdl=save_ring;
1724  return;
1725 id_found: // we have an id (in h) found, to set the data in from h
1726  if (IDTYP(h)!=ALIAS_CMD)
1727  {
1728  v->rtyp = IDHDL;
1729  v->flag = IDFLAG(h);
1730  v->attribute=IDATTR(h);
1731  }
1732  else
1733  {
1734  v->rtyp = ALIAS_CMD;
1735  }
1736  v->name = IDID(h);
1737  v->data = (char *)h;
1738  currRingHdl=save_ring;
1739 }
BOOLEAN yyInRingConstruction
Definition: grammar.cc:173
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
Definition: coeffs.h:801
#define pSetm(p)
Definition: polys.h:241
#define Print
Definition: emacs.cc:83
idhdl currPackHdl
Definition: ipid.cc:61
BITSET flag
Definition: subexpr.h:91
#define IDID(a)
Definition: ipid.h:121
#define pSetExp(p, i, v)
Definition: polys.h:42
#define FALSE
Definition: auxiliary.h:140
return P p
Definition: myNF.cc:203
BOOLEAN siq
Definition: subexpr.cc:58
void Init()
Definition: subexpr.h:108
void * ADDRESS
Definition: auxiliary.h:161
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy ...
Definition: monomials.h:51
Definition: idrec.h:34
#define IDHDL
Definition: tok.h:35
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
Definition: coeffs.h:797
void * data
Definition: subexpr.h:89
int myynest
Definition: febase.cc:46
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
Definition: polys.cc:12
#define IDTYP(a)
Definition: ipid.h:118
int r_IsRingVar(const char *n, char **names, int N)
Definition: ring.cc:222
Definition: tok.h:61
const char * name
Definition: subexpr.h:88
#define omFreeBinAddr(addr)
Definition: omAllocDecl.h:258
idhdl currRingHdl
Definition: ipid.cc:65
void Copy(leftv e)
Definition: subexpr.cc:657
#define pIsConstant(p)
like above, except that Comp might be != 0
Definition: polys.h:209
#define pOne()
Definition: polys.h:286
#define IDLEV(a)
Definition: ipid.h:120
Definition: tok.h:38
#define NULL
Definition: omList.c:10
package req_packhdl
Definition: subexpr.h:107
package basePack
Definition: ipid.cc:64
package currPack
Definition: ipid.cc:63
int rtyp
Definition: subexpr.h:92
sleftv sLastPrinted
Definition: subexpr.cc:55
#define IDFLAG(a)
Definition: ipid.h:119
#define pmInit(a, b)
Definition: polys.h:260
#define IDATTR(a)
Definition: ipid.h:122
static void pLmFree(poly p)
frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced ...
Definition: polys.h:70
attr attribute
Definition: subexpr.h:90
polyrec * poly
Definition: hilb.h:10
#define nInit(i)
Definition: numbers.h:24
static Poly * h
Definition: janet.cc:978
int BOOLEAN
Definition: auxiliary.h:131
idhdl ggetid(const char *n, BOOLEAN, idhdl *packhdl)
Definition: ipid.cc:490

Variable Documentation

omBin libstack_bin

Definition at line 52 of file subexpr.cc.

omBin procinfo_bin

Definition at line 51 of file subexpr.cc.

BOOLEAN siq

Definition at line 58 of file subexpr.cc.

sleftv sLastPrinted

Definition at line 55 of file subexpr.cc.

const char sNoName[]

Definition at line 56 of file subexpr.cc.

omBin sSubexpr_bin

Definition at line 49 of file subexpr.cc.