include/realroot/polynomial_dual_glue.hpp File Reference

#include <basix/mmx_syntax.hpp>
#include <realroot/ring_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> >

Definition at line 8 of file polynomial_dual_glue.hpp.

Referenced by mmx::univariate::add(), mmx::sparse::add(), mmx::tensor::diff(), mmx::sparse::diff(), mmx::diff(), mmx::univariate::div(), mmx::sparse::div(), mmx::glue_ring_bernstein_tensor_rational(), mmx::glue_ring_monomial_tensor_floating(), mmx::glue_ring_monomial_tensor_integer(), mmx::glue_ring_monomial_tensor_rational(), mmx::glue_ring_sparse_floating(), mmx::glue_ring_sparse_integer(), mmx::glue_ring_sparse_rational(), mmx::sparse::homogenize(), mmx::homogenize(), mmx::univariate::mul(), mmx::sparse::mul(), mmx::polynomial_dual(), mmx::polynomial_resultant(), mmx::polynomial_sparse(), mmx::polynomial_sparse_monomials(), euclidean::pquo(), euclidean::prem(), mmx::sparse::rem(), mmx::ring_sparse_extend_generic(), mmx::sparse::shift(), mmx::univariate::sub(), mmx::sparse::sub(), and sub_resultant< PREM >::subres_gcd().

#define RING   ring<C, Dual,DegRevLex>

Definition at line 6 of file polynomial_dual_glue.hpp.

Referenced by mmx::dual_of(), mmx::ring_bernstein_generic(), mmx::ring_bernstein_of(), mmx::ring_bernstein_string(), mmx::ring_sparse_generic(), mmx::ring_sparse_string(), mmx::ring_tensor_generic(), mmx::ring_tensor_of(), and mmx::ring_tensor_string().

#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.