#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

bool	isDivisor (const Rep &P, const Element &Q) const
	isDivisor (a, b) Tests if Q \| P (that is if P mod Q == 0).

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...

Detailed Description

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

Poly1FactorDom.

Constructor & Destructor Documentation

◆ Poly1FactorDom()

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()

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

◆ sqrfree()

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.