org.jacop.constraints

Class Lex

java.lang.Object

org.jacop.constraints.DecomposedConstraint<Constraint>

org.jacop.constraints.Lex

public class Lex
extends DecomposedConstraint<Constraint>

It constructs a Lex (lexicographical order) constraint.

Version:

4.9

Author:

Krzysztof Kuchcinski and Radoslaw Szymanek

Field Summary

Fields

Modifier and Type	Field and Description
boolean	lexLT Is the lex enforcing lower then relationship?
IntVar[][]	x A two dimensional array containing arrays which have to be lexicographically ordered.

Fields inherited from class org.jacop.constraints.DecomposedConstraint

queueIndex

Constructor Summary

Constructors

Constructor and Description
Lex(IntVar[][] x) It creates a lexicographical order for vectors x[i], i.e.
Lex(IntVar[][] x, boolean lt)

Method Summary

Modifier and Type	Method and Description
List<Constraint>	decompose(Store store) It returns an array list of constraint which are used to decompose this constraint.
List<Constraint>	decomposeLE(Store store)
List<Constraint>	decomposeLERegular(Store store)
List<Constraint>	decomposeLT(Store store)
List<Constraint>	decomposeLTRegular(Store store)
void	imposeDecomposition(Store store) It imposes the constraint in a given store.

Methods inherited from class org.jacop.constraints.DecomposedConstraint

auxiliaryVariables, checkInput, checkInput, checkInputForDuplication, checkInputForDuplicationSkipSingletons, checkInputForNullness, checkInputForNullness, checkInputForNullness, derivative, getDubletonsSkipSingletons, imposeDecomposition

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

x

public IntVar[][] x

A two dimensional array containing arrays which have to be lexicographically ordered.

lexLT

public final boolean lexLT

Is the lex enforcing lower then relationship?

Constructor Detail

Lex

public Lex(IntVar[][] x)

It creates a lexicographical order for vectors x[i], i.e. forall i, exists j : x[i][k] = x[i+1][k] for k < j and x[i][k] <= x[i+1][k] for k >= j

vectors x[i] does not need to be of the same size. boolea lt defines if we require Lex_{<} (lt = false) or Lex_{=<} (lt = true)

Parameters:

x - vector of vectors which assignment is constrained by Lex constraint.

Lex

public Lex(IntVar[][] x,
           boolean lt)

Method Detail

imposeDecomposition

public void imposeDecomposition(Store store)

Description copied from class: DecomposedConstraint

It imposes the constraint in a given store.

Specified by:

imposeDecomposition in class DecomposedConstraint<Constraint>

Parameters:

store - the constraint store to which the constraint is imposed to.

decompose

public List<Constraint> decompose(Store store)

Description copied from class: DecomposedConstraint

It returns an array list of constraint which are used to decompose this constraint. It actually creates a decomposition (possibly also creating variables), but it does not impose the constraint.

Specified by:

decompose in class DecomposedConstraint<Constraint>

Parameters:

store - the constraint store in which context the decomposition takes place.

Returns:

an array list of constraints used to decompose this constraint.

decomposeLERegular

public List<Constraint> decomposeLERegular(Store store)

decomposeLTRegular

public List<Constraint> decomposeLTRegular(Store store)

decomposeLT

public List<Constraint> decomposeLT(Store store)

decomposeLE

public List<Constraint> decomposeLE(Store store)