This file is indexed.

/usr/include/claw/it_index.hpp is in libclaw-dev 1.7.0-2.

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
/*
  CLAW - a C++ Library Absolutely Wonderful

  CLAW is a free library without any particular aim but being useful to 
  anyone.

  Copyright (C) 2005-2011 Julien Jorge

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Lesser General Public
  License as published by the Free Software Foundation; either
  version 2.1 of the License, or (at your option) any later version.

  This library is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  Lesser General Public License for more details.

  You should have received a copy of the GNU Lesser General Public
  License along with this library; if not, write to the Free Software
  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA

  contact: julien.jorge@gamned.org
*/
/**
 * \file it_index.hpp
 * \brief A class to manage an index and an iterator easily.
 * \author Julien Jorge
 */
#ifndef __CLAW_IT_INDEX_HPP__
#define __CLAW_IT_INDEX_HPP__

#include <iostream>

namespace claw
{
  /**
   * \brief A class to manage an index and an iterator easily.
   * \param T Type of the iterator.
   * \author Julien Jorge
   */
  template<class T> class it_index
  {
  public:
    typedef typename std::iterator_traits<T>::value_type value_type;
    typedef typename std::iterator_traits<T>::difference_type difference_type;
    typedef typename std::iterator_traits<T>::pointer pointer;
    typedef typename std::iterator_traits<T>::reference reference;

  private:
    /** \brief Iterator. */
    T   m_it;

    /** \brief Iterator's position. */
    int m_index;

  public:
    /** \brief Constructor. */
    it_index() 
      : m_it(), m_index()
    { }

    /**
     * \brief Constructor.
     * \param it The iterator.
     * \param index Iterator's position.
     */
    it_index(const T& it, int index=0) 
      : m_it(it), m_index(index)
    { }

    /**
     * \brief Copy constructor.
     * \param that it_index to copy from.
     */
    it_index( const it_index<T>& that ) 
      : m_it( that.m_it ), m_index( that.m_index )
    { }

    /**
     * \brief Change the current pair.
     * \param it The new iterator.
     * \param index New iterator's position.
     */
    void set( const T& it, int index )
    {
      m_it = it;
      m_index = index;
    }

    bool operator<( const it_index<T>& that ) const
    { return m_index < that.m_index; }

    bool operator<( const T& it ) const { return m_it < it; }
    bool operator<( int index ) const { return m_index < index; }
  
    bool operator<=( const it_index<T>& that ) const
    { return (*this < that) || (*this == that); }
    bool operator<=( const T& it ) const { return m_it <= it; }
    bool operator<=( int index ) const { return m_index <= index; }
  
    bool operator>( const it_index<T>& that ) const
    { return m_index > that.m_index; }
    bool operator>( const T& it ) const { return m_it > it; }
    bool operator>( int index ) const { return m_index > index; }
        
    bool operator>=( const it_index<T>& that ) const
    { return (*this > that) || (*this == that); }
    bool operator>=( const T& it ) const { return m_it >= it; }
    bool operator>=( int index ) const { return m_index >= index; }

    bool operator==( const it_index<T>& that ) const
    { return (m_it == that.m_it) && (m_index == that.m_index); }
    bool operator==( const T& it ) const { return m_it == it; }
    bool operator==( int index ) const { return m_index==index; }

    bool operator!=( const it_index<T>& that ) const
    { return !(*this == *that); }
    bool operator!=( const T& it ) const { return m_it != it; }
    bool operator!=( int index ) const { return m_index!=index; }

    it_index<T> operator+( int index ) const
    { return it_index<T>(m_it + index, m_index + index); }
    it_index<T> operator-( int index ) const
    { return it_index<T>(m_it - index, m_index - index); }
    it_index<T> operator*( int index ) const
    { return it_index<T>(m_it + (index-1) * m_index, m_index * index); }
    it_index<T> operator/( int index ) const
    { return it_index<T>(m_it - (m_index - m_index/index), m_index / index); }
  
    reference operator*() const { return *m_it; }
    pointer operator->() const { return &*m_it; }

    // Préincrément
    it_index<T>& operator++() 
    {
      ++m_it;
      ++m_index;
      return *this;
    }

    // Postincrément
    it_index<T> operator++(int) 
    {
      it_index<T> r(*this);
      ++(this);
      return r;
    }

    // Préincrément
    it_index<T>& operator--() 
    {
      --m_it;
      --m_index;
      return *this;
    }

    // Postincrément
    it_index<T> operator--(int) 
    {
      it_index<T> r(*this);
      --(this);
      return r;
    }

    it_index<T>& operator+=( int index ) 
    { 
      m_it += index;
      m_index += index;
      return *this;
    }
  
    it_index<T>& operator-=( int index ) 
    { 
      m_it -= index;
      m_index -= index;
      return *this;
    }
  
    it_index<T>& operator*=( int index ) 
    { 
      m_it += (index-1) * m_index;
      m_index *= index;
      return *this;
    }
  
    it_index<T>& operator/=( int index ) 
    { 
      m_it -= m_index - m_index/index;
      m_index /= index;
      return *this;
    }
  
    operator int() const { return m_index; }
    operator T() const { return m_it; }
  
  }; // it_index;

} // namespace claw

#endif // __CLAW_IT_INDEX_HPP__