17#ifndef SAT_BINOM_IDEAL_GUARD
18#define SAT_BINOM_IDEAL_GUARD
31 SatBinomIdeal(
const VarNames& names);
33 void insert(
const vector<mpz_class>& binom);
34 const vector<mpz_class>& getGenerator(
size_t index)
const;
35 size_t getGeneratorCount()
const;
37 void print(FILE* file)
const;
38 void print(ostream& out)
const;
40 void clearAndSetNames(
const VarNames& names);
42 void removeGeneratorsWithLeadingZero();
44 void removeGeneratorsWithoutLeadingZero();
46 void getInitialIdeal(
BigIdeal& ideal)
const;
51 size_t getVarCount()
const;
55 void reserve(
size_t size);
56 vector<mpz_class>& getLastBinomRef();
84 const vector<mpz_class>& b)
const;
89 const vector<mpz_class>& b,
90 const vector<mpz_class>& c)
const;
94 const vector<mpz_class>& b)
const;
113 bool isGenerator(
const vector<mpz_class>& v)
const;
115 void projectVar(
size_t var);
117 SatBinomIdeal& operator=(
const SatBinomIdeal& ideal);
119 void getMatrix(
Matrix& matrix)
const;
122 vector<vector<mpz_class> > _gens;
126ostream& operator<<(ostream& out,
const SatBinomIdeal& ideal);
Represents a saturated binomial ideal.
Definition SatBinomIdeal.h:28
void getDoubleTriangleCount(mpz_class &count) const
Definition SatBinomIdeal.cpp:308
bool isGeneric() const
Definition SatBinomIdeal.cpp:327
bool validate() const
Definition SatBinomIdeal.cpp:246
bool isInterior(const vector< mpz_class > &a, const vector< mpz_class > &b) const
Definition SatBinomIdeal.cpp:213
bool isPointFreeBody(const vector< mpz_class > &a, const vector< mpz_class > &b) const
Definition SatBinomIdeal.cpp:175
bool isInteriorEdge(size_t from, size_t to) const
Definition SatBinomIdeal.cpp:280
void renameVars(const VarNames &names)
Requires that names.getVarCount() equals getVarCount().
Definition SatBinomIdeal.cpp:76
bool isTerminatingEdge(size_t from, size_t to) const
Definition SatBinomIdeal.cpp:295
bool hasZeroEntry() const
Definition SatBinomIdeal.cpp:140
bool isDominating(const vector< mpz_class > &v) const
Definition SatBinomIdeal.cpp:337
bool initialIdealIsWeaklyGeneric() const
Returns true if the initial ideal is weakly generic.
Definition SatBinomIdeal.cpp:148
bool isGenerator(const vector< mpz_class > &v) const
Returns true if v is a generator.
Definition SatBinomIdeal.cpp:353