Package org.jacop.constraints

Class Lex

    • Field Detail

      • x

        public IntVar[][] x
        A two dimensional array containing arrays which have to be lexicographically ordered.

      • constraints

        java.util.List<Constraint> constraints
        It contains constraints of the lex constraint decomposition.

      • 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

      • decompose

        public java.util.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 java.util.List<Constraint> decomposeLERegular​(Store store)

      • decomposeLTRegular

        public java.util.List<Constraint> decomposeLTRegular​(Store store)

      • decomposeLT

        public java.util.List<Constraint> decomposeLT​(Store store)

      • decomposeLE

        public java.util.List<Constraint> decomposeLE​(Store store)