Uses of Interface
org.chocosolver.solver.ICause

Packages that use ICause

Package	Description
org.chocosolver.sat
org.chocosolver.solver	A package devoted to Model and resolution tools.
org.chocosolver.solver.constraints
org.chocosolver.solver.constraints.binary
org.chocosolver.solver.constraints.binary.element
org.chocosolver.solver.constraints.extension.binary
org.chocosolver.solver.constraints.extension.nary
org.chocosolver.solver.constraints.graph.basic
org.chocosolver.solver.constraints.graph.channeling.edges
org.chocosolver.solver.constraints.graph.channeling.nodes
org.chocosolver.solver.constraints.graph.connectivity
org.chocosolver.solver.constraints.graph.cost.trees
org.chocosolver.solver.constraints.graph.cost.trees.lagrangian
org.chocosolver.solver.constraints.graph.cost.tsp
org.chocosolver.solver.constraints.graph.cost.tsp.lagrangian
org.chocosolver.solver.constraints.graph.cycles
org.chocosolver.solver.constraints.graph.degree
org.chocosolver.solver.constraints.graph.inclusion
org.chocosolver.solver.constraints.graph.symmbreaking
org.chocosolver.solver.constraints.graph.tree
org.chocosolver.solver.constraints.nary
org.chocosolver.solver.constraints.nary.alldifferent
org.chocosolver.solver.constraints.nary.alldifferent.algo
org.chocosolver.solver.constraints.nary.alldifferent.conditions
org.chocosolver.solver.constraints.nary.alldifferentprec
org.chocosolver.solver.constraints.nary.among
org.chocosolver.solver.constraints.nary.automata
org.chocosolver.solver.constraints.nary.automata.structure.costregular
org.chocosolver.solver.constraints.nary.binPacking
org.chocosolver.solver.constraints.nary.channeling
org.chocosolver.solver.constraints.nary.circuit
org.chocosolver.solver.constraints.nary.clauses
org.chocosolver.solver.constraints.nary.count
org.chocosolver.solver.constraints.nary.cumulative
org.chocosolver.solver.constraints.nary.element
org.chocosolver.solver.constraints.nary.flow
org.chocosolver.solver.constraints.nary.globalcardinality
org.chocosolver.solver.constraints.nary.knapsack
org.chocosolver.solver.constraints.nary.lex
org.chocosolver.solver.constraints.nary.min_max
org.chocosolver.solver.constraints.nary.nvalue
org.chocosolver.solver.constraints.nary.sat
org.chocosolver.solver.constraints.nary.sort
org.chocosolver.solver.constraints.nary.sum
org.chocosolver.solver.constraints.nary.tree
org.chocosolver.solver.constraints.real
org.chocosolver.solver.constraints.reification
org.chocosolver.solver.constraints.set
org.chocosolver.solver.constraints.ternary
org.chocosolver.solver.constraints.unary
org.chocosolver.solver.exception
org.chocosolver.solver.expression.continuous.arithmetic
org.chocosolver.solver.expression.continuous.relational
org.chocosolver.solver.learn
org.chocosolver.solver.objective
org.chocosolver.solver.propagation
org.chocosolver.solver.search.loop.lns.neighbors
org.chocosolver.solver.search.strategy.assignments
org.chocosolver.solver.search.strategy.decision
org.chocosolver.solver.search.strategy.selectors.variables
org.chocosolver.solver.search.strategy.strategy
org.chocosolver.solver.variables
org.chocosolver.solver.variables.delta
org.chocosolver.solver.variables.delta.monitor
org.chocosolver.solver.variables.impl
org.chocosolver.solver.variables.view
org.chocosolver.solver.variables.view.bool
org.chocosolver.solver.variables.view.graph
org.chocosolver.solver.variables.view.graph.directed
org.chocosolver.solver.variables.view.graph.undirected
org.chocosolver.solver.variables.view.integer
org.chocosolver.solver.variables.view.set
org.chocosolver.util.objects

Uses of ICause in org.chocosolver.sat

Methods in org.chocosolver.sat with parameters of type ICause

Modifier and Type	Method	Description
void	SatDecorator.applyEarlyDeductions(ICause cause)
void	SatDecorator.bound(Variable cpvar, ICause cause)
boolean	Literalizer.BoolLit.toEvent(int lit, ICause cause)
boolean	Literalizer.IntEqLit.toEvent(int lit, ICause cause)
boolean	Literalizer.IntLeLit.toEvent(int lit, ICause cause)
boolean	Literalizer.SetInLit.toEvent(int lit, ICause cause)
boolean	Literalizer.toEvent(int lit, ICause cause)	Turns an event from SAT side (in the form of a literal) to an event in CP side.

Uses of ICause in org.chocosolver.solver

Classes in org.chocosolver.solver that implement ICause

Modifier and Type	Class	Description
class	Cause
class	Solution	Class which stores the value of each variable in a solution

Methods in org.chocosolver.solver with parameters of type ICause

Modifier and Type	Method	Description
void	Solver.throwsException(ICause c, Variable v, java.lang.String s)

Uses of ICause in org.chocosolver.solver.constraints

Classes in org.chocosolver.solver.constraints that implement ICause

Modifier and Type	Class	Description
class	Propagator<V extends Variable>	A Propagator class defines methods to react on a Variable objects modifications.

Uses of ICause in org.chocosolver.solver.constraints.binary

Classes in org.chocosolver.solver.constraints.binary that implement ICause

Modifier and Type	Class	Description
class	PropAbsolute	Enforces X = |Y|
class	PropDistanceXYC	| X - Y | op C op = {"==", "<", ">", "=/="}
class	PropEqualX_Y	X = Y
class	PropEqualX_YC	X = Y + C
class	PropEqualXY_C	X + Y = C
class	PropGreaterOrEqualX_Y	X >= Y
class	PropGreaterOrEqualX_YC	X >= Y + C
class	PropGreaterOrEqualXY_C	X + Y >= C
class	PropLessOrEqualXY_C	X + Y <= C
class	PropModXY	X % mod = Y A propagator for the constraint Y = X % mod where X and Y are integer, possibly negative, variables and mod is an int The filtering algorithm both supports bounded and enumerated integer variables
class	PropNotEqualX_Y	A specific Propagator extension defining filtering algorithm for: X =/= Y where X and Y are Variable objects.
class	PropNotEqualX_YC	A specific Propagator extension defining filtering algorithm for: X =/= Y + C where X and Y are Variable objects and C a constant.
class	PropNotEqualXY_C	A specific Propagator extension defining filtering algorithm for: X + Y =/= C where X and Y are Variable objects and C a constant.
class	PropPowEven	Enforces X = Y^n where n is even
class	PropPowOdd	Enforces X = Y^n
class	PropScale	Scale propagator : ensures x * y = z With y a constant greater than one Ensures AC
class	PropSquare	Enforces X = Y^2

Uses of ICause in org.chocosolver.solver.constraints.binary.element

Classes in org.chocosolver.solver.constraints.binary.element that implement ICause

Modifier and Type	Class	Description
class	PropElement	VALUE = TABLE[INDEX-OFFSET], ensuring arc consistency on result and index.

Uses of ICause in org.chocosolver.solver.constraints.extension.binary

Classes in org.chocosolver.solver.constraints.extension.binary that implement ICause

Modifier and Type	Class	Description
class	PropBinAC2001	AC2001 algorithm for binary table constraint
class	PropBinAC3
class	PropBinAC3bitrm	AC3 bit rm algorithm for binary table constraint
class	PropBinAC3rm
class	PropBinCSP
class	PropBinFC	Forward checking algorithm for table constraint

Uses of ICause in org.chocosolver.solver.constraints.extension.nary

Classes in org.chocosolver.solver.constraints.extension.nary that implement ICause

Modifier and Type	Class	Description
class	PropCompactTable	Propagator for table constraint based on "Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets" Only for feasible Tuples
class	PropCompactTableStar	Propagator for table constraint based on "Extending Compact-Table to Negative and Short Tables", H.
class	PropLargeCSP<R extends LargeRelation>
class	PropLargeFC
class	PropLargeGAC2001
class	PropLargeGAC2001Positive
class	PropLargeGAC3rm
class	PropLargeGAC3rmPositive
class	PropLargeGACSTRPos	GAC maintaind by STR
class	PropLargeMDDC	Implementation based on "Maintaining GAC on adhoc r-ary constraints", Cheng and Yap, CP12.
class	PropTableStr2	STR2 Propagator for table constraints (only positive tuples)

Uses of ICause in org.chocosolver.solver.constraints.graph.basic

Classes in org.chocosolver.solver.constraints.graph.basic that implement ICause

Modifier and Type	Class	Description
class	PropAntiSymmetric	Ensures that the final graph is antisymmetric i.e. if G has arc (x,y) then it does not have (y,x) Except for loops : (x,x) is allowed
class	PropDiameter	Propagator for the diameter constraint
class	PropLoopSet	Propagator to catch the set of loops in a set variable
class	PropNbCliques	Propagator for the number of cliques in a graph
class	PropNbEdges	Propagator that ensures that Nb arcs/edges belong to the final graph
class	PropNbLoops	Propagator that ensures that k loops belong to the final graph
class	PropNbNodes	Propagator that ensures that k nodes belong to the final graph
class	PropSymmetric	Ensures that the final graph is symmetric i.e. if G has arc (x,y) then it also has (y,x)
class	PropTransitivity<V extends GraphVar<?>>	Propagator that ensures that the relation of the graph is transitive : (a,b) + (b,c) implies (a,c)

Uses of ICause in org.chocosolver.solver.constraints.graph.channeling.edges

Classes in org.chocosolver.solver.constraints.graph.channeling.edges that implement ICause

Modifier and Type	Class	Description
class	PropEdgeBoolChannel
class	PropNeighBoolChannel
class	PropNeighBoolsChannel1	Channeling between a graph variable and set variables representing either node neighbors or node successors
class	PropNeighBoolsChannel2
class	PropNeighSetChannel
class	PropNeighSetsChannel1	Channeling between a graph variable and set variables representing either node neighbors or node successors
class	PropNeighSetsChannel2

Uses of ICause in org.chocosolver.solver.constraints.graph.channeling.nodes

Classes in org.chocosolver.solver.constraints.graph.channeling.nodes that implement ICause

Modifier and Type	Class	Description
class	PropNodeBoolChannel	Channeling between a graph variable and set variables representing either node neighbors or node successors
class	PropNodeBoolsChannel	Channeling between a graph variable and set variables representing either node neighbors or node successors
class	PropNodeSetChannel	Channeling between a graph variable and set variables representing either node neighbors or node successors

Uses of ICause in org.chocosolver.solver.constraints.graph.connectivity

Classes in org.chocosolver.solver.constraints.graph.connectivity that implement ICause

