This file is indexed.

/usr/include/dune/localfunctions/hierarchical/hierarchicalprismp2/hierarchicalprismp2localbasis.hh is in libdune-localfunctions-dev 2.2.1-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
// -*- tab-width: 4; indent-tabs-mode: nil -*-
#ifndef DUNE_HIERARCHICAL_PRISM_P2_LOCALBASIS_HH
#define DUNE_HIERARCHICAL_PRISM_P2_LOCALBASIS_HH

/** \file
    \brief Hierarchical prism p2 shape functions for the simplex
*/

#include <dune/common/fvector.hh>
#include <dune/common/fmatrix.hh>

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

namespace Dune
{
  template<class D, class R>
  class HierarchicalPrismP2LocalBasis
  {
   public: 
//! \brief export type traits for function signature
   typedef LocalBasisTraits<D,3,Dune::FieldVector<D,3>,R,1,Dune::FieldVector<R,1>, Dune::FieldMatrix<R,1,3> > Traits;

//! \brief number of shape functions
unsigned int size () const
{
return 18;
}

//! \brief Evaluate all shape functions
void evaluateFunction (const typename Traits::DomainType& in,
                       std::vector<typename Traits::RangeType> & out) const
{
out.resize(18);

	out[0]=(1.0-in[0]-in[1])*(1.0-in[2]);
        out[1]= in[0]*(1-in[2]);
        out[2]=in[1]*(1-in[2]);
        out[3]=in[2]*(1.0-in[0]-in[1]);
        out[4]=in[0]*in[2];
        out[5]=in[1]*in[2];

        //edges
        out[6]=2*(1.0-in[0]-in[1])*(0.5-in[0]-in[1])*(4*in[2]-4*in[2]*in[2]);   
        out[7]=2*in[0]*(-0.5+in[0])*(4*in[2]-4*in[2]*in[2]); 
        out[8]=2*in[1]*(-0.5+in[1])*(4*in[2]-4*in[2]*in[2]);
        out[9]=4*in[0]*(1-in[0]-in[1])*(1-3*in[2]+2*in[2]*in[2]);   
        out[10]=4*in[1]*(1-in[0]-in[1])*(1-3*in[2]+2*in[2]*in[2]);   
        out[11]=4*in[0]*in[1]*(1-3*in[2]+2*in[2]*in[2]);   
        out[12]=4*in[0]*(1-in[0]-in[1])*(-in[2]+2*in[2]*in[2]);   
        out[13]=4*in[1]*(1-in[0]-in[1])*(-in[2]+2*in[2]*in[2]);   
        out[14]=4*in[0]*in[1]*(-in[2]+2*in[2]*in[2]);   

        //faces
        out[15]=4*in[0]*(1-in[0]-in[1])*(4*in[2]-4*in[2]*in[2]);         
        out[16]=4*in[1]*(1-in[0]-in[1])*(4*in[2]-4*in[2]*in[2]);   
        out[17]=4*in[0]*in[1]*(4*in[2]-4*in[2]*in[2]);   
}



//! \brief Evaluate Jacobian of all shape functions
    void evaluateJacobian (const typename Traits::DomainType& in,     //position
                           std::vector<typename Traits::JacobianType>& out) const  //return  value
{
out.resize(18);  

	//vertices 
	out[0][0][0] = in[2]-1;  
	out[0][0][1] = in[2]-1;  
	out[0][0][2] = in[0]+in[1]-1;
	
	out[1][0][0] = 1-in[2];  
	out[1][0][1] = 0;  	  
	out[1][0][2] =-in[0]; 
	
	out[2][0][0] = 0; 	 
	out[2][0][1] = 1-in[2];  
	out[2][0][2] = -in[1];
	
	out[3][0][0] = -in[2];   
	out[3][0][1] = -in[2];   
	out[3][0][2] = 1-in[0]-in[1];
	
	out[4][0][0] = in[2];    
	out[4][0][1] = 0;	  
	out[4][0][2] = in[0];
	
	out[5][0][0] = 0; 	 
	out[5][0][1] = in[2];	  
	out[5][0][2] = in[1];
		
        //edges
	out[6][0][0] = (-3+4*in[0]+4*in[1])*(4*in[2]-4*in[2]*in[2]);  
	out[6][0][1] = (-3+4*in[0]+4*in[1])*(4*in[2]-4*in[2]*in[2]);  
	out[6][0][2] = 2*(1-in[0]-in[1])*(0.5-in[0]-in[1])*(4-8*in[2]);  
		
	out[7][0][0] = (-1+4*in[0])*(4*in[2]-4*in[2]*in[2]);  
	out[7][0][1] = 0;
	out[7][0][2] = 2*in[0]*(-0.5+in[0])*(4-8*in[2]);  
	
	out[8][0][0] = 0;
	out[8][0][1] = (-1+4*in[1])*(4*in[2]-4*in[2]*in[2]);  
	out[8][0][2] = 2*in[1]*(-0.5+in[1])*(4-8*in[2]);  
	
	out[9][0][0] = (4-8*in[0]-4*in[1])*(1-3*in[2]+2*in[2]*in[2]);  
	out[9][0][1] = -4*in[0]*(1-3*in[2]+2*in[2]*in[2]);  
	out[9][0][2] = 4*in[0]*(1-in[0]-in[1])*(-3+4*in[2]);  
	
	out[10][0][0] = (-4*in[1])*(1-3*in[2]+2*in[2]*in[2]);  
	out[10][0][1] = (4-4*in[0]-8*in[1])*(1-3*in[2]+2*in[2]*in[2]);  
	out[10][0][2] = 4*in[1]*(1-in[0]-in[1])*(-3+4*in[2]);  
	
	out[11][0][0] = 4*in[1]*(1-3*in[2]+2*in[2]*in[2]);  
	out[11][0][1] = 4*in[0]*(1-3*in[2]+2*in[2]*in[2]);  
	out[11][0][2] = 4*in[0]*in[1]*(-3+4*in[2]);  
	
	out[12][0][0] = (4-8*in[0]-4*in[1])*(-in[2]+2*in[2]*in[2]);  
	out[12][0][1] = (-4*in[0])*(-in[2]+2*in[2]*in[2]);  
	out[12][0][2] = 4*in[0]*(1-in[0]-in[1])*(-1+4*in[2]);  
	
	out[13][0][0] = -4*in[1]*(-in[2]+2*in[2]*in[2]);  
	out[13][0][1] = (4-4*in[0]-8*in[1])*(-in[2]+2*in[2]*in[2]);  
	out[13][0][2] = 4*in[1]*(1-in[0]-in[1])*(-1+4*in[2]);  
	
	out[14][0][0] = 4*in[1]*(-in[2]+2*in[2]*in[2]);  
	out[14][0][1] = 4*in[0]*(-in[2]+2*in[2]*in[2]);  
	out[14][0][2] = 4*in[0]*in[1]*(-1+4*in[2]);  
	
        //faces
	out[15][0][0] = (4-8*in[0]-4*in[1])*(4*in[2]-4*in[2]*in[2]);  
	out[15][0][1] = -4*in[0]*(4*in[2]-4*in[2]*in[2]);  
	out[15][0][2] = 4*in[0]*(1-in[0]-in[1])*(4-8*in[2]);  
	
	out[16][0][0] = -4*in[1]*(4*in[2]-4*in[2]*in[2]);  
	out[16][0][1] = (4-4*in[0]-8*in[1])*(4*in[2]-4*in[2]*in[2]);  
	out[16][0][2] = 4*in[1]*(1-in[0]-in[1])*(4-8*in[2]);  
	
	out[17][0][0] = 4*in[1]*(4*in[2]-4*in[2]*in[2]);  	 
	out[17][0][1] = 4*in[0]*(4*in[2]-4*in[2]*in[2]);  
       	out[17][0][2] = 4*in[0]*in[1]*(4-8*in[2]);  
	 
        }
/** \brief Polynomial order of the shape functions
*/
unsigned int order() const
{
return 2;
}

 };
}
#endif