This file is indexed.

/usr/include/trilinos/Shards_SimpleArrayOps.hpp is in libtrilinos-shards-dev 12.12.1-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
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
/*
//@HEADER
// ************************************************************************
//
//                Shards : Shared Discretization Tools
//                 Copyright 2008 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Carter Edwards (hcedwar@sandia.gov),
//                    Pavel Bochev (pbboche@sandia.gov), or
//                    Denis Ridzal (dridzal@sandia.gov).
//
// ************************************************************************
//@HEADER
*/

#ifndef Shards_SimpleArrayOps_hpp
#define Shards_SimpleArrayOps_hpp

namespace shards {

/** \ingroup shards_package
 *  \defgroup  shards_package_simple_array_ops Simple Compile-time Sized Array Operations
 *
 *  \brief  Simple operations such as Copy<N>, Sum<N>, Max<N>, etc.
 *
 *  \author H. Carter Edwards  <hcedwar@sandia.gov>
 *
 *  \{
 */

/** \brief  Copy into an array.
 *  \tparam  n  Number of members to copy.
 */
template< unsigned n , unsigned i = 0 >
struct Copy {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] = src[0..N-1] */
  template<typename T>
  inline Copy( T * const dst , const T * const src )
    { dst[I] = src[I] ; Copy<N-1,I+1>(dst,src); }

  /** \brief  dst[0..N-1] = src */
  template<typename T>
  inline Copy( T * const dst , const T src )
    { dst[I] = src ; Copy<N-1,I+1>(dst,src); }

  Copy() {}
};

/** \brief  Sum into an array.
 *  \tparam  n  Number of members to sum.
 */
template< unsigned n , unsigned i = 0 >
struct Sum {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] += src[0..N-1] */
  template<typename T>
  inline Sum( T * const dst , const T * const src )
    { dst[I] += src[I] ; Sum<N-1,I+1>(dst,src); }

  /** \brief  dst[0..N-1] += a * src[0..N-1] */
  template<typename T>
  inline Sum( T * const dst , const T a , const T * const src )
    { dst[I] += a * src[I] ; Sum<N-1,I+1>(dst,a,src); }

  Sum() {}
};

/** \brief   Scale into an array.
 *  \tparam  n  Number of members to multiply.
 */
template< unsigned n , unsigned i = 0 >
struct Prod {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] *= src[0..N-1] */
  template<typename T>
  inline Prod( T * const dst , const T * const src )
    { dst[I] *= src[I] ; Prod<N-1,I+1>(dst,src); }
  Prod() {}
};

/** \brief   Bitwise-or into an array.
 *  \tparam  n  Number of members to or.
 */
template< unsigned n , unsigned i = 0 >
struct BitOr {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] |= src[0..N-1] */
  template<typename T>
  inline BitOr( T * const dst , const T * const src )
    { dst[I] |= src[I] ; BitOr<N-1,I+1>(dst,src); }

  BitOr() {}
};

/** \brief   Bitwise-and into an array.
 *  \tparam  n  Number of members to and.
 */
template< unsigned n , unsigned i = 0 >
struct BitAnd {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] &= src[0..N-1] */
  template<typename T>
  inline BitAnd( T * const dst , const T * const src )
    { dst[I] &= src[I] ; BitAnd<N-1,I+1>(dst,src); }

  BitAnd() {}
};

/** \brief   Take maximum value of each member of two arrays.
 *  \tparam  n  Number of members to iterate.
 */
template< unsigned n , unsigned i = 0 >
struct Max {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] = max( dst[0..N-1] , src[0..N-1] ) */
  template<typename T>
  inline Max( T * const dst , const T * const src )
    { if ( dst[I] < src[I] ) { dst[I] = src[I] ; } Max<N-1,I+1>(dst,src); }

  Max() {}
};

/** \brief   Take minimum value of each member of two arrays.
 *  \tparam  n  Number of members to iterate.
 */
template< unsigned n , unsigned i = 0 >
struct Min {
  enum { N = n , I = i };

  /** \brief  dst[0..N-1] = min( dst[0..N-1] , src[0..N-1] ) */
  template<typename T>
  inline Min( T * const dst , const T * const src )
    { if ( src[I] < dst[I] ) { dst[I] = src[I] ; } Min<N-1,I+1>(dst,src); }

  Min() {}
};

/** \brief  Inner product of two arrays
 *  \tparam  n  Number of members to iterate.
 */
template< unsigned n , unsigned i = 0 >
struct InnerProduct {
  enum { N = n , I = i };

  /** \brief  value += sum[ k = 0..N-1 ]( x[k] * y[k] ) */
  template<typename T>
  inline InnerProduct( T & value , const T * const x , const T * const y )
    { value += x[I] * y[I] ; InnerProduct<N-1,I+1>( value , x , y ); }

  InnerProduct() {}
};

/** \brief  Lexicographical comparison of two arrays.
 *  \tparam  n  Number of members to iterate.
 */
template< unsigned n , unsigned i = 0 >
struct Compare {
  enum { N = n , I = i };

  /** \brief  All members are equal */
  template<typename T>
  inline static bool equal( const T * const x , const T * const y )
    { return x[I] == y[I] && Compare<N-1,I+1>::equal(x,y); }

  /** \brief  All members are not equal */
  template<typename T>
  inline static bool not_equal( const T * const x , const T * const y )
    { return x[I] != y[I] || Compare<N-1,I+1>::not_equal(x,y); }

  /** \brief  First non-equal members satisfy x[k] < y[k] */
  template<typename T>
  inline static bool less( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] < y[I] : Compare<N-1,I+1>::less(x,y);
    }

  /** \brief  First non-equal members satisfies x[k] <= y[k] */
  template<typename T>
  inline static bool less_equal( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] < y[I] : Compare<N-1,I+1>::less_equal(x,y);
    }

  /** \brief  First non-equal members satisfies x[k] > y[k] */
  template<typename T>
  inline static bool greater( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] > y[I] : Compare<N-1,I+1>::greater(x,y);
    }

  /** \brief  First non-equal members satisfies x[k] >= y[k] */
  template<typename T>
  inline static bool greater_equal( const T * const x , const T * const y )
    {
      return x[I] != y[I] ? x[I] > y[I] : Compare<N-1,I+1>::greater_equal(x,y);
    }

  Compare() {}
};

/** \} */

//----------------------------------------------------------------------

#ifndef DOXYGEN_COMPILE

template<unsigned i>
struct Copy<0,i> {
  enum { N = 0 };
  Copy() {}
  template<typename T> inline Copy( T * const , const T * const ) {}
  template<typename T> inline Copy( T * const , const T ) {}
};

template<unsigned i>
struct Sum<0,i> {
  enum { N = 0 };
  Sum() {}
  template<typename T> inline Sum( T * const , const T * const ) {}
  template<typename T> inline Sum( T * const , const T , const T * const ) {}
};

template<unsigned i>
struct Prod<0,i> {
  enum { N = 0 };
  Prod() {}
  template<typename T> inline Prod( T * const , const T * const ) {}
};

template<unsigned i>
struct Max<0,i> {
  enum { N = 0 };
  Max() {}
  template<typename T> inline Max( T * const , const T * const ) {}
};

template<unsigned i>
struct Min<0,i> {
  enum { N = 0 };
  Min() {}
  template<typename T> inline Min( T * const , const T * const ) {}
};

template<unsigned i>
struct BitOr<0,i> {
  enum { N = 0 };
  BitOr() {}
  template<typename T> inline BitOr( T * const , const T * const ) {}
};

template<unsigned i>
struct BitAnd<0,i> {
  enum { N = 0 };
  BitAnd() {}
  template<typename T> inline BitAnd( T * const , const T * const ) {}
};

template<unsigned i>
struct InnerProduct<0,i> {
  enum { N = 0 };
  InnerProduct() {}
  template<typename T>
  inline InnerProduct( T & , const T * const , const T * const ) {}
};

template<unsigned i>
struct Compare<0,i> {
  enum { N = 0 };
  Compare() {}

  template<typename T>
  inline static bool equal( const T * const , const T * const )
    { return true ; }

  template<typename T>
  inline static bool not_equal( const T * const , const T * const )
    { return false ; }

  template<typename T>
  inline static bool less( const T * const , const T * const )
    { return false ; }

  template<typename T>
  inline static bool less_equal( const T * const , const T * const )
    { return true ; }

  template<typename T>
  inline static bool greater( const T * const , const T * const )
    { return false ; }

  template<typename T>
  inline static bool greater_equal( const T * const , const T * const )
    { return true ; }
};


#endif /* DOXYGEN_COMPILE */

} // namespace shards

#endif