Set propagators
[Other available functionality]
Collaboration diagram for Set propagators:
![]() |
Detailed Description
This module contains a description of all predefined finite set propagators. They can be reused, for example, for rewriting newly defined finite set propagators into already available propagators.
Classes | |
class | Gecode::Set::Convex::Convex |
Propagator for the convex constraint More... | |
class | Gecode::Set::Convex::ConvexHull |
Propagator for the convex hull constraint More... | |
class | Gecode::Set::Distinct::AtmostOne |
Propagator for the AtMostOneIntersection constraint More... | |
class | Gecode::Set::Distinct::Distinct |
Propagator for the n-ary distinct constraint with fixed cardinalities More... | |
class | Gecode::Set::Int::MinElement |
Propator for minimum element More... | |
class | Gecode::Set::Int::MaxElement |
Propator for maximum element More... | |
class | Gecode::Set::Int::Card |
Propagator for cardinality More... | |
class | Gecode::Set::Int::Match |
Propagator for the match constraint More... | |
class | Gecode::Set::Int::Channel |
Propagator for channelling between variable-value-dual models More... | |
class | Gecode::Set::Int::Weights |
Propagator for weight of a set More... | |
class | Gecode::Set::RelOp::SuperOfInter< View0, View1, View2 > |
Propagator for the superset of intersection More... | |
class | Gecode::Set::RelOp::SubOfUnion< View0, View1, View2 > |
Propagator for the subset of union More... | |
class | Gecode::Set::RelOp::Intersection< View0, View1, View2 > |
Propagator for ternary intersection More... | |
class | Gecode::Set::RelOp::Union< View0, View1, View2 > |
Propagator for ternary union More... | |
class | Gecode::Set::RelOp::IntersectionN< View0, View1 > |
Propagator for nary intersection More... | |
class | Gecode::Set::RelOp::UnionN< View0, View1 > |
Propagator for nary union More... | |
class | Gecode::Set::RelOp::PartitionN< View0, View1 > |
Propagator for nary partition More... | |
class | Gecode::Set::Rel::SubSet< View0, View1 > |
Propagator for the subset constraint More... | |
class | Gecode::Set::Rel::NoSubSet< View0, View1 > |
Propagator for the negated subset constraint More... | |
class | Gecode::Set::Rel::ReSubset< View0, View1 > |
Reified subset propagator More... | |
class | Gecode::Set::Rel::Eq< View0, View1 > |
Propagator for set equality More... | |
class | Gecode::Set::Rel::ReEq< View0, View1 > |
Reified equality propagator More... | |
class | Gecode::Set::Rel::Distinct< View0, View1 > |
Propagator for negated equality More... | |
class | Gecode::Set::Rel::DistinctDoit< View0, View1 > |
Propagator for negated equality More... | |
class | Gecode::Set::Select::SelectIntersection< SView, RView > |
Propagator for selected intersection More... | |
class | Gecode::Set::Select::SelectDisjoint |
Propagator for selected disjointness More... | |
class | Gecode::Set::Sequence::Seq |
Propagator for the sequence constraint More... | |
class | Gecode::Set::Sequence::SeqU |
Propagator for the sequenced union constraint More... |