Modifier and Type	Class	Description
class	PropBiconnected	Propagator for enforcing a graph variable to be bi-connected The empty graph is not biconnected, so as graphs with only one node.
class	PropConnected	Propagator checking that the graph is connected (Allows graphs with 0 or 1 nodes) Complete Filtering
class	PropNbCC	Propagator that ensures that the final graph consists in K Connected Components (CC)
class	PropNbSCC	Propagator that ensures that the final graph consists in K Strongly Connected Components (SCC)
class	PropSizeMaxCC	Propagator ensuring that the number of vertices of the largest connected is maxSizeCC (cf.
class	PropSizeMinCC	Propagator ensuring that the number of vertices of the smallest connected is equal to sizeMinCC (cf.

Uses of ICause in org.chocosolver.solver.constraints.graph.cost.trees

Classes in org.chocosolver.solver.constraints.graph.cost.trees that implement ICause

Modifier and Type	Class	Description
class	PropMaxDegTree	Redundant filtering for a tree for which the max degree of each vertex is restricted: if dMax(i) = dMax(j) = 1, then edge (i,j) is infeasible if dMax(k) = 2 and (i,k) is already forced, then (k,j) is infeasible ...
class	PropMaxDegVarTree	Redundant filtering for a tree for which the max degree of each vertex is restricted: if dMax(i) = dMax(j) = 1, then edge (i,j) is infeasible if dMax(k) = 2 and (i,k) is already forced, then (k,j) is infeasible ...
class	PropTreeCostSimple	Compute the cost of the graph by summing edge costs - For minimization problem

Uses of ICause in org.chocosolver.solver.constraints.graph.cost.trees.lagrangian

Classes in org.chocosolver.solver.constraints.graph.cost.trees.lagrangian that implement ICause

Modifier and Type	Class	Description
class	PropGenericLagrDCMST	Lagrangian relaxation of the DCMST problem

Uses of ICause in org.chocosolver.solver.constraints.graph.cost.tsp

Classes in org.chocosolver.solver.constraints.graph.cost.tsp that implement ICause

Modifier and Type	Class	Description
class	PropCycleCostSimple	Compute the cost of the graph by summing edge costs Supposes that each node must have two neighbors (cycle) - For minimization problem

Uses of ICause in org.chocosolver.solver.constraints.graph.cost.tsp.lagrangian

Classes in org.chocosolver.solver.constraints.graph.cost.tsp.lagrangian that implement ICause

Modifier and Type	Class	Description
class	PropLagrOneTree	TSP Lagrangian relaxation Inspired from the work of Held & Karp and Benchimol et. al.

Uses of ICause in org.chocosolver.solver.constraints.graph.cycles

Classes in org.chocosolver.solver.constraints.graph.cycles that implement ICause

Modifier and Type	Class	Description
class	PropAcyclic	Propagator for the no-cycle constraint (general case)
class	PropCycle	Simple NoSubtour of Caseau-Laburthe adapted to the undirected case

Uses of ICause in org.chocosolver.solver.constraints.graph.degree

Classes in org.chocosolver.solver.constraints.graph.degree that implement ICause

Modifier and Type	Class	Description
class	PropNodeDegreeAtLeastIncr	Propagator that ensures that a node has at most N successors/predecessors/neighbors
class	PropNodeDegreeAtMostIncr	Propagator that ensures that a node has at most N successors/predecessors/neighbors
class	PropNodeDegreeVar	Propagator that ensures that a node has at most N successors/predecessors/neighbors ENSURES EVERY VERTEX i FOR WHICH DEGREE[i]>0 IS MANDATORY

Uses of ICause in org.chocosolver.solver.constraints.graph.inclusion

Classes in org.chocosolver.solver.constraints.graph.inclusion that implement ICause

Modifier and Type	Class	Description
class	PropInclusion

Uses of ICause in org.chocosolver.solver.constraints.graph.symmbreaking

Classes in org.chocosolver.solver.constraints.graph.symmbreaking that implement ICause

Modifier and Type	Class	Description
class	PropGirth
class	PropIncrementalAdjacencyMatrix
class	PropIncrementalAdjacencyUndirectedMatrix
class	PropSymmetryBreaking
class	PropSymmetryBreakingEx

Uses of ICause in org.chocosolver.solver.constraints.graph.tree

Classes in org.chocosolver.solver.constraints.graph.tree that implement ICause

Modifier and Type	Class	Description
class	PropArborescence	Arborescence constraint (simplification from tree constraint) based on dominators
class	PropArborescences	Arborescences constraint (simplification from tree constraint) based on dominators CONSIDERS THAT EACH NODE WITH NO PREDECESSOR IS A ROOT (needs at least one such node)
class	PropReachability	Every vertex is reachable from the root Removes unreachable nodes Enforces dominator nodes Enforces dominator arc

Uses of ICause in org.chocosolver.solver.constraints.nary

Classes in org.chocosolver.solver.constraints.nary that implement ICause

Modifier and Type	Class	Description
class	PropDiffN
class	PropIntValuePrecedeChain	A propagator for the IntValuePrecede constraint, based on: "Y.
class	PropKLoops	Incremental propagator which restricts the number of loops: |{succs[i]=i+offSet}| = nbLoops

Uses of ICause in org.chocosolver.solver.constraints.nary.alldifferent

Classes in org.chocosolver.solver.constraints.nary.alldifferent that implement ICause

Modifier and Type	Class	Description
class	PropAllDiffAC	Propagator for AllDifferent AC constraint for integer variables
class	PropAllDiffAdaptative	Probabilistic Propagator for AllDifferent AC constraint for integer variables introduced to avoid loosing too much time in AC propagation when BC is sufficientss The more this propagator triggers filtering and failure, the more likely it will be called If it does not bring improvement, this propagator will be called less during search
class	PropAllDiffBC	Based on: "A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint" A.
class	PropAllDiffInst	Propagator for AllDifferent that only reacts on instantiation

Uses of ICause in org.chocosolver.solver.constraints.nary.alldifferent.algo

Constructors in org.chocosolver.solver.constraints.nary.alldifferent.algo with parameters of type ICause

Constructor	Description
AlgoAllDiffAC(IntVar[] variables, ICause cause)
AlgoAllDiffACFast(IntVar[] variables, ICause cause)

Uses of ICause in org.chocosolver.solver.constraints.nary.alldifferent.conditions

Classes in org.chocosolver.solver.constraints.nary.alldifferent.conditions that implement ICause

Modifier and Type	Class	Description
class	PropCondAllDiffAC	Propagator for AllDifferent AC constraint for integer variables subject to conditions (e.g. allDifferent_except_0) AllDiff only applies on the subset of variables satisfying the given condition
class	PropCondAllDiffAdaptative	Adapted from `PropAllDiffAdaptative` for conditional AllDifferent.
class	PropCondAllDiffBase	Base class for conditional AllDifferent propagators.
class	PropCondAllDiffBC	Propagator for AllDifferent with condition using BC filtering algorithm (AlgoAllDiffBC).
class	PropCondAllDiffInst	Propagator for ConditionnalAllDifferent that only reacts on instantiation

Uses of ICause in org.chocosolver.solver.constraints.nary.alldifferentprec

Classes in org.chocosolver.solver.constraints.nary.alldifferentprec that implement ICause

Modifier and Type	Class	Description
class	PropAllDiffPrec	Propagator for the AllDiffPrec constraint.

Methods in org.chocosolver.solver.constraints.nary.alldifferentprec with parameters of type ICause

Modifier and Type	Method	Description
boolean	AllDiffPrec.propagate(DirectedGraph precedenceGraph, int[] topologicalTraversal, ICause aCause)
boolean	AllDiffPrecMoreThanBc.propagate(DirectedGraph precedenceGraph, int[] topologicalTraversal, ICause aCause)
abstract boolean	FilterAllDiffPrec.propagate(DirectedGraph precedenceGraph, int[] topologicalTraversal, ICause aCause)
boolean	GreedyBoundSupport.propagate(DirectedGraph precedenceGraph, int[] topologicalTraversal, ICause aCause)

Uses of ICause in org.chocosolver.solver.constraints.nary.among

Classes in org.chocosolver.solver.constraints.nary.among that implement ICause

Modifier and Type	Class	Description
class	PropAmongGAC	Incremental propagator for Among Constraint: Counts the number of decision variables which take a value in the input value set GCCAT: NVAR is the number of variables of the collection VARIABLES that take their value in VALUES.

Uses of ICause in org.chocosolver.solver.constraints.nary.automata

Classes in org.chocosolver.solver.constraints.nary.automata that implement ICause

Modifier and Type	Class	Description
class	PropCostRegular
class	PropMultiCostRegular	Created by IntelliJ IDEA.
class	PropRegular

Uses of ICause in org.chocosolver.solver.constraints.nary.automata.structure.costregular

Methods in org.chocosolver.solver.constraints.nary.automata.structure.costregular with parameters of type ICause

Modifier and Type	Method	Description
void	StoredValuedDirectedMultiGraph.removeArc(int arcId, gnu.trove.stack.TIntStack toRemove, Propagator<IntVar> propagator, ICause aCause)

Uses of ICause in org.chocosolver.solver.constraints.nary.binPacking

Classes in org.chocosolver.solver.constraints.nary.binPacking that implement ICause

Modifier and Type	Class	Description
class	PropBinPacking	Propagator for a Bin Packing constraint This propagator is an implementation of filtering rules introduced in the following paper : Shaw, P. (2004).

Uses of ICause in org.chocosolver.solver.constraints.nary.channeling

Classes in org.chocosolver.solver.constraints.nary.channeling that implement ICause

Modifier and Type	Class	Description
class	PropClauseChanneling	A propagator which links an IntVar with two arrays of BoolVar, one for EQ relations, the other for LQ relations.
class	PropEnumDomainChanneling	Constraints that map the boolean assignments variables (bvars) with the standard assignment variables (var).
class	PropInverseChannelAC	X[i] = j+Ox <=> Y[j] = i+Oy
class	PropInverseChannelBC	X[i] = j+Ox <=> Y[j] = i+Oy

Uses of ICause in org.chocosolver.solver.constraints.nary.circuit

Classes in org.chocosolver.solver.constraints.nary.circuit that implement ICause

Modifier and Type	Class	Description
class	PropCircuit_AntiArboFiltering	Propagator for circuit constraint based on dominators Redundant propagator
class	PropCircuit_ArboFiltering	Propagator for sub-circuit constraint based on dominators Redundant propagator
class	PropCircuitSCC	Filters circuit based on strongly connected components (see the TechReport "Improving the Asymmetric TSP by considering graph structure", Fages & Lorca, 2012)
class	PropNoSubtour	Simple nocircuit contraint (from NoSubtour of Pesant or noCycle of Caseaux/Laburthe)
class	PropSubcircuit	Subcircuit propagator (one circuit and several loops)
class	PropSubcircuitDominatorFilter	Propagator for sub-circuit constraint based on dominators Redundant propagator

Uses of ICause in org.chocosolver.solver.constraints.nary.clauses

Classes in org.chocosolver.solver.constraints.nary.clauses that implement ICause

Modifier and Type	Class	Description
class	ClauseStore	A class to manage life of sclauses during resolution.
class	ClauseStore.SignedClause
class	PropSignedClause	This propagator manages a signed clause: a disjunction of unary membership constraints.

Uses of ICause in org.chocosolver.solver.constraints.nary.count

Classes in org.chocosolver.solver.constraints.nary.count that implement ICause

Modifier and Type	Class	Description
class	PropCount_AC	Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar assumes the occVar variable to be the last of the variables of the constraint: vars = [lvars | occVar] Arc Consistent algorithm with lvars = list of variables for which the occurrence of occval in their domain is constrained
class	PropCountVar	Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar assumes the occVar variable to be the last of the variables of the constraint: vars = [lvars | occVar] Arc Consistent algorithm with lvars = list of variables for which the occurrence of occval in their domain is constrained

Uses of ICause in org.chocosolver.solver.constraints.nary.cumulative

Classes in org.chocosolver.solver.constraints.nary.cumulative that implement ICause

Modifier and Type	Class	Description
class	PropCumulative	Cumulative propagator Performs energy checking and mandatory part based filtering BEWARE : not idempotent, use two propagators to get the fix point
class	PropGraphCumulative	Graph based cumulative Maintains incrementally overlapping tasks Performs energy checking and mandatory part based filtering BEWARE : not idempotent, use two propagators to get the fix point

Uses of ICause in org.chocosolver.solver.constraints.nary.element

Classes in org.chocosolver.solver.constraints.nary.element that implement ICause

Modifier and Type	Class	Description
class	PropElementV_fast	Fast Element constraint

Uses of ICause in org.chocosolver.solver.constraints.nary.flow

Classes in org.chocosolver.solver.constraints.nary.flow that implement ICause

Modifier and Type	Class	Description
class	PropMinCostMaxFlow

Uses of ICause in org.chocosolver.solver.constraints.nary.globalcardinality

Classes in org.chocosolver.solver.constraints.nary.globalcardinality that implement ICause

Modifier and Type	Class	Description
class	PropFastGCC	Propagator for Global Cardinality Constraint (GCC) for integer variables Basic filter: no particular consistency but fast and with a correct checker

Uses of ICause in org.chocosolver.solver.constraints.nary.knapsack

Classes in org.chocosolver.solver.constraints.nary.knapsack that implement ICause

Modifier and Type	Class	Description
class	PropKnapsack	Propagator for the Knapsack constraint based on Dantzig-Wolfe relaxation
class	PropKnapsackKatriel01	Propagator for the 0/1-Knapsack constraint based on Dantzig-Wolfe relaxation trying to find forbidden and mandatory items

Uses of ICause in org.chocosolver.solver.constraints.nary.lex

Classes in org.chocosolver.solver.constraints.nary.lex that implement ICause

Modifier and Type	Class	Description
class	PropIncreasing	A sweep-based algorithm for Increasing propagator
class	PropLex	Enforce a lexicographic ordering on two vectors of integer variables x <_lex y with x = , and y = .
class	PropLexChain	Solver constraint of the LexChain constraint.
class	PropLexInt	Enforce a lexicographic ordering on one vector of integer variables x <_lex y with x = , and a vector of ints y = .

Uses of ICause in org.chocosolver.solver.constraints.nary.min_max

Classes in org.chocosolver.solver.constraints.nary.min_max that implement ICause

Modifier and Type	Class	Description
class	PropArgmax	A propagator for ARGMAX constraint.
class	PropBoolMax
class	PropBoolMin
class	PropMax
class	PropMin

Uses of ICause in org.chocosolver.solver.constraints.nary.nvalue

Classes in org.chocosolver.solver.constraints.nary.nvalue that implement ICause

Modifier and Type	Class	Description
class	PropAMNV	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues
class	PropAtLeastNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
class	PropAtLeastNValues_AC	AtLeastNValues Propagator (similar to SoftAllDiff) The number of distinct values in vars is at least nValues Performs Generalized Arc Consistency based on Maximum Bipartite Matching The worst case time complexity is O(nm) but this is very pessimistic In practice it is more like O(m) where m is the number of variable-value pairs
class	PropAtMostNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
class	PropAtMostNValues_BC	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues Performs Bound Consistency in O(n+d) with n = |vars| d = maxValue - minValue (from initial domains)
class	PropNValue

Uses of ICause in org.chocosolver.solver.constraints.nary.sat

Classes in org.chocosolver.solver.constraints.nary.sat that implement ICause

Modifier and Type	Class	Description
class	PropSat	A propagator to deal with clauses and interface a MiniSat.

Uses of ICause in org.chocosolver.solver.constraints.nary.sort

Classes in org.chocosolver.solver.constraints.nary.sort that implement ICause

Modifier and Type	Class	Description
class	PropKeysorting	Based on Technical Report from Mats Carlsson: "Propagating THE KEYSORTING Constraint" - Sept. 15, 2014.
class	PropSort	SortingConstraint is a constraint that ensures that a vector is the sorted version of a second one.

Uses of ICause in org.chocosolver.solver.constraints.nary.sum

Classes in org.chocosolver.solver.constraints.nary.sum that implement ICause

Modifier and Type	Class	Description
class	PropScalar	A propagator for SUM(x_i*c_i) = b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	PropScalarWithLong	A propagator for SUM(x_i*c_i) = b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	PropSum	A propagator for SUM(x_i) o b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	PropSumBool	A propagator for SUM(x_i) = y + b, where x_i are boolean variables Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	PropSumBoolIncr	A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
class	PropSumFullBool	A propagator for SUM(x_i) = y + b, where x_i are boolean variables Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	PropSumFullBoolIncr	A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
class	PropSumWithLong	A propagator for SUM(x_i) o b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.

Uses of ICause in org.chocosolver.solver.constraints.nary.tree

Classes in org.chocosolver.solver.constraints.nary.tree that implement ICause

Modifier and Type	Class	Description
class	PropAntiArborescences	AntiArborescences propagation (simplification from tree constraint) based on dominators loops (i.e., variables such that x[i]=i) are considered as roots Can use the simple LT algorithm which runs in O(m.log(n)) worst case time Or a slightly more sophisticated one, linear in theory but not necessarily faster in practice

Uses of ICause in org.chocosolver.solver.constraints.real

Classes in org.chocosolver.solver.constraints.real that implement ICause

Modifier and Type	Class	Description
class	PropMixed	A propagator that ensures that a real variable X is equal to an integer variable Y.
class	PropMixedElement	Let x be an integer variable with n values and v be a real variable.
class	PropScalarMixed	A propagator for SUM(x_i*c_i) = b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
class	RealPropagator	A propagator for real variables.

Uses of ICause in org.chocosolver.solver.constraints.reification

Classes in org.chocosolver.solver.constraints.reification that implement ICause

Modifier and Type	Class	Description
class	PropConditional	A specific propagator which temporarily posts constraint on condition.
class	PropImplied	Implication propagator
class	PropLocalConDis	A propagator for constructive disjunction, with local deductions.
class	PropOpposite	Constraint representing the negation of a given constraint does not filter but fails if the given constraint is satisfied Can be used within any constraint
class	PropReif	Implication propagator
class	PropXeqCReif	A propagator dedicated to express in a compact way: (x = c) ⇔ b
class	PropXeqYCReif	A propagator dedicated to express in a compact way: (x = y + c) ⇔ b
class	PropXinSReif	A propagator dedicated to express in a compact way: (x = c) ⇔ b
class	PropXltCReif	A propagator dedicated to express in a compact way: (x < c) ⇔ b
class	PropXltYCReif	A propagator dedicated to express in a compact way: (x < y + c) ⇔ b

Uses of ICause in org.chocosolver.solver.constraints.set

Classes in org.chocosolver.solver.constraints.set that implement ICause

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

Uses of ICause in org.chocosolver.solver.constraints.ternary

Classes in org.chocosolver.solver.constraints.ternary that implement ICause

Modifier and Type	Class	Description
class	AbstractPropDistanceXYZ	A constraint to state |X - Y| operator Z where operator can be =, <=, <, >=, > and X, Y, and Z are variables Warning: only achieves BoundConsistency for the moment !
class	PropDivXYZ	X/Y = Z A propagator for the constraint Z = X / Y where X, Y and Z are integer, possibly negative, variables The filtering algorithm both supports bounded and enumerated integer variables
class	PropEQDistanceXYZ
class	PropGEDistanceXYZ
class	PropGTDistanceXYZ
class	PropLEDistanceXYZ
class	PropLTDistanceXYZ
class	PropMaxBC	X = MAX(Y,Z) ensures bound consistency
class	PropMinBC	X = MIN(Y,Z) ensures bound consistency
class	PropModXYZ	X % Y = Z A propagator for the constraint Z = X % Y where X, Y and Z are integer, possibly negative, variables The filtering algorithm both supports bounded and enumerated integer variables
class	PropTimesNaive	V0 * V1 = V2
class	PropTimesNaiveWithLong	V0 * V1 = V2
class	PropXplusYeqZ	A propagator to ensure that X + Y = Z holds, where X, Y and Z are IntVar.

Uses of ICause in org.chocosolver.solver.constraints.unary

Classes in org.chocosolver.solver.constraints.unary that implement ICause

Modifier and Type	Class	Description
static class	BooleanConstraint.PropBoolean
class	PropEqualXC	Unary propagator ensuring: X = C, where X is a variable and C is a constant
class	PropGreaterOrEqualXC	X >= C
class	PropLessOrEqualXC	X <= C
class	PropMember	This propagator manages a singleton nogood.
class	PropNotEqualXC	A propagator ensuring that: X =/= C, where X is a variable and C a constant
class	PropNotMember	This propagator manages a singleton nogood.

Uses of ICause in org.chocosolver.solver.exception

Fields in org.chocosolver.solver.exception declared as ICause

Modifier and Type	Field	Description
ICause	ContradictionException.c

Methods in org.chocosolver.solver.exception with parameters of type ICause

Modifier and Type	Method	Description
ContradictionException	ContradictionException.set(ICause c, Variable v, java.lang.String s)	Throws the unique ContradictionException filled with the specified parameters.

Uses of ICause in org.chocosolver.solver.expression.continuous.arithmetic

Methods in org.chocosolver.solver.expression.continuous.arithmetic with parameters of type ICause

Modifier and Type	Method	Description
void	BiCArExpression.intersect(double lb, double ub, ICause cause)
void	RealIntervalConstant.intersect(double l, double u, ICause cause)
void	UnCArExpression.intersect(double lb, double ub, ICause cause)
void	BiCArExpression.project(ICause cause)
void	CArExpression.project(ICause cause)	Projects computed bounds to the sub expressions.
void	RealIntervalConstant.project(ICause cause)
void	UnCArExpression.project(ICause cause)

Uses of ICause in org.chocosolver.solver.expression.continuous.relational

Classes in org.chocosolver.solver.expression.continuous.relational that implement ICause

Modifier and Type	Class	Description
class	PropEquation	A basic constraint using HC4 algorithm for filtering values with respect to a mathematical equation.

Uses of ICause in org.chocosolver.solver.learn

Methods in org.chocosolver.solver.learn that return ICause

Modifier and Type	Method	Description
abstract ICause	Implications.getCauseAt(int idx)	Get the ICause declared in node idx
ICause	LazyImplications.getCauseAt(int idx)

Methods in org.chocosolver.solver.learn with parameters of type ICause

Modifier and Type	Method	Description
void	AbstractEventObserver.instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)	Explain the assignment to val of var due to cause.
void	EventRecorder.instantiateTo(IntVar var, int val, ICause cause, int oldLB, int oldUB)	Explain the assignment to val of var due to cause.
abstract void	Implications.pushEvent(IntVar var, ICause cause, IntEventType mask, int one, int two, int three)	Push an event
void	LazyImplications.pushEvent(IntVar var, ICause cause, IntEventType evt, int one, int two, int three)
void	AbstractEventObserver.removeValue(IntVar var, int val, ICause cause)	Explain the removal of the val from var, due to cause.
void	EventRecorder.removeValue(IntVar var, int val, ICause cause)	Explain the removal of the val from var, due to cause.
void	AbstractEventObserver.updateLowerBound(IntVar var, int value, int old, ICause cause)	Explain the removal of [old,value[ from var, due to cause.
void	EventRecorder.updateLowerBound(IntVar var, int value, int old, ICause cause)	Explain the removal of [old,value[ from var, due to cause.
void	AbstractEventObserver.updateUpperBound(IntVar var, int value, int old, ICause cause)	Explain the removal of ]value,old] from var, due to cause.
void	EventRecorder.updateUpperBound(IntVar var, int value, int old, ICause cause)	Explain the removal of ]value,old] from var, due to cause.

Uses of ICause in org.chocosolver.solver.objective

Subinterfaces of ICause in org.chocosolver.solver.objective

Modifier and Type	Interface	Description
interface	IObjectiveManager<V extends Variable>	interface to monitor the bounds of the objective variable.

Classes in org.chocosolver.solver.objective that implement ICause

Modifier and Type	Class	Description
class	AbstractIntObjManager
class	ParetoMaximizer	Class to store the pareto front (multi-objective optimization).

Uses of ICause in org.chocosolver.solver.propagation

Methods in org.chocosolver.solver.propagation with parameters of type ICause

Modifier and Type	Method	Description
void	PropagationObserver.onFailure(ICause cause, Propagator<?> propagator)	Anytime a propagator throws a failure, this method is called first.
void	PropagationProfiler.onFailure(ICause cause, Propagator<?> propagator)
void	PropagationObserver.onFiltering(ICause cause, Propagator<?> propagator)	Anytime a propagator filters some values from its variables' domain, this method is called first.
void	PropagationProfiler.onFiltering(ICause cause, Propagator<?> propagator)
void	PropagationObserver.onVariableModification(Variable variable, IEventType type, ICause cause)	Anytime a variable is being modified by a cause, this method is called after.
void	PropagationProfiler.onVariableModification(Variable variable, IEventType type, ICause cause)
void	PropagationEngine.onVariableUpdate(Variable variable, IEventType type, ICause cause)	Take into account the modification of a variable
void	PropagationEngineObserver.onVariableUpdate(Variable variable, IEventType type, ICause cause)

Uses of ICause in org.chocosolver.solver.search.loop.lns.neighbors

Subinterfaces of ICause in org.chocosolver.solver.search.loop.lns.neighbors

Modifier and Type	Interface	Description
interface	INeighbor	An interface that defines services required for the LNS to select variables to freeze-unfreeze (for any type of variables).

Classes in org.chocosolver.solver.search.loop.lns.neighbors that implement ICause

Modifier and Type	Class	Description
class	AdaptiveNeighborhood
class	IntNeighbor	An abstract class that defines services required for the LNS to select some IntVar to freeze-unfreeze.
class	PropagationGuidedNeighborhood	A Propagation Guided LNS
class	RandomNeighborhood	A Random LNS
class	ReversePropagationGuidedNeighborhood	A Propagation Guided LNS
class	SequenceNeighborhood	A neighbor which is based on mutliple neighbors.
class	SetRandomNeighbor	A random LNS neighbor for a set variable This class serves mostly as an example on how to use LNS with set variables.

Uses of ICause in org.chocosolver.solver.search.strategy.assignments

Methods in org.chocosolver.solver.search.strategy.assignments with parameters of type ICause

Modifier and Type	Method	Description
boolean	DecisionOperator.apply(V var, int value, ICause cause)
boolean	DecisionOperatorFactory.GraphEnforceDecision.apply(GraphVar var, int from, int to, ICause cause)
boolean	DecisionOperatorFactory.GraphEnforceDecision.apply(GraphVar var, int node, ICause cause)
boolean	DecisionOperatorFactory.GraphRemoveDecision.apply(GraphVar var, int from, int to, ICause cause)
boolean	DecisionOperatorFactory.GraphRemoveDecision.apply(GraphVar var, int node, ICause cause)
boolean	GraphDecisionOperator.apply(GraphVar var, int from, int to, ICause cause)
boolean	DecisionOperator.unapply(V var, int value, ICause cause)
boolean	DecisionOperatorFactory.GraphEnforceDecision.unapply(GraphVar var, int from, int to, ICause cause)
boolean	DecisionOperatorFactory.GraphEnforceDecision.unapply(GraphVar var, int node, ICause cause)
boolean	DecisionOperatorFactory.GraphRemoveDecision.unapply(GraphVar var, int from, int to, ICause cause)
boolean	DecisionOperatorFactory.GraphRemoveDecision.unapply(GraphVar var, int node, ICause cause)
boolean	GraphDecisionOperator.unapply(GraphVar var, int from, int to, ICause cause)

Uses of ICause in org.chocosolver.solver.search.strategy.decision

Classes in org.chocosolver.solver.search.strategy.decision that implement ICause

Modifier and Type	Class	Description
class	Decision<E extends Variable>	An abstract which defines a Decision
class	GraphDecision<G extends GraphVar<?>>
class	IbexDecision	A decision that delegates the search process to Ibex
class	IntDecision	A decision based on a IntVar
class	RealDecision	A decision based on a RealVar that splits the domain in two ranges.
class	RootDecision
class	SetDecision	A decision based on a SetVar

Uses of ICause in org.chocosolver.solver.search.strategy.selectors.variables

Classes in org.chocosolver.solver.search.strategy.selectors.variables that implement ICause

Modifier and Type	Class	Description
class	AbstractCriterionBasedVariableSelector<V extends Variable>	Project: choco.
class	ActivityBased	Implementation of the search described in: "Activity-Based Search for Black-Box Constraint Propagramming Solver", Laurent Michel and Pascal Van Hentenryck, CPAIOR12.
class	ConflictHistorySearch<V extends Variable>	Source: "Conflict History Based Branching Heuristic for CSP Solving", Habet and Terrioux.
class	DomOverWDeg<V extends Variable>	Implementation of DowOverWDeg[1].
class	DomOverWDegRef<V extends Variable>	Implementation of refined DowOverWDeg.
class	ImpactBased	Implementation of the search described in: "Impact-Based Search Strategies for Constraint Programming", Philippe Refalo, CP2004.

Uses of ICause in org.chocosolver.solver.search.strategy.strategy

Classes in org.chocosolver.solver.search.strategy.strategy that implement ICause

Modifier and Type	Class	Description
class	SetTimes

Uses of ICause in org.chocosolver.solver.variables

Subinterfaces of ICause in org.chocosolver.solver.variables

Modifier and Type	Interface	Description
interface	BoolVar	CPRU r544: remove default implementation
interface	IntVar	Interface for integer variables.
interface	IVariableMonitor<V extends Variable>	A monitor for Variable, to observe variable modification (for integer variable : value removals, bounds modification or instantiation) and do something right after the modification.

Methods in org.chocosolver.solver.variables that return ICause

Modifier and Type	Method	Description
ICause	Variable.getCause()

Methods in org.chocosolver.solver.variables with parameters of type ICause

Modifier and Type	Method	Description
void	Variable.contradiction(ICause cause, java.lang.String message)	Throws a contradiction exception based on
boolean	IncidentSet.enforce(GraphVar g, int from, int to, ICause cause)
boolean	IncidentSet.PredecessorsSet.enforce(GraphVar g, int from, int to, ICause cause)
boolean	IncidentSet.SuccessorsSet.enforce(GraphVar g, int from, int to, ICause cause)
boolean	GraphVar.enforceEdge(int x, int y, ICause cause)	Adds edge (directed directed graph variable) (x,y) in the lower bound
boolean	GraphVar.enforceNode(int node, ICause cause)	Adds a node to the lower bound graph
boolean	SetVar.force(int element, ICause cause)	Adds element to the lower bound, i.e. every solution must include element
void	GraphVar.instantiateTo(E value, ICause cause)	Instantiates this to value given in parameter.
boolean	IntVar.instantiateTo(int value, ICause cause)	Instantiates the domain of this to value.
default boolean	IntVar.instantiateTo(long value, ICause cause)	Instantiates the domain of this to value.
boolean	SetVar.instantiateTo(int[] value, ICause cause)	Enforces the set variable to contain exactly the set of integers given in parameter
IGraphDeltaMonitor	GraphVar.monitorDelta(ICause propagator)	Make the propagator 'prop' have an incremental filtering w.r.t. this graph variable
IIntDeltaMonitor	IntVar.monitorDelta(ICause propagator)	Allow to monitor removed values of this.
ISetDeltaMonitor	SetVar.monitorDelta(ICause propagator)	Allow propagator to monitor element removal/enforcing of this
void	Variable.notifyPropagators(IEventType event, ICause cause)	If this has changed, then notify all of its observers. Each observer has its update method.
void	Variable.notifyViews(IEventType event, ICause cause)	Notify views of observed variable modifications
boolean	IncidentSet.PredecessorsSet.remove(GraphVar g, int from, int to, ICause cause)
boolean	IncidentSet.remove(GraphVar g, int from, int to, ICause cause)
boolean	IncidentSet.SuccessorsSet.remove(GraphVar g, int from, int to, ICause cause)
boolean	SetVar.remove(int element, ICause cause)	Removes element from the upper bound, i.e. the set variable cannot contain element anymore
boolean	IntVar.removeAllValuesBut(IntIterableSet values, ICause cause)	Removes all values from the domain of this except those in values.
boolean	GraphVar.removeEdge(int x, int y, ICause cause)	Removes edge (directed in case of directed graph variable) (x,y) from the upper bound
boolean	IntVar.removeInterval(int from, int to, ICause cause)	Removes values between [from, to] from the domain of this.
boolean	GraphVar.removeNode(int node, ICause cause)	Removes a node from the upper bound graph
boolean	IntVar.removeValue(int value, ICause cause)	Removes valuefrom the domain of this.
default boolean	IntVar.removeValue(long value, ICause cause)	Removes valuefrom the domain of this.
boolean	IntVar.removeValues(IntIterableSet values, ICause cause)	Removes the value in valuesfrom the domain of this.
default boolean	BoolVar.setToFalse(ICause cause)
default boolean	BoolVar.setToTrue(ICause cause)
void	Variable.storeEvents(int mask, ICause cause)	Temporarily store modification events made on this.
boolean	IntVar.updateBounds(int lb, int ub, ICause cause)	Updates the lower bound and the upper bound of the domain of this to, resp.
boolean	RealVar.updateBounds(double lowerbound, double upperbound, ICause cause)	Updates the bounds of the domain of this to value.
boolean	IntVar.updateLowerBound(int value, ICause cause)	Updates the lower bound of the domain of this to value.
default boolean	IntVar.updateLowerBound(long value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	RealVar.updateLowerBound(double value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	IntVar.updateUpperBound(int value, ICause cause)	Updates the upper bound of the domain of this to value.
default boolean	IntVar.updateUpperBound(long value, ICause cause)	Updates the upper bound of the domain of this to value.
boolean	RealVar.updateUpperBound(double value, ICause cause)	Updates the upper bound of the domain of this to value.

Uses of ICause in org.chocosolver.solver.variables.delta

Methods in org.chocosolver.solver.variables.delta that return ICause

Modifier and Type	Method	Description
ICause	EnumDelta.getCause(int idx)
ICause	GraphDelta.getCause(int index, int type)
ICause	IGraphDelta.getCause(int index, int type)
ICause	IntDelta.getCause(int idx)	Return the cause of the idx^th cause stored in the delta, if any
ICause	IntervalDelta.getCause(int idx)
ICause	ISetDelta.getCause(int index, int lbOrUb)
ICause	NoDelta.getCause(int idx)
ICause	NoDelta.getCause(int index, int kerOrEnv)
ICause	OneValueDelta.getCause(int idx)
ICause	SetDelta.getCause(int index, int kerOrEnv)

Methods in org.chocosolver.solver.variables.delta with parameters of type ICause

Modifier and Type	Method	Description
void	EnumDelta.add(int value, ICause cause)	Adds a new value to the delta
void	GraphDelta.add(int element, int type, ICause cause)
void	IEnumDelta.add(int value, ICause cause)	Adds a new value to the delta
void	IGraphDelta.add(int element, int type, ICause cause)
void	IIntervalDelta.add(int lb, int ub, ICause cause)	Adds a new value interval to the delta
void	IntervalDelta.add(int lb, int ub, ICause cause)
void	ISetDelta.add(int element, int lbOrUb, ICause cause)
void	NoDelta.add(int lb, int ub, ICause cause)
void	NoDelta.add(int value, ICause cause)
void	OneValueDelta.add(int value, ICause cause)
void	SetDelta.add(int element, int kerOrEnv, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.delta.monitor

Fields in org.chocosolver.solver.variables.delta.monitor declared as ICause

Modifier and Type	Field	Description
protected ICause	OneValueDeltaMonitor.propagator

Constructors in org.chocosolver.solver.variables.delta.monitor with parameters of type ICause

Constructor	Description
EnumDeltaMonitor(IEnumDelta delta, ICause propagator)
GraphDeltaMonitor(IGraphDelta delta, ICause propagator)
IntervalDeltaMonitor(IIntervalDelta delta, ICause propagator)
OneValueDeltaMonitor(IEnumDelta delta, ICause propagator)
SetDeltaMonitor(ISetDelta delta, ICause propagator)

Uses of ICause in org.chocosolver.solver.variables.impl

Classes in org.chocosolver.solver.variables.impl that implement ICause

Modifier and Type	Class	Description
class	BitsetArrayIntVarImpl	IntVar implementation for quite small domains bit with very distant values e.g. {-51900,42,235923}
class	BitsetIntVarImpl
class	BoolVarImpl
class	DirectedNodeInducedGraphVarImpl	Directed graph variable guaranteeing that any instantiation is a node-induced subgraph of the envelope used to construct the graph variable.
class	FixedBoolVarImpl	A constant view specific to boolean variable
class	FixedIntVarImpl	A IntVar with one domain value.
class	IntervalIntVarImpl
class	UndirectedNodeInducedGraphVarImpl	Undirected Graph variable guaranteeing that any instantiation is a node-induced subgraph of the envelope used to construct the graph variable.

Methods in org.chocosolver.solver.variables.impl that return ICause

Modifier and Type	Method	Description
ICause	AbstractVariable.getCause()

Methods in org.chocosolver.solver.variables.impl with parameters of type ICause

Modifier and Type	Method	Description
void	AbstractVariable.contradiction(ICause cause, java.lang.String message)
boolean	AbstractGraphVar.enforceEdge(int x, int y, ICause cause)
boolean	AbstractGraphVar.enforceNode(int x, ICause cause)	Enforce the node x to belong to any solution Adds x to the lower bound graph
boolean	DirectedNodeInducedGraphVarImpl.enforceNode(int x, ICause cause)
boolean	UndirectedNodeInducedGraphVarImpl.enforceNode(int x, ICause cause)
boolean	SetVarImpl.force(int element, ICause cause)
void	AbstractGraphVar.instantiateTo(boolean[][] value, ICause cause)	Instantiates this to value which represents an adjacency matrix plus a set of nodes (last row of the matrix).
void	AbstractGraphVar.instantiateTo(E value, ICause cause)
boolean	BitsetArrayIntVarImpl.instantiateTo(int value, ICause cause)	Instantiates the domain of this to value.
boolean	BitsetIntVarImpl.instantiateTo(int value, ICause cause)	Instantiates the domain of this to value.
boolean	BoolVarImpl.instantiateTo(int value, ICause cause)	Instantiates the domain of this to value.
boolean	FixedIntVarImpl.instantiateTo(int value, ICause cause)
boolean	IntervalIntVarImpl.instantiateTo(int value, ICause cause)	Instantiates the domain of this to value.
boolean	SetVarImpl.instantiateTo(int[] value, ICause cause)
void	FixedRealVarImpl.intersect(double l, double u, ICause cause)
void	RealVarImpl.intersect(double l, double u, ICause cause)
IGraphDeltaMonitor	AbstractGraphVar.monitorDelta(ICause propagator)
IIntDeltaMonitor	BitsetArrayIntVarImpl.monitorDelta(ICause propagator)
IIntDeltaMonitor	BitsetIntVarImpl.monitorDelta(ICause propagator)
IIntDeltaMonitor	BoolVarImpl.monitorDelta(ICause propagator)
IIntDeltaMonitor	FixedIntVarImpl.monitorDelta(ICause propagator)
IIntDeltaMonitor	IntervalIntVarImpl.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetVarImpl.monitorDelta(ICause propagator)
void	AbstractGraphVar.notifyPropagators(IEventType event, ICause cause)
void	AbstractVariable.notifyPropagators(IEventType event, ICause cause)
void	FixedIntVarImpl.notifyPropagators(IEventType event, ICause cause)
void	AbstractVariable.notifyViews(IEventType event, ICause cause)
void	FixedIntVarImpl.notifyViews(IEventType event, ICause cause)
void	FixedRealVarImpl.project(ICause cause)
void	RealVarImpl.project(ICause cause)
boolean	SetVarImpl.remove(int element, ICause cause)
boolean	BitsetArrayIntVarImpl.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	BitsetIntVarImpl.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	BoolVarImpl.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	FixedIntVarImpl.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	IntervalIntVarImpl.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	AbstractGraphVar.removeEdge(int x, int y, ICause cause)
boolean	DirectedNodeInducedGraphVarImpl.removeEdge(int x, int y, ICause cause)
boolean	UndirectedNodeInducedGraphVarImpl.removeEdge(int x, int y, ICause cause)
boolean	BitsetArrayIntVarImpl.removeInterval(int from, int to, ICause cause)
boolean	BitsetIntVarImpl.removeInterval(int from, int to, ICause cause)
boolean	BoolVarImpl.removeInterval(int from, int to, ICause cause)
boolean	FixedIntVarImpl.removeInterval(int from, int to, ICause cause)
boolean	IntervalIntVarImpl.removeInterval(int from, int to, ICause cause)
boolean	AbstractGraphVar.removeNode(int x, ICause cause)	Remove node x from the domain Removes x from the upper bound graph
boolean	UndirectedGraphVarImpl.removeNode(int x, ICause cause)
boolean	BitsetArrayIntVarImpl.removeValue(int value, ICause cause)	Removes valuefrom the domain of this.
boolean	BitsetIntVarImpl.removeValue(int value, ICause cause)	Removes valuefrom the domain of this.
boolean	BoolVarImpl.removeValue(int value, ICause cause)	Removes valuefrom the domain of this.
boolean	FixedIntVarImpl.removeValue(int value, ICause cause)
boolean	IntervalIntVarImpl.removeValue(int value, ICause cause)	Removes valuefrom the domain of this.
boolean	BitsetArrayIntVarImpl.removeValues(IntIterableSet values, ICause cause)
boolean	BitsetIntVarImpl.removeValues(IntIterableSet values, ICause cause)
boolean	BoolVarImpl.removeValues(IntIterableSet values, ICause cause)
boolean	FixedIntVarImpl.removeValues(IntIterableSet values, ICause cause)
boolean	IntervalIntVarImpl.removeValues(IntIterableSet values, ICause cause)
void	AbstractVariable.storeEvents(int m, ICause cause)
boolean	BitsetArrayIntVarImpl.updateBounds(int aLB, int aUB, ICause cause)
boolean	BitsetIntVarImpl.updateBounds(int lb, int ub, ICause cause)
boolean	BoolVarImpl.updateBounds(int lb, int ub, ICause cause)
boolean	FixedIntVarImpl.updateBounds(int lb, int ub, ICause cause)
boolean	FixedRealVarImpl.updateBounds(double lowerbound, double upperbound, ICause cause)
boolean	IntervalIntVarImpl.updateBounds(int lb, int ub, ICause cause)
boolean	RealVarImpl.updateBounds(double lowerbound, double upperbound, ICause cause)
boolean	BitsetArrayIntVarImpl.updateLowerBound(int value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	BitsetIntVarImpl.updateLowerBound(int value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	BoolVarImpl.updateLowerBound(int value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	FixedIntVarImpl.updateLowerBound(int value, ICause cause)
boolean	FixedRealVarImpl.updateLowerBound(double value, ICause cause)
boolean	IntervalIntVarImpl.updateLowerBound(int value, ICause cause)	Updates the lower bound of the domain of this to value.
boolean	RealVarImpl.updateLowerBound(double value, ICause cause)
boolean	BitsetArrayIntVarImpl.updateUpperBound(int value, ICause cause)	Updates the upper bound of the domain of this to value.
boolean	BitsetIntVarImpl.updateUpperBound(int value, ICause cause)	Updates the upper bound of the domain of this to value.
boolean	BoolVarImpl.updateUpperBound(int value, ICause cause)	Updates the upper bound of the domain of this to value.
boolean	FixedIntVarImpl.updateUpperBound(int value, ICause cause)
boolean	FixedRealVarImpl.updateUpperBound(double value, ICause cause)
boolean	IntervalIntVarImpl.updateUpperBound(int value, ICause cause)	Updates the upper bound of the domain of this to value.
boolean	RealVarImpl.updateUpperBound(double value, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.view

Subinterfaces of ICause in org.chocosolver.solver.variables.view

Modifier and Type	Interface	Description
interface	IView<V extends Variable>	An interface to define views.

Classes in org.chocosolver.solver.variables.view that implement ICause

Modifier and Type	Class	Description
class	AbstractView<V extends Variable>
class	BoolIntView<I extends IntVar>	An abstract class for boolean views over IntVar.
class	GraphView<V extends Variable,E extends IGraph>	An abstract class for graph views over other variables
class	IntView<I extends IntVar>	Abstract class for defining integer views on integer variables "A view implements the same operations as a variable.
class	RealView<I extends IntVar>
class	SetView<V extends Variable>	An abstract class for set views over other variables.

Methods in org.chocosolver.solver.variables.view with parameters of type ICause

Modifier and Type	Method	Description
boolean	GraphView.enforceEdge(int x, int y, ICause cause)
boolean	GraphView.enforceNode(int node, ICause cause)
boolean	SetView.force(int element, ICause cause)
void	GraphView.instantiateTo(IGraph value, ICause cause)
boolean	IntView.instantiateTo(int value, ICause cause)
void	RealView.intersect(double l, double u, ICause cause)
IIntDeltaMonitor	BoolIntView.monitorDelta(ICause propagator)
void	GraphView.notifyPropagators(IEventType event, ICause cause)
void	RealView.project(ICause cause)
boolean	SetView.remove(int element, ICause cause)
boolean	BoolIntView.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	IntView.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	GraphView.removeEdge(int x, int y, ICause cause)
boolean	BoolIntView.removeInterval(int from, int to, ICause cause)
boolean	IntView.removeInterval(int from, int to, ICause cause)
boolean	GraphView.removeNode(int node, ICause cause)
boolean	BoolIntView.removeValue(int value, ICause cause)
boolean	IntView.removeValue(int value, ICause cause)
boolean	BoolIntView.removeValues(IntIterableSet values, ICause cause)
boolean	IntView.removeValues(IntIterableSet values, ICause cause)
boolean	BoolIntView.updateBounds(int lb, int ub, ICause cause)
boolean	IntView.updateBounds(int lb, int ub, ICause cause)
boolean	RealView.updateBounds(double lowerbound, double upperbound, ICause cause)
boolean	BoolIntView.updateLowerBound(int value, ICause cause)
boolean	IntView.updateLowerBound(int value, ICause cause)
boolean	RealView.updateLowerBound(double value, ICause cause)
boolean	BoolIntView.updateUpperBound(int value, ICause cause)
boolean	IntView.updateUpperBound(int value, ICause cause)
boolean	RealView.updateUpperBound(double value, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.view.bool

Classes in org.chocosolver.solver.variables.view.bool that implement ICause

Modifier and Type	Class	Description
class	BoolEqView<I extends IntVar>	declare an BoolVar based on X and C, such as (X = C) is reified by this.
class	BoolLeqView<I extends IntVar>	declare an BoolVar based on X and C, such as (X <= C) is reified by this.
class	BoolNotView<B extends BoolVar>	A view for boolean variable, that enforce not(b).
class	BoolSetView<S extends SetVar>	Boolean view b over a set variable S: With v an integer, b = true iff S contains v.

Methods in org.chocosolver.solver.variables.view.bool with parameters of type ICause

Modifier and Type	Method	Description
boolean	BoolEqView.instantiateTo(int value, ICause cause)
boolean	BoolLeqView.instantiateTo(int value, ICause cause)
boolean	BoolNotView.instantiateTo(int value, ICause cause)
boolean	BoolSetView.instantiateTo(int value, ICause cause)
IIntDeltaMonitor	BoolNotView.monitorDelta(ICause propagator)
IIntDeltaMonitor	BoolSetView.monitorDelta(ICause propagator)
boolean	BoolNotView.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	BoolSetView.removeAllValuesBut(IntIterableSet values, ICause cause)
boolean	BoolNotView.removeInterval(int from, int to, ICause cause)
boolean	BoolSetView.removeInterval(int from, int to, ICause cause)
boolean	BoolNotView.removeValue(int value, ICause cause)
boolean	BoolSetView.removeValue(int value, ICause cause)
boolean	BoolNotView.removeValues(IntIterableSet values, ICause cause)
boolean	BoolSetView.removeValues(IntIterableSet values, ICause cause)
boolean	BoolNotView.updateBounds(int lb, int ub, ICause cause)
boolean	BoolSetView.updateBounds(int lb, int ub, ICause cause)
boolean	BoolNotView.updateLowerBound(int value, ICause cause)
boolean	BoolSetView.updateLowerBound(int value, ICause cause)
boolean	BoolNotView.updateUpperBound(int value, ICause cause)
boolean	BoolSetView.updateUpperBound(int value, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.view.graph

Classes in org.chocosolver.solver.variables.view.graph that implement ICause

Modifier and Type	Class	Description
class	DirectedGraphView<V extends Variable>	An abstract class for directed graph views over other variables
class	UndirectedGraphView<V extends Variable>	An abstract class for undirected graph views over other variables

Methods in org.chocosolver.solver.variables.view.graph with parameters of type ICause

Modifier and Type	Method	Description
boolean	UndirectedGraphView.removeNode(int node, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.view.graph.directed

Classes in org.chocosolver.solver.variables.view.graph.directed that implement ICause

Modifier and Type	Class	Description
class	DirectedEdgeInducedSubgraphView	EDGE INDUCED DIRECTED SUBGRAPH VIEWS: Construct an edge-induced directed graph view G = (V', E') from G = (V, E) such that: V' = { x \in V | \exists y \in V s.t.
class	DirectedGraphUnionView
class	DirectedNodeInducedSubgraphView	NODE INDUCED DIRECTED SUBGRAPH VIEWS: Construct a directed graph view G' = (V', E') from another graph G = (V, E) such that: V' = V \ nodes (set difference) if exclude = true, else V' = V \cap nodes (set intersection) E' = { (x, y) \in E | x \in V' \land y \in V' }.

Methods in org.chocosolver.solver.variables.view.graph.directed with parameters of type ICause

Modifier and Type	Method	Description
IGraphDeltaMonitor	DirectedEdgeInducedSubgraphView.monitorDelta(ICause propagator)
IGraphDeltaMonitor	DirectedGraphUnionView.monitorDelta(ICause propagator)
IGraphDeltaMonitor	DirectedNodeInducedSubgraphView.monitorDelta(ICause propagator)

Uses of ICause in org.chocosolver.solver.variables.view.graph.undirected

Classes in org.chocosolver.solver.variables.view.graph.undirected that implement ICause

Modifier and Type	Class	Description
class	EdgeInducedSubgraphView	EDGE INDUCED UNDIRECTED SUBGRAPH VIEWS: Construct an edge-induced subgraph view G = (V', E') from G = (V, E) such that: V' = { x \in V | \exists y \in V s.t.
class	NodeInducedSubgraphView	NODE INDUCED UNDIRECTED SUBGRAPH VIEWS: Construct a graph view G' = (V', E') from another graph G = (V, E) such that: V' = V \ nodes (set difference) if exclude = true, else V' = V \cap nodes (set intersection) E' = { (x, y) \in E | x \in V' \land y \in V' }.
class	UndirectedGraphUnionView

Methods in org.chocosolver.solver.variables.view.graph.undirected with parameters of type ICause

Modifier and Type	Method	Description
IGraphDeltaMonitor	EdgeInducedSubgraphView.monitorDelta(ICause propagator)
IGraphDeltaMonitor	NodeInducedSubgraphView.monitorDelta(ICause propagator)
IGraphDeltaMonitor	UndirectedGraphUnionView.monitorDelta(ICause propagator)

Uses of ICause in org.chocosolver.solver.variables.view.integer

Classes in org.chocosolver.solver.variables.view.integer that implement ICause

Modifier and Type	Class	Description
class	IntMinusView<I extends IntVar>	View for -V, where V is a IntVar or view
class	IntOffsetView<I extends IntVar>	declare an IntVar based on X and C, such as X + C Based on "Views and Iterators for Generic Constraint Implementations" C.
class	IntScaleView<I extends IntVar>	declare an IntVar based on X and C, such as X * C

Methods in org.chocosolver.solver.variables.view.integer with parameters of type ICause

Modifier and Type	Method	Description
IIntDeltaMonitor	IntMinusView.monitorDelta(ICause propagator)
IIntDeltaMonitor	IntOffsetView.monitorDelta(ICause propagator)
IIntDeltaMonitor	IntScaleView.monitorDelta(ICause propagator)
boolean	IntMinusView.updateBounds(int lb, int ub, ICause cause)

Uses of ICause in org.chocosolver.solver.variables.view.set

Classes in org.chocosolver.solver.variables.view.set that implement ICause

Modifier and Type	Class	Description
class	SetBoolsView<B extends BoolVar>	Set view over an array of boolean variables defined such that: boolVars[x - offset] = True <=> x in setView This view is equivalent to the PropBoolChannel constraint.
class	SetDifferenceView	Set view representing the set difference of two set variables: z = x \ y.
class	SetGraphView<E extends GraphVar>	An abstract class for set views over graph variables.
class	SetIntersectionView	Set view over set variables representing the intersection of these variables.
class	SetIntsView<I extends IntVar>	Set view over an array of integer variables defined such that: with v an array of integers and offset an integer (constants) intVariables[x - offset] = v[x - offset] <=> x in set.
class	SetNodeGraphView<E extends GraphVar<?>>	A GraphSetView representing the set of nodes of an observed graph variable.
class	SetPredecessorsGraphView<E extends GraphVar<?>>	A GraphSetView representing the set of predecessors of a node in a graph variable.
class	SetSuccessorsGraphView<E extends GraphVar<?>>	A GraphSetView representing the set of successors of a node in a graph variable.
class	SetUnionView	Set view over set variables representing the union of these variables.

Methods in org.chocosolver.solver.variables.view.set with parameters of type ICause

Modifier and Type	Method	Description
boolean	SetBoolsView.instantiateTo(int[] value, ICause cause)
boolean	SetDifferenceView.instantiateTo(int[] value, ICause cause)
boolean	SetIntersectionView.instantiateTo(int[] value, ICause cause)
boolean	SetIntsView.instantiateTo(int[] value, ICause cause)
boolean	SetNodeGraphView.instantiateTo(int[] value, ICause cause)
boolean	SetPredecessorsGraphView.instantiateTo(int[] value, ICause cause)
boolean	SetSuccessorsGraphView.instantiateTo(int[] value, ICause cause)
boolean	SetUnionView.instantiateTo(int[] value, ICause cause)
ISetDeltaMonitor	SetBoolsView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetDifferenceView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetIntersectionView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetIntsView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetNodeGraphView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetPredecessorsGraphView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetSuccessorsGraphView.monitorDelta(ICause propagator)
ISetDeltaMonitor	SetUnionView.monitorDelta(ICause propagator)

Uses of ICause in org.chocosolver.util.objects

Methods in org.chocosolver.util.objects with parameters of type ICause

Modifier and Type	Method	Description
void	RealInterval.intersect(double l, double u, ICause cause)	Modifies the bounds for intersecting with the specified interval.
default void	RealInterval.intersect(RealInterval interval, ICause cause)	Modifies the bounds for intersecting with the specified interval.