/**
* 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.
*/
/**
* @author Jean-Guillaume Fages
* @since 17/09/14
* Created by IntelliJ IDEA.
*/
package solver.constraints.nary;
import org.testng.annotations.Test;
import solver.Solver;
import solver.constraints.ICF;
import solver.search.loop.monitors.IMonitorSolution;
import solver.search.loop.monitors.SMF;
import solver.variables.IntVar;
import solver.variables.VF;
import java.util.BitSet;
public class NValueTest {
@Test(groups = "1s")
public void testAtLeast(){
Solver solver = new Solver();
final IntVar[] XS = VF.enumeratedArray("XS", 4, 0, 2, solver);
final IntVar N = VF.enumerated("N", 2, 3, solver);
solver.post(ICF.atleast_nvalues(XS, N, false));
SMF.log(solver, true, false);
final BitSet values = new BitSet(3);
solver.plugMonitor(new IMonitorSolution() {
@Override
public void onSolution() {
values.clear();
for(IntVar v:XS){
if(!v.isInstantiated()){
throw new UnsupportedOperationException();
}
values.set(v.getValue());
}
if(!N.isInstantiated()){
throw new UnsupportedOperationException();
}
if(values.cardinality()<N.getValue()){
throw new UnsupportedOperationException();
}
}
});
solver.findAllSolutions();
}
@Test(groups = "1s")
public void testAtMost(){
Solver solver = new Solver();
final IntVar[] XS = VF.enumeratedArray("XS", 4, 0, 2, solver);
final IntVar N = VF.enumerated("N", 2, 3, solver);
solver.post(ICF.atmost_nvalues(XS, N, false));
SMF.log(solver, true, false);
final BitSet values = new BitSet(3);
solver.plugMonitor(new IMonitorSolution() {
@Override
public void onSolution() {
values.clear();
for(IntVar v:XS){
if(!v.isInstantiated()){
throw new UnsupportedOperationException();
}
values.set(v.getValue());
}
if(!N.isInstantiated()){
throw new UnsupportedOperationException();
}
if(values.cardinality()>N.getValue()){
throw new UnsupportedOperationException();
}
}
});
solver.findAllSolutions();
}
}