cumulatives.cpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Mikael Lagerkvist <lagerkvist@gecode.org>
*
* Copyright:
* Mikael Lagerkvist, 2005
*
* 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/cumulatives.hh>
namespace Gecode {
using namespace Int;
namespace {
ViewArray<IntView>
make_view_array(Space& home, const IntVarArgs& in) {
return ViewArray<Int::IntView>(home, in);
}
ViewArray<ConstIntView>
make_view_array(Space& home, const IntArgs& in) {
ViewArray<Int::ConstIntView> res(home, in.size());
for (int i=0; i<in.size(); i++) {
Int::Limits::check(in[i],"Int::cumulatives");
res[i] = Int::ConstIntView(in[i]);
}
return res;
}
template<class In> class ViewType;
template<>
class ViewType<IntArgs> {
public:
typedef Int::ConstIntView Result;
};
template<>
class ViewType<IntVarArgs> {
public:
typedef Int::IntView Result;
};
template<class Machine, class Processing, class Usage>
void
post_cumulatives(Home home, const Machine& m,
const IntVarArgs& s, const Processing& p,
const IntVarArgs& e, const Usage& u,
const IntArgs& c, bool at_most,
IntPropLevel) {
if (m.size() != s.size() ||
s.size() != p.size() ||
p.size() != e.size() ||
e.size() != u.size())
throw Int::ArgumentSizeMismatch("Int::cumulatives");
GECODE_POST;
ViewArray<typename ViewType<Machine>::Result>
vm = make_view_array(home, m);
ViewArray<typename ViewType<Processing>::Result>
vp = make_view_array(home, p);
ViewArray<typename ViewType<Usage>::Result>
vu = make_view_array(home, u);
ViewArray<IntView>
vs = make_view_array(home, s),
ve = make_view_array(home, e);
SharedArray<int> c_s(c.size());
for (int i=0; i<c.size(); i++)
c_s[i] = c[i];
// There is only the value-consistent propagator for this constraint
GECODE_ES_FAIL((Int::Cumulatives::Val<
typename ViewType<Machine>::Result,
typename ViewType<Processing>::Result,
typename ViewType<Usage>::Result,
IntView>::post(home, vm,vs,vp,ve,vu,c_s,at_most)));
}
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntVarArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntVarArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntVarArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
void
cumulatives(Home home, const IntArgs& m,
const IntVarArgs& s, const IntArgs& p,
const IntVarArgs& e, const IntArgs& u,
const IntArgs& c, bool at_most,
IntPropLevel cl) {
post_cumulatives(home, m, s, p, e, u, c, at_most, cl);
}
}
// STATISTICS: int-post
Gecode::ArgArrayBase::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:1607
Gecode::FloatVal::size
FloatNum size(void) const
Return size of float value (distance between maximum and minimum).
Definition val.hpp:78
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::Int::ArgumentSizeMismatch
Exception: Arguments are of different size
Definition exception.hpp:73
Gecode::Int::ConstIntView
Constant integer view.
Definition view.hpp:851
Gecode::Int::Cumulatives::Val
Propagator for the cumulatives constraint
Definition cumulatives.hh:86
Gecode::Int::IntView
Integer view for integer variables.
Definition view.hpp:129
Gecode::SharedArray
Shared array with arbitrary number of elements.
Definition shared-array.hpp:53
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::ViewArray
View arrays.
Definition array.hpp:253
cumulatives.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::IntPropLevel
IntPropLevel
Propagation levels for integer propagators.
Definition int.hh:974
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::cumulatives
void cumulatives(Home home, const IntVarArgs &m, const IntVarArgs &s, const IntVarArgs &p, const IntVarArgs &e, const IntVarArgs &u, const IntArgs &c, bool at_most, IntPropLevel ipl=IPL_DEF)
Post propagators for the cumulatives constraint.
Definition cumulatives.cpp:110
Gecode::post
TFE post(PropagatorGroup g)
Only post functions (but not propagators) from g are considered.
Definition filter.cpp:138
Test::Float::Arithmetic::c
Gecode::FloatVal c(-8, 8)
Test::Int::Basic::i
Gecode::IntArgs i({1, 2, 3, 4})