/usr/include/gecode/int/count/int-lq.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 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2006
*
* Last modified:
* $Date: 2011-08-29 14:59:24 +0200 (Mon, 29 Aug 2011) $ by $Author: schulte $
* $Revision: 12359 $
*
* 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 Count {
template<class VX, class VY>
forceinline
LqInt<VX,VY>::LqInt(Home home, ViewArray<VX>& x, int n_s, VY y, int c)
: IntBase<VX,VY>(home,x,n_s,y,c) {}
template<class VX, class VY>
ExecStatus
LqInt<VX,VY>::post(Home home, ViewArray<VX>& x, VY y, int c) {
// Eliminate decided views
int n_x = x.size();
for (int i=n_x; i--; )
switch (holds(x[i],y)) {
case RT_FALSE:
x[i] = x[--n_x]; break;
case RT_TRUE:
x[i] = x[--n_x]; c--; break;
case RT_MAYBE:
break;
default:
GECODE_NEVER;
}
x.size(n_x);
if (c < 0)
return ES_FAILED;
if (c >= n_x)
return ES_OK;
// All views must be different
if (c == 0)
return post_false(home,x,y);
(void) new (home) LqInt<VX,VY>(home,x,n_x-c+1,y,c);
return ES_OK;
}
template<class VX, class VY>
forceinline
LqInt<VX,VY>::LqInt(Space& home, bool share, LqInt<VX,VY>& p)
: IntBase<VX,VY>(home,share,p) {}
template<class VX, class VY>
Actor*
LqInt<VX,VY>::copy(Space& home, bool share) {
return new (home) LqInt<VX,VY>(home,share,*this);
}
template<class VX, class VY>
ExecStatus
LqInt<VX,VY>::propagate(Space& home, const ModEventDelta&) {
// Eliminate decided views from subscribed views
int n_x = x.size();
for (int i=n_s; i--; )
switch (holds(x[i],y)) {
case RT_FALSE:
x[i].cancel(home,*this,PC_INT_DOM);
x[i]=x[--n_s]; x[n_s]=x[--n_x];
break;
case RT_TRUE:
x[i].cancel(home,*this,PC_INT_DOM);
x[i]=x[--n_s]; x[n_s]=x[--n_x]; c--;
break;
case RT_MAYBE:
break;
default:
GECODE_NEVER;
}
x.size(n_x);
if (c < 0)
return ES_FAILED;
if (c >= n_x)
return home.ES_SUBSUMED(*this);
// Eliminate decided views from unsubscribed views
for (int i=n_x; i-- > n_s; )
switch (holds(x[i],y)) {
case RT_FALSE: x[i]=x[--n_x]; break;
case RT_TRUE: x[i]=x[--n_x]; c--; break;
case RT_MAYBE: break;
default: GECODE_NEVER;
}
x.size(n_x);
if (c < 0)
return ES_FAILED;
if (c >= n_x)
return home.ES_SUBSUMED(*this);
if (c == 0) {
// All views must be different
GECODE_ES_CHECK(post_false(home,x,y));
return home.ES_SUBSUMED(*this);
}
// Now, there must be new subscriptions from x[n_s] up to x[n_x-c+1]
int m = n_x-c;
while (n_s <= m)
x[n_s++].subscribe(home,*this,PC_INT_DOM,false);
return ES_FIX;
}
}}}
// STATISTICS: int-prop
|