Poly1Dom< Domain, Dense > Class Template Reference

Class Poly1Dom. More...

#include <givpoly1dense.h>

Inheritance diagram for Poly1Dom< Domain, Dense >:

Collaboration diagram for Poly1Dom< Domain, Dense >:

Public Member Functions
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 Givaro::Poly1Dom< Domain, Dense >

Class Poly1Dom.

Member Function Documentation

setdegree()

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

inline

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

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:

• givpoly1dense.h (4.2.0)
• givpoly1addsub.inl (4.2.0)
• givpoly1axpy.inl (4.2.0)
• givpoly1cstor.inl (4.2.0)
• givpoly1cyclo.inl (4.2.0)
• givpoly1gcd.inl (4.2.0)
• givpoly1io.inl (4.2.0)
• givpoly1kara.inl (4.2.0)
• givpoly1misc.inl (4.2.0)
• givpoly1muldiv.inl (4.2.0)
• givpoly1ratrecon.inl (4.2.0)
• givpoly1sqrfree.inl (4.2.0)