Frobby 0.10.0
Loading...
Searching...
No Matches
OptimizeStrategy.h
1/* Frobby: Software for monomial ideal computations.
2 Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.com)
3
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
8
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
13
14 You should have received a copy of the GNU General Public License
15 along with this program. If not, see http://www.gnu.org/licenses/.
16*/
17#ifndef OPTIMIZE_STRATEGY_GUARD
18#define OPTIMIZE_STRATEGY_GUARD
19
20#include "MsmStrategy.h"
21#include "Term.h"
22#include "TermConsumer.h"
23#include "tests.h"
24
25class Slice;
26class TermGrader;
27
43class OptimizeStrategy : public MsmStrategy, public TermConsumer {
44public:
59
72 const SplitStrategy* splitStrategy,
73 bool reportAllSolutions,
74 BoundSetting boundSetting);
75
81
86 const mpz_class& getMaximalValue();
87
91 virtual void setUseIndependence(bool use);
92
93 virtual void getPivot(Term& pivot, Slice& slice);
94
104 virtual bool simplify(Slice& slice);
105
106 virtual void beginConsuming();
107 virtual void consume(const Term& term);
108 virtual void doneConsuming();
109
110 private:
130 bool changedInWayRelevantToBound
131 (const Term& oldDivisor, const Term& oldDominator,
132 const Term& newDivisor, const Term& newDominator) const;
133
210 bool boundSimplify
211 (Slice& slice,
212 const Term& dominator,
213 const mpz_class& upperBound);
214
265 bool getInnerSimplify
266 (const Term& divisor,
267 const Term& dominator,
268 const mpz_class& upperBound,
269 Term& pivot);
270
324 bool getOuterSimplify
325 (const Term& divisor,
326 const Term& dominator,
327 const mpz_class& upperBound,
328 Term& pivot);
329
336 bool getDominator(Slice& slice, Term& dominator);
337
339 size_t getVarCount() const;
340
342 const TermGrader& _grader;
343
347 mpz_class _maxValue;
348
361 mpz_class _maxValueToBeat;
362
366 Ideal _maxSolutions;
367
371 bool _reportAllSolutions;
372
374 BoundSetting _boundSetting;
375
379 mpz_class _consume_tmpDegree;
380
384 mpz_class _simplify_tmpUpperBound;
385
389 Term _simplify_tmpDominator;
390
394 Term _simplify_tmpOldDominator;
395
399 Term _simplify_tmpOldDivisor;
400
405 mpz_class _tmpC;
406
410 Term _boundSimplify_tmpPivot;
411
412
413 FRIEND_TEST(OptimizeStrategy, ChangedInWayRelevantToBound);
414 FRIEND_TEST(OptimizeStrategy, SimplifyPositiveGrading);
415 FRIEND_TEST(OptimizeStrategy, SimplifyNegativeGrading);
416};
417
418#endif
Represents a monomial ideal with int exponents.
Definition Ideal.h:27
Definition OptimizeStrategy.h:43
BoundSetting
Definition OptimizeStrategy.h:46
@ DoNotUseBound
Definition OptimizeStrategy.h:48
@ UseBoundToEliminateAndSimplify
Definition OptimizeStrategy.h:57
@ UseBoundToEliminate
Definition OptimizeStrategy.h:52
const Ideal & getMaximalSolutions()
Definition OptimizeStrategy.cpp:41
OptimizeStrategy(TermGrader &grader, const SplitStrategy *splitStrategy, bool reportAllSolutions, BoundSetting boundSetting)
Definition OptimizeStrategy.cpp:23
virtual void getPivot(Term &pivot, Slice &slice)
Definition OptimizeStrategy.cpp:77
const mpz_class & getMaximalValue()
Definition OptimizeStrategy.cpp:45
virtual void consume(const Term &term)
Definition OptimizeStrategy.cpp:58
virtual void beginConsuming()
Definition OptimizeStrategy.cpp:54
virtual void doneConsuming()
Definition OptimizeStrategy.cpp:74
virtual void setUseIndependence(bool use)
Definition OptimizeStrategy.cpp:50
virtual bool simplify(Slice &slice)
Definition OptimizeStrategy.cpp:81
Definition Slice.h:77
Definition SplitStrategy.h:30
Definition TermConsumer.h:36
Definition TermGrader.h:27
Definition Term.h:49