1614{
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630#ifdef TEST
1631 if ((*id<' ')||(*id>(char)126))
1632 {
1633 Print(
"wrong id :%s:\n",
id);
1634 }
1635#endif
1639 {
1640 v->req_packhdl =
pa;
1641 }
1643
1644
1646#ifdef SIQ
1648#endif
1649 {
1650 if (id[0]=='#')
1651 {
1653
1655 {
1657 goto id_found;
1658 }
1659 }
1660 else if ((id[0]!='-')&&(id[0]>='@' ))
1661 {
1662 if (strcmp(id,"basering")==0)
1663 {
1665 {
1668 goto id_found;
1669 }
1670 else
1671 {
1673 return;
1674 }
1675 }
1676 else if (strcmp(id,"Current")==0)
1677 {
1679 {
1682 goto id_found;
1683 }
1684 else
1685 {
1687 return;
1688 }
1689 }
1691 {
1692 h=
v->req_packhdl->idroot->get(
id,
myynest);
1693 }
1694 else
1695 {
1697 }
1698
1700 {
1702 goto id_found;
1703 }
1705 {
1707 }
1708
1710 )
1711 {
1712 int vnr;
1714 {
1718 v->data = (
void *)
p;
1721 return;
1722 }
1726 {
1729 if (ok && (
p!=
NULL))
1730 {
1736 return;
1737 }
1738 }
1739 }
1740
1742 {
1744 goto id_found;
1745 }
1746 }
1747 else
1748 {
1749
1751 if (
id[0]==
'-') {
i=1; }
1752 while(isdigit(
id[
i]))
i++;
1754 {
1758 if (strcmp(tmp,id)!=0)
1759 {
1760 number n;
1764 }
1765 else
1766 {
1767 v->data=(
void*)(
long)
j;
1769 }
1771 return;
1772 }
1773 }
1774
1776 {
1778
1780 if (ok)
1781 {
1783 {
1784 v->data = (
void *)
nInit(0);
1786 #ifdef HAVE_PLURAL
1787
1789 #else
1791 #endif
1792 }
1794 {
1800 }
1801 else
1802 {
1804 #ifdef HAVE_SHIFTBBA
1807 {
1809
1810 return;
1811 }
1812 #endif
1815 }
1816 return;
1817 }
1818 }
1819
1820 {
1824
1827 if (ok)
1828 {
1830 {
1831 v->data = (
void *)
nInit(0);
1834 }
1835 else
1837 {
1843 }
1844 else
1845 {
1849 }
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859 return;
1860 }
1861 }
1862
1864 {
1866 {
1869 goto id_found;
1870 }
1871 }
1873 {
1876 {
1879 goto id_found;
1880 }
1881 }
1882 }
1883#ifdef SIQ
1884 else
1886#endif
1887
1888 if (strcmp(id,"_")==0)
1889 {
1892 }
1893 else
1894 {
1895
1896
1898 }
1900 return;
1901id_found:
1903 {
1907 }
1908 else
1909 {
1911 }
1913 v->data = (
char *)
h;
1915}
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