Frobby  0.9.1
intersect.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 "intersect.h"
19 
20 #include "Ideal.h"
21 #include "Term.h"
22 
23 void intersect(Ideal* output, const Ideal* a, const Ideal* b) {
24  ASSERT(a->getVarCount() == b->getVarCount());
25  output->clear();
26 
27  Term term(a->getVarCount());
28  for (Ideal::const_iterator aIt = a->begin(); aIt != a->end(); ++aIt) {
29  for (Ideal::const_iterator bIt = b->begin(); bIt != b->end();++bIt) {
30  term.lcm(*aIt, *bIt);
31  output->insert(term);
32  }
33  }
34 
35  output->minimize();
36 }
stdinc.h
Ideal::minimize
void minimize()
Definition: Ideal.cpp:501
Ideal::const_iterator
Cont::const_iterator const_iterator
Definition: Ideal.h:43
Term::lcm
static void lcm(Exponent *res, const Exponent *a, const Exponent *b, size_t varCount)
Sets res equal to the least commom multiple of a and b.
Definition: Term.h:221
Ideal::begin
const_iterator begin() const
Definition: Ideal.h:48
intersect
void intersect(Ideal *output, const Ideal *a, const Ideal *b)
Definition: intersect.cpp:23
Term.h
Ideal::end
const_iterator end() const
Definition: Ideal.h:49
Ideal.h
Term
Term represents a product of variables which does not include a coefficient.
Definition: Term.h:49
Ideal::getVarCount
size_t getVarCount() const
Definition: Ideal.h:56
Ideal::clear
void clear()
Definition: Ideal.cpp:641
Ideal
Represents a monomial ideal with int exponents.
Definition: Ideal.h:27
Ideal::insert
void insert(const Exponent *term)
Definition: Ideal.cpp:455
intersect.h
ASSERT
#define ASSERT(X)
Definition: stdinc.h:86