/usr/include/gecode/kernel/wait.hh is in libgecode-dev 5.1.0-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* Last modified:
* $Date: 2017-03-01 04:28:36 +0100 (Wed, 01 Mar 2017) $ by $Author: schulte $
* $Revision: 15541 $
*
* 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.
*
*/
#ifndef __GECODE_KERNEL_WAIT_HH__
#define __GECODE_KERNEL_WAIT_HH__
#include <gecode/kernel.hh>
namespace Gecode { namespace Kernel {
/**
* \brief Wait propagator for single view
*
* Requires \code #include <gecode/kernel/wait.hh> \endcode
* \ingroup FuncKernelProp
*/
template<class View>
class UnaryWait : public Propagator {
protected:
/// View to wait for becoming assigned
View x;
/// Continuation to execute
SharedData<std::function<void(Space& home)>> c;
/// Constructor for creation
UnaryWait(Home home, View x, std::function<void(Space& home)> c0);
/// Constructor for cloning \a p
UnaryWait(Space& home, bool shared, UnaryWait& p);
public:
/// Perform copying during cloning
virtual Actor* copy(Space& home, bool share);
/// Const function (defined as low unary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Schedule function
virtual void reschedule(Space& home);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator that waits until \a x becomes assigned and then executes \a c
static ExecStatus post(Home home, View x,
std::function<void(Space& home)> c);
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Wait propagator for several views
*
* Requires \code #include <gecode/kernel/wait.hh> \endcode
* \ingroup FuncKernelProp
*/
template<class View>
class NaryWait : public Propagator {
protected:
/// Views to wait for becoming assigned
ViewArray<View> x;
/// Continuation to execute
SharedData<std::function<void(Space& home)>> c;
/// Constructor for creation
NaryWait(Home home, ViewArray<View>& x,
std::function<void(Space& home)> c0);
/// Constructor for cloning \a p
NaryWait(Space& home, bool shared, NaryWait& p);
public:
/// Perform copying during cloning
virtual Actor* copy(Space& home, bool share);
/// Const function (defined as high unary)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Schedule function
virtual void reschedule(Space& home);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator that waits until \a x becomes assigned and then executes \a c
static ExecStatus post(Home home, ViewArray<View>& x,
std::function<void(Space& home)> c);
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/*
* Wait propagator for single view
*
*/
template<class View>
forceinline
UnaryWait<View>::UnaryWait(Home home, View x0,
std::function<void(Space& home)> c0)
: Propagator(home), x(x0), c(c0) {
x.subscribe(home,*this,PC_GEN_ASSIGNED);
home.notice(*this,AP_DISPOSE);
}
template<class View>
forceinline
UnaryWait<View>::UnaryWait(Space& home, bool shared, UnaryWait& p)
: Propagator(home,shared,p) {
x.update(home,shared,p.x);
c.update(home,shared,p.c);
}
template<class View>
Actor*
UnaryWait<View>::copy(Space& home, bool share) {
return new (home) UnaryWait<View>(home,share,*this);
}
template<class View>
PropCost
UnaryWait<View>::cost(const Space&, const ModEventDelta&) const {
return PropCost::unary(PropCost::LO);
}
template<class View>
void
UnaryWait<View>::reschedule(Space& home) {
x.reschedule(home,*this,PC_GEN_ASSIGNED);
}
template<class View>
ExecStatus
UnaryWait<View>::propagate(Space& home, const ModEventDelta&) {
assert(x.assigned());
GECODE_VALID_FUNCTION(c());
c()(home);
return home.failed() ? ES_FAILED : home.ES_SUBSUMED(*this);
}
template<class View>
forceinline ExecStatus
UnaryWait<View>::post(Home home, View x,
std::function<void(Space& home)> c) {
if (!c)
throw InvalidFunction("UnaryWait::post");
if (x.assigned()) {
c(home);
return home.failed() ? ES_FAILED : ES_OK;
} else {
(void) new (home) UnaryWait<View>(home,x,c);
return ES_OK;
}
}
template<class View>
size_t
UnaryWait<View>::dispose(Space& home) {
x.cancel(home,*this,PC_GEN_ASSIGNED);
home.ignore(*this,AP_DISPOSE);
c.~SharedData<std::function<void(Space& home)>>();
(void) Propagator::dispose(home);
return sizeof(*this);
}
/*
* Wait propagator for several views
*
*/
template<class View>
forceinline
NaryWait<View>::NaryWait(Home home, ViewArray<View>& x0,
std::function<void(Space& home)> c0)
: Propagator(home), x(x0), c(c0) {
assert(!x[0].assigned());
x[0].subscribe(home,*this,PC_GEN_ASSIGNED);
home.notice(*this,AP_DISPOSE);
}
template<class View>
forceinline
NaryWait<View>::NaryWait(Space& home, bool shared, NaryWait& p)
: Propagator(home,shared,p) {
x.update(home,shared,p.x);
c.update(home,shared,p.c);
}
template<class View>
Actor*
NaryWait<View>::copy(Space& home, bool share) {
assert(!x[0].assigned());
for (int i=x.size()-1; i>0; i--)
if (x[i].assigned())
x.move_lst(i);
assert(x.size() > 0);
return new (home) NaryWait<View>(home,share,*this);
}
template<class View>
PropCost
NaryWait<View>::cost(const Space&, const ModEventDelta&) const {
return PropCost::unary(PropCost::HI);
}
template<class View>
void
NaryWait<View>::reschedule(Space& home) {
x[0].reschedule(home,*this,PC_GEN_ASSIGNED);
}
template<class View>
ExecStatus
NaryWait<View>::propagate(Space& home, const ModEventDelta& ) {
assert(x[0].assigned());
for (int i=x.size()-1; i>0; i--)
if (x[i].assigned())
x.move_lst(i);
assert(x.size() > 0);
if (x.size() == 1) {
x.size(0);
GECODE_VALID_FUNCTION(c());
c()(home);
return home.failed() ? ES_FAILED : home.ES_SUBSUMED(*this);
} else {
// Create new subscription
x.move_lst(0);
assert(!x[0].assigned());
x[0].subscribe(home,*this,PC_GEN_ASSIGNED,false);
return ES_OK;
}
}
template<class View>
forceinline ExecStatus
NaryWait<View>::post(Home home, ViewArray<View>& x,
std::function<void(Space& home)> c) {
if (!c)
throw InvalidFunction("NaryWait::post");
for (int i=x.size(); i--; )
if (x[i].assigned())
x.move_lst(i);
if (x.size() == 0) {
c(home);
return home.failed() ? ES_FAILED : ES_OK;
} else {
x.unique(home);
if (x.size() == 1) {
return UnaryWait<View>::post(home,x[0],c);
} else {
(void) new (home) NaryWait<View>(home,x,c);
return ES_OK;
}
}
}
template<class View>
size_t
NaryWait<View>::dispose(Space& home) {
if (x.size() > 0)
x[0].cancel(home,*this,PC_GEN_ASSIGNED);
home.ignore(*this,AP_DISPOSE);
c.~SharedData<std::function<void(Space& home)>>();
(void) Propagator::dispose(home);
return sizeof(*this);
}
}}
#endif
// STATISTICS: kernel-prop
|