16 #ifndef polybori_groebner_RelatedTermsBase_h_
17 #define polybori_groebner_RelatedTermsBase_h_
37 m_lead(ring), m_ignorable(ring), m_ext_prod_terms(ring),
38 m_related(ring), m_divisors_of(ring, ring) { }
43 m_lead(lead), m_ignorable(ignorable), m_ext_prod_terms(lead.ring()),
44 m_related(lead.ring()), m_divisors_of(lead, significant) {
46 init(significant, unrelated_terms(significant));
63 return mod_mon_set(m_related.intersect(terms), m_ignorable);
68 return std::accumulate(m_lead.begin(), m_lead.end(), terms,
76 m_related = significant.diff(unrelated);
77 m_ext_prod_terms = m_ignorable.
existAbstract(m_lead).diff(unrelated);
85 BoundedDivisorsOf m_divisors_of;
#define END_NAMESPACE_PBORIGB
Definition: groebner_defs.h:16
self existAbstract(const term_type &rhs) const
Definition: BooleSet.cc:252
This class reinterprets decicion diagram managers as Boolean polynomial rings, adds an ordering and v...
Definition: BoolePolyRing.h:40
#define BEGIN_NAMESPACE_PBORIGB
Definition: groebner_defs.h:15
polybori::BooleSet MonomialSet
Definition: groebner_defs.h:45
MonomialSet minimal_elements_divided(MonomialSet m, Monomial lm, MonomialSet mod)
Definition: minimal_elements.h:430
MonomialSet mod_mon_set(const MonomialSet &as, const MonomialSet &vs)
Definition: nf.cc:855
#define PBORI_ASSERT(arg)
Definition: pbori_defs.h:118
This class defines defines a function for computing a bounded variant of MononmialSet's divisorsOf...
Definition: BoundedDivisorsOf.h:42
MemberFunctionOperator< MemberFct > member_function_operator(MemberFct func)
Definition: CMemberFunctionTraits.h:83
bool_type ownsOne() const
Test whether the empty set is included.
Definition: BooleSet.h:211
Definition: BooleSet.h:57
This class is just a wrapper for using variables from cudd's decicion diagram.
Definition: BooleMonomial.h:50