Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
22 kB · 616 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2005 * * 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>#include <climits>
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, int min, int max) : Test("Element::Int::Int::Var::"+s,2,min,max), c(c0) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::element(home, c, x[0], x[1]); } };
/// %Test for element with integer array and integer variables class IntIntInt : public Test { protected: /// Array of integers Gecode::IntArgs c; /// Integer result int r; public: /// Create and register test IntIntInt(const std::string& s, const Gecode::IntArgs& c0, int r0) : Test("Element::Int::Int::Int::"+s+"::"+str(r0),1,-4,8), c(c0), r(r0) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==r; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::element(home, c, x[0], r); } };
/// %Test for element with integer array and single shared integer variable class IntIntShared : public Test { protected: /// Array of integers Gecode::IntArgs c; public: /// Create and register test IntIntShared(const std::string& s, const Gecode::IntArgs& c0, int minDomain=-4) : Test("Element::Int::Int::Shared::"+s,1,minDomain,8), c(c0) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==x[0]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::element(home, c, x[0], x[0]); } };
/// %Test for element with integer array and integer and Boolean variable class IntBoolVar : public Test { protected: /// Array of integers Gecode::IntArgs c; public: /// Create and register test IntBoolVar(const std::string& s, const Gecode::IntArgs& c0) : Test("Element::Int::Bool::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]<c.size()) && c[x[0]]==x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::element(home, c, x[0], Gecode::channel(home,x[1])); } };
/// %Test for element with integer array and integer and Boolean variable class IntBoolInt : public Test { protected: /// Array of integers Gecode::IntArgs c; /// Integer result int r; public: /// Create and register test IntBoolInt(const std::string& s, const Gecode::IntArgs& c0, int r0) : Test("Element::Int::Bool::Int::"+s+"::"+str(r0),1,-4,8), c(c0), r(r0) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<c.size()) && c[x[0]]==r; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::element(home, c, x[0], r); } };
/// %Test for element with variable array and integer variables class VarIntVar : public Test { public: /// Create and register test VarIntVar(Gecode::IntPropLevel ipl) : Test("Element::Var::Int::Var::"+str(ipl),6,-1,3,false,ipl) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<x.size()-2) && x[2+x[0]]==x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::IntVarArgs c(x.size()-2); for (int i=0; i<x.size()-2; i++) c[i]=x[2+i]; Gecode::element(home, c, x[0], x[1], ipl); } };
/// %Test for element with variable array and integer variables class VarIntInt : public Test { protected: /// Integer result int r; public: /// Create and register test VarIntInt(Gecode::IntPropLevel ipl, int r0) : Test("Element::Var::Int::Int::"+str(ipl)+"::"+str(r0), 5,-1,3,false,ipl), r(r0) { contest = CTL_NONE; } /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==r; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::IntVarArgs c(x.size()-1); for (int i=0; i<x.size()-1; i++) c[i]=x[1+i]; Gecode::element(home, c, x[0], r, ipl); } };
/// %Test for element with variable array and shared integer variable class VarIntShared : public Test { public: /// Create and register test VarIntShared(Gecode::IntPropLevel ipl) : Test("Element::Var::Int::Shared::"+str(ipl),5,-1,3,false,ipl) { contest = CTL_NONE; } /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { return (x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==x[0]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { Gecode::IntVarArgs c(x.size()-1); for (int i=0; i<x.size()-1; i++) c[i]=x[1+i]; Gecode::element(home, c, x[0], x[0], ipl); } };
/// %Test for element with Boolean variable array and integer variable class VarBoolVar : public Test { public: /// Create and register test VarBoolVar(void) : Test("Element::Var::Bool::Var",6,-1,3,false) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { for (int i=0; i<x.size()-2; i++) if ((x[2+i] < 0) || (x[2+i]>1)) return false; return ((x[0]>= 0) && (x[0]<x.size()-2) && x[2+x[0]]==x[1] && (x[1]>=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; i<x.size()-2; i++) c[i]=channel(home,x[2+i]); element(home, c, x[0], channel(home,x[1])); } };
/// %Test for element with Boolean variable array and integer variable class VarBoolInt : public Test { protected: /// Integer result int r; public: /// Create and register test VarBoolInt(int r0) : Test("Element::Var::Bool::Int::"+str(r0),5,-1,3,false), r(r0) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { for (int i=0; i<x.size()-1; i++) if ((x[1+i] < 0) || (x[1+i]>1)) return false; return ((x[0]>= 0) && (x[0]<x.size()-1) && x[1+x[0]]==r); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; BoolVarArgs c(x.size()-1); for (int i=0; i<x.size()-1; i++) c[i]=channel(home,x[1+i]); if (r == 1) { switch (_rand(3)) { case 0: element(home, c, x[0], 1); break; case 1: { BoolVar one(home,1,1); rel(home, element(c,x[0]) == one); } break; case 2: rel(home, element(c,x[0])); break; default: GECODE_NEVER; } } else { element(home, c, x[0], r); } } };
/// %Test for matrix element with integer array and integer variable class MatrixIntIntVarXY : public Test { protected: /// Array for test matrix Gecode::IntArgs tm; public: /// Create and register test MatrixIntIntVarXY(void) : Test("Element::Matrix::Int::IntVar::XY",3,0,5,false), tm({0,1,2,3,4,5}) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; if ((x[0] > 2) || (x[1] > 1)) return false; Matrix<IntArgs> m(tm,3,2); return m(x[0],x[1]) == x[2]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; Matrix<IntArgs> m(tm,3,2); element(home, m, x[0], x[1], x[2]); } };
/// %Test for matrix element with integer array and integer variable class MatrixIntIntVarXX : public Test { protected: /// Array for test matrix Gecode::IntArgs tm; public: /// Create and register test MatrixIntIntVarXX(void) : Test("Element::Matrix::Int::IntVar::XX",2,0,3,false), tm({0,1,2,3}) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] using namespace Gecode; if (x[0] > 1) return false; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[0]) == x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] using namespace Gecode; Matrix<IntArgs> m(tm,2,2); element(home, m, x[0], x[0], x[1]); } };
/// %Test for matrix element with integer array and Boolean variable class MatrixIntBoolVarXY : public Test { protected: /// Array for test matrix Gecode::IntArgs tm; public: /// Create and register test MatrixIntBoolVarXY(void) : Test("Element::Matrix::Int::BoolVar::XY",3,0,3,false), tm({0,1,1,0}) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; if ((x[0] > 1) || (x[1] > 1)) return false; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[1]) == x[2]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; Matrix<IntArgs> m(tm,2,2); element(home, m, x[0], x[1], channel(home,x[2])); } };
/// %Test for matrix element with integer array and Boolean variable class MatrixIntBoolVarXX : public Test { protected: /// Array for test matrix Gecode::IntArgs tm; public: /// Create and register test MatrixIntBoolVarXX(void) : Test("Element::Matrix::Int::BoolVar::XX",2,0,3,false), tm({0,1,1,0}) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] using namespace Gecode; if (x[0] > 1) return false; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[0]) == x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] using namespace Gecode; Matrix<IntArgs> m(tm,2,2); element(home, m, x[0], x[0], channel(home,x[1])); } };
/// %Test for matrix element with integer variable array and integer variable class MatrixIntVarIntVarXY : public Test { public: /// Create and register test MatrixIntVarIntVarXY(void) : Test("Element::Matrix::IntVar::IntVar::XY",3+4,0,3,false) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] // remaining: matrix using namespace Gecode; if ((x[0] > 1) || (x[1] > 1)) return false; IntArgs tm(4); tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6]; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[1]) == x[2]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; IntVarArgs tm(4); tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6]; Matrix<IntVarArgs> m(tm,2,2); element(home, m, x[0], x[1], x[2]); } };
/// %Test for matrix element with integer variable array and integer variable class MatrixIntVarIntVarXX : public Test { public: /// Create and register test MatrixIntVarIntVarXX(void) : Test("Element::Matrix::IntVar::IntVar::XX",2+4,0,3,false) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] // remaining: matrix using namespace Gecode; if (x[0] > 1) return false; IntArgs tm(4); tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5]; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[0]) == x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[1] using namespace Gecode; IntVarArgs tm(4); tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5]; Matrix<IntVarArgs> m(tm,2,2); element(home, m, x[0], x[0], x[1]); } };
/// %Test for matrix element with Boolean variable array and Boolean variable class MatrixBoolVarBoolVarXY : public Test { public: /// Create and register test MatrixBoolVarBoolVarXY(void) : Test("Element::Matrix::BoolVar::BoolVar::XY",3+4,0,1,false) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] // remaining: matrix using namespace Gecode; IntArgs tm(4); tm[0]=x[3]; tm[1]=x[4]; tm[2]=x[5]; tm[3]=x[6]; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[1]) == x[2]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[2] using namespace Gecode; BoolVarArgs tm(4); tm[0]=channel(home,x[3]); tm[1]=channel(home,x[4]); tm[2]=channel(home,x[5]); tm[3]=channel(home,x[6]); Matrix<BoolVarArgs> m(tm,2,2); element(home, m, x[0], x[1], channel(home,x[2])); } };
/// %Test for matrix element with Boolean variable array and Boolean variable class MatrixBoolVarBoolVarXX : public Test { public: /// Create and register test MatrixBoolVarBoolVarXX(void) : Test("Element::Matrix::BoolVar::BoolVar::XX",2+4,0,1,false) {} /// %Test whether \a x is solution virtual bool solution(const Assignment& x) const { // x-coordinate: x[0], y-coordinate: x[0], result: x[1] // remaining: matrix using namespace Gecode; IntArgs tm(4); tm[0]=x[2]; tm[1]=x[3]; tm[2]=x[4]; tm[3]=x[5]; Matrix<IntArgs> m(tm,2,2); return m(x[0],x[0]) == x[1]; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { // x-coordinate: x[0], y-coordinate: x[1], result: x[1] using namespace Gecode; BoolVarArgs tm(4); tm[0]=channel(home,x[2]); tm[1]=channel(home,x[3]); tm[2]=channel(home,x[4]); tm[3]=channel(home,x[5]); Matrix<BoolVarArgs> m(tm,2,2); element(home, m, x[0], x[0], channel(home,x[1])); } };
/// Help class to create and register tests class Create { public: /// %Test size-dependent optimizations void optimized(int idx, int val) { Gecode::IntArgs c(idx); for (int i=0; i<idx; i++) c[i]=std::max(val-i,0); (void) new IntIntVar(Test::str(idx)+"::"+Test::str(val)+"::val",c, val-8,val-1); if (idx != val) (void) new IntIntVar(Test::str(idx)+"::"+Test::str(val)+"::idx",c, idx-8,idx-1); } /// Perform creation and registration Create(void) { using namespace Gecode; IntArgs ic1({-1,1,-3,3,-4}); IntArgs ic2({-1,1,-1,1,-1,1,0,0}); IntArgs ic3({-1}); IntArgs ic4({0,-1,2,-2,4,-3,6}); IntArgs ic5({0,0,1,2,3,4});
IntArgs bc1({0,1,1,0,1}); IntArgs bc2({1,1,0,1,0,1,0,0}); IntArgs bc3({1});
(void) new IntIntVar("A",ic1,-8,8); (void) new IntIntVar("B",ic2,-8,8); (void) new IntIntVar("C",ic3,-8,8); (void) new IntIntVar("D",ic4,-8,8);
// Test optimizations { int ov[] = { SCHAR_MAX-1,SCHAR_MAX, SHRT_MAX-1,SHRT_MAX, 0 }; for (int i=0; ov[i] != 0; i++) for (int j=0; ov[j] != 0; j++) optimized(ov[i],ov[j]); }
for (int i=-4; i<=4; i++) { (void) new IntIntInt("A",ic1,i); (void) new IntIntInt("B",ic2,i); (void) new IntIntInt("C",ic3,i); (void) new IntIntInt("D",ic4,i); }
(void) new IntIntShared("A",ic1); (void) new IntIntShared("B",ic2); (void) new IntIntShared("C",ic3); (void) new IntIntShared("D",ic4); (void) new IntIntShared("E",ic5,1);
(void) new IntBoolVar("A",bc1); (void) new IntBoolVar("B",bc2); (void) new IntBoolVar("C",bc3);
for (int i=0; i<=1; i++) { (void) new IntBoolInt("A",bc1,i); (void) new IntBoolInt("B",bc2,i); (void) new IntBoolInt("C",bc3,i); }
(void) new VarIntVar(IPL_BND); (void) new VarIntVar(IPL_DOM);
for (int i=-4; i<=4; i++) { (void) new VarIntInt(IPL_BND,i); (void) new VarIntInt(IPL_DOM,i); }
(void) new VarIntShared(IPL_BND); (void) new VarIntShared(IPL_DOM);
(void) new VarBoolVar(); (void) new VarBoolInt(0); (void) new VarBoolInt(1);
// Matrix tests (void) new MatrixIntIntVarXY(); (void) new MatrixIntIntVarXX(); (void) new MatrixIntBoolVarXY(); (void) new MatrixIntBoolVarXX();
(void) new MatrixIntVarIntVarXY(); (void) new MatrixIntVarIntVarXX(); (void) new MatrixBoolVarBoolVarXY(); (void) new MatrixBoolVarBoolVarXX(); } };
Create c; //@}
}}}
// STATISTICS: test-int