/usr/include/polybori/groebner/SlimgbReduction.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 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 | // -*- c++ -*-
//*****************************************************************************
/** @file SlimgbReduction.h
*
* @author Michael Brickenstein
* @date 2011-06-30
*
* This file includes the definition of the class @c groebner_SlimgbReduction.
*
* @par Copyright:
* (c) by The PolyBoRi Team
*
**/
//*****************************************************************************
#ifndef polybori_groebner_SlimgbReduction_h_
#define polybori_groebner_SlimgbReduction_h_
// include basic definitions
#include "groebner_defs.h"
#include <utility>
#include <vector>
#include "LMLessCompare.h"
#include "GroebnerStrategy.h"
BEGIN_NAMESPACE_PBORIGB
/** @class SlimgbReduction
* @brief This class defines SlimgbReduction.
*
**/
const int SLIMGB_SIMPLEST=0;
template<int variant>
class SlimgbReduction{
private:
const GroebnerStrategy* strat;
std::priority_queue<Polynomial, std::vector<Polynomial>, LMLessCompare> to_reduce;
public:
std::vector<Polynomial> result;
SlimgbReduction(GroebnerStrategy& strat){
this->strat=&strat;
}
SlimgbReduction(){}
void addPolynomial(const Polynomial& p);
void reduce();
//return zero at the end
Polynomial nextResult();
};
template <int variant>
inline void
SlimgbReduction<variant>::addPolynomial(const Polynomial& p){
if (!(p.isZero())){
to_reduce.push(p);
}
}
template <int variant>
inline Polynomial
SlimgbReduction<variant>::nextResult(){
if (result.size()==0)
throw std::runtime_error("Empty result in SlimgbReduction.");
Polynomial res=result.back();
result.pop_back();
return res;
}
template <>
inline void
SlimgbReduction<SLIMGB_SIMPLEST>::reduce(){
while (!(to_reduce.empty())){
//cout<<"looping"<<endl;
std::vector<Polynomial> curr;
curr.push_back(to_reduce.top());
to_reduce.pop();
//cout<<curr[0];
Monomial lm=curr[0].lead();
while ((!(to_reduce.empty())) && (to_reduce.top().lead()==lm)){
curr.push_back(to_reduce.top());
to_reduce.pop();
//cout<<"same"<<endl;
//cout.flush();
}
//cout<<lm;
//cout.flush();
int index=strat->generators.select1(lm);
if (index>=0){
Polynomial p_high=(lm/strat->generators[index].lead)*strat->generators[index].p;
int i,s;
s=curr.size();
PBORI_ASSERT(p_high.lead()==lm);
for(i=0;i<s;i++){
curr[i]+=p_high;
if (!(curr[i].isZero())){
to_reduce.push(curr[i]);
}
}
} else {
//simly take the first, not so clever
Polynomial reductor=curr.back();
curr.pop_back();
int i,s;
s=curr.size();
if (s>0){
for(i=0;i<s;i++){
curr[i]+=reductor;
if (!(curr[i].isZero())){
PBORI_ASSERT(curr[i].lead()<lm);
to_reduce.push(curr[i]);
}
}
PBORI_ASSERT(!(reductor.isZero()));
result.push_back(reductor);
} else{
PBORI_ASSERT(s==0);
PBORI_ASSERT(!(curr[0].isZero()));
result.push_back(curr[0]);
}
}
}
}
END_NAMESPACE_PBORIGB
#endif /* polybori_groebner_SlimgbReduction_h_ */
|