/usr/include/dune/localfunctions/lagrange/equidistantpoints.hh is in libdune-localfunctions-dev 2.4.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 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 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_EQUIDISTANTPOINTS_HH
#define DUNE_EQUIDISTANTPOINTS_HH
#include <vector>
#include <dune/common/fvector.hh>
#include <dune/common/forloop.hh>
#include <dune/geometry/topologyfactory.hh>
#include <dune/geometry/genericgeometry/topologytypes.hh>
#include <dune/geometry/genericgeometry/subtopologies.hh>
#include <dune/localfunctions/lagrange/emptypoints.hh>
#include <dune/localfunctions/utility/field.hh>
namespace Dune
{
// Internal Forward Declarations
// -----------------------------
template< class F, unsigned int dim >
class EquidistantPointSet;
// EquidistantPointSetImpl
// ----------------------------
template< class Topology, class F >
class EquidistantPointSetImpl;
template< class F >
class EquidistantPointSetImpl< GenericGeometry::Point, F >
{
typedef EquidistantPointSetImpl< GenericGeometry::Point, F > This;
typedef GenericGeometry::Point Topology;
friend class EquidistantPointSet< F, Topology::dimension >;
friend class EquidistantPointSetImpl< GenericGeometry::Prism< Topology >, F >;
friend class EquidistantPointSetImpl< GenericGeometry::Pyramid< Topology >, F >;
public:
typedef F Field;
static const unsigned int dimension = Topology::dimension;
static unsigned int size ( const unsigned int order )
{
return 1;
}
private:
template< unsigned int codim, unsigned int dim >
static unsigned int setup ( const unsigned int order,
unsigned int *count,
LagrangePoint< Field, dim > *points )
{
assert( codim == 0 );
points->localKey_ = LocalKey( 0, 0, count[ 0 ]++ );
points->point_ = Field( 0 );
return 1;
}
};
template< class BaseTopology, class F >
class EquidistantPointSetImpl< GenericGeometry::Prism< BaseTopology >, F >
{
typedef EquidistantPointSetImpl< GenericGeometry::Prism< BaseTopology >, F > This;
typedef GenericGeometry::Prism< BaseTopology > Topology;
friend class EquidistantPointSet< F, Topology::dimension >;
friend class EquidistantPointSetImpl< GenericGeometry::Prism< Topology >, F >;
friend class EquidistantPointSetImpl< GenericGeometry::Pyramid< Topology >, F >;
typedef EquidistantPointSetImpl< BaseTopology, F > BaseImpl;
public:
typedef F Field;
static const unsigned int dimension = Topology::dimension;
static unsigned int size ( const unsigned int order )
{
return BaseImpl::size( order ) * (order+1);
}
// private:
template< unsigned int codim, unsigned int dim >
static unsigned int setup ( const unsigned int order,
unsigned int *count,
LagrangePoint< Field, dim > *points )
{
unsigned int size = 0;
unsigned int numBaseN = 0;
if( codim < dimension )
{
const unsigned int vcodim = (codim < dimension ? codim : dimension-1);
numBaseN = GenericGeometry::Size< BaseTopology, vcodim >::value;
for( unsigned int i = 1; i < order; ++i )
{
const unsigned int n = BaseImpl::template setup< vcodim, dim >( order, count, points );
for( unsigned int j = 0; j < n; ++j )
{
LocalKey &key = points->localKey_;
key = LocalKey( key.subEntity(), codim, key.index() );
points->point_[ dimension-1 ] = Field( i ) / Field( order );
++points;
}
size += n;
}
}
if( codim > 0 )
{
const unsigned int vcodim = (codim > 0 ? codim : 1);
const unsigned int numBaseM = GenericGeometry::Size< BaseTopology, vcodim-1 >::value;
const unsigned int n = BaseImpl::template setup< vcodim-1, dim >( order, count+numBaseN, points );
for( unsigned int j = 0; j < n; ++j )
{
LocalKey &key = points[ j ].localKey_;
key = LocalKey( key.subEntity() + numBaseN, codim, key.index() );
points[ j + n ].point_ = points[ j ].point_;
points[ j + n ].point_[ dimension-1 ] = Field( 1 );
points[ j + n ].localKey_ = LocalKey( key.subEntity() + numBaseM, codim, key.index() );
++count[ key.subEntity() + numBaseM ];
}
size += 2*n;
}
return size;
}
};
template< class BaseTopology, class F >
class EquidistantPointSetImpl< GenericGeometry::Pyramid< BaseTopology >, F >
{
typedef EquidistantPointSetImpl< GenericGeometry::Pyramid< BaseTopology >, F > This;
typedef GenericGeometry::Pyramid< BaseTopology > Topology;
friend class EquidistantPointSet< F, Topology::dimension >;
friend class EquidistantPointSetImpl< GenericGeometry::Prism< Topology >, F >;
friend class EquidistantPointSetImpl< GenericGeometry::Pyramid< Topology >, F >;
typedef EquidistantPointSetImpl< BaseTopology, F > BaseImpl;
public:
typedef F Field;
static const unsigned int dimension = Topology::dimension;
static unsigned int size ( const unsigned int order )
{
unsigned int size = BaseImpl::size( order );
for( unsigned int i = 1; i <= order; ++i )
size += BaseImpl::size( order - i );
return size;
}
// private:
template< unsigned int codim, unsigned int dim >
static unsigned int setup ( const unsigned int order,
unsigned int *count,
LagrangePoint< Field, dim > *points )
{
unsigned int size = 0;
unsigned int numBaseM = 0;
if( codim > 0 )
{
const unsigned int vcodim = (codim > 0 ? codim : 1);
numBaseM = GenericGeometry::Size< BaseTopology, vcodim-1 >::value;
size = BaseImpl::template setup< vcodim-1, dim >( order, count, points );
LagrangePoint< Field, dim > *const end = points + size;
for( ; points != end; ++points )
{
LocalKey &key = points->localKey_;
key = LocalKey( key.subEntity(), codim, key.index() );
}
}
if( codim < dimension )
{
const unsigned int vcodim = (codim < dimension ? codim : dimension-1);
for( unsigned int i = order-1; i > 0; --i )
{
const unsigned int n = BaseImpl::template setup< vcodim, dim >( i, count+numBaseM, points );
LagrangePoint< Field, dim > *const end = points + n;
for( ; points != end; ++points )
{
LocalKey &key = points->localKey_;
key = LocalKey( key.subEntity()+numBaseM, codim, key.index() );
for( unsigned int j = 0; j < dimension-1; ++j )
points->point_[ j ] *= Field( i ) / Field( order );
points->point_[ dimension-1 ] = Field( order - i ) / Field( order );
}
size += n;
}
}
else
{
points->localKey_ = LocalKey( numBaseM, dimension, count[ numBaseM ]++ );
points->point_ = Field( 0 );
points->point_[ dimension-1 ] = 1;
++size;
}
return size;
}
};
// LagnragePoints
// --------------
template< class F, unsigned int dim >
class EquidistantPointSet : public EmptyPointSet<F,dim>
{
template< class T >
struct Topology;
typedef EmptyPointSet<F,dim> Base;
public:
static const unsigned int dimension = dim;
EquidistantPointSet( unsigned int order )
: Base(order)
{}
template< class T >
bool build ( );
template< class T >
static bool supports ( unsigned int order )
{
return true;
}
private:
using Base::points_;
};
template< class F, unsigned int dim >
template< class T >
struct EquidistantPointSet< F, dim >::Topology
{
typedef EquidistantPointSetImpl< T, F > Impl;
typedef Dune::LagrangePoint< F, dim > LagrangePoint;
template< int pdim >
struct Init
{
static void apply ( const unsigned int order, LagrangePoint *&p )
{
const unsigned int size = GenericGeometry::Size< T, dimension-pdim >::value;
unsigned int count[ size ];
for( unsigned int i = 0; i < size; ++i )
count[ i ] = 0;
p += Impl::template setup< dimension-pdim, dimension >( order, count, p );
}
};
};
template< class F, unsigned int dim >
template< class T >
inline bool EquidistantPointSet< F, dim >::build ( )
{
unsigned int order = Base::order();
typedef Dune::LagrangePoint< F, dimension > LagrangePoint;
typedef typename Topology< T >::Impl Impl;
points_.resize( Impl::size( order ) );
LagrangePoint *p = &(points_[ 0 ]);
ForLoop< Topology< T >::template Init, 0, dimension >::apply( order, p );
return true;
}
}
#endif
|