|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectchoco.kernel.solver.propagation.Propagator
choco.kernel.solver.constraints.AbstractSConstraint<IntDomainVar>
choco.kernel.solver.constraints.integer.AbstractIntSConstraint
choco.kernel.solver.constraints.integer.AbstractLargeIntSConstraint
choco.cp.solver.constraints.global.automata.fast_costregular.CostRegular
public class CostRegular
Created by IntelliJ IDEA. User: julien Date: Feb 4, 2010 Time: 1:03:04 PM
Field Summary | |
---|---|
protected IEnvironment |
environment
|
Fields inherited from class choco.kernel.solver.constraints.AbstractSConstraint |
---|
cIndices, constraintType, extensions, vars |
Fields inherited from class choco.kernel.solver.propagation.Propagator |
---|
active, constAwakeEvent, priority, propagationEngine |
Fields inherited from interface choco.kernel.solver.constraints.SConstraint |
---|
LOGGER |
Constructor Summary | |
---|---|
CostRegular(IntDomainVar[] vars,
org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
Node source,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
IAutomaton pi,
int[][][] costs,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
IAutomaton pi,
int[][] costs,
Solver s)
|
|
CostRegular(IntDomainVar[] vars,
ICostAutomaton pi,
Solver s)
|
Method Summary | |
---|---|
void |
awake()
Propagation: Propagating the constraint for the very first time until local consistency is reached. |
void |
awakeOnBounds(int idx)
|
void |
awakeOnInf(int idx)
Default propagation on improved lower bound: propagation on domain revision. |
void |
awakeOnInst(int idx)
Default propagation on instantiation: full constraint re-propagation. |
void |
awakeOnRem(int idx,
int val)
Default propagation on one value removal: propagation on domain revision. |
void |
awakeOnRemovals(int idx,
DisposableIntIterator it2)
The default implementation of propagation when a variable has been modified consists in iterating all values that have been removed (the delta domain) and propagate them one after another, incrementally. |
void |
awakeOnSup(int idx)
Default propagation on improved upper bound: propagation on domain revision. |
protected void |
checkWorld()
|
int |
getFilteredEventMask(int idx)
|
void |
initGraph(org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph,
Node source)
|
void |
initGraph(ICostAutomaton pi)
|
boolean |
isSatisfied(int[] tuple)
TEMPORARY: if not overriden by the constraint, throws an error to avoid bug using reified constraints in constraints that have not been changed to fulfill this api yet ! |
void |
prefilter()
|
void |
propagate()
Propagation: Propagating the constraint until local consistency is reached. |
Methods inherited from class choco.kernel.solver.constraints.integer.AbstractIntSConstraint |
---|
getConstraintType, isConsistent, isSatisfied |
Methods inherited from class choco.kernel.solver.constraints.AbstractSConstraint |
---|
addExtension, addListener, clone, getAbstractSConstraintExtensionNumber, getConstraintIdx, getExtension, getFineDegree, getNbVarNotInst, getNbVars, getVar, getVarQuick, isCompletelyInstantiated, isEntailed, opposite, pretty, setConstraintIndex, setExtension, setVar, toString |
Methods inherited from class choco.kernel.solver.propagation.Propagator |
---|
activate, constAwake, fail, getEvent, getPriority, isActive, setActive, setActiveSilently, setEntailed, setPassive, setPropagationEngine |
Methods inherited from class java.lang.Object |
---|
equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Field Detail |
---|
protected final IEnvironment environment
Constructor Detail |
---|
public CostRegular(IntDomainVar[] vars, IAutomaton pi, int[][][] costs, Solver s)
public CostRegular(IntDomainVar[] vars, IAutomaton pi, int[][] costs, Solver s)
public CostRegular(IntDomainVar[] vars, ICostAutomaton pi, Solver s)
public CostRegular(IntDomainVar[] vars, org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph, Node source, Solver s)
Method Detail |
---|
public void initGraph(org.jgrapht.graph.DirectedMultigraph<Node,Arc> graph, Node source)
public void initGraph(ICostAutomaton pi) throws ContradictionException
ContradictionException
public void awake() throws ContradictionException
Propagator
awake
in class Propagator
ContradictionException
- contradiction exceptionpublic void prefilter() throws ContradictionException
ContradictionException
protected void checkWorld()
public void awakeOnRemovals(int idx, DisposableIntIterator it2) throws ContradictionException
AbstractIntSConstraint
awakeOnRemovals
in interface IntPropagator
awakeOnRemovals
in class AbstractIntSConstraint
ContradictionException
public void awakeOnInf(int idx) throws ContradictionException
AbstractIntSConstraint
awakeOnInf
in interface IntPropagator
awakeOnInf
in class AbstractIntSConstraint
ContradictionException
public void awakeOnSup(int idx) throws ContradictionException
AbstractIntSConstraint
awakeOnSup
in interface IntPropagator
awakeOnSup
in class AbstractIntSConstraint
ContradictionException
public void awakeOnInst(int idx)
AbstractIntSConstraint
awakeOnInst
in interface IntPropagator
awakeOnInst
in class AbstractIntSConstraint
public void awakeOnBounds(int idx)
awakeOnBounds
in interface IntPropagator
awakeOnBounds
in class AbstractIntSConstraint
public void awakeOnRem(int idx, int val)
AbstractIntSConstraint
awakeOnRem
in interface IntPropagator
awakeOnRem
in class AbstractIntSConstraint
public void propagate() throws ContradictionException
Propagator
propagate
in class Propagator
ContradictionException
- contradiction exceptionpublic final int getFilteredEventMask(int idx)
getFilteredEventMask
in class Propagator
public boolean isSatisfied(int[] tuple)
AbstractIntSConstraint
isSatisfied
in interface IntPropagator
isSatisfied
in class AbstractIntSConstraint
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |