Frobby 0.9.5
BigTermConsumer.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 "BigTermConsumer.h"
19
20#include "Term.h"
21#include "TermTranslator.h"
22#include "BigIdeal.h"
23
26
27// Do not use this implementation for anything time-critical, since
28// the allocation of a new vector and mpz_class'es each time really is
29// not efficient.
31(const Term& term, const TermTranslator& translator) {
32 ASSERT(term.getVarCount() == translator.getVarCount());
33
34 vector<mpz_class> bigTerm(term.getVarCount());
35 for (size_t var = 0; var < term.getVarCount(); ++var)
36 bigTerm[var] = translator.getExponent(var, term);
37
41// Do not use this implementation for anything time-critical.
42void BigTermConsumer::consume(const Term& term) {
43 vector<mpz_class> bigTerm(term.getVarCount());
44 for (size_t var = 0; var < term.getVarCount(); ++var)
45 bigTerm[var] = term[var];
46
48}
49
54
56 consumeRing(ideal.getNames());
57 beginConsuming(ideal.getNames());
58 for (size_t term = 0; term < ideal.getGeneratorCount(); ++term)
59 consume(ideal.getTerm(term));
61}
62
void nameFactoryRegister(NameFactory< AbstractProduct > &factory)
Registers the string returned by ConcreteProduct::getStaticName() to a function that default-construc...
const vector< mpz_class > & getTerm(size_t term) const
Definition BigIdeal.h:139
const VarNames & getNames() const
Definition BigIdeal.cpp:253
size_t getGeneratorCount() const
Definition BigIdeal.h:144
virtual void consume(const vector< mpz_class > &term)=0
virtual void consumeRing(const VarNames &names)=0
Tell the consumer which ring is being used.
virtual void doneConsuming()=0
Must be called once after each time beginConsuming has been called.
virtual void beginConsuming()=0
Tell the consumer to begin consuming an ideal.
virtual ~BigTermConsumer()
TermTranslator handles translation between terms whose exponents are infinite precision integers and ...
Term represents a product of variables which does not include a coefficient.
Definition Term.h:49
size_t getVarCount() const
Definition Term.h:85
Defines the variables of a polynomial ring and facilities IO involving them.
Definition VarNames.h:40
#define ASSERT(X)
Definition stdinc.h:86