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
50 #if DUNE_ALBERTA_VERSION >= 0x300
68 #if DUNE_ALBERTA_VERSION >= 0x300
83 template<
class Data >
86 return MEM_ALLOC( size, Data );
89 template<
class Data >
92 return MEM_CALLOC( size, Data );
95 template<
class Data >
96 inline Data *
memReAlloc ( Data *ptr,
size_t oldSize,
size_t newSize )
98 return MEM_REALLOC( ptr, oldSize, newSize, Data );
101 template<
class Data >
102 inline void memFree ( Data *ptr,
size_t size )
104 return MEM_FREE( ptr, size, Data );
129 identityMatrix_[ i ][ j ] =
Real( 0 );
130 identityMatrix_[ i ][ i ] =
Real( 1 );
131 nullVector_[ i ] =
Real( 0 );
135 static This &instance ()
137 static This theInstance;
144 return instance().identityMatrix_;
149 return instance().nullVector_;
158 template<
int dim,
int codim >
159 struct NumSubEntities;
162 struct NumSubEntities< dim, 0 >
164 static const int value = 1;
168 struct NumSubEntities< dim, dim >
170 static const int value = dim+1;
174 struct NumSubEntities< 0, 0 >
176 static const int value = 1;
180 struct NumSubEntities< 2, 1 >
182 static const int value = 3;
186 struct NumSubEntities< 3, 1 >
188 static const int value = 4;
192 struct NumSubEntities< 3, 2 >
194 static const int value = 6;
202 template<
int dim,
int codim >
206 struct CodimType< dim, 0 >
208 static const int value = CENTER;
212 struct CodimType< dim, dim >
214 static const int value = VERTEX;
218 struct CodimType< 2, 1 >
220 static const int value = EDGE;
224 struct CodimType< 3, 1 >
226 static const int value = FACE;
230 struct CodimType< 3, 2 >
232 static const int value = EDGE;
255 #if DUNE_ALBERTA_VERSION >= 0x300
261 #if DUNE_ALBERTA_VERSION >= 0x300
267 #if DUNE_ALBERTA_VERSION >= 0x300
276 #if DUNE_ALBERTA_VERSION >= 0x300
282 #if DUNE_ALBERTA_CACHE_COORDINATES
311 template<
int dim,
int codim >
316 assert( (i >= 0) && (i < NumSubEntities< dim, codim >::value) );
328 assert( (i >= 0) && (i < numSubEntities) );
329 static int dune2alberta[ numSubEntities ] = { 0, 3, 1, 2, 4, 5 };
330 return dune2alberta[ i ];
339 template<
int dim,
int codim >
344 assert( (i >= 0) && (i < NumSubEntities< dim, codim >::value) );
354 assert( (i >= 0) && (i < NumSubEntities< dim, 1 >::value) );
364 assert( (i >= 0) && (i < NumSubEntities< 1, 1 >::value) );
376 assert( (i >= 0) && (i < numSubEntities) );
377 static int generic2alberta[ numSubEntities ] = { 0, 1, 3, 2, 4, 5 };
378 return generic2alberta[ i ];
387 template<
int dim,
template<
int,
int >
class Numbering = Generic2AlbertaNumbering >
392 template<
int codim >
395 int *dune2alberta_[ dim+1 ];
396 int *alberta2dune_[ dim+1 ];
397 int numSubEntities_[ dim+1 ];
405 ForLoop< Initialize, 0, dim >::apply( *
this );
410 for(
int codim = 0; codim <= dim; ++codim )
412 delete[]( dune2alberta_[ codim ] );
413 delete[]( alberta2dune_[ codim ] );
419 assert( (codim >= 0) && (codim <= dim) );
421 return dune2alberta_[ codim ][ i ];
426 assert( (codim >= 0) && (codim <= dim) );
428 return alberta2dune_[ codim ][ i ];
433 assert( (codim >= 0) && (codim <= dim) );
434 return numSubEntities_[ codim ];
443 template<
int dim,
template<
int,
int >
class Numbering >
444 template<
int codim >
457 const int j = Numbering< dim, codim >::apply( i );
458 map.dune2alberta_[ codim ][ i ] = j;
459 map.alberta2dune_[ codim ][ j ] = i;
469 template<
int dim,
int codim >
473 struct MapVertices< dim, 0 >
475 static int apply (
int subEntity,
int vertex )
477 assert( subEntity == 0 );
484 struct MapVertices< 2, 1 >
486 static int apply (
int subEntity,
int vertex )
488 assert( (subEntity >= 0) && (subEntity < 3) );
489 assert( (vertex >= 0) && (vertex < 2) );
491 static const int map[ 3 ][ 2 ] = { {1,2}, {0,2}, {0,1} };
492 return map[ subEntity ][
vertex ];
497 struct MapVertices< 3, 1 >
499 static int apply (
int subEntity,
int vertex )
501 assert( (subEntity >= 0) && (subEntity < 4) );
502 assert( (vertex >= 0) && (vertex < 3) );
504 static const int map[ 4 ][ 3 ] = { {1,2,3}, {0,2,3}, {0,1,3}, {0,1,2} };
505 return map[ subEntity ][
vertex ];
510 struct MapVertices< 3, 2 >
512 static int apply (
int subEntity,
int vertex )
514 assert( (subEntity >= 0) && (subEntity < 6) );
515 assert( (vertex >= 0) && (vertex < 2) );
516 static const int map[ 6 ][ 2 ] = { {0,1}, {0,2}, {0,3}, {1,2}, {1,3}, {2,3} };
517 return map[ subEntity ][
vertex ];
522 struct MapVertices< dim, dim >
524 static int apply (
int subEntity,
int vertex )
526 assert( (subEntity >= 0) && (subEntity < NumSubEntities< dim, 1 >::value) );
527 assert( vertex == 0 );
557 template<
int dim,
int subdim >
583 const int numVertices = NumSubEntities< 1, 1 >::value;
584 int dof[ numVertices ];
585 for(
int i = 0; i < numVertices; ++i )
587 const int j = MapVertices< dim, dim-1 >::apply( subEntity, i );
588 dof[ i ] = element->dof[ j ][ 0 ];
590 return (dof[ 0 ] < dof[ 1 ] ? 0 : 1);
603 assert( subEntity == 0 );
620 const int numVertices = NumSubEntities< 2, 2 >::value;
621 int dof[ numVertices ];
622 for(
int i = 0; i < numVertices; ++i )
624 const int j = MapVertices< dim, dim-2 >::apply( subEntity, i );
625 dof[ i ] = element->dof[ j ][ 0 ];
628 const int twist[ 8 ] = { -2, 1, 666, -1, 2, 666, -3, 0 };
629 const int k = int( dof[ 0 ] < dof[ 1 ] )
630 | (int( dof[ 0 ] < dof[ 2 ] ) << 1)
631 | (
int( dof[ 1 ] < dof[ 2 ] ) << 2);
632 assert( twist[ k ] != 666 );
646 assert( subEntity == 0 );
657 return (twist < 0 ? (2*numCorners + 1 - i + twist) : i + twist) % numCorners;
664 return (twist < 0 ? (2*numCorners + 1 - i + twist) : numCorners + i - twist) % numCorners;
671 #endif // #if HAVE_ALBERTA
673 #endif // #ifndef DUNE_ALBERTA_MISC_HH