this repo has no description
dekker.one
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christian Schulte <schulte@gecode.org>
5 * Guido Tack <tack@gecode.org>
6 *
7 * Copyright:
8 * Christian Schulte, 2009
9 * Guido Tack, 2010
10 *
11 * This file is part of Gecode, the generic constraint
12 * development environment:
13 * http://www.gecode.org
14 *
15 * Permission is hereby granted, free of charge, to any person obtaining
16 * a copy of this software and associated documentation files (the
17 * "Software"), to deal in the Software without restriction, including
18 * without limitation the rights to use, copy, modify, merge, publish,
19 * distribute, sublicense, and/or sell copies of the Software, and to
20 * permit persons to whom the Software is furnished to do so, subject to
21 * the following conditions:
22 *
23 * The above copyright notice and this permission notice shall be
24 * included in all copies or substantial portions of the Software.
25 *
26 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
27 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
28 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
29 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
30 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
31 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
32 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
33 *
34 */
35
36namespace Gecode { namespace Int { namespace Cumulative {
37
38 // Overload checking for mandatory tasks
39 template<class ManTask>
40 ExecStatus
41 overload(Space& home, int c, TaskArray<ManTask>& t) {
42 TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd> f(t);
43 sort<typename TaskTraits<ManTask>::TaskViewFwd,STO_LCT,true>(f);
44
45 Region r;
46 OmegaTree<typename TaskTraits<ManTask>::TaskViewFwd> o(r,c,f);
47
48 for (int i=0; i<f.size(); i++) {
49 if (f[i].mandatory())
50 o.insert(i);
51 if (o.env() > static_cast<long long int>(c)*f[i].lct())
52 GECODE_ME_CHECK(f[i].excluded(home));
53 }
54 return ES_OK;
55 }
56
57}}}
58
59// STATISTICS: int-prop