1571{
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587#ifdef TEST
1588 if ((*id<' ')||(*id>(char)126))
1589 {
1590 Print(
"wrong id :%s:\n",
id);
1591 }
1592#endif
1596 {
1597 v->req_packhdl =
pa;
1598 }
1600
1601
1603#ifdef SIQ
1605#endif
1606 {
1607 if (strcmp(id,"basering")==0)
1608 {
1610 {
1613 goto id_found;
1614 }
1615 else
1616 {
1618 return;
1619 }
1620 }
1621 else if (strcmp(id,"Current")==0)
1622 {
1624 {
1627 goto id_found;
1628 }
1629 else
1630 {
1632 return;
1633 }
1634 }
1636 {
1637 h=
v->req_packhdl->idroot->get(
id,
myynest);
1638 }
1639 else
1640 {
1642 }
1643
1645 {
1647 goto id_found;
1648 }
1650 {
1652 }
1653
1655 )
1656 {
1657 int vnr;
1659 {
1663 v->data = (
void *)
p;
1666 return;
1667 }
1671 {
1674 if (ok && (
p!=
NULL))
1675 {
1681 return;
1682 }
1683 }
1684 }
1685
1687 {
1689 goto id_found;
1690 }
1691
1693 {
1696 if (
id[0]==
'-') {
i=1; }
1697 while(isdigit(
id[
i]))
i++;
1699 {
1702 sprintf(tmp,
"%d",
j);
1704 {
1705 number n;
1709 }
1710 else
1711 {
1712 v->data=(
void*)(
long)
j;
1714 }
1716 return;
1717 }
1718 }
1719
1721 {
1723
1725 if (ok)
1726 {
1728 {
1729 v->data = (
void *)
nInit(0);
1731 #ifdef HAVE_PLURAL
1732
1734 #else
1736 #endif
1737 }
1739 {
1745 }
1746 else
1747 {
1749 #ifdef HAVE_SHIFTBBA
1752 {
1754
1755 return;
1756 }
1757 #endif
1760 }
1761 return;
1762 }
1763 }
1764
1765 {
1769
1772 if (ok)
1773 {
1775 {
1776 v->data = (
void *)
nInit(0);
1779 }
1780 else
1782 {
1788 }
1789 else
1790 {
1794 }
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804 return;
1805 }
1806 }
1807
1809 {
1811 {
1814 goto id_found;
1815 }
1816 }
1818 {
1821 {
1824 goto id_found;
1825 }
1826 }
1827 }
1828#ifdef SIQ
1829 else
1831#endif
1832
1833 if (strcmp(id,"_")==0)
1834 {
1837 }
1838 else
1839 {
1840
1841
1843 }
1845 return;
1846id_found:
1848 {
1852 }
1853 else
1854 {
1856 }
1858 v->data = (
char *)
h;
1860}
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 FORCE_INLINE const char * n_Read(const char *s, number *a, const coeffs r)
!!! Recommendation: This method is too cryptic to be part of the user- !!! interface....
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