1615{
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631#ifdef TEST
1632 if ((*id<' ')||(*id>(char)126))
1633 {
1634 Print(
"wrong id :%s:\n",
id);
1635 }
1636#endif
1640 {
1641 v->req_packhdl =
pa;
1642 }
1644
1645
1647#ifdef SIQ
1649#endif
1650 {
1651 if (id[0]=='#')
1652 {
1654
1656 {
1659 }
1660 }
1661 else if ((id[0]!='-')&&(id[0]>='@' ))
1662 {
1663 if (
strcmp(
id,
"basering")==0)
1664 {
1666 {
1670 }
1671 else
1672 {
1674 return;
1675 }
1676 }
1677 else if (
strcmp(
id,
"Current")==0)
1678 {
1680 {
1684 }
1685 else
1686 {
1688 return;
1689 }
1690 }
1692 {
1693 h=
v->req_packhdl->idroot->get(
id,
myynest);
1694 }
1695 else
1696 {
1698 }
1699
1701 {
1704 }
1706 {
1708 }
1709
1711 )
1712 {
1715 {
1719 v->data = (
void *)
p;
1722 return;
1723 }
1727 {
1730 if (ok && (
p!=
NULL))
1731 {
1737 return;
1738 }
1739 }
1740 }
1741
1743 {
1746 }
1747 }
1748 else
1749 {
1750
1752 if (
id[0]==
'-') {
i=1; }
1755 {
1760 {
1765 }
1766 else
1767 {
1768 v->data=(
void*)(
long)
j;
1770 }
1772 return;
1773 }
1774 }
1775
1777 {
1779
1781 if (ok)
1782 {
1784 {
1785 v->data = (
void *)
nInit(0);
1787 #ifdef HAVE_PLURAL
1788
1790 #else
1792 #endif
1793 }
1795 {
1801 }
1802 else
1803 {
1805 #ifdef HAVE_SHIFTBBA
1808 {
1810
1811 return;
1812 }
1813 #endif
1816 }
1817 return;
1818 }
1819 }
1820
1821 {
1825
1828 if (ok)
1829 {
1831 {
1832 v->data = (
void *)
nInit(0);
1835 }
1836 else
1838 {
1844 }
1845 else
1846 {
1850 }
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860 return;
1861 }
1862 }
1863
1865 {
1867 {
1871 }
1872 }
1874 {
1877 {
1881 }
1882 }
1883 }
1884#ifdef SIQ
1885 else
1887#endif
1888
1890 {
1893 }
1894 else
1895 {
1896
1897
1899 }
1901 return;
1904 {
1908 }
1909 else
1910 {
1912 }
1914 v->data = (
char *)
h;
1916}
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)
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