Posts the constraint, that is call {@link CPConstraint#post()} and computes the fix-point. A {@link InconsistencyException} is thrown if by posting th

Returns the minimum of the domain of the variable @return the minimum of the domain of the variable

Returns the maximum of the domain of the variable @return the maximum of the domain of the variable

Creates a variable with a domain of specified arity. @param cp the solver in which the variable is created @param sz a positive value that is the siz

Returns the solver in which this variable was created. @return the solver in which this variable was created.

Returns true if the domain contains the specified value. @param v the value whose presence in the domain is to be tested @return true if the domain co

Inserts a node in the sequence after a given member. Requires the node if it was not required yet. @param prev member after which the node will be in

Creates the desired constraint using some predefined minicp model and a set of already instantiated variables. @param solver the solver which can be

Retrieves the value @return the value

Returns the size of the domain of the variable @return the size of the domain of the variable

Computes the fix-point with all the scheduled constraints.

Returns the state manager in charge of the global state of the solver. @return the state manager

Creates a new optional interval variable with a startMin of 0, an unbounded end and unfixed length @param cp the solver @return a new interval variab

Returns a constraint imposing that the variable is equal to some given value. @param x the variable to be assigned to v @param v the value that must

Removes the specified value. @param v the value to remove @exception InconsistencyException is thrown if the domain becomes empty

Set the value @param v the value to set @return the new value that was set

Creates an array of variables with specified lambda function @param n the number of variables to create @param body the function that given the in

Tells if a node is matching a status. @param node node. @param status status that must be matched by the node. @return true if the node is matching

Creates a Depth First Search with custom branching heuristic <pre> // Example of binary search: At each node it selects // the first free variable qi

Removes all the values above a given value. @param v the value such that all the values larger than v are removed @exception InconsistencyException

Removes all the values less than a given value. @param v the value such that all the values less than v are removed @exception InconsistencyException

Fixes the specified value. @param v the value to assign. @exception InconsistencyException is thrown if the value is not in the domain

Return a lower bound for this expression

Adds a listener that is called on each solution. @param listener the closure to be called whenever a solution is found

Forbids a subsequence of length 3 to appear, removing from the domain all sequences containing the sub-sequence given as input. For technical reasons,

First-Fail Binary search strategy. Selects the first not fixed variable with smallest domain. Then it creates two branches. The left branch assigning

Activates or deactivates the constraint such that it is not scheduled any more. <p>Typically called by the Constraint to let the solver know it should

sorts x increasingly according to the weights w @param x @param w

Assert the full state of a sequence Test quite a bunch of stuff and is quite expensive. This is rather safe but expensive if testing simple operations

Return an upper bound for this expression

Excludes a node from the sequence. @param node node to be excluded. @throws InconsistencyException if the node is required ({@code isNode(node, REQUI

Creates a boolean variable. @param cp the solver in which the variable is created @return an uninstantiated boolean variable

Creates a sequence variable. @param cp the solver in which the variable is created @return an uninstantiated boolean variable

Tells if an insertion is valid. An insert operation is valid iff - prev is a member node ; - node is an insertable node (either possible or a required

Creates a Stateful integer (restorable) @param initValue the initial setValue @return a StateInt object wrapping the initValue

Returns a variable representing the sum of a given set of variables. This relation is enforced by the {@link Sum} constraint posted by calling this me

Copies the values of the domain into an array. @param dest an array large enough {@code dest.length >= size()} @return the size of the domain and {@c

Tells if a node is matching a status. @param node node. @param status status that must be matched by the node. @return true if the node is matching

Returns the member following another member in the sequence. @param node member within the sequence. @return member following the given node in the s

Tells if an insertion is valid. An insert operation is valid iff - prev is a member node ; - node is an insertable node (either possible or a required

Creates a constraint programming solver @return a constraint programming solver with trail-based memory management

Asks that {@link CPConstraint#propagate()} is called whenever the bound (maximum or minimum values) of the domain of this variable is changes. We say

First member of the sequence @return first member of the sequence

First member of the sequence @return first member of the sequence

Tests if the variable is fixed to true @return true if the variable is fixed to true (value 1)

Filters the objective wrt to current bound This method is typically executed at each node of a search tree

Requires a node in the sequence. @param node node to be required. @throws InconsistencyException if the node is excluded ({@code isNode(node, EXCLUDE

Creates a minimization objective on the given variable. @param x the variable to minimize @return an objective that can minimize x @see DFSearch#opti

Returns true if the domain of the variable has a single value. @return true if the domain of the variable is a singleton.

Returns a constraint imposing that the variable is less or equal to some given value. @param x the variable that is constrained bo be less or equal t

Gives the number of nodes matching a status. @param status status that must be matched by the nodes. @return the number of nodes matching the status.

Set the ith bit up (value 1). @param i the bit to set

Post method that disables the fix point when needed @param constraint

Asks that {@link CPConstraint#propagate()} is called whenever the domain of this variable changes. We say that a <i>change</i> event occurs. @param c

Returns the variable related to a node. @param node node. @return variable related to a node.

Create an array of n IntVars with domain between 0 and domSize-1, inclusive. @param n size of the array, number of IntVars @param domSize size of the

Copies the nodes matching a status into an array. @param dest an array large enough {@code dest.length >= nNode(status)}. @param status status that

Fill an array of minimum size size() with a superset of the domain of this expression. Returns `v`, the size of the domain after it has been computed,

Collects all candidate decision variables inferred from the model's constraint graph. @param model the model to inspect @return ordered, identity-ded