Generated on Sat Feb 7 2015 02:01:21 for Gecode by doxygen 1.8.9.1
overload.hpp
Go to the documentation of this file.
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  * Last modified:
12  * $Date: 2013-03-11 06:26:07 +0100 (Mon, 11 Mar 2013) $ by $Author: tack $
13  * $Revision: 13487 $
14  *
15  * This file is part of Gecode, the generic constraint
16  * development environment:
17  * http://www.gecode.org
18  *
19  * Permission is hereby granted, free of charge, to any person obtaining
20  * a copy of this software and associated documentation files (the
21  * "Software"), to deal in the Software without restriction, including
22  * without limitation the rights to use, copy, modify, merge, publish,
23  * distribute, sublicense, and/or sell copies of the Software, and to
24  * permit persons to whom the Software is furnished to do so, subject to
25  * the following conditions:
26  *
27  * The above copyright notice and this permission notice shall be
28  * included in all copies or substantial portions of the Software.
29  *
30  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
31  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
32  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
33  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
34  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
35  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
36  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
37  *
38  */
39 
40 namespace Gecode { namespace Int { namespace Cumulative {
41 
42  // Overload checking for mandatory tasks
43  template<class ManTask>
47  sort<typename TaskTraits<ManTask>::TaskViewFwd,STO_LCT,true>(f);
48 
49  Region r(home);
51 
52  for (int i=0; i<f.size(); i++) {
53  if (f[i].mandatory())
54  o.insert(i);
55  if (o.env() > static_cast<long long int>(c)*f[i].lct())
56  GECODE_ME_CHECK(f[i].excluded(home));
57  }
58  return ES_OK;
59  }
60 
61 }}}
62 
63 // STATISTICS: int-prop
long long int env(void) const
Return energy envelope of all tasks.
Definition: tree.hpp:87
NodeType t
Type of node.
Definition: bool-expr.cpp:234
Task view array.
Definition: task.hh:233
Omega trees for computing ect of task sets.
Definition: cumulative.hh:565
ExecStatus overload(Space &home, int c, TaskArray< ManTask > &t)
Check mandatory tasks t for overload.
Definition: overload.hpp:45
Handle to region.
Definition: region.hpp:61
Computation spaces.
Definition: core.hpp:1362
Gecode::FloatVal c(-8, 8)
Gecode::IntArgs i(4, 1, 2, 3, 4)
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:139
Sort by latest completion times.
Definition: task.hh:286
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition: macros.hpp:45
void insert(int i)
Insert task with index i.
Definition: tree.hpp:71
ExecStatus
Definition: core.hpp:523
Execution is okay.
Definition: core.hpp:527
Gecode toplevel namespace