Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0
detectable.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, 2009
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34namespace Gecode { namespace Int { namespace Unary {
35
36 template<class ManTaskView>
40
41 Region r;
42
45 int* est = r.alloc<int>(t.size());
46
47 for (int i=0; i<t.size(); i++) {
48 while (q() && (t[i].ect() > t[q.task()].lst())) {
49 o.insert(q.task()); ++q;
50 }
51 est[i] = o.ect(i);
52 }
53
54 for (int i=0; i<t.size(); i++)
55 GECODE_ME_CHECK(t[i].est(home,est[i]));
56
57 return ES_OK;
58 }
59
60 template<class ManTask>
68
69
70 template<class OptTaskView, class PL>
74
75 Region r;
76
79 int* est = r.alloc<int>(t.size());
80
81 for (int i=0; i<t.size(); i++) {
82 while (q() && (t[i].ect() > t[q.task()].lst())) {
83 o.insert(q.task()); ++q;
84 }
85 est[i] = o.ect(i);
86 }
87
88 int n = t.size();
89 for (int i=n; i--; )
90 if (t[i].mandatory()) {
91 GECODE_ME_CHECK(t[i].est(home,est[i]));
92 } else if (est[i] > t[i].lst()) {
93 GECODE_ME_CHECK(t[i].excluded(home));
94 t[i].cancel(home,p,PL::pc); t[i]=t[--n];
95 }
96 t.size(n);
97
98 return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
99 }
100
101 template<class OptTask, class PL>
106 (home,p,f)));
108 return detectable<typename TaskTraits<OptTask>::TaskViewBwd,PL>
109 (home,p,b);
110 }
111
112}}}
113
114// STATISTICS: int-prop
struct Gecode::@603::NNF::@65::@66 b
For binary nodes (and, or, eqv)
NodeType t
Type of node.
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
int size(void) const
Return size of array (number of elements)
Definition array.hpp:1607
Allows to iterate over mandatory task views according to a specified order.
Definition task.hh:339
Task array.
Definition task.hh:165
Traits class for mapping tasks to task views.
Definition task.hh:157
Task view array.
Definition task.hh:233
Allows to iterate over task views according to a specified order.
Definition task.hh:309
int task(void) const
Return current task position.
Definition iter.hpp:68
Omega trees for computing ect of task sets.
Definition unary.hh:674
void insert(int i)
Insert task with index i.
Definition tree.hpp:65
int ect(void) const
Return earliest completion time of all tasks.
Definition tree.hpp:80
Base-class for propagators.
Definition core.hpp:1064
Handle to region.
Definition region.hpp:55
Computation spaces.
Definition core.hpp:1742
ExecStatus ES_SUBSUMED(Propagator &p)
Definition core.hpp:3563
#define GECODE_ME_CHECK(me)
Check whether modification event me is failed, and forward failure.
Definition macros.hpp:52
#define GECODE_ES_CHECK(es)
Check whether execution status es is failed or subsumed, and forward failure or subsumption.
Definition macros.hpp:91
ExecStatus detectable(Space &home, TaskArray< ManTask > &t)
Propagate detectable precedences.
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing)
Definition sort.hpp:133
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:767
ExecStatus
Definition core.hpp:472
@ ES_OK
Execution is okay.
Definition core.hpp:476
#define forceinline
Definition config.hpp:187