/usr/include/gecode/int/view/scale.hpp is in libgecode-dev 3.7.1-3.
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 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
*
* Last modified:
* $Date: 2011-09-28 14:50:49 +0200 (Wed, 28 Sep 2011) $ by $Author: tack $
* $Revision: 12418 $
*
* 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 {
/*
* Support functions for division
*
*/
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::floor_div(double y) const {
return static_cast<Val>(floor(y / a));
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::ceil_div(double y) const {
return static_cast<Val>(ceil(y / a));
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::exact_div(double y, bool& exact) const {
double ya = y / a;
if (ceil(ya) == ya) {
exact = true; return static_cast<Val>(ya);
} else {
exact = false; return 0;
}
}
#if GECODE_INT_RND_TWDS_ZERO
template<class Val, class UnsVal>
forceinline int
ScaleView<Val,UnsVal>::floor_div(int y) const {
return ((y >= 0) ? y : (y-a+1))/a;
}
template<class Val, class UnsVal>
forceinline int
ScaleView<Val,UnsVal>::ceil_div(int y) const {
return ((y >= 0) ? (y+a-1) : y)/a;
}
template<class Val, class UnsVal>
forceinline int
ScaleView<Val,UnsVal>::exact_div(int y, bool& exact) const {
int ya = y / a;
if (a * ya == y) {
exact = true; return ya;
} else {
exact = false; return 0;
}
}
#endif
/*
* Constructors and initialization
*
*/
template<class Val, class UnsVal>
forceinline
ScaleView<Val,UnsVal>::ScaleView(void) {}
template<class Val, class UnsVal>
forceinline
ScaleView<Val,UnsVal>::ScaleView(int b, const IntView& y)
: DerivedView<IntView>(y), a(b) {}
/*
* Value access
*
*/
template<class Val, class UnsVal>
forceinline int
ScaleView<Val,UnsVal>::scale(void) const {
return a;
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::min(void) const {
Val c = x.min(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::max(void) const {
Val c = x.max(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::med(void) const {
Val c = x.med(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::val(void) const {
Val c = x.val(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline UnsVal
ScaleView<Val,UnsVal>::size(void) const {
return static_cast<UnsVal>(x.size());
}
template<class Val, class UnsVal>
forceinline UnsVal
ScaleView<Val,UnsVal>::width(void) const {
UnsVal c = x.width(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline UnsVal
ScaleView<Val,UnsVal>::regret_min(void) const {
UnsVal c = x.regret_min(); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline UnsVal
ScaleView<Val,UnsVal>::regret_max(void) const {
UnsVal c = x.regret_max(); c *= a; return c;
}
/*
* Domain tests
*
*/
template<class Val, class UnsVal>
forceinline bool
ScaleView<Val,UnsVal>::range(void) const {
return x.range();
}
template<class Val, class UnsVal>
forceinline bool
ScaleView<Val,UnsVal>::in(Val n) const {
bool exact;
int nda = exact_div(n, exact);
return exact && x.in(nda);
}
/*
* Domain update by value
*
*/
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::lq(Space& home, Val n) {
return (n >= max()) ? ME_INT_NONE : x.lq(home,floor_div(n));
}
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::le(Space& home, Val n) {
return (n > max()) ? ME_INT_NONE : x.le(home,floor_div(n));
}
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::gq(Space& home, Val n) {
return (n <= min()) ? ME_INT_NONE : x.gq(home,ceil_div(n));
}
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::gr(Space& home, Val n) {
return (n < min()) ? ME_INT_NONE : x.gr(home,ceil_div(n));
}
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::nq(Space& home, Val n) {
bool exact;
int nda = exact_div(n,exact);
return exact ? x.nq(home,nda) : ME_INT_NONE;
}
template<class Val, class UnsVal>
forceinline ModEvent
ScaleView<Val,UnsVal>::eq(Space& home, Val n) {
bool exact;
int nda = exact_div(n,exact);
return exact ? x.eq(home,nda) : ME_INT_FAILED;
}
/*
* Propagator modification events
*
*/
template<class Val, class UnsVal>
forceinline ModEventDelta
ScaleView<Val,UnsVal>::med(ModEvent me) {
return IntView::med(me);
}
/*
* Delta information for advisors
*
*/
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::min(const Delta& d) const {
Val c = x.min(d); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline Val
ScaleView<Val,UnsVal>::max(const Delta& d) const {
Val c = x.max(d); c *= a; return c;
}
template<class Val, class UnsVal>
forceinline bool
ScaleView<Val,UnsVal>::any(const Delta& d) const {
return x.any(d);
}
/*
* Cloning
*
*/
template<class Val, class UnsVal>
forceinline void
ScaleView<Val,UnsVal>::update(Space& home, bool share,
ScaleView<Val,UnsVal>& y) {
DerivedView<IntView>::update(home,share,y);
a=y.a;
}
/**
* \brief %Range iterator for integer-precision scale integer views
* \ingroup TaskActorIntView
*/
template<>
class ViewRanges<IntScaleView>
: public Iter::Ranges::ScaleUp<int,unsigned int,ViewRanges<IntView> > {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
ViewRanges(void);
/// Initialize with ranges for view \a x
ViewRanges(const IntScaleView& x);
/// Initialize with ranges for view \a x
void init(const IntScaleView& x);
//@}
};
forceinline
ViewRanges<IntScaleView>::ViewRanges(void) {}
forceinline
ViewRanges<IntScaleView>::ViewRanges(const IntScaleView& x) {
ViewRanges<IntView> xi(x.base());
Iter::Ranges::ScaleUp<int,unsigned int,ViewRanges<IntView> >::init
(xi,x.scale());
}
forceinline void
ViewRanges<IntScaleView>::init(const IntScaleView& x) {
ViewRanges<IntView> xi(x.base());
Iter::Ranges::ScaleUp<int,unsigned int,ViewRanges<IntView> >::init
(xi,x.scale());
}
/**
* \brief %Range iterator for double-precision scale integer views
* \ingroup TaskActorIntView
*/
template<>
class ViewRanges<DoubleScaleView>
: public Iter::Ranges::ScaleUp<double,double,ViewRanges<IntView> > {
public:
/// \name Constructors and initialization
//@{
/// Default constructor
ViewRanges(void);
/// Initialize with ranges for view \a x
ViewRanges(const DoubleScaleView& x);
/// Initialize with ranges for view \a x
void init(const DoubleScaleView& x);
//@}
};
forceinline
ViewRanges<DoubleScaleView>::ViewRanges(void) {}
forceinline
ViewRanges<DoubleScaleView>::ViewRanges(const DoubleScaleView& x) {
ViewRanges<IntView> xi(x.base());
Iter::Ranges::ScaleUp<double,double,ViewRanges<IntView> >::init
(xi,x.scale());
}
forceinline void
ViewRanges<DoubleScaleView>::init(const DoubleScaleView& x) {
ViewRanges<IntView> xi(x.base());
Iter::Ranges::ScaleUp<double,double,ViewRanges<IntView> >::init
(xi,x.scale());
}
/*
* View comparison
*
*/
template<class Val, class UnsVal>
forceinline bool
same(const ScaleView<Val,UnsVal>& x, const ScaleView<Val,UnsVal>& y) {
return same(x.base(),y.base()) && (x.scale() == y.scale());
}
template<class Val, class UnsVal>
forceinline bool
before(const ScaleView<Val,UnsVal>& x, const ScaleView<Val,UnsVal>& y) {
return before(x.base(),y.base())
|| (same(x.base(),y.base()) && (x.scale() < y.scale()));
}
}}
// STATISTICS: int-var
|