This file is indexed.

/usr/include/corelinux/CoreLinuxAssociativeIterator.hpp is in libcorelinux-dev 0.4.32-7.4ubuntu1.

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
#if   !defined(__CORELINUXASSOCIATIVEITERATOR_HPP)
#define  __CORELINUXASSOCIATIVEITERATOR_HPP

/*
  CoreLinux++ 
  Copyright (C) 2000 CoreLinux Consortium
  
   The CoreLinux++ Library is free software; you can redistribute it and/or
   modify it under the terms of the GNU Library General Public License as
   published by the Free Software Foundation; either version 2 of the
   License, or (at your option) any later version.

   The CoreLinux++ Library 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
   Library General Public License for more details.

   You should have received a copy of the GNU Library General Public
   License along with the GNU C Library; see the file COPYING.LIB.  If not,
   write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
   Boston, MA 02111-1307, USA.  
*/   

#if   !defined(__COMMON_HPP)
#include <Common.hpp>
#endif

#if   !defined(__ASSOCIATIVEITERATOR_HPP)
#include <AssociativeIterator.hpp>
#endif

#if   !defined(__INVALIDITERATOREXCEPTION_HPP)
#include <InvalidIteratorException.hpp>
#endif

#if   !defined(__ITERATORBOUNDSEXCEPTION_HPP)
#include <IteratorBoundsException.hpp>
#endif

namespace   corelinux
{

   /**
   The CoreLinuxAssociativeIterator provides a way to access the elements 
   of any of the associative STL collections, by defining a 
   CoreLinuxAssociativeIterator with a CORELINUX_COLLECTION 
   nameAssociativeIterator definition, the KeyType and the Element Type.
   */

   template< class TraverseType, class KeyType, class ElementType >
      class CoreLinuxAssociativeIterator : 
         public AssociativeIterator<KeyType,ElementType>
      {
      public:

         //
         // Constructors and destructor
         //

                     /**
                     Default constructor
                     @exception InvalidIteratorException - the 
                     CoreLinuxAssociativeIterator requires being constructed 
                     with a valid collection
                     */

                     CoreLinuxAssociativeIterator( void ) 
                        throw(InvalidIteratorException)
                        :
                        AssociativeIterator<KeyType,ElementType>()
                     {
                        throw InvalidIteratorException(LOCATION);
                     }

                     /**
                     Initializing constructor
                     @param TraverseType aBegin first position
                     @param TraverseType aEnd last position
                     */

                     CoreLinuxAssociativeIterator( TraverseType aBegin,
                                        TraverseType aEnd )
                        :
                        AssociativeIterator<KeyType,ElementType>(),
                        theBegin( aBegin ),
                        theEnd( aEnd ),
                        theCurrent( theBegin )
                     {
                        ;  // do nothing
                     }

                     /**
                     Copy constructor
                     @param CoreLinuxAssociativeIterator const reference
                     */

                     CoreLinuxAssociativeIterator
                        ( 
                           const CoreLinuxAssociativeIterator &aRef 
                        )
                        :
                        AssociativeIterator<KeyType,ElementType>( aRef ),
                        theBegin( aRef.theBegin ),
                        theEnd( aRef.theEnd ),
                        theCurrent( aRef.theBegin )
                     {
                        ;  // do nothing
                     }

                     /// Destructor

         virtual     ~CoreLinuxAssociativeIterator( void )
         {
            theBegin = theEnd;  
            theCurrent = theEnd;
         }

         //
         // Operator overloads
         //

                  /**
                  Assignment operator
                  @param CoreLinuxAssociativeIterator const reference
                  @return CoreLinuxAssociativeIterator reference
                  */

                  CoreLinuxAssociativeIterator & operator=
                     ( const CoreLinuxAssociativeIterator & aRef )
                  {
                     theBegin = aRef.theBegin;
                     theEnd = aRef.theEnd;
                     theCurrent = theBegin;
                     return (*this);
                  }

                  /**
                  Equality operator
                  @param CoreLinuxAssociativeIterator const reference
                  @return bool - true if the respective positions
                  are equal.
                  */

                  bool  operator==
                     ( 
                        const CoreLinuxAssociativeIterator & aRef 
                     ) const
                  {
                     return (theBegin == aRef.theBegin &&
                             theEnd == aRef.theEnd);
                  }
                  

         //
         // Accessors
         //
                  /**
                  isValid implementation for determining
                  if the current position points to a valid
                  EntityType instance
                  @return bool true if valid, false otherwise
                  */

         virtual  bool  isValid( void ) const 
         {
            return !(theCurrent == theEnd);
         }

                  /**
                  getElement returns the ElementType instance
                  that is currently managed by the CoreLinuxAssociativeIterator
                  @return ElementType 
                  @exception IteratorBoundsException if the AssociativeIterator
                  is not positioned correctley.
                  */

         virtual  ElementType  getElement( void ) 
                         const throw(IteratorBoundsException) 
                  {
                     if( this->isValid() == false )
                     {
                        throw IteratorBoundsException(LOCATION);
                     }
                     else
                     {
                        ;  // do nothing
                     }
                     return (*theCurrent).second;
                  }

                  /**
                  getKey returns the KeyType instance
                  that is currently pointed to by the AssociativeIterator
                  @return KeyType 
                  @exception IteratorBoundsException if the AssociativeIterator
                  is not positioned correctly.
                  */

         virtual  KeyType  getKey( void ) 
                         const throw(IteratorBoundsException)
                  {
                     if( this->isValid() == false )
                     {
                        throw IteratorBoundsException(LOCATION);
                     }
                     else
                     {
                        ;  // do nothing
                     }
                     return (*theCurrent).first;
                  }

         //
         // Mutators
         //

                  /// Set AssociativeIterator to first element

         virtual  void  setFirst( void ) 
         {
            theCurrent = theBegin;
         }

                  /**
                  Set AssociativeIterator to next element
                  @exception IteratorBoundsException if attempt
                  to position past end of elements
                  */

         virtual  void  setNext( void ) 
                           throw(IteratorBoundsException) 
         {
            if( theCurrent != theEnd )
            {
               ++theCurrent;
            }
            else
            {
               throw IteratorBoundsException(LOCATION);
            }
         }

                  /**
                  Set AssociativeIterator to previous element
                  @exception IteratorBoundsException if attempt
                  to position before begining of elements
                  */

         virtual  void  setPrevious( void ) 
                           throw(IteratorBoundsException)
         {
            if( theCurrent != theBegin &&
                theBegin != theEnd )
            {
               --theCurrent;
            }
            else
            {
               throw IteratorBoundsException(LOCATION);
            }
         }

                  /// Set AssociativeIterator to last element

         virtual  void  setLast( void ) 
                        throw(IteratorBoundsException)
         {
            theCurrent = theEnd;
            setPrevious();
         }

      //
      // Protected methods
      //

      protected:

      //
      // Protected members
      //

      protected:

                  /// The first position

                  TraverseType   theBegin;

                  /// The last position

                  TraverseType   theEnd;

                  /// The current position

                  TraverseType   theCurrent;
   
      };
}

#endif   // if !defined(__CORELINUXASSOCIATIVEITERATOR_HPP)

/*
   Common rcs information do not modify
   $Author: prudhomm $
   $Revision: 1.1 $
   $Date: 2000/04/23 20:43:13 $
   $Locker:  $
*/