Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.4 kB · 230 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2006 * * 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 channel constraints namespace Channel {
/** * \defgroup TaskTestIntChannel Channel constraints * \ingroup TaskTestInt */ //@{ /// Simple test for channel (testing all variables) class ChannelFull : public Test { private: int xoff; //< Offset for the x variables int yoff; //< Offset for the y variables public: /// Construct and register test ChannelFull(int xoff0, int yoff0, Gecode::IntPropLevel ipl) : Test("Channel::Full::"+str(xoff0)+"::"+str(yoff0)+"::"+str(ipl), 8,0,3,false,ipl), xoff(xoff0), yoff(yoff0) { contest = CTL_NONE; } /// Check whether \a x is solution virtual bool solution(const Assignment& x) const { for (int i=0; i<4; i++) if (x[4+x[i]] != i) return false; return true; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; IntVarArgs xa(4); IntVarArgs ya(4); for (int i=4; i--; ) { if (xoff != 0) { IntVar xo(home, xoff, 3+xoff); Gecode::rel(home, x[i] == xo-xoff); xa[i] = xo; } else { xa[i] = x[i]; } if (yoff != 0) { IntVar yo(home, yoff, 3+yoff); Gecode::rel(home, x[4+i] == yo-yoff); ya[i] = yo; } else { ya[i] = x[4+i]; } } channel(home, xa, xoff, ya, yoff, ipl); } };
/// Simple test for channel (testing single set of variables) class ChannelHalf : public Test { public: /// Construct and register test ChannelHalf(Gecode::IntPropLevel ipl) : Test("Channel::Half::"+str(ipl),6,0,5,false,ipl) { contest = CTL_NONE; } /// Check whether \a x is solution virtual bool solution(const Assignment& x) const { for (int i=0; i<6; i++) for (int j=i+1; j<6; j++) if (x[i] == x[j]) return false; return true; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; Gecode::IntVarArgs y(home,6,dom); for (int i=0; i<6; i++) for (int j=0; j<6; j++) { Gecode::BoolVar b(home,0,1); rel(home, x[i], Gecode::IRT_EQ, j, b); rel(home, y[j], Gecode::IRT_EQ, i, b); } channel(home, x, y, ipl); } };
/// %Test channel with shared variables class ChannelShared : public Test { public: /// Construct and register test ChannelShared(Gecode::IntPropLevel ipl) : Test("Channel::Shared::"+str(ipl),6,0,5,false,ipl) { contest = CTL_NONE; } /// Check whether \a x is solution virtual bool solution(const Assignment& x) const { for (int i=0; i<6; i++) if (x[x[i]] != i) return false; return true; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; channel(home, x, x, ipl); } };
/// %Test channel between integer and Boolean variable class ChannelLinkSingle : public Test { public: /// Construct and register test ChannelLinkSingle(void) : Test("Channel::Bool::Single",2,-1,2) { contest = CTL_NONE; } /// Check whether \a x is solution virtual bool solution(const Assignment& x) const { return ((x[0]==0) || (x[0]==1)) && (x[0]==x[1]); } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; Gecode::BoolVar b(home,0,1); channel(home, x[0], b); channel(home, x[1], b); } };
/// %Test channel between integer variable and array of Boolean variables class ChannelLinkMulti : public Test { private: int o; public: /// Construct and register test ChannelLinkMulti(const std::string& s, int min, int max, int o0) : Test("Channel::Bool::Multi::"+s,7,min,max), o(o0) { } /// Check whether \a x is solution virtual bool solution(const Assignment& x) const { int n = x.size()-1; for (int i=n; i--; ) if ((x[i] != 0) && (x[i] != 1)) return false; int k=x[n]-o; if ((k<0) || (k>=n)) return false; for (int i=0; i<k; i++) if (x[i] != 0) return false; for (int i=k+1; i<n; i++) if (x[i] != 0) return false; return x[k] == 1; } /// Post constraint on \a x virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) { using namespace Gecode; int n=x.size()-1; Gecode::BoolVarArgs b(n); for (int i=n; i--; ) b[i]=channel(home,x[i]); channel(home, b, x[n], o); } };
ChannelFull cfd(0,0,Gecode::IPL_DOM); ChannelFull cfv(0,0,Gecode::IPL_VAL);
ChannelFull cfd11(1,1,Gecode::IPL_DOM); ChannelFull cfv11(1,1,Gecode::IPL_VAL);
ChannelFull cfd35(3,5,Gecode::IPL_DOM); ChannelFull cfv35(3,5,Gecode::IPL_VAL);
ChannelHalf chd(Gecode::IPL_DOM); ChannelHalf chv(Gecode::IPL_VAL);
ChannelShared csd(Gecode::IPL_DOM); ChannelShared csv(Gecode::IPL_VAL);
ChannelLinkSingle cls;
ChannelLinkMulti clma("A", 0, 5, 0); ChannelLinkMulti clmb("B", 1, 6, 1); ChannelLinkMulti clmc("C",-1, 4,-1); //@}
}}}
// STATISTICS: test-int