All Classes

Class	Description
AbstractEnvironment	Super class of all environments !
AbstractEventObserver	An abstract class for event recording utility.
AbstractLengauerTarjanDominatorsFinder	Class that finds dominators of a given flow graph g(s)
AbstractPropDistanceXYZ	A constraint to state |X - Y| operator Z where operator can be =, <=, <, >=, > and X, Y, and Z are variables Warning: only achieves BoundConsistency for the moment !
AbstractStrategy<V extends Variable>	A search strategy provides decisions to go down in the search space.
AbstractVariable	Class used to factorise code The subclass must implement Variable interface
ACounter	Overrides all but one services for ICounter and provides easy to implement counter based on IMeasures.
ActivityBased	Implementation of the search described in: "Activity-Based Search for Black-Box Constraint Propagramming Solver", Laurent Michel and Pascal Van Hentenryck, CPAIOR12.
AdaptiveNeighborhood
AlgoAllDiffAC	Algorithm of Alldifferent with AC Uses Regin algorithm Runs in O(m.n) worst case time for the initial propagation but has a good average behavior in practice
AlgoAllDiffBC
AllDifferent	Ensures that all variables from VARS take a different value.
AlphaDominatorsFinder	Class that finds dominators of a given flow graph g(s) Uses the LT algorithm which runs in O(alpha.m)
AntiFirstFail	Anti first fail variable selector.
Arc	Created by IntelliJ IDEA.
Arc	Created by IntelliJ IDEA.
ArExpression	arithmetic expression
ArExpression.Operator	List of available operator for arithmetic expression
Arithmetic	A constraint dedicated to arithmetic operations.
ArraySort<T>
ArrayUtils	This class contains various methods for manipulating arrays.
ArrayVal	Project: choco-solver.
AutoDiffDetection	automatic detection of binary disequalities and allDifferent constraints
BacktrackCounter	Set a limit over the number of backtracks allowed during the search.
BasicIndexedBipartiteSet
BiArExpression	Binary arithmetic expression
BiCArExpression	Binary continuous arithmetic expression
BiCReExpression	Binary relational expression over continuous expressions
BiLoExpression	Binary arithmetic expression
BinaryIntProcedure<A,B>
BinaryProcedure<E,A,B>
BinRelation
BiReExpression	Binary relational expression
BitsetArrayIntVarImpl	IntVar implementation for quite small domains bit with very distant values e.g. {-51900,42,235923}
BitsetIntVarImpl
BoolEvtScheduler	Created by cprudhom on 17/06/15.
BoolNotView	A view for boolean variable, that enforce not(b).
BoolVar	CPRU r544: remove default implementation
BoolVarImpl
BoolWorld	A world devoted to integers.
Bounds	Created by IntelliJ IDEA.
BoundSearch	BEWARE: ONLY FOR INTEGERS (lets the default search work for other variable types) Search heuristic combined with a constraint performing strong consistency on the next decision variable and branching on the value with the best objective bound (for optimization) and branches on the lower bound for SAT problems.
CArExpression	arithmetic expression over reals
CArExpression.Operator	List of available operator for arithmetic expression
Cause
ChunckedBoolTrail	A trail for integers.
ChunckedDoubleTrail	A trail for integers.
ChunckedIntTrail	A trail for integers.
ChunckedLongTrail	A trail for integers.
ChunckedOperationTrail
ChunckedTrail<W extends World>	An abstract segmented trail.
CircuitConf	Enum to specify the filtering level of the circuit global constraint
CircularQueue<E>	A fixed sized circular queue optimized for removing first and last elements.
ClauseBuilder	A signed clause builder
ClauseConstraint	A constraint dedicated to store and manage signed-clauses.
ClauseStore	A class to manage life of sclauses during resolution.
Condition	A condition over integer variables
ConflictOrderingSearch<V extends Variable>	Conflict Ordering Search Composite heuristic which hacks a mainStrategy by forcing the use of variables involved in recent conflicts See "Conflict Ordering Search for Scheduling Problems", Steven Gay et al., CP2015.
Constraint	A Constraint is basically a set of Propagator.
Constraint.Status	Status of this constraint wrt the model
ConstraintsName	Utility class to store constraint's name.
ContradictionException	A specific Exception to deal with contradiction.
CostAutomaton	Created by IntelliJ IDEA.
CostRegular	COST_REGULAR constraint
Counter	Created by IntelliJ IDEA.
CounterState	Created by IntelliJ IDEA.
CPProfiler	A search monitor to send data to cp-profiler.
CReExpression	relational expression over continuous variables
CReExpression.Operator	List of available operator for relational expression
Criterion	An interface which defines a criterion with lambda Created by cprudhom on 04/09/15.
Cumulative	Cumulative constraint
Cumulative.Filter	Filtering algorithms for Cumulative constraint
CumulFilter	Class able to filter a subset of tasks for the cumulative constraint
Cyclic<V extends Variable>	A cyclic variable selector : Iterates over variables according to lexicographic ordering in a cyclic manner (loop back to the first variable)
D	Interface to represent a set of difference constraints
Decision<E extends Variable>	An abstract which defines a Decision
DecisionMaker	A class that creates decisions on demand and maintains pool manager
DecisionOperator<V extends Variable>
DecisionOperatorFactory	Create serializable decisions.
DecisionPath	To handle set of decisions.
DefaultCumulFilter	Default filtering for cumulative
DefaultSettings	A concrete implementation of Settings that enables to modify settings programmatically.
DirectedGraph	Directed graph implementation : arcs are indexed per endpoints
DisjunctiveTaskIntervalFilter
Disposable
DisposableIntIterator
DisposableRangeBoundIterator
DisposableRangeIterator	An disposable iterator for a range sequence.
DisposableValueBoundIterator
DisposableValueIterator	An disposable values iterator for values.
DomOverWDeg	Implementation of DowOverWDeg[1]
DoubleWorld	A world devoted to integers.
ElementFactory	A factory that selects the most adapted element propagator.
EnumDelta	A class to store the removed value of an integer variable.
EnumDeltaMonitor
EnvironmentBuilder	Project: choco-solver.
EnvironmentTrailing	The root class for managing memory and sessions.
EqView	declare an BoolVar based on X and C, such as (X = C) is reified by this.
ESat
EventRecorder	An explanation engine that learns general constraint from failures.
EvtScheduler<E extends IEventType>	Created by cprudhom on 17/06/15.
Except_0	A condition for building fake history based on the world index of the environment.
ExplanationForSignedClause	An implementation of IExplanation dedicated to learn signed clauses
F	Interface to represent an heuristic which computes independent sets
FailCounter	Set a limit over the number of fails allowed during the search.
FastBooleanValidityChecker
FastPathFinder	Created by IntelliJ IDEA.
FindAndProve<V extends Variable>	Enables to switch from one heuristic to another once a solution has been found
FiniteAutomaton	Created by IntelliJ IDEA.
FirstFail	First fail variable selector.
FixedBoolVarImpl	A constant view specific to boolean variable
FixedIntVarImpl	A IntVar with one domain value.
FixedRealVarImpl	Project: choco-solver.
FullyRandom	Project: choco-solver.
G	Backtrackable undirected graph
Gci	Constrained intersection graph
GeneralizedMinDomVarSelector	First fail variable selector generalized to all variables.
GephiConstants	Project: choco-solver.
GephiGenerator	Project: choco-solver.
GephiNetwork	Project: choco-solver.
Gi	Intersection Graph
GlobalCardinality	Global Cardinality constraint
GraphvizGenerator	Project: choco-solver.
GreedyBranching
HeightCumulFilter	Filtering (sweep-based) algorithm to filter task maximum heights
IAutomaton	Created by IntelliJ IDEA.
IAutomaton.NonDeterministicOperationException
IAutomaton.StateNotInAutomatonException
IAutomaton.Triple
Ibex
IbexDecision	A decision that delegates the search process to Ibex
IbexHandler	Utility class to build the right Ibex instance.
IBoundsManager	interface to monitor bounds.
ICause	This interface describes services of smallest element which can act on variables.
ICondition
IConstraintFactory	Interface to make constraints over BoolVar, IntVar, RealVar and SetVar A kind of factory relying on interface default implementation to allow (multiple) inheritance
ICostAutomaton	Created by IntelliJ IDEA.
ICounter	Created by IntelliJ IDEA.
ICounter	An interface to define count smth during search process
ICounter.Impl
IDecompositionFactory	An interface dedicated to list decomposition of some constraints.
IDelta
IDeltaMonitor	A delta monitor.
Identity	An interface to provide an identity to object, using a positive int to caracterize the object.
IEnumDelta	Interface for delta enumerated dedicated to integer variable
IEnvironment	An interface to ease declaration of backtrackable objects (mostly primitives).
IEventType	An interface to define event to categorize the filtering algorithm to apply.
IExplanation	An abstract class that defines required methods for an explanation.
IfArExpression	Project: choco-solver.
IGraph
IIntConstraintFactory	Interface to make constraints over BoolVar and IntVar A kind of factory relying on interface default implementation to allow (multiple) inheritance
IIntDeltaMonitor
IIntDeltaMonitor.Default
IIntervalDelta	Interface for delta bounded dedicated to integer variable
ILearnFactory	Interface to define how to learn during the solving process (e.g.
ILogical
IMeasures	Interface for providing resolution statistics
IMessage
IModel	Interface to ease modeling Enables to make variables, views and constraints
IMonitorClose	An interface to monitor close operation of the search loop
IMonitorContradiction	An interface to monitor contradiction in search loop
IMonitorDownBranch	An interface to monitor down branch actions in the search loop
IMonitorInitialize	An interface to monitor the initialization action of the search loop
IMonitorOpenNode	An interface to monitor open node action in the search loop
IMonitorRestart	An interface to monitor restart instruction in the search loop
IMonitorSolution	An interface to monitor solution instruction in the search loop
IMonitorUpBranch	An interface to monitor up branch actions in the search loop
IMoveFactory	Interface to define how to explore the search space from a macro perspective (DFS, LDS, LNS, etc.)
ImpactBased	Implementation of the search described in: "Impact-Based Search Strategies for Constraint Programming", Philippe Refalo, CP2004.
Implications	A abstract class that maintains an implication graph, built from events generated thanks to the propagation.
Indexable<K>
IndexedObject	Interface to manipulate object as integers in some StoredData Structures : e.g : StoredIndexedBipartiteSet
INeighbor	Deprecated. see Neighbor instead, will be removed in next release
INeighborFactory	Factory to creates INeighbor objects that configures LNS
InputOrder<V extends Variable>	Input order variable selector.
IntBoolView	An abstract class for boolean views over IntVar.
IntCircularQueue	A fix sized circular queue optimized for removing first and last elements.
IntComparator	Comparator to sort primitive integers (presumably indexes)
IntDecision	A decision based on a IntVar
IntDelta	An empty interface for delta dedicated to integer variable
IntDomainBest	Value selector for optimization problems: Branches on the value with the best objective bound (evaluated each possible assignment)
IntDomainImpact	Value selector for any type of problems: Branches on the value with the best/worst impact on domains cardinality (evaluated each possible assignment)
IntDomainLast	Value selector for optimization problems: Branches on the value in the last solution, if still in domain
IntDomainMax	Selects the variable upper bound
IntDomainMedian	Selects the median value in the variable domain.
IntDomainMiddle	Selects the value in the variable domain closest to the mean of its current bounds.
IntDomainMin	Selects the variable lower bound
IntDomainRandom	Selects randomly a value in the variable domain.
IntDomainRandomBound	Selects randomly between the lower and the upper bound of the variable
Interval	This class is adapted from : a balanced binary-search tree keyed by Interval objects.
IntervalDelta	A class to store the removed intervals of an integer variable.
IntervalDeltaMonitor
IntervalIntVarImpl
IntervalTree<T extends Interval>	The following class is adapted from: a balanced binary-search tree keyed by Interval objects.
IntEventType	An enum defining the integer variable event types: IntEventType.REMOVE: value removal event, IntEventType.INCLOW: lower bound increase event, IntEventType.DECUPP: upper bound decrease event, IntEventType.BOUND: lower bound increase and/or upper bound decrease event, IntEventType.INSTANTIATE: variable instantiation event Int event types are used with four different purposes.
IntEvtScheduler	Created by cprudhom on 17/06/15.
IntIterableBitSet	An IntIterableBitSet based on a BitSet Created by cprudhom on 09/07/15.
IntIterableRangeSet	Concrete implementation of IntIterableSet wherein values are stored in range set.
IntIterableSet	An interface to store a set of values, to be used with IntVar.removeValues(IntIterableSet, org.chocosolver.solver.ICause) and IntVar.removeAllValuesBut(IntIterableSet, org.chocosolver.solver.ICause) Created by cprudhom on 09/07/15.
IntIterableSetUtils	Project: choco.
IntIterator	An interface for collections over native integers.
IntLinCombFactory	A factory to reduce and detect specific cases related to integer linear combinations.
IntList	A specific implementation for list of integers.
IntMap	A specific implementation for hash map of integers wherein all keys and values are greater or equal to 0.
IntProcedure
IntStrategy	Class to perform branching decisions over integer variables
IntValueSelector	A value selector specifies which value should be chosen to constrain the given variable.
IntVar	Interface for integer variables.
IntVarValueIterator	Object to iterate over an IntVar values using for(int value:var){ ... } that is equivalent to int ub = var.getUB(); for(int value = var.getLB(); values <= ub; value = var.nextValue(value)){ ... }
IntView<I extends IntVar>	"A view implements the same operations as a variable.
IntWorld	A world devoted to integers.
IObjectiveManager<V extends Variable>	interface to monitor the bounds of the objective variable.
IOperation	Generic interface used to undo modifications upon backtracking
IOperationTrail
IOutputFactory	This aims at simplifying resolution trace output by providing a unique entry point for most (not to say all) resolution message.
IOutputFactory.DefaultDecisionMessage	The default decision message format
IOutputFactory.DefaultSolutionMessage	The default solution message format
IRealConstraintFactory	Interface to make constraints over RealVar A kind of factory relying on interface default implementation to allow (multiple) inheritance
IReificationFactory	Interface to reify constraints A kind of factory relying on interface default implementation to allow (multiple) inheritance
IResolutionHelper	Interface to define most commonly used resolution procedures.
ISatFactory	A factory dedicated to SAT.
ISearchMonitor
ISearchMonitorFactory	Interface to define some search monitors to be used
ISelf<V>	An interface dedicated to encapsulate a given type
ISet	Class representing a set of integers Created by IntelliJ IDEA.
ISetConstraintFactory	Interface to make constraints over SetVar A kind of factory relying on interface default implementation to allow (multiple) inheritance
ISetDelta
ISetDeltaMonitor
ISetIterator	Object to iterate over an ISet values using // more readable but includes autoboxing for(int value:set){ ... } // more verbose but without autoboxing ISetIterator iter = set.primitiveIterator(); while(iter.hasNext()){ int k = iter.nextInt(); ... }
ISolver	Interface to ease modeling Enables to make variables, views and constraints
IStateBitSet	Created by IntelliJ IDEA.
IStateBool	An abstract class for backtrackable boolean.
IStateDouble	An abstract class for backtrackable double.
IStateDoubleVector	Describes an search vector with states (describing some history of the data structure).
IStateInt	An abstract class for backtrackable int.
IStateIntVector	Describes an search vector with states (describing some history of the data structure).
IStateLong	An abstract class for backtrackable long.
IStateObject	Created by IntelliJ IDEA.
IStorage	An interface for classes implementing trails of modifications to objects.
IStoredBoolTrail
IStoredDoubleTrail
IStoredIntTrail
IStoredLongTrail
IVal	Project: choco-solver.
IVariableFactory	Interface to make variables (BoolVar, IntVar, RealVar and SetVar) A kind of factory relying on interface default implementation to allow (multiple) inheritance
IVariableMonitor<V extends Variable>	A monitor for Variable, to observe variable modification (for integer variable : value removals, bounds modification or instantiation) and do something right after the modification.
IView	An interface to define views.
IViewFactory	Interface to make views (BoolVar, IntVar, RealVar and SetVar) A kind of factory relying on interface default implementation to allow (multiple) inheritance
LargeRelation
Largest	Largest variable selector.
LastConflict<V extends Variable>	Last Conflict heuristic Composite heuristic which hacks a mainStrategy by forcing the use of variables involved in recent conflicts
LazyImplications	This implication graph is lazily built.
Learn	The "Learn" component (Inspired from "Unifying search algorithms for CSP" N.
LearnNothing	Created by cprudhom on 02/09/15.
LearnSignedClauses<E extends ExplanationForSignedClause>	A learn implementation that is able to learn signed clause on failure.
LeqView	declare an BoolVar based on X and C, such as (X <= C) is reified by this.
LocalConstructiveDisjunction	Project: choco.
LoExpression	Project: choco-solver.
LoExpression.Operator	List of available operator for relational expression
LogicTreeToolBox	A tool box to convert logical expressions into CNF.
LogOp	Logical Operator, to ease clause definition.
LogOp.Operator
LogOp.Type
LogStatEveryXXms	A search monitor logger which prints statistics every XX ms.
LongCriterion	An interface which defines a criterion with lambda Created by cprudhom on 04/09/15.
LongWorld	A world devoted to integers.
MapVal	Project: choco-solver.
MathUtils	various mathematics utilities.
MaxDelta	Selects the variables maximising envelopeSize-kernelSize.
MaxRegret	Max regret variable selector.
MD	Min Degree heuristic
MDRk	Min Degree + Random k heuristic
Measures	Object which stores resolution information to get statistics
MeasuresRecorder	Object which stores resolution information to get statistics
Member
MinDelta	Selects the variables minimising envelopeSize-kernelSize (quite similar to minDomain, or first-fail)
MinusView	View for -V, where V is a IntVar or view
Model	The Model is the header component of Constraint Programming.
MonotonicRestartStrategy	Restart strategy to restart every gap restarts
Move	The "Move" component (Inspired from "Unifying search algorithms for CSP" N.
MoveBinaryDDS	A move dedicated to run an Depth-bounded Discrepancy Search[1] (DDS) with binary decisions.
MoveBinaryDFS	A move dedicated to run a Depth First Search with binary decisions.
MoveBinaryHBFS	A move dedicated to run an Hybrid Best-First Search[1] (HBFS) with binary decisions.
MoveBinaryLDS	A move dedicated to run an Limited Discrepancy Search[1] (LDS) with binary decisions.
MoveLNS	This Move's implementation defines a Large Neighborhood Search.
MoveRestart	This Move implementation enables restarting a search on certain conditions (most of the time based on a counter).
MoveSeq	BETA: This a work-in-progress.
MultivaluedDecisionDiagram	A Multi-valued Decision Diagram (MDD for short) to store
NaArExpression	Binary arithmetic expression
NaiveTimeCumulFilter	Time-based filtering (compute the profile over every point in time)
NaLoExpression	Binary arithmetic expression
NaReExpression	Binary relational expression
Neighbor	An abstract class that defines services required for the LNS to select variables to freeze-unfreeze.
Node	Created by IntelliJ IDEA.
NodeCounter	Set a limit over the number of nodes opened allowed during the search.
NoDelta
NogoodConstraint	Created by cprudhom on 21/01/15.
NogoodFromRestarts	A constraint for the specific Nogood store designed to store ONLY positive decisions.
NogoodFromSolutions	Avoid exploring same solutions (useful with restart on solution) Beware : - Must be plugged as a monitor - Only works for integer variables
NotMember
NRJCumulFilter	Energy based filtering (greedy)
ObjectiveFactory	Factory to create (mono-)objective managers.
ObjectiveStrategy	Class that defines a branching strategy over the objective variable
Occurrence<V extends Variable>	Occurrence variable selector.
OffsetView	declare an IntVar based on X and C, such as X + C Based on "Views and Iterators for Generic Constraint Implementations" C.
OneValueDelta
OneValueDeltaMonitor	A monitor for OneValueDelta
OneWordS32BitSet
OneWordS64BitSet
OperationTrail	Created by IntelliJ IDEA.
OperationWorld
Operator
Opposite	Default opposite of a constraint
OptimizationPolicy	Class which defines a policy to adopt for the optimization process
Orientation
PairProcedure
ParallelPortfolio	A Portfolio helper.
ParetoOptimizer	Class to store the pareto front (multi-objective optimization).
PoolManager<E>
PriorityQueue
Procedure<E>	A class that permits to execute a embeded "function"
PropAbsolute	Enforces X = |Y|
Propagate	The "Propagate" component (Inspired from "Unifying search algorithms for CSP" N.
PropagateBasic	A basic Propagate implementation Created by cprudhom on 02/09/15.
PropagationEngine	This engine is priority-driven constraint-oriented seven queues engine.
PropagationGuidedNeighborhood	A Propagation Guided LNS
Propagator<V extends Variable>	A Propagator class defines methods to react on a Variable objects modifications.
PropagatorEventType	An enum defining the propagator event types: FULL_PROPAGATION: Propagation from scratch (as in initial propagation), CUSTOM_PROPAGATION: custom propagation triggered by the developer (partially incremental propagation)
PropagatorPriority
PropAllDiff	Ensures that all sets are different
PropAllDiffAC	Propagator for AllDifferent AC constraint for integer variables
PropAllDiffAdaptative	Probabilistic Propagator for AllDifferent AC constraint for integer variables introduced to avoid loosing too much time in AC propagation when BC is sufficientss The more this propagator triggers filtering and failure, the more likely it will be called If it does not bring improvement, this propagator will be called less during search
PropAllDiffBC	Based on: "A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint" A.
PropAllDiffInst	Propagator for AllDifferent that only reacts on instantiation
PropAllDiffInst.FastResetArrayStack
PropAllDisjoint	Ensures that all non-empty sets are disjoint In order to forbid multiple empty set, use propagator PropAtMost1Empty in addition
PropAllEqual	Ensures that all sets are equal
PropAMNV	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues
PropAmongGAC	Incremental propagator for Among Constraint: Counts the number of decision variables which take a value in the input value set GCCAT: NVAR is the number of variables of the collection VARIABLES that take their value in VALUES.
PropAntiArborescences	AntiArborescences propagation (simplification from tree constraint) based on dominators loops (i.e., variables such that x[i]=i) are considered as roots Can use the simple LT algorithm which runs in O(m.log(n)) worst case time Or a slightly more sophisticated one, linear in theory but not necessarily faster in practice
PropAtLeastNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
PropAtLeastNValues_AC	AtLeastNValues Propagator (similar to SoftAllDiff) The number of distinct values in vars is at least nValues Performs Generalized Arc Consistency based on Maximum Bipartite Matching The worst case time complexity is O(nm) but this is very pessimistic In practice it is more like O(m) where m is the number of variable-value pairs
PropAtMost1Empty	At most one set can be empty
PropAtMostNValues	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues No level of consistency but better than BC in general (for enumerated domains with holes)
PropAtMostNValues_BC	Propagator for the atMostNValues constraint The number of distinct values in the set of variables vars is at most equal to nValues Performs Bound Consistency in O(n+d) with n = |vars| d = maxValue - minValue (from initial domains)
PropBinAC2001	AC2001 algorithm for binary table constraint
PropBinAC3
PropBinAC3bitrm	AC3 bit rm algorithm for binary table constraint
PropBinAC3rm
PropBinCSP
PropBinFC	Forward checking algorithm for table constraint
PropBitChanneling	A propagator which ensures that OCTET = 20*BIT_1 + 21*BIT_2 + ... 2n-1*BIT_n.
PropBoolChannel	Channeling between a set variable and boolean variables
PropBoolMax
PropBoolMin
PropCardinality	A propagator ensuring that |set| = card
PropCircuit_AntiArboFiltering	Propagator for circuit constraint based on dominators Redundant propagator
PropCircuit_ArboFiltering	Propagator for sub-circuit constraint based on dominators Redundant propagator
PropCircuitSCC	Filters circuit based on strongly connected components (see the TechReport "Improving the Asymmetric TSP by considering graph structure", Fages & Lorca, 2012)
PropClauseChanneling	A propagator which links an IntVar with two arrays of BoolVar, one for EQ relations, the other for LQ relations.
PropCompactTable	Propagator for table constraint based on "Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets" Only for feasible Tuples
PropCompactTableStar	Propagator for table constraint based on "Extending Compact-Table to Negative and Short Tables", H.
PropCondAllDiff_AC	Propagator for AllDifferent AC constraint for integer variables subject to conditions (e.g. allDifferent_except_0) AllDiff only applies on the subset of variables satisfying the given condition
PropCondAllDiffInst	Propagator for ConditionnalAllDifferent that only reacts on instantiation
PropConditionnal	A specific propagator which posts constraint on condition.
PropCostRegular
PropCount_AC	Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar assumes the occVar variable to be the last of the variables of the constraint: vars = [lvars | occVar] Arc Consistent algorithm with lvars = list of variables for which the occurrence of occval in their domain is constrained
PropCountVar	Define a COUNT constraint setting size{forall v in lvars | v = occval} = occVar assumes the occVar variable to be the last of the variables of the constraint: vars = [lvars | occVar] Arc Consistent algorithm with lvars = list of variables for which the occurrence of occval in their domain is constrained
PropCumulative	Cumulative propagator Performs energy checking and mandatory part based filtering BEWARE : not idempotent, use two propagators to get the fix point
PropDiffN
PropDistanceXYC	| X - Y | op C op = {"==", "<", ">", "=/="}
PropDivXYZ	X/Y = Z A propagator for the constraint Z = X / Y where X, Y and Z are integer, possibly negative, variables The filtering algorithm both supports bounded and enumerated integer variables
PropElement	VALUE = TABLE[INDEX-OFFSET], ensuring arc consistency on result and index.
PropElement	Propagator for element constraint over sets states that array[index-offSet] = set
PropElementV_fast	Fast Element constraint
PropEnumDomainChanneling	Constraints that map the boolean assignments variables (bvars) with the standard assignment variables (var).
PropEQDistanceXYZ
PropEqualX_Y	X = Y
PropEqualX_YC	X = Y + C
PropEqualXC	Unary propagator ensuring: X = C, where X is a variable and C is a constant
PropEqualXY_C	X + Y = C
PropFalse
PropFastGCC	Propagator for Global Cardinality Constraint (GCC) for integer variables Basic filter: no particular consistency but fast and with a correct checker
PropGEDistanceXYZ
PropGraphCumulative	Graph based cumulative Maintains incrementally overlapping tasks Performs energy checking and mandatory part based filtering BEWARE : not idempotent, use two propagators to get the fix point
PropGreaterOrEqualX_Y	X >= Y
PropGreaterOrEqualX_YC	X >= Y + C
PropGreaterOrEqualXC	X >= C
PropGreaterOrEqualXY_C	X + Y >= C
PropGTDistanceXYZ
PropIntBoundedMemberSet	Propagator for Member constraint: iv is in set
PropIntChannel	Channeling between set variables and integer variables x in sets[y-offSet1] <=> ints[x-offSet2] = y
PropIntCstMemberSet	Propagator for Member constraint: int cst is in set
PropIntCstNotMemberSet	Propagator for Member constraint: int cst is not in set
PropIntEnumMemberSet	Propagator for Member constraint: iv is in set
PropIntersection
PropIntersectionFilterSets
PropIntValuePrecedeChain	A propagator for the IntValuePrecede constraint, based on: "Y.
PropInverse	Inverse set propagator x in sets[y-offSet1] <=> y in inverses[x-offSet2]
PropInverseChannelAC	X[i] = j+Ox <=> Y[j] = i+Oy
PropInverseChannelBC	X[i] = j+Ox <=> Y[j] = i+Oy
PropItemToLoad	Propagator for a Bin Packing constraint Propagates item/bin allocations to bin loads Reacts to item/bin allocation variables only Should be used together with PropLoadToItem
PropKeysorting	Based on Technical Report from Mats Carlsson: "Propagating THE KEYSORTING Constraint" - Sept. 15, 2014.
PropKLoops	Incremental propagator which restricts the number of loops: |{succs[i]=i+offSet}| = nbLoops
PropKnapsack	Propagator for the Knapsack constraint based on Dantzig-Wolfe relaxation
PropLargeCSP<R extends LargeRelation>
PropLargeFC
PropLargeGAC2001
PropLargeGAC2001Positive
PropLargeGAC3rm
PropLargeGAC3rmPositive
PropLargeGACSTRPos	GAC maintaind by STR
PropLargeMDDC	Implementation based on "Maintaining GAC on adhoc r-ary constraints", Cheng and Yap, CP12.
PropLEDistanceXYZ
PropLessOrEqualXC	X <= C
PropLessOrEqualXY_C	X + Y <= C
PropLex	Enforce a lexicographic ordering on two vectors of integer variables x <_lex y with x = , and y = .
PropLexChain	Solver constraint of the LexChain constraint.
PropLexInt	Enforce a lexicographic ordering on one vector of integer variables x <_lex y with x = , and a vector of ints y = .
PropLoadToItem	Incremental propagator for a Bin Packing constraint Propagates bin loads to item/bin allocations Reacts to load modifications AND allocation assignments Should be used together with PropItemToLoad
PropLocalConDis	A propagator for constructive disjunction, with local deductions.
PropLTDistanceXYZ
PropMax
PropMaxBC	X = MAX(Y,Z) ensures bound consistency
PropMaxElement	Retrieves the maximum element of the set the set must not be empty
PropMember	This propagator manages a singleton nogood.
PropMin
PropMinBC	X = MIN(Y,Z) ensures bound consistency
PropMinElement	Retrieves the minimum element of the set the set must not be empty
PropMultiCostRegular	Created by IntelliJ IDEA.
PropNbEmpty	Restricts the number of empty sets |{s in sets such that |s|=0}| = nbEmpty
PropNogoods	A propagator to store and propagate no-goods.
PropNoSubtour	Simple nocircuit contraint (from NoSubtour of Pesant or noCycle of Caseaux/Laburthe)
PropNotEmpty	Restricts the set var not to be empty
PropNotEqualX_Y	A specific Propagator extension defining filtering algorithm for: X =/= Y where X and Y are Variable objects.
PropNotEqualX_YC	A specific Propagator extension defining filtering algorithm for: X =/= Y + C where X and Y are Variable objects and C a constant.
PropNotEqualXC	A propagator ensuring that: X =/= C, where X is a variable and C a constant
PropNotEqualXY_C	A specific Propagator extension defining filtering algorithm for: X + Y =/= C where X and Y are Variable objects and C a constant.
PropNotMember	This propagator manages a singleton nogood.
PropNotMemberIntSet	Not Member propagator filtering Int->Set
PropNotMemberSetInt	Not Member propagator filtering Set->Int
PropOffSet	set2 is an offSet view of set1 x in set1 <=> x+offSet in set2
PropOpposite	Constraint representing the negation of a given constraint does not filter but fails if the given constraint is satisfied Can be used within any constraint
PropRegular
PropReif	Implication propagator
PropSat	A propagator to deal with clauses and interface a SatSolver.
PropScalar	A propagator for SUM(x_i*c_i) = b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
PropScalarMixed	A propagator for SUM(x_i*c_i) = b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
PropScale	Scale propagator : ensures x * y = z With y a constant greater than one Ensures AC
PropSetIntValuesUnion	Maintain a link between a set variable and the union of values taken by an array of integer variables Not idempotent (use two of them)
PropSignedClause	This propagator manages a signed clause: a disjunction of unary membership constraints.
PropSort	SortingConstraint is a constraint that ensures that a vector is the sorted version of a second one.
PropSquare	Enforces X = Y^2
PropSubcircuit	Subcircuit propagator (one circuit and several loops)
PropSubcircuitDominatorFilter	Propagator for sub-circuit constraint based on dominators Redundant propagator
PropSubsetEq	Ensures that X subseteq Y
PropSum	A propagator for SUM(x_i) o b Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
PropSumBool	A propagator for SUM(x_i) = y + b, where x_i are boolean variables Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
PropSumBoolIncr	A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
PropSumFullBool	A propagator for SUM(x_i) = y + b, where x_i are boolean variables Based on "Bounds Consistency Techniques for Long Linear Constraint" W.
PropSumFullBoolIncr	A propagator for SUM(x_i) = y + b, where x_i are boolean variables, maintained incrementally.
PropSumOfElements	Sums elements given by a set variable
PropSymmetric	Propagator for symmetric sets x in set[y-offSet] <=> y in set[x-offSet]
PropTableStr2	STR2 Propagator for table constraints (only positive tuples)
PropTimesNaive	V0 * V1 = V2
PropTrue
PropUnion
PropXeqCReif	A propagator dedicated to express in a compact way: (x = c) ⇔ b
PropXeqYCReif	A propagator dedicated to express in a compact way: (x = y + c) ⇔ b
PropXinSReif	A propagator dedicated to express in a compact way: (x = c) ⇔ b
PropXltCReif	A propagator dedicated to express in a compact way: (x < c) ⇔ b
PropXltYCReif	A propagator dedicated to express in a compact way: (x < y + c) ⇔ b
PropXplusYeqZ	A propagator to ensure that X + Y = Z holds, where X, Y and Z are IntVar.
R	Interface to represent a filtering rule
R1	R1 filtering rule (lower bounding only)
R2	R2 filtering rule (back-propagation)
R3	R3 filtering rule (back-propagation)
R4	R4 filtering rule (AllDifferent propagation)
Random<T extends Variable>	Random variable selector.
RandomNeighborhood	A Random LNS
RangeIterator	An interface to declare range iterator.
RealConstraint	A constraint on real variables, solved using IBEX.
RealDecision	A decision based on a RealVar that splits the domain in two ranges.
RealDomainMax	Selects the upper bound of a real variable
RealDomainMiddle	Selects a real value at the middle between the lower and the upper bound of the variable
RealDomainMin	Selects the lower bound of a real variable
RealEventType	An enum defining the real variable event types: INCLOW: lower bound increase event, DECUPP: upper bound decrease event, BOUND: lower bound increase and/or upper bound decrease event,
RealEvtScheduler	Created by cprudhom on 17/06/15.
RealPropagator	A propagator for real variables.
RealStrategy	Define a strategy based on RealVar.
RealValueSelector	A value selector specifies which value should be chosen to constrain the selected variable.
RealVar	An interface to declare variable for continuous constraints (solved using IBEX).
RealVarImpl	An implementation of RealVar, variable for continuous constraints (solved using IBEX).
RealView
ReExpression	relational expression
ReExpression.Operator	List of available operator for relational expression
ReificationConstraint	Implication constraint: boolean b => constraint c Also known as half reification
Reporting
ResolutionPolicy	User : cprudhom Mail : cprudhom(a)emn.fr Date : 6 mai 2010 Since : Choco 2.1.1
ReversePropagationGuidedNeighborhood	A Propagation Guided LNS
Rk	Random heuristic
RootDecision
S64BitSet
SafeIntProcedure
SatConstraint
ScaleView	declare an IntVar based on X and C, such as X * C
Search
SearchMonitorList
SearchState	Indication about the search status
SearchViz	Created by cprudhom on 22/10/2015.
SequenceNeighborhood	A neighbor which is based on mutliple neighbors.
Set_BitSet	BitSet implementation for a set of integers Supports negative numbers when using int... constructor
Set_CstInterval	Constant Interval set of the form [min, max] BEWARE: Cannot add/remove elements
Set_FixedArray	Fixed array of integers (cannot add nor remove items)
Set_LinkedList	LinkedList of m elements add : O(1) testPresence: O(m) remove: O(m) iteration : O(m) Created by IntelliJ IDEA.
Set_ReadOnly	Generic read-only view of a set
Set_Std_BitSet	BitSet implementation for a set of integers Supports negative numbers if offset is set properly
Set_Std_Swap	Set of integers based on BipartiteSet implementation BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH (add only or remove only) add : O(1) testPresence: O(1) remove: O(1) iteration : O(m)
Set_Std_Swap2	Set of integers based on BipartiteSet implementation for small sets (arraylist inside) BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH
Set_Swap	Bipartite set of integers: add : O(1) contain: O(1) remove: O(1) iteration : O(m)
Set_Swap2	Set of integers based on BipartiteSet implementation for small sets (arraylist inside) BEWARE : CANNOT BOTH ADD AND REMOVE ELEMENTS DURING SEARCH
SetDecision	A decision based on a SetVar
SetDelta
SetDeltaMonitor
SetDomainMin	Selects the first integer in the envelope and not in the kernel
SetEventType	An enum defining the set variable event types: ADD_TO_KER: value enforcing event, REMOVE_FROM_ENVELOPE: value removal event,
SetEvtScheduler	Created by cprudhom on 17/06/15.
SetFactory	Factory for creating sets
SetStrategy	Strategy for branching on set variables
Settings	Settings for Model.
SetType
SetValueSelector	Heuristic for branching on a given SetVar
SetVar	A Set Variable is defined by a domain which is a set interval [LB,UB], where: LB is the set of integers that must belong to every single solution.
SetVarImpl	Set variable to represent a set of integers, i.e. a value is a set
ShrinkableList<T>	Project: choco-solver.
SimpleDominatorsFinder	Class that finds dominators of a given flow graph g(s) Uses the simple LT algorithm which runs in O(m.log(n)) Fast in practice
Smallest	Smallest variable selector.
Solution	Class which stores the value of each variable in a solution
SolutionCounter	Set a limit over the number of found solutions allowed during the search.
Solver	This class is inspired from : Inspired from "Unifying search algorithms for CSP" N.
Solver.Action	Define the possible actions of SearchLoop
SolverException	A specific RuntimeException that can be thrown during the normal execution of the problem resolution.
StatisticsPanel	A simple dashboard to show resolution statistics on a frame during resolution.
StatisticUtils
StdSet	Generic backtrable set for trailing
StoredBool	A class implementing backtrackable boolean.
StoredBoolTrail
StoredDirectedMultiGraph	Created by IntelliJ IDEA.
StoredDirectedMultiGraph	Created by IntelliJ IDEA.
StoredDouble	A class implementing backtrackable double.
StoredDoubleTrail
StoredDoubleVector	Implements a backtrackable search vector.
StoredDoubleVectorTrail	Implements a trail with the history of all the stored search vectors.
StoredIndexedBipartiteSet	A stored list dedicated to positive integers and three operations : - iteration - removal of an element - check if an element is or not within the list It only requires a StoredInt to denote the first element of the list and proceeds by swapping element with the first one to remove them and incrementing the index of the first element.
StoredIndexedBipartiteSet.BipartiteSetIterator
StoredIndexedBipartiteSetWithOffset	Created by IntelliJ IDEA.
StoredInt	A class implementing backtrackable int.
StoredIntTrail
StoredIntVector	Implements a backtrackable search vector.
StoredIntVectorTrail	Implements a trail with the history of all the stored search vectors.
StoredLong	A class implementing backtrackable long.
StoredLongTrail
StoredSparseSet	Implementation based on "Maintaining GAC on adhoc r-ary constraints", Cheng and Yap, CP12.
StoredValuedDirectedMultiGraph	Created by IntelliJ IDEA.
StrategiesSequencer	A StrategiesSequencer is class for AbstractStrategy composition.
StringUtils
StrongConnectivityFinder
SumConstraint	Project: choco-solver.
SweepCumulFilter	Basic implementation of Sweep-based Time-Table for cumulative
SweepCumulFilter.Event
SweepHeiSortCumulFilter	Alternative implementation of Sweep-based Time-Table for cumulative The set of variables to be pruned is sorted by decreasing heights, not time
Task	Container representing a task: It ensures that: start + duration = end
TernaryIntProcedure<A,B,C>
TernaryProcedure<E,A,B,C>
TimeCounter	A limit over run time.
TimeCumulFilter	Time-based filtering (compute the profile over every point in time)
TimeStampedObject	Class for factorizing code of time stamped objects
TimeUtils
Tuples	A unique interface to declare tuples for table constraints.
TuplesFactory	A Factory to ease generation of tuples.
TuplesLargeTable
TuplesList	A simple way of storing the tuples as a list.
TuplesTable
TuplesVeryLargeTable	A LargeRelation for cases where domain are too big to be stored in a single array.
TupleValidator	An interface to implement to filter valid tuples automatically generated through TuplesFactory
UnArExpression	Unary arithmetic expression
UnaryIntProcedure<A>
UnaryProcedure<E,A>
UnarySafeIntProcedure<A>
UnCArExpression	Unary arithmetic continuous expression
UndirectedGraph	Specific implementation of an undirected graph
UnLoExpression	Binary arithmetic expression
ValidityChecker	A simple class that provides a method to check if a given tuple is valid i.e. if it is ok regarding the current domain of the variables
ValueIterator	An interface to declare values iterator.
ValueSortedMap<E>	A map which ensures key uniqueness and order over values.
Variable	To developers: any constructor of variable must pass in parameter the back-end ISolver, that is, in decreasing order: - the model portfolio, - the model (or portfolio workers but fes).
VariableEvaluator<V extends Variable>	A variable evaluator.
VariableSelector<V extends Variable>	A variable selector specifies which variable should be selected at a fix point.
VariableSelectorWithTies<V extends Variable>
VariableUtils	Project: choco-solver.
ViewDeltaMonitor	A delta monitor dedicated to views
World	Specify a stack in a world.