in Z: return the gcd of 'a' and 'b' in Z/nZ, Z/2^kZ: computed as in the case Z in Z/pZ, C, R: not implemented in Q: return the gcd of the numerators o

conversion of n to an int; 0 if not possible in Z/pZ: the representing int lying in (-p/2 .. p/2]

2 * try to convert 'inputType' in 'outputType' * return 0 on failure, an index (<>0) on success */

2 * try to convert 'input' of type 'inputType' to 'output' of type 'outputType' * return FALSE on success */

return -1 if no divisor is found number of first divisor, otherwise

define rInternalChar(r) ((r)->cf->ch)

Advances the position to the next term of the polynomial. returns true if the position marker was successfully advanced to the next term which can be

TODO: make special versions for certain rings!

TRUE iff r represents an algebraic extension field

Set the value produced by worker thread

* Returns true if Groebner cone contains w, false otherwise */

ExpVector(pr) = ExpVector(p1) - ExpVector(p2)

* Compare two given intvecs and return 1, if they * * are the same, otherwise 0 * ****************************************

pseudo remainder of F by G with certain factors of LC (g) cancelled

CanonicalForm compress ( const CanonicalForm & f, CFMap & m ) * * compress() - compress the canonical form f. * * Compress the polynomial f such t

Get the value produced by the worker thread, or null if it hasn't been constructed yet.

return a non-negative measure for the complexity of n; return 0 only when n represents zero; (used for pivot strategies in matrix computations with en

Gets the current element in the collection (read and write).

getter @return @a getDelta() returns @a m_delta

returns a ideal according to a set of supports

Returns a (const!) pointer to (const char*) names of parameters