* * First level omCheck routines: dispatch to lower-level omDoCheck * routines which do the actual tests * ***************************************

CanonicalForm bgcd ( const CanonicalForm & f, const CanonicalForm & g ) * * bgcd() - return base coefficient gcd. * * If both f and g are integers

2 *if the leading term of p *divides the leading term of some S[i] it will be canceled */

naive factor recombination as decribed in "Factoring multivariate polynomials over a finite field" by L Bernardin.

helper function

* returns the expected Dimension of the polyhedral output */

* returns the input ideal */

{{{ conversion functions

* a bug in Metrowerks with "lifetime analysis" *scmon hGetpure(scmon p) *{ * scmon p1, pn; * p1 = p + 1; * pn = p1 + (currRing->N); * memcpy(pn, p

2 *returns the next choise of r numbers between beg and end */

2 *initialized a field with r numbers between beg and end for the *procedure idNextChoise */

* * Tail reductions * ***************************************************************/

2 *interreduces F */ old version

CanonicalForm lcm ( const CanonicalForm & f, const CanonicalForm & g ) * * lcm() - return least common multiple of f and g. * * The lcm is calcula

2 *statistics */

mmap for windows */

TODO: make it a virtual method of coeffs, together with: Decompose & Compose, rParameter & rPar

2 * copy a to b */

* Give the largest k, such that a = x * k, b = y * k has * a solution. * a may be NULL, b not */