This file is indexed.

/usr/include/gecode/int/view/minus.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
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2003
 *
 *  Last modified:
 *     $Date: 2013-02-14 16:29:11 +0100 (Thu, 14 Feb 2013) $ by $Author: schulte $
 *     $Revision: 13292 $
 *
 *  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 {

  /*
   * Constructors and initialization
   *
   */
  forceinline
  MinusView::MinusView(void) {}
  forceinline
  MinusView::MinusView(const IntView& y)
    : DerivedView<IntView>(y) {}


  /*
   * Value access
   *
   */
  forceinline int
  MinusView::min(void) const {
    return -x.max();
  }
  forceinline int
  MinusView::max(void) const {
    return -x.min();
  }
  forceinline int
  MinusView::val(void) const {
    return -x.val();
  }

  forceinline unsigned int
  MinusView::width(void) const {
    return x.width();
  }
  forceinline unsigned int
  MinusView::size(void) const {
    return x.size();
  }
  forceinline unsigned int
  MinusView::regret_min(void) const {
    return x.regret_max();
  }
  forceinline unsigned int
  MinusView::regret_max(void) const {
    return x.regret_min();
  }


  /*
   * Domain tests
   *
   */
  forceinline bool
  MinusView::range(void) const {
    return x.range();
  }
  forceinline bool
  MinusView::in(int n) const {
    return x.in(-n);
  }
  forceinline bool
  MinusView::in(long long int n) const {
    return x.in(-n);
  }


  /*
   * Domain update by value
   *
   */
  forceinline ModEvent
  MinusView::lq(Space& home, int n) {
    return x.gq(home,-n);
  }
  forceinline ModEvent
  MinusView::lq(Space& home, long long int n) {
    return x.gq(home,-n);
  }

  forceinline ModEvent
  MinusView::le(Space& home, int n) {
    return x.gr(home,-n);
  }
  forceinline ModEvent
  MinusView::le(Space& home, long long int n) {
    return x.gr(home,-n);
  }

  forceinline ModEvent
  MinusView::gq(Space& home, int n) {
    return x.lq(home,-n);
  }
  forceinline ModEvent
  MinusView::gq(Space& home, long long int n) {
    return x.lq(home,-n);
  }

  forceinline ModEvent
  MinusView::gr(Space& home, int n) {
    return x.le(home,-n);
  }
  forceinline ModEvent
  MinusView::gr(Space& home, long long int n) {
    return x.le(home,-n);
  }

  forceinline ModEvent
  MinusView::nq(Space& home, int n) {
    return x.nq(home,-n);
  }
  forceinline ModEvent
  MinusView::nq(Space& home, long long int n) {
    return x.nq(home,-n);
  }

  forceinline ModEvent
  MinusView::eq(Space& home, int n) {
    return x.eq(home,-n);
  }
  forceinline ModEvent
  MinusView::eq(Space& home, long long int n) {
    return x.eq(home,-n);
  }


  /*
   * Iterator-based domain update
   *
   */
  template<class I>
  forceinline ModEvent
  MinusView::narrow_r(Space& home, I& i, bool) {
    Region r(home);
    Iter::Ranges::Minus mi(r,i);
    return x.narrow_r(home,mi,false);
  }
  template<class I>
  forceinline ModEvent
  MinusView::inter_r(Space& home, I& i, bool) {
    Region r(home);
    Iter::Ranges::Minus mi(r,i);
    return x.inter_r(home,mi,false);
  }
  template<class I>
  forceinline ModEvent
  MinusView::minus_r(Space& home, I& i, bool) {
    Region r(home);
    Iter::Ranges::Minus mi(r,i);
    return x.minus_r(home,mi,false);
  }
  template<class I>
  forceinline ModEvent
  MinusView::narrow_v(Space& home, I& i, bool) {
    Region r(home);
    Iter::Values::Minus mi(r,i);
    return x.narrow_v(home,mi,false);
  }
  template<class I>
  forceinline ModEvent
  MinusView::inter_v(Space& home, I& i, bool) {
    Region r(home);
    Iter::Values::Minus mi(r,i);
    return x.inter_v(home,mi,false);
  }
  template<class I>
  forceinline ModEvent
  MinusView::minus_v(Space& home, I& i, bool) {
    Region r(home);
    Iter::Values::Minus mi(r,i);
    return x.minus_v(home,mi,false);
  }


  /*
   * Propagator modification events
   *
   */
  forceinline ModEventDelta
  MinusView::med(ModEvent me) {
    return IntView::med(me);
  }


  /*
   * Delta information for advisors
   *
   */
  forceinline int
  MinusView::min(const Delta& d) const {
    return -x.max(d);
  }
  forceinline int
  MinusView::max(const Delta& d) const {
    return -x.min(d);
  }
  forceinline bool
  MinusView::any(const Delta& d) const {
    return x.any(d);
  }


  /**
   * \brief %Range iterator for minus integer views
   * \ingroup TaskActorIntView
   */
  template<>
  class ViewRanges<MinusView> : public IntVarImpBwd {
  public:
    /// \name Constructors and initialization
    //@{
    /// Default constructor
    ViewRanges(void);
    /// Initialize with ranges for view \a x
    ViewRanges(const MinusView& x);
    /// Initialize with ranges for view \a x
    void init(const MinusView& x);
    //@}

    /// \name Range access
    //@{
    /// Return smallest value of range
    int min(void) const;
    /// Return largest value of range
    int max(void) const;
    //@}
  };

  forceinline
  ViewRanges<MinusView>::ViewRanges(void) {}

  forceinline
  ViewRanges<MinusView>::ViewRanges(const MinusView& x)
    : IntVarImpBwd(x.base().varimp()) {}

  forceinline void
  ViewRanges<MinusView>::init(const MinusView& x) {
    IntVarImpBwd::init(x.base().varimp());
  }

  forceinline int
  ViewRanges<MinusView>::min(void) const {
    return -IntVarImpBwd::max();
  }
  forceinline int
  ViewRanges<MinusView>::max(void) const {
    return -IntVarImpBwd::min();
  }

  inline int
  MinusView::med(void) const {
    if (x.range())
      return (min()+max())/2 - ((min()+max())%2 < 0 ? 1 : 0);

    unsigned int i = x.size() / 2;
    if (size() % 2 == 0)
      i--;
    ViewRanges<MinusView> r(*this);
    while (i >= r.width()) {
      i -= r.width();
      ++r;
    }
    return r.min() + static_cast<int>(i);
  }

}}

// STATISTICS: int-var