
#include <gecode/minimodel.hh>Go to the source code of this file.
Classes | |
| class | Gecode::SetExpr::Node |
| Node for set expression More... | |
| class | Gecode::MiniModel::SetNonLinIntExpr |
| Integer valued set expressions. More... | |
Namespaces | |
| Gecode | |
| Gecode toplevel namespace | |
| Gecode::MiniModel | |
| Minimalistic modeling support. | |
Functions | |
| SetExpr | Gecode::operator& (const SetExpr &, const SetExpr &) |
| Intersection of set expressions. More... | |
| SetExpr | Gecode::operator| (const SetExpr &, const SetExpr &) |
| Union of set expressions. More... | |
| SetExpr | Gecode::operator+ (const SetExpr &, const SetExpr &) |
| Disjoint union of set expressions. More... | |
| SetExpr | Gecode::operator- (const SetExpr &) |
| Complement expression. More... | |
| SetExpr | Gecode::operator- (const SetExpr &, const SetExpr &) |
| Difference of set expressions. More... | |
| SetExpr | Gecode::singleton (const LinIntExpr &) |
| Singleton expression. More... | |
| SetExpr | Gecode::inter (const SetVarArgs &) |
| Intersection of set variables. More... | |
| SetExpr | Gecode::setunion (const SetVarArgs &) |
| Union of set variables. More... | |
| SetExpr | Gecode::setdunion (const SetVarArgs &) |
| Disjoint union of set variables. More... | |
| LinIntExpr | Gecode::cardinality (const SetExpr &) |
| Cardinality of set expression. More... | |
| LinIntExpr | Gecode::min (const SetExpr &) |
| Minimum element of set expression. More... | |
| LinIntExpr | Gecode::max (const SetExpr &) |
| Minimum element of set expression. More... | |
| SetVar | Gecode::expr (Home home, const SetExpr &e) |
| Post set expression and return its value. More... | |
| NodeType t |
Type of node.
Definition at line 117 of file set-expr.cpp.
| int p |
Number of positive literals for node type.
Definition at line 119 of file set-expr.cpp.
| int n |
Number of negative literals for node type.
Definition at line 121 of file set-expr.cpp.
| NNF* l |
Left subtree.
Definition at line 127 of file set-expr.cpp.
| NNF* r |
Right subtree.
Definition at line 129 of file set-expr.cpp.
| struct { ... } b |
For binary nodes (and, or, eqv)
| Node* x |
Pointer to corresponding Boolean expression node.
Definition at line 134 of file set-expr.cpp.
| struct { ... } a |
For atomic nodes.
| union { ... } u |
Union depending on nodetype t.
| bool neg |
Is formula negative.
Definition at line 138 of file set-expr.cpp.