This file is indexed.

/usr/include/gecode/int/arithmetic/nroot.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
 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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2012
 *
 *  Last modified:
 *     $Date: 2013-08-29 16:05:54 +0200 (Thu, 29 Aug 2013) $ by $Author: schulte $
 *     $Revision: 13993 $
 *
 *  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.
 *
 */

#include <gecode/int/rel.hh>

#include <climits>
#include <algorithm>

namespace Gecode { namespace Int { namespace Arithmetic {

  /*
   * Positive bounds consistent nth root
   *
   */

  template<class Ops, bool minus>
  forceinline ExecStatus
  prop_nroot_plus_bnd(Space& home, IntView x0, IntView x1, const Ops& ops) {
    if (minus) {
      bool mod;
      do {
        mod = false;
        {
          ModEvent me = x1.gq(home,-ops.cnroot(-x0.min()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x1.lq(home,-ops.cnroot(-x0.max()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x0.gq(home,-ops.tpow(-x1.min()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x0.lq(home,-(ops.tpow(-x1.max()-1)+1));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
      } while (mod);
    } else {
      bool mod;
      do {
        mod = false;
        {
          ModEvent me = x1.lq(home,ops.fnroot(x0.max()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x1.gq(home,ops.fnroot(x0.min()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x0.le(home,ops.tpow(x1.max()+1));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
        {
          ModEvent me = x0.gq(home,ops.tpow(x1.min()));
          if (me_failed(me)) return ES_FAILED;
          mod |= me_modified(me);
        }
      } while (mod);
    }
    return ES_OK;
  }

  template<class Ops, bool minus>
  forceinline
  NrootPlusBnd<Ops,minus>::NrootPlusBnd(Home home, IntView x0, IntView x1, 
                                        const Ops& o)
    : BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), 
      ops(o) {}

  template<class Ops, bool minus>
  forceinline ExecStatus
  NrootPlusBnd<Ops,minus>::post(Home home, IntView x0, IntView x1, Ops ops) {
    if (minus) {
      GECODE_ME_CHECK(x0.lq(home,0));
      GECODE_ME_CHECK(x1.lq(home,0));
    } else {
      GECODE_ME_CHECK(x0.gq(home,0));
      GECODE_ME_CHECK(x1.gq(home,0));
    }
    (void) new (home) NrootPlusBnd<Ops,minus>(home,x0,x1,ops);
    return ES_OK;
  }

  template<class Ops, bool minus>
  forceinline
  NrootPlusBnd<Ops,minus>::NrootPlusBnd(Space& home, bool share, 
                                        NrootPlusBnd<Ops,minus>& p)
    : BinaryPropagator<IntView,PC_INT_BND>(home,share,p), 
      ops(p.ops) {}

  template<class Ops, bool minus>
  Actor*
  NrootPlusBnd<Ops,minus>::copy(Space& home, bool share) {
    return new (home) NrootPlusBnd<Ops,minus>(home,share,*this);
  }

  template<class Ops, bool minus>
  ExecStatus
  NrootPlusBnd<Ops,minus>::propagate(Space& home, const ModEventDelta&) {
    GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops)));
    return x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX;
  }


  /*
   * Bounds consistent nth root
   *
   */

  template<class Ops>
  forceinline ExecStatus
  prop_nroot_bnd(Space& home, IntView x0, IntView x1, const Ops& ops) {
    assert((x0.min() < 0) && (x0.max() > 0));
    assert((x1.min() < 0) && (x1.max() > 0));
    
    GECODE_ME_CHECK(x1.lq(home,ops.fnroot(x0.max())));
    GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-x0.min())));
    GECODE_ME_CHECK(x0.le(home,ops.tpow(x1.max()+1)));
    GECODE_ME_CHECK(x0.gq(home,ops.tpow(x1.min()-1)+1));

    return ES_OK;
  }

  template<class Ops>
  forceinline
  NrootBnd<Ops>::NrootBnd(Home home, IntView x0, IntView x1, const Ops& o)
    : BinaryPropagator<IntView,PC_INT_BND>(home,x0,x1), 
      ops(o) {}

  template<class Ops>
  forceinline ExecStatus
  NrootBnd<Ops>::post(Home home, IntView x0, IntView x1, Ops ops) {
    if (static_cast<unsigned int>(ops.exp()) >= sizeof(int) * CHAR_BIT) {
      // The integer limits allow only -2, -1, 0, 1 for x1
      GECODE_ME_CHECK(x1.lq(home,1));
      GECODE_ME_CHECK(x1.gq(home,-2));
      // Just rewrite to values that can be handeled without overflow
      ops.exp(ops.even() ? 30 : 31);
    }

    if (ops.exp() == 0) {
      GECODE_ME_CHECK(x1.eq(home,1));
      return ES_OK;
    } else if (ops.exp() == 1) {
      return Rel::EqBnd<IntView,IntView>::post(home,x0,x1);      
    }

    if (same(x0,x1)) {
      assert(ops.exp() > 1);
      GECODE_ME_CHECK(x0.lq(home,1));
      GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -2));
      return ES_OK;
    } 

    // Limits values such that no overflow can occur
    GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max)));
    GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min)));

