#include <basix/basix.hpp>
Go to the source code of this file.
|
| #define | DECLARE_SET(X, T) template<> inline syntactic flatten(const set_of<T>& Z){return syntactic(X);} |
| |
| #define | DEFINE_SET(X, T) |
| |
|
| template<class X > |
| bool | mmx::operator== (const set_of< X > &r1, const set_of< X > &r2) |
| |
| template<class X > |
| bool | mmx::operator!= (const set_of< X > &r1, const set_of< X > &r2) |
| |
| template<class C > |
| set_of< C > | mmx::make_set (const C &c) |
| |
| template<class C > |
| int | mmx::hash (const set_of< C > &R) |
| |
| template<class C > |
| int | mmx::soft_hash (const set_of< C > &R) |
| |
| template<class C > |
| bool | mmx::eq (const set_of< C > &R1, const set_of< C > &R2) |
| |
| template<class X > |
| syntactic | mmx::flatten (const set_of< X > &s) |
| |
| #define DECLARE_SET |
( |
|
X, |
|
|
|
T |
|
) |
| template<> inline syntactic flatten(const set_of<T>& Z){return syntactic(X);} |
| #define DEFINE_SET |
( |
|
X, |
|
|
|
T |
|
) |
| |
Value:static set_of<T> T##_set= set_of<T>(); \
define_constant<always,set_of<T> > (
X, T##_set); \
define<always> ("set_of", make_set<T>);
TMPL X
Definition: polynomial_operators.hpp:148