/usr/include/gecode/int/distinct/ter-dom.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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2003
*
* Last modified:
* $Date: 2010-03-03 17:32:21 +0100 (Wed, 03 Mar 2010) $ by $Author: schulte $
* $Revision: 10364 $
*
* 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 Distinct {
/*
* Ternary domain consistent distinct
*
*/
template<class View>
forceinline
TerDom<View>::TerDom(Home home, View x0, View x1, View x2)
: TernaryPropagator<View,PC_INT_DOM>(home,x0,x1,x2) {}
template<class View>
ExecStatus
TerDom<View>::post(Home home, View x0, View x1, View x2) {
(void) new (home) TerDom<View>(home,x0,x1,x2);
return ES_OK;
}
template<class View>
forceinline
TerDom<View>::TerDom(Space& home, bool share, TerDom<View>& p)
: TernaryPropagator<View,PC_INT_DOM>(home,share,p) {}
template<class View>
Actor*
TerDom<View>::copy(Space& home, bool share) {
return new (home) TerDom<View>(home,share,*this);
}
/// Check whether x0 forms a Hall set of cardinality one
#define GECODE_INT_HALL_ONE(x0,x1,x2) \
if (x0.assigned()) { \
GECODE_ME_CHECK(x1.nq(home,x0.val())); \
GECODE_ME_CHECK(x2.nq(home,x0.val())); \
if (x1.assigned()) { \
GECODE_ME_CHECK(x2.nq(home,x1.val())); \
return home.ES_SUBSUMED(*this); \
} \
if (x2.assigned()) { \
GECODE_ME_CHECK(x1.nq(home,x2.val())); \
return home.ES_SUBSUMED(*this); \
} \
return ES_FIX; \
}
/// Check whether x0 and x1 form a Hall set of cardinality two
#define GECODE_INT_HALL_TWO(x0,x1,x2) \
if ((x0.size() == 2) && (x1.size() == 2) && \
(x0.min() == x1.min()) && (x0.max() == x1.max())) { \
GECODE_ME_CHECK(x2.nq(home,x0.min())); \
GECODE_ME_CHECK(x2.nq(home,x0.max())); \
return ES_FIX; \
}
template<class View>
ExecStatus
TerDom<View>::propagate(Space& home, const ModEventDelta&) {
GECODE_INT_HALL_ONE(x0,x1,x2);
GECODE_INT_HALL_ONE(x1,x0,x2);
GECODE_INT_HALL_ONE(x2,x0,x1);
GECODE_INT_HALL_TWO(x0,x1,x2);
GECODE_INT_HALL_TWO(x0,x2,x1);
GECODE_INT_HALL_TWO(x1,x2,x0);
return ES_FIX;
}
#undef GECODE_INT_HALL_ONE
#undef GECODE_INT_HALL_TWO
}}}
// STATISTICS: int-prop
|