#include <basix/mmx_syntax.hpp>
#include <numerix/kernel.hpp>
#include <realroot/ring_sparse.hpp>
#include <realroot/polynomial_glue.hpp>
Go to the source code of this file.
|
| TMPL unsigned | mmx::hash (const RING &p) |
| |
| TMPL unsigned | mmx::exact_hash (const RING &p) |
| |
| TMPL unsigned | mmx::soft_hash (const RING &p) |
| |
| TMPL bool | mmx::exact_eq (const RING &p, const RING &q) |
| |
| TMPL bool | mmx::exact_neq (const RING &p, const RING &q) |
| |
| TMPL bool | mmx::operator== (const RING &p, const RING &q) |
| |
| TMPL bool | mmx::operator!= (const RING &p, const RING &q) |
| |
| TMPL syntactic | mmx::flatten (const RING &rg) |
| |
| TMPL RING | mmx::ring_sparse_string (const scalar_set< C > &rg, const vector< string > &s) |
| |
| TMPL RING | mmx::ring_sparse_generic (const scalar_set< C > &rg, const vector< generic > &s) |
| |
| TMPL RING | mmx::ring_sparse_extend_generic (const RING &R, const vector< generic > &s) |
| |
| TMPL syntactic | mmx::flatten (const Polynomial &p) |
| |
| TMPL Polynomial | mmx::polynomial_sparse (const RING &r, const C &c) |
| |
| TMPL Polynomial | mmx::polynomial_sparse (const RING &r, const C &c, const int &d, const int &v) |
| |
| TMPL Polynomial | mmx::polynomial_sparse (const RING &r, const string &s) |
| |
| TMPL Polynomial | mmx::polynomial_sparse (const RING &r, const generic &s) |
| |
| TMPL vector< generic > | mmx::polynomial_sparse_coefficients (const Polynomial &f, const int &v) |
| |
| TMPL vector< generic > | mmx::polynomial_sparse_coefficients (const Polynomial &p) |
| |
| TMPL vector< generic > | mmx::polynomial_sparse_monomials (const Polynomial &p) |
| |
| TMPL generic | mmx::polynomial_sparse_eval_generic (const Polynomial &p, const vector< generic > &v) |
| |
| #define Polynomial polynomial< C, with<Sparse,DegRevLex> > |
| #define RING ring<C, Sparse,DegRevLex > |
| #define SparseDegRevLex with<Sparse,DegRevLex> |
| #define TMPL template <class C> |