Poly1 p-adic.
More...
#include <givpoly1padic.h>
|
Rep & | setdegree (Rep &P) const |
| Compute the degree of P.
|
|
size_t & | sqrfree (size_t &Nfact, Rep *Fact, const Rep &P) const |
| Sqrfree decomposition.
|
|
bool | isUnit (const Rep &x) const |
| isUnit
|
|
bool | isDivisor (const Element &a, const Element &b) const |
| isDivisor (a, b) Test if b | a.
|
|
template<class Domain>
class Givaro::Poly1PadicDom< Domain, Dense >
Poly1 p-adic.
◆ 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
-
◆ 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.
- 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 file: