cumulative.cpp
Go to the documentation of this file.
/* -*- 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
Gecode::ArgArrayBase::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:1607
Gecode::BoolVarArgs
Passing Boolean variables.
Definition int.hh:712
Gecode::FloatVal::max
friend FloatVal max(const FloatVal &x, const FloatVal &y)
Definition val.hpp:386
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::IntArgs
Passing integer arguments.
Definition int.hh:628
Gecode::IntVarArgs
Passing integer variables.
Definition int.hh:656
Gecode::IntVar
Integer variables.
Definition int.hh:371
Gecode::Int::ArgumentSizeMismatch
Exception: Arguments are of different size
Definition exception.hpp:73
Gecode::Int::ConstIntView
Constant integer view.
Definition view.hpp:851
Gecode::Int::IntView
Integer view for integer variables.
Definition view.hpp:129
Gecode::Int::TaskArray
Task array.
Definition task.hh:165
cumulative.hh
GECODE_POST
#define GECODE_POST
Check for failure in a constraint post function.
Definition macros.hpp:40
GECODE_ES_FAIL
#define GECODE_ES_FAIL(es)
Check whether execution status es is failed, and fail space home.
Definition macros.hpp:103
GECODE_ME_FAIL
#define GECODE_ME_FAIL(me)
Check whether modification event me is failed, and fail space home.
Definition macros.hpp:77
Gecode::IntPropLevel
IntPropLevel
Propagation levels for integer propagators.
Definition int.hh:974
Gecode::TaskTypeArgs
ArgArray< TaskType > TaskTypeArgs
Argument arrays for passing task type arguments.
Definition int.hh:1015
Gecode::TT_FIXP
@ TT_FIXP
Definition int.hh:1005
Gecode::Int::Cumulative
Scheduling for cumulative resources
Definition cumulative.cpp:40
Gecode::Int::Cumulative::optpost
ExecStatus optpost(Home home, Cap c, TaskArray< OptTask > &t, IntPropLevel ipl)
Definition post.hpp:53
Gecode::Int::Cumulative::manpost
ExecStatus manpost(Home home, Cap c, TaskArray< ManTask > &t, IntPropLevel ipl)
Definition post.hpp:38
Gecode::Int::Cumulative::mul_check
void mul_check(long long int x, long long int y)
Throw exception if multiplication of x and y overflows.
Definition limits.hpp:37
Gecode::Int::Cumulative::cumulative
void cumulative(Home home, Cap c, const TaskTypeArgs &t, const IntVarArgs &s, const IntArgs &p, const IntArgs &u, IntPropLevel ipl)
Definition cumulative.cpp:44
Gecode::Int::Limits::nonnegative
void nonnegative(int n, const char *l)
Check whether n is in range and nonnegative, otherwise throw out of limits with information l.
Definition limits.hpp:68
Gecode::Int::Limits::check
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Definition limits.hpp:46
Gecode::Int
Finite domain integers.
Gecode
Gecode toplevel namespace
Gecode::cumulative
void cumulative(Home home, int c, const TaskTypeArgs &t, const IntVarArgs &flex, const IntArgs &fix, const IntArgs &u, IntPropLevel ipl=IPL_DEF)
Post propagators for scheduling tasks on cumulative resources.
Definition cumulative.cpp:354
Gecode::max
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition arithmetic.cpp:49
Gecode::unary
void unary(Home home, const IntVarArgs &s, const IntArgs &p, IntPropLevel ipl=IPL_DEF)
Post propagators for scheduling tasks on unary resources.
Definition unary.cpp:44