/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Copyright: * Christian Schulte, 2005 * * Last modified: * $Date: 2008-07-11 09:36:57 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $ * $Revision: 7295 $ * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */ #include "test/int.hh" #include "gecode/minimodel.hh" namespace Test { namespace Int { /// Tests for element constraints namespace Element { /** * \defgroup TaskTestIntElement Element constraints * \ingroup TaskTestInt */ //@{ /// Test for element with integer array and integer variables class IntIntVar : public Test { protected: /// Array of integers Gecode::IntArgs c; public: /// Create and register test IntIntVar(const std::string& s, const Gecode::IntArgs& c0) : Test("Element::Int::Int::Var::"+s,2,-4,8), c(c0) {} /// Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]= 0) && (x[0]1)) return false; return ((x[0]>= 0) && (x[0]=0) && (x[1]<=1)); } /// Post constraint on \a x virtual void post(Gecode::Space* home, Gecode::IntVarArray& x) { using namespace Gecode; BoolVarArgs c(x.size()-2); for (int i=0; i1)) return false; return ((x[0]>= 0) && (x[0]