/usr/include/polybori/groebner/MinimalLeadingTerms.h is in libbrial-groebner-dev 1.2.0-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 | // -*- c++ -*-
//*****************************************************************************
/** @file MinimalLeadingTerms.h
*
* @author Michael Brickenstein (original) and Alexander Dreyer (refactored)
* @date 2012-01-31
*
* This file includes the definition of the class @c MinimalLeadingTerms.
*
* @par Copyright:
* (c) 2006-2012 by The PolyBoRi Team
*
**/
//*****************************************************************************
#ifndef polybori_groebner_MinimalLeadingTerms_h_
#define polybori_groebner_MinimalLeadingTerms_h_
// include basic definitions
#include "groebner_defs.h"
BEGIN_NAMESPACE_PBORIGB
/** @class MinimalLeadingTerms
* @brief This class defines MinimalLeadingTerms.
*
**/
class MinimalLeadingTerms:
public MonomialSet {
typedef MonomialSet base;
typedef MinimalLeadingTerms self;
public:
template <class Type>
MinimalLeadingTerms(const Type& value): base(value) { }
/// Insert leading term and return monomials, that are not minimal (any more)
MonomialSet update(const Monomial& lm) {
MonomialSet divisors(divisorsOf(lm));
if(divisors.isZero())
return cleanup(lm);
return (divisors == lm.set()? lm.ring().zero(): lm.set());
}
private:
self& operator=(const self& rhs) {
return static_cast<self&>(static_cast<base&>(*this) = rhs);
}
MonomialSet cleanup(const Monomial& lm) {
MonomialSet removed(multiplesOf(lm).diff(lm.set()));
PBORI_ASSERT(removed.intersect(*this).intersect(lm.set()).isZero());
PBORI_ASSERT(assertion(lm, removed.expBegin(),removed.expEnd()));
*this = diff(removed).unite(lm.set());
return removed;
}
bool assertion(const Monomial& lm,
MonomialSet::exp_iterator start,
MonomialSet::exp_iterator finish) const {
while (start != finish) {
if ( (*start) == lm.exp() || !start->reducibleBy(lm.exp()) )
return false;
++start;
}
return true;
}
};
END_NAMESPACE_PBORIGB
#endif /* polybori_groebner_MinimalLeadingTerms_h_ */
|