Returns a variable representing the value in an array at the position specified by the given index variable This relation is enforced by the {@link El

Returns the active status of the constraint. @return the last setValue passed to {{@link #setActive(boolean)} in this state frame {@link State

True if the expression is fixed

Creates a Stateful reference (restorable) @param initValue the initial setValue @return a State object wrapping the initValue

Removes the given value from the set. @param val the value to remove. @return true if val was in the set, false otherwise

Returns a CPIntVar that is equal to the end of interval if it is present, or equal to val if interval is absent @param interval the interval variable

Returns whether the interval var given in parameter contributes to the cumul function @param interval an {@link IntervalVar} @return a boolean that in

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

A boolean variable that is a view of {@code !b}. @param b a boolean variable @return a boolean variable that is a view of {@code !b}

Start the solving process @return an object with the statistics on the search

Excludes a value from the set variable. throws an InconsistencyException if the value is already included in the set. calls the propagate method of th

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

The earliest completion time of the activities present in the theta-tree @return the earliest completion time of the activities present in the theta-t

Returns a boolean variable representing whether one variable is equal to the given constant. This relation is enforced by the {@link IsEqual} constrai

Returns if a value is included in the set. @param v the value to check @return true if the value is included, false otherwise

Returns if a value is possible in the set. @param v the value to check @return true if the value is possible, false otherwise

Returns the number of insertions of a node. @param node node. @return the number of insertions of a node.

Returns the number of insertions of a node. @param node node. @return the number of insertions of a node.

Returns an array with the values present in the set. @return an array representation of the values present in the set

Returns a delta object allowing to retrieve the changes in the domain of the variable (removed values) since the previous call to the {@code Constrain

Copies the values (in an arbitrary order) of the set of included elements into an array. @param dest an array large enough {@code dest.length >= nInc

Makes the intersection with another bit-set but only on non zero-words of the outer sparse-bit-set. @param other the other bit-set to make the inters

Requires a cumulative function to always be within the range [minValue..maxValue] on the execution range of the cumulative function. @param fun a cum

A variable that is a view of {@code intervalVar+v}, adding an offset to it @param intervalVar a variable @param v a value @return a variabl

@param startMin the minimum start time of each activity @param duration the duration of each activity @param endMax the maximum end time of each act

Creates an elementary flat Cumulative Function. @return a cumulative function that is flat

Returns the size of the set. @return the size of the set

Sets the first values of <code>dest</code> to the ones present in the set that also satisfy the given filter predicate @param dest, an array large en

Fills an array with the insertions for a node. Equivalent to {@code fillPred(node, dest, MEMBER)}. @param node node. @param dest an array large enoug

Copies the values (in an arbitrary order) of the set of possible elements into an array. @param dest an array large enough {@code dest.length >= nPos

Returns an {@link IntExpression} representing the height of the cumul function at the start of the interval variable given in parameter. @param inter

Returns a CPIntVar that is equal to the length of interval. @param var the interval variable, it must be present at the time of the posting @return a

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

Returns a variable that represents the cardinality of the set. @return the cardinality variable

Test the emptiness of the intersection with a given BitSet @param bs the BitSet to test the intersection with @return true if empty, false otherwise

Returns if a value is excluded from the set. @param v the value to check @return true if the value is excluded, false otherwise

Returns the maximum value in the set. @return the maximum value in the set

Returns the minimum value in the set. @return the minimum value in the set

@param branches the ordered closures for the child branches ordered from left to right in the depth first search. @return an array wit

Closes the sub-circuit by forcing all remaining unassigned nodes to point to themselves (self-loops).

Returns the current level. It is increased at each {@link #saveState()} and decreased at each {@link #restoreState()}. It is initially equal to -1. @r

Returns an {@link IntExpression} representing the height of the cumul function at the end of the interval variable given in parameter. @param interva

Gives a variable telling if a given node must be visited @param node node in the sequence @return variable set to true if the node must be visited

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

Asks that {@link CPConstraint#propagate()} is called whenever an insertion happens. We say that an <i>insert</i> event occurs. @param c the constrain

Remove a directed edge from -> to @param from origin of the edge @param to destination of the edge

Gives the service time at a given node @param node node whose service time must be known @return service time at the node

Sets the new value of the bound as the one of the current solution + (maximization) or - (minimization) delta @param delta a positive integer

Creates an elementary Cumulative Function that is a step of height h that happen at the start of the Interval variable var if it is present. @param v