Frobby
0.10.0
Toggle main menu visibility
Loading...
Searching...
No Matches
src
Slice.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 SLICE_GUARD
18
#define SLICE_GUARD
19
20
#include "Ideal.h"
21
#include "Term.h"
22
#include "Task.h"
23
24
class
Projection
;
25
class
SliceStrategy
;
26
77
class
Slice
:
public
Task
{
78
public
:
82
Slice
(
SliceStrategy
& strategy);
83
87
Slice
(
SliceStrategy
& strategy,
88
const
Ideal
& ideal,
const
Ideal
& subtract,
const
Term
& multiply);
89
90
virtual
~Slice
();
91
94
96
size_t
getVarCount
()
const
{
return
_varCount
;}
97
104
const
Ideal
&
getIdeal
()
const
{
return
_ideal
;}
105
107
Ideal
&
getSubtract
() {
return
_subtract
;}
108
110
const
Ideal
&
getSubtract
()
const
{
return
_subtract
;}
111
113
Term
&
getMultiply
() {
return
_multiply
;}
114
116
const
Term
&
getMultiply
()
const
{
return
_multiply
;}
117
124
const
Term
&
getLcm
()
const
;
125
128
void
print
(FILE* file)
const
;
129
131
134
140
virtual
bool
baseCase
(
bool
simplified) = 0;
141
143
virtual
Slice
&
operator=
(
const
Slice
& slice) = 0;
144
148
void
resetAndSetVarCount
(
size_t
varCount);
149
157
void
clearIdealAndSubtract
();
158
160
void
singleDegreeSortIdeal
(
size_t
var);
161
171
virtual
bool
innerSlice
(
const
Term
& pivot);
172
182
virtual
void
outerSlice
(
const
Term
& pivot);
183
190
bool
normalize
();
191
196
bool
adjustMultiply
();
197
202
virtual
bool
simplify
();
203
213
virtual
bool
simplifyStep
() = 0;
214
216
217
virtual
void
run
(
TaskEngine
& tasks);
218
virtual
void
dispose
();
219
220
protected
:
225
void
setToProjOf
(
const
Slice
& slice,
const
Projection
& projection);
226
231
void
swap
(
Slice
& slice);
232
238
bool
pruneSubtract
();
239
249
bool
applyLowerBound
();
250
263
virtual
bool
getLowerBound
(
Term
& bound,
size_t
var)
const
= 0;
264
266
Ideal
_ideal
;
267
269
Ideal
_subtract
;
270
272
Term
_multiply
;
273
275
size_t
_varCount
;
276
285
mutable
Term
_lcm
;
286
293
mutable
bool
_lcmUpdated
;
294
301
size_t
_lowerBoundHint
;
302
303
SliceStrategy
& _strategy;
304
};
305
306
#endif
Ideal
Represents a monomial ideal with int exponents.
Definition
Ideal.h:27
Projection
Definition
Projection.h:29
SliceStrategy
Definition
SliceStrategy.h:33
Slice::_varCount
size_t _varCount
Definition
Slice.h:275
Slice::_ideal
Ideal _ideal
Definition
Slice.h:266
Slice::resetAndSetVarCount
void resetAndSetVarCount(size_t varCount)
Definition
Slice.cpp:89
Slice::normalize
bool normalize()
Definition
Slice.cpp:189
Slice::singleDegreeSortIdeal
void singleDegreeSortIdeal(size_t var)
Definition
Slice.cpp:106
Slice::print
void print(FILE *file) const
Definition
Slice.cpp:68
Slice::innerSlice
virtual bool innerSlice(const Term &pivot)
Definition
Slice.cpp:110
Slice::outerSlice
virtual void outerSlice(const Term &pivot)
Definition
Slice.cpp:132
Slice::_lowerBoundHint
size_t _lowerBoundHint
Definition
Slice.h:301
Slice::operator=
virtual Slice & operator=(const Slice &slice)=0
Definition
Slice.cpp:77
Slice::adjustMultiply
bool adjustMultiply()
Definition
Slice.cpp:162
Slice::setToProjOf
void setToProjOf(const Slice &slice, const Projection &projection)
Definition
Slice.cpp:218
Slice::_multiply
Term _multiply
Definition
Slice.h:272
Slice::swap
void swap(Slice &slice)
Definition
Slice.cpp:252
Slice::Slice
Slice(SliceStrategy &strategy)
Definition
Slice.cpp:26
Slice::getMultiply
Term & getMultiply()
Definition
Slice.h:113
Slice::pruneSubtract
bool pruneSubtract()
Definition
Slice.cpp:281
Slice::getSubtract
const Ideal & getSubtract() const
Definition
Slice.h:110
Slice::run
virtual void run(TaskEngine &tasks)
Definition
Slice.cpp:321
Slice::_lcm
Term _lcm
Definition
Slice.h:285
Slice::clearIdealAndSubtract
void clearIdealAndSubtract()
Definition
Slice.cpp:99
Slice::applyLowerBound
bool applyLowerBound()
Definition
Slice.cpp:289
Slice::getLowerBound
virtual bool getLowerBound(Term &bound, size_t var) const =0
Slice::getIdeal
const Ideal & getIdeal() const
Definition
Slice.h:104
Slice::getLcm
const Term & getLcm() const
Definition
Slice.cpp:52
Slice::_lcmUpdated
bool _lcmUpdated
Definition
Slice.h:293
Slice::_subtract
Ideal _subtract
Definition
Slice.h:269
Slice::getVarCount
size_t getVarCount() const
Definition
Slice.h:96
Slice::baseCase
virtual bool baseCase(bool simplified)=0
Slice::getMultiply
const Term & getMultiply() const
Definition
Slice.h:116
Slice::simplifyStep
virtual bool simplifyStep()=0
Slice::dispose
virtual void dispose()
Definition
Slice.cpp:325
Slice::getSubtract
Ideal & getSubtract()
Definition
Slice.h:107
Slice::simplify
virtual bool simplify()
Definition
Slice.cpp:204
TaskEngine
Definition
TaskEngine.h:40
Task
Definition
Task.h:27
Term
Definition
Term.h:49
Generated by
1.17.0