Uses of Class
org.jacop.core.IntVar

Packages that use IntVar

Package	Description
org.jacop.constraints
org.jacop.constraints.binpacking
org.jacop.constraints.cumulative
org.jacop.constraints.diffn
org.jacop.constraints.geost
org.jacop.constraints.knapsack
org.jacop.constraints.netflow
org.jacop.constraints.regular
org.jacop.constraints.table
org.jacop.core
org.jacop.examples.cpviz
org.jacop.examples.fd
org.jacop.examples.fd.crosswords
org.jacop.examples.fd.filters
org.jacop.examples.fd.muca
org.jacop.examples.fd.nonogram
org.jacop.examples.set
org.jacop.floats.constraints
org.jacop.fz
org.jacop.fz.constraints
org.jacop.satwrapper
org.jacop.satwrapper.translation
org.jacop.search
org.jacop.search.restart
org.jacop.search.sgmpcs
org.jacop.set.constraints
org.jacop.ui
org.jacop.util
org.jacop.util.fsm

Uses of IntVar in org.jacop.constraints

Fields in org.jacop.constraints declared as IntVar

Modifier and Type	Field	Description
final IntVar	AndBoolSimple.a	It specifies variables which all must be equal to 1 to set result variable to 1.
IntVar	OrBoolSimple.a	It specifies variables which all must be equal to 1 to set result variable to 1.
final IntVar	AndBoolSimple.b
(package private) IntVar	ChannelImply.Item.b
(package private) IntVar	ChannelReif.Item.b
final IntVar[]	Conditional.b	The list of 0/1 (Boolean) variables for assignment decision.
IntVar	Implies.b	It specifies variable b in the Implies constraint.
IntVar	OrBoolSimple.b
final IntVar	Reified.b	It specifies variable b which stores status of the constraint (0 - for certain not satisfied, 1 - for certain satisfied).
final IntVar	Xor.b	It specifies variable b, which boolean status must satisfy xor relationship with status of constraint c.
(package private) IntVar	RectangleWithCondition.c
(package private) IntVar	ExclusiveItem.cond
final IntVar	SoftAlldifferent.costVar
IntVar	SoftGCC.costVar
protected final IntVar	Values.count	It specifies the idNumber of different values among variables on a given list.
final IntVar	Count.counter	It specifies variable idNumber to count the number of occurences of the specified value in a list.
final IntVar[]	CountValues.counter
final IntVar	CountVar.counter
final IntVar	CountValues.counterRest
protected IntVar[]	GCC.counters	It species variables counters for counting occurences of each possible value from the intial domain of x variables.
final IntVar[]	Assignment.d	It specifies a list of variables d.
(package private) final IntVar	Task.dur
IntVar[]	Cumulative.durations	It specifies/stores duration variables for each corresponding task.
(package private) IntVar	Member.e	It specifies variable for the overall sum.
final IntVar[]	CountValues.extendedCounter
private IntVar	NoGood.firstWatch
(package private) IntVar	Alldistinct.guideVariable
IntVar[]	SoftGCC.hardCounters
IntVar	ElementInteger.index	It specifies variable index within an element constraint list[index-indexOffset] = value.
final IntVar	ElementIntegerFast.index	It specifies variable index within an element constraint list[index - indexOffset] = value.
IntVar	ElementVariable.index	It specifies variable index within an element constraint list[index - indexOffset] = value.
final IntVar	ElementVariableFast.index	It specifies variable index within an element constraint list[index - indexOffset] = value.
final IntVar[]	Rectangle.length	It specifies the length of the rectangle in each dimension.
IntVar	Cumulative.limit	It specifies the limit of the profile of cumulative use of resources.
IntVar[]	Alldifferent.list	It specifies a list of variables which must take different values.
IntVar[]	Alldistinct.list	It specifies all variables which have to have different values.
final IntVar[]	Among.list	It specifies the list of variables whose values are checked.
IntVar[]	AndBoolVector.list	It specifies a list of variables which all must be equal to 1 to set result variable to 1.
final IntVar[]	ArgMax.list	It specifies a list of variables among which a maximum value is being searched for.
final IntVar[]	ArgMin.list	It specifies a list of variables among which a maximum value is being searched for.
final IntVar[]	AtLeast.list
final IntVar[]	AtMost.list
final IntVar[]	Count.list	The list of variables which are checked and counted if equal to specified value.
final IntVar[]	CountBounds.list	The list of variables which are checked and counted if equal to specified value.
final IntVar[]	CountValues.list
final IntVar[]	CountValuesBounds.list	The list of variables which are checked and counted if equal to specified value.
final IntVar[]	CountVar.list
IntVar[]	ElementVariable.list	It specifies list of variables within an element constraint list[index - indexOffset] = value.
final IntVar[]	ElementVariableFast.list	It specifies list of variables within an element constraint list[index - indexOffset] = value.
IntVar[]	EqBool.list	It specifies x variables in the constraint.
IntVar[]	ExtensionalConflictVA.list	It stores variables within this extensional constraint, order does matter.
IntVar[]	ExtensionalSupportSTR.list	It stores variables within this extensional constraint, order does matter.
IntVar[]	ExtensionalSupportVA.list	It stores variables within this extensional constraint, order does matter.
IntVar[]	Linear.list	Deprecated. It specifies a list of variables being summed.
final IntVar[]	Max.list	It specifies a list of variables among which a maximum value is being searched for.
final IntVar[]	Min.list	It specifies a list of variables among which the minimum value is being searched for.
IntVar[]	OrBoolVector.list	It specifies a list of variables among which one must be equal to 1 to set result variable to 1.
(package private) IntVar[]	Sequence.list
IntVar[]	Sum.list	It specifies the variables to be summed.
protected final IntVar[]	SumWeight.list	It specifies a list of variables being summed.
IntVar[]	SumWeightDom.list	Deprecated. It specifies a list of variables being summed.
protected final IntVar[]	Values.list	It specifies a list of variables which are counted.
protected IntVar[]	NoGood.listOfVars	It specifies a list of variables in no-good constraint.
IntVar[]	AmongVar.listOfX	List of variables x which values are checked against values of variables y.
IntVar[]	AmongVar.listOfY	It specifies what values we are counting in the list of x's.
final IntVar	Max.max	It specifies variable max which stores the maximum value present in the list.
final IntVar	MaxSimple.max	It specifies variable max which stores the maximum value present in the list.
final IntVar	ArgMax.maxIndex	It specifies variable max which stores the maximum value present in the list.
final IntVar	Min.min	It specifies variable min, which stores the minimum value within the whole list.
final IntVar	MinSimple.min	It specifies variable min which stores the minimum value present in the list.
final IntVar	ArgMin.minIndex	It specifies variable max which stores the maximum value present in the list.
final IntVar	Among.n	It is a idNumber variable.
IntVar	AmongVar.n	It specifies the number of x variables equal to at least one value present in the list of y.
final IntVar[]	Rectangle.origin	It specifies the origin of the rectangle in each dimension.
(package private) final IntVar	Task.res
IntVar[]	Cumulative.resources	It specifies/stores resource variable for each corresponding task.
final IntVar	AndBoolSimple.result	It specifies variable result, storing the result of and function performed a list of variables.
IntVar	AndBoolVector.result	It specifies variable result, storing the result of and function performed a list of variables.
IntVar	EqBool.result	It specifies variable result in the constraint.
IntVar	OrBoolSimple.result	It specifies variable result, storing the result of or function performed a list of variables.
IntVar	OrBoolVector.result	It specifies variable result, storing the result of or function performed a list of variables.
private IntVar	NoGood.secondWatch
IntVar[]	SoftGCC.softCounters
(package private) final IntVar	Task.start
IntVar[]	Cumulative.starts	It specifies/stores start variables for each corresponding task.
IntVar	Sum.sum	It specifies variable sum to store the overall sum of the variables being summed up.
(package private) IntVar	SumBool.sum
(package private) IntVar	SumInt.sum	It specifies variable for the overall sum.
final IntVar	CountVar.value
IntVar	ElementInteger.value	It specifies variable value within an element constraint list[index-indexOffset] = value.
final IntVar	ElementIntegerFast.value	It specifies variable value within an element constraint list[index - indexOffset] = value.
IntVar	ElementVariable.value	It specifies variable value within an element constraint list[index - indexOffset] = value.
final IntVar	ElementVariableFast.value	It specifies variable value within an element constraint list[index - indexOffset] = value.
private IntVar	Alldiff.Element.var
final IntVar	AbsXeqY.x	It contains variable x.
final IntVar[]	AllEqual.x	It specifies a left hand variable in equality constraint.
IntVar[]	Assignment.x	It specifies a list of variables x.
final IntVar[]	BoolClause.x	It specifies lists of variables for the constraint.
final IntVar	ChannelImply.x	Variables that is checked for a value.
final IntVar	ChannelReif.x	Variables that is checked for a value.
final IntVar	Distance.x	It specifes variable x in constraint |x-y|=z.
IntVar[]	GCC.x	It specifies variables x whose values are counted.
IntVar	IfThenBool.x	It specifies variable x in constraint ( X => Y ) <=> Z.
IntVar	In.x	It specifies variable x whose domain must lie within a specified domain.
(package private) IntVar[]	Increasing.x
IntVar[][]	Lex.x	A two dimensional array containing arrays which have to be lexicographically ordered.
IntVar[]	LexOrder.x	Two vectors that have to be lexicographically ordered.
(package private) IntVar[]	LinearInt.x	It specifies a list of variables being summed.
(package private) IntVar[]	Member.x	It specifies a list of variables being summed.
(package private) final IntVar[]	SeqPrecedeChain.x	It specifies lists of variables for the constraint.
(package private) IntVar[]	Stretch.x
(package private) IntVar[]	SumBool.x
(package private) IntVar[]	SumInt.x	It specifies a list of variables being summed.
final IntVar[]	ValuePrecede.x	It specifies lists of variables for the constraint.
final IntVar	XdivYeqZ.x	It specifies variable x in constraint x / y = z.
final IntVar	XeqC.x	It specifies the variable which is constrained to be equal to the specified value.
final IntVar	XeqY.x	It specifies a left hand variable in equality constraint.
final IntVar	XexpYeqZ.x	It specifies the variable x in equation x^y = z.
final IntVar	XgtC.x	It specifies variable x which must be greater than a given constraint.
final IntVar	XgteqC.x	It specifies variables x which must be greater or equal to a given constant.
final IntVar	XgteqY.x	It specifies variable x which must be greater or equal to variable Y.
final IntVar	XgtY.x	It specifies variable x which must be greater than variable y.
final IntVar	XltC.x	It specifies variable x to be lower than a given constant.
final IntVar	XlteqC.x	It specifies variable x which must be smaller or equal to a given constant.
final IntVar	XlteqY.x	It specifies variable x in the constraint x <= y.
final IntVar	XltY.x	It specifies x variable in constraint x < y.
final IntVar	XmodYeqZ.x
final IntVar	XmulCeqZ.x	It specifies variable x in constraint x * c = z.
final IntVar	XmulYeqC.x	It specifies variable x in constraint x * y = c.
final IntVar	XmulYeqZ.x	It specifies variable x in constraint x * y = z.
final IntVar	XneqC.x	It specifies variable x in constraint x != c.
final IntVar	XneqY.x	It specifies variable x in the constraint x != y.
final IntVar[]	XorBool.x	It specifies variables x for the constraint.
final IntVar	XplusCeqZ.x	It specifies variable x in constraint x+c=z.
final IntVar	XplusClteqZ.x	It specifies variable x in constraint x+c<=z.
final IntVar	XplusYeqC.x	It specifies variable x in constraint x+y=c.
final IntVar	XplusYeqZ.x	It specifies variable x in constraint x+y=z.
final IntVar	XplusYgtC.x	It specifies variable x in constraint x + y> c.
final IntVar	XplusYlteqZ.x	It specifies variable x in constraint x + y<= z.
final IntVar	MaxSimple.x1	It specifies a variables between which a maximum value is being searched for.
final IntVar	MinSimple.x1	It specifies a variables between which a minimum value is being searched for.
final IntVar	MaxSimple.x2	It specifies a variables between which a maximum value is being searched for.
final IntVar	MinSimple.x2	It specifies a variables between which a minimum value is being searched for.
final IntVar[]	SoftAlldifferent.xVars
IntVar[]	SoftGCC.xVars
final IntVar	AbsXeqY.y	It contains variable y.
final IntVar[]	BoolClause.y
final IntVar	Distance.y	It specifes variable y in constraint |x-y|=z.
IntVar	IfThenBool.y	It specifies variable y in constraint ( X => Y ) <=> Z.
IntVar[]	LexOrder.y
final IntVar	XdivYeqZ.y	It specifies variable y in constraint x / y = z.
final IntVar	XeqY.y	It specifies a right hand variable in equality constraint.
final IntVar	XexpYeqZ.y	It specifies the variable y in equation x^y = z.
final IntVar	XgteqY.y	It specifies variable y from which variable x must be greater or equal.
final IntVar	XgtY.y	It specifies variable y which must be smaller than variable x.
final IntVar	XlteqY.y	It specifies variable y in the constraint x <= y.
final IntVar	XltY.y	It specifies y variable in constraint x < y.
final IntVar	XmodYeqZ.y
final IntVar	XmulYeqC.y	It specifies variable y in constraint x * y = c.
final IntVar	XmulYeqZ.y	It specifies variable y in constraint x * y = z.
final IntVar	XneqY.y	It specifies variable y in the constraint x != y.
final IntVar	XorBool.y
final IntVar	XplusYeqC.y	It specifies variable y in constraint x+y=c.
final IntVar	XplusYeqZ.y	It specifies variable x in constraint x+y=z.
final IntVar	XplusYgtC.y	It specifies variable y in constraint x + y> c.
final IntVar	XplusYlteqZ.y	It specifies variable x in constraint x + y<= z.
final IntVar	Distance.z	It specifes variable z in constraint |x-y|=z.
IntVar	IfThenBool.z	It specifies variable z in constraint ( X => Y ) <=> Z.
final IntVar	XdivYeqZ.z	It specifies variable z in constraint x / y = z.
final IntVar	XexpYeqZ.z	It specifies the variable z in equation x^y = z.
final IntVar	XmodYeqZ.z
final IntVar	XmulCeqZ.z	It specifies variable x in constraint x * c = z.
final IntVar	XmulYeqZ.z	It specifies variable z in constraint x * y = z.
final IntVar	XplusCeqZ.z	It specifies variable z in constraint x+c=z.
final IntVar	XplusClteqZ.z	It specifies variable z in constraint x+c<= z.
final IntVar	XplusYeqZ.z	It specifies variable x in constraint x+y=z.
final IntVar	XplusYlteqZ.z	It specifies variable x in constraint x + y<= z.

