public class PropAtLeastNValues extends Propagator<IntVar>
constraint, model, priority, reactToFineEvt, vars| Constructor and Description |
|---|
PropAtLeastNValues(IntVar[] variables,
int[] concernedValues,
IntVar nValues)
Propagator for the NValues constraint
The number of distinct values among concerned values in the set of variables vars is exactly equal to nValues
No level of consistency for the filtering
|
| Modifier and Type | Method and Description |
|---|---|
ESat |
isEntailed()
Check wether
this is entailed according to the current state of its internal structure. |
void |
propagate(int evtmask)
Call the main filtering algorithm to apply to the
Domain of the Variable objects. |
addVariable, arity, compareTo, dynPriority, equals, fails, forcePropagate, forcePropagationOnBacktrack, getConstraint, getId, getModel, getNbVars, getPriority, getPropagationConditions, getVar, getVars, getVIndice, getVIndices, hashCode, isActive, isCompletelyInstantiated, isPassive, isReifiedAndSilent, isStateLess, linkVariables, propagate, reactToFineEvent, setActive, setPassive, setReifiedSilent, setReifiedTrue, setVIndices, toString, unlinkVariables, whypublic PropAtLeastNValues(IntVar[] variables, int[] concernedValues, IntVar nValues)
variables - array of integer variablesconcernedValues - will be sorted!nValues - integer variablepublic void propagate(int evtmask)
throws ContradictionException
PropagatorDomain of the Variable objects.
It considers the current state of this objects to remove some values from domains and/or instantiate some variables.
Calling this method is done from 2 (and only 2) steps:
propagate in class Propagator<IntVar>evtmask - type of propagation event this must consider.ContradictionException - when a contradiction occurs, like domain wipe out or other incoherencies.public ESat isEntailed()
Propagatorthis is entailed according to the current state of its internal structure.
At least, should check the satisfaction of this (when all is instantiated).isEntailed in class Propagator<IntVar>Copyright © 2017. All rights reserved.