/usr/include/gecode/int/unary/detectable.hpp 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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
*
* Last modified:
* $Date: 2016-04-19 17:19:45 +0200 (Tue, 19 Apr 2016) $ by $Author: schulte $
* $Revision: 14967 $
*
* 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.
*
*/
namespace Gecode { namespace Int { namespace Unary {
template<class ManTaskView>
forceinline ExecStatus
detectable(Space& home, TaskViewArray<ManTaskView>& t) {
sort<ManTaskView,STO_ECT,true>(t);
Region r(home);
OmegaTree<ManTaskView> o(r,t);
TaskViewIter<ManTaskView,STO_LST,true> q(r,t);
int* est = r.alloc<int>(t.size());
for (int i=0; i<t.size(); i++) {
while (q() && (t[i].ect() > t[q.task()].lst())) {
o.insert(q.task()); ++q;
}
est[i] = o.ect(i);
}
for (int i=t.size(); i--; )
GECODE_ME_CHECK(t[i].est(home,est[i]));
return ES_OK;
}
template<class ManTask>
ExecStatus
detectable(Space& home, TaskArray<ManTask>& t) {
TaskViewArray<typename TaskTraits<ManTask>::TaskViewFwd> f(t);
GECODE_ES_CHECK(detectable(home,f));
TaskViewArray<typename TaskTraits<ManTask>::TaskViewBwd> b(t);
return detectable(home,b);
}
template<class OptTaskView, class PL>
forceinline ExecStatus
detectable(Space& home, Propagator& p, TaskViewArray<OptTaskView>& t) {
sort<OptTaskView,STO_ECT,true>(t);
Region r(home);
OmegaTree<OptTaskView> o(r,t);
ManTaskViewIter<OptTaskView,STO_LST,true> q(r,t);
int* est = r.alloc<int>(t.size());
for (int i=0; i<t.size(); i++) {
while (q() && (t[i].ect() > t[q.task()].lst())) {
o.insert(q.task()); ++q;
}
est[i] = o.ect(i);
}
int n = t.size();
for (int i=n; i--; )
if (t[i].mandatory()) {
GECODE_ME_CHECK(t[i].est(home,est[i]));
} else if (est[i] > t[i].lst()) {
GECODE_ME_CHECK(t[i].excluded(home));
t[i].cancel(home,p,PL::pc); t[i]=t[--n];
}
t.size(n);
return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
}
template<class OptTask, class PL>
ExecStatus
detectable(Space& home, Propagator& p, TaskArray<OptTask>& t) {
TaskViewArray<typename TaskTraits<OptTask>::TaskViewFwd> f(t);
GECODE_ES_CHECK((detectable<typename TaskTraits<OptTask>::TaskViewFwd,PL>
(home,p,f)));
TaskViewArray<typename TaskTraits<OptTask>::TaskViewBwd> b(t);
return detectable<typename TaskTraits<OptTask>::TaskViewBwd,PL>
(home,p,b);
}
}}}
// STATISTICS: int-prop
|