Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
15 kB · 464 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * Guido Tack <tack@gecode.org> * * Copyright: * Christian Schulte, 2009 * Guido Tack, 2010 * * 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/cumulative.hh>
#include <algorithm>
namespace Gecode { namespace Int { namespace Cumulative {
template<class Cap> void cumulative(Home home, Cap c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { if ((s.size() != p.size()) || (s.size() != u.size()) || (s.size() != t.size())) throw ArgumentSizeMismatch("Int::cumulative"); long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(p[i],"Int::cumulative"); Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i], "Int::cumulative"); mul_check(p[i],u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size()); GECODE_POST;
int minU = INT_MAX; int minU2 = INT_MAX; int maxU = INT_MIN; for (int i=0; i<u.size(); i++) { if (u[i] < minU) { minU2 = minU; minU = u[i]; } else if (u[i] < minU2) minU2 = u[i]; if (u[i] > maxU) maxU = u[i]; } bool disjunctive = (minU > c.max()/2) || (minU2 > c.max()/2 && minU+minU2>c.max()); if (disjunctive) { GECODE_ME_FAIL(c.gq(home,maxU)); unary(home,t,s,p,ipl); } else { bool fixp = true; for (int i=0; i<t.size(); i++) if (t[i] != TT_FIXP) { fixp = false; break; } int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; if (fixp) { TaskArray<ManFixPTask> tasks(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i] > 0) tasks[cur++].init(s[i],p[i],u[i]); GECODE_ES_FAIL(manpost(home,c,tasks,ipl)); } else { TaskArray<ManFixPSETask> tasks(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i] > 0) tasks[cur++].init(t[i],s[i],p[i],u[i]); GECODE_ES_FAIL(manpost(home,c,tasks,ipl)); } } }
template<class Cap> void cumulative(Home home, Cap c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { using namespace Gecode::Int; using namespace Gecode::Int::Cumulative; if ((s.size() != p.size()) || (s.size() != u.size()) || (s.size() != t.size()) || (s.size() != m.size())) throw Int::ArgumentSizeMismatch("Int::cumulative"); long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(p[i],"Int::cumulative"); Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i], "Int::cumulative"); mul_check(p[i],u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size()); GECODE_POST;
bool allMandatory = true; for (int i=0; i<m.size(); i++) { if (!m[i].one()) { allMandatory = false; break; } } if (allMandatory) { cumulative(home,c,t,s,p,u,ipl); } else { bool fixp = true; for (int i=0; i<t.size(); i++) if (t[i] != TT_FIXP) { fixp = false; break; } int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; if (fixp) { TaskArray<OptFixPTask> tasks(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) tasks[cur++].init(s[i],p[i],u[i],m[i]); GECODE_ES_FAIL(optpost(home,c,tasks,ipl)); } else { TaskArray<OptFixPSETask> tasks(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) tasks[cur++].init(t[i],s[i],p[i],u[i],m[i]); GECODE_ES_FAIL(optpost(home,c,tasks,ipl)); } } }
template<class Cap> void cumulative(Home home, Cap c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { using namespace Gecode::Int; using namespace Gecode::Int::Cumulative; if ((s.size() != p.size()) || (s.size() != u.size())) throw Int::ArgumentSizeMismatch("Int::cumulative"); long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(p[i],"Int::cumulative"); Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i], "Int::cumulative"); mul_check(p[i],u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size()); GECODE_POST;
int minU = INT_MAX; int minU2 = INT_MAX; int maxU = INT_MIN; for (int i=0; i<u.size(); i++) { if (u[i] < minU) { minU2 = minU; minU = u[i]; } else if (u[i] < minU2) minU2 = u[i]; if (u[i] > maxU) maxU = u[i]; } bool disjunctive = (minU > c.max()/2) || (minU2 > c.max()/2 && minU+minU2>c.max()); if (disjunctive) { GECODE_ME_FAIL(c.gq(home,maxU)); unary(home,s,p,ipl); } else { int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; TaskArray<ManFixPTask> t(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) t[cur++].init(s[i],p[i],u[i]); GECODE_ES_FAIL(manpost(home,c,t,ipl)); } }
template<class Cap> void cumulative(Home home, Cap c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { using namespace Gecode::Int; using namespace Gecode::Int::Cumulative; if ((s.size() != p.size()) || (s.size() != u.size()) || (s.size() != m.size())) throw Int::ArgumentSizeMismatch("Int::cumulative"); long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(p[i],"Int::cumulative"); Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i], "Int::cumulative"); mul_check(p[i],u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size()); GECODE_POST;
bool allMandatory = true; for (int i=0; i<m.size(); i++) { if (!m[i].one()) { allMandatory = false; break; } } if (allMandatory) { cumulative(home,c,s,p,u,ipl); } else { int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; TaskArray<OptFixPTask> t(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) t[cur++].init(s[i],p[i],u[i],m[i]); GECODE_ES_FAIL(optpost(home,c,t,ipl)); } }
template<class Cap> void cumulative(Home home, Cap c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, IntPropLevel ipl) { using namespace Gecode::Int; using namespace Gecode::Int::Cumulative; if ((s.size() != p.size()) || (s.size() != e.size()) || (s.size() != u.size())) throw Int::ArgumentSizeMismatch("Int::cumulative"); long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i].max(), "Int::cumulative"); mul_check(p[i].max(),u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size());
GECODE_POST; for (int i=0; i<p.size(); i++) GECODE_ME_FAIL(IntView(p[i]).gq(home,0));
bool fixP = true; for (int i=0; i<p.size(); i++) { if (!p[i].assigned()) { fixP = false; break; } } if (fixP) { IntArgs pp(p.size()); for (int i=0; i<p.size(); i++) pp[i] = p[i].val(); cumulative(home,c,s,pp,u,ipl); } else { int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; TaskArray<ManFlexTask> t(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) t[cur++].init(s[i],p[i],e[i],u[i]); GECODE_ES_FAIL(manpost(home,c,t,ipl)); } }
template<class Cap> void cumulative(Home home, Cap c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { using namespace Gecode::Int; using namespace Gecode::Int::Cumulative; if ((s.size() != p.size()) || (s.size() != u.size()) || (s.size() != e.size()) || (s.size() != m.size())) throw Int::ArgumentSizeMismatch("Int::cumulative");
long long int w = 0; for (int i=0; i<p.size(); i++) { Limits::nonnegative(u[i],"Int::cumulative"); Limits::check(static_cast<long long int>(s[i].max()) + p[i].max(), "Int::cumulative"); mul_check(p[i].max(),u[i]); w += s[i].width(); } mul_check(c.max(),w,s.size());
GECODE_POST; for (int i=0; i<p.size(); i++) GECODE_ME_FAIL(IntView(p[i]).gq(home,0));
bool allMandatory = true; for (int i=0; i<m.size(); i++) { if (!m[i].one()) { allMandatory = false; break; } } if (allMandatory) { cumulative(home,c,s,p,e,u,ipl); } else { int nonOptionals = 0; for (int i=0; i<u.size(); i++) if (u[i]>0) nonOptionals++; TaskArray<OptFlexTask> t(home,nonOptionals); int cur = 0; for (int i=0; i<s.size(); i++) if (u[i]>0) t[cur++].init(s[i],p[i],e[i],u[i],m[i]); GECODE_ES_FAIL(optpost(home,c,t,ipl)); } }
}}}
namespace Gecode {
void cumulative(Home home, int c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),t,s,p,u,ipl); }
void cumulative(Home home, IntVar c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),t,s,p,u,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),t,s,p,u,ipl); }
void cumulative(Home home, int c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),t,s,p,u,m,ipl); }
void cumulative(Home home, IntVar c, const TaskTypeArgs& t, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),t,s,p,u,m,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),t,s,p,u,m,ipl); }
void cumulative(Home home, int c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),s,p,u,ipl); }
void cumulative(Home home, IntVar c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),s,p,u,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),s,p,u,ipl); }
void cumulative(Home home, int c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),s,p,u,m,ipl); }
void cumulative(Home home, IntVar c, const IntVarArgs& s, const IntArgs& p, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),s,p,u,m,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),s,p,u,m,ipl); }
void cumulative(Home home, int c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),s,p,e,u,ipl); }
void cumulative(Home home, IntVar c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),s,p,e,u,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),s,p,e,u,ipl); }
void cumulative(Home home, int c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { Int::Limits::nonnegative(c,"Int::cumulative"); Int::Cumulative::cumulative(home,Int::ConstIntView(c),s,p,e,u,m,ipl); }
void cumulative(Home home, IntVar c, const IntVarArgs& s, const IntVarArgs& p, const IntVarArgs& e, const IntArgs& u, const BoolVarArgs& m, IntPropLevel ipl) { if (c.assigned()) cumulative(home,c.val(),s,p,e,u,m,ipl); else Int::Cumulative::cumulative(home,Int::IntView(c),s,p,e,u,m,ipl); }
}
// STATISTICS: int-post