1613{
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629#ifdef TEST
1630 if ((*id<' ')||(*id>(char)126))
1631 {
1632 Print(
"wrong id :%s:\n",
id);
1633 }
1634#endif
1638 {
1639 v->req_packhdl =
pa;
1640 }
1642
1643
1645#ifdef SIQ
1647#endif
1648 {
1649 if (id[0]=='#')
1650 {
1652
1654 {
1657 }
1658 }
1659 else if ((id[0]!='-')&&(id[0]>='@' ))
1660 {
1661 if (
strcmp(
id,
"basering")==0)
1662 {
1664 {
1668 }
1669 else
1670 {
1672 return;
1673 }
1674 }
1675 else if (
strcmp(
id,
"Current")==0)
1676 {
1678 {
1682 }
1683 else
1684 {
1686 return;
1687 }
1688 }
1690 {
1691 h=
v->req_packhdl->idroot->get(
id,
myynest);
1692 }
1693 else
1694 {
1696 }
1697
1699 {
1702 }
1704 {
1706 }
1707
1709 )
1710 {
1713 {
1717 v->data = (
void *)
p;
1720 return;
1721 }
1725 {
1728 if (ok && (
p!=
NULL))
1729 {
1735 return;
1736 }
1737 }
1738 }
1739
1741 {
1744 }
1745 }
1746 else
1747 {
1748
1750 if (
id[0]==
'-') {
i=1; }
1753 {
1758 {
1763 }
1764 else
1765 {
1766 v->data=(
void*)(
long)
j;
1768 }
1770 return;
1771 }
1772 }
1773
1775 {
1777
1779 if (ok)
1780 {
1782 {
1783 v->data = (
void *)
nInit(0);
1785 #ifdef HAVE_PLURAL
1786
1788 #else
1790 #endif
1791 }
1793 {
1799 }
1800 else
1801 {
1803 #ifdef HAVE_SHIFTBBA
1806 {
1808
1809 return;
1810 }
1811 #endif
1814 }
1815 return;
1816 }
1817 }
1818
1819 {
1823
1826 if (ok)
1827 {
1829 {
1830 v->data = (
void *)
nInit(0);
1833 }
1834 else
1836 {
1842 }
1843 else
1844 {
1848 }
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858 return;
1859 }
1860 }
1861
1863 {
1865 {
1869 }
1870 }
1872 {
1875 {
1879 }
1880 }
1881 }
1882#ifdef SIQ
1883 else
1885#endif
1886
1888 {
1891 }
1892 else
1893 {
1894
1895
1897 }
1899 return;
1902 {
1906 }
1907 else
1908 {
1910 }
1912 v->data = (
char *)
h;
1914}
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