/usr/include/gecode/int/no-overlap/man.hpp is in libgecode-dev 4.4.0-5.
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, 2011
*
* Last modified:
* $Date: 2012-09-10 19:36:08 +0200 (Mon, 10 Sep 2012) $ by $Author: schulte $
* $Revision: 13072 $
*
* 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 NoOverlap {
template<class Box>
forceinline
ManProp<Box>::ManProp(Home home, Box* b, int n)
: Base<Box>(home, b, n) {}
template<class Box>
inline ExecStatus
ManProp<Box>::post(Home home, Box* b, int n) {
if (n > 1)
(void) new (home) ManProp<Box>(home,b,n);
return ES_OK;
}
template<class Box>
forceinline size_t
ManProp<Box>::dispose(Space& home) {
(void) Base<Box>::dispose(home);
return sizeof(*this);
}
template<class Box>
forceinline
ManProp<Box>::ManProp(Space& home, bool shared, ManProp<Box>& p)
: Base<Box>(home, shared, p, p.n) {}
template<class Box>
Actor*
ManProp<Box>::copy(Space& home, bool share) {
return new (home) ManProp<Box>(home,share,*this);
}
template<class Box>
ExecStatus
ManProp<Box>::propagate(Space& home, const ModEventDelta&) {
Region r(home);
// Number of disjoint boxes
int* db = r.alloc<int>(n);
for (int i=n; i--; )
db[i] = n-1;
// Number of boxes to be eliminated
int e = 0;
for (int i=n; i--; )
for (int j=i; j--; )
if (b[i].nooverlap(b[j])) {
assert(db[i] > 0); assert(db[j] > 0);
if (--db[i] == 0) e++;
if (--db[j] == 0) e++;
continue;
} else {
GECODE_ES_CHECK(b[i].nooverlap(home,b[j]));
}
if (e == n)
return home.ES_SUBSUMED(*this);
{
int i = n-1;
while (e > 0) {
// Eliminate boxes that do not overlap
while (db[i] > 0)
i--;
b[i].cancel(home, *this);
b[i] = b[--n];
e--; i--;
}
if (n < 2)
return home.ES_SUBSUMED(*this);
}
return ES_NOFIX;
}
}}}
// STATISTICS: int-prop
|