Package org.jacop.constraints


package org.jacop.constraints
  • Class
    Description
    Constraints |X| #= Y
    Alldiff constraint assures that all FDVs has different values.
     
    Alldifferent constraint assures that all FDVs has differnet values.
    Alldistinct constraint assures that all FDVs have different values.
    Among constraint in its simplest form.
    Among constraint in its general form.
    Constraint c1 /\ c2 ...
    AndBool constraint implements logic and operation on its arguments and returns result.
    If both a and b are equal 1 then result variable is equal 1 too.
     
    ArgMax constraint provides the index of the maximum variable from all variables on the list.
    ArgMin constraint provides the index of the maximum variable from all variables on the list.
    Assignment constraint implements facility to improve channeling constraints between dual viewpoints of permutation models.
     
     
    I defines a boolean clause for 0/1 variables x_i and y_i.
    ChannelImply constraints "B => constraint".
     
    ChannelReif constraints "constraint" <=> B.
     
    Circuit constraint assures that all variables build a Hamiltonian circuit.
    Defines a Variable for Circuit constraints and related operations on it.
    Defines a current value of the CircuitVar and related operations on it.
    Conditional constraint implements conditional constraint satisfiability.
     
    Count constraint implements the counting over number of occurrences of a given value in a list of variables.
    CountBounds constraint implements the counting over number of occurrences of a given value in a list of variables.
     
    CountValuesBounds constraint implements the counting over numbers of occurrences of a given vector of values in a list of variables.
     
     
    Cumulative implements the cumulative/4 constraint using edge-finding algorithm and profile information on the resource use.
    Defines a basic data structure to keep two profiles for the cumulative constraints.
    Standard unified interface/abstract class for constraints, which can only be decomposed.
    Decreasing constraint assures that all variables are in decreasing order.
    Diff constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
     
    Diff2 constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    Defines a Variable for Diff2 constraints and related operations on it.
    Defines a current value of the Diff2Var and related operations on it.
    Defines a basic data structure to keep the profile for the diff2/1 constraints.
    Disjoint constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    DisjointConditional constraint assures that any two rectangles from a vector of rectangles does not overlap in at least one direction.
    Defines a basic data structure to keep the profile for the diffn/1 constraints.
    Defines a Variable for Diff2 constraints and related operations on it.
    Defines a current value of the Diff2Var and related operations on it.
    Constraint |X - Y| #= Z
    Element constraint implements the element/4 constraint (both with integer list and variables list).
    ElementInteger constraint defines a relation list[index - indexOffset] = value.
     
    ElementVariable constraint defines a relation list[index - indexOffset] = value.
     
    Constraint "constraint1"#<=> "constraint2"
    If all x's are equal to each other then result variable is equal 1.
    Defines a basic structure for exsclusive rectangles used in DisjointConditional
    Defines a list of exclusive items.
    Extensional constraint assures that none of the tuples explicitly given is enforced in the relation.
    Extensional constraint assures that one of the tuples is enforced in the relation.
    Extensional constraint assures that one of the tuples is enforced in the relation.
    Extensional constraint assures that one of the tuples is enforced in the relation.
    GCC constraint counts the number of occurences of given values in x variables.
     
     
    Constraint if constraint1 then constraint2
    Constraint ( X => Y ) <=> Z.
    Constraint if constraint1 then constraint2 else constraint3 *
     
    Constraints X to belong to a specified domain.
    Increasing constraint assures that all variables are in increasing order.
    Defines a rectangle with integer origine and length used in the diffn constraint.
    Represents tasks with integer start, duration and resource valurs for cumulative constraint
    It constructs a Lex (lexicographical order) constraint.
    It constructs a LexOrder (lexicographical order) constraint.
    Deprecated.
    As of release 4.3.1 replaced by LinearInt constraint.
     
    LinearIntDom constraint implements the weighted summation over several variables.
    Max constraint implements the Maximum/2 constraint.
    MaxSimple constraint implements the Maximum/2 constraint.
    Member constraint implements the membership of element e on list x.
    Min constraint implements the minimum/2 constraint.
    MinSimple constraint implements the minimum/2 constraint.
    NoGood constraints implements a constraint which disallows given combination of values for given variables.
    Constraint "not costraint"
    Constraint c1 \/ c2 \/ ...
    OrBool constraint implements logic and operation on its arguments and returns result.
    If at least one variable is equal 1 then result variable is equal 1 too.
    If at least one variable from the list is equal 1 then result variable is equal 1 too.
    Standard unified interface for all primitive constraints.
    Defines a basic data structure to keep the profile for the diffn/1 and cumulative/4 constraints.
    Defines a basic data structure to keep the profile for the disjointConditonal/2
    Defines a basic structure used to update profile for cumulative constraint.
    Defines a basic structure used to update profile DisjointConditional when some rectangles can share the same place.
    Defines a rectangle used in the diffn constraint.
    Defines a rectangle used in the diffn constraint.
     
    It constructs a Sequence constraint.
    This class provides soft-alldifferent constraint by decomposing it either into a network flow constraint or a set of primitive constraints.
    This class provides soft-gcc constraint by decomposing it either into a network flow constraint or a set of primitive constraints.
    It constructs a Stretch constraint based on Regular constraint.
    Subcircuit constraint assures that all variables build a subcircuit.
     
     
    SumInt constraint implements the summation over several variables.
     
    Deprecated.
    As of release 4.3.1 replaced by LinearIntDom constraint.
    Represents tasks for cumulative constraint
     
    Constraint Values counts number of different values on a list of Variables.
    VariableTrace is a daemon that prints information on variables whenever they are changed.
     
    Constraint X div Y #= Z
     
    Constraints X #= Y
    Constraint X ^ Y #= Z
    Constraint X > C
    Constraints X >= C
    Constraints X >= Y
    Constraint X > Y
    Constraint X < C
    Constraint X <= C
    Constraint X <= Y
    Constraint X < Y
     
     
    Constraint X * Y #= C
     
     
    Constraints X #\= Y
    Xor constraint - xor("constraint", B).
    Constraint ( x_0 xor x_1 xor ...
    Constraint X + C #= Z.
    Constraints X + C<= Z.
    Constraint X + Y #= C
    Constraint X + Y = Z
    Constraint X + Y> C
    Constraint X + Y=< Z