Fields in org.jacop.constraints with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Map<IntVar,Integer>	Assignment.ds
(package private) Map<IntVar,List<Integer>>	ElementVariable.duplicates
(package private) LinkedHashSet<IntVar>	Alldistinct.freeVariables
(package private) Map<IntVar,Integer>	ElementVariable.mapping
(package private) Map<IntVar,TimeStamp<Integer>>	Alldistinct.matching
(package private) Comparator<IntVar>	Values.minFDV
private Map<IntVar,Integer>	Among.position
protected Map<IntVar,Integer>	Alldifferent.positionMapping
(package private) Map<IntVar,Integer>	Alldistinct.scc
(package private) Map<IntVar,TimeStamp<Integer>>	Alldistinct.sccStamp
(package private) Map<Integer,IntVar>	ChannelImply.valueMap
(package private) Map<Integer,IntVar>	ChannelReif.valueMap
(package private) Map<Integer,SimpleArrayList<IntVar>>	Alldistinct.valueMapVariable
(package private) LinkedHashSet<IntVar>	Alldifferent.variableQueue
(package private) LinkedHashSet<IntVar>	Alldistinct.variableQueue
(package private) LinkedHashSet<IntVar>	Among.variableQueue
(package private) LinkedHashSet<IntVar>	Assignment.variableQueue
(package private) Set<IntVar>	Diff.variableQueue
(package private) LinkedHashSet<IntVar>	ElementVariable.variableQueue
(package private) LinkedHashSet<IntVar>	ExtensionalSupportVA.variableQueue
(package private) LinkedHashSet<IntVar>	SumWeight.variableQueue
(package private) LinkedHashSet<IntVar>	SumWeightDom.variableQueue	Deprecated. It specifies variable queue of grounded varibales since last run.
private final Map<IntVar,Integer>	ValuePrecede.varMap
private LinkedHashSet<IntVar>	ValuePrecede.varQueue
(package private) Map<IntVar,int[]>	LexOrder.varXToIndex
(package private) Map<IntVar,int[]>	LexOrder.varYToIndex
private Map<IntVar,Integer>	AmongVar.xIndex
private Map<IntVar,Integer>	GCC.xNodesHash
(package private) Map<IntVar,Integer>	Assignment.xs
private Set<IntVar>	GCC.xVariableToChange
private Map<IntVar,Integer>	AmongVar.yIndex
private Set<IntVar>	GCC.zeroCounters

Methods in org.jacop.constraints that return IntVar

Modifier and Type	Method	Description
(package private) IntVar	ExclusiveItem.condition()
(package private) IntVar	ExclusiveList.condition(int n, int m)
IntVar	RectangleWithCondition.condition()
(package private) IntVar	Task.dur()
(package private) IntVar[]	AndBool.filter(IntVar[] xs)
(package private) IntVar[]	OrBool.filter(IntVar[] xs)
(package private) IntVar[]	SumBool.filterAndOverflow(IntVar[] x)
(package private) IntVar	Rectangle.length(int i)
private IntVar[]	GCC.removeZeroCounters(IntVar[] x, IntVar[] counters)
(package private) IntVar	Task.res()
(package private) IntVar	Task.start()

Methods in org.jacop.constraints that return types with arguments of type IntVar

Modifier and Type	Method	Description
(package private) List<? extends IntVar>	ExclusiveList.fdvs(int index)

Methods in org.jacop.constraints with parameters of type IntVar

Modifier and Type	Method	Description
static Constraint	Element.choose(IntVar index, int[] values, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, int[] values, IntVar value, int shift)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value, int shift)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, IntVar[] variables, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, IntVar[] variables, IntVar value, int shift)	It constructs element constraint based on variables.
protected void	LinearInt.commonInitialization(Store store, IntVar[] list, int[] weights, String rel, int sum)
private void	NoGood.commonInitialization(IntVar[] listOfVars, int[] listOfValues)
void	SumWeightDom.commonInitialization(IntVar[] list, int[] weights, int sum)	Deprecated.
private void	Diff.computeNewMaxDuration(IntVar start, int durMin, int excludeMin, int excludeMax)
private boolean	ElementIntegerFast.disjoint(IntVar v1, int v2)
private boolean	ElementVariableFast.disjoint(IntVar v1, IntVar v2)
private boolean	LexOrder.eqSingletons(IntVar x, IntVar y)
(package private) int	Alldistinct.estimatePruning(IntVar x, Integer v)
(package private) int	Alldistinct.estimatePruningRecursive(IntVar xVar, Integer v, List<IntVar> exploredX, List<Integer> exploredV)
(package private) IntVar[]	AndBool.filter(IntVar[] xs)
(package private) IntVar[]	OrBool.filter(IntVar[] xs)
(package private) IntVar[]	SumBool.filterAndOverflow(IntVar[] x)
(package private) IntDomain	XmodYeqZ.makeDomain(IntVar x, int y, IntVar z)
private void	Cumulative.profileCheckInterval(Store store, IntVar Start, IntVar Duration, Interval i, IntVar Resources, int mustUseMin, int mustUseMax)
private void	Diff.profileCheckInterval(Store store, DiffnProfile Profile, int limit, IntVar Start, IntVar Duration, int iMin, int i_max, IntVar Resources)
(package private) void	DisjointConditional.profileCheckInterval(Store store, DisjointConditionalProfile Profile, int limit, IntVar Start, IntVar Duration, int _min, int _max, IntVar Resources)
private boolean	LinearInt.pruneMax(IntVar x, long max)
private boolean	SumInt.pruneMax(IntVar x, long max)
private boolean	LinearInt.pruneMin(IntVar x, long min)
private boolean	SumInt.pruneMin(IntVar x, long min)
private boolean	LinearInt.pruneNe(IntVar x, long min, long max, long a)
private boolean	SumInt.pruneNe(IntVar x, long min, long max)
private void	GCC.putToTheEnd(IntVar[] list, int element)
private IntVar[]	GCC.removeZeroCounters(IntVar[] x, IntVar[] counters)
private void	Alldistinct.revisitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low, LinkedHashSet<IntVar> fdvs)
private void	BoolClause.swap(IntVar[] p, int i, int j)
static Rectangle[]	Rectangle.toArrayOf2DRectangles(IntVar[][] rectangles)
static Rectangle[]	Rectangle.toArrayOf2DRectangles(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)
(package private) void	Circuit.updateChains(IntVar v)
private void	Alldistinct.visitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low)

Method parameters in org.jacop.constraints with type arguments of type IntVar

Modifier and Type	Method	Description
(package private) void	Circuit.alldifferent(Store store, LinkedHashSet<IntVar> fdvs)
(package private) void	Subcircuit.alldifferent(Store store, LinkedHashSet<IntVar> fdvs)
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value)	It constructs element constraint based on variables.
static Constraint	Element.choose(IntVar index, List<? extends IntVar> variables, IntVar value, int shift)	It constructs element constraint based on variables.
(package private) boolean	DisjointConditional.conditionChanged(Set<IntVar> fdvQueue, int j)
(package private) boolean	Diff.containsChangedVariable(Rectangle r, Set<IntVar> fdvQueue)
(package private) int	Alldistinct.estimatePruningRecursive(IntVar xVar, Integer v, List<IntVar> exploredX, List<Integer> exploredV)
private boolean	Diff.findRectangles(Rectangle r, List<IntRectangle> UsedRect, List<Rectangle> ProfileCandidates, Set<IntVar> fdvQueue)
(package private) boolean	Diff2.findRectangles(Rectangle r, int index, List<IntRectangle> UsedRect, List<Rectangle> ProfileCandidates, List<Rectangle> OverlappingRects, Set<IntVar> fdvQueue)
private boolean	Disjoint.findRectangles(Rectangle r, int index, List<IntRectangle> UsedRect, List<Rectangle> ProfileCandidates, List<Rectangle> OverlappingRects, Set<IntVar> fdvQueue)
(package private) boolean	DisjointConditional.findRectangles(Rectangle r, int index, List<IntRectangle> UsedRect, List<RectangleWithCondition> ProfileCandidates, List<RectangleWithCondition> OverlappingRects, Set<IntVar> fdvQueue)
private void	Alldistinct.markReachableVariables(LinkedHashSet<IntVar> variablesReachableFromFreeValues, Integer value)
(package private) void	Diff.narrowRectangles(Set<IntVar> fdvQueue)
(package private) void	Diff2.narrowRectangles(Set<IntVar> fdvQueue)
(package private) void	Disjoint.narrowRectangles(Set<IntVar> fdvQueue)
(package private) void	DisjointConditional.narrowRectangles(Set<IntVar> fdvQueue)
(package private) void	Circuit.oneCircuit(Store store, LinkedHashSet<IntVar> fdvs)
private void	Alldistinct.revisitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low, LinkedHashSet<IntVar> fdvs)
private void	Alldistinct.revisitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low, LinkedHashSet<IntVar> fdvs)
private void	Alldistinct.revisitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low, LinkedHashSet<IntVar> fdvs)
static Rectangle[]	Rectangle.toArrayOf2DRectangles(List<? extends List<? extends IntVar>> rectangles)
private void	Alldistinct.visitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low)
private void	Alldistinct.visitTarjan(IntVar x, List<IntVar> l, Map<IntVar,Integer> dfsnum, Map<IntVar,Integer> low)

Constructors in org.jacop.constraints with parameters of type IntVar

