Module org.chocosolver
Package org.chocosolver.solver.constraints.set

Class Summary Class Description PropAllDiff Ensures that all sets are differentPropAllDisjoint Ensures that all nonempty sets are disjoint In order to forbid multiple empty set, use propagator PropAtMost1Empty in additionPropAllEqual Ensures that all sets are equalPropAtMost1Empty At most one set can be emptyPropBoolChannel Channeling between a set variable and boolean variablesPropCardinality A propagator ensuring that set = cardPropElement Propagator for element constraint over sets states that array[indexoffSet] = setPropIntBoundedMemberSet Propagator for Member constraint: iv is in setPropIntChannel Channeling between set variables and integer variables x in sets[yoffSet1] <=> ints[xoffSet2] = yPropIntCstMemberSet Propagator for Member constraint: int cst is in setPropIntCstNotMemberSet Propagator for Member constraint: int cst is not in setPropIntEnumMemberSet Propagator for Member constraint: iv is in setPropIntersection PropIntersectionFilterSets PropInverse Inverse set propagator x in sets[yoffSet1] <=> y in inverses[xoffSet2]PropMaxElement Retrieves the maximum element of the set the set must not be emptyPropMinElement Retrieves the minimum element of the set the set must not be emptyPropNbEmpty Restricts the number of empty sets {s in sets such that s=0} = nbEmptyPropNotEmpty Restricts the set var not to be emptyPropNotMemberIntSet Not Member propagator filtering Int>SetPropNotMemberSetInt Not Member propagator filtering Set>IntPropOffSet set2 is an offSet view of set1 x in set1 <=> x+offSet in set2PropSetIntValuesUnion Maintain a link between a set variable and the union of values taken by an array of integer variables Not idempotent (use two of them)PropSubsetEq Ensures that X subseteq YPropSumOfElements Sums elements given by a set variablePropSymmetric Propagator for symmetric sets x in set[yoffSet] <=> y in set[xoffSet]PropUnion