/**
 *  Copyright (c) 1999-2011, Ecole des Mines de Nantes
 *  All rights reserved.
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *      * Redistributions of source code must retain the above copyright
 *        notice, this list of conditions and the following disclaimer.
 *      * Redistributions in binary form must reproduce the above copyright
 *        notice, this list of conditions and the following disclaimer in the
 *        documentation and/or other materials provided with the distribution.
 *      * Neither the name of the Ecole des Mines de Nantes nor the
 *        names of its contributors may be used to endorse or promote products
 *        derived from this software without specific prior written permission.
 *
 *  THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
 *  EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 *  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 *  DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
 *  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 *  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 *  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 *  ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

package solver.constraints.extension.nary;

import java.io.Serializable;

public abstract class LargeRelation implements Serializable{

    /**
     * return true if tuple is feasible according
     * to the definition of the relation. e.g if the relation is defined
     * with infeasible tuples, it returns true if tuple is one of them.
     *
     * @return
     */
    public abstract boolean checkTuple(int[] tuple);

    /**
     * Test whether a tuple is consistent
     *
     * @return true if tuple is consistent.
     */
    public abstract boolean isConsistent(int[] tuple);

    protected boolean valid(int[] tuple, int[] offsets, int[] domSizes) {
        for (int i = 0; i < tuple.length; i++) {
                if (!between(tuple[i], offsets[i], offsets[i] + domSizes[i] - 1)) return false;
            }
            return true;
        }

    private static boolean between(int v, int low, int upp) {
            return (low <= v) && (v <= upp);
        }


}

@@ -1757,16 +1757,17 @@
 alizable
+ 
 %7B%0A%0A    /
@@ -2295,16 +2295,18 @@
         
+/*
 for (int
@@ -2447,21 +2447,19 @@
        %7D
-%0A    
+*/%0A
         
@@ -2471,20 +2471,16 @@
 n true;%0A
-    
     %7D%0A%0A 
@@ -2544,28 +2544,24 @@
 ) %7B%0A        
-    
 return (low 
@@ -2581,20 +2581,16 @@
 = upp);%0A
-    
     %7D%0A%0A%0A

fix tuple generation (just a patch, needs to be revamp)