Developer documentation

monomial_ordering.hpp
Go to the documentation of this file.
1 #ifndef mmx_realroot_monomial_ordering_hpp
2 #define mmx_realroot_monomial_ordering_hpp
3 
29 namespace mmx {
30 
33  virtual bool less(const int *m1, int s1, const int *m2, int s2) const =0;
34  virtual ~MonomialOrdering () {}
35  };
36 
38  struct DegRevLex: public MonomialOrdering {
39  bool less(const int *m1, int s1, const int *m2, int s2) const;
40  };
41 
42  struct LexRevDegree: public MonomialOrdering {
43  bool less(const int *m1, int s1, const int *m2, int s2) const;
44  };
45 
47  struct Lex: public MonomialOrdering {
48  bool less(const int *m1, int s1, const int *m2, int s2) const;
49  };
50 
51 //======================================================================
52 } //namespace mmx
53 #endif //mmx_realroot_monomial_ordering_hpp
bool less(const int *m1, int s1, const int *m2, int s2) const
Definition: monomial_ordering.cpp:61
Degree Reverse Lexicographic monomial ordering.
Definition: monomial_ordering.hpp:38
Virtual class of monomial ordering.
Definition: monomial_ordering.hpp:32
bool less(const int *m1, int s1, const int *m2, int s2) const
Definition: monomial_ordering.cpp:8
Lexicographic monomial ordering.
Definition: monomial_ordering.hpp:47
virtual bool less(const int *m1, int s1, const int *m2, int s2) const =0
Definition: monomial_ordering.hpp:42
bool less(const int *m1, int s1, const int *m2, int s2) const
Definition: monomial_ordering.cpp:34
virtual ~MonomialOrdering()
Definition: monomial_ordering.hpp:34
Definition: array.hpp:12
Home