|
| | CyclotomicTable (Domain &_d, const long expo, const Indeter &X=Indeter()) |
| |
| Element & | getcyclo (Element &res) const |
| |
| void | set_random_irreducible (const Domain &_d, const long expo) |
| |
| void | table_0 (const typename Domain::Residu_t mod, const long expo) |
| |
| void | table_50 (const typename Domain::Residu_t mod, const long expo) |
| |
| void | SplitFactor (Container< Rep, Alloc< Rep > > &L, const Rep &G, Degree d, Residu_t MOD) const |
| |
| void | SplitFactor (Container< Rep, Alloc< Rep > > &L, const Rep &G, Degree d) const |
| |
| Rep & | SplitFactor (Rep &R, const Rep &G, Degree d, Residu_t MOD) const |
| |
| Rep & | SplitFactor (Rep &R, const Rep &G, Degree d) const |
| |
| void | DistinctDegreeFactor (Container< Rep, Alloc< Rep > > &L, const Rep &f, Residu_t MOD) const |
| |
| void | DistinctDegreeFactor (Container< Rep, Alloc< Rep > > &L, const Rep &f) const |
| |
| void | CZfactor (Container< Rep, Alloc< Rep > > &Lf, Container< uint64_t, Alloc< uint64_t > > &Le, const Rep &f, Residu_t MOD) const |
| |
| void | CZfactor (Container< Rep, Alloc< Rep > > &Lf, Container< uint64_t, Alloc< uint64_t > > &Le, const Rep &f) const |
| |
| Rep & | factor (Rep &W, const Rep &P, Residu_t MOD) const |
| |
| Rep & | factor (Rep &W, const Rep &P) const |
| |
| PolyCont & | factor (PolyCont &factors, std::vector< uint64_t > &exp, const Rep &P) |
| |
| bool | is_irreducible (const Rep &P, Residu_t MOD) const |
| |
| bool | is_irreducible (const Rep &P) const |
| |
| bool | is_irreducible2 (const Rep &P, Residu_t MOD) const |
| |
| bool | is_irreducible2 (const Rep &P) const |
| |
| 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
|
| |
| IntegerDom::Element | order (const Rep &P, const Rep &F) const |
| |
| bool | is_prim_root (const Rep &P, const Rep &F) const |
| |
| Rep & | random_prim_root (Rep &P, Rep &R, Degree n) const |
| |
| Rep & | give_random_prim_root (Rep &R, const Rep &F) const |
| |
| Rep & | give_prim_root (Rep &R, const Rep &F) const |
| |
|
| bool | find_irred_binomial (Element &R, Degree n, Residue MOD) const |
| |
| bool | find_irred_binomial (Element &R, Degree n, bool MOD) const |
| |
| bool | find_irred_binomial (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_binomial (Element &R, Degree n, bool MOD, Element IXE) const |
| |
| bool | find_irred_binomial2 (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_binomial2 (Element &R, Degree n, bool MOD, Element IXE) const |
| |
| bool | find_irred_trinomial (Element &R, Degree n, Residue MOD) const |
| |
| bool | find_irred_trinomial (Element &R, Degree n, bool MOD) const |
| |
| bool | find_irred_trinomial (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_trinomial (Element &R, Degree n, bool MOD, Element IXE) const |
| |
| bool | find_irred_trinomial2 (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_trinomial2 (Element &R, Degree n, bool MOD, Element IXE) const |
| |
| bool | find_irred_randomial (Element &R, Degree n, Residue MOD) const |
| |
| bool | find_irred_randomial (Element &R, Degree n, bool MOD) const |
| |
| bool | find_irred_randomial (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_randomial (Element &R, Degree n, bool MOD, Element IXE) const |
| |
| bool | find_irred_randomial2 (Element &R, Degree n, Residue MOD, Element IXE) const |
| |
| bool | find_irred_randomial2 (Element &R, Degree n, bool MOD, Element IXE) const |
| |
template<class
Domain, class Tag>
class Givaro::CyclotomicTable< Domain, Tag >
CyclotomicTable.