56 std::size_t
id() const noexcept {
68 return os << sv.
sort() <<
"!val!" << sv.
id();
76 return lhs.
id() == rhs.
id();
84 return lhs.
id() < rhs.
id();
94 struct hash<
carl::SortValue> {
carl is the main namespace for the library.
bool operator<(const BasicConstraint< P > &lhs, const BasicConstraint< P > &rhs)
std::ostream & operator<<(std::ostream &os, const BasicConstraint< Poly > &c)
Prints the given constraint on the given stream.
bool operator==(const BasicConstraint< P > &lhs, const BasicConstraint< P > &rhs)
std::size_t hash_all(Args &&... args)
Hashes an arbitrary number of values.
Implements a sort (for defining types of variables and functions).
Implements a sort value, being a value of the uninterpreted domain specified by this sort.
std::size_t mId
A unique id to identify this sort in the sort value manager.
std::size_t id() const noexcept
SortValue(Sort _sort, std::size_t _id)
Constructs a sort value.
carl::Sort mSort
The sort defining the domain in which this value is.
const carl::Sort & sort() const noexcept
SortValue() noexcept=default
std::size_t operator()(const carl::SortValue &sv) const
Implements a manager for sort values, containing the actual contents of these sort and allocating the...