/usr/include/gecode/int/dom/range.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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
*
* Last modified:
* $Date: 2011-11-18 16:02:48 +0100 (Fri, 18 Nov 2011) $ by $Author: schulte $
* $Revision: 12472 $
*
* 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.
*
*/
#include <gecode/int/rel.hh>
namespace Gecode { namespace Int { namespace Dom {
template<class View, ReifyMode rm>
forceinline
ReRange<View,rm>::ReRange(Home home, View x, int min0, int max0, BoolView b)
: ReUnaryPropagator<View,PC_INT_BND,BoolView>(home,x,b),
min(min0), max(max0) {}
template<class View, ReifyMode rm>
ExecStatus
ReRange<View,rm>::post(Home home, View x, int min, int max, BoolView b) {
if (min == max) {
return Rel::ReEqDomInt<View,BoolView,rm>::post(home,x,min,b);
} else if ((min > max) || (max < x.min()) || (min > x.max())) {
if (rm == RM_PMI)
return ES_OK;
GECODE_ME_CHECK(b.zero(home));
} else if ((min <= x.min()) && (x.max() <= max)) {
if (rm == RM_IMP)
return ES_OK;
GECODE_ME_CHECK(b.one(home));
} else if (b.one()) {
if (rm == RM_PMI)
return ES_OK;
GECODE_ME_CHECK(x.gq(home,min));
GECODE_ME_CHECK(x.lq(home,max));
} else if (b.zero()) {
if (rm == RM_IMP)
return ES_OK;
Iter::Ranges::Singleton r(min,max);
GECODE_ME_CHECK(x.minus_r(home,r,false));
} else {
(void) new (home) ReRange<View,rm>(home,x,min,max,b);
}
return ES_OK;
}
template<class View, ReifyMode rm>
forceinline
ReRange<View,rm>::ReRange(Space& home, bool share, ReRange& p)
: ReUnaryPropagator<View,PC_INT_BND,BoolView>(home,share,p),
min(p.min), max(p.max) {}
template<class View, ReifyMode rm>
Actor*
ReRange<View,rm>::copy(Space& home, bool share) {
return new (home) ReRange<View,rm>(home,share,*this);
}
template<class View, ReifyMode rm>
ExecStatus
ReRange<View,rm>::propagate(Space& home, const ModEventDelta&) {
if (b.one()) {
if (rm != RM_PMI) {
GECODE_ME_CHECK(x0.gq(home,min));
GECODE_ME_CHECK(x0.lq(home,max));
}
} else if (b.zero()) {
if (rm != RM_IMP) {
Iter::Ranges::Singleton r(min,max);
GECODE_ME_CHECK(x0.minus_r(home,r,false));
}
} else if ((x0.max() <= max) && (x0.min() >= min)) {
if (rm != RM_IMP)
GECODE_ME_CHECK(b.one_none(home));
} else if ((x0.max() < min) || (x0.min() > max)) {
if (rm != RM_PMI)
GECODE_ME_CHECK(b.zero_none(home));
} else {
return ES_FIX;
}
return home.ES_SUBSUMED(*this);
}
}}}
// STATISTICS: int-prop
|