Givaro
|
Poly1 p-adic. More...
#include <givpoly1padic.h>
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... | |
bool | isUnit (const Rep &x) const |
isUnit | |
bool | isDivisor (const Element &a, const Element &b) const |
isDivisor (a, b) Test if b | a. | |
Arithmetic Operations | |
The first argument is set and is also the return value. | |
Element & | mul (Element &x, const Element &y, const Element &z) const |
x := y*z | |
Element & | div (Element &x, const Element &y, const Element &z) const |
x := y/z | |
Element & | mod (Element &x, const Element &y, const Element &z) const |
x := y mod z | |
Element & | add (Element &x, const Element &y, const Element &z) const |
x := y + z | |
Element & | sub (Element &x, const Element &y, const Element &z) const |
x := y - z | |
Element & | axpy (Element &z, const Element &a, const Element &x, const Element &y) const |
z := a*x + y | |
Element & | maxpy (Element &z, const Element &a, const Element &x, const Element &y) const |
z := y - a*x | |
Element & | maxpyin (Element &z, const Element &a, const Element &x) const |
z := z - a*x | |
Element & | axmy (Element &z, const Element &a, const Element &x, const Element &y) const |
z := a*x - y | |
Element & | axpyin (Element &z, const Element &a, const Element &x) const |
z := a*x + z | |
Element & | axmyin (Element &z, const Element &a, const Element &x) const |
z := a*x - z | |
Element & | neg (Element &x, const Element &y) const |
x := -y | |
Element & | inv (Element &x, const Element &y) const |
x := 1/y | |
Inplace Arithmetic Operations | |
The first argument is modified and the result is the return value. | |
Element & | mulin (Element &x, const Element &y) const |
x := x*y | |
Element & | divin (Element &x, const Element &y) const |
x := x/y | |
Element & | modin (Element &x, const Element &y) const |
x := x mod y | |
Element & | addin (Element &x, const Element &y) const |
x := x + y | |
Element & | subin (Element &x, const Element &y) const |
x := x - y | |
Element & | negin (Element &x) const |
x := -x | |
Element & | invin (Element &x) const |
x := 1/x | |
Comparison Predicates | |
bool | areEqual (const Element &x, const Element &y) const |
x == y | |
Input/Output Operations | |
std::istream & | read (std::istream &is) const |
Read field. More... | |
std::ostream & | write (std::ostream &os, std::string F) const |
Read field. More... | |
Poly1 p-adic.
|
inlineinherited |
Compute the degree of P.
P
constant !! P | polynomial |
|
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.
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. |
|
inlineinherited |
Read field.
is | input stream from which field is read. |
|
inlineinherited |
Read field.
is | input stream from which field is read. |