This file is indexed.

/usr/include/dune/localfunctions/lagrange/pk1d/pk1dlocalcoefficients.hh is in libdune-localfunctions-dev 2.3.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
// -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:

#ifndef DUNE_PK1DLOCALCOEFFICIENTS_HH
#define DUNE_PK1DLOCALCOEFFICIENTS_HH

#include <cstddef>
#include <vector>

#include <dune/localfunctions/common/localkey.hh>

namespace Dune
{

  /**@ingroup LocalLayoutImplementation
         \brief Layout map for Pk elements

         \nosubgrouping
     \implements Dune::LocalCoefficientsVirtualImp
   */
  template<unsigned int k>
  class Pk1DLocalCoefficients
  {
    enum {N = k+1};

  public:
    //! \brief Standard constructor
    Pk1DLocalCoefficients () : li(N)
    {
      fill_default();
    }

    //! constructor for eight variants with order on edges flipped
    Pk1DLocalCoefficients (int variant) : li(N)
    {
      fill_default();
    }

    /** Constructor for six variants with permuted vertices.

        \param vertexmap The permutation of the vertices.  This
        can for instance be generated from the global indices of
        the vertices by reducing those to the integers 0...2.  This may be any
        object which for which the expression \c vertexmap[i] is defined
        apropriately (like an array, a pointer, a std::vector, or a
        random-access iterator.
     */
    template<class VertexMap>
    explicit Pk1DLocalCoefficients(const VertexMap &vertexmap) : li(N)
    {
      fill_default();
    }

    //! number of coefficients
    std::size_t size () const
    {
      return N;
    }

    //! get i'th index
    const LocalKey& localKey (std::size_t i) const
    {
      return li[i];
    }

  private:
    std::vector<LocalKey> li;

    void fill_default()
    {
      li.resize(N);

      if (N==1) {
        li[0] = LocalKey(0,0,0);
      } else {
        li[0] = LocalKey(0,1,0);
        for (int i=1; i<N-1; i++)
          li[i] = LocalKey(0,0,i-1);            // element dofs
        li.back() = LocalKey(1,1,0);
      }
    }
  };

}

#endif