SatBinomConsumer.h
Go to the documentation of this file.
/* Frobby: Software for monomial ideal computations.
Copyright (C) 2007 Bjarke Hammersholt Roune (www.broune.com)
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see http://www.gnu.org/licenses/.
*/
#ifndef SAT_BINOM_CONSUMER_GUARD
#define SAT_BINOM_CONSUMER_GUARD
#include <vector>
class VarNames;
class SatBinomIdeal;
class SatBinomConsumer {
public:
virtual ~SatBinomConsumer();
virtual void consumeRing(const VarNames& names) = 0;
virtual void beginConsuming() = 0;
virtual void consume(const vector<mpz_class>& term) = 0;
virtual void doneConsuming() = 0;
virtual void consume(const SatBinomIdeal& ideal);
// Calling this convenience method is equivalent to
// consumeRing(names);
// beginConsuming();
void beginConsuming(const VarNames& names);
};
#endif
SatBinomConsumer
Definition SatBinomConsumer.h:25
SatBinomConsumer::consumeRing
virtual void consumeRing(const VarNames &names)=0
SatBinomConsumer::doneConsuming
virtual void doneConsuming()=0
SatBinomConsumer::beginConsuming
virtual void beginConsuming()=0
SatBinomConsumer::~SatBinomConsumer
virtual ~SatBinomConsumer()
Definition SatBinomConsumer.cpp:22
SatBinomConsumer::consume
virtual void consume(const vector< mpz_class > &term)=0
SatBinomIdeal
Represents a saturated binomial ideal.
Definition SatBinomIdeal.h:28
VarNames
Defines the variables of a polynomial ring and facilities IO involving them.
Definition VarNames.h:40