1 #ifndef __NORMAL_STRATEGY_CPP_ 2 #define __NORMAL_STRATEGY_CPP_ 21 #include "critical_pair.hpp" 22 #include "normal_strategy.hpp" 64 os <<
"Normal Strategy recording lcm " << ns.
cp->
lcm();
const Abstract_Polynomial * second() const
second polynomial in pair
virtual bool equivalent(const Pair_Strategy_Data &sd) const
implementation of equivalent()
virtual bool first_larger(const Pair_Strategy_Data &sd) const
implementation of first_larger()
virtual Monomial & leading_monomial() const =0
leading monomial – call after sort_by_order()!
const Monomial & lcm() const
lcm of leading monomials of polynomials
Structure for sorting critical pairs.
Normal_Strategy(Critical_Pair_Basic &cpb)
all the information we need is in cpb already so no additional processing is necessary ...
const Abstract_Polynomial * first() const
first polynomial in pair
ordering critical pairs using the normal strategy
Critical_Pair_Basic * cp
the critical pair to which this Normal_Strategy belongs
bool is_like(const Monomial &other) const
Have same variables, same powers? Synonymous with operator==().
Controls the creation of s-polynomials.