get a single variable exponent @Note: the integer VarOffset encodes: 1. the position of a variable in the exponent vector p->exp (lower 24 bits) 2. nu

* level() returns the level of CO. For a list of the levels and * their meanings, see cf_defs.h. * * @sa InternalCF::level(), InternalCF::variable

delete 'p'

deletes *p, and sets *p to NULL

exponentiation **/

* mvar() returns the main variable of CO or Variable() if CO is * in a base domain. * * @sa InternalCF::level(), InternalCF::variable(), * Interna

CF_INLINE int CFIterator::exp () const * * exp() - return exponent of current term of CO. * * CO has to point to a valid term. * **/

initialise an ideal / module

#define rVar(r) (r->N)

set a single variable exponent @Note: VarOffset encodes the position in p->exp @see p_GetExp

a number representing i in the given coeff field/ring r

* * Misc stuff * ***************************************************************/ 2 * returns the length of a polynomial (numbers of monomials) */

Setm

returns a copy of p

deletes an ideal/module/matrix

returns p+q, destroys p and q

CanonicalForm InternalCF::coeff ( int i ) * @sa CanonicalForm::operator []() **/

selectors CF_INLINE int CFIterator::hasTerms () const * * hasTerm() - check whether CO points to a valid term. * * Return true if CO points to a v

2 * returns a polynomial representing the integer i */

switches **/

gives an ideal/module the minimal possible size

we must always have this test!

switches **/

return a copy of 'n'

bool fdivides ( const CanonicalForm & f, const CanonicalForm & g ) * * * fdivides() - check whether `f' divides `g'. * * Returns true iff `f' div

returns true if h is the zero ideal

2 * an optimized version of p_ISet for the special case 1 */

TRUE iff 'n' represents the zero element

rowIterator; std::vector<Vector<typ> >::iterator rowsBegin(){return rows.begin();} std::vector<Vector<typ> >::iterator rowsEnd(){return rows.end();}

* * swapvar() - swap variables x1 and x2 in f. * * Returns the image of f under the map which maps x1 to x2 and * x2 to x1. This is done quite ef

return the product of 'a' and 'b', i.e., a*b

int size ( const CanonicalForm & f, const Variable & v ) * * size() - count number of monomials of f with level higher * or equal than level of v

create a r x c zero-matrix

CanonicalForm bCommonDen ( const CanonicalForm & f ) * * * bCommonDen() - calculate multivariate common denominator of * coefficients of `f'. *