/usr/include/gecode/int/cumulative/man-prop.hpp is in libgecode-dev 4.2.1-1.
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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
* Guido Tack, 2010
*
* Last modified:
* $Date: 2011-07-13 22:44:50 +0200 (Wed, 13 Jul 2011) $ by $Author: tack $
* $Revision: 12202 $
*
* 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 Cumulative {
template<class ManTask, class Cap>
forceinline
ManProp<ManTask,Cap>::ManProp(Home home, Cap c0, TaskArray<ManTask>& t)
: TaskProp<ManTask,Int::PC_INT_DOM>(home,t), c(c0) {
c.subscribe(home,*this,Int::PC_INT_BND);
}
template<class ManTask, class Cap>
forceinline
ManProp<ManTask,Cap>::ManProp(Space& home, bool shared,
ManProp<ManTask,Cap>& p)
: TaskProp<ManTask,Int::PC_INT_DOM>(home,shared,p) {
c.update(home,shared,p.c);
}
template<class ManTask, class Cap>
forceinline ExecStatus
ManProp<ManTask,Cap>::post(Home home, Cap c, TaskArray<ManTask>& t) {
// Capacity must be nonnegative
GECODE_ME_CHECK(c.gq(home, 0));
// Check that tasks do not overload resource
for (int i=t.size(); i--; )
if (t[i].c() > c.max())
return ES_FAILED;
if (t.size() == 1)
GECODE_ME_CHECK(c.gq(home, t[0].c()));
if (t.size() > 1) {
if (c.assigned() && c.val()==1) {
TaskArray<typename TaskTraits<ManTask>::UnaryTask> mt(home,t.size());
for (int i=t.size(); i--; )
mt[i]=t[i];
return Unary::ManProp<typename TaskTraits<ManTask>::UnaryTask>
::post(home,mt);
} else {
(void) new (home) ManProp<ManTask,Cap>(home,c,t);
}
}
return ES_OK;
}
template<class ManTask, class Cap>
Actor*
ManProp<ManTask,Cap>::copy(Space& home, bool share) {
return new (home) ManProp<ManTask,Cap>(home,share,*this);
}
template<class ManTask, class Cap>
forceinline size_t
ManProp<ManTask,Cap>::dispose(Space& home) {
(void) TaskProp<ManTask,Int::PC_INT_DOM>::dispose(home);
c.cancel(home,*this,PC_INT_BND);
return sizeof(*this);
}
template<class ManTask, class Cap>
ExecStatus
ManProp<ManTask,Cap>::propagate(Space& home, const ModEventDelta& med) {
// Only bounds changes?
if (Int::IntView::me(med) != Int::ME_INT_DOM)
GECODE_ES_CHECK(overload(home,c.max(),t));
GECODE_ES_CHECK(edgefinding(home,c.max(),t));
bool subsumed;
ExecStatus es = basic(home,subsumed,c,t);
GECODE_ES_CHECK(es);
if (subsumed)
return home.ES_SUBSUMED(*this);
if (Cap::varderived() && c.assigned() && c.val()==1) {
// Check that tasks do not overload resource
for (int i=t.size(); i--; )
if (t[i].c() > 1)
return ES_FAILED;
// Rewrite to unary resource constraint
TaskArray<typename TaskTraits<ManTask>::UnaryTask> ut(home,t.size());
for (int i=t.size(); i--;)
ut[i]=t[i];
GECODE_REWRITE(*this,
(Unary::ManProp<typename TaskTraits<ManTask>::UnaryTask>
::post(home(*this),ut)));
} else {
return es;
}
}
}}}
// STATISTICS: int-prop
|