Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
13 kB · 413 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2002 * * 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 <gecode/int/count.hh>#include <gecode/int/rel.hh>
namespace Gecode {
void count(Home home, const IntVarArgs& x, int n, IntRelType irt, int m, IntPropLevel) { using namespace Int; Limits::check(n,"Int::count"); Limits::check(m,"Int::count");
GECODE_POST;
ViewArray<IntView> xv(home,x); ConstIntView y(n);
switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqInt<IntView,ConstIntView> ::post(home,xv,y,m))); break; case IRT_NQ: { IntVar z(home,0,x.size()); GECODE_ME_FAIL(IntView(z).nq(home,m)); GECODE_ES_FAIL((Count::EqView<IntView,ConstIntView,IntView,true,false> ::post(home,xv,y,z,0))); } break; case IRT_LE: m--; // FALL THROUGH case IRT_LQ: GECODE_ES_FAIL((Count::LqInt<IntView,ConstIntView> ::post(home,xv,y,m))); break; case IRT_GR: m++; // FALL THROUGH case IRT_GQ: GECODE_ES_FAIL((Count::GqInt<IntView,ConstIntView> ::post(home,xv,y,m))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, IntVar y, IntRelType irt, int m, IntPropLevel ipl) { using namespace Int; Limits::check(m,"Int::count"); GECODE_POST; ViewArray<IntView> xv(home,x);
switch (irt) { case IRT_EQ: { ConstIntView z(m); if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) GECODE_ES_FAIL((Count::EqView<IntView,IntView,ConstIntView,true,true> ::post(home,xv,y,z,0))); else GECODE_ES_FAIL((Count::EqView<IntView,IntView,ConstIntView,true,false> ::post(home,xv,y,z,0))); } break; case IRT_NQ: { IntVar z(home,0,x.size()); GECODE_ME_FAIL(IntView(z).nq(home,m)); GECODE_ES_FAIL((Count::EqView<IntView,IntView,IntView,true,false> ::post(home,xv,y,z,0))); } break; case IRT_LE: m--; // FALL THROUGH case IRT_LQ: GECODE_ES_FAIL((Count::LqInt<IntView,IntView> ::post(home,xv,y,m))); break; case IRT_GR: m++; // FALL THROUGH case IRT_GQ: { ConstIntView z(m); if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) GECODE_ES_FAIL((Count::GqView<IntView,IntView,ConstIntView,true,true> ::post(home,xv,y,z,0))); else GECODE_ES_FAIL((Count::GqView<IntView,IntView,ConstIntView,true,false> ::post(home,xv,y,z,0))); } break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, const IntSet& y, IntRelType irt, int m, IntPropLevel) { using namespace Int;
if (y.size() == 1) { count(home,x,y.min(),irt,m); return; }
Limits::check(y.min(),"Int::count"); Limits::check(y.max(),"Int::count"); Limits::check(m,"Int::count");
GECODE_POST;
ViewArray<IntView> xv(home,x); switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqInt<IntView,IntSet>::post(home,xv,y,m))); break; case IRT_NQ: { IntVar z(home,0,x.size()); GECODE_ME_FAIL(IntView(z).nq(home,m)); GECODE_ES_FAIL((Count::EqView<IntView,IntSet,IntView,true,false> ::post(home,xv,y,z,0))); } break; case IRT_LE: m--; // FALL THROUGH case IRT_LQ: GECODE_ES_FAIL((Count::LqInt<IntView,IntSet>::post(home,xv,y,m))); break; case IRT_GR: m++; // FALL THROUGH case IRT_GQ: GECODE_ES_FAIL((Count::GqInt<IntView,IntSet>::post(home,xv,y,m))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, const IntArgs& y, IntRelType irt, int m, IntPropLevel) { using namespace Int; if (x.size() != y.size()) throw ArgumentSizeMismatch("Int::count"); Limits::check(m,"Int::count"); GECODE_POST;
ViewArray<OffsetView> xy(home,x.size()); for (int i=0; i<x.size(); i++) xy[i] = OffsetView(x[i],-y[i]);
ZeroIntView zero; switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqInt<OffsetView,ZeroIntView> ::post(home,xy,zero,m))); break; case IRT_NQ: { IntVar z(home,0,x.size()); GECODE_ME_FAIL(IntView(z).nq(home,m)); GECODE_ES_FAIL((Count::EqView<OffsetView,ZeroIntView,IntView,true,false> ::post(home,xy,zero,z,0))); } break; case IRT_LE: m--; // FALL THROUGH case IRT_LQ: GECODE_ES_FAIL((Count::LqInt<OffsetView,ZeroIntView> ::post(home,xy,zero,m))); break; case IRT_GR: m++; // FALL THROUGH case IRT_GQ: GECODE_ES_FAIL((Count::GqInt<OffsetView,ZeroIntView> ::post(home,xy,zero,m))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, int n, IntRelType irt, IntVar z, IntPropLevel) { using namespace Int; Limits::check(n,"Int::count"); GECODE_POST; ViewArray<IntView> xv(home,x); ConstIntView yv(n); switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqView<IntView,ConstIntView,IntView,true,false> ::post(home,xv,yv,z,0))); break; case IRT_NQ: { IntVar nz(home,0,x.size()); GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,z,nz))); GECODE_ES_FAIL((Count::EqView<IntView,ConstIntView,IntView,true,false> ::post(home,xv,yv,nz,0))); } break; case IRT_LE: GECODE_ES_FAIL((Count::LqView<IntView,ConstIntView,IntView,true> ::post(home,xv,yv,z,-1))); break; case IRT_LQ: GECODE_ES_FAIL((Count::LqView<IntView,ConstIntView,IntView,true> ::post(home,xv,yv,z,0))); break; case IRT_GR: GECODE_ES_FAIL((Count::GqView<IntView,ConstIntView,IntView,true,false> ::post(home,xv,yv,z,1))); break; case IRT_GQ: GECODE_ES_FAIL((Count::GqView<IntView,ConstIntView,IntView,true,false> ::post(home,xv,yv,z,0))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, IntVar y, IntRelType irt, IntVar z, IntPropLevel ipl) { using namespace Int; GECODE_POST; ViewArray<IntView> xv(home,x); switch (irt) { case IRT_EQ: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) GECODE_ES_FAIL((Count::EqView<IntView,IntView,IntView,true,true> ::post(home,xv,y,z,0))); else GECODE_ES_FAIL((Count::EqView<IntView,IntView,IntView,true,false> ::post(home,xv,y,z,0))); break; case IRT_NQ: { IntVar nz(home,0,x.size()); GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,z,nz))); GECODE_ES_FAIL((Count::EqView<IntView,IntView,IntView,true,false> ::post(home,xv,y,nz,0))); } break; case IRT_LE: GECODE_ES_FAIL((Count::LqView<IntView,IntView,IntView,true> ::post(home,xv,y,z,-1))); break; case IRT_LQ: GECODE_ES_FAIL((Count::LqView<IntView,IntView,IntView,true> ::post(home,xv,y,z,0))); break; case IRT_GR: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) GECODE_ES_FAIL((Count::GqView<IntView,IntView,IntView,true,true> ::post(home,xv,y,z,1))); else GECODE_ES_FAIL((Count::GqView<IntView,IntView,IntView,true,false> ::post(home,xv,y,z,1))); break; case IRT_GQ: if ((vbd(ipl) == IPL_DOM) || (vbd(ipl) == IPL_DEF)) GECODE_ES_FAIL((Count::GqView<IntView,IntView,IntView,true,true> ::post(home,xv,y,z,0))); else GECODE_ES_FAIL((Count::GqView<IntView,IntView,IntView,true,false> ::post(home,xv,y,z,0))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, const IntSet& y, IntRelType irt, IntVar z, IntPropLevel) { using namespace Int;
if (y.size() == 1) { count(home,x,y.min(),irt,z); return; }
Limits::check(y.min(),"Int::count"); Limits::check(y.max(),"Int::count");
GECODE_POST; ViewArray<IntView> xv(home,x); switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqView<IntView,IntSet,IntView,true,false> ::post(home,xv,y,z,0))); break; case IRT_NQ: { IntVar nz(home,0,x.size()); GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,z,nz))); GECODE_ES_FAIL((Count::EqView<IntView,IntSet,IntView,true,false> ::post(home,xv,y,nz,0))); } break; case IRT_LE: GECODE_ES_FAIL((Count::LqView<IntView,IntSet,IntView,true> ::post(home,xv,y,z,-1))); break; case IRT_LQ: GECODE_ES_FAIL((Count::LqView<IntView,IntSet,IntView,true> ::post(home,xv,y,z,0))); break; case IRT_GR: GECODE_ES_FAIL((Count::GqView<IntView,IntSet,IntView,true,false> ::post(home,xv,y,z,1))); break; case IRT_GQ: GECODE_ES_FAIL((Count::GqView<IntView,IntSet,IntView,true,false> ::post(home,xv,y,z,0))); break; default: throw UnknownRelation("Int::count"); } }
void count(Home home, const IntVarArgs& x, const IntArgs& y, IntRelType irt, IntVar z, IntPropLevel) { using namespace Int; if (x.size() != y.size()) throw ArgumentSizeMismatch("Int::count"); GECODE_POST;
ViewArray<OffsetView> xy(home,x.size()); for (int i=0; i<x.size(); i++) xy[i] = OffsetView(x[i],-y[i]);
ZeroIntView u; switch (irt) { case IRT_EQ: GECODE_ES_FAIL((Count::EqView<OffsetView,ZeroIntView,IntView,true,false> ::post(home,xy,u,z,0))); break; case IRT_NQ: { IntVar nz(home,0,x.size()); GECODE_ES_FAIL((Rel::Nq<IntView,IntView>::post(home,z,nz))); GECODE_ES_FAIL((Count::EqView<OffsetView,ZeroIntView,IntView,true,false> ::post(home,xy,u,nz,0))); } break; case IRT_LE: GECODE_ES_FAIL((Count::LqView<OffsetView,ZeroIntView,IntView,true> ::post(home,xy,u,z,-1))); break; case IRT_LQ: GECODE_ES_FAIL((Count::LqView<OffsetView,ZeroIntView,IntView,true> ::post(home,xy,u,z,0))); break; case IRT_GR: GECODE_ES_FAIL((Count::GqView<OffsetView,ZeroIntView,IntView,true,false> ::post(home,xy,u,z,1))); break; case IRT_GQ: GECODE_ES_FAIL((Count::GqView<OffsetView,ZeroIntView,IntView,true,false> ::post(home,xy,u,z,0))); break; default: throw UnknownRelation("Int::count"); } }
}
// STATISTICS: int-post