/usr/include/gecode/set/rel/subset.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 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
* Christian Schulte <schulte@gecode.org>
*
* Contributing authors:
* Gabor Szokoli <szokoli@gecode.org>
*
* Copyright:
* Guido Tack, 2004
* Christian Schulte, 2004
* Gabor Szokoli, 2004
*
* 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 Set { namespace Rel {
template<class View0, class View1>
forceinline
Subset<View0,View1>::Subset(Home home, View0 y0, View1 y1)
: MixBinaryPropagator<View0,PC_SET_CGLB,
View1,PC_SET_CLUB>(home,y0,y1) {}
template<class View0, class View1>
forceinline
Subset<View0,View1>::Subset(Space& home, bool share, Subset& p)
: MixBinaryPropagator<View0,PC_SET_CGLB,
View1,PC_SET_CLUB>(home,share,p) {}
template<class View0, class View1>
ExecStatus Subset<View0,View1>::post(Home home, View0 x, View1 y) {
(void) new (home) Subset(home,x,y);
return ES_OK;
}
template<class View0, class View1>
Actor*
Subset<View0,View1>::copy(Space& home, bool share) {
return new (home) Subset(home,share,*this);
}
template<class View0, class View1>
ExecStatus
Subset<View0,View1>::propagate(Space& home, const ModEventDelta&) {
bool oneassigned = x0.assigned() || x1.assigned();
unsigned int x0glbsize;
do {
GlbRanges<View0> x0lb(x0);
GECODE_ME_CHECK ( x1.includeI(home,x0lb) );
GECODE_ME_CHECK ( x1.cardMin(home,x0.cardMin()) );
LubRanges<View1> x1ub(x1);
x0glbsize = x0.glbSize();
GECODE_ME_CHECK ( x0.intersectI(home,x1ub) );
GECODE_ME_CHECK ( x0.cardMax(home,x1.cardMax()) );
} while (x0.glbSize() > x0glbsize);
if (x0.cardMin() == x1.cardMax())
GECODE_REWRITE(*this,(Eq<View0,View1>::post(home(*this),x0,x1)));
if (shared(x0,x1)) {
return oneassigned ? home.ES_SUBSUMED(*this) : ES_NOFIX;
}
return (x0.assigned() || x1.assigned()) ? home.ES_SUBSUMED(*this) : ES_FIX;
}
}}}
// STATISTICS: set-prop
|