access to real and imaginary part

{{{ inline functions corresponding to CanonicalForm methods {{{ docu - inline functions corresponding to CanonicalForm methods. These function exist

normalize factors, i.e. make factors monic

void CFMap::newpair ( const Variable & v, const CanonicalForm & s ) * * CFMap::newpair() - insert a MapPair into a CFMap. * **/

2 *returns a re-ordered copy of a polynomial, with permutation of the variables */

//////////////////////////////////////////////////////////////////////// // we must always have this test!?

inline CanonicalForm abs ( const CanonicalForm & f ) * * abs() - return absolute value of `f'. * * The absolute value is defined in terms of the f

//////////////////////////////////////////////////////////////////////// Gets leading monom of bucket, does NOT change Bpoly!!!!! Returned monom is RE

inplace-normalization of n; produces some canonical representation of n; !!! Recommendation: remove this method from the user-interface, i.e., !!!

in-place negation of n MUST BE USED: n = n_InpNeg(n) (no copy is returned)

2 * returns a polynomial representing the number n * destroys n */

2 *enters p at position at in L */

return the difference of 'a' and 'b', i.e., a-b

test whether 'a' is divisible 'b'; for r encoding a field: TRUE iff 'b' does not represent zero in Z: TRUE iff 'b' divides 'a' (with remainder = zero)

manipulations

2 * handle memory request for sets of polynomials (ideals) * l is the length of *p, increment is the difference (may be negative) */

2 * writes a polynomial p to stdout followed by \n */

debug only

unused static void HeadidString(ideal L, char* st) { int i, nL = IDELEMS(L)-1; Print("// The head terms of the ideal %s = ", st); for(i=0; i<n

2 * verschiebt die Indizees der Modulerzeugenden um i */

returns p*q, does neither destroy p nor q

copy an ideal

2 * create a copy of the ring r * used for qring definition,.. * DOES NOT CALL rComplete */

int getNumVars ( const CanonicalForm & f ) * * getNumVars() - get number of polynomial variables in f. * **/

2 *normalize all coefficients */

2 * puts p to the set T at position atT */

return the sum of 'a' and 'b', i.e., a+b

---------------------------------------------------------------------------*/ cleardenom suff