Gröbner basis project
Codebase for research into Gröbner basis computation
|
Structure for sorting critical pairs. More...
#include <strategies.hpp>
Public Member Functions | |
Destruction | |
virtual | ~Pair_Strategy_Data () |
Comparison | |
virtual bool | equivalent (const Pair_Strategy_Data &) const =0 |
should return true iff this and other are equivalent | |
bool | operator== (const Pair_Strategy_Data &sd) const |
alias for equivalent() | |
virtual bool | first_larger (const Pair_Strategy_Data &) const =0 |
should return true iff this is larger than other | |
bool | operator> (const Pair_Strategy_Data &sd) const |
alias for first_larger() | |
bool | operator>= (const Pair_Strategy_Data &sd) const |
is this larger than or equivalent to other? | |
bool | operator< (const Pair_Strategy_Data &sd) const |
is this smaller than other? | |
bool | operator<= (const Pair_Strategy_Data &sd) const |
is this smaller than or equivalent to other? | |
Computation | |
virtual void | pre_spolynomial_tasks () const |
hook called immediately before computing a new s-polynomiald More... | |
|
virtual |
hook called immediately before computing a new s-polynomiald
The default is to do nothing, which is good for the normal strategy. Other strategies, however, may require some processing before reduction; the sugar strategy is an example, as an s-polynomial needs to record a new polynomial’s sugar
Definition at line 57 of file strategies.cpp.