Frobby 0.9.5
SatBinomConsumer.cpp
Go to the documentation of this file.
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#include "stdinc.h"
18#include "SatBinomConsumer.h"
19
20#include "SatBinomIdeal.h"
21
23}
24
26 consumeRing(names);
28}
29
31 beginConsuming(ideal.getNames());
32 for (size_t binom = 0; binom < ideal.getGeneratorCount(); ++binom)
33 consume(ideal.getGenerator(binom));
35}
virtual void consumeRing(const VarNames &names)=0
virtual void doneConsuming()=0
virtual void beginConsuming()=0
virtual ~SatBinomConsumer()
virtual void consume(const vector< mpz_class > &term)=0
Represents a saturated binomial ideal.
Definition: SatBinomIdeal.h:28
size_t getGeneratorCount() const
const VarNames & getNames() const
const vector< mpz_class > & getGenerator(size_t index) const
Defines the variables of a polynomial ring and facilities IO involving them.
Definition: VarNames.h:40