16 #ifndef polybori_LexOrder_h_
17 #define polybori_LexOrder_h_
57 comp_type compare(
const monom_type&,
const monom_type&)
const;
60 comp_type compare(
const exp_type&,
const exp_type&)
const;
63 monom_type lead(
const poly_type&)
const;
72 exp_type leadExp(
const poly_type&)
const;
84 #endif // polybori_LexOrder_h_
This class is just a wrapper for using variables for storing indices as interim data structure for Bo...
Definition: BooleExponent.h:34
#define END_NAMESPACE_PBORI
Finish project's namespace.
Definition: pbori_defs.h:77
LexOrder()
Default Constructor.
Definition: LexOrder.h:45
#define BEGIN_NAMESPACE_PBORI
Start project's namespace.
Definition: pbori_defs.h:74
This class initialize the interface for orderings of CDynamicOrderBase for a given OrderType...
Definition: COrderingFacade.h:43
int deg_type
Type for polynomial degrees (ranges from -1 to maxint)
Definition: pbori_defs.h:222
~LexOrder()
Destructor.
Definition: LexOrder.h:51
Definition: COrderingBase.h:43
This class wraps the underlying decicion diagram type and defines the necessary operations.
Definition: BoolePolynomial.h:85
LexOrder(const self &rhs)
Copy Constructor.
Definition: LexOrder.h:48
This class defines ordering related functions.
Definition: LexOrder.h:33
monom_type lead(const poly_type &poly, deg_type) const
Definition: LexOrder.h:67
std::less< idx_type > idx_comparer_type
Define binary predicate for index comparision.
Definition: LexOrder.h:42
polybori::CTypes::idx_type idx_type
Definition: groebner_defs.h:44
This class is just a wrapper for using variables from cudd's decicion diagram.
Definition: BooleMonomial.h:50
exp_type leadExp(const poly_type &poly, deg_type) const
Definition: LexOrder.h:76