Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.6 kB · 190 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191/* -*- 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/linear.hh>
namespace Gecode {
using namespace Int;
void linear(Home home, const IntVarArgs& x, IntRelType irt, int c, IntPropLevel ipl) { GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()); for (int i=0; i<x.size(); i++) { t[i].a=1; t[i].x=x[i]; } Linear::post(home,t,x.size(),irt,c,ipl); }
void linear(Home home, const IntVarArgs& x, IntRelType irt, int c, Reify r, IntPropLevel) { GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()); for (int i=0; i<x.size(); i++) { t[i].a=1; t[i].x=x[i]; } Linear::post(home,t,x.size(),irt,c,r); }
void linear(Home home, const IntArgs& a, const IntVarArgs& x, IntRelType irt, int c, IntPropLevel ipl) { if (a.size() != x.size()) throw ArgumentSizeMismatch("Int::linear"); GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()); for (int i=0; i<x.size(); i++) { t[i].a=a[i]; t[i].x=x[i]; } Linear::post(home,t,x.size(),irt,c,ipl); }
void linear(Home home, const IntArgs& a, const IntVarArgs& x, IntRelType irt, int c, Reify r, IntPropLevel) { if (a.size() != x.size()) throw ArgumentSizeMismatch("Int::linear"); GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()); for (int i=0; i<x.size(); i++) { t[i].a=a[i]; t[i].x=x[i]; } Linear::post(home,t,x.size(),irt,c,r); }
void linear(Home home, const IntVarArgs& x, IntRelType irt, IntVar y, IntPropLevel ipl) { GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()+1); for (int i=0; i<x.size(); i++) { t[i].a=1; t[i].x=x[i]; } int min, max; estimate(t,x.size(),0,min,max); IntView v(y); switch (irt) { case IRT_EQ: GECODE_ME_FAIL(v.gq(home,min)); GECODE_ME_FAIL(v.lq(home,max)); break; case IRT_GQ: GECODE_ME_FAIL(v.lq(home,max)); break; case IRT_LQ: GECODE_ME_FAIL(v.gq(home,min)); break; default: ; } if (home.failed()) return; t[x.size()].a=-1; t[x.size()].x=y; Linear::post(home,t,x.size()+1,irt,0,ipl); }
void linear(Home home, const IntVarArgs& x, IntRelType irt, IntVar y, Reify r, IntPropLevel) { GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()+1); for (int i=0; i<x.size(); i++) { t[i].a=1; t[i].x=x[i]; } t[x.size()].a=-1; t[x.size()].x=y; Linear::post(home,t,x.size()+1,irt,0,r); }
void linear(Home home, const IntArgs& a, const IntVarArgs& x, IntRelType irt, IntVar y, IntPropLevel ipl) { if (a.size() != x.size()) throw ArgumentSizeMismatch("Int::linear"); GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()+1); for (int i=0; i<x.size(); i++) { t[i].a=a[i]; t[i].x=x[i]; } int min, max; estimate(t,x.size(),0,min,max); IntView v(y); switch (irt) { case IRT_EQ: GECODE_ME_FAIL(v.gq(home,min)); GECODE_ME_FAIL(v.lq(home,max)); break; case IRT_GQ: GECODE_ME_FAIL(v.lq(home,max)); break; case IRT_LQ: GECODE_ME_FAIL(v.gq(home,min)); break; default: ; } if (home.failed()) return; t[x.size()].a=-1; t[x.size()].x=y; Linear::post(home,t,x.size()+1,irt,0,ipl); }
void linear(Home home, const IntArgs& a, const IntVarArgs& x, IntRelType irt, IntVar y, Reify r, IntPropLevel) { if (a.size() != x.size()) throw ArgumentSizeMismatch("Int::linear"); GECODE_POST; Region re; Linear::Term<IntView>* t = re.alloc<Linear::Term<IntView>>(x.size()+1); for (int i=0; i<x.size(); i++) { t[i].a=a[i]; t[i].x=x[i]; } t[x.size()].a=-1; t[x.size()].x=y; Linear::post(home,t,x.size()+1,irt,0,r); }
}
// STATISTICS: int-post