| PropAllDiff |
Ensures that all sets are different
|
| PropAllDisjoint |
Ensures that all non-empty sets are disjoint
In order to forbid multiple empty set, use propagator PropAtMost1Empty in addition
|
| PropAllEqual |
Ensures that all sets are equal
|
| PropAtMost1Empty |
At most one set can be empty
|
| PropBoolChannel |
Channeling between a set variable and boolean variables
|
| PropCardinality |
A propagator ensuring that |set| = card
|
| PropElement |
Propagator for element constraint over sets
states that
array[index-offSet] = set
|
| PropIntBoundedMemberSet |
Propagator for Member constraint: iv is in set
|
| PropIntChannel |
Channeling between set variables and integer variables
x in sets[y-offSet1] <=> ints[x-offSet2] = y
|
| PropIntCstMemberSet |
Propagator for Member constraint: int cst is in set
|
| PropIntCstNotMemberSet |
Propagator for Member constraint: int cst is not in set
|
| PropIntEnumMemberSet |
Propagator for Member constraint: iv is in set
|
| PropIntersection |
|
| PropIntersectionFilterSets |
|
| PropInverse |
Inverse set propagator
x in sets[y-offSet1] <=> y in inverses[x-offSet2]
|
| PropMaxElement |
Retrieves the maximum element of the set
the set must not be empty
|
| PropMinElement |
Retrieves the minimum element of the set
the set must not be empty
|
| PropNbEmpty |
Restricts the number of empty sets
|{s in sets such that |s|=0}| = nbEmpty
|
| PropNotEmpty |
Restricts the set var not to be empty
|
| PropNotMemberIntSet |
Not Member propagator filtering Int->Set
|
| PropNotMemberSetInt |
Not Member propagator filtering Set->Int
|
| PropOffSet |
set2 is an offSet view of set1
x in set1 <=> x+offSet in set2
|
| PropSetIntValuesUnion |
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 Y
|
| PropSumOfElements |
Sums elements given by a set variable
|
| PropSymmetric |
Propagator for symmetric sets
x in set[y-offSet] <=> y in set[x-offSet]
|
| PropUnion |
|