| _integer_exact_quot(const Gen_Polynomial &a, const Gen_Polynomial &b) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| add_scaled_shifted(const Gen_Polynomial &src, const Coefficient &scale, size_t shift=0) | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| add_to_coeff(size_t exp, const Coefficient &delta) | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| bisect_root(Coefficient a, Coefficient b, Coefficient tol=Coefficient(1e-12), size_t max_iter=200) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| cauchy_bound() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| Coeff typedef | Aleph::Gen_Polynomial< Coefficient > | |
| coeff_at(size_t exp) const | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| coeff_is_zero(const Coefficient &c) noexcept | Aleph::Gen_Polynomial< Coefficient > | inlineprivatestatic |
| coeff_ptr(size_t exp) noexcept | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| coeff_ptr(size_t exp) const noexcept | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| coefficients() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| coeffs | Aleph::Gen_Polynomial< Coefficient > | private |
| compose(const Gen_Polynomial &q) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| content() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| count_all_real_roots() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| count_real_roots(const Coefficient &a, const Coefficient &b) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| definite_integral(const Coefficient &a, const Coefficient &b) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| degree() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| derivative() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| divide_by_monic_linear_mod(const Gen_Polynomial &f, Coefficient root, Coefficient mod) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| divide_scalar_inplace(const Coefficient &s) | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| divmod(const Gen_Polynomial &d) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| epsilon() noexcept | Aleph::Gen_Polynomial< Coefficient > | inlineprivatestatic |
| eval(const Coefficient &x) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| eval_mod_u64(const Gen_Polynomial &f, uint64_t x, uint64_t mod) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| exponents() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| factor_mod_p(const Gen_Polynomial &f, Coefficient p) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| factorize() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| for_each_term(Op &&op) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| for_each_term_desc(Op &&op) const | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| from_roots(const DynList< Coefficient > &roots) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| gcd(Gen_Polynomial a, Gen_Polynomial b) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| Gen_Polynomial()=default | Aleph::Gen_Polynomial< Coefficient > | |
| Gen_Polynomial(const Coefficient &c) | Aleph::Gen_Polynomial< Coefficient > | inlineexplicit |
| Gen_Polynomial(const Coefficient &c, size_t exp) | Aleph::Gen_Polynomial< Coefficient > | inline |
| Gen_Polynomial(std::initializer_list< Coefficient > il) | Aleph::Gen_Polynomial< Coefficient > | inline |
| Gen_Polynomial(const DynList< Coefficient > &l) | Aleph::Gen_Polynomial< Coefficient > | inlineexplicit |
| Gen_Polynomial(const DynList< std::pair< size_t, Coefficient > > &term_list) | Aleph::Gen_Polynomial< Coefficient > | inlineexplicit |
| get_coeff(size_t exp) const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| has_term(size_t exp) const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| hensel_lift(const Gen_Polynomial &f, DynList< Gen_Polynomial > factors, Coefficient p, size_t levels) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| horner_eval(const Coefficient &x) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| integer_gcd(Gen_Polynomial a, Gen_Polynomial b) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| integral(const Coefficient &C=Coefficient{}) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| interpolate(const DynList< std::pair< Coefficient, Coefficient > > &points) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| is_constant() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| is_monic() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| is_monomial() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| is_zero() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| lcm(const Gen_Polynomial &a, const Gen_Polynomial &b) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| leading_coeff() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| mignotte_bound() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| multi_eval(const DynList< Coefficient > &points) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| multiply_by_monic_linear(const Coefficient &c) const | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| negate_arg() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| newton_root(Coefficient x0, Coefficient tol=Coefficient(1e-12), size_t max_iter=100) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| nth_derivative(size_t n) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| num_terms() const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| one() | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| operator!=(const Gen_Polynomial &q) const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator%(const Gen_Polynomial &d) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator%=(const Gen_Polynomial &d) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator()(const Coefficient &x) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator*(const Gen_Polynomial &q) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator*(const Coefficient &s) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator*=(const Gen_Polynomial &q) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator*=(const Coefficient &s) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator+(const Gen_Polynomial &q) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator+(const Coefficient &c) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator+=(const Gen_Polynomial &q) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator+=(const Coefficient &c) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator-() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator-(const Gen_Polynomial &q) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator-(const Coefficient &c) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator-=(const Gen_Polynomial &q) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator-=(const Coefficient &c) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator/(const Coefficient &s) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator/(const Gen_Polynomial &d) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator/=(const Coefficient &s) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator/=(const Gen_Polynomial &d) | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator==(const Gen_Polynomial &q) const noexcept | Aleph::Gen_Polynomial< Coefficient > | inline |
| operator[](size_t exp) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| positive_divisors(Coefficient value) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| pow(size_t n) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| primitive_part() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| pseudo_divmod(const Gen_Polynomial &d) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| reduce_coeffs_mod(const Gen_Polynomial &f, Coefficient mod) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| remove_zeros() | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| reverse() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| scale_inplace(const Coefficient &s) | Aleph::Gen_Polynomial< Coefficient > | inlineprivate |
| set_coeff(size_t exp, const Coefficient &c) | Aleph::Gen_Polynomial< Coefficient > | inline |
| shift(const Coefficient &k) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| shift_down(size_t k) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| shift_up(size_t k) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| sign_variations() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| sparse_eval(const Coefficient &x) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| square_free() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| sturm_chain() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| sturm_sign_changes(const DynList< Gen_Polynomial > &chain, const Coefficient &x) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| Term typedef | Aleph::Gen_Polynomial< Coefficient > | private |
| terms_list() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| to_dense() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| to_monic() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| to_str(const std::string &var="x") const | Aleph::Gen_Polynomial< Coefficient > | inline |
| truncate(size_t n) const | Aleph::Gen_Polynomial< Coefficient > | inline |
| try_divide_by_linear_factor(const Gen_Polynomial &f, Coefficient a, Coefficient b, Gen_Polynomial "ient) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| try_exact_candidate_division(const Gen_Polynomial &f, const Gen_Polynomial &candidate, Gen_Polynomial "ient) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| try_extract_primitive_cubic_factor(const Gen_Polynomial &f, Gen_Polynomial &factor, Gen_Polynomial "ient) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| try_extract_primitive_quadratic_factor(const Gen_Polynomial &f, Gen_Polynomial &factor, Gen_Polynomial "ient) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| try_extract_rational_linear_factor(const Gen_Polynomial &f, Gen_Polynomial &factor, Gen_Polynomial "ient) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| x_to(size_t n) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| xgcd(Gen_Polynomial a, Gen_Polynomial b) | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |
| yun_sfd() const | Aleph::Gen_Polynomial< Coefficient > | inline |
| zero() | Aleph::Gen_Polynomial< Coefficient > | inlinestatic |