Modifier	Constructor	Description
	AbsXeqY(IntVar x, IntVar y)	It constructs |X| = Y constraints.
	AbsXeqY(IntVar x, IntVar y, boolean domConsistency)	It constructs |X| = Y constraints.
	Alldiff(IntVar[] variables)	It constructs the alldiff constraint for the supplied variable.
	Alldifferent(IntVar[] list)	It constructs the alldifferent constraint for the supplied variable.
	Alldistinct(IntVar[] list)	It constructs an alldistinct constraint.
	AllEqual(IntVar[] x)	It constructs constraint x[i] = x[j].
	Among(List<? extends IntVar> list, IntervalDomain kSet, IntVar n)	It constructs an Among constraint.
	Among(IntVar[] list, IntervalDomain kSet, IntVar n)	It constructs an Among constraint.
	AmongVar(List<? extends IntVar> listOfX, List<? extends IntVar> listOfY, IntVar n)	It constructs an AmongVar constraint.
	AmongVar(IntVar[] listOfX, IntVar[] listOfY, IntVar n)	It constructs an AmongVar constraint.
	AndBool(List<? extends IntVar> a, IntVar result)	It constructs and constraint on variables.
	AndBool(IntVar[] a, IntVar result)	It constructs and constraint on variables.
	AndBool(IntVar a, IntVar b, IntVar result)	It constructs and constraint on variables.
	AndBoolSimple(IntVar a, IntVar b, IntVar result)	It constructs AndBoolSimple.
	AndBoolVector(List<? extends IntVar> list, IntVar result)	It constructs AndBoolVector.
	AndBoolVector(IntVar[] list, IntVar result)	It constructs AndBoolVector.
	ArgMax(List<? extends IntVar> variables, IntVar maxIndex)
	ArgMax(List<? extends IntVar> variables, IntVar maxIndex, int indexOffset)	It constructs max constraint.
	ArgMax(IntVar[] list, IntVar maxIndex)
	ArgMax(IntVar[] list, IntVar maxIndex, int indexOffset)	It constructs max constraint.
	ArgMin(List<? extends IntVar> variables, IntVar minIndex)
	ArgMin(List<? extends IntVar> variables, IntVar minIndex, int indexOffset)	It constructs max constraint.
	ArgMin(IntVar[] list, IntVar minIndex)
	ArgMin(IntVar[] list, IntVar minIndex, int indexOffset)	It constructs max constraint.
	Assignment(IntVar[] xs, IntVar[] ds)	It constructs an Assignment constraint with shift equal 0.
	Assignment(IntVar[] xs, IntVar[] ds, int min)	It enforces the relationship x[d[i]-min]=i+min and d[x[i]-min]=i+min.
	Assignment(IntVar[] xs, IntVar[] ds, int shiftX, int shiftD)	It enforces the relationship x[d[i]-shiftX]=i+shiftD and d[x[i]-shiftD]=i+shiftX.
	AtLeast(IntVar[] list, int counter, int value)	It constructs a AtLeast constraint.
	AtMost(IntVar[] list, int counter, int value)	It constructs a AtMost constraint.
	BoolClause(IntVar[] x, IntVar[] y)	It constructs BoolClause.
	ChannelImply(IntVar x, Map<Integer,? extends IntVar> bs)
	ChannelImply(IntVar x, IntVar[] bs)
	ChannelImply(IntVar x, IntVar[] bs, int[] value)	It creates ChannelImply constraint.
	ChannelImply(IntVar x, IntVar[] bs, IntDomain value)	It creates ChannelImply constraint.
	ChannelReif(IntVar x, Map<Integer,? extends IntVar> bs)
	ChannelReif(IntVar x, IntVar[] bs)
	ChannelReif(IntVar x, IntVar[] bs, int[] value)	It creates ChannelReif constraint.
	ChannelReif(IntVar x, IntVar[] bs, IntDomain value)	It creates ChannelReif constraint.
	Circuit(IntVar[] list)	It constructs a circuit constraint.
	Conditional(IntVar[] b, PrimitiveConstraint[] c)	It constructs a Conditional constraint.
	Count(List<? extends IntVar> list, IntVar counter, int value)	It constructs a Count constraint.
	Count(IntVar[] list, IntVar counter, int value)	It constructs a Count constraint.
	CountBounds(IntVar[] list, int value, int lb, int ub)	It constructs a CountBounds constraint.
	CountValues(List<? extends IntVar> list, IntVar[] counter, int[] values)	It constructs a CountValues constraint.
	CountValues(IntVar[] list, IntVar[] counter, int[] values)	It constructs a CountValues constraint.
	CountValuesBounds(IntVar[] list, int[] lb, int[] ub, int[] values)	It constructs a CountValuesBounds constraint.
	CountVar(List<? extends IntVar> list, IntVar counter, IntVar value)	It constructs a CountVar constraint.
	CountVar(IntVar[] list, IntVar counter, IntVar value)	It constructs a CountVar constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean edgeFinding)	It creates a cumulative constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean edgeFinding, boolean profile)	It creates a cumulative constraint.
	Cumulative(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit)	It creates a cumulative constraint.
	Cumulative(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, boolean edgeFinding)	It creates a cumulative constraint.
	Cumulative(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, boolean doEdgeFinding, boolean doProfile)	It creates a cumulative constraint.
	Cumulative(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, boolean doEdgeFinding, boolean doProfile, boolean setLimit)	It creates a cumulative constraint.
	Decreasing(IntVar[] x)
	Decreasing(IntVar[] x, boolean strict)
	Diff(IntVar[][] rectangles)	It specifies a diff constraint.
	Diff(IntVar[][] rectangles, boolean profile)	It specifies a diff constraint.
	Diff(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It constructs a diff constraint.
	Diff(IntVar[] o1, IntVar[] o2, IntVar[] l1, IntVar[] l2, boolean profile)	It constructs a diff constraint.
	Diff2(IntVar[][] rectangles)	It creates a diff2 constraint.
	Diff2(IntVar[][] rectangles, boolean profile)	It creates a diff2 constraint.
	Diff2(IntVar[][] rect, List<List<Integer>> exclusive)	Conditional Diff2.
	Diff2(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It creates a diff2 constraint.
	Diff2(IntVar[] o1, IntVar[] o2, IntVar[] l1, IntVar[] l2, boolean profile)	It creates a diff2 constraint.
	Disjoint(IntVar[][] rectangles)	It creates a diff2 constraint.
	Disjoint(IntVar[][] rectangles, boolean profile)	It creates a diff2 constraint.
	Disjoint(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It creates a diff2 constraint.
	Disjoint(IntVar[] o1, IntVar[] o2, IntVar[] l1, IntVar[] l2, boolean profile)	It creates a diff2 constraint.
	DisjointConditional(IntVar[][] rectangles, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition)	It creates Disjoint conditional constraint.
	DisjointConditional(IntVar[][] rectangles, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition, boolean profile)	It creates Disjoint conditional constraint.
	DisjointConditional(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition)	It constructs a disjoint conditional constraint.
	DisjointConditional(IntVar[] o1, IntVar[] o2, IntVar[] l1, IntVar[] l2, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition, boolean profile)	It constructs a disjoint conditional constraint.
	Distance(IntVar x, IntVar y, IntVar z)	Distance between x and y |x-y| = z
	Element(IntVar index, int[] values, IntVar value)	Deprecated.
	Element(IntVar index, int[] values, IntVar value, int shift)	Deprecated.
	Element(IntVar index, List<? extends IntVar> variables, IntVar value)	Deprecated.
	Element(IntVar index, List<? extends IntVar> variables, IntVar value, int shift)	Deprecated.
	Element(IntVar index, IntVar[] variables, IntVar value)	Deprecated.
	Element(IntVar index, IntVar[] variables, IntVar value, int shift)	Deprecated.
(package private)	ElementInteger(IntVar index, int[] list, IntVar value)	It constructs an element constraint with indexOffset by default set to 0.
	ElementInteger(IntVar index, int[] list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementInteger(IntVar index, int[] list, IntVar value, int indexOffset, boolean checkDuplicates)	It constructs an element constraint.
	ElementInteger(IntVar index, List<Integer> list, IntVar value)	It constructs an element constraint with default indexOffset equal 0.
	ElementInteger(IntVar index, List<Integer> list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementInteger(IntVar index, List<Integer> list, IntVar value, int indexOffset, boolean checkDuplicates)	It constructs an element constraint.
	ElementIntegerFast(IntVar index, int[] list, IntVar value)	It constructs an element constraint.
	ElementIntegerFast(IntVar index, int[] list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementIntegerFast(IntVar index, List<? extends Integer> list, IntVar value)	It constructs an element constraint.
	ElementIntegerFast(IntVar index, List<? extends Integer> list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementVariable(IntVar index, List<? extends IntVar> list, IntVar value)	It constructs an element constraint.
	ElementVariable(IntVar index, List<? extends IntVar> list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementVariable(IntVar index, IntVar[] list, IntVar value)	It constructs an element constraint.
	ElementVariable(IntVar index, IntVar[] list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementVariableFast(IntVar index, List<? extends IntVar> list, IntVar value)	It constructs an element constraint.
	ElementVariableFast(IntVar index, List<? extends IntVar> list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementVariableFast(IntVar index, IntVar[] list, IntVar value)	It constructs an element constraint.
	ElementVariableFast(IntVar index, IntVar[] list, IntVar value, int indexOffset)	It constructs an element constraint.
	EqBool(List<? extends IntVar> list, IntVar result)	It constructs eqBool.
	EqBool(IntVar[] list, IntVar result)	It constructs eqBool.
(package private)	ExclusiveItem(int a, int b, IntVar c)
	ExtensionalConflictVA(IntVar[] list)	Deprecated.
	ExtensionalConflictVA(IntVar[] list, int[][] tuples)	Constructor stores reference to tuples until imposition, any changes to tuples parameter will be reflected in the constraint behavior.
	ExtensionalSupportMDD(IntVar[] vars, int[][] table)	It constructs extensional support constraint.
	ExtensionalSupportSTR(IntVar[] list, boolean reinsertBefore, boolean residuesBefore)	Deprecated.
	ExtensionalSupportSTR(IntVar[] variables, int[][] tuples)	It creates an extensional constraint.
	ExtensionalSupportSTR(IntVar[] list, int[][] tuples, boolean reinsertBefore, boolean residuesBefore)	It constructs an extensional constraint.
	ExtensionalSupportVA(IntVar[] list)	Partial constructor which stores variables involved in a constraint but does not get information about tuples yet.
	ExtensionalSupportVA(IntVar[] list, int[][] tuples)	Constructor stores reference to tuples until imposition, any changes to tuples parameter will be reflected in the constraint behavior.
	GCC(IntVar[] x, IntVar[] counters)	It constructs global cardinality constraint.
	IfThenBool(IntVar x, IntVar y, IntVar z)	It constructs constraint ( X => Y ) <=> Z.
	Implies(IntVar b, PrimitiveConstraint c)	It constructs ifthen constraint.
	In(IntVar x, IntDomain dom)	It constructs an In constraint to restrict the domain of the variable.
	Increasing(IntVar[] x)
	Increasing(IntVar[] x, boolean strict)
	Item(IntVar b, int v)
	Item(IntVar b, int v)
	Lex(IntVar[][] x)	It creates a lexicographical order for vectors x[i], i.e.
	Lex(IntVar[][] x, boolean lt)
	LexOrder(IntVar[] x, IntVar[] y)	It creates a lexicographical order for vectors x and y,
	LexOrder(IntVar[] x, IntVar[] y, boolean lt)
	Linear(Store store, IntVar[] list, int[] weights, String rel, int sum)	Deprecated. It constructs the constraint Linear.
	LinearInt(IntVar[] list, int[] weights, String rel, int sum)
	LinearInt(IntVar[] list, int[] weights, String rel, IntVar sum)
	LinearInt(Store store, IntVar[] list, int[] weights, String rel, int sum)	Deprecated.
	LinearInt(Store store, IntVar[] list, int[] weights, String rel, IntVar sum)	Deprecated.
	LinearIntDom(IntVar[] list, int[] weights, String rel, int sum)	It constructs the constraint LinearIntDom.
	LinearIntDom(IntVar[] list, int[] weights, String rel, IntVar sum)	It constructs the constraint LinearIntDom.
	LinearIntDom(Store store, IntVar[] list, int[] weights, String rel, int sum)	Deprecated. LinearIntDom constraint does not use Store parameter any longer.
	LinearIntDom(Store store, IntVar[] list, int[] weights, String rel, IntVar sum)	Deprecated. LinearIntDom constraint does not use Store parameter any longer.
	Max(List<? extends IntVar> variables, IntVar max)	It constructs max constraint.
	Max(IntVar[] list, IntVar max)	It constructs max constraint.
	MaxSimple(IntVar x1, IntVar x2, IntVar max)	It constructs max constraint.
	Member(List<? extends IntVar> list, IntVar e)	It constructs the constraint Member.
	Member(IntVar[] list, IntVar e)
	Min(List<? extends IntVar> list, IntVar min)	It constructs min constraint.
	Min(IntVar[] list, IntVar min)	It constructs min constraint.
	MinSimple(IntVar x1, IntVar x2, IntVar min)	It constructs min constraint.
	NoGood(IntVar[] listOfVars, int[] listOfValues)	It creates a no-good constraint.
	OrBool(List<? extends IntVar> a, IntVar result)	It constructs and constraint on variables.
	OrBool(IntVar[] a, IntVar result)	It constructs and constraint on variables.
	OrBool(IntVar a, IntVar b, IntVar result)	It constructs and constraint on variables.
	OrBoolSimple(IntVar a, IntVar b, IntVar result)	It constructs orBool.
	OrBoolVector(List<? extends IntVar> list, IntVar result)	It constructs orBool.
	OrBoolVector(IntVar[] list, IntVar result)	It constructs orBool.
	Rectangle(IntVar[] list)	It constructs a rectangle.
	Rectangle(IntVar[] origin, IntVar[] length)	It constructs a rectangle.
	RectangleWithCondition(int i, List<? extends IntVar> R, IntVar cond)
	RectangleWithCondition(int i, Rectangle R, IntVar cond)
	RectangleWithCondition(int i, IntVar[] R, IntVar cond)
	Reified(PrimitiveConstraint c, IntVar b)	It creates Reified constraint.
	SeqPrecedeChain(IntVar[] x)	It constructs SeqPrecedeChain.
	Sequence(IntVar[] list, IntervalDomain set, int q, int min, int max)	It creates a Sequence constraint.
	SoftAlldifferent(IntVar[] xVars, IntVar costVar, ViolationMeasure violationMeasure)
	SoftGCC(IntVar[] xVars, int[] hardLowerBound, int[] hardUpperBound, int[] countedValue, IntVar[] softCounters, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	SoftGCC(IntVar[] xVars, int[] hardLowerBound, int[] hardUpperBound, IntVar[] softCounters, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	SoftGCC(IntVar[] xVars, IntVar[] hardCounters, int[] countedValue, int[] softLowerBound, int[] softUpperBound, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	SoftGCC(IntVar[] xVars, IntVar[] hardCounters, int[] softLowerBound, int[] softUpperBound, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	SoftGCC(IntVar[] xVars, IntVar[] hardCounters, int[] countedValue, IntVar[] softCounters, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	SoftGCC(IntVar[] xVars, IntVar[] hardCounters, IntVar[] softCounters, IntVar costVar, ViolationMeasure violationMeasure)	It specifies soft-GCC constraint.
	Stretch(int[] values, int[] min, int[] max, IntVar[] x)	It creates a Stretch constraint.
	Subcircuit(IntVar[] list)	It constructs a circuit constraint.
	Sum(List<? extends IntVar> list, IntVar sum)	It creates a sum constraints which sums all variables and makes it equal to variable sum.
	Sum(IntVar[] list, IntVar sum)	It constructs sum constraint which sums all variables and makes it equal to variable sum.
	SumBool(List<? extends IntVar> variables, String rel, IntVar sum)
	SumBool(IntVar[] list, String rel, IntVar sum)
	SumBool(Store store, List<? extends IntVar> variables, String rel, IntVar sum)	Deprecated.
	SumBool(Store store, IntVar[] list, String rel, IntVar sum)	Deprecated.
	SumInt(List<? extends IntVar> variables, String rel, IntVar sum)	It constructs the constraint SumInt.
	SumInt(IntVar[] list, String rel, IntVar sum)
	SumInt(Store store, List<? extends IntVar> variables, String rel, IntVar sum)	Deprecated. SumInt constraint does not use Store parameter any longer.
	SumInt(Store store, IntVar[] list, String rel, IntVar sum)	Deprecated. SumInt constraint does not use Store parameter any longer.
	SumWeight(List<? extends IntVar> variables, List<Integer> weights, IntVar sum)	It constructs the constraint SumWeight.
	SumWeight(IntVar[] list, int[] weights, int equalTo)	SumWeight constraint implements the weighted summation over several variables.
	SumWeight(IntVar[] list, int[] weights, IntVar sum)	SumWeight constraint implements the weighted summation over several variables.
private	SumWeight(IntVar[] list, int[] weights, IntVar sum, int equalTo)
	SumWeightDom(List<? extends IntVar> list, List<Integer> weights, IntVar sum)	Deprecated. It constructs the constraint SumWeightDom.
	SumWeightDom(IntVar[] list, int[] weights, int sum)	Deprecated.
	SumWeightDom(IntVar[] list, int[] weights, IntVar sum)	Deprecated.
(package private)	Task(IntVar start, IntVar duration, IntVar resourceUsage)
	ValuePrecede(int s, int t, IntVar[] x)	It constructs ValuePrecede.
	Values(List<? extends IntVar> list, IntVar count)	It constructs Values constraint.
	Values(IntVar[] list, IntVar count)	It constructs Values constraint.
	XdivYeqZ(IntVar x, IntVar y, IntVar z)	It constructs a constraint X div Y = Z.
	XeqC(IntVar x, int c)	It constructs the constraint X = C.
	XeqY(IntVar x, IntVar y)	It constructs constraint X = Y.
	XexpYeqZ(IntVar x, IntVar y, IntVar z)	It constructs constraint X^Y=Z.
	XgtC(IntVar x, int c)	It constructs constraint X > C.
	XgteqC(IntVar x, int c)	It constructs constraint X >= C.
	XgteqY(IntVar x, IntVar y)	It constructs constraint X >= Y.
	XgtY(IntVar x, IntVar y)	It constructs a constraint X > Y.
	XltC(IntVar x, int c)	It constructs constraint X < C.
	XlteqC(IntVar x, int c)	It constructs constraint X <= C.
	XlteqY(IntVar x, IntVar y)	It constructs the constraint X <= Y.
	XltY(IntVar x, IntVar y)	It constructs the constraint X < Y.
	XmodYeqZ(IntVar x, IntVar y, IntVar z)	It constructs a constraint X mod Y = Z.
	XmulCeqZ(IntVar x, int c, IntVar z)	It constructs a constraint X * C = Z.
	XmulYeqC(IntVar x, IntVar y, int c)	It constructs constraint X * Y = C.
	XmulYeqZ(IntVar x, IntVar y, IntVar z)	It constructs a constraint X * Y = Z.
	XneqC(IntVar x, int c)	It constructs x != c constraint.
	XneqY(IntVar x, IntVar y)	It constructs X != Y constraint.
	Xor(PrimitiveConstraint c, IntVar b)	It constructs a xor constraint.
	XorBool(IntVar[] x, IntVar y)	It constructs constraint (x_0 xor x_1 xor ...
	XplusCeqZ(IntVar x, int c, IntVar z)	It constructs a constraint x+c=z.
	XplusClteqZ(IntVar x, int c, IntVar z)	It constructs constraint X+C<= Z.
	XplusYeqC(IntVar x, IntVar y, int c)	It constructs the constraint X+Y=C.
	XplusYeqZ(IntVar x, IntVar y, IntVar z)	It constructs constraint X+Y=Z.
	XplusYgtC(IntVar x, IntVar y, int c)	It constructs X+Y> C constraint.
	XplusYlteqZ(IntVar x, IntVar y, IntVar z)	It constructs X + Y<= Z constraint.

Constructor parameters in org.jacop.constraints with type arguments of type IntVar

Modifier	Constructor	Description
	Alldiff(List<? extends IntVar> variables)	It constructs the alldiff constraint for the supplied variable.
	Alldifferent(List<? extends IntVar> variables)	It constructs the alldifferent constraint for the supplied variable.
	Alldistinct(List<? extends IntVar> list)	It constructs an alldistinct constraint.
	Among(List<? extends IntVar> list, IntervalDomain kSet, IntVar n)	It constructs an Among constraint.
	AmongVar(List<? extends IntVar> listOfX, List<? extends IntVar> listOfY, IntVar n)	It constructs an AmongVar constraint.
	AndBool(List<? extends IntVar> a, IntVar result)	It constructs and constraint on variables.
	AndBoolVector(List<? extends IntVar> list, IntVar result)	It constructs AndBoolVector.
	ArgMax(List<? extends IntVar> variables, IntVar maxIndex)
	ArgMax(List<? extends IntVar> variables, IntVar maxIndex, int indexOffset)	It constructs max constraint.
	ArgMin(List<? extends IntVar> variables, IntVar minIndex)
	ArgMin(List<? extends IntVar> variables, IntVar minIndex, int indexOffset)	It constructs max constraint.
	Assignment(List<? extends IntVar> xs, List<? extends IntVar> ds)	It constructs an Assignment constraint with shift equal 0.
	Assignment(List<? extends IntVar> xs, List<? extends IntVar> ds, int shiftX, int shiftD)	It enforces the relationship x[d[i]-shiftX]=i+shiftD and d[x[i]-shiftD]=i+shiftX.
	AtLeast(List<? extends IntVar> list, int counter, int value)	It constructs a AtLeast constraint.
	AtMost(List<? extends IntVar> list, int counter, int value)	It constructs a AtMost constraint.
	BoolClause(List<? extends IntVar> x, List<? extends IntVar> y)	It constructs BoolClause.
	ChannelImply(IntVar x, Map<Integer,? extends IntVar> bs)
	ChannelReif(IntVar x, Map<Integer,? extends IntVar> bs)
	Circuit(List<? extends IntVar> list)	It constructs a circuit constraint.
	Conditional(List<? extends IntVar> b, List<? extends PrimitiveConstraint> c)	It constructs a Conditional constraint.
	Count(List<? extends IntVar> list, IntVar counter, int value)	It constructs a Count constraint.
	CountBounds(List<? extends IntVar> list, int value, int lb, int ub)	It constructs a CountBounds constraint.
	CountValues(List<? extends IntVar> list, IntVar[] counter, int[] values)	It constructs a CountValues constraint.
	CountValuesBounds(List<? extends IntVar> list, int[] lb, int[] ub, int[] values)	It constructs a CountValuesBounds constraint.
	CountVar(List<? extends IntVar> list, IntVar counter, IntVar value)	It constructs a CountVar constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean edgeFinding)	It creates a cumulative constraint.
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean edgeFinding, boolean profile)	It creates a cumulative constraint.
	Decreasing(List<? extends IntVar> x)	It constructs an decreasing constraint.
	Decreasing(List<? extends IntVar> x, boolean strict)
	Diff(List<? extends List<? extends IntVar>> rectangles)	It specifies a diffn constraint.
	Diff(List<? extends List<? extends IntVar>> rectangles, boolean profile)	It specifies a diff constraint.
	Diff(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2)	It constructs a diff constraint.
	Diff(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, boolean profile)	It constructs a diff constraint.
	Diff2(List<? extends List<? extends IntVar>> rectangles)	It creates a diff2 constraint.
	Diff2(List<? extends List<? extends IntVar>> rectangles, boolean profile)	It creates a diff2 constraint.
	Diff2(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2)	It creates a diff2 constraint.
	Diff2(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, boolean profile)	It creates a diff2 constraint.
	Diff2(List<List<? extends IntVar>> rectangles, List<List<Integer>> exclusiveList)	Conditional Diff2.
	Disjoint(List<? extends List<? extends IntVar>> rectangles)	It creates a diff2 constraint.
	Disjoint(List<? extends List<? extends IntVar>> rectangles, boolean profile)	It creates a diff2 constraint.
	Disjoint(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2)	It creates a diff2 constraint.
	Disjoint(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, boolean profile)	It creates a diff2 constraint.
	DisjointConditional(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition)	It constructs a disjoint conditional constraint.
	DisjointConditional(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition, boolean profile)	It constructs a disjoint conditional constraint.
	DisjointConditional(List<List<? extends IntVar>> rectangles, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition)	It creates Disjoint conditional constraint.
	DisjointConditional(List<List<? extends IntVar>> rectangles, List<List<Integer>> exceptionIndices, List<? extends IntVar> exceptionCondition, boolean profile)	It creates Disjoint conditional constraint.
	Element(IntVar index, List<? extends IntVar> variables, IntVar value)	Deprecated.
	Element(IntVar index, List<? extends IntVar> variables, IntVar value, int shift)	Deprecated.
	ElementVariable(IntVar index, List<? extends IntVar> list, IntVar value)	It constructs an element constraint.
	ElementVariable(IntVar index, List<? extends IntVar> list, IntVar value, int indexOffset)	It constructs an element constraint.
	ElementVariableFast(IntVar index, List<? extends IntVar> list, IntVar value)	It constructs an element constraint.
	ElementVariableFast(IntVar index, List<? extends IntVar> list, IntVar value, int indexOffset)	It constructs an element constraint.
	EqBool(List<? extends IntVar> list, IntVar result)	It constructs eqBool.
	ExtensionalConflictVA(List<? extends IntVar> variables, int[][] tuples)	The constructor does not create local copy of tuples array.
	ExtensionalSupportVA(List<? extends IntVar> variables, int[][] tuples)	The constructor does not create local copy of tuples array.
	GCC(List<? extends IntVar> x, List<? extends IntVar> counters)	It constructs global cardinality constraint.
	Increasing(List<? extends IntVar> x)	It constructs an increasing constraint.
	Increasing(List<? extends IntVar> x, boolean strict)
	Linear(Store store, List<? extends IntVar> variables, List<Integer> weights, String rel, int sum)	Deprecated. It constructs the constraint Linear.
	LinearInt(List<? extends IntVar> list, List<Integer> weights, String rel, int sum)	It constructs the constraint LinearInt.
	LinearInt(Store store, List<? extends IntVar> list, List<Integer> weights, String rel, int sum)	Deprecated. LinearInt constraint does not use Store parameter any longer.
	LinearIntDom(List<? extends IntVar> variables, List<Integer> weights, String rel, int sum)	It constructs the constraint LinearIntDom.
	LinearIntDom(Store store, List<? extends IntVar> variables, List<Integer> weights, String rel, int sum)	Deprecated. LinearIntDom constraint does not use Store parameter any longer.
	Max(List<? extends IntVar> variables, IntVar max)	It constructs max constraint.
	Member(List<? extends IntVar> list, IntVar e)	It constructs the constraint Member.
	Min(List<? extends IntVar> list, IntVar min)	It constructs min constraint.
	NoGood(List<? extends IntVar> listOfVars, List<Integer> listOfValues)	It creates a no-good constraint.
	OrBool(List<? extends IntVar> a, IntVar result)	It constructs and constraint on variables.
	OrBoolVector(List<? extends IntVar> list, IntVar result)	It constructs orBool.
	Rectangle(List<? extends IntVar> list)	It constructs a rectangle.
	RectangleWithCondition(int i, List<? extends IntVar> R, IntVar cond)
	SeqPrecedeChain(List<? extends IntVar> x)	It constructs SeqPrecedeChain.
	Subcircuit(List<? extends IntVar> list)	It constructs a circuit constraint.
	Sum(List<? extends IntVar> list, IntVar sum)	It creates a sum constraints which sums all variables and makes it equal to variable sum.
	SumBool(List<? extends IntVar> variables, String rel, IntVar sum)
	SumBool(Store store, List<? extends IntVar> variables, String rel, IntVar sum)	Deprecated.
	SumInt(List<? extends IntVar> variables, String rel, IntVar sum)	It constructs the constraint SumInt.
	SumInt(Store store, List<? extends IntVar> variables, String rel, IntVar sum)	Deprecated. SumInt constraint does not use Store parameter any longer.
	SumWeight(List<? extends IntVar> variables, List<Integer> weights, IntVar sum)	It constructs the constraint SumWeight.
	SumWeightDom(List<? extends IntVar> list, List<Integer> weights, int sum)	Deprecated. It constructs the constraint SumWeightDom.
	SumWeightDom(List<? extends IntVar> list, List<Integer> weights, IntVar sum)	Deprecated. It constructs the constraint SumWeightDom.
	ValuePrecede(int s, int t, List<? extends IntVar> x)	It constructs ValuePrecede.
	Values(List<? extends IntVar> list, IntVar count)	It constructs Values constraint.

Uses of IntVar in org.jacop.constraints.binpacking

Fields in org.jacop.constraints.binpacking declared as IntVar

Modifier and Type	Field	Description
final IntVar	BinItem.bin
final IntVar[]	Binpacking.load	It specifies a list of variables which define bin load.

Fields in org.jacop.constraints.binpacking with type parameters of type IntVar

Modifier and Type	Field	Description
private final Map<IntVar,Integer>	Binpacking.binMap
private final SimpleHashSet<IntVar>	Binpacking.binQueue
private final Map<IntVar,Integer>	Binpacking.itemMap
private final SimpleHashSet<IntVar>	Binpacking.itemQueue

Constructors in org.jacop.constraints.binpacking with parameters of type IntVar

Modifier	Constructor	Description
(package private)	BinItem(IntVar bin, int weight)
	Binpacking(IntVar[] bin, IntVar[] load, int[] w)	It constructs the binpacking constraint for the supplied variable.
	Binpacking(IntVar[] bin, IntVar[] load, int[] w, int minBin)	It constructs the binpacking constraint for the supplied variable.
	Binpacking(IntVar[] bin, IntVar[] load, int[] w, int minBin, boolean LBpruning)

Constructor parameters in org.jacop.constraints.binpacking with type arguments of type IntVar

Modifier	Constructor	Description
	Binpacking(List<? extends IntVar> bin, List<? extends IntVar> load, int[] w)	It constructs the binpacking constraint for the supplied variable.
	Binpacking(List<? extends IntVar> bin, List<? extends IntVar> load, int[] w, int minBin)	It constructs the binpacking constraint for the supplied variable.

Uses of IntVar in org.jacop.constraints.cumulative

Fields in org.jacop.constraints.cumulative declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar	ThetaLambdaTree.C
(package private) final IntVar	Task.dur
final IntVar	CumulativeBasic.limit	It specifies the limit of the profile of cumulative use of resources.
final IntVar	CumulativePrimary.limit
private final IntVar	ProfileOptional.limit	It specifies the limit of the profile of cumulative use of resources.
(package private) IntVar[]	CumulativeOptional.opt
(package private) IntVar[]	CumulativeUnaryOptional.opt
(package private) final IntVar	Task.res
private final IntVar[]	CumulativePrimary.start
(package private) final IntVar	Task.start

Methods in org.jacop.constraints.cumulative that return IntVar

Modifier and Type	Method	Description
(package private) IntVar	Task.dur()
(package private) IntVar	ThetaLambdaTree.getCapacity()
(package private) IntVar	Task.res()
(package private) IntVar	Task.start()

Methods in org.jacop.constraints.cumulative with parameters of type IntVar

Modifier and Type	Method	Description
(package private) TaskView[]	ProfileOptional.filterOptionalTasks(TaskView[] ts, IntVar[] opt)
(package private) int	ProfileOptional.minStartOpt(TaskView[] ts, IntVar[] opt)
(package private) void	ProfileOptional.pruneOpt(Store store, TaskView[] tn, IntVar[] opt)
(package private) void	ThetaLambdaTree.setCapacity(IntVar capacity)
(package private) void	ProfileOptional.sweepPruning(Store store, TaskView[] tn, IntVar[] opt)

Constructors in org.jacop.constraints.cumulative with parameters of type IntVar

Modifier	Constructor	Description
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	Cumulative(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeBasic(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeBasic(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt)	It creates a cumulative constraint.
	CumulativeOptional(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, IntVar[] opt)	It creates a cumulative constraint.
	CumulativePrimary(List<? extends IntVar> starts, List<? extends Integer> durations, List<? extends Integer> resources, IntVar limit)
	CumulativePrimary(IntVar[] starts, int[] durations, int[] resources, IntVar limit)
	CumulativeUnary(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeUnary(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean doProfile)	It creates a cumulative constraint.
	CumulativeUnary(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeUnary(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, boolean doProfile)	It creates a cumulative constraint.
	CumulativeUnary(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, boolean doProfile, boolean doEdgeFind)	It creates a cumulative constraint.
	CumulativeUnaryOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt)	It creates a cumulative constraint.
	CumulativeUnaryOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt, boolean doProfile)	It creates a cumulative constraint.
	CumulativeUnaryOptional(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, IntVar[] opt)	It creates a cumulative constraint.
	CumulativeUnaryOptional(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, IntVar[] opt, boolean doProfile)	It creates a cumulative constraint.
	CumulativeUnaryOptional(IntVar[] starts, IntVar[] durations, IntVar[] resources, IntVar limit, IntVar[] opt, boolean doProfile, boolean doEdgeFind)	It creates a cumulative constraint.
	ProfileOptional(IntVar limit)	It creates a profile for optional tasks.
(package private)	Task(IntVar start, IntVar duration, IntVar resourceUsage)
(package private)	TaskNormalView(IntVar start, IntVar dur, IntVar res)
(package private)	TaskReversedView(IntVar start, IntVar dur, IntVar res)
(package private)	TaskView(IntVar start, IntVar dur, IntVar res)
	ThetaLambdaTree(IntVar capacity)

Constructor parameters in org.jacop.constraints.cumulative with type arguments of type IntVar

Modifier	Constructor	Description
	Cumulative(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeBasic(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt)	It creates a cumulative constraint.
	CumulativePrimary(List<? extends IntVar> starts, List<? extends Integer> durations, List<? extends Integer> resources, IntVar limit)
	CumulativeUnary(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit)	It creates a cumulative constraint.
	CumulativeUnary(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, boolean doProfile)	It creates a cumulative constraint.
	CumulativeUnaryOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt)	It creates a cumulative constraint.
	CumulativeUnaryOptional(List<? extends IntVar> starts, List<? extends IntVar> durations, List<? extends IntVar> resources, IntVar limit, List<? extends IntVar> opt, boolean doProfile)	It creates a cumulative constraint.

Uses of IntVar in org.jacop.constraints.diffn

Fields in org.jacop.constraints.diffn declared as IntVar

Modifier and Type	Field	Description
final IntVar[]	Rectangle.length
(package private) final IntVar[]	DiffnDecomposed.lx
(package private) final IntVar[]	DiffnDecomposed.ly
final IntVar[]	Rectangle.origin	It specifies the the rectangle.
(package private) final IntVar[]	DiffnDecomposed.x
(package private) final IntVar[]	DiffnDecomposed.y

Methods in org.jacop.constraints.diffn that return IntVar

Modifier and Type	Method	Description
(package private) IntVar	Rectangle.length(int dim)
(package private) IntVar	Rectangle.origin(int dim)

Constructors in org.jacop.constraints.diffn with parameters of type IntVar

Modifier	Constructor	Description
	Diffn(IntVar[][] rectangles)	It specifies a diff constraint.
	Diffn(IntVar[][] rectangles, boolean strict)	It specifies a diff constraint.
	Diffn(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It constructs a diff constraint.
	Diffn(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2, boolean strict)	It constructs a diff constraint.
	DiffnDecomposed(IntVar[][] rectangle)	It specifies a diffn constraint.
	DiffnDecomposed(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It constructs a diffn constraint.
	Nooverlap(IntVar[][] rectangle)	It specifies a diff constraint.
	Nooverlap(IntVar[][] rectangle, boolean strict)	It specifies a diff constraint.
	Nooverlap(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2)	It constructs a diff constraint.
	Nooverlap(IntVar[] origin1, IntVar[] origin2, IntVar[] length1, IntVar[] length2, boolean strict)	It constructs a diff constraint.
	Rectangle(IntVar[] list)	It constructs a rectangle.
	Rectangle(IntVar o1, IntVar o2, IntVar l1, IntVar l2)	It constructs a rectangle.

Constructor parameters in org.jacop.constraints.diffn with type arguments of type IntVar

Modifier	Constructor	Description
	Diffn(List<? extends List<? extends IntVar>> rectangles)	It specifies a diffn constraint.
	Diffn(List<? extends List<? extends IntVar>> rectangles, boolean strict)	It specifies a diffn constraint.
	Diffn(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2)	It constructs a diff constraint.
	Diffn(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, boolean strict)	It constructs a diff constraint.
	DiffnDecomposed(List<? extends List<? extends IntVar>> rectangle)	It specifies a diffn constraint.
	DiffnDecomposed(List<? extends IntVar> x, List<? extends IntVar> y, List<? extends IntVar> lx, List<? extends IntVar> ly)	It constructs a diffn constraint.
	Nooverlap(List<? extends List<? extends IntVar>> rectangle)	It specifies a diffn constraint.
	Nooverlap(List<? extends List<? extends IntVar>> rectangle, boolean strict)	It specifies a diffn constraint.
	Nooverlap(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2)	It constructs a diff constraint.
	Nooverlap(List<? extends IntVar> o1, List<? extends IntVar> o2, List<? extends IntVar> l1, List<? extends IntVar> l2, boolean strict)	It constructs a diff constraint.
	Rectangle(List<? extends IntVar> list)	It constructs a rectangle.

Uses of IntVar in org.jacop.constraints.geost

Fields in org.jacop.constraints.geost declared as IntVar

Modifier and Type	Field	Description
final IntVar[]	GeostObject.coords	It specifies the coordinates in k-dimensional space at which the object is fixed.
final IntVar	GeostObject.duration	It specifies the duration time of this object.
final IntVar	GeostObject.end	It specifies the end time of this object.
final IntVar	GeostObject.shapeID	It specifies the possible shape ids to be taken by this object.
final IntVar	GeostObject.start	It specifies the start time of this object in time dimension.

Constructors in org.jacop.constraints.geost with parameters of type IntVar

Modifier	Constructor	Description
	GeostObject(int no, IntVar[] coords, IntVar shapeID, IntVar start, IntVar duration, IntVar end)	It constructs a Geost object with all the attributes needed by the Geost constraint.

Uses of IntVar in org.jacop.constraints.knapsack

Fields in org.jacop.constraints.knapsack declared as IntVar

Modifier and Type	Field	Description
protected IntVar	Knapsack.knapsackCapacity	This is a finite domain variable to specify the knapsack capacity.
protected IntVar	Knapsack.knapsackProfit	This is a finite domain variable to specify the knapsack profit.
final IntVar	KnapsackItem.quantity	It is a finite domain variable specifying the possible quantity of that item.
final IntVar	TreeLeaf.quantity	It specifies the finite domain variable denoting the allowed quantity of the item,

Fields in org.jacop.constraints.knapsack with type parameters of type IntVar

Modifier and Type	Field	Description
private Map<IntVar,TreeLeaf>	Knapsack.variableLeafMapping	It specifies mapping from variables into the leaf of the knapsack tree.

Methods in org.jacop.constraints.knapsack that return IntVar

Modifier and Type	Method	Description
final IntVar	KnapsackItem.getVariable()	t returns quantity variable associated with that item.
final IntVar	TreeLeaf.getVariable()

Methods in org.jacop.constraints.knapsack with parameters of type IntVar

Modifier and Type	Method	Description
private void	Knapsack.commonInitialization(int[] profits, int[] weights, IntVar[] quantity, IntVar knapsackCapacity, IntVar knapsackProfit)

Constructors in org.jacop.constraints.knapsack with parameters of type IntVar

Modifier	Constructor	Description
	Knapsack(int[] profits, int[] weights, IntVar[] quantity, IntVar knapsackCapacity, IntVar knapsackProfit)	It constructs the knapsack constraint.
	Knapsack(KnapsackItem[] items, IntVar knapsackCapacity, IntVar knapsackProfit)	It constructs an knapsack constraint.
(package private)	KnapsackItem(IntVar quantity, int weight, int profit)	It constructs an item.
	Tree(KnapsackItem[] items, Map<IntVar,TreeLeaf> varPositionMaping, TreeLeaf[] leaves, IntVar zero)	It constructs a tree out of the list of items and creates proper supporting structures.
	TreeLeaf(IntVar quantity, int weight, int profit, int positionInTheTree)	It creates a leaf in the tree of items.

Constructor parameters in org.jacop.constraints.knapsack with type arguments of type IntVar

Modifier	Constructor	Description
	Tree(KnapsackItem[] items, Map<IntVar,TreeLeaf> varPositionMaping, TreeLeaf[] leaves, IntVar zero)	It constructs a tree out of the list of items and creates proper supporting structures.

Uses of IntVar in org.jacop.constraints.netflow

Fields in org.jacop.constraints.netflow declared as IntVar

Modifier and Type	Field	Description
IntVar	NetworkBuilder.costVariable
IntVar	NetworkFlow.costVariable	The cost variable
static final IntVar	Arithmetic.NULL_VAR
final IntVar	DomainStructure.variable
private final IntVar	MultiVarHandler.variable
IntVar	ArcCompanion.wVar	The FDV for lower and upper cost
IntVar	ArcCompanion.xVar	The FDV for lower and upper capacity

Fields in org.jacop.constraints.netflow with type parameters of type IntVar

Modifier and Type	Field	Description
protected Map<IntVar,Integer>	Arithmetic.map
final Map<IntVar,VarHandler>	NetworkFlow.map	The variables and their handlers
final Set<IntVar>	NetworkFlow.queue	The set of queued variables
protected List<IntVar>	Arithmetic.vars

Methods in org.jacop.constraints.netflow that return types with arguments of type IntVar

Modifier and Type	Method	Description
List<IntVar>	ArcCompanion.listVariables()
List<IntVar>	DomainStructure.listVariables()
List<IntVar>	MultiVarHandler.listVariables()
ArrayList<IntVar>	NetworkBuilder.listVariables()
List<IntVar>	VarHandler.listVariables()

Methods in org.jacop.constraints.netflow with parameters of type IntVar

Modifier and Type	Method	Description
Arc	NetworkBuilder.addArc(Node from, Node to, int weight, IntVar xVar)
Arc	NetworkBuilder.addArc(Node from, Node to, IntVar wVar, int lowerCapacity, int upperCapacity)
Arc	NetworkBuilder.addArc(Node from, Node to, IntVar wVar, IntVar xVar)
void	Arithmetic.addEquation(IntVar[] vars, int[] coeffs)
void	Arithmetic.addEquation(IntVar[] vars, int[] coeffs, int constant)
void	Arithmetic.addSum(IntVar[] vars, IntVar sum)
void	Arithmetic.addXplusYeqZ(IntVar x, IntVar y, IntVar z)
void	Arithmetic.addXsubYeqZ(IntVar x, IntVar y, IntVar z)
private int	Arithmetic.lookup(IntVar var)
void	ArcCompanion.processEvent(IntVar variable, MutableNetwork network)
void	DomainStructure.processEvent(IntVar variable, MutableNetwork network)
void	MultiVarHandler.processEvent(IntVar variable, MutableNetwork network)
void	VarHandler.processEvent(IntVar variable, MutableNetwork network)	Informs the handler that one of its variable has changed and asks the handler to update the state of the network accordingly.
void	NetworkBuilder.setCostVariable(IntVar costVariable)
private void	NetworkBuilder.sumC(List<Constraint> list, Store store, List<IntVar> vars, IntVar result)
Node[][]	NetworkBuilder.valueGraph(IntVar[] vars, IntDomain[] domains)	Returns two arrays containing the nodes for each variable and the nodes for each domain, respectively.

Constructors in org.jacop.constraints.netflow with parameters of type IntVar

Modifier	Constructor	Description
	DomainStructure(IntVar variable, List<Domain> domList, List<Arc> arcList)	Creates an S-variable
	DomainStructure(IntVar variable, IntDomain[] domains, Arc[] arcs)
	DomainStructure(IntVar variable, IntDomain[] domains, Arc[] arcs, DomainStructure.Behavior behavior)
	MultiVarHandler(IntVar variable, VarHandler... handlers)
	NetworkBuilder(IntVar costVariable)
private	NetworkFlow(List<Node> nodes, List<Arc> arcs, List<VarHandler> flowVariables, IntVar costVariable)	Initialization

Uses of IntVar in org.jacop.constraints.regular

Fields in org.jacop.constraints.regular declared as IntVar

Modifier and Type	Field	Description
IntVar[]	Regular.list	Array of the variables of the graph levels.

Fields in org.jacop.constraints.regular with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Map<IntVar,Integer>	Regular.mapping
(package private) LinkedHashSet<IntVar>	Regular.variableQueue	Queue of changed variables.

Constructors in org.jacop.constraints.regular with parameters of type IntVar

Modifier	Constructor	Description
	Regular(FSM fsm, IntVar[] list)	Constructor need Store to initialize the time-stamps.

Uses of IntVar in org.jacop.constraints.table

Fields in org.jacop.constraints.table declared as IntVar

Modifier and Type	Field	Description
IntVar[]	SimpleTable.x	Variables within the scope of table constraint
IntVar[]	Table.x	Variables within the scope of table constraint

Fields in org.jacop.constraints.table with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Set<IntVar>	SimpleTable.variableQueue
(package private) Set<IntVar>	Table.variableQueue
(package private) Map<IntVar,Integer>	SimpleTable.varMap
(package private) Map<IntVar,Integer>	Table.varMap

Methods in org.jacop.constraints.table with parameters of type IntVar

Modifier and Type	Method	Description
static int[][]	TableMill.elementSupport(IntVar index, int[] list, IntVar value, int offset)
static int[][]	TableMill.linear(IntVar[] x, int[] w, int b)
(package private) static ArrayList<int[]>	TableMill.linearSupport(IntVar[] x, int[] w, int b, int sum, int index, ArrayList<int[]> support, int[] assignment)
private boolean	ReversibleSparseBitSet.validTuple(IntVar[] x, int[] t)

Method parameters in org.jacop.constraints.table with type arguments of type IntVar

Modifier and Type	Method	Description
(package private) void	SimpleTable.updateTable(Set<IntVar> fdvs)
(package private) void	Table.updateTable(Set<IntVar> fdvs)

Constructors in org.jacop.constraints.table with parameters of type IntVar

Modifier	Constructor	Description
	ReversibleSparseBitSet(Store store, IntVar[] x, int[][] tuple)
	SimpleTable(IntVar[] list, int[][] tuples)	It constructs a table constraint.
	SimpleTable(IntVar[] list, int[][] tuples, boolean reuseTupleArguments)	It constructs a table constraint.
	Table(IntVar[] list, int[][] tuples)	It constructs a table constraint.
	Table(IntVar[] list, int[][] tuples, boolean reuseTuplesArgument)	It constructs a table constraint.

Uses of IntVar in org.jacop.core

Subclasses of IntVar in org.jacop.core

Modifier and Type	Class	Description
class	BooleanVar	Defines a variable and related operations on it.

Methods in org.jacop.core with parameters of type IntVar

Modifier and Type	Method	Description
boolean	IntVar.eq(IntVar var)	It checks if the domains of variables are equal.
void	BoundDomain.inValue(int storeLevel, IntVar var, int value)
void	IntDomain.inValue(int level, IntVar var, int value)	It reduces domain to a single value.
void	IntervalDomain.inValue(int storeLevel, IntVar var, int value)	It updates the domain to have a single value within its domain.
void	SmallDenseDomain.inValue(int storeLevel, IntVar var, int value)	It updates the domain to have a single value within its domain.

Uses of IntVar in org.jacop.examples.cpviz

Fields in org.jacop.examples.cpviz declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar	CPvizNewspaper.cost
(package private) IntVar	CPvizNetworkFlow.COST
(package private) IntVar[][]	CPvizSudoku.elements
(package private) IntVar[]	CPvizNetworkFlow.vars

Fields in org.jacop.examples.cpviz with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Search<IntVar>	CPvizSendMoreMoney.search
(package private) List<IntVar>	CPvizSendMoreMoney.vars

Uses of IntVar in org.jacop.examples.fd

Fields in org.jacop.examples.fd declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar[]	DeBruijn.bin_code
IntVar[][]	DeBruijn.binary
(package private) IntVar	ConferenceTalkPlacement.cost
IntVar	ExampleFD.cost	It specifies the cost function, null if no cost function is used.
IntVar[][]	Kakro.elements
(package private) IntVar[][]	Sudoku.elements
(package private) IntVar[]	FurnitureMoving.endTimes
(package private) IntVar[][]	MineSweeper.game
(package private) IntVar[][]	MineSweeper.mines
(package private) IntVar[]	PerfectSquare.size
(package private) IntVar[]	FurnitureMoving.starts
(package private) IntVar[][]	ConferenceTalkPlacement.varsMatrix
(package private) IntVar[][]	TSP.varsMatrix
(package private) IntVar[]	PerfectSquare.varsX	It specifies which of the pre-defined problems should be solved.
(package private) IntVar[]	PerfectSquare.varsY
(package private) IntVar[][]	BIBD.x
IntVar[]	DeBruijn.x
IntVar[]	Diet.x
(package private) IntVar[][]	SurvoPuzzle.x
(package private) IntVar[]	SurvoPuzzle.x_arr

Fields in org.jacop.examples.fd with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) DepthFirstSearch<IntVar>	ConferenceTalkPlacement.search
Search<IntVar>	ExampleFD.search	It specifies the search procedure used by a given example.
List<IntVar>	Golomb.subs	It contains all differences between all possible pairs of marks.
(package private) List<IntVar>	ConferenceTalkPlacement.vars
List<IntVar>	ExampleFD.vars	It contains all variables used within a specific example.

Methods in org.jacop.examples.fd that return types with arguments of type IntVar

Modifier and Type	Method	Description
Search<IntVar>	ExampleFD.getSearch()	It returns the search used within an example.
List<IntVar>	ExampleFD.getSearchVariables()	It returns an array list of variables used to model the example.

Methods in org.jacop.examples.fd with parameters of type IntVar

Modifier and Type	Method	Description
static void	ExampleFD.printMatrix(IntVar[][] matrix, int rows, int cols)	It prints a matrix of variables.
static void	SurvoPuzzle.printMatrix(IntVar[][] matrix, int rows, int cols)	It prints a matrix of variables.
static MDD	WordGame.readDictionaryFor5LetterWords(String file, IntVar[] list)	It reads a dictionary for 5-letter words and creates an MDD representation of it for use by an extensional constraint.
static Constraint	Gates.tableConstraintProviderUsingExtensionalSTR(IntVar[] vars, int[][] tuples)
static Constraint	Gates.tableConstraintProviderUsingSimpleTable(IntVar[] vars, int[][] tuples)

Uses of IntVar in org.jacop.examples.fd.crosswords

Fields in org.jacop.examples.fd.crosswords declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar	CrossWord.blank
(package private) IntVar[][]	CrossWord.x

Uses of IntVar in org.jacop.examples.fd.filters

Fields in org.jacop.examples.fd.filters declared as IntVar

Modifier and Type	Field	Description
(package private) static IntVar	FilterBenchmark.cost

Fields in org.jacop.examples.fd.filters with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) static List<IntVar>	FilterBenchmark.Rs
(package private) static List<IntVar>	FilterBenchmark.Ts

Methods in org.jacop.examples.fd.filters that return types with arguments of type IntVar

Modifier and Type	Method	Description
static List<List<IntVar>>	FilterBenchmark.makeConstraints(Store store, Filter filter, int addNum, int mulNum)	It creates constraint model for scheduling of filter operations.
static List<List<IntVar>>	FilterBenchmark.makeConstraintsChain(Store store, Filter filter, int addNum, int mulNum, int clk)	It creates constraint model for scheduling of filter operation in fashion allowing chaining of operations within one clock cycle.
static List<List<IntVar>>	FilterBenchmark.makeConstraintsPipeline(Store store, Filter filter, int addNum, int mulNum)	It creates a model for optimization of scheduling of operations of a given filter.
static List<List<IntVar>>	FilterBenchmark.makeConstraintsPipeMultiplier(Store store, Filter filter, int addNum, int mulNum)	It creates constraint model for scheduling of filter operation in fashion allowing pipelining of multiplication operations.
static List<List<IntVar>>	FilterBenchmark.makeLabelingList(IntVar[] T, IntVar[] R)	It creates an array of arrays using two arrays.

Methods in org.jacop.examples.fd.filters with parameters of type IntVar

Modifier and Type	Method	Description
static List<List<IntVar>>	FilterBenchmark.makeLabelingList(IntVar[] T, IntVar[] R)	It creates an array of arrays using two arrays.

Uses of IntVar in org.jacop.examples.fd.muca

Fields in org.jacop.examples.fd.muca declared as IntVar

Modifier and Type	Field	Description
IntVar[][]	MUCA.deltasI	For each transition and each good it specifies the delta change of that good before the transition takes place.
IntVar[][]	MUCA.deltasO	For each transition and each good it specifies the delta change of that good after the transition takes place.
IntVar[]	MUCA.sum	It specifies the number of goods after the last transition.
IntVar[]	MUCA.transitions	It specifies the sequence of transitions used by an auctioneer.

Fields in org.jacop.examples.fd.muca with type parameters of type IntVar

Modifier and Type	Field	Description
List<IntVar>	MUCA.bidCosts	For each bidder it specifies variable representing the cost of the chosen xor bid.

Uses of IntVar in org.jacop.examples.fd.nonogram

Fields in org.jacop.examples.fd.nonogram declared as IntVar

Modifier and Type	Field	Description
IntVar[][]	Nonogram.board	A board to be painted in white/black dots.

Methods in org.jacop.examples.fd.nonogram with parameters of type IntVar

Modifier and Type	Method	Description
void	Nonogram.printMatrix(IntVar[][] matrix)	It prints a matrix of variables.

Uses of IntVar in org.jacop.examples.set

Fields in org.jacop.examples.set declared as IntVar

Modifier and Type	Field	Description
IntVar	ExampleSet.cost	It specifies the cost function, null if no cost function is used.

Methods in org.jacop.examples.set with parameters of type IntVar

Modifier and Type	Method	Description
static void	ExampleSet.printMatrix(IntVar[][] matrix, int rows, int cols)	It prints a matrix of variables.

Uses of IntVar in org.jacop.floats.constraints

Fields in org.jacop.floats.constraints declared as IntVar

Modifier and Type	Field	Description
IntVar	ElementFloat.index	It specifies variable index within an element constraint list[index-indexOffset] = value.
final IntVar	ElementFloatVariable.index	It specifies variable index within an element constraint list[index - indexOffset] = value.
IntVar	CeilPeqX.x	It specifies a left hand variable in equality constraint.
IntVar	FloorPeqX.x	It specifies a left hand variable in equality constraint.
IntVar	RoundPeqX.x	It specifies a left hand variable in equality constraint.
IntVar	XeqP.x	It specifies a left hand variable in equality constraint.

Constructors in org.jacop.floats.constraints with parameters of type IntVar

Modifier	Constructor	Description
	CeilPeqX(FloatVar p, IntVar x)	It constructs constraint X = P.
	ElementFloat(IntVar index, double[] list, FloatVar value)	It constructs an element constraint with indexOffset by default set to 0.
	ElementFloat(IntVar index, double[] list, FloatVar value, int indexOffset)	It constructs an element constraint.
	ElementFloat(IntVar index, List<Double> list, FloatVar value)	It constructs an element constraint with default indexOffset equal 0.
	ElementFloat(IntVar index, List<Double> list, FloatVar value, int indexOffset)	It constructs an element constraint.
	ElementFloatVariable(IntVar index, List<? extends FloatVar> list, FloatVar value)	It constructs an element constraint.
	ElementFloatVariable(IntVar index, List<? extends FloatVar> list, FloatVar value, int indexOffset)	It constructs an element constraint.
	ElementFloatVariable(IntVar index, FloatVar[] list, FloatVar value)	It constructs an element constraint.
	ElementFloatVariable(IntVar index, FloatVar[] list, FloatVar value, int indexOffset)	It constructs an element constraint.
	FloorPeqX(FloatVar p, IntVar x)	It constructs constraint X = P.
	RoundPeqX(FloatVar p, IntVar x)	It constructs constraint X = P.
	XeqP(IntVar x, FloatVar p)	It constructs constraint X = P.

Uses of IntVar in org.jacop.fz

Fields in org.jacop.fz declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar[]	DefaultSearchVars.int_search_variables
(package private) IntVar[]	SearchItem.relax_and_reconstruct_variables
(package private) IntVar[]	Solve.relaxVars

Fields in org.jacop.fz with type parameters of type IntVar

Modifier and Type	Field	Description
Map<IntVar,IntVar>	Tables.aliasTable
Map<IntVar,IntVar>	Tables.aliasTable
(package private) HashMap<Integer,IntVar>	Tables.constantTable
(package private) Map<IntVar,Integer>	SearchItem.preferedValues
(package private) ComparatorVariable<IntVar>	SearchItem.tieBreakingInt
(package private) HashMap<String,IntVar>	Tables.variableTable

Methods in org.jacop.fz that return IntVar

Modifier and Type	Method	Description
(package private) IntVar	Tables.getAlias(IntVar b)
IntVar	Tables.getConstant(int c)
(package private) IntVar	Solve.getCost(ASTSolveExpr node)
(package private) IntVar[]	DefaultSearchVars.getIntVars()
(package private) IntVar[]	VariablesParameters.getScalarFlatExpr_ArrayVar(Store store, SimpleNode node, int index)
(package private) IntVar	VariablesParameters.getScalarFlatExpr_var(Store store, SimpleNode node, int i)
(package private) IntVar[]	SearchItem.getVarArray(SimpleNode node)
(package private) IntVar	SearchItem.getVariable(ASTScalarFlatExpr node)
IntVar	Tables.getVariable(String ident)	It returns the variable of the given identity.
IntVar[]	Tables.getVariableArray(String ident)	It returns the variable array of the given identity.

Methods in org.jacop.fz that return types with arguments of type IntVar

Modifier and Type	Method	Description
(package private) Indomain<IntVar>	SearchItem.getIndomain(String indomain)
(package private) SelectChoicePoint<IntVar>	SearchItem.getIntSelect()
SearchItem<T>.ComparatorsVar<IntVar>	SearchItem.getVarSelect()
(package private) SelectChoicePoint<IntVar>	SearchItem.getWarmStartSelect()

Methods in org.jacop.fz with parameters of type IntVar

Modifier and Type	Method	Description
void	Tables.addAlias(IntVar b, IntVar v)
void	Tables.addVariable(String ident, IntVar var)	It adds a variable with a given identity to the storage.
void	Tables.addVariableArray(String ident, IntVar[] array)	It adds a variable array to the storage.
(package private) IntVar	Tables.getAlias(IntVar b)

Uses of IntVar in org.jacop.fz.constraints

Fields in org.jacop.fz.constraints declared as IntVar

Modifier and Type	Field	Description
IntVar	Support.definedVar

Fields in org.jacop.fz.constraints with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Map<IntVar,Map<Integer,IntVar>>	ChannelMap.cs
(package private) Map<IntVar,Map<Integer,IntVar>>	ChannelMap.cs

Methods in org.jacop.fz.constraints that return IntVar

Modifier and Type	Method	Description
(package private) IntVar[]	Support.getVarArray(SimpleNode node)
IntVar	Support.getVariable(ASTScalarFlatExpr node)
(package private) IntVar[]	GlobalConstraints.removeDuplicates(IntVar[] x)
(package private) IntVar[]	Support.unique(IntVar[] vs)

Methods in org.jacop.fz.constraints with parameters of type IntVar

Modifier and Type	Method	Description
void	ChannelMap.add(IntVar x, int v, IntVar b)
void	Support.addImplied(IntVar x, int v, IntVar b)
void	Support.addReified(IntVar x, int v, IntVar b)
(package private) boolean	LinearConstraints.allConstants(IntVar[] p)
(package private) boolean	ElementConstraints.allSingleton(IntVar[] vs)
(package private) boolean	GlobalConstraints.allVarGround(IntVar[] w)
(package private) boolean	BoolConstraints.allVarOne(IntVar[] w)
(package private) boolean	GlobalConstraints.allVarOne(IntVar[] w)
(package private) boolean	BoolConstraints.allVarZero(IntVar[] w)
(package private) boolean	BoolConstraints.atLeastOneVarOne(IntVar[] w)
(package private) boolean	BoolConstraints.atLeastOneVarZero(IntVar[] w)
(package private) boolean	ComparisonConstraints.binaryVar(IntVar v)
(package private) boolean	LinearConstraints.binaryVar(IntVar v)
(package private) boolean	LinearConstraints.boolSum(IntVar[] vs)
(package private) int[][]	GlobalConstraints.conflictTuples(IntVar[] v, int[][] t)
(package private) Constraint	Support.fzXeqCImplied(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXeqCReified(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXneqCImplied(IntVar x, int c, IntVar b)
(package private) Constraint	Support.fzXneqCReified(IntVar x, int c, IntVar b)
(package private) boolean	ComparisonConstraints.generateForEq(IntVar v1, IntVar v2, IntVar b)
(package private) boolean	ComparisonConstraints.generateForEqC(IntVar v1, int i2, IntVar b)
(package private) boolean	ComparisonConstraints.generateForNeq(IntVar v1, IntVar v2, IntVar b)
(package private) boolean	ComparisonConstraints.generateForNeqC(IntVar v1, int i2, IntVar b)
(package private) void	GlobalConstraints.generateTableConstraints(IntVar[] v, int[][] t)
(package private) void	GlobalConstraints.impliedCumulativeUnaryConstraints(IntVar[] s, IntVar[] d, IntVar[] r, IntVar b)
(package private) void	GlobalConstraints.impliedDisjunctionConstraints(IntVar[] s, IntVar[] d, IntVar[] r, IntVar b)
(package private) boolean	LinearConstraints.paramZero(IntVar v)
(package private) void	ElementConstraints.poseElementFloat(IntVar p1, double[] p2, FloatVar p3)
(package private) void	ElementConstraints.poseElementInteger(IntVar p1, int[] p2, IntVar p3)
(package private) int[][]	GlobalConstraints.product(IntVar[] v, int[][] t)
(package private) IntVar[]	GlobalConstraints.removeDuplicates(IntVar[] x)
int	ChannelMap.size(IntVar v)
(package private) IntVar[]	Support.unique(IntVar[] vs)
(package private) int[]	GlobalConstraints.uniqueIndex(IntVar[] vs)
(package private) boolean	GlobalConstraints.varsContain(IntVar[] x, int e)

Uses of IntVar in org.jacop.satwrapper

Fields in org.jacop.satwrapper with type parameters of type IntVar

Modifier and Type	Field	Description
final Set<IntVar>	SatWrapper.registeredVars

Methods in org.jacop.satwrapper that return IntVar

Modifier and Type	Method	Description
final IntVar	SatWrapper.boolVarToCpVar(int literal)	get the IntVar back from a literal

Methods in org.jacop.satwrapper with parameters of type IntVar

Modifier and Type	Method	Description
final int	SatWrapper.cpVarToBoolVar(IntVar variable, int value, boolean isEquality)	given a CP variable and a value, retrieve the associated boolean literal for either 'variable = value' or either 'variable <= value'
void	SatChangesListener.ensureAccess(IntVar cpVar)	gets sure we won't have a NullPointerException
void	SatTranslation.generate_allZero_reif(IntVar[] as, IntVar c)
void	SatTranslation.generate_and(IntVar[] a, IntVar c)
void	SatTranslation.generate_clause(IntVar[] a1, IntVar[] a2)
void	SatTranslation.generate_clause_reif(IntVar[] a, IntVar[] b, IntVar r)
void	SatTranslation.generate_eq(IntVar a, IntVar b)
void	SatTranslation.generate_eq_reif(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_implication(IntVar a, IntVar b)
void	SatTranslation.generate_implication_reif(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_le(IntVar a, IntVar b)
void	SatTranslation.generate_le_reif(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_lt(IntVar a, IntVar b)
void	SatTranslation.generate_lt_reif(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_neq_reif(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_not(IntVar a, IntVar b)
void	SatTranslation.generate_or(IntVar[] a, IntVar c)
void	SatTranslation.generate_xor(IntVar[] a, IntVar c)	To represent XOR function in CNF one needs to have 2^{n-1} clauses, where n is the size of your XOR function :( Our method cuts list to 3 or 2 element parts, generates XOR for them and composesd them back to the original XOR.
void	SatTranslation.generate_xor(IntVar a, IntVar b, IntVar c)
void	SatTranslation.generate_xor(IntVar a, IntVar b, IntVar c, IntVar d)
void	SatWrapper.register(IntVar result)
void	SatWrapper.register(IntVar variable, boolean translate)	registers the variable so that we can use it in SAT solver

Uses of IntVar in org.jacop.satwrapper.translation

Classes in org.jacop.satwrapper.translation with type parameters of type IntVar

Modifier and Type	Class	Description
final class	LazyCpVarDomain<E extends IntVar>	Deprecated.

Fields in org.jacop.satwrapper.translation declared as IntVar

Modifier and Type	Field	Description
final IntVar	SatCPBridge.variable

Fields in org.jacop.satwrapper.translation with type parameters of type IntVar

Modifier and Type	Field	Description
Set<IntVar>	DomainTranslator.translatedVars

Methods in org.jacop.satwrapper.translation with parameters of type IntVar

Modifier and Type	Method	Description
void	DomainTranslator.translate(IntVar variable)	translates the variable to clauses, if not already done, and add those clauses to the wrapper queue.

Constructors in org.jacop.satwrapper.translation with parameters of type IntVar

Modifier	Constructor	Description
	LazyCpVarDomain(IntVar variable)	Deprecated. creates the var list
	SatCPBridge(IntVar variable)	simple constructor with a variable
	SimpleCpVarDomain(SatWrapper wrapper, IntVar variable)
	SimpleCpVarDomain(SatWrapper wrapper, IntVar variable, boolean translate)

Uses of IntVar in org.jacop.search

Classes in org.jacop.search with type parameters of type IntVar

Modifier and Type	Class	Description
class	IndomainList<T extends IntVar>	IndomainList - implements enumeration method based on the selection of the preferred values for each variable.
class	IndomainMax<T extends IntVar>	IndomainMax - implements enumeration method based on the selection of the maximal value in the domain of the variable.
class	IndomainMedian<T extends IntVar>	IndomainMedian - implements enumeration method based on the selection of the median value in the domain of FD variable and then right and left values.
class	IndomainMiddle<T extends IntVar>	IndomainMiddle - implements enumeration method based on the selection of the middle value in the domain of FD variable and then right and left values.
class	IndomainMin<T extends IntVar>	IndomainMin - implements enumeration method based on the selection of the minimal value in the domain of variable
class	IndomainRandom<T extends IntVar>	IndomainRandom - implements enumeration method based on the selection of the random value in the domain of FD variable.
class	IndomainSimpleRandom<T extends IntVar>	IndomainRandom - implements enumeration method based on the selection of the random value in the domain of FD variable.
class	LargestMax<T extends IntVar>	Defines a LargestMax comparator for Variables.
class	LargestMin<T extends IntVar>	Defines a LargestMin comparator for Variables.
class	MaxRegret<T extends IntVar>	Defines a MaxRegret comparator for Variables.
class	NoGoodsCollector<T extends IntVar>	NoGoodCollector collects no-goods from search when timeout has occurred.
class	Shaving<T extends IntVar>	Defines functionality of shaving.
class	SmallestMax<T extends IntVar>	Defines a SmallestMax comparator for Variables.
class	SmallestMin<T extends IntVar>	Defines a SmallestMin comparator for variables.
class	SplitRandomSelect<T extends IntVar>	It is simple and customizable selector of decisions (constraints) which will be enforced by search.
class	SplitSelect<T extends IntVar>	It is simple and customizable selector of decisions (constraints) which will be enforced by search.

Fields in org.jacop.search with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) Map<IntVar,LinkedHashSet<Integer>>	Shaving.notShavable
(package private) List<Map<IntVar,LinkedHashSet<Integer>>>	Shaving.shavable
List<IntVar>	TransformExtensional.variablesTransformationScope	It contains all the information which will become variables in the scope of the extensional constraint produced by this search listener.
HashSet<IntVar>	Shaving.varsOfFailedConstraint	It stores the variables of the last failed constraints.

Methods in org.jacop.search with parameters of type IntVar

Modifier and Type	Method	Description
(package private) boolean	Shaving.checkIfShavable(IntVar var, Integer val)
int	IndomainMedian.indomain(IntVar var)	It requires IntVar variable.
int	IndomainMiddle.indomain(IntVar var)	It requires IntVar variable.
int	IndomainMin.indomain(IntVar var)
int	IndomainRandom.indomain(IntVar var)
int	IndomainSimpleRandom.indomain(IntVar var)
boolean	Shaving.leftChild(IntVar var, int value, boolean status)
void	Shaving.rightChild(IntVar var, int value, boolean status)

Constructors in org.jacop.search with parameters of type IntVar

Modifier	Constructor	Description
	SplitRandomSelect(T[] variables, ComparatorVariable<T> varSelect, ComparatorVariable<T> tieBreakerVarSelect, Indomain<T> indomain)	It constructs a simple selection mechanism for choice points.
	SplitRandomSelect(T[] variables, ComparatorVariable<T> varSelect, Indomain<T> indomain)	The constructor to create a simple choice select mechanism.
	SplitSelect(T[] variables, ComparatorVariable<T> varSelect, ComparatorVariable<T> tieBreakerVarSelect, Indomain<T> indomain)	It constructs a simple selection mechanism for choice points.
	SplitSelect(T[] variables, ComparatorVariable<T> varSelect, Indomain<T> indomain)	The constructor to create a simple choice select mechanism.

Uses of IntVar in org.jacop.search.restart

Fields in org.jacop.search.restart declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar[]	RestartSearch.rarVars

Methods in org.jacop.search.restart that return IntVar

Modifier and Type	Method	Description
IntVar[]	RestartSearch.getRelaxedVariables()

Methods in org.jacop.search.restart with parameters of type IntVar

Modifier and Type	Method	Description
void	RestartSearch.setRelaxAndReconstruct(IntVar[] vs, int p)

Uses of IntVar in org.jacop.search.sgmpcs

Classes in org.jacop.search.sgmpcs with type parameters of type IntVar

Modifier and Type	Class	Description
class	SimpleImprovementSearch<T extends IntVar>	Defines an interface for defining different methods for selecting next search decision to be taken.
class	SimpleImprovementSearch.CostListener<T extends IntVar>	Saves the cost produced by a given search

Fields in org.jacop.search.sgmpcs declared as IntVar

Modifier and Type	Field	Description
IntVar	SGMPCSearch.cost	Cost variable.
(package private) IntVar	SimpleImprovementSearch.cost
IntVar[]	SGMPCSearch.vars	Variables for search.
IntVar[]	SimpleImprovementSearch.vars

Fields in org.jacop.search.sgmpcs with type parameters of type IntVar

Modifier and Type	Field	Description
(package private) ImproveSolution<IntVar>	SGMPCSearch.search

Constructors in org.jacop.search.sgmpcs with parameters of type IntVar

Modifier	Constructor	Description
	SGMPCSearch(Store store, IntVar[] vars, IntVar cost)
	SGMPCSearch(Store store, IntVar[] vars, IntVar cost, ImproveSolution<IntVar> search)
	SimpleImprovementSearch(Store store, IntVar[] vars, IntVar cost)

Constructor parameters in org.jacop.search.sgmpcs with type arguments of type IntVar

Modifier	Constructor	Description
	SGMPCSearch(Store store, IntVar[] vars, IntVar cost, ImproveSolution<IntVar> search)

Uses of IntVar in org.jacop.set.constraints

Fields in org.jacop.set.constraints declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar[]	ChannelBoolSet.b
IntVar	CardAeqX.cardinality	It specifies integer variable c specifying the possible cardinality of set variable a.
IntVar	ElementSet.index	It specifies what element from the list of sets is equal to set variable value.
final IntVar	ElementSetVariable.index	It specifies variable index within an element constraint list[index - indexOffset] = value.
IntVar[]	Match.list	It specifies the list of integer variables which value is being matched against elements from a set variable a.
IntVar	SumWeightedSet.totalWeight	Integer variable containing the total weight of all elements within a set variable a.
(package private) IntVar[]	ChannelIntSet.x
IntVar	XeqA.x	It specifies variable a.
IntVar	XinA.x	It specifies variable a.

Constructors in org.jacop.set.constraints with parameters of type IntVar

Modifier	Constructor	Description
	CardAeqX(SetVar a, IntVar cardinality)	It constructs a cardinality constraint to restrict the number of elements in the set assigned to set variable a.
	ChannelBoolSet(IntVar[] b, SetVar s)	It constructs a Channel constraint.
	ChannelBoolSet(IntVar[] b, SetVar s, int offset)	It constructs a Channel constraint.
	ChannelIntSet(IntVar[] x, SetVar[] s)	It constructs a Channel constraint.
	ChannelIntSet(IntVar[] x, SetVar[] s, int offsetInt, int offsetSet)	It constructs a Channel constraint.
	ElementSet(IntVar index, IntDomain[] list, SetVar value)	It constructs an elementSet constraint to restrict the domains of the variables index and value.
	ElementSet(IntVar index, IntDomain[] list, SetVar value, int indexOffset)	It constructs a constraint to restrict the domains of the variables index and value.
	ElementSetVariable(IntVar index, List<? extends SetVar> list, SetVar value)	It constructs an element constraint.
	ElementSetVariable(IntVar index, List<? extends SetVar> list, SetVar value, int indexOffset)	It constructs an element constraint.
	ElementSetVariable(IntVar index, SetVar[] list, SetVar value)	It constructs an element constraint.
	ElementSetVariable(IntVar index, SetVar[] list, SetVar value, int indexOffset)	It constructs an element constraint.
	Match(SetVar a, IntVar[] list)	It constructs a match constraint to connect the value of set variable a to the values of integer variables provided in the list.
	SumWeightedSet(SetVar a, int[] elements, int[] weights, IntVar totalWeight)	It constructs a weighted set sum constraint.
	SumWeightedSet(SetVar a, int[] weights, IntVar totalWeight)	It constructs a weighted set sum constraint.
	SumWeightedSet(SetVar a, IntVar totalWeight)	It constructs a weighted set sum constraint.
	XeqA(IntVar x, SetVar a)	It constructs an XeqA constraint to restrict the domain of the integer variables x and set variable a.
	XinA(IntVar x, SetVar a)	It constructs an XinA constraint to restrict the domain of the variables X and A.
	XinA(IntVar x, SetVar a, boolean strict)	It constructs an XinY constraint to restrict the domain of the variables X and Y.

Uses of IntVar in org.jacop.ui

Fields in org.jacop.ui declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar[]	PrintSchedule.r
(package private) IntVar[]	PrintSchedule.t

Constructors in org.jacop.ui with parameters of type IntVar

Modifier	Constructor	Description
	PrintSchedule(String[] name, IntVar[] t, int[] d, IntVar[] r)	It constructs PrintSchedule object.
	PrintSchedule(String[] name, IntVar[] t, IntVar[] d, IntVar[] r)	It constructs PrintSchedule object.
	PrintSchedule(List<String> name, IntVar[] t, int[] d, IntVar[] r)	It constructs PrintSchedule object.
	PrintSchedule(List<String> name, IntVar[] t, IntVar[] d, IntVar[] r)	It constructs PrintSchedule object.

Uses of IntVar in org.jacop.util

Fields in org.jacop.util declared as IntVar

Modifier and Type	Field	Description
(package private) IntVar	IndexDomainView.var
IntVar[]	MDD.vars	The ordered list of variables participating in MDD.

Methods in org.jacop.util with parameters of type IntVar

Modifier and Type	Method	Description
MDD	MDD.reuse(IntVar[] vars)	If possible it will return an MDD which reuse an array representation of the current MDD.

Constructors in org.jacop.util with parameters of type IntVar

Modifier	Constructor	Description
	IndexDomainView(IntVar var, boolean forceSparse)	It creates an index domain view for a given variable.
	IndexDomainView(IntVar var, int[] valuesInFocus)	It creates an index domain view with only given values being in focus of the index domain view.
	MDD(IntVar[] vars)	It creates and MDD representation given the list of variables.
	MDD(IntVar[] vars, int[][] table)	It creates and MDD representation given the list of variables and (dis)allowed tuples.
	MDD(IntVar[] vars, int[] diagram, int[] domainLimits)	It creates an MDD.
	MDD(IntVar[] vars, int[] minimumDomainLimits, int[][] table)	It creates and MDD representation given the list of variables and (dis)allowed tuples.

Uses of IntVar in org.jacop.util.fsm

Methods in org.jacop.util.fsm with parameters of type IntVar

Modifier and Type	Method	Description
MDD	FSM.transformDirectlyIntoMDD(IntVar[] vars)	It generates one by one tuples allowed by a Regular constraint, which are added to the MDD being built.
MDD	FSM.transformIntoMDD(IntVar[] vars)	It generates one by one tuples allowed by a Regular constraint, which are added to the MDD being built.
int[][]	FSM.transformIntoTuples(IntVar[] vars)	It creates an array of tuples representing this Regular context.