1563{
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578#ifdef TEST
1579 if ((*id<' ')||(*id>(char)126))
1580 {
1581 Print(
"wrong id :%s:\n",
id);
1582 }
1583#endif
1587 {
1588 v->req_packhdl =
pa;
1589 }
1591
1592
1594#ifdef SIQ
1596#endif
1597 {
1598 if (strcmp(id,"basering")==0)
1599 {
1601 {
1604 goto id_found;
1605 }
1606 else
1607 {
1609 return;
1610 }
1611 }
1612 else if (strcmp(id,"Current")==0)
1613 {
1615 {
1618 goto id_found;
1619 }
1620 else
1621 {
1623 return;
1624 }
1625 }
1627 {
1628 h=
v->req_packhdl->idroot->get(
id,
myynest);
1629 }
1630 else
1631 {
1633 }
1634
1636 {
1638 goto id_found;
1639 }
1641 {
1643 }
1644
1646 )
1647 {
1648 int vnr;
1650 {
1654 v->data = (
void *)
p;
1657 return;
1658 }
1662 {
1665 if (ok && (
p!=
NULL))
1666 {
1672 return;
1673 }
1674 }
1675 }
1676
1678 {
1680 goto id_found;
1681 }
1682
1684 {
1686
1688 if (ok)
1689 {
1691 {
1692 v->data = (
void *)
nInit(0);
1694 #ifdef HAVE_PLURAL
1695
1697 #else
1699 #endif
1700 }
1702 {
1708 }
1709 else
1710 {
1712 #ifdef HAVE_SHIFTBBA
1715 {
1717
1718 return;
1719 }
1720 #endif
1723 }
1724 return;
1725 }
1726 }
1727
1728 {
1732
1735 if (ok)
1736 {
1738 {
1739 v->data = (
void *)
nInit(0);
1742 }
1743 else
1745 {
1751 }
1752 else
1753 {
1757 }
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767 return;
1768 }
1769 }
1770
1772 {
1774 {
1777 goto id_found;
1778 }
1779 }
1781 {
1784 {
1787 goto id_found;
1788 }
1789 }
1790 }
1791#ifdef SIQ
1792 else
1794#endif
1795
1796 if (strcmp(id,"_")==0)
1797 {
1800 }
1801 else
1802 {
1803
1804
1806 }
1808 return;
1809id_found:
1811 {
1815 }
1816 else
1817 {
1819 }
1821 v->data = (
char *)
h;
1823}
static FORCE_INLINE char const ** n_ParameterNames(const coeffs r)
Returns a (const!) pointer to (const char*) names of parameters.
static FORCE_INLINE int n_NumberOfParameters(const coeffs r)
Returns the number of parameters.
static BOOLEAN pa(leftv res, leftv args)
VAR BOOLEAN yyInRingConstruction
idhdl ggetid(const char *n)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy
static void p_LmDelete(poly p, const ring r)
static long p_Totaldegree(poly p, const ring r)
#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
int r_IsRingVar(const char *n, char **names, int N)
INST_VAR sleftv sLastPrinted