This file is indexed.

/usr/include/ThePEG/Utilities/DIterator.h is in libthepeg-dev 1.8.0-1.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
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
// -*- C++ -*-
//
// DIterator.h is a part of ThePEG - Toolkit for HEP Event Generation
// Copyright (C) 1999-2011 Leif Lonnblad
//
// ThePEG is licenced under version 2 of the GPL, see COPYING for details.
// Please respect the MCnet academic guidelines, see GUIDELINES for details.
//
#ifndef ThePEG_DIterator_H
#define ThePEG_DIterator_H
// This is the declaration of the DIterator class.

#include <iterator>

namespace ThePEG {

template <typename BaseIterator>
/**
 * DIterator is an iterator adaptor class. It can be used whenever one
 * has a container with pointers to facilitate member selection. The
 * only requirement is that the underlying pointer is pointing to a
 * valid object. Given e.g. a vector of pointers, <code>vector<A*>
 * pv</code> where the class <code>A</code> has a member function
 * <code>dosomething()</code>, it can be used as follows:<br>
 * <code>typedef DIterator<typename vector<A*>::iterator> It;</code><BR>
 * <code>for ( It i = dv.begin(), i != dv.end(), ++i )
 * i->dosomething();</code><BR>
 */
class DIterator {

public:

  /** Forward typedef from underlying iterator */
  typedef std::iterator_traits<BaseIterator>  	Traits;
  /** Forward typedef from underlying iterator */
  typedef typename Traits::iterator_category 	iterator_category;
  /** Forward typedef from underlying iterator */
  typedef typename Traits::difference_type 	difference_type;
  /** Forward typedef from underlying iterator */
  typedef typename Traits::value_type 		PtrType;
  /** Forward typedef from underlying iterator */
  typedef std::iterator_traits<PtrType>         PtrTraits;
  /** Forward typedef from underlying iterator */
  typedef typename PtrTraits::value_type 	value_type;
  /** Forward typedef from underlying iterator */
  typedef typename PtrTraits::pointer          	pointer;
  /** Forward typedef from underlying iterator */
  typedef typename PtrTraits::reference         reference;

public:

  /**
   * Constructor from a normal iterator.
   */
  DIterator(const BaseIterator & in): i(in) {}

  /**
   * Copy constructor.
   */
  DIterator(const DIterator & pi): i(pi.i) {}
    
public:

  /**
   * Dereference the pointer referred to by the underlying iterator.
   */
  reference operator*() const { return **i; }

  /**
   * Select member from  the pointer referred to by the underlying iterator.
   */
  pointer operator->() const { return *i; }

  /**
   * Standard assignment operator.
   */
  DIterator & operator=(const DIterator & pi) { i = pi.i; return *this; }

  /**
   * Assignment from a a normal iterator.
   */
  DIterator & operator=(const BaseIterator & pi) { i = pi; return *this; }

  /** @name Increment and decrement operators. */
  //@{
  /** Pre increment the underlying iterator. */
  DIterator & operator++() { ++i; return *this; }
  /** Post increment the underlying iterator. */
  DIterator operator++(int) { DIterator tmp(*this); ++i; return tmp; }
  /** Pre decrement the underlying iterator. */
  DIterator & operator--() { --i; return *this; }
  /** Post decrement the underlying iterator. */
  DIterator operator--(int) { DIterator tmp(*this); --i; return tmp; }
  /** Jump forward n steps */
  DIterator & operator+=(int n) { i += n; return *this; }
  /** Get an iterator n steps forward. */
  DIterator operator+(int n) { return DIterator(i + n); }
  /** Jump backward n steps */
  DIterator & operator-=(int n) { i -= n; return *this; }
  /** Get an iterator n steps backward. */
  DIterator operator-(int n) { return DIterator(i - n); }
  //@}

  /**
   * Select a pointer with the given index and return a reference to
   * the object pointed to.
   */
  reference operator[](difference_type n) { return *(i[n]); }

  /**
   * Return the distance to the given iterator.
   */
  difference_type operator-(const DIterator & pi) { return i - pi.i; }

  /** @name Comparison operators. */
  //@{
  /** Test for equality. */
  bool operator==(const DIterator & pi) { return i == pi.i; }
  /** Test for inequality. */
  bool operator!=(const DIterator & pi) { return i != pi.i; }
  /** Test for less. */
  bool operator<(const DIterator & pi) { return i < pi.i; }
  /** Test for greater. */
  bool operator>(const DIterator & pi) { return i > pi.i; }
  /** Test for less or equal. */
  bool operator<=(const DIterator & pi) { return i <= pi.i; }
  /** Test for greater or equal. */
  bool operator>=(const DIterator & pi) { return i >= pi.i; }
  /** Test for equality. */
  bool operator==(const BaseIterator & bi) { return i == bi; }
  /** Test for inequality. */
  bool operator!=(const BaseIterator & bi) { return i != bi; }
  /** Test for less. */
  bool operator<(const BaseIterator & bi) { return i < bi; }
  /** Test for greater. */
  bool operator>(const BaseIterator & bi) { return i > bi; }
  /** Test for less or equal. */
  bool operator<=(const BaseIterator & bi) { return i <= bi; }
  /** Test for greater or equal. */
  bool operator>=(const BaseIterator & bi) { return i >= bi; }
  //@}

private:

  /**
   * The underlying standard iterator.
   */
  BaseIterator i;

private:

  /**
   * The default constructor should never be used.
   */
  DIterator() {}

};

}

#endif /* ThePEG_DIterator_H */