    if (ops.even()) {
      GECODE_ME_CHECK(x0.gq(home,0));
      GECODE_ME_CHECK(x1.gq(home,0));
    }

    if ((x0.min() >= 0) || (x1.min() >= 0))
      return NrootPlusBnd<Ops,false>::post(home,x0,x1,ops);

    if ((x0.max() <= 0) || (x1.max() <= 0))
      return NrootPlusBnd<Ops,true>::post(home,x0,x1,ops);

    assert((x0.min() < 0) && (x0.max() > 0));
    assert((x1.min() < 0) && (x1.max() > 0));
    GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops));
    (void) new (home) NrootBnd(home,x0,x1,ops);
    return ES_OK;
  }

  template<class Ops>
  forceinline
  NrootBnd<Ops>::NrootBnd(Space& home, bool share, NrootBnd<Ops>& p)
    : BinaryPropagator<IntView,PC_INT_BND>(home,share,p), 
      ops(p.ops) {}

  template<class Ops>
  Actor*
  NrootBnd<Ops>::copy(Space& home, bool share) {
    return new (home) NrootBnd<Ops>(home,share,*this);
  }

  template<class Ops>
  ExecStatus
  NrootBnd<Ops>::propagate(Space& home, const ModEventDelta&) {
    assert(!ops.even());
    if ((x0.min() >= 0) || (x1.min() >= 0))
      GECODE_REWRITE(*this,(NrootPlusBnd<Ops,false>::post(home,x0,x1,ops)));

    if ((x0.max() <= 0) || (x1.max() <= 0))
      GECODE_REWRITE(*this,(NrootPlusBnd<Ops,true>::post(home,x0,x1,ops)));

    GECODE_ES_CHECK(prop_nroot_bnd(home,x0,x1,ops));

    return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this) : ES_NOFIX;
  }


  /*
   * Domain consistent nth root
   *
   */
  /// Mapping ranges to powers
  template<class Ops>
  class RangesMapPow {
  protected:
    /// Power operations
    Ops ops;
  public:
    /// Initialize with operations \a o
    forceinline RangesMapPow(const Ops& o) : ops(o) {}
    /// Perform mapping of minimum
    forceinline int min(int x) const {
      return ops.tpow(x);
    }
    /// Perform mapping of maximum
    forceinline int max(int x) const {
      return ops.tpow(x+1)-1;
    }
  };

  /// Mapping integer to n-th root
  template<class Ops>
  class RangesMapNroot {
  protected:
    /// Power operations
    Ops ops;
  public:
    /// Initialize with operations \a o
    forceinline RangesMapNroot(const Ops& o) : ops(o) {}
    /// Perform mapping of minimum
    forceinline int min(int x) const {
      return (x < 0) ? -ops.cnroot(-x) : ops.fnroot(x);
    }
    /// Perform mapping of maximum
    forceinline int max(int x) const {
      return (x < 0) ? -ops.cnroot(-x) : ops.fnroot(x);
    }
 };

  template<class Ops, bool minus>
  forceinline
  NrootPlusDom<Ops,minus>::NrootPlusDom(Home home, IntView x0, IntView x1, 
                                        const Ops& o)
    : BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1),
      ops(o) {}

  template<class Ops, bool minus>
  forceinline ExecStatus
  NrootPlusDom<Ops,minus>::post(Home home, IntView x0, IntView x1, Ops ops) {
    if (minus) {
      GECODE_ME_CHECK(x0.lq(home,0));
      GECODE_ME_CHECK(x1.lq(home,0));
    } else {
      GECODE_ME_CHECK(x0.gq(home,0));
      GECODE_ME_CHECK(x1.gq(home,0));
    }
    GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops)));
    (void) new (home) NrootPlusDom<Ops,minus>(home,x0,x1,ops);
    return ES_OK;
  }

  template<class Ops, bool minus>
  forceinline
  NrootPlusDom<Ops,minus>::NrootPlusDom(Space& home, bool share, 
                                        NrootPlusDom<Ops,minus>& p)
    : BinaryPropagator<IntView,PC_INT_DOM>(home,share,p), 
      ops(p.ops) {}

  template<class Ops, bool minus>
  Actor*
  NrootPlusDom<Ops,minus>::copy(Space& home, bool share) {
    return new (home) NrootPlusDom<Ops,minus>(home,share,*this);
  }

  template<class Ops, bool minus>
  PropCost
  NrootPlusDom<Ops,minus>::cost(const Space&, const ModEventDelta& med) const {
    if (IntView::me(med) == ME_INT_VAL)
      return PropCost::unary(PropCost::LO);
    else if (IntView::me(med) == ME_INT_DOM)
      return PropCost::binary(PropCost::HI);
    else
      return PropCost::binary(PropCost::LO);
  }

  template<class Ops, bool minus>
  ExecStatus
  NrootPlusDom<Ops,minus>::propagate(Space& home, const ModEventDelta& med) {
    if (IntView::me(med) != ME_INT_DOM) {
      GECODE_ES_CHECK((prop_nroot_plus_bnd<Ops,minus>(home,x0,x1,ops)));
      return x1.assigned() ? home.ES_SUBSUMED(*this)
        : home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM));
    }

    {
      ViewRanges<IntView> r(x0);
      RangesMapNroot<Ops> rmn(ops);
      Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> 
        m(r,rmn);
      GECODE_ME_CHECK(x1.inter_r(home,m,false));
    }

    {
      ViewRanges<IntView> r(x1);
      RangesMapPow<Ops> rmp(ops);
      Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> 
        m(r,rmp);
      GECODE_ME_CHECK(x0.inter_r(home,m,false));
    }

    return x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX;
  }



  template<class Ops>
  forceinline
  NrootDom<Ops>::NrootDom(Home home, IntView x0, IntView x1, const Ops& o)
    : BinaryPropagator<IntView,PC_INT_DOM>(home,x0,x1),
      ops(o) {}

  template<class Ops>
  forceinline ExecStatus
  NrootDom<Ops>::post(Home home, IntView x0, IntView x1, Ops ops) {
    if (static_cast<unsigned int>(ops.exp()) >= sizeof(int) * CHAR_BIT) {
      // The integer limits allow only -2, -1, 0, 1 for x1
      GECODE_ME_CHECK(x1.lq(home,1));
      GECODE_ME_CHECK(x1.gq(home,-2));
      // Just rewrite to values that can be handeled without overflow
      ops.exp(ops.even() ? 30 : 31);
    }

    if (ops.exp() == 0) {
      GECODE_ME_CHECK(x1.eq(home,1));
      return ES_OK;
    } else if (ops.exp() == 1) {
      return Rel::EqDom<IntView,IntView>::post(home,x0,x1);      
    }

    if (same(x0,x1)) {
      assert(ops.exp() > 1);
      GECODE_ME_CHECK(x0.lq(home,1));
      GECODE_ME_CHECK(x0.gq(home,ops.even() ? 0 : -2));
      return ES_OK;
    } 

    // Limits values such that no overflow can occur
    GECODE_ME_CHECK(x1.lq(home,ops.fnroot(Limits::max)));
    GECODE_ME_CHECK(x1.gq(home,-ops.cnroot(-Limits::min)));

    if (ops.even()) {
      GECODE_ME_CHECK(x0.gq(home,0));
      GECODE_ME_CHECK(x1.gq(home,0));
    }

    if ((x0.min() >= 0) || (x1.min() >= 0))
      return NrootPlusDom<Ops,false>::post(home,x0,x1,ops);

    if ((x0.max() <= 0) || (x1.max() <= 0))
      return NrootPlusDom<Ops,true>::post(home,x0,x1,ops);

    assert((x0.min() < 0) && (x0.max() > 0));
    assert((x1.min() < 0) && (x1.max() > 0));
    GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops));
    (void) new (home) NrootDom(home,x0,x1,ops);
    return ES_OK;
  }

  template<class Ops>
  forceinline
  NrootDom<Ops>::NrootDom(Space& home, bool share, NrootDom<Ops>& p)
    : BinaryPropagator<IntView,PC_INT_DOM>(home,share,p), 
      ops(p.ops) {}

  template<class Ops>
  Actor*
  NrootDom<Ops>::copy(Space& home, bool share) {
    return new (home) NrootDom<Ops>(home,share,*this);
  }

  template<class Ops>
  PropCost
  NrootDom<Ops>::cost(const Space&, const ModEventDelta& med) const {
    if (IntView::me(med) == ME_INT_VAL)
      return PropCost::unary(PropCost::LO);
    else if (IntView::me(med) == ME_INT_DOM)
      return PropCost::binary(PropCost::HI);
    else
      return PropCost::binary(PropCost::LO);
  }

  template<class Ops>
  ExecStatus
  NrootDom<Ops>::propagate(Space& home, const ModEventDelta& med) {
    assert(!ops.even());
    if ((x0.min() >= 0) || (x1.min() >= 0))
      GECODE_REWRITE(*this,(NrootPlusDom<Ops,false>::post(home,x0,x1,ops)));

    if ((x0.max() <= 0) || (x1.max() <= 0))
      GECODE_REWRITE(*this,(NrootPlusDom<Ops,true>::post(home,x0,x1,ops)));

    if (IntView::me(med) != ME_INT_DOM) {
      GECODE_ES_CHECK(prop_nroot_bnd<Ops>(home,x0,x1,ops));
      return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this)
        : home.ES_NOFIX_PARTIAL(*this,IntView::med(ME_INT_DOM));
    }

    {
      ViewRanges<IntView> r(x0);
      RangesMapNroot<Ops> rmn(ops);
      Iter::Ranges::Map<ViewRanges<IntView>,RangesMapNroot<Ops>,false> 
        m(r,rmn);
      GECODE_ME_CHECK(x1.inter_r(home,m,false));
    }

    {
      ViewRanges<IntView> r(x1);
      RangesMapPow<Ops> rmp(ops);
      Iter::Ranges::Map<ViewRanges<IntView>,RangesMapPow<Ops>,true> 
        m(r,rmp);
      GECODE_ME_CHECK(x0.inter_r(home,m,false));
    }

    return x0.assigned() && x1.assigned() ? home.ES_SUBSUMED(*this) : ES_FIX;
  }


}}}

// STATISTICS: int-prop