3 #ifndef DUNE_ALBERTA_MISC_HH
4 #define DUNE_ALBERTA_MISC_HH
9 #include <dune/common/exceptions.hh>
10 #include <dune/common/hybridutilities.hh>
11 #include <dune/common/typetraits.hh>
18 #ifndef DUNE_ALBERTA_CACHE_COORDINATES
19 #define DUNE_ALBERTA_CACHE_COORDINATES 1
70 template<
class Data >
73 return MEM_ALLOC( size, Data );
76 template<
class Data >
79 return MEM_CALLOC( size, Data );
82 template<
class Data >
83 inline Data *
memReAlloc ( Data *ptr,
size_t oldSize,
size_t newSize )
85 return MEM_REALLOC( ptr, oldSize, newSize, Data );
88 template<
class Data >
89 inline void memFree ( Data *ptr,
size_t size )
91 return MEM_FREE( ptr, size, Data );
116 identityMatrix_[ i ][ j ] =
Real( 0 );
117 identityMatrix_[ i ][ i ] =
Real( 1 );
118 nullVector_[ i ] =
Real( 0 );
122 static This &instance ()
124 static This theInstance;
131 return instance().identityMatrix_;
136 return instance().nullVector_;
145 template<
int dim,
int codim >
151 static const int value = 1;
157 static const int value = dim+1;
163 static const int value = 1;
169 static const int value = 3;
175 static const int value = 4;
181 static const int value = 6;
189 template<
int dim,
int codim >
195 static const int value = CENTER;
201 static const int value = VERTEX;
207 static const int value = EDGE;
213 static const int value = FACE;
219 static const int value = EDGE;
253 #if DUNE_ALBERTA_CACHE_COORDINATES
282 template<
int dim,
int codim >
299 assert( (i >= 0) && (i < numSubEntities) );
300 static int dune2alberta[ numSubEntities ] = { 0, 3, 1, 2, 4, 5 };
301 return dune2alberta[ i ];
310 template<
int dim,
int codim >
347 assert( (i >= 0) && (i < numSubEntities) );
348 static int generic2alberta[ numSubEntities ] = { 0, 1, 3, 2, 4, 5 };
349 return generic2alberta[ i ];
358 template<
int dim,
template<
int,
int >
class Numbering = Generic2AlbertaNumbering >
363 template<
int codim >
366 int *dune2alberta_[ dim+1 ];
367 int *alberta2dune_[ dim+1 ];
368 int numSubEntities_[ dim+1 ];
376 Hybrid::forEach( std::make_index_sequence< dim+1 >{}, [ & ](
auto i ){ Initialize< i >::apply( *
this ); } );
381 for(
int codim = 0; codim <= dim; ++codim )
383 delete[]( dune2alberta_[ codim ] );
384 delete[]( alberta2dune_[ codim ] );
390 assert( (codim >= 0) && (codim <= dim) );
392 return dune2alberta_[ codim ][ i ];
397 assert( (codim >= 0) && (codim <= dim) );
399 return alberta2dune_[ codim ][ i ];
404 assert( (codim >= 0) && (codim <= dim) );
405 return numSubEntities_[ codim ];
414 template<
int dim,
template<
int,
int >
class Numbering >
415 template<
int codim >
416 struct NumberingMap< dim, Numbering >::Initialize
418 static const int numSubEntities = NumSubEntities< dim, codim >::value;
420 static void apply ( NumberingMap< dim, Numbering > &map )
428 const int j = Numbering< dim, codim >::apply( i );
429 map.dune2alberta_[ codim ][ i ] = j;
430 map.alberta2dune_[ codim ][ j ] = i;
440 template<
int dim,
int codim >
448 assert( subEntity == 0 );
459 assert( (subEntity >= 0) && (subEntity < 3) );
462 static const int map[ 3 ][ 2 ] = { {1,2}, {0,2}, {0,1} };
463 return map[ subEntity ][
vertex ];
472 assert( (subEntity >= 0) && (subEntity < 4) );
475 static const int map[ 4 ][ 3 ] = { {1,2,3}, {0,2,3}, {0,1,3}, {0,1,2} };
476 return map[ subEntity ][
vertex ];
485 assert( (subEntity >= 0) && (subEntity < 6) );
487 static const int map[ 6 ][ 2 ] = { {0,1}, {0,2}, {0,3}, {1,2}, {1,3}, {2,3} };
488 return map[ subEntity ][
vertex ];
528 template<
int dim,
int subdim >
537 [[maybe_unused]]
int subEntity )
556 int dof[ numVertices ];
557 for(
int i = 0; i < numVertices; ++i )
560 dof[ i ] = element->dof[ j ][ 0 ];
562 return (dof[ 0 ] < dof[ 1 ] ? 0 : 1);
574 [[maybe_unused]]
int subEntity )
576 assert( subEntity == 0 );
594 int dof[ numVertices ];
595 for(
int i = 0; i < numVertices; ++i )
598 dof[ i ] = element->dof[ j ][ 0 ];
601 const int twist[ 8 ] = { -2, 1, 666, -1, 2, 666, -3, 0 };
602 const int k = int( dof[ 0 ] < dof[ 1 ] )
603 | (int( dof[ 0 ] < dof[ 2 ] ) << 1)
604 | (
int( dof[ 1 ] < dof[ 2 ] ) << 2);
605 assert(
twist[ k ] != 666 );
618 [[maybe_unused]]
int subEntity )
620 assert( subEntity == 0 );
631 return (twist < 0 ? (2*numCorners + 1 - i + twist) : i + twist) % numCorners;
638 return (twist < 0 ? (2*numCorners + 1 - i + twist) : numCorners + i - twist) % numCorners;
#define DIM_OF_WORLD
Definition: albertaheader.hh:21
#define ALBERTA
Definition: albertaheader.hh:27
Include standard header files.
Definition: agrid.hh:58
int applyInverseTwist(int twist, int i)
Definition: misc.hh:635
ALBERTA MESH Mesh
Definition: misc.hh:51
int applyTwist(int twist, int i)
Definition: misc.hh:628
void memFree(Data *ptr, size_t size)
Definition: misc.hh:89
ALBERTA REAL_DD GlobalMatrix
Definition: misc.hh:49
ALBERTA AFF_TRAFO AffineTransformation
Definition: misc.hh:50
Data * memCAlloc(size_t size)
Definition: misc.hh:77
ALBERTA REAL_B LocalVector
Definition: misc.hh:47
ALBERTA EL Element
Definition: misc.hh:52
ALBERTA BNDRY_TYPE BoundaryId
Definition: misc.hh:59
static const int InteriorBoundary
Definition: misc.hh:57
ALBERTA REAL Real
Definition: misc.hh:46
static const int meshRefined
Definition: misc.hh:54
static const int DirichletBoundary
Definition: misc.hh:58
ALBERTA FE_SPACE DofSpace
Definition: misc.hh:63
static const int dimWorld
Definition: misc.hh:44
Data * memAlloc(size_t size)
Definition: misc.hh:71
U_CHAR ElementType
Definition: misc.hh:61
Data * memReAlloc(Data *ptr, size_t oldSize, size_t newSize)
Definition: misc.hh:83
static const int meshCoarsened
Definition: misc.hh:55
ALBERTA REAL_D GlobalVector
Definition: misc.hh:48
@ vertex
Definition: common.hh:131
static const Matrix & identityMatrix()
Definition: misc.hh:129
GlobalMatrix Matrix
Definition: misc.hh:104
GlobalVector Vector
Definition: misc.hh:105
static const Vector & nullVector()
Definition: misc.hh:134
static const Flags nothing
Definition: misc.hh:232
static const Flags nonPeriodic
Definition: misc.hh:246
static const Flags boundaryId
Definition: misc.hh:244
static const Flags elementType
Definition: misc.hh:242
ALBERTA FLAGS Flags
Definition: misc.hh:230
static const Flags projection
Definition: misc.hh:240
static const Flags coords
Definition: misc.hh:234
static const Flags orientation
Definition: misc.hh:238
static const Flags standard
Definition: misc.hh:254
static const Flags neighbor
Definition: misc.hh:236
static const Flags all
Definition: misc.hh:248
static const Flags standardWithCoords
Definition: misc.hh:251
static const int value
Definition: misc.hh:268
static int apply(const int i)
Definition: misc.hh:285
static int apply(const int i)
Definition: misc.hh:297
static int apply(const int i)
Definition: misc.hh:313
static int apply(const int i)
Definition: misc.hh:323
static int apply(const int i)
Definition: misc.hh:333
static int apply(const int i)
Definition: misc.hh:345
int alberta2dune(int codim, int i) const
Definition: misc.hh:395
int numSubEntities(int codim) const
Definition: misc.hh:402
int dune2alberta(int codim, int i) const
Definition: misc.hh:388
~NumberingMap()
Definition: misc.hh:379
NumberingMap()
Definition: misc.hh:374
static int apply(int subEntity, int vertex)
Definition: misc.hh:446
static int apply(int subEntity, int vertex)
Definition: misc.hh:457
static int apply(int subEntity, int vertex)
Definition: misc.hh:470
static int apply(int subEntity, int vertex)
Definition: misc.hh:483
static int apply(int subEntity, int vertex)
Definition: misc.hh:495
static const int maxTwist
Definition: misc.hh:534
static int twist([[maybe_unused]] const Element *element, [[maybe_unused]] int subEntity)
Definition: misc.hh:536
static const int minTwist
Definition: misc.hh:533
static const int numSubEntities
Definition: misc.hh:531
static int twist(const Element *element, int subEntity)
Definition: misc.hh:552
static int twist([[maybe_unused]] const Element *element, [[maybe_unused]] int subEntity)
Definition: misc.hh:573
static int twist(const Element *element, int subEntity)
Definition: misc.hh:590
static int twist([[maybe_unused]] const Element *element, [[maybe_unused]] int subEntity)
Definition: misc.hh:617