Frobby  0.9.5
SatBinomConsumer.h
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 #ifndef SAT_BINOM_CONSUMER_GUARD
18 #define SAT_BINOM_CONSUMER_GUARD
19 
20 #include <vector>
21 
22 class VarNames;
23 class SatBinomIdeal;
24 
26  public:
27  virtual ~SatBinomConsumer();
28 
29  virtual void consumeRing(const VarNames& names) = 0;
30  virtual void beginConsuming() = 0;
31  virtual void consume(const vector<mpz_class>& term) = 0;
32  virtual void doneConsuming() = 0;
33 
34  virtual void consume(const SatBinomIdeal& ideal);
35 
36  // Calling this convenience method is equivalent to
37  // consumeRing(names);
38  // beginConsuming();
39  void beginConsuming(const VarNames& names);
40 };
41 
42 #endif
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
Defines the variables of a polynomial ring and facilities IO involving them.
Definition: VarNames.h:40