58 Clause(
const vector<Literal>& new_lits) : c(new_lits) {
60 if (new_lits.size() == 0)
61 cerr <<
"Why are you constructing an empty clause?" << endl;
67 inline size_t size()
const {
return c.size(); }
71 inline bool empty()
const {
return c.empty(); }
75 inline void clear() { c.clear(); }
130 string to_string(
bool =
false)
const;
146 vector<Literal>::const_iterator cbegin()
const {
return c.cbegin(); }
147 vector<Literal>::const_iterator cend()
const {
return c.cend(); }
148 vector<Literal>::iterator begin() {
return c.begin(); }
149 vector<Literal>::iterator end() {
return c.end(); }
151 friend ostream& operator<<(ostream&,
const Clause&);
Representation of clauses.
Definition Clause.hpp:45
Literal & operator[](size_t)
Direct read of the specified Literal.
Definition Clause.cpp:120
Literal extract_literal(LitNum)
Get rid of and return the specified Literal.
Definition Clause.cpp:96
bool empty() const
Straightforward get method.
Definition Clause.hpp:71
void clear()
Straightforward reset method.
Definition Clause.hpp:75
string to_prolog_string() const
Convert to a string that can be read by Prolog.
Definition Clause.cpp:139
Clause make_copy_with_new_vars(VariableIndex &, TermIndex &) const
Make a copy of an entire clause, introducing new variables.
Definition Clause.cpp:63
bool is_positive() const
A clause is positive if it has no negated literals.
Definition Clause.cpp:28
void add_lit(const Literal &)
Add a literal, making sure you don't duplicate.
Definition Clause.cpp:52
size_t size() const
Straightforward get method.
Definition Clause.hpp:67
bool is_negative() const
A clause is negative if it has only negated literals.
Definition Clause.cpp:40
string make_LaTeX(bool=false) const
Convert the clause to a LaTeX representation.
Definition Clause.cpp:150
Clause(const vector< Literal > &new_lits)
Construction is just taking a new vector of Literals.
Definition Clause.hpp:58
void drop_literal(LitNum)
Get rid of the specified Literal.
Definition Clause.cpp:75
Basic representation of literals, bundling together (pointers to) a Predicate, a collection of argume...
Definition Literal.hpp:50
Look after terms, using hash consing to avoid storing copies of terms.
Definition TermIndex-hash.hpp:26
Storage of named variables, and management of new, anonymous variables.
Definition VariableIndex.hpp:61