------------- STL related -------------

TRUE iff 'n' represents the one element

the CanonicalForm G is the output of map_up, returns F considered as an element over \f$ F_{p}(\alpha ) \f$, WARNING: make sure coefficients of F are

CanonicalForm content ( const CanonicalForm & f ) * * content() - return content(f) with respect to main variable. * * Normalizes result. * **/

2 * init operations for coeffs r */

set the mapping function pointers for translating numbers from src to dst

switches **/

return the quotient of 'a' and 'b', i.e., a/b; raises an error if 'b' is not invertible in r exception in Z: raises an error if 'a' is not divisible b

returns p*q, destroys p and q

returns -p, destroys p

component

(r->cf->P)

only used in StringSet(S)/StringAppend(S)*/

\f$ F_{p} (\alpha ) \subset F_{p}(\beta ) \f$ and \f$ \alpha \f$ is a primitive element, returns the image of \f$ \alpha \f$

(r->cf->parameter)

ordered fields: TRUE iff 'n' is positive; in Z/pZ: TRUE iff 0 < m <= roundedBelow(p/2), where m is the long representing n in C: TRUE iff (Im(n) !=

{{{ bool InternalPrimePower::isOne, isZero () const docu: see CanonicalForm::isOne(), CanonicalForm::isZero()

int InternalCF::degree () * @sa CanonicalForm::degree() **/

frees the space of the monomial m, assumes m != NULL coef is not freed, m is not advanced

* factorization over \f$ F_p \f$ or \f$ Q \f$ **/

int totaldegree ( const CanonicalForm & f ) * * totaldegree() - return the total degree of f. * * If f is zero, return -1. If f is in a coefficie

2 *cancels the j-th polynomial in the set */

======================== get general node in list ======================== */

check if poly f contains an algebraic variable a **/

P should be monomial, vector version of poly support(poly p)

TRUE iff 'a' and 'b' represent the same number; they may have different representations

copy the (leading) term of p