/usr/include/polybori/groebner/LLReductor.h is in libpolybori-groebner-dev 0.8.3-3+b2.
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 79 80 81 82 | // -*- c++ -*-
//*****************************************************************************
/** @file LLReductor.h
*
* @author Michael Brickenstein (original) and Alexander Dreyer (refactored)
* @date 2012-01-31
*
* This file includes the definition of the class @c LLReductor.
*
* @par Copyright:
* (c) 2006-2012 by The PolyBoRi Team
*
**/
//*****************************************************************************
#ifndef polybori_groebner_LLReductor_h_
#define polybori_groebner_LLReductor_h_
#include "ll_red_nf.h"
// include basic definitions
#include "groebner_defs.h"
BEGIN_NAMESPACE_PBORIGB
// groebner_alg.h
MonomialSet recursively_insert(MonomialSet::navigator p,
idx_type idx, MonomialSet mset);
/** @class LLReductor
* @brief This class defines LLReductor.
*
**/
class LLReductor:
public MonomialSet {
typedef MonomialSet base;
typedef LLReductor self;
public:
/// Construct reductor from Ring
LLReductor(const BoolePolyRing& ring): base(ring.one()) {}
/// Construct copy or MonomialSet
template <class Type>
LLReductor(const Type& value): base(value) { PBORI_ASSERT(!isZero()); }
/// Test whether polynomial is a compatible reductor element
bool isCompatible(const PolyEntry& entry) {
PBORI_ASSERT (!isZero());
return (entry.leadDeg == 1) &&
(*(entry.p.navigation()) == entry.lead.firstIndex() ) &&
(!expBegin()->reducibleBy(entry.lead.firstIndex()));
}
/// Insert polynomial if compatible, return updated polynomial
Polynomial update(const PolyEntry& entry) {
return (isCompatible(entry)? insert(entry): entry.p);
}
private:
self& operator=(const self& rhs) {
return static_cast<self&>(static_cast<base&>(*this) = rhs);
}
Polynomial insert(const PolyEntry& entry) {
Polynomial poly = ll_red_nf(entry.p, *this);
PBORI_ASSERT(poly.lead() == entry.lead);
operator=(recursively_insert(poly.navigation().elseBranch(),
entry.lead.firstIndex(),
ll_red_nf(*this, poly.set())));
return poly;
}
};
END_NAMESPACE_PBORIGB
#endif /* polybori_groebner_LLReductor_h_ */
|