52#ifndef DOXYGEN_SHOULD_SKIP_THIS
57 return Size(key.id());
85 out << col.toString();
90 std::string res =
"V";
91 return res.append(std::to_string(
_id_));
94 INLINE
void swap(HashTable< LpCol, double >*& a, HashTable< LpCol, double >*& b) {
95 HashTable< LpCol, double >* tmp(a);
101 out << expr.toString();
Class representing a polytope ( credal set ) by a set of linear constraints.
virtual Size operator()(const credal::lp::LpCol &key) const override final
Overload of operator () to compute hash of a variable LpCol.
static Size castToSize(const credal::lp::LpCol &key)
Returns the value of a key as a Size.
Class representing a variable ( a column ) of a linear program, i.e.
bool operator!=(const LpCol &col) const
Opposite of equality != test between two variables.
LpCol & operator=(const LpCol &col)
Assignment operator = by copy.
bool operator<(const LpCol &col) const
Test of ordering < between two variables.
std::string toString() const
Get the string representation of a calling variable.
unsigned int id() const
Variable id accessor.
unsigned int _id_
Variable id.
bool operator==(const LpCol &col) const
Test of equality == between two variables.
Class representing a linear expression.
std::size_t Size
In aGrUM, hashed values are unsigned long int.
namespace for constraint-based description of credal sets
std::ostream & operator<<(std::ostream &out, const LpRow &row)
void swap(HashTable< LpCol, double > *&a, HashTable< LpCol, double > *&b)
Swap the addresses of two pointers to hashTables.
namespace for all credal networks entities
gum is the global namespace for all aGrUM entities
static constexpr Size gold