BigTermConsumer.cpp
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/.
*/
#include "stdinc.h"
#include "BigTermConsumer.h"
#include "Term.h"
#include "TermTranslator.h"
#include "BigIdeal.h"
BigTermConsumer::~BigTermConsumer() {
}
// Do not use this implementation for anything time-critical, since
// the allocation of a new vector and mpz_class'es each time really is
// not efficient.
void BigTermConsumer::consume
(const Term& term, const TermTranslator& translator) {
ASSERT(term.getVarCount() == translator.getVarCount());
vector<mpz_class> bigTerm(term.getVarCount());
for (size_t var = 0; var < term.getVarCount(); ++var)
bigTerm[var] = translator.getExponent(var, term);
consume(bigTerm);
}
// Do not use this implementation for anything time-critical.
void BigTermConsumer::consume(const Term& term) {
vector<mpz_class> bigTerm(term.getVarCount());
for (size_t var = 0; var < term.getVarCount(); ++var)
bigTerm[var] = term[var];
consume(bigTerm);
}
void BigTermConsumer::beginConsuming(const VarNames& names) {
consumeRing(names);
beginConsuming();
}
void BigTermConsumer::consume(const BigIdeal& ideal) {
consumeRing(ideal.getNames());
beginConsuming(ideal.getNames());
for (size_t term = 0; term < ideal.getGeneratorCount(); ++term)
consume(ideal.getTerm(term));
doneConsuming();
}
void BigTermConsumer::consume(unique_ptr<BigIdeal> ideal) {
consume(*ideal);
}
BigIdeal.h
BigTermConsumer.h
TermTranslator.h
Term.h
BigIdeal
Definition BigIdeal.h:27
BigIdeal::getTerm
const vector< mpz_class > & getTerm(size_t term) const
Definition BigIdeal.h:139
BigIdeal::getNames
const VarNames & getNames() const
Definition BigIdeal.cpp:253
BigIdeal::getGeneratorCount
size_t getGeneratorCount() const
Definition BigIdeal.h:144
BigTermConsumer::consume
virtual void consume(const vector< mpz_class > &term)=0
BigTermConsumer::consumeRing
virtual void consumeRing(const VarNames &names)=0
Tell the consumer which ring is being used.
BigTermConsumer::doneConsuming
virtual void doneConsuming()=0
Must be called once after each time beginConsuming has been called.
BigTermConsumer::beginConsuming
virtual void beginConsuming()=0
Tell the consumer to begin consuming an ideal.
BigTermConsumer::~BigTermConsumer
virtual ~BigTermConsumer()
Definition BigTermConsumer.cpp:24
TermTranslator
TermTranslator handles translation between terms whose exponents are infinite precision integers and ...
Definition TermTranslator.h:41
TermTranslator::getExponent
const mpz_class & getExponent(size_t variable, Exponent exponent) const
This method translates from IDs to arbitrary precision integers.
Definition TermTranslator.cpp:392
TermTranslator::getVarCount
size_t getVarCount() const
Definition TermTranslator.cpp:447
Term
Term represents a product of variables which does not include a coefficient.
Definition Term.h:49
Term::getVarCount
size_t getVarCount() const
Definition Term.h:85
VarNames
Defines the variables of a polynomial ring and facilities IO involving them.
Definition VarNames.h:40
stdinc.h
This header file includes common definitions and is included as the first line of code in every imple...
ASSERT
#define ASSERT(X)
Definition stdinc.h:86