SatBinomIdeal.h

Go to the documentation of this file.

/* Frobby: Software for monomial ideal computations.
   Copyright (C) 2009 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/.
*/
#ifndef SAT_BINOM_IDEAL_GUARD
#define SAT_BINOM_IDEAL_GUARD
 
#include "VarNames.h"
 
#include <vector>
 
class BigIdeal;
class Matrix;
 
class SatBinomIdeal {
 public:
  SatBinomIdeal();
  SatBinomIdeal(const VarNames& names);
 
  void insert(const vector<mpz_class>& binom);
  const vector<mpz_class>& getGenerator(size_t index) const;
  size_t getGeneratorCount() const;
 
  void print(FILE* file) const;
  void print(ostream& out) const;
 
  void clearAndSetNames(const VarNames& names);
 
  void removeGeneratorsWithLeadingZero();
 
  void removeGeneratorsWithoutLeadingZero();
 
  void getInitialIdeal(BigIdeal& ideal) const;
 
  void renameVars(const VarNames& names);
 
  size_t getVarCount() const;
 
  void clear();
 
  void reserve(size_t size);
  vector<mpz_class>& getLastBinomRef();
  void newLastTerm();
 
  const VarNames& getNames() const;
 
  bool hasZeroEntry() const;
 
  bool initialIdealIsWeaklyGeneric() const;
 
  bool isGeneric() const;
 
  void getDoubleTriangleCount(mpz_class& count) const;
 
  bool isPointFreeBody(const vector<mpz_class>& a,
                       const vector<mpz_class>& b) const;
 
  bool isPointFreeBody(const vector<mpz_class>& a,
                       const vector<mpz_class>& b,
                       const vector<mpz_class>& c) const;
 
  bool isInterior(const vector<mpz_class>& a,
                  const vector<mpz_class>& b) const;
 
  bool isInteriorEdge(size_t from, size_t to) const;
 
  bool isTerminatingEdge(size_t from, size_t to) const;
 
  bool validate() const;
 
  bool isDominating(const vector<mpz_class>& v) const;
 
  bool isGenerator(const vector<mpz_class>& v) const;
 
  void projectVar(size_t var);
 
  SatBinomIdeal& operator=(const SatBinomIdeal& ideal);
 
  void getMatrix(Matrix& matrix) const;
 
 private:
  vector<vector<mpz_class> > _gens;
  VarNames _names;
};
 
ostream& operator<<(ostream& out, const SatBinomIdeal& ideal);
 
#endif