/usr/include/gecode/int/no-overlap/base.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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2011
*
* Last modified:
* $Date: 2011-07-08 16:08:27 +0200 (Fri, 08 Jul 2011) $ by $Author: schulte $
* $Revision: 12168 $
*
* 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
Base<Box>::Base(Home home, Box* b0, int n0)
: Propagator(home), b(b0), n(n0) {
for (int i=n; i--; )
b[i].subscribe(home,*this);
}
template<class Box>
forceinline int
Base<Box>::partition(Box* b, int i, int n) {
int j = n-1;
while (true) {
while (!b[j].mandatory() && (--j >= 0)) {}
while (b[i].mandatory() && (++i < n)) {}
if (j <= i) break;
std::swap(b[i],b[j]);
}
return i;
}
template<class Box>
forceinline size_t
Base<Box>::dispose(Space& home) {
for (int i=n; i--; )
b[i].cancel(home,*this);
(void) Propagator::dispose(home);
return sizeof(*this);
}
template<class Box>
forceinline
Base<Box>::Base(Space& home, bool shared, Base<Box>& p, int m)
: Propagator(home,shared,p), b(home.alloc<Box>(m)), n(p.n) {
for (int i=m; i--; )
b[i].update(home,shared,p.b[i]);
}
template<class Box>
PropCost
Base<Box>::cost(const Space&, const ModEventDelta&) const {
return PropCost::quadratic(PropCost::HI,Box::dim()*n);
}
}}}
// STATISTICS: int-prop
|