Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
6.1 kB · 183 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184/* -*- 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