![]() |
Connect++ 0.1
A fast, readable connection prover for first-order logic.
|
Basic representation of predicates: here just names, ids and arities. More...
#include <Predicate.hpp>
Public Member Functions | |
| Predicate (const Predicate &)=delete | |
| Don't allow copies of these to be made. | |
| Predicate (const Predicate &&)=delete | |
| Predicate & | operator= (const Predicate &)=delete |
| Predicate & | operator= (const Predicate &&)=delete |
| ID | get_ID () const |
| Basic get method. | |
| string | get_name () const |
| Basic get method. | |
| Arity | get_arity () const |
| Basic get method. | |
| bool | is_compatible_with (const Predicate &) const |
| Do the name and the arity of a pair of Predicates both match? | |
| string | to_string () const |
| Converting to a string just gives you the name. | |
| string | make_LaTeX () const |
| Make a useable LaTeX version. | |
Friends | |
| class | PredicateIndex |
| ostream & | operator<< (ostream &, const Predicate &) |
| Only for debugging. | |
Basic representation of predicates: here just names, ids and arities.
This really just acts as identification. See the Literal class, which is where Predicate and Term get connected together. (No pun intended.)
|
delete |
Don't allow copies of these to be made.
As usual, let the compiler find any errors because you should never need to make copies this way.
| bool Predicate::is_compatible_with | ( | const Predicate & | p2 | ) | const |
Do the name and the arity of a pair of Predicates both match?
| p2 | Predicate to copare with |
| string Predicate::make_LaTeX | ( | ) | const |
Make a useable LaTeX version.
Assumes you are typesetting in Math Mode.
|
friend |
Only for debugging.
Use Predicate::to_string if you want something pretty.