/Users/mourrain/Devel/mmx/realroot/include/realroot/polynomial_dual_glue.hpp File Reference

#include <basix/mmx_syntax.hpp>
#include <realroot/polynomial_dual.hpp>

Go to the source code of this file.

Namespaces

• namespace mmx

Defines

• #define TMPL   template <class C>
• #define RING   ring<C, Dual,DegRevLex>
• #define RING_POL   ring<C, Sparse,DegRevLex>
• #define Polynomial   polynomial<C, with<Dual,DegRevLex> >

Functions

• template<class C > unsigned hash (const ring< C, Dual, DegRevLex > &p)
• template<class C > unsigned exact_hash (const ring< C, Dual, DegRevLex > &p)
• template<class C > unsigned soft_hash (const ring< C, Dual, DegRevLex > &p)
• template<class C > bool exact_eq (const ring< C, Dual, DegRevLex > &p, const ring< C, Dual, DegRevLex > &q)
• template<class C > bool exact_neq (const ring< C, Dual, DegRevLex > &p, const ring< C, Dual, DegRevLex > &q)
• template<class C > bool operator== (const ring< C, Dual, DegRevLex > &p, const ring< C, Dual, DegRevLex > &q)
• template<class C > bool operator!= (const ring< C, Dual, DegRevLex > &p, const ring< C, Dual, DegRevLex > &q)
• template<class C > syntactic flatten (const ring< C, Dual, DegRevLex > &Rg)
• template<class C > ring< C, Dual, DegRevLex > dual_of (const ring< C, Sparse, DegRevLex > &rg)
• template<class C > ring< C, Dual, DegRevLex > dual_of (const ring< C, Sparse, DegRevLex > &rg, const generic &x)
• template<class C > syntactic flatten (const polynomial< C, with< Dual, DegRevLex > > &p)
• template<class C > polynomial< C, with< Dual,
  DegRevLex > > polynomial_dual (const ring< C, Dual, DegRevLex > &rg, const C &c)
• template<class C > polynomial< C, with< Dual,
  DegRevLex > > polynomial_dual (const ring< C, Dual, DegRevLex > &rg, const C &c, int d, int v)
• template<class C > polynomial< C, with< Dual,
  DegRevLex > > polynomial_dual (const ring< C, Dual, DegRevLex > &rg, const string &s)
• template<class C > polynomial< C, with< Dual,
  DegRevLex > > polynomial_dual (const ring< C, Dual, DegRevLex > &r, const generic &s)
• template<class C > vector< generic > polynomial_dual_coefficients (const polynomial< C, with< Dual, DegRevLex > > &f, const int &v)
• template<class C > vector< generic > polynomial_dual_coefficients (const polynomial< C, with< Dual, DegRevLex > > &p)

---

Define Documentation

#define Polynomial   polynomial<C, with<Dual,DegRevLex> >

Examples:

polynomial_mv_sparse_test.cpp, polynomial_mv_test.cpp, polynomial_with_all_test.cpp, solver_mv_bernstein_binary_test.cpp, solver_mv_bernstein_proj_test.cpp, solver_uv_bernstein_binary_test.cpp, and subresultant_test.cpp.

Definition at line 8 of file polynomial_dual_glue.hpp.

Referenced by mmx::univariate::add(), mmx::tensor::diff(), mmx::univariate::div(), mmx::glue_polynomial_bernstein_rational(), mmx::glue_polynomial_dual_rational(), mmx::glue_polynomial_sparse_floating(), mmx::glue_polynomial_sparse_integer(), mmx::glue_polynomial_sparse_rational(), mmx::glue_polynomial_tensor_floating(), mmx::glue_polynomial_tensor_integer(), mmx::glue_polynomial_tensor_rational(), mmx::univariate::mul(), mmx::polynomial_dual(), euclidean::pquo(), euclidean::prem(), mmx::univariate::sub(), and subresultant< PREM >::subres_gcd().

#define RING   ring<C, Dual,DegRevLex>

Definition at line 6 of file polynomial_dual_glue.hpp.

Referenced by mmx::dual_of().

#define RING_POL   ring<C, Sparse,DegRevLex>

Definition at line 7 of file polynomial_dual_glue.hpp.

#define TMPL   template <class C>

Definition at line 5 of file polynomial_dual_glue.hpp.