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::Element::ElementIntersection |
Propagator for element with intersection More... | |
class | Gecode::Set::Element::ElementUnion |
Propagator for element with union More... | |
class | Gecode::Set::Element::ElementUnionConst |
Propagator for element with union of constant sets More... | |
class | Gecode::Set::Element::ElementDisjoint |
Propagator for element with disjointness More... | |
class | Gecode::Set::Int::MinElement |
Propagator for minimum element More... | |
class | Gecode::Set::Int::NotMinElement |
Propagator for not minimum element More... | |
class | Gecode::Set::Int::ReMinElement |
Propagator for reified minimum element More... | |
class | Gecode::Set::Int::MaxElement |
Propagator for maximum element More... | |
class | Gecode::Set::Int::NotMaxElement |
Propagator for not maximum element More... | |
class | Gecode::Set::Int::ReMaxElement |
Reified propagator 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::ChannelInt |
Propagator for channelling between variable-value-dual models More... | |
class | Gecode::Set::Int::ChannelBool |
Propagator for channelling between set variable and its characteristic function More... | |
class | Gecode::Set::Int::Weights |
Propagator for weight of a set More... | |
class | Gecode::Set::RelOp::SuperOfInter |
Propagator for the superset of intersection More... | |
class | Gecode::Set::RelOp::SubOfUnion |
Propagator for the subset of union More... | |
class | Gecode::Set::RelOp::Intersection |
Propagator for ternary intersection More... | |
class | Gecode::Set::RelOp::Union |
Propagator for ternary union More... | |
class | Gecode::Set::RelOp::IntersectionN |
Propagator for nary intersection More... | |
class | Gecode::Set::RelOp::UnionN |
Propagator for nary union More... | |
class | Gecode::Set::RelOp::PartitionN |
Propagator for nary partition More... | |
class | Gecode::Set::Rel::Subset |
Propagator for the subset constraint More... | |
class | Gecode::Set::Rel::NoSubset |
Propagator for the negated subset constraint More... | |
class | Gecode::Set::Rel::ReSubset |
Reified subset propagator More... | |
class | Gecode::Set::Rel::Eq |
Propagator for set equality More... | |
class | Gecode::Set::Rel::ReEq |
Reified equality propagator More... | |
class | Gecode::Set::Rel::Lq |
Propagator for set less than or equal More... | |
class | Gecode::Set::Rel::ReLq |
Reified propagator for set less than or equal More... | |
class | Gecode::Set::Rel::Distinct |
Propagator for negated equality More... | |
class | Gecode::Set::Rel::DistinctDoit |
Propagator for negated equality More... | |
class | Gecode::Set::Sequence::Seq |
Propagator for the sequence constraint More... | |
class | Gecode::Set::Sequence::SeqU |
Propagator for the sequenced union constraint More... |
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.