Generated on Thu Jul 25 2019 00:00:00 for Gecode by doxygen 1.8.15
subsumption.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  *
6  * Copyright:
7  * Christian Schulte, 2015
8  *
9  * Last modified:
10  * $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
11  * $Revision: 14967 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 namespace Gecode { namespace Int { namespace Cumulative {
39 
40  template<class Task>
43  Region r(home);
44 
45  if (Event* e = Event::events(r,t)) {
46  // Process events, use ccur as the capacity that is still free
47  do {
48  // Current time
49  int time = e->time();
50  // Process events for completion of required part
51  for ( ; (e->type() == Event::LRT) && (e->time() == time); e++)
52  c += t[e->idx()].c();
53  // Process events for zero-length task
54  for ( ; (e->type() == Event::ZRO) && (e->time() == time); e++)
55  if (c < t[e->idx()].c())
56  return ES_FAILED;
57  // Process events for start of required part
58  for ( ; (e->type() == Event::ERT) && (e->time() == time); e++) {
59  c -= t[e->idx()].c();
60  if (c < 0)
61  return ES_FAILED;
62  }
63  } while (e->type() != Event::END);
64  } else {
65  return ES_OK;
66  }
67 
68  return home.ES_SUBSUMED(p);
69  }
70 
71 }}}
72 
73 // STATISTICS: int-prop
Zero-length task start time.
Definition: task.hh:501
NodeType t
Type of node.
Definition: bool-expr.cpp:234
ExecStatus ES_SUBSUMED(Propagator &p)
Definition: core.hpp:3614
ExecStatus subsumed(Space &home, Propagator &p, int c, TaskArray< Task > &t)
Check for subsumption (all tasks must be assigned)
Definition: subsumption.hpp:42
Base-class for propagators.
Definition: core.hpp:1092
Earliest required time of task.
Definition: task.hh:502
Task array.
Definition: task.hh:169
Handle to region.
Definition: region.hpp:61
Computation spaces.
Definition: core.hpp:1748
Gecode::FloatVal c(-8, 8)
End marker.
Definition: task.hh:503
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Time-tabling event for task.
Definition: task.hh:494
Execution has resulted in failure.
Definition: core.hpp:542
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition: set.hh:784
ExecStatus
Definition: core.hpp:540
#define forceinline
Definition: config.hpp:173
Execution is okay.
Definition: core.hpp:544
Latest required time of task.
Definition: task.hh:498
static Event * events(Region &r, const TaskArray< Task > &t, bool &assigned)
Allocate from r and initialize event array with tasks t.
Definition: event.hpp:87
Gecode toplevel namespace