\n
\n
\n
\n-
5#ifndef DUNE_DEPRECATED_TOPOLOGY_HH \n-
6#define DUNE_DEPRECATED_TOPOLOGY_HH \n+
5#ifndef DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH \n+
6#define DUNE_GEOMETRY_REFERENCEELEMENTIMPLEMENTATION_HH \n
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
15 struct PointDeprecationHelper
\n-
\n-
17 static const unsigned int dimension = 0;
\n-
18 static const unsigned int numCorners = 1;
\n-
\n-
20 static const unsigned int id = 0;
\n-
\n-
22 static std::string name () {
return "p"; }
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
18#include <dune/common/fmatrix.hh> \n+
19#include <dune/common/fvector.hh> \n+
20#include <dune/common/hybridutilities.hh> \n+
21#include <dune/common/typetraits.hh> \n+
22#include <dune/common/iteratorrange.hh> \n+
23#include <dune/common/math.hh> \n
\n-
25 using Point [[deprecated(
"Use GeometryTypes::vertex instead.")]] = PointDeprecationHelper;
\n-
\n-
\n-
28 template<
class BaseTopology >
\n-
29 struct [[deprecated(
"Use GeometryTypes::prismaticExtension(GeometryType gt) instead.")]] Prism
\n-
\n-
31 static const unsigned int dimension = BaseTopology::dimension + 1;
\n-
32 static const unsigned int numCorners = 2 * BaseTopology::numCorners;
\n-
\n-
34 static const unsigned int id = BaseTopology::id | ((
unsigned int)prismConstruction << (dimension-1));
\n-
\n-
36 static std::string name () {
return BaseTopology::name() +
"l"; }
\n-
\n-
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
40 template<
class BaseTopology >
\n-
41 struct [[deprecated(
"Use GeometryTypes::conicalExtension(GeometryType gt) instead.")]] Pyramid
\n-
\n-
43 static const unsigned int dimension = BaseTopology::dimension + 1;
\n-
44 static const unsigned int numCorners = BaseTopology::numCorners + 1;
\n+
\n+
\n+
42 template<
class ctype,
int dim >
\n+
43 class ReferenceElementContainer;
\n+
\n
\n-
46 static const unsigned int id = BaseTopology::id | ((
unsigned int)pyramidConstruction << (dimension-1));
\n-
\n-
48 static std::string name () {
return BaseTopology::name() +
"o"; }
\n-
\n+
46 template<
class ctype,
int dim >
\n+
47 struct ReferenceElements;
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
\n-
56 template<
class Topology >
\n-
57 struct [[deprecated(
"Use GeometryType::isSimplex() instead.")]] IsSimplex
\n-
58 :
public std::integral_constant< bool, (Topology::id >> 1) == 0 >
\n-
\n+
\n+
\n+
\n+
54 using Dune::Impl::isPrism;
\n+
55 using Dune::Impl::isPyramid;
\n+
56 using Dune::Impl::baseTopologyId;
\n+
57 using Dune::Impl::prismConstruction;
\n+
58 using Dune::Impl::pyramidConstruction;
\n+
59 using Dune::Impl::numTopologies;
\n
\n-
61 template<
class Topology >
\n-
62 struct [[deprecated(
"Use GeometryType::isCube() instead.")]] IsCube
\n-
63 :
public std::integral_constant< bool, (Topology::id | 1) == (1 << Topology::dimension) - 1 >
\n-
\n+
62 unsigned int size (
unsigned int topologyId,
int dim,
int codim );
\n+
\n+
\n
\n-
78 [[deprecated("Use GeometryType::isPrismatic() or GeometryType::isConical() instead.")]]
\n-
79 inline static bool isTopology ( TopologyConstruction construction, unsigned int topologyId, int dim, int codim = 0 ) noexcept
\n-
\n-
81 assert( (dim > 0) && (topologyId < numTopologies( dim )) );
\n-
82 assert( (0 <= codim) && (codim <= dim) );
\n-
83 return (codim >= (dim-1)) || (((topologyId >> (dim-codim-1)) & 1) == (unsigned int)construction);
\n-
\n+
73 unsigned int subTopologyId (
unsigned int topologyId,
int dim,
int codim,
unsigned int i );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
80 void subTopologyNumbering (
unsigned int topologyId,
int dim,
int codim,
unsigned int i,
int subcodim,
\n+
81 unsigned int *beginOut,
unsigned int *endOut );
\n+
\n+
\n+
\n
\n-
\n-
\n-
\n-
\n-
90 template< unsigned int dim >
\n-
91 struct [[deprecated("Use GeometryTypes::simplex(dim) instead.")]] SimplexTopology
\n-
\n-
93 typedef Pyramid< typename SimplexTopology< dim-1 >::type > type;
\n-
\n+
\n+
\n+
\n+
89 template<
class ct,
int cdim >
\n+
\n+
91 checkInside (
unsigned int topologyId,
int dim,
const FieldVector< ct, cdim > &x, ct tolerance, ct factor = ct( 1 ) )
\n+
\n+
93 assert( (dim >= 0) && (dim <= cdim) );
\n+
94 assert( topologyId < numTopologies( dim ) );
\n
\n-
\n-
97 struct [[deprecated("Use GeometryTypes::simplex(dim) instead.")]] SimplexTopology< 0 >
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
107 template< unsigned int dim >
\n-
108 struct [[deprecated("Use GeometryTypes::cube(dim) instead.")]] CubeTopology
\n-
\n-
110 typedef Prism< typename CubeTopology< dim-1 >::type > type;
\n-
\n+
\n+
\n+
98 const ct baseFactor = (isPrism( topologyId, dim ) ? factor : factor - x[ dim-1 ]);
\n+
99 if( (x[ dim-1 ] > -tolerance) && (factor - x[ dim-1 ] > -tolerance) )
\n+
100 return checkInside< ct, cdim >( baseTopologyId( topologyId, dim ), dim-1, x, tolerance, baseFactor );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n
\n-
\n-
114 struct [[deprecated("Use GeometryTypes::simplex(dim) instead.")]] CubeTopology< 0 >
\n-
\n-
\n-
\n-
\n+
113 template<
class ct,
int cdim >
\n+
\n+
115 referenceCorners (
unsigned int topologyId,
int dim, FieldVector< ct, cdim > *corners )
\n+
\n+
117 assert( (dim >= 0) && (dim <= cdim) );
\n+
118 assert( topologyId < numTopologies( dim ) );
\n
\n-
\n-
\n-
\n-
\n-
124 template< unsigned int dim >
\n-
125 struct [[deprecated]] PyramidTopology
\n-
\n-
127 typedef Pyramid< typename CubeTopology< dim-1 >::type > type;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n-
135 template< unsigned int dim >
\n-
136 struct [[deprecated]] PrismTopology
\n-
\n-
138 typedef Prism< typename SimplexTopology< dim-1 >::type > type;
\n-
\n-
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
122 const unsigned int nBaseCorners
\n+
123 = referenceCorners( baseTopologyId( topologyId, dim ), dim-1, corners );
\n+
124 assert( nBaseCorners ==
size( baseTopologyId( topologyId, dim ), dim-1, dim-1 ) );
\n+
125 if( isPrism( topologyId, dim ) )
\n+
\n+
127 std::copy( corners, corners + nBaseCorners, corners + nBaseCorners );
\n+
128 for(
unsigned int i = 0; i < nBaseCorners; ++i )
\n+
129 corners[ i+nBaseCorners ][ dim-1 ] = ct( 1 );
\n+
130 return 2*nBaseCorners;
\n+
\n+
\n+
\n+
134 corners[ nBaseCorners ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
135 corners[ nBaseCorners ][ dim-1 ] = ct( 1 );
\n+
136 return nBaseCorners+1;
\n+
\n+
\n+
\n+
\n+
141 *corners = FieldVector< ct, cdim >( ct( 0 ) );
\n+
\n+
\n+
\n+
\n
\n-
147 template< template< class > class Operation, int dim, class Topology = PointDeprecationHelper >
\n-
148 struct [[deprecated("Use IfGeometryType instead.")]] IfTopology
\n-
\n-
150 template< class... Args >
\n-
151 static auto apply ( unsigned int topologyId, Args &&... args )
\n-
\n-
\n-
154 return IfTopology< Operation, dim-1, Prism< Topology > >::apply( topologyId >> 1, std::forward< Args >( args )... );
\n-
\n-
156 return IfTopology< Operation, dim-1, Pyramid< Topology > >::apply( topologyId >> 1, std::forward< Args >( args )... );
\n+
\n+
\n+
\n+
\n+
151 unsigned long referenceVolumeInverse (
unsigned int topologyId,
int dim );
\n+
\n+
\n+
154 inline ct referenceVolume (
unsigned int topologyId,
int dim )
\n+
\n+
156 return ct( 1 ) / ct( referenceVolumeInverse( topologyId, dim ) );
\n
\n-
\n+
\n
\n-
160 template< template< class > class Operation, class Topology >
\n-
161 struct [[deprecated("Use IfGeometryType instead.")]] IfTopology< Operation, 0, Topology >
\n-
\n-
163 template<
class... Args >
\n-
164 static auto apply ([[maybe_unused]]
unsigned int topologyId, Args &&... args)
\n-
\n-
166 return Operation< Topology >::apply( std::forward< Args >( args )... );
\n-
\n-
\n-
\n-
\n-
\n+
\n+
\n+
\n+
\n+
164 template<
class ct,
int cdim >
\n+
\n+
166 referenceOrigins (
unsigned int topologyId,
int dim,
int codim, FieldVector< ct, cdim > *origins )
\n+
\n+
168 assert( (dim >= 0) && (dim <= cdim) );
\n+
169 assert( topologyId < numTopologies( dim ) );
\n+
170 assert( (codim >= 0) && (codim <= dim) );
\n+
\n+
\n+
\n+
174 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
175 if( isPrism( topologyId, dim ) )
\n+
\n+
177 const unsigned int n = (codim < dim ? referenceOrigins( baseId, dim-1, codim, origins ) : 0);
\n+
178 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins+n );
\n+
179 for(
unsigned int i = 0; i < m; ++i )
\n+
\n+
181 origins[ n+m+i ] = origins[ n+i ];
\n+
182 origins[ n+m+i ][ dim-1 ] = ct( 1 );
\n+
\n+
\n+
\n+
\n+
\n+
188 const unsigned int m = referenceOrigins( baseId, dim-1, codim-1, origins );
\n+
\n+
\n+
191 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
192 origins[ m ][ dim-1 ] = ct( 1 );
\n+
\n+
\n+
\n+
196 return m+referenceOrigins( baseId, dim-1, codim, origins+m );
\n+
\n+
\n+
\n+
\n+
201 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
211 template<
class ct,
int cdim,
int mydim >
\n+
\n+
213 referenceEmbeddings (
unsigned int topologyId,
int dim,
int codim,
\n+
214 FieldVector< ct, cdim > *origins,
\n+
215 FieldMatrix< ct, mydim, cdim > *jacobianTransposeds )
\n+
\n+
217 assert( (0 <= codim) && (codim <= dim) && (dim <= cdim) );
\n+
218 assert( (dim - codim <= mydim) && (mydim <= cdim) );
\n+
219 assert( topologyId < numTopologies( dim ) );
\n+
\n+
\n+
\n+
223 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
224 if( isPrism( topologyId, dim ) )
\n+
\n+
226 const unsigned int n = (codim < dim ? referenceEmbeddings( baseId, dim-1, codim, origins, jacobianTransposeds ) : 0);
\n+
227 for(
unsigned int i = 0; i < n; ++i )
\n+
228 jacobianTransposeds[ i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
\n+
\n+
230 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins+n, jacobianTransposeds+n );
\n+
231 std::copy( origins+n, origins+n+m, origins+n+m );
\n+
232 std::copy( jacobianTransposeds+n, jacobianTransposeds+n+m, jacobianTransposeds+n+m );
\n+
233 for(
unsigned int i = 0; i < m; ++i )
\n+
234 origins[ n+m+i ][ dim-1 ] = ct( 1 );
\n+
\n+
\n+
\n+
\n+
\n+
240 const unsigned int m = referenceEmbeddings( baseId, dim-1, codim-1, origins, jacobianTransposeds );
\n+
\n+
\n+
243 origins[ m ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
244 origins[ m ][ dim-1 ] = ct( 1 );
\n+
245 jacobianTransposeds[ m ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
\n+
\n+
\n+
\n+
\n+
250 const unsigned int n = referenceEmbeddings( baseId, dim-1, codim, origins+m, jacobianTransposeds+m );
\n+
251 for(
unsigned int i = 0; i < n; ++i )
\n+
\n+
253 for(
int k = 0; k < dim-1; ++k )
\n+
254 jacobianTransposeds[ m+i ][ dim-codim-1 ][ k ] = -origins[ m+i ][ k ];
\n+
255 jacobianTransposeds[ m+i ][ dim-codim-1 ][ dim-1 ] = ct( 1 );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
263 origins[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
264 jacobianTransposeds[ 0 ] = FieldMatrix< ct, mydim, cdim >( ct( 0 ) );
\n+
265 for(
int k = 0; k < dim; ++k )
\n+
266 jacobianTransposeds[ 0 ][ k ][ k ] = ct( 1 );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
276 template<
class ct,
int cdim >
\n+
\n+
278 referenceIntegrationOuterNormals (
unsigned int topologyId,
int dim,
\n+
279 const FieldVector< ct, cdim > *origins,
\n+
280 FieldVector< ct, cdim > *normals )
\n+
\n+
282 assert( (dim > 0) && (dim <= cdim) );
\n+
283 assert( topologyId < numTopologies( dim ) );
\n+
\n+
\n+
\n+
287 const unsigned int baseId = baseTopologyId( topologyId, dim );
\n+
288 if( isPrism( topologyId, dim ) )
\n+
\n+
290 const unsigned int numBaseFaces
\n+
291 = referenceIntegrationOuterNormals( baseId, dim-1, origins, normals );
\n+
\n+
293 for(
unsigned int i = 0; i < 2; ++i )
\n+
\n+
295 normals[ numBaseFaces+i ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
296 normals[ numBaseFaces+i ][ dim-1 ] = ct( 2*
int( i )-1 );
\n+
\n+
\n+
299 return numBaseFaces+2;
\n+
\n+
\n+
\n+
303 normals[ 0 ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
304 normals[ 0 ][ dim-1 ] = ct( -1 );
\n+
\n+
306 const unsigned int numBaseFaces
\n+
307 = referenceIntegrationOuterNormals( baseId, dim-1, origins+1, normals+1 );
\n+
308 for(
unsigned int i = 1; i <= numBaseFaces; ++i )
\n+
309 normals[ i ][ dim-1 ] = normals[ i ]*origins[ i ];
\n+
\n+
311 return numBaseFaces+1;
\n+
\n+
\n+
\n+
\n+
316 for(
unsigned int i = 0; i < 2; ++i )
\n+
\n+
318 normals[ i ] = FieldVector< ct, cdim >( ct( 0 ) );
\n+
319 normals[ i ][ 0 ] = ct( 2*
int( i )-1 );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
326 template<
class ct,
int cdim >
\n+
\n+
328 referenceIntegrationOuterNormals (
unsigned int topologyId,
int dim,
\n+
329 FieldVector< ct, cdim > *normals )
\n+
\n+
331 assert( (dim > 0) && (dim <= cdim) );
\n+
\n+
333 FieldVector< ct, cdim > *origins
\n+
334 =
new FieldVector< ct, cdim >[
size( topologyId, dim, 1 ) ];
\n+
335 referenceOrigins( topologyId, dim, 1, origins );
\n+
\n+
337 const unsigned int numFaces
\n+
338 = referenceIntegrationOuterNormals( topologyId, dim, origins, normals );
\n+
339 assert( numFaces ==
size( topologyId, dim, 1 ) );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
371 template<
class ctype_,
int dim >
\n+
372 class ReferenceElementImplementation
\n+
\n+
\n+
\n+
\n+
378 using ctype = ctype_;
\n+
\n+
381 using CoordinateField = ctype;
\n+
\n+
384 using Coordinate = Dune::FieldVector<ctype,dim>;
\n+
\n+
387 static constexpr int dimension = dim;
\n+
\n+
390 typedef ctype Volume;
\n+
\n+
\n+
\n+
394 friend class Impl::ReferenceElementContainer< ctype, dim >;
\n+
\n+
396 struct SubEntityInfo;
\n+
\n+
398 template<
int codim >
struct CreateGeometries;
\n+
\n+
\n+
402 template<
int codim >
\n+
\n+
\n+
406 typedef AffineGeometry< ctype, dim-codim, dim > Geometry;
\n+
\n+
\n+
\n+
410 ReferenceElementImplementation (
const ReferenceElementImplementation& ) =
delete;
\n+
\n+
\n+
413 ReferenceElementImplementation& operator= (
const ReferenceElementImplementation& ) =
delete;
\n+
\n+
\n+
416 ReferenceElementImplementation () =
default;
\n+
\n+
422 int size (
int c )
const \n+
\n+
424 assert( (c >= 0) && (c <= dim) );
\n+
425 return info_[ c ].size();
\n+
\n+
\n+
439 int size (
int i,
int c,
int cc )
const \n+
\n+
441 assert( (i >= 0) && (i <
size( c )) );
\n+
442 return info_[ c ][ i ].size( cc );
\n+
\n+
\n+
458 int subEntity (
int i,
int c,
int ii,
int cc )
const \n+
\n+
460 assert( (i >= 0) && (i <
size( c )) );
\n+
461 return info_[ c ][ i ].number( ii, cc );
\n+
\n+
\n+
479 auto subEntities (
int i,
int c,
int cc )
const \n+
\n+
481 assert( (i >= 0) && (i <
size( c )) );
\n+
482 return info_[ c ][ i ].numbers( cc );
\n+
\n+
\n+
493 const GeometryType &type (
int i,
int c )
const \n+
\n+
495 assert( (i >= 0) && (i <
size( c )) );
\n+
496 return info_[ c ][ i ].type();
\n+
\n+
\n+
500 const GeometryType &type ()
const {
return type( 0, 0 ); }
\n+
\n+
511 const Coordinate &position(
int i,
int c )
const \n+
\n+
513 assert( (c >= 0) && (c <= dim) );
\n+
514 return baryCenters_[ c ][ i ];
\n+
\n+
\n+
524 bool checkInside (
const Coordinate &local )
const \n+
\n+
526 const ctype tolerance = ctype( 64 ) * std::numeric_limits< ctype >::epsilon();
\n+
527 return Impl::template checkInside< ctype, dim >( type().
id(), dim, local, tolerance );
\n+
\n+
\n+
541 template<
int codim >
\n+
542 typename Codim< codim >::Geometry geometry (
int i )
const \n+
\n+
544 return std::get< codim >( geometries_ )[ i ];
\n+
\n+
\n+
548 Volume volume ()
const \n+
\n+
\n+
\n+
\n+
560 const Coordinate &integrationOuterNormal (
int face )
const \n+
\n+
562 assert( (face >= 0) && (face <
int( integrationNormals_.size() )) );
\n+
563 return integrationNormals_[ face ];
\n+
\n+
\n+
\n+
567 void initialize (
unsigned int topologyId )
\n+
\n+
569 assert( topologyId < Impl::numTopologies( dim ) );
\n+
\n+
\n+
572 for(
int codim = 0; codim <= dim; ++codim )
\n+
\n+
574 const unsigned int size = Impl::size( topologyId, dim, codim );
\n+
575 info_[ codim ].resize( size );
\n+
576 for(
unsigned int i = 0; i <
size; ++i )
\n+
577 info_[ codim ][ i ].initialize( topologyId, codim, i );
\n+
\n+
\n+
\n+
581 const unsigned int numVertices =
size( dim );
\n+
582 baryCenters_[ dim ].resize( numVertices );
\n+
583 Impl::referenceCorners( topologyId, dim, &(baryCenters_[ dim ][ 0 ]) );
\n+
\n+
\n+
586 for(
int codim = 0; codim < dim; ++codim )
\n+
\n+
588 baryCenters_[ codim ].resize(
size(codim) );
\n+
589 for(
int i = 0; i <
size( codim ); ++i )
\n+
\n+
591 baryCenters_[ codim ][ i ] = Coordinate( ctype( 0 ) );
\n+
592 const unsigned int numCorners =
size( i, codim, dim );
\n+
593 for(
unsigned int j = 0; j < numCorners; ++j )
\n+
594 baryCenters_[ codim ][ i ] += baryCenters_[ dim ][ subEntity( i, codim, j, dim ) ];
\n+
595 baryCenters_[ codim ][ i ] *= ctype( 1 ) / ctype( numCorners );
\n+
\n+
\n+
\n+
\n+
600 volume_ = Impl::template referenceVolume< ctype >( topologyId, dim );
\n+
\n+
\n+
\n+
\n+
605 integrationNormals_.resize(
size( 1 ) );
\n+
606 Impl::referenceIntegrationOuterNormals( topologyId, dim, &(integrationNormals_[ 0 ]) );
\n+
\n+
\n+
\n+
610 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ](
auto i ){ CreateGeometries< i >::apply( *
this, geometries_ ); } );
\n+
\n+
\n+
613 template<
int... codim >
\n+
614 static std::tuple< std::vector< typename Codim< codim >::Geometry >... >
\n+
615 makeGeometryTable ( std::integer_sequence< int, codim... > );
\n+
\n+
618 typedef decltype( makeGeometryTable( std::make_integer_sequence< int, dim+1 >() ) ) GeometryTable;
\n+
\n+
\n+
\n+
623 std::vector< Coordinate > baryCenters_[ dim+1 ];
\n+
624 std::vector< Coordinate > integrationNormals_;
\n+
\n+
627 GeometryTable geometries_;
\n+
\n+
629 std::vector< SubEntityInfo > info_[ dim+1 ];
\n+
\n+
\n+
633 template<
class ctype,
int dim >
\n+
634 struct ReferenceElementImplementation< ctype, dim >::SubEntityInfo
\n+
\n+
\n+
\n+
\n+
639 static constexpr std::size_t maxSubEntityCount()
\n+
\n+
641 std::size_t maxCount=0;
\n+
642 for(std::size_t codim=0; codim<=dim; ++codim)
\n+
643 maxCount = std::max(maxCount,
binomial(std::size_t(dim),codim)*(1 << codim));
\n+
\n+
\n+
\n+
647 using SubEntityFlags = std::bitset<maxSubEntityCount()>;
\n+
\n+
\n+
650 :
public Dune::IteratorRange<const unsigned int*>
\n+
\n+
652 using Base =
typename Dune::IteratorRange<const unsigned int*>;
\n+
\n+
\n+
\n+
656 using iterator = Base::iterator;
\n+
657 using const_iterator = Base::const_iterator;
\n+
\n+
659 SubEntityRange(
const iterator& begin,
const iterator& end,
const SubEntityFlags& contains) :
\n+
\n+
661 containsPtr_(&contains),
\n+
\n+
\n+
\n+
\n+
\n+
667 containsPtr_(nullptr),
\n+
\n+
\n+
\n+
671 std::size_t
size()
const \n+
\n+
\n+
\n+
\n+
676 bool contains(std::size_t i)
const \n+
\n+
678 return (*containsPtr_)[i];
\n+
\n+
\n+
\n+
682 const SubEntityFlags* containsPtr_;
\n+
\n+
\n+
\n+
\n+
687 using NumberRange =
typename Dune::IteratorRange<const unsigned int*>;
\n+
\n+
\n+
690 : numbering_( nullptr )
\n+
\n+
692 std::fill( offset_.begin(), offset_.end(), 0 );
\n+
\n+
\n+
695 SubEntityInfo (
const SubEntityInfo &other )
\n+
696 : offset_( other.offset_ ),
\n+
697 type_( other.type_ ),
\n+
698 containsSubentity_( other.containsSubentity_ )
\n+
\n+
700 numbering_ = allocate();
\n+
701 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
\n+
\n+
\n+
704 ~SubEntityInfo () { deallocate( numbering_ ); }
\n+
\n+
706 const SubEntityInfo &operator= (
const SubEntityInfo &other )
\n+
\n+
\n+
709 offset_ = other.offset_;
\n+
\n+
711 deallocate( numbering_ );
\n+
712 numbering_ = allocate();
\n+
713 std::copy( other.numbering_, other.numbering_ + capacity(), numbering_ );
\n+
\n+
715 containsSubentity_ = other.containsSubentity_;
\n+
\n+
\n+
\n+
\n+
720 int size (
int cc )
const \n+
\n+
722 assert( (cc >= 0) && (cc <= dim) );
\n+
723 return (offset_[ cc+1 ] - offset_[ cc ]);
\n+
\n+
\n+
726 int number (
int ii,
int cc )
const \n+
\n+
728 assert( (ii >= 0) && (ii <
size( cc )) );
\n+
729 return numbering_[ offset_[ cc ] + ii ];
\n+
\n+
\n+
732 auto numbers (
int cc )
const \n+
\n+
734 return SubEntityRange( numbering_ + offset_[ cc ], numbering_ + offset_[ cc+1 ], containsSubentity_[cc]);
\n+
\n+
\n+
737 const GeometryType &type ()
const {
return type_; }
\n+
\n+
739 void initialize (
unsigned int topologyId,
int codim,
unsigned int i )
\n+
\n+
741 const unsigned int subId = Impl::subTopologyId( topologyId, dim, codim, i );
\n+
742 type_ = GeometryType( subId, dim-codim );
\n+
\n+
\n+
745 for(
int cc = 0; cc <= codim; ++cc )
\n+
\n+
747 for(
int cc = codim; cc <= dim; ++cc )
\n+
748 offset_[ cc+1 ] = offset_[ cc ] + Impl::size( subId, dim-codim, cc-codim );
\n+
\n+
\n+
751 deallocate( numbering_ );
\n+
752 numbering_ = allocate();
\n+
753 for(
int cc = codim; cc <= dim; ++cc )
\n+
754 Impl::subTopologyNumbering( topologyId, dim, codim, i, cc-codim, numbering_+offset_[ cc ], numbering_+offset_[ cc+1 ] );
\n+
\n+
\n+
757 for(std::size_t cc=0; cc<= dim; ++cc)
\n+
\n+
759 containsSubentity_[cc].reset();
\n+
760 for(std::size_t idx=0; idx<std::size_t(
size(cc)); ++idx)
\n+
761 containsSubentity_[cc][number(idx,cc)] =
true;
\n+
\n+
\n+
\n+
\n+
766 int codim ()
const {
return dim - type().dim(); }
\n+
\n+
768 unsigned int *allocate () {
return (capacity() != 0 ?
new unsigned int[ capacity() ] : nullptr); }
\n+
769 void deallocate (
unsigned int *ptr ) {
delete[] ptr; }
\n+
770 unsigned int capacity ()
const {
return offset_[ dim+1 ]; }
\n+
\n+
\n+
773 unsigned int *numbering_;
\n+
774 std::array< unsigned int, dim+2 > offset_;
\n+
\n+
776 std::array< SubEntityFlags, dim+1> containsSubentity_;
\n+
\n+
\n+
\n+
780 template<
class ctype,
int dim >
\n+
781 template<
int codim >
\n+
782 struct ReferenceElementImplementation< ctype, dim >::CreateGeometries
\n+
\n+
\n+
785 static typename ReferenceElements< ctype, dim-cc >::ReferenceElement
\n+
786 subRefElement(
const ReferenceElementImplementation< ctype, dim > &refElement,
int i, std::integral_constant< int, cc > )
\n+
\n+
\n+
\n+
\n+
\n+
792 subRefElement(
const ReferenceElementImplementation< ctype, dim > &refElement,
\n+
793 [[maybe_unused]]
int i, std::integral_constant<int, 0>)
\n+
\n+
\n+
\n+
\n+
798 static void apply (
const ReferenceElementImplementation< ctype, dim > &refElement, GeometryTable &geometries )
\n+
\n+
800 const int size = refElement.size( codim );
\n+
801 std::vector< FieldVector< ctype, dim > > origins( size );
\n+
802 std::vector< FieldMatrix< ctype, dim - codim, dim > > jacobianTransposeds( size );
\n+
803 Impl::referenceEmbeddings( refElement.type().id(), dim, codim, &(origins[ 0 ]), &(jacobianTransposeds[ 0 ]) );
\n+
\n+
805 std::get< codim >( geometries ).reserve( size );
\n+
806 for(
int i = 0; i <
size; ++i )
\n+
\n+
808 typename Codim< codim >::Geometry geometry( subRefElement( refElement, i, std::integral_constant< int, codim >() ), origins[ i ], jacobianTransposeds[ i ] );
\n+
809 std::get< codim >( geometries ).push_back( geometry );
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
\n+
A unique label for each type of element that can occur in a grid.
\n+
\n+
An implementation of the Geometry interface for affine geometries.
\n+
Definition affinegeometry.hh:21
\n+
@ size
Definition quadraturerules.hh:145
\n+
int binomial(int upper, int lower)
calculate
Definition simplex.cc:305
\n+
typename Container::ReferenceElement ReferenceElement
The reference element type.
Definition referenceelements.hh:188
\n+
static const ReferenceElement & general(const GeometryType &type)
get general reference elements
Definition referenceelements.hh:198
\n
![\"doxygen\"/](\"doxygen.svg\")