Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
20 kB · 731 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Tias Guns <tias.guns@cs.kuleuven.be> * * Copyright: * Christian Schulte, 2002 * Tias Guns, 2009 * * 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>#include <gecode/int/div.hh>
namespace Gecode { namespace Int { namespace Linear {
/// Eliminate assigned views forceinline void eliminate(Term<BoolView>* t, int &n, long long int& d) { for (int i=n; i--; ) if (t[i].x.one()) { d -= t[i].a; t[i]=t[--n]; } else if (t[i].x.zero()) { t[i]=t[--n]; } Limits::check(d,"Int::linear"); }
/// Rewrite non-strict relations forceinline void rewrite(IntRelType &r, long long int &d) { switch (r) { case IRT_EQ: case IRT_NQ: case IRT_LQ: case IRT_GQ: break; case IRT_LE: d--; r = IRT_LQ; break; case IRT_GR: d++; r = IRT_GQ; break; default: throw UnknownRelation("Int::linear"); } }
forceinline void post_pos_unit(Home home, Term<BoolView>* t_p, int n_p, IntRelType irt, IntView y, int c) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((EqBoolView<BoolView,IntView> ::post(home,x,y,c))); } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((NqBoolView<BoolView,IntView> ::post(home,x,y,c))); } break; case IRT_GQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((GqBoolView<BoolView,IntView> ::post(home,x,y,c))); } break; case IRT_LQ: { ViewArray<NegBoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=NegBoolView(t_p[i].x); MinusView z(y); GECODE_ES_FAIL((GqBoolView<NegBoolView,MinusView> ::post(home,x,z,n_p-c))); } break; default: GECODE_NEVER; } }
forceinline void post_pos_unit(Home home, Term<BoolView>* t_p, int n_p, IntRelType irt, ZeroIntView, int c) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((EqBoolInt<BoolView>::post(home,x,c))); } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((NqBoolInt<BoolView>::post(home,x,c))); } break; case IRT_GQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; GECODE_ES_FAIL((GqBoolInt<BoolView>::post(home,x,c))); } break; case IRT_LQ: { ViewArray<NegBoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=NegBoolView(t_p[i].x); GECODE_ES_FAIL((GqBoolInt<NegBoolView>::post(home,x,n_p-c))); } break; default: GECODE_NEVER; } }
forceinline void post_pos_unit(Home home, Term<BoolView>* t_p, int n_p, IntRelType irt, int c, Reify r, IntPropLevel) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_EQV>:: post(home,x,c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_IMP>:: post(home,x,c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_PMI>:: post(home,x,c,r.var()))); break; default: GECODE_NEVER; } } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; NegBoolView nb(r.var()); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_EQV>:: post(home,x,c,nb))); break; case RM_IMP: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_PMI>:: post(home,x,c,nb))); break; case RM_PMI: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_IMP>:: post(home,x,c,nb))); break; default: GECODE_NEVER; } } break; case IRT_GQ: { ViewArray<BoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=t_p[i].x; switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_EQV>:: post(home,x,c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_IMP>:: post(home,x,c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_PMI>:: post(home,x,c,r.var()))); break; default: GECODE_NEVER; } } break; case IRT_LQ: { ViewArray<NegBoolView> x(home,n_p); for (int i=0; i<n_p; i++) x[i]=NegBoolView(t_p[i].x); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_EQV>:: post(home,x,n_p-c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_IMP>:: post(home,x,n_p-c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_PMI>:: post(home,x,n_p-c,r.var()))); break; default: GECODE_NEVER; } } break; default: GECODE_NEVER; } }
forceinline void post_neg_unit(Home home, Term<BoolView>* t_n, int n_n, IntRelType irt, IntView y, int c) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; MinusView z(y); GECODE_ES_FAIL((EqBoolView<BoolView,MinusView> ::post(home,x,z,-c))); } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; MinusView z(y); GECODE_ES_FAIL((NqBoolView<BoolView,MinusView> ::post(home,x,z,-c))); } break; case IRT_GQ: { ViewArray<NegBoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=NegBoolView(t_n[i].x); GECODE_ES_FAIL((GqBoolView<NegBoolView,IntView> ::post(home,x,y,n_n+c))); } break; case IRT_LQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; MinusView z(y); GECODE_ES_FAIL((GqBoolView<BoolView,MinusView> ::post(home,x,z,-c))); } break; default: GECODE_NEVER; } }
forceinline void post_neg_unit(Home home, Term<BoolView>* t_n, int n_n, IntRelType irt, ZeroIntView, int c) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; GECODE_ES_FAIL((EqBoolInt<BoolView>::post(home,x,-c))); } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; GECODE_ES_FAIL((NqBoolInt<BoolView>::post(home,x,-c))); } break; case IRT_GQ: { ViewArray<NegBoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=NegBoolView(t_n[i].x); GECODE_ES_FAIL((GqBoolInt<NegBoolView>::post(home,x,n_n+c))); } break; case IRT_LQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; GECODE_ES_FAIL((GqBoolInt<BoolView>::post(home,x,-c))); } break; default: GECODE_NEVER; } }
forceinline void post_neg_unit(Home home, Term<BoolView>* t_n, int n_n, IntRelType irt, int c, Reify r, IntPropLevel) { switch (irt) { case IRT_EQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_EQV>:: post(home,x,-c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_IMP>:: post(home,x,-c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReEqBoolInt<BoolView,BoolView,RM_PMI>:: post(home,x,-c,r.var()))); break; default: GECODE_NEVER; } } break; case IRT_NQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; NegBoolView nb(r.var()); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_EQV>:: post(home,x,-c,nb))); break; case RM_IMP: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_PMI>:: post(home,x,-c,nb))); break; case RM_PMI: GECODE_ES_FAIL((ReEqBoolInt<BoolView,NegBoolView,RM_IMP>:: post(home,x,-c,nb))); break; default: GECODE_NEVER; } } break; case IRT_GQ: { ViewArray<NegBoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=NegBoolView(t_n[i].x); switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_EQV>:: post(home,x,n_n+c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_IMP>:: post(home,x,n_n+c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReGqBoolInt<NegBoolView,BoolView,RM_PMI>:: post(home,x,n_n+c,r.var()))); break; default: GECODE_NEVER; } } break; case IRT_LQ: { ViewArray<BoolView> x(home,n_n); for (int i=0; i<n_n; i++) x[i]=t_n[i].x; switch (r.mode()) { case RM_EQV: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_EQV>:: post(home,x,-c,r.var()))); break; case RM_IMP: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_IMP>:: post(home,x,-c,r.var()))); break; case RM_PMI: GECODE_ES_FAIL((ReGqBoolInt<BoolView,BoolView,RM_PMI>:: post(home,x,-c,r.var()))); break; default: GECODE_NEVER; } } break; default: GECODE_NEVER; } }
forceinline void post_mixed(Home home, Term<BoolView>* t_p, int n_p, Term<BoolView>* t_n, int n_n, IntRelType irt, IntView y, int c) { ScaleBoolArray b_p(home,n_p); { ScaleBool* f=b_p.fst(); for (int i=0; i<n_p; i++) { f[i].x=t_p[i].x; f[i].a=t_p[i].a; } } ScaleBoolArray b_n(home,n_n); { ScaleBool* f=b_n.fst(); for (int i=0; i<n_n; i++) { f[i].x=t_n[i].x; f[i].a=t_n[i].a; } } switch (irt) { case IRT_EQ: GECODE_ES_FAIL((EqBoolScale<ScaleBoolArray,ScaleBoolArray,IntView> ::post(home,b_p,b_n,y,c))); break; case IRT_NQ: GECODE_ES_FAIL((NqBoolScale<ScaleBoolArray,ScaleBoolArray,IntView> ::post(home,b_p,b_n,y,c))); break; case IRT_LQ: GECODE_ES_FAIL((LqBoolScale<ScaleBoolArray,ScaleBoolArray,IntView> ::post(home,b_p,b_n,y,c))); break; case IRT_GQ: { MinusView m(y); GECODE_ES_FAIL((LqBoolScale<ScaleBoolArray,ScaleBoolArray,MinusView> ::post(home,b_n,b_p,m,-c))); } break; default: GECODE_NEVER; } }
forceinline void post_mixed(Home home, Term<BoolView>* t_p, int n_p, Term<BoolView>* t_n, int n_n, IntRelType irt, ZeroIntView y, int c) { ScaleBoolArray b_p(home,n_p); { ScaleBool* f=b_p.fst(); for (int i=0; i<n_p; i++) { f[i].x=t_p[i].x; f[i].a=t_p[i].a; } } ScaleBoolArray b_n(home,n_n); { ScaleBool* f=b_n.fst(); for (int i=0; i<n_n; i++) { f[i].x=t_n[i].x; f[i].a=t_n[i].a; } } switch (irt) { case IRT_EQ: GECODE_ES_FAIL( (EqBoolScale<ScaleBoolArray,ScaleBoolArray,ZeroIntView> ::post(home,b_p,b_n,y,c))); break; case IRT_NQ: GECODE_ES_FAIL( (NqBoolScale<ScaleBoolArray,ScaleBoolArray,ZeroIntView> ::post(home,b_p,b_n,y,c))); break; case IRT_LQ: GECODE_ES_FAIL( (LqBoolScale<ScaleBoolArray,ScaleBoolArray,ZeroIntView> ::post(home,b_p,b_n,y,c))); break; case IRT_GQ: GECODE_ES_FAIL( (LqBoolScale<ScaleBoolArray,ScaleBoolArray,ZeroIntView> ::post(home,b_n,b_p,y,-c))); break; default: GECODE_NEVER; } }
template<class View> forceinline void post_all(Home home, Term<BoolView>* t, int n, IntRelType irt, View x, int c) {
Limits::check(c,"Int::linear");
long long int d = c;
eliminate(t,n,d);
Term<BoolView> *t_p, *t_n; int n_p, n_n, gcd=0; bool unit = normalize<BoolView>(t,n,t_p,n_p,t_n,n_n,gcd);
rewrite(irt,d);
c = static_cast<int>(d);
if (n == 0) { switch (irt) { case IRT_EQ: GECODE_ME_FAIL(x.eq(home,-c)); break; case IRT_NQ: GECODE_ME_FAIL(x.nq(home,-c)); break; case IRT_GQ: GECODE_ME_FAIL(x.lq(home,-c)); break; case IRT_LQ: GECODE_ME_FAIL(x.gq(home,-c)); break; default: GECODE_NEVER; } return; }
// Check for overflow { long long int sl = static_cast<long long int>(x.max())+c; long long int su = static_cast<long long int>(x.min())+c; for (int i=0; i<n_p; i++) su -= t_p[i].a; for (int i=0; i<n_n; i++) sl += t_n[i].a; Limits::check(sl,"Int::linear"); Limits::check(su,"Int::linear"); }
if (unit && (n_n == 0)) { /// All coefficients are 1 post_pos_unit(home,t_p,n_p,irt,x,c); } else if (unit && (n_p == 0)) { // All coefficients are -1 post_neg_unit(home,t_n,n_n,irt,x,c); } else { // Mixed coefficients post_mixed(home,t_p,n_p,t_n,n_n,irt,x,c); } }
void post(Home home, Term<BoolView>* t, int n, IntRelType irt, IntView x, int c, IntPropLevel) { post_all(home,t,n,irt,x,c); }
void post(Home home, Term<BoolView>* t, int n, IntRelType irt, int c, IntPropLevel) { ZeroIntView x; post_all(home,t,n,irt,x,c); }
void post(Home home, Term<BoolView>* t, int n, IntRelType irt, IntView x, Reify r, IntPropLevel ipl) { int l, u; estimate(t,n,0,l,u); IntVar z(home,l,u); IntView zv(z); post_all(home,t,n,IRT_EQ,zv,0); rel(home,z,irt,x,r,ipl); }
void post(Home home, Term<BoolView>* t, int n, IntRelType irt, int c, Reify r, IntPropLevel ipl) {
if (r.var().one()) { if (r.mode() != RM_PMI) post(home,t,n,irt,c,ipl); return; } if (r.var().zero()) { if (r.mode() != RM_IMP) post(home,t,n,neg(irt),c,ipl); return; }
Limits::check(c,"Int::linear");
long long int d = c;
eliminate(t,n,d);
Term<BoolView> *t_p, *t_n; int n_p, n_n, gcd=1; bool unit = normalize<BoolView>(t,n,t_p,n_p,t_n,n_n,gcd);
rewrite(irt,d);
// Divide by gcd if (gcd > 1) { switch (irt) { case IRT_EQ: if ((d % gcd) != 0) { if (r.mode() != RM_PMI) GECODE_ME_FAIL(BoolView(r.var()).zero(home)); return; } d /= gcd; break; case IRT_NQ: if ((d % gcd) == 0) { if (r.mode() != RM_IMP) GECODE_ME_FAIL(BoolView(r.var()).one(home)); return; } d /= gcd; break; case IRT_LQ: d = floor_div_xp(d,static_cast<long long int>(gcd)); break; case IRT_GQ: d = ceil_div_xp(d,static_cast<long long int>(gcd)); break; default: GECODE_NEVER; } }
c = static_cast<int>(d);
if (n == 0) { bool fail = false; switch (irt) { case IRT_EQ: fail = (0 != c); break; case IRT_NQ: fail = (0 == c); break; case IRT_GQ: fail = (0 < c); break; case IRT_LQ: fail = (0 > c); break; default: GECODE_NEVER; } if (fail) { if (r.mode() != RM_PMI) GECODE_ME_FAIL(BoolView(r.var()).zero(home)); } else { if (r.mode() != RM_IMP) GECODE_ME_FAIL(BoolView(r.var()).one(home)); } return; }
// Check for overflow { long long int sl = c; long long int su = c; for (int i=0; i<n_p; i++) su -= t_p[i].a; for (int i=0; i<n_n; i++) sl += t_n[i].a; Limits::check(sl,"Int::linear"); Limits::check(su,"Int::linear"); }
if (unit && (n_n == 0)) { /// All coefficients are 1 post_pos_unit(home,t_p,n_p,irt,c,r,ipl); } else if (unit && (n_p == 0)) { // All coefficients are -1 post_neg_unit(home,t_n,n_n,irt,c,r,ipl); } else { // Mixed coefficients /* * Denormalize: Make all t_n coefficients negative again * (t_p and t_n are shared in t) */ for (int i=0; i<n_n; i++) t_n[i].a = -t_n[i].a;
// Note: still slow implementation int l, u; estimate(t,n,0,l,u); IntVar z(home,l,u); IntView zv(z); post_all(home,t,n,IRT_EQ,zv,0); rel(home,z,irt,c,r,ipl); } }
}}}
// STATISTICS: int-post