#include <givpoly1factor.h>

Inheritance diagram for Poly1FactorDom< Domain, Tag, RandomIterator >:

Collaboration diagram for Poly1FactorDom< Domain, Tag, RandomIterator >:

Public Member Functions
	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

	Poly1FactorDom (const Domain &d, const Indeter &X=Indeter(), const RandomIterator &g=RandomIterator())

Element &	random_irreducible (Element &P, Degree n) const
	random irreducible polynomial

Element &	creux_random_irreducible (Element &P, Degree n) const
	random irreducible polynomial tries to be sparse

Element &	ixe_irreducible (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Element &	ixe_irreducible2 (Element &R, Degree n) const
	random irreducible polynomial with X as primitive root

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

Rep &	setdegree (Rep &P) const
	Compute the degree of P. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

size_t &	sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const
	Sqrfree decomposition. More...

Detailed Description

template<class Domain, class Tag = Dense, class RandomIterator = GivRandom>
class Givaro::Poly1FactorDom< Domain, Tag, RandomIterator >

Poly1FactorDom.

Examples: examples/Integer/ModularSquareRoot.C, examples/Polynomial/isirred.C, examples/Polynomial/isprimitive.C, examples/Polynomial/pol_eval.C, and examples/Polynomial/pol_factor.C.

Constructor & Destructor Documentation

◆ Poly1FactorDom() [1/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [2/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [3/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [4/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [5/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [6/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [7/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [8/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [9/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [10/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [11/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [12/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [13/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [14/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [15/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [16/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [17/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [18/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [19/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [20/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [21/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [22/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [23/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [24/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [25/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [26/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [27/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [28/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [29/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [30/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [31/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [32/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [33/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [34/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [35/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [36/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [37/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [38/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [39/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [40/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

◆ Poly1FactorDom() [41/41]

Poly1FactorDom	(	const Domain &	d,
		const Indeter &	X = `Indeter()`,
		const RandomIterator &	g = `RandomIterator()`
	)

inline

Warning: there is a copy of the random Iterator ...

Member Function Documentation

◆ setdegree() [1/41]

Poly1Dom< Domain, Dense >::Rep & setdegree ( Rep & P ) const

inlineinherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [2/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [3/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [4/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [5/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [6/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [7/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [8/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [9/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [10/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [11/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [12/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [13/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [14/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [15/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [16/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [17/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [18/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [19/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [20/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [21/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [22/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [23/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [24/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [25/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [26/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [27/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [28/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [29/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [30/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [31/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [32/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [33/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [34/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [35/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [36/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [37/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [38/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [39/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [40/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ setdegree() [41/41]

Rep & setdegree ( Rep & P ) const

inherited

Compute the degree of P.

Warning: this is an infamous function that may not leave P constant !!

Parameters

P	polynomial

◆ sqrfree() [1/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [2/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [3/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [4/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [5/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [6/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [7/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [8/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [9/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [10/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [11/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [12/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [13/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [14/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [15/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [16/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [17/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [18/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [19/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [20/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [21/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [22/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [23/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [24/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [25/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [26/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [27/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [28/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [29/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [30/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [31/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [32/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [33/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [34/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [35/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [36/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [37/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [38/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [39/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [40/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

◆ sqrfree() [41/41]

size_t & sqrfree	(	size_t &	Nfact,
		Rep *	Fact,
		const Rep &	P
	)		const

inherited

Sqrfree decomposition.

Decompose P such that: P = Fact[0]^0 * Fact[1]^1 * ... * Fact[P.degree()]^(P.degree()), with Fact[0] the leading coefficient. The array Fact must be allocated before calling the function. The size of Fact must be degP+1 is all factors should be computed. For more readeable version of the algorithm, see Geddes, p342.

Parameters

Nfact	[in] the size of Fact
Fact	[in] an array of dimension Nfact
Nfact	[out] is the number of factor in the sqrfree decomposition
Fact	[out] contains at most Nfact factors of the decomposition.
P	rep.

The documentation for this class was generated from the following files:

givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givaro/givpoly1factor.h (4.1.1)
givaro/givpoly1factor.h (4.1.1)
givpoly1factor.h (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givaro/givpoly1factor.inl (4.1.1)
givaro/givaro/givpoly1proot.inl (4.1.1)
givaro/givpoly1factor.inl (4.1.1)
givaro/givpoly1proot.inl (4.1.1)
givpoly1factor.inl (4.1.1)
givpoly1proot.inl (4.1.1)

Public Member Functions

Detailed Description

Constructor & Destructor Documentation

◆ Poly1FactorDom() [1/41]

◆ Poly1FactorDom() [2/41]

◆ Poly1FactorDom() [3/41]

◆ Poly1FactorDom() [4/41]

◆ Poly1FactorDom() [5/41]

◆ Poly1FactorDom() [6/41]

◆ Poly1FactorDom() [7/41]

◆ Poly1FactorDom() [8/41]

◆ Poly1FactorDom() [9/41]

◆ Poly1FactorDom() [10/41]

◆ Poly1FactorDom() [11/41]

◆ Poly1FactorDom() [12/41]

◆ Poly1FactorDom() [13/41]

◆ Poly1FactorDom() [14/41]

◆ Poly1FactorDom() [15/41]

◆ Poly1FactorDom() [16/41]

◆ Poly1FactorDom() [17/41]

◆ Poly1FactorDom() [18/41]

◆ Poly1FactorDom() [19/41]

◆ Poly1FactorDom() [20/41]

◆ Poly1FactorDom() [21/41]

◆ Poly1FactorDom() [22/41]

◆ Poly1FactorDom() [23/41]

◆ Poly1FactorDom() [24/41]

◆ Poly1FactorDom() [25/41]

◆ Poly1FactorDom() [26/41]

◆ Poly1FactorDom() [27/41]

◆ Poly1FactorDom() [28/41]

◆ Poly1FactorDom() [29/41]

◆ Poly1FactorDom() [30/41]

◆ Poly1FactorDom() [31/41]

◆ Poly1FactorDom() [32/41]

◆ Poly1FactorDom() [33/41]

◆ Poly1FactorDom() [34/41]

◆ Poly1FactorDom() [35/41]

◆ Poly1FactorDom() [36/41]

◆ Poly1FactorDom() [37/41]

◆ Poly1FactorDom() [38/41]

◆ Poly1FactorDom() [39/41]

◆ Poly1FactorDom() [40/41]

◆ Poly1FactorDom() [41/41]

Member Function Documentation

◆ setdegree() [1/41]

◆ setdegree() [2/41]

◆ setdegree() [3/41]

◆ setdegree() [4/41]

◆ setdegree() [5/41]

◆ setdegree() [6/41]

◆ setdegree() [7/41]

◆ setdegree() [8/41]

◆ setdegree() [9/41]

◆ setdegree() [10/41]

◆ setdegree() [11/41]

◆ setdegree() [12/41]

◆ setdegree() [13/41]

◆ setdegree() [14/41]

◆ setdegree() [15/41]

◆ setdegree() [16/41]

◆ setdegree() [17/41]

◆ setdegree() [18/41]

◆ setdegree() [19/41]

◆ setdegree() [20/41]

◆ setdegree() [21/41]

◆ setdegree() [22/41]

◆ setdegree() [23/41]

◆ setdegree() [24/41]

◆ setdegree() [25/41]

◆ setdegree() [26/41]

◆ setdegree() [27/41]

◆ setdegree() [28/41]

◆ setdegree() [29/41]

◆ setdegree() [30/41]

◆ setdegree() [31/41]

◆ setdegree() [32/41]

◆ setdegree() [33/41]

◆ setdegree() [34/41]

◆ setdegree() [35/41]