Frobby 0.10.0
Loading...
Searching...
No Matches
BigattiBaseCase.h
1/* Frobby: Software for monomial ideal computations.
2 Copyright (C) 2009 University of Aarhus
3 Contact Bjarke Hammersholt Roune for license information (www.broune.com)
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see http://www.gnu.org/licenses/.
17*/
18#ifndef BIGATTI_BASE_CASE_GUARD
19#define BIGATTI_BASE_CASE_GUARD
20
21class BigattiState;
22class TermTranslator;
23
24#include "Term.h"
25#include "Ideal.h"
26#include "HashPolynomial.h"
27#include "UniHashPolynomial.h"
28#include <vector>
29
34 public:
38 BigattiBaseCase(const TermTranslator& translator);
39
43 bool genericBaseCase(const BigattiState& state);
44
47 bool baseCase(const BigattiState& state);
48
51 void output(bool plus, const Term& term);
52
56 void feedOutputTo(CoefBigTermConsumer& consumer, bool inCanonicalOrder);
57
60 void setPrintDebug(bool value);
61
64 void setComputeUnivariate(bool value);
65
67 size_t getTotalBaseCasesEver() const;
68
73 size_t getTotalTermsOutputEver() const;
74
77 size_t getTotalTermsInOutput() const;
78
79 private:
82 bool simpleBaseCase(const BigattiState& state);
83
84 bool univariateAllFaces(const BigattiState& state);
85
94 void enumerateScarfComplex(const BigattiState& state, bool allFaces);
95
96 vector<size_t> _maxCount;
97 Term _lcm;
98 mpz_class _tmp;
99
102 HashPolynomial _outputMultivariate;
103
106 UniHashPolynomial _outputUnivariate;
107
110 struct State {
111 Term term;
112 Ideal::const_iterator pos;
113 bool plus;
114 };
115
118 vector<State> _states;
119
122 bool _computeUnivariate;
123
125 const TermTranslator& _translator;
126
128 size_t _totalBaseCasesEver;
129
131 size_t _totalTermsOutputEver;
132
133 bool _printDebug;
134};
135
136#endif
BigattiBaseCase(const TermTranslator &translator)
Definition BigattiBaseCase.cpp:25
size_t getTotalTermsOutputEver() const
Definition BigattiBaseCase.cpp:128
void setPrintDebug(bool value)
Definition BigattiBaseCase.cpp:116
bool genericBaseCase(const BigattiState &state)
Definition BigattiBaseCase.cpp:36
size_t getTotalBaseCasesEver() const
Definition BigattiBaseCase.cpp:124
void setComputeUnivariate(bool value)
Definition BigattiBaseCase.cpp:120
bool baseCase(const BigattiState &state)
Definition BigattiBaseCase.cpp:49
void output(bool plus, const Term &term)
Definition BigattiBaseCase.cpp:86
void feedOutputTo(CoefBigTermConsumer &consumer, bool inCanonicalOrder)
Definition BigattiBaseCase.cpp:108
size_t getTotalTermsInOutput() const
Definition BigattiBaseCase.cpp:132
Definition BigattiState.h:27
Definition CoefBigTermConsumer.h:29
Definition HashPolynomial.h:39
Definition TermTranslator.h:41
Definition Term.h:49
Definition UniHashPolynomial.h:39