3 #ifndef DUNE_ALBERTA_MISC_HH
4 #define DUNE_ALBERTA_MISC_HH
8 #include <dune/common/exceptions.hh>
9 #include <dune/common/typetraits.hh>
10 #include <dune/common/forloop.hh>
17 #ifndef DUNE_ALBERTA_CACHE_COORDINATES
18 #define DUNE_ALBERTA_CACHE_COORDINATES 1
69 template<
class Data >
72 return MEM_ALLOC( size, Data );
75 template<
class Data >
78 return MEM_CALLOC( size, Data );
81 template<
class Data >
82 inline Data *
memReAlloc ( Data *ptr,
size_t oldSize,
size_t newSize )
84 return MEM_REALLOC( ptr, oldSize, newSize, Data );
87 template<
class Data >
88 inline void memFree ( Data *ptr,
size_t size )
90 return MEM_FREE( ptr, size, Data );
115 identityMatrix_[ i ][ j ] =
Real( 0 );
116 identityMatrix_[ i ][ i ] =
Real( 1 );
117 nullVector_[ i ] =
Real( 0 );
121 static This &instance ()
123 static This theInstance;
130 return instance().identityMatrix_;
135 return instance().nullVector_;
144 template<
int dim,
int codim >
150 static const int value = 1;
156 static const int value = dim+1;
162 static const int value = 1;
168 static const int value = 3;
174 static const int value = 4;
180 static const int value = 6;
188 template<
int dim,
int codim >
194 static const int value = CENTER;
200 static const int value = VERTEX;
206 static const int value = EDGE;
212 static const int value = FACE;
218 static const int value = EDGE;
252 #if DUNE_ALBERTA_CACHE_COORDINATES
281 template<
int dim,
int codim >
298 assert( (i >= 0) && (i < numSubEntities) );
299 static int dune2alberta[ numSubEntities ] = { 0, 3, 1, 2, 4, 5 };
300 return dune2alberta[ i ];
309 template<
int dim,
int codim >
346 assert( (i >= 0) && (i < numSubEntities) );
347 static int generic2alberta[ numSubEntities ] = { 0, 1, 3, 2, 4, 5 };
348 return generic2alberta[ i ];
357 template<
int dim,
template<
int,
int >
class Numbering = Generic2AlbertaNumbering >
362 template<
int codim >
365 int *dune2alberta_[ dim+1 ];
366 int *alberta2dune_[ dim+1 ];
367 int numSubEntities_[ dim+1 ];
375 ForLoop< Initialize, 0, dim >::apply( *
this );
380 for(
int codim = 0; codim <= dim; ++codim )
382 delete[]( dune2alberta_[ codim ] );
383 delete[]( alberta2dune_[ codim ] );
389 assert( (codim >= 0) && (codim <= dim) );
391 return dune2alberta_[ codim ][ i ];
396 assert( (codim >= 0) && (codim <= dim) );
398 return alberta2dune_[ codim ][ i ];
403 assert( (codim >= 0) && (codim <= dim) );
404 return numSubEntities_[ codim ];
413 template<
int dim,
template<
int,
int >
class Numbering >
414 template<
int codim >
415 struct NumberingMap< dim, Numbering >::Initialize
417 static const int numSubEntities = NumSubEntities< dim, codim >::value;
419 static void apply ( NumberingMap< dim, Numbering > &map )
427 const int j = Numbering< dim, codim >::apply( i );
428 map.dune2alberta_[ codim ][ i ] = j;
429 map.alberta2dune_[ codim ][ j ] = i;
439 template<
int dim,
int codim >
447 assert( subEntity == 0 );
458 assert( (subEntity >= 0) && (subEntity < 3) );
461 static const int map[ 3 ][ 2 ] = { {1,2}, {0,2}, {0,1} };
462 return map[ subEntity ][
vertex ];
471 assert( (subEntity >= 0) && (subEntity < 4) );
474 static const int map[ 4 ][ 3 ] = { {1,2,3}, {0,2,3}, {0,1,3}, {0,1,2} };
475 return map[ subEntity ][
vertex ];
484 assert( (subEntity >= 0) && (subEntity < 6) );
486 static const int map[ 6 ][ 2 ] = { {0,1}, {0,2}, {0,3}, {1,2}, {1,3}, {2,3} };
487 return map[ subEntity ][
vertex ];
527 template<
int dim,
int subdim >
554 int dof[ numVertices ];
555 for(
int i = 0; i < numVertices; ++i )
558 dof[ i ] = element->dof[ j ][ 0 ];
560 return (dof[ 0 ] < dof[ 1 ] ? 0 : 1);
573 assert( subEntity == 0 );
591 int dof[ numVertices ];
592 for(
int i = 0; i < numVertices; ++i )
595 dof[ i ] = element->dof[ j ][ 0 ];
598 const int twist[ 8 ] = { -2, 1, 666, -1, 2, 666, -3, 0 };
599 const int k = int( dof[ 0 ] < dof[ 1 ] )
600 | (int( dof[ 0 ] < dof[ 2 ] ) << 1)
601 | (
int( dof[ 1 ] < dof[ 2 ] ) << 2);
602 assert(
twist[ k ] != 666 );
616 assert( subEntity == 0 );
627 return (twist < 0 ? (2*numCorners + 1 - i + twist) : i + twist) % numCorners;
634 return (twist < 0 ? (2*numCorners + 1 - i + twist) : numCorners + i - twist) % numCorners;
641 #endif // #if HAVE_ALBERTA
643 #endif // #ifndef DUNE_ALBERTA_MISC_HH