/usr/include/gecode/int/branch/view-values.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 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2008
*
* Last modified:
* $Date: 2017-04-01 20:27:10 +0200 (Sat, 01 Apr 2017) $ by $Author: schulte $
* $Revision: 15623 $
*
* 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 Branch {
/// %Choice storing position and values for integer views
class GECODE_VTABLE_EXPORT PosValuesChoice : public PosChoice {
private:
/// Information about position and minimum
class PosMin {
public:
/// Start position of range
unsigned int pos;
/// Minmum of range
int min;
};
/// Number of ranges
unsigned int n;
/// Values to assign to
PosMin* pm;
public:
/// Initialize choice for brancher \a b, position \a p, and view \a x
GECODE_INT_EXPORT
PosValuesChoice(const Brancher& b, const Pos& p, IntView x);
/// Initialize choice for brancher \a b from archive \a e
GECODE_INT_EXPORT
PosValuesChoice(const Brancher& b, unsigned int alt, Pos p, Archive& e);
/// Return value to branch with for alternative \a a
int val(unsigned int a) const;
/// Report size occupied
GECODE_INT_EXPORT
virtual size_t size(void) const;
/// Deallocate
GECODE_INT_EXPORT
virtual ~PosValuesChoice(void);
/// Archive into \a e
GECODE_INT_EXPORT
virtual void archive(Archive& e) const;
};
forceinline int
PosValuesChoice::val(unsigned int a) const {
PosMin* l = &pm[0];
PosMin* r = &pm[n-1];
while (true) {
PosMin* m = l + (r-l)/2;
if (a < m->pos) {
r=m-1;
} else if (a >= (m+1)->pos) {
l=m+1;
} else {
return m->min + static_cast<int>(a - m->pos);
}
}
GECODE_NEVER;
return 0;
}
template<int n, bool min, class Filter, class Print>
forceinline
ViewValuesBrancher<n,min,Filter,Print>::
ViewValuesBrancher(Home home, ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp)
: ViewBrancher<IntView,Filter,n>(home,x,vs,bf), p(vvp) {
if (p.notice())
home.notice(*this,AP_DISPOSE,true);
}
template<int n, bool min, class Filter, class Print>
forceinline void
ViewValuesBrancher<n,min,Filter,Print>::post(Home home,
ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp) {
(void) new (home) ViewValuesBrancher<n,min,Filter,Print>(home,x,vs,bf,vvp);
}
template<int n, bool min, class Filter, class Print>
forceinline
ViewValuesBrancher<n,min,Filter,Print>::
ViewValuesBrancher(Space& home, bool shared, ViewValuesBrancher& b)
: ViewBrancher<IntView,Filter,n>(home,shared,b), p(home,shared,b.p) {}
template<int n, bool min, class Filter, class Print>
Actor*
ViewValuesBrancher<n,min,Filter,Print>::copy(Space& home, bool shared) {
return new (home) ViewValuesBrancher<n,min,Filter,Print>
(home,shared,*this);
}
template<int n, bool min, class Filter, class Print>
const Choice*
ViewValuesBrancher<n,min,Filter,Print>::choice(Space& home) {
Pos p = ViewBrancher<IntView,Filter,n>::pos(home);
return new PosValuesChoice(*this,p,
ViewBrancher<IntView,Filter,n>::view(p));
}
template<int n, bool min, class Filter, class Print>
const Choice*
ViewValuesBrancher<n,min,Filter,Print>::choice
(const Space& home, Archive& e) {
(void) home;
int p;
unsigned int a;
e >> p >> a;
return new PosValuesChoice(*this,a,p,e);
}
template<int n, bool min, class Filter, class Print>
ExecStatus
ViewValuesBrancher<n,min,Filter,Print>::commit(Space& home, const Choice& c,
unsigned int a) {
const PosValuesChoice& pvc
= static_cast<const PosValuesChoice&>(c);
IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos()));
unsigned int b = min ? a : (pvc.alternatives() - 1 - a);
return me_failed(x.eq(home,pvc.val(b))) ? ES_FAILED : ES_OK;
}
template<int n, bool min, class Filter, class Print>
NGL*
ViewValuesBrancher<n,min,Filter,Print>::ngl(Space& home, const Choice& c,
unsigned int a) const {
const PosValuesChoice& pvc
= static_cast<const PosValuesChoice&>(c);
IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos()));
unsigned int b = min ? a : (pvc.alternatives() - 1 - a);
return new (home) EqNGL<IntView>(home,x,pvc.val(b));
}
template<int n, bool min, class Filter, class Print>
void
ViewValuesBrancher<n,min,Filter,Print>::print(const Space& home,
const Choice& c,
unsigned int a,
std::ostream& o) const {
const PosValuesChoice& pvc
= static_cast<const PosValuesChoice&>(c);
IntView x(ViewBrancher<IntView,Filter,n>::view(pvc.pos()));
unsigned int b = min ? a : (pvc.alternatives() - 1 - a);
int nn = pvc.val(b);
if (p)
p(home,*this,a,x,pvc.pos().pos,nn,o);
else
o << "var[" << pvc.pos().pos << "] = " << nn;
}
template<int n, bool min, class Filter, class Print>
forceinline size_t
ViewValuesBrancher<n,min,Filter,Print>::dispose(Space& home) {
if (p.notice())
home.ignore(*this,AP_DISPOSE,true);
(void) ViewBrancher<IntView,Filter,n>::dispose(home);
return sizeof(ViewValuesBrancher<n,min,Filter,Print>);
}
template<int n, bool min>
forceinline void
postviewvaluesbrancher(Home home, ViewArray<IntView>& x,
ViewSel<IntView>* vs[n],
IntBranchFilter bf,
IntVarValPrint vvp) {
if (bf) {
if (vvp) {
ViewValuesBrancher<n,min,BrancherFilter<IntView>,
BrancherPrint<IntView,int> >
::post(home,x,vs,bf,vvp);
} else {
ViewValuesBrancher<n,min,BrancherFilter<IntView>,
BrancherNoPrint<IntView,int> >
::post(home,x,vs,bf,vvp);
}
} else {
if (vvp) {
ViewValuesBrancher<n,min,BrancherNoFilter<IntView>,
BrancherPrint<IntView,int> >
::post(home,x,vs,bf,vvp);
} else {
ViewValuesBrancher<n,min,BrancherNoFilter<IntView>,
BrancherNoPrint<IntView,int> >
::post(home,x,vs,bf,vvp);
}
}
}
}}}
// STATISTICS: int-branch
|