Frobby  0.9.0
IdealConsolidator.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 "IdealConsolidator.h"
19 
20 #include "Term.h"
21 #include "TermTranslator.h"
22 
23 IdealConsolidator::IdealConsolidator(auto_ptr<BigTermConsumer> consumer):
24  _consumer(consumer),
25  _inList(false),
26  _inIdeal(false) {
27 }
28 
30  ASSERT(!_inIdeal);
31 
32  _consumer->consumeRing(names);
33 
34  _names = names;
35  _ideal.clearAndSetNames(names);
36  _tmp.resize(names.getVarCount());
37 }
38 
40  ASSERT(!_inList);
41  ASSERT(!_inIdeal);
42 
43  _consumer->beginConsumingList();
44  _inList = true;
45 }
46 
48  ASSERT(!_inIdeal);
49  _inIdeal = true;
50 }
51 
52 void IdealConsolidator::consume(const Term& term) {
53  ASSERT(term.getVarCount() == _tmp.size());
54 
55  for (size_t var = 0; var < term.getVarCount(); ++var)
56  _tmp[var] = term[var];
57  consume(_tmp);
58 }
59 
61 (const Term& term, const TermTranslator& translator) {
62  ASSERT(term.getVarCount() == _tmp.size());
63 
64  for (size_t var = 0; var < term.getVarCount(); ++var)
65  _tmp[var] = translator.getExponent(var, term);
66  consume(_tmp);
67 }
68 
69 void IdealConsolidator::consume(const vector<mpz_class>& term) {
70  ASSERT(term.size() == _ideal.getVarCount());
71  // TODO: Add a method to BigIdeal that does this in one step.
73  _ideal.getLastTermRef() = term;
74 }
75 
78 
79  _inIdeal = false;
80  _consumer->consume(_ideal);
81  _ideal.clear();
82 }
83 
85  ASSERT(_inList);
86  _inList = false;
87  _consumer->doneConsumingList();
88 }
89 
91  _consumer->consume(ideal);
92 }
BigIdeal
Definition: BigIdeal.h:27
BigIdeal::getLastTermRef
vector< mpz_class > & getLastTermRef()
Definition: BigIdeal.h:133
stdinc.h
Term::getVarCount
size_t getVarCount() const
Definition: Term.h:85
BigIdeal::newLastTerm
void newLastTerm()
Definition: BigIdeal.cpp:104
Term.h
TermTranslator
TermTranslator handles translation between terms whose exponents are infinite precision integers and ...
Definition: TermTranslator.h:41
IdealConsolidator::_inIdeal
bool _inIdeal
Definition: IdealConsolidator.h:51
IdealConsolidator.h
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
VarNames::getVarCount
size_t getVarCount() const
Returns the current number of variables.
Definition: VarNames.h:112
IdealConsolidator::consume
virtual void consume(const Term &term)
Consume a term.
Definition: IdealConsolidator.cpp:52
IdealConsolidator::consumeRing
virtual void consumeRing(const VarNames &names)
Tell the consumer which ring is being used.
Definition: IdealConsolidator.cpp:29
IdealConsolidator::beginConsumingList
virtual void beginConsumingList()
Tell the consumer that the ideals that are consumed until the next call to doneConsumingList are to b...
Definition: IdealConsolidator.cpp:39
IdealConsolidator::_tmp
vector< mpz_class > _tmp
Definition: IdealConsolidator.h:52
IdealConsolidator::_consumer
const auto_ptr< BigTermConsumer > _consumer
Definition: IdealConsolidator.h:47
Term
Term represents a product of variables which does not include a coefficient.
Definition: Term.h:49
BigIdeal::clearAndSetNames
void clearAndSetNames(const VarNames &names)
Definition: BigIdeal.cpp:222
IdealConsolidator::_inList
bool _inList
Definition: IdealConsolidator.h:50
IdealConsolidator::doneConsuming
virtual void doneConsuming()
Must be called once after each time beginConsuming has been called.
Definition: IdealConsolidator.cpp:76
TermTranslator.h
BigIdeal::clear
void clear()
Definition: BigIdeal.cpp:218
IdealConsolidator::_names
VarNames _names
Definition: IdealConsolidator.h:49
VarNames
Defines the variables of a polynomial ring and facilities IO involving them.
Definition: VarNames.h:40
IdealConsolidator::IdealConsolidator
IdealConsolidator(auto_ptr< BigTermConsumer > consumer)
Definition: IdealConsolidator.cpp:23
ASSERT
#define ASSERT(X)
Definition: stdinc.h:85
IdealConsolidator::_ideal
BigIdeal _ideal
Definition: IdealConsolidator.h:48
BigIdeal::getVarCount
size_t getVarCount() const
Definition: BigIdeal.h:148
IdealConsolidator::doneConsumingList
virtual void doneConsumingList()
Must be called once after each time beginConsumingList has been called.
Definition: IdealConsolidator.cpp:84
IdealConsolidator::beginConsuming
virtual void beginConsuming()
Tell the consumer to begin consuming an ideal.
Definition: IdealConsolidator.cpp:47