#include "config.hpp"#include <cstddef>#include "type_traits.hpp"#include "factory.hpp"#include "_utility.hpp"#include "misc.hpp"#include "std_import.hpp"Go to the source code of this file.
Namespaces | |
| namespace | Arageli | 
Defines | |
| #define | ARAGELI_INCLUDE_CPP_WITH_EXPORT_TEMPLATE_POLYALG | 
Functions | |
| template<typename P1, typename P2, typename PQ, typename PR> | |
| void | Arageli::polynom_divide_simple (const P1 &p1, const P2 &p2, PQ &pq, PR &pr) | 
| Division of two univariate polynomials with quotient and remainder.   | |
| template<typename P1, typename P2, typename PQ, typename PR, typename T> | |
| void | Arageli::polynom_pseudodivide_simple (const P1 &p1, const P2 &p2, PQ &pq, PR &pr, T &multiplier) | 
| template<typename P, typename T> | |
| T & | Arageli::polynom_rational_to_int_value (const P &p, T &res) | 
| template<typename Pr, typename Pi, typename X> | |
| void | Arageli::polynom_rational_to_int (const Pr &pr, Pi &pi, const X &x) | 
| template<typename P1, typename P2, typename PQ, typename PR> | |
| void | Arageli::polynom_divide_rational_simple (P1 p1, P2 p2, PQ &pq, PR &pr) | 
| template<typename P1, typename P2, typename PQ, typename PR> | |
| void | Arageli::polynom_divide (const P1 &p1, const P2 &p2, PQ &pq, PR &pr, const type_category::type &) | 
| template<typename P1, typename P2, typename PQ, typename PR> | |
| void | Arageli::polynom_divide (const P1 &p1, const P2 &p2, PQ &pq, PR &pr, const type_category::rational &) | 
| template<typename P1, typename P2, typename PQ, typename PR> | |
| void | Arageli::polynom_divide (const P1 &p1, const P2 &p2, PQ &pq, PR &pr) | 
| template<typename P, typename M> | |
| void | Arageli::sparse_polynom_reduction_mod (P &p, const M &m) | 
| Polynom coefficients reduction modulo m.   | |
| template<typename P> | |
| P::coef_type | Arageli::max_abs_coef (const P &p) | 
| Computes maximum of absolute values of coefficients of polynom p.   | |
| template<typename P> | |
| P::coef_type | Arageli::max_abs_coef_wo_leading (const P &p) | 
| Computes maximum of absolute values of coefficients of polynom p without leading coef.   | |
| template<typename P> | |
| P::coef_type | Arageli::polynom_content (const P &x) | 
| template<typename P> | |
| P | Arageli::polynom_primpart (const P &x) | 
| template<typename T, typename P> | |
| T | Arageli::root_upper_bound_cauchy (const P &p) | 
| template<typename P, typename V> | |
| V & | Arageli::squarefree_factorize_poly_rational (const P &h, V &res) | 
| template<typename P> | |
| P | Arageli::reciprocal_poly (const P &p) | 
Definition in file polyalg.hpp.
| #define ARAGELI_INCLUDE_CPP_WITH_EXPORT_TEMPLATE_POLYALG | 
Definition at line 358 of file polyalg.hpp.
 1.4.7