1582{
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598#ifdef TEST
1599 if ((*id<' ')||(*id>(char)126))
1600 {
1601 Print(
"wrong id :%s:\n",
id);
1602 }
1603#endif
1607 {
1608 v->req_packhdl =
pa;
1609 }
1611
1612
1614#ifdef SIQ
1616#endif
1617 {
1618 if (id[0]=='#')
1619 {
1621
1623 {
1625 goto id_found;
1626 }
1627 }
1628 else if ((id[0]!='-')&&(id[0]>='@' ))
1629 {
1630 if (strcmp(id,"basering")==0)
1631 {
1633 {
1636 goto id_found;
1637 }
1638 else
1639 {
1641 return;
1642 }
1643 }
1644 else if (strcmp(id,"Current")==0)
1645 {
1647 {
1650 goto id_found;
1651 }
1652 else
1653 {
1655 return;
1656 }
1657 }
1659 {
1660 h=
v->req_packhdl->idroot->get(
id,
myynest);
1661 }
1662 else
1663 {
1665 }
1666
1668 {
1670 goto id_found;
1671 }
1673 {
1675 }
1676
1678 )
1679 {
1680 int vnr;
1682 {
1686 v->data = (
void *)
p;
1689 return;
1690 }
1694 {
1697 if (ok && (
p!=
NULL))
1698 {
1704 return;
1705 }
1706 }
1707 }
1708
1710 {
1712 goto id_found;
1713 }
1714 }
1715 else
1716 {
1717
1719 if (
id[0]==
'-') {
i=1; }
1720 while(isdigit(
id[
i]))
i++;
1722 {
1726 if (strcmp(tmp,id)!=0)
1727 {
1728 number n;
1732 }
1733 else
1734 {
1735 v->data=(
void*)(
long)
j;
1737 }
1739 return;
1740 }
1741 }
1742
1744 {
1746
1748 if (ok)
1749 {
1751 {
1752 v->data = (
void *)
nInit(0);
1754 #ifdef HAVE_PLURAL
1755
1757 #else
1759 #endif
1760 }
1762 {
1768 }
1769 else
1770 {
1772 #ifdef HAVE_SHIFTBBA
1775 {
1777
1778 return;
1779 }
1780 #endif
1783 }
1784 return;
1785 }
1786 }
1787
1788 {
1792
1795 if (ok)
1796 {
1798 {
1799 v->data = (
void *)
nInit(0);
1802 }
1803 else
1805 {
1811 }
1812 else
1813 {
1817 }
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827 return;
1828 }
1829 }
1830
1832 {
1834 {
1837 goto id_found;
1838 }
1839 }
1841 {
1844 {
1847 goto id_found;
1848 }
1849 }
1850 }
1851#ifdef SIQ
1852 else
1854#endif
1855
1856 if (strcmp(id,"_")==0)
1857 {
1860 }
1861 else
1862 {
1863
1864
1866 }
1868 return;
1869id_found:
1871 {
1875 }
1876 else
1877 {
1879 }
1881 v->data = (
char *)
h;
1883}
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