This file is indexed.

/usr/include/gecode/iter/ranges-add.hpp is in libgecode-dev 3.7.3-1.

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
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2005
 *
 *  Last modified:
 *     $Date: 2010-07-29 01:35:33 +1000 (Thu, 29 Jul 2010) $ by $Author: schulte $
 *     $Revision: 11294 $
 *
 *  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 Iter { namespace Ranges {

  /**
   * \brief Range iterator for adding a single range to a range iterator
   *
   * \ingroup FuncIterRanges
   */
  template<class I>
  class AddRange : public MinMax {
  protected:
    /// Iterator to which the range is to be added
    I i;
    /// Minimum of range to be added
    int r_min;
    /// Maximum of range to be added
    int r_max;
  public:
    /// \name Constructors and initialization
    //@{
    /// Default constructor
    AddRange(void);
    /// Initialize with ranges \a i and range \a min to \a max
    AddRange(I& i, int min, int max);
    /// Initialize with ranges \a i and range \a min to \a max
    void init(I& i, int min, int max);
    //@}

    /// \name Iteration control
    //@{
    /// Move iterator to next range (if possible)
    void operator ++(void);
    //@}
  };


  /**
   * \brief Range iterator for subtracting a single range from a range iterator
   *
   * \ingroup FuncIterRanges
   */
  template<class I>
  class SubRange : public AddRange<I> {
  public:
    /// \name Constructors and initialization
    //@{
    /// Default constructor
    SubRange(void);
    /// Initialize with ranges \a i and range \a min to \a max
    SubRange(I& i, int min, int max);
    /// Initialize with ranges \a i and range \a min to \a max
    void init(I& i, int min, int max);
    //@}
  };

  template<class I>
  forceinline
  AddRange<I>::AddRange(void) {}

  template<class I>
  forceinline void
  AddRange<I>::operator ++(void) {
    if (i()) {
      mi = r_min + i.min();
      ma = r_max + i.max();
      ++i;
      while (i() && (ma+1 >= r_min+i.min())) {
        ma = r_max + i.max(); ++i;
      }
    } else {
      finish();
    }
  }

  template<class I>
  forceinline
  AddRange<I>::AddRange(I& i0, int r_min0, int r_max0)
    : i(i0), r_min(r_min0), r_max(r_max0) {
    operator ++();
  }

  template<class I>
  forceinline void
  AddRange<I>::init(I& i0, int r_min0, int r_max0) {
    i = i0; r_min = r_min0; r_max = r_max0;
    operator ++();
  }


  template<class I>
  forceinline
  SubRange<I>::SubRange(void) {}

  template<class I>
  forceinline
  SubRange<I>::SubRange(I& i, int r_min, int r_max)
    : AddRange<I>(i,-r_max,-r_min) {}

  template<class I>
  forceinline void
  SubRange<I>::init(I& i, int r_min, int r_max) {
    AddRange<I>::init(i,-r_max,-r_min);
  }

}}}

// STATISTICS: iter-any