| _append_unique(Array< Coefficient > &vals, const Coefficient &value) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _build_affine_factor(size_t nvars, size_t main_var, const Array< size_t > &other_vars, const Array< Coefficient > &base_eval_pts, const Array< Coefficient > &slopes, const Coefficient &base_root) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _build_affine_factor_from_linear_data(size_t nvars, size_t main_var, const Array< size_t > &other_vars, const Array< Coefficient > &base_eval_pts, const Coefficient &main_coeff, const Array< Coefficient > &other_coeffs, const Coefficient &base_constant_term) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _build_eval_point(size_t nvars, size_t main_var, const Array< size_t > &other_vars, const Array< Coefficient > &coords) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _build_interpolation_grid(const Gen_MultiPolynomial &p, const Array< size_t > &other_vars, Coefficient start, Coefficient step, Array< Array< Coefficient > > &grid, size_t &total_points) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _collect_sorted_primitive_factor_groups(const Gen_Polynomial< Coefficient > &u, size_t max_degree, Array< Array< Gen_Polynomial< Coefficient > > > &groups) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _collect_sorted_primitive_linear_factors(const Gen_Polynomial< Coefficient > &u) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _collect_unique_monic_linear_roots(const Gen_Polynomial< Coefficient > &u) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _count_active_vars(const Gen_MultiPolynomial &p, size_t &last_active_var) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _decode_grid_point(const Array< Array< Coefficient > > &grid, size_t flat_index) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _divides_exactly(const Gen_MultiPolynomial &f, const Gen_MultiPolynomial &divisor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| _embed_coeff_poly_as_x_term(const Gen_MultiPolynomial &coeff_poly, size_t nvars, size_t main_var, const Array< size_t > &other_vars, size_t exp) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _embed_univariate(const Gen_Polynomial< Coefficient > &u, size_t nv, const size_t x_var) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _eval_index_for_var(size_t main_var, size_t var) noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _eval_monomial(const Array< Coefficient > &pt, const Array< size_t > &alpha) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| _exact_quotient(const Gen_MultiPolynomial &f, const Gen_MultiPolynomial &divisor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| _expanded_univariate_factors(const Gen_Polynomial< Coefficient > &u) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _factorize_as_univariate_in_var(const Gen_MultiPolynomial &p, size_t active_var) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _interpolated_factors_for_main_var(const Gen_MultiPolynomial &p, size_t main_var, Coefficient grid_start, Coefficient grid_step) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _list_size(const DynList< T > &lst) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| _search_affine_lift_options(const Gen_MultiPolynomial &p, size_t main_var, const Array< size_t > &other_vars, const Array< Array< Coefficient > > &root_options, const Array< Coefficient > &base_eval_pts, const Coefficient &base_root, size_t pos, Array< Coefficient > &slopes, Gen_MultiPolynomial &factor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _substitute_var(const Gen_MultiPolynomial &p, size_t var, const Coefficient &val) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| _try_extract_affine_linear_factor(const Gen_MultiPolynomial &p, Gen_MultiPolynomial &factor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _try_extract_interpolated_factor(const Gen_MultiPolynomial &p, Gen_MultiPolynomial &factor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _try_lift_affine_linear_factor_for_main_var(const Gen_MultiPolynomial &p, size_t main_var, const Array< Coefficient > &base_eval_pts, Gen_MultiPolynomial &factor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| _try_lift_primitive_affine_linear_factor_for_main_var(const Gen_MultiPolynomial &p, size_t main_var, const Array< Coefficient > &base_eval_pts, Gen_MultiPolynomial &factor) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| add_to_coeff(const Array< size_t > &idx, const Coefficient &delta) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| autoreduce_groebner_basis(Array< Gen_MultiPolynomial > basis) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| autoreduced_generators(const Array< Gen_MultiPolynomial > &generators) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| canonical_pair(size_t i, size_t j) noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| Coeff typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | |
| coeff_at(const Array< size_t > &idx) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| coeff_is_zero(const Coefficient &c) noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| coeffs | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | private |
| contains_equal_polynomial(const Array< Gen_MultiPolynomial > &basis, const Gen_MultiPolynomial &p) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| contains_ideal(const Array< Gen_MultiPolynomial > &I_gens, const Array< Gen_MultiPolynomial > &J_gens) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| content() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| degree() const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| degree_in(size_t var) const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| divide_scalar_inplace(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| divmod(const Array< Gen_MultiPolynomial > &divisors) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| enqueue_pair_if_needed(Pair_Queue &queue, Pair_Registry &queued_pairs, const Pair_Candidate &candidate, const Array< Array< size_t > > &leading_monomials, Pair_Registry &zero_pairs, const size_t nvars) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| epsilon() noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| eval(const Array< Coefficient > &pt) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| eval_batch(const Array< Array< Coefficient > > &pts) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| eval_gradient(const Array< Coefficient > &pt) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| eval_hessian(const Array< Coefficient > &pt) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| factor_recombination(Gen_MultiPolynomial f, const Array< Gen_MultiPolynomial > &candidates) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| factorize() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| fit(const Array< std::pair< Array< Coefficient >, Coefficient > > &data, const size_t nvars, const Array< Array< size_t > > &basis) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| fit_parallel(const Array< std::pair< Array< Coefficient >, Coefficient > > &data, size_t nvars, const Array< Array< size_t > > &basis) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| fit_ridge(const Array< std::pair< Array< Coefficient >, Coefficient > > &data, size_t nvars, const Array< Array< size_t > > &basis, Coefficient *lambda_used=nullptr, double *gcv_score=nullptr) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| fit_weighted(const Array< std::pair< Array< Coefficient >, Coefficient > > &data, size_t nvars, const Array< Array< size_t > > &basis, const Array< Coefficient > &weights) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| for_each_term(Op &&op) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| for_each_term_desc(Op &&op) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| from_binary(std::istream &in) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| from_json(const std::string &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| Gen_MultiPolynomial()=default | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | |
| Gen_MultiPolynomial(const size_t nvars, const Coefficient &c=Coefficient{}) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineexplicit |
| Gen_MultiPolynomial(const size_t nvars, const Array< size_t > &idx, const Coefficient &c) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| Gen_MultiPolynomial(const size_t nvars, const DynList< std::pair< Array< size_t >, Coefficient > > &ts) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| Gen_MultiPolynomial(const size_t nvars, std::initializer_list< std::pair< Array< size_t >, Coefficient > > ts) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| gradient() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| groebner_basis(const Array< Gen_MultiPolynomial > &generators) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| hessian() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| homomorphic_eval(size_t keep_var, const Array< Coefficient > &eval_pts) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| ideal_member(const Gen_MultiPolynomial &f, const Array< Gen_MultiPolynomial > &generators) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| ideal_power(const Array< Gen_MultiPolynomial > &gens, size_t n) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| ideal_product(const Array< Gen_MultiPolynomial > &a, const Array< Gen_MultiPolynomial > &b) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| ideal_sum(const Array< Gen_MultiPolynomial > &a, const Array< Gen_MultiPolynomial > &b) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| ideals_equal(const Array< Gen_MultiPolynomial > &I_gens, const Array< Gen_MultiPolynomial > &J_gens) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| Index typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | |
| interpolate(const Array< Array< Coefficient > > &grid, const Array< Coefficient > &values, size_t nvars) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| is_constant() const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| is_zero() const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| lcm_pair_less(const Pair_Candidate &lhs, const Pair_Candidate &rhs) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| leading_coeff() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| leading_monomial() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| leading_monomials_coprime(const Array< size_t > &a, const Array< size_t > &b, const size_t nvars) noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| leading_term() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| make_monic_inplace(Gen_MultiPolynomial &p) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| make_pair_candidate(size_t i, size_t j, const Array< Array< size_t > > &leading_monomials, size_t nvars) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| minimize_groebner_basis(Array< Gen_MultiPolynomial > basis) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| monomial(size_t nvars, const Array< size_t > &idx, const Coefficient &c=Coefficient(1)) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| norm(const Array< size_t > &idx) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivate |
| num_terms() const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| num_vars() const noexcept | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| nvars_ | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | private |
| operator!=(const Gen_MultiPolynomial &q) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator()(const Array< Coefficient > &pt) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator*(const Gen_MultiPolynomial &q) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator*(const Coefficient &s) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator*=(const Gen_MultiPolynomial &q) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator*=(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator+(const Gen_MultiPolynomial &q) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator+(const Coefficient &s) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator+=(const Gen_MultiPolynomial &q) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator+=(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator-(const Gen_MultiPolynomial &q) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator-(const Coefficient &s) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator-() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator-=(const Gen_MultiPolynomial &q) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator-=(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator/(const Coefficient &s) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator/=(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| operator==(const Gen_MultiPolynomial &q) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| Order typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | |
| pair_is_recorded(const Pair_Registry &pairs, size_t i, size_t j) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| pair_is_zero_known(const Pair_Registry &zero_pairs, size_t i, size_t j) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| Pair_Key typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | private |
| Pair_Queue typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | private |
| Pair_Registry typedef | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | private |
| partial(size_t var, size_t n=1) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| pop_best_pair(Pair_Queue &queue, Pair_Registry &queued_pairs) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| pow(size_t n) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| primitive_part() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| promote(size_t new_nv) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| radical_member(const Gen_MultiPolynomial &f, const Array< Gen_MultiPolynomial > &gens) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| rebuild_groebner_pair_state(const Array< Gen_MultiPolynomial > &basis, Array< Array< size_t > > &leading_monomials, Pair_Queue &queue, Pair_Registry &queued_pairs, Pair_Registry &zero_pairs) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| reduce_modulo(const Array< Gen_MultiPolynomial > &divisors) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| reduced_groebner_basis(const Array< Gen_MultiPolynomial > &generators) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| redundant_pair_by_chain_criterion(const Pair_Candidate &candidate, const Array< Array< size_t > > &leading_monomials, const Pair_Registry &zero_pairs, const size_t nvars) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| remove_zero_and_duplicates(const Array< Gen_MultiPolynomial > &basis) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlineprivatestatic |
| remove_zeros() | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| s_poly(const Gen_MultiPolynomial &f, const Gen_MultiPolynomial &g) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
| scale_inplace(const Coefficient &s) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| terms() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| to_binary(std::ostream &out) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| to_json() const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| to_str(const DynList< std::string > &names=DynList< std::string >()) const | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inline |
| variable(size_t nvars, const size_t var) | Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder > | inlinestatic |
1.9.8