|
MOAB: Mesh Oriented datABase
(version 5.4.1)
|
|
MOAB: Mesh Oriented datABase
(version 5.4.1)
|
Inheritance diagram for TopologyInfoTest: Collaboration diagram for TopologyInfoTest:Definition at line 38 of file TopologyInfoTest.cpp.
| TopologyInfoTest::TopologyInfoTest | ( | ) | [inline] |
Definition at line 116 of file TopologyInfoTest.cpp.
{}
| void TopologyInfoTest::bad_type | ( | ) |
Definition at line 1119 of file TopologyInfoTest.cpp.
References b, corners, CPPUNIT_ASSERT, dim, edges, MBMesquite::faces, MBMesquite::MIXED, and moab::side_number().
{
MBMesquite::MsqError err;
EntityTopology bad_types[] = { (EntityTopology)0, (EntityTopology)1, MIXED, (EntityTopology)( MIXED + 1 ) };
for( unsigned i = 0; i < ( sizeof( bad_types ) / sizeof( EntityTopology ) ); ++i )
{
CPPUNIT_ASSERT( TopologyInfo::dimension( bad_types[i] ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::adjacent( bad_types[i], 1 ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::sides( bad_types[i] ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::corners( bad_types[i] ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::edges( bad_types[i] ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::faces( bad_types[i] ) == 0 );
bool a, b, c;
TopologyInfo::higher_order( bad_types[i], 20, a, b, c, err );
CPPUNIT_ASSERT( err );
const unsigned* ptr;
ptr = TopologyInfo::edge_vertices( bad_types[i], 0, err );
CPPUNIT_ASSERT( err );
unsigned count;
ptr = TopologyInfo::face_vertices( bad_types[i], 0, count, err );
CPPUNIT_ASSERT( err );
for( unsigned j = 0; j < 4; ++j )
{
ptr = TopologyInfo::side_vertices( bad_types[i], j, 0, count, err );
CPPUNIT_ASSERT( err );
}
unsigned dim, side;
for( unsigned idx = 0; idx < 20; ++idx )
{
TopologyInfo::side_number( bad_types[i], idx, idx / 2, dim, side, err );
CPPUNIT_ASSERT( err );
}
}
}
| bool TopologyInfoTest::compare_edge | ( | const unsigned * | a, |
| const unsigned * | b | ||
| ) |
| bool TopologyInfoTest::compare_face | ( | unsigned | len, |
| const unsigned * | a, | ||
| const unsigned * | b | ||
| ) |
Definition at line 229 of file TopologyInfoTest.cpp.
{
unsigned i, j;
for( i = 0; i < len; ++i )
{
for( j = 0; j < len; ++j )
{
if( a[j] != b[( i + j ) % len] ) break;
}
if( j == len ) return true;
}
return false;
}
| void TopologyInfoTest::compare_sides | ( | ) |
Definition at line 1589 of file TopologyInfoTest.cpp.
References MBMesquite::compare_sides(), CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, MBMesquite::edges, MBMesquite::faces, and MBMesquite::HEXAHEDRON.
{
// define two hexes sharing a face:
// 6-------7-------8
// /| /| /|
// 0-------1-------2 |
// | | | | | |
// | 9-----|-10----|-11
// |/ |/ |/
// 3-------4-------5
const size_t hex1[] = { 3, 4, 10, 9, 0, 1, 7, 6 };
const size_t hex2[] = { 4, 5, 11, 10, 1, 2, 8, 7 };
// shared edges: { hex1_edge, hex2_edge }
const unsigned edges[][2] = { { 1, 3 }, { 5, 4 }, { 6, 7 }, { 9, 11 } };
const unsigned num_edges = sizeof( edges ) / sizeof( edges[0] );
// shared faces: { hex1_face, hex2_face }
const unsigned faces[][2] = { { 1, 3 } };
const unsigned num_faces = sizeof( faces ) / sizeof( faces[0] );
MsqPrintError err( std::cerr );
// try every possible edge combination
for( unsigned e1 = 0; e1 < 12; ++e1 )
{
unsigned match;
for( match = 0; match < num_edges; ++match )
if( edges[match][0] == e1 ) break;
for( unsigned e2 = 0; e2 < 12; ++e2 )
{
const bool expected = ( match < num_edges ) && ( edges[match][1] == e2 );
const bool result = TopologyInfo::compare_sides( hex1, HEXAHEDRON, e1, hex2, HEXAHEDRON, e2, 1, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( expected, result );
}
}
// try every possible face combination
for( unsigned f1 = 0; f1 < 6; ++f1 )
{
unsigned match;
for( match = 0; match < num_faces; ++match )
if( faces[match][0] == f1 ) break;
for( unsigned f2 = 0; f2 < 6; ++f2 )
{
const bool expected = ( match < num_faces ) && ( faces[match][1] == f2 );
const bool result = TopologyInfo::compare_sides( hex1, HEXAHEDRON, f1, hex2, HEXAHEDRON, f2, 2, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( expected, result );
}
}
}
| bool TopologyInfoTest::compare_vol | ( | unsigned | len, |
| const unsigned * | a, | ||
| const unsigned * | b | ||
| ) |
Definition at line 243 of file TopologyInfoTest.cpp.
{
for( unsigned i = 0; i < len; ++i )
if( a[i] != b[i] ) return false;
return true;
}
| TopologyInfoTest::CPPUNIT_TEST | ( | tri | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri3 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri4 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri6 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri7 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad4 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad5 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad8 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad9 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet4 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet5 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet8 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet9 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet10 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet11 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet14 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet15 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex8 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex9 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex14 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex15 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex20 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex21 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex26 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex27 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | pyramid | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | pyramid5 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | pyramid13 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | wedge | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | wedge6 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | wedge15 | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | polygon | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | polyhedron | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | bad_type | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | pyr_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | wdg_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tri_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | quad_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | tet_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | hex_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | pyr_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | wdg_rev_adj_vert | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | higher_order_from_side | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | side_from_higher_order | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | find_edge | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | find_face | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | find_side | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST | ( | compare_sides | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST_SUITE | ( | TopologyInfoTest | ) | [private] |
| TopologyInfoTest::CPPUNIT_TEST_SUITE_END | ( | ) | [private] |
| void TopologyInfoTest::find_edge | ( | ) |
Definition at line 1407 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, MBMesquite::edges, MBMesquite::HEXAHEDRON, MBMesquite::PRISM, MBMesquite::PYRAMID, MBMesquite::QUADRILATERAL, t, MBMesquite::TETRAHEDRON, and MBMesquite::TRIANGLE.
{
MsqPrintError err( std::cerr );
bool reversed;
EntityTopology types[] = { TRIANGLE, QUADRILATERAL, TETRAHEDRON, HEXAHEDRON, PRISM, PYRAMID };
const unsigned num_types = sizeof( types ) / sizeof( types[0] );
unsigned idx;
for( unsigned t = 0; t < num_types; ++t )
{
const EntityTopology type = types[t];
for( unsigned e = 0; e < TopologyInfo::edges( type ); ++e )
{
const unsigned* const v = TopologyInfo::edge_vertices( type, e, err );
CPPUNIT_ASSERT( !err );
idx = TopologyInfo::find_edge( type, v, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( e, idx );
CPPUNIT_ASSERT( !reversed );
const unsigned switched[2] = { v[1], v[0] };
idx = TopologyInfo::find_edge( type, switched, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( e, idx );
CPPUNIT_ASSERT( reversed );
}
}
}
| void TopologyInfoTest::find_face | ( | ) |
Definition at line 1450 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, MBMesquite::faces, find_face(), MBMesquite::HEXAHEDRON, n, MBMesquite::PRISM, MBMesquite::PYRAMID, reverse(), shift(), t, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( std::cerr );
bool reversed;
unsigned switched[4], idx;
EntityTopology types[] = { TETRAHEDRON, HEXAHEDRON, PRISM, PYRAMID };
const unsigned num_types = sizeof( types ) / sizeof( types[0] );
for( unsigned t = 0; t < num_types; ++t )
{
const EntityTopology type = types[t];
for( unsigned f = 0; f < TopologyInfo::faces( type ); ++f )
{
unsigned n;
const unsigned* const v = TopologyInfo::face_vertices( type, f, n, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( n == 3 || n == 4 );
idx = TopologyInfo::find_face( type, v, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( !reversed );
// advance by 1 and try again
shift( v, switched, n, 1 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( !reversed );
// advance by 2 and try again
shift( v, switched, n, 2 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( !reversed );
// advance by 3 and try again
shift( v, switched, n, 3 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( !reversed );
// reverse and try again
reverse( v, switched, n, 0 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( reversed );
// reverse, advance by 1 and try again
reverse( v, switched, n, 1 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( reversed );
// reverse, advance by 2 and try again
reverse( v, switched, n, 2 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( reversed );
// reverse, advance by 3 and try again
reverse( v, switched, n, 3 );
idx = TopologyInfo::find_face( type, switched, n, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, idx );
CPPUNIT_ASSERT( reversed );
}
}
}
| void TopologyInfoTest::find_side | ( | ) |
Definition at line 1527 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, dim, MBMesquite::edges, MBMesquite::faces, find_side(), MBMesquite::HEXAHEDRON, n, MBMesquite::PRISM, MBMesquite::PYRAMID, MBMesquite::QUADRILATERAL, reverse(), t, MBMesquite::TETRAHEDRON, MBMesquite::TRIANGLE, and u.
{
MsqPrintError err( std::cerr );
bool reversed;
unsigned i, dim, switched[4];
EntityTopology types[] = { TRIANGLE, QUADRILATERAL, TETRAHEDRON, HEXAHEDRON, PRISM, PYRAMID };
const unsigned num_types = sizeof( types ) / sizeof( types[0] );
for( unsigned t = 0; t < num_types; ++t )
{
const EntityTopology type = types[t];
for( unsigned e = 0; e < TopologyInfo::edges( type ); ++e )
{
const unsigned* const v = TopologyInfo::edge_vertices( type, e, err );
CPPUNIT_ASSERT( !err );
TopologyInfo::find_side( type, v, 2, dim, i, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( e, i );
CPPUNIT_ASSERT_EQUAL( 1u, dim );
CPPUNIT_ASSERT( !reversed );
switched[0] = v[1];
switched[1] = v[0];
TopologyInfo::find_side( type, switched, 2, dim, i, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( e, i );
CPPUNIT_ASSERT_EQUAL( 1u, dim );
CPPUNIT_ASSERT( reversed );
}
}
for( unsigned t = 2; t < num_types; ++t )
{
const EntityTopology type = types[t];
for( unsigned f = 0; f < TopologyInfo::faces( type ); ++f )
{
unsigned n;
const unsigned* const v = TopologyInfo::face_vertices( type, f, n, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( n == 3 || n == 4 );
TopologyInfo::find_side( type, v, n, dim, i, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, i );
CPPUNIT_ASSERT_EQUAL( 2u, dim );
CPPUNIT_ASSERT( !reversed );
// reverse and try again
reverse( v, switched, n, 0 );
TopologyInfo::find_side( type, switched, n, dim, i, reversed, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( f, i );
CPPUNIT_ASSERT_EQUAL( 2u, dim );
CPPUNIT_ASSERT( reversed );
}
}
}
| void TopologyInfoTest::hex | ( | ) |
Definition at line 709 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
const unsigned num_verts = 8;
const unsigned num_edges = 12;
const unsigned num_faces = 6;
CPPUNIT_ASSERT( 3 == TopologyInfo::dimension( HEXAHEDRON ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( HEXAHEDRON, 3 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::adjacent( HEXAHEDRON, 2 ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::adjacent( HEXAHEDRON, 1 ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::adjacent( HEXAHEDRON, 0 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::sides( HEXAHEDRON ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::corners( HEXAHEDRON ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::edges( HEXAHEDRON ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::faces( HEXAHEDRON ) );
const unsigned* side;
unsigned i, count;
const unsigned vert_per_face = 4;
unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 3, 0 }, { 0, 4 }, { 1, 5 },
{ 2, 6 }, { 3, 7 }, { 4, 5 }, { 5, 6 }, { 6, 7 }, { 7, 4 } };
unsigned faces[num_faces][vert_per_face] = { { 0, 1, 5, 4 }, { 1, 2, 6, 5 }, { 2, 3, 7, 6 },
{ 3, 0, 4, 7 }, { 3, 2, 1, 0 }, { 4, 5, 6, 7 } };
for( i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( HEXAHEDRON, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( HEXAHEDRON, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
for( i = 0; i < num_faces; ++i )
{
side = TopologyInfo::face_vertices( HEXAHEDRON, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == vert_per_face );
CPPUNIT_ASSERT( compare_face( vert_per_face, side, faces[i] ) );
side = TopologyInfo::side_vertices( HEXAHEDRON, 2, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == vert_per_face );
CPPUNIT_ASSERT( compare_face( vert_per_face, side, faces[i] ) );
}
side = TopologyInfo::side_vertices( HEXAHEDRON, 3, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == num_verts );
for( i = 0; i < num_verts; ++i )
CPPUNIT_ASSERT( side[i] == i );
}
| void TopologyInfoTest::hex14 | ( | ) |
Definition at line 797 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 14;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex15 | ( | ) |
Definition at line 812 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 15;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex20 | ( | ) |
Definition at line 827 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 20;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex21 | ( | ) |
Definition at line 842 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 21;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex26 | ( | ) |
Definition at line 857 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 26;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex27 | ( | ) |
Definition at line 872 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 27;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex8 | ( | ) |
Definition at line 767 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 8;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex9 | ( | ) |
Definition at line 782 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 9;
TopologyInfo::higher_order( HEXAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( vol );
test_vol_elem( HEXAHEDRON, num_nodes, 8, 12, 6 );
}
| void TopologyInfoTest::hex_adj_vert | ( | ) |
Definition at line 1178 of file TopologyInfoTest.cpp.
References MBMesquite::HEXAHEDRON.
{
unsigned data[][5] = { { 3, 1, 3, 4, 0 }, { 3, 2, 0, 5, 0 }, { 3, 3, 1, 6, 0 }, { 3, 0, 2, 7, 0 },
{ 3, 7, 5, 0, 0 }, { 3, 4, 6, 1, 0 }, { 3, 5, 7, 2, 0 }, { 3, 6, 4, 3, 0 } };
test_adj( MBMesquite::HEXAHEDRON, data );
}
| void TopologyInfoTest::hex_rev_adj_vert | ( | ) | [inline] |
Definition at line 199 of file TopologyInfoTest.cpp.
References MBMesquite::HEXAHEDRON.
{
test_rev_adj( MBMesquite::HEXAHEDRON );
}
Definition at line 1306 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, dim, HEX14, HEX15, HEX20, HEX26, HEX27, HEX9, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( std::cerr );
// HEX-27
for( unsigned i = 0; i < 19; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 27, HEX27[i].dim, HEX27[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX27[i].idx, result );
}
// HEX-26
for( unsigned i = 0; i < 18; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 26, HEX26[i].dim, HEX26[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX26[i].idx, result );
}
// HEX-20
for( unsigned i = 0; i < 12; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 20, HEX20[i].dim, HEX20[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX20[i].idx, result );
}
// HEX-15
for( unsigned i = 0; i < 7; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 15, HEX15[i].dim, HEX15[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX15[i].idx, result );
}
// HEX-14
for( unsigned i = 0; i < 6; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 14, HEX14[i].dim, HEX14[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX14[i].idx, result );
}
// HEX-9
for( unsigned i = 0; i < 1; ++i )
{
unsigned result = TopologyInfo::higher_order_from_side( HEXAHEDRON, 9, HEX9[i].dim, HEX9[i].num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX9[i].idx, result );
}
}
| void TopologyInfoTest::polygon | ( | ) |
Definition at line 1107 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::POLYGON.
{
CPPUNIT_ASSERT( TopologyInfo::dimension( POLYGON ) == 2 );
test_poly( POLYGON );
}
| void TopologyInfoTest::polyhedron | ( | ) |
Definition at line 1113 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::POLYHEDRON.
{
CPPUNIT_ASSERT( TopologyInfo::dimension( POLYHEDRON ) == 3 );
test_poly( POLYHEDRON );
}
| void TopologyInfoTest::pyr_adj_vert | ( | ) |
Definition at line 1185 of file TopologyInfoTest.cpp.
References MBMesquite::PYRAMID.
{
unsigned data[][5] = {
{ 3, 1, 3, 4, 0 }, { 3, 2, 0, 4, 0 }, { 3, 3, 1, 4, 0 }, { 3, 0, 2, 4, 0 }, { 4, 3, 2, 1, 0 } };
test_adj( MBMesquite::PYRAMID, data );
}
| void TopologyInfoTest::pyr_rev_adj_vert | ( | ) | [inline] |
Definition at line 203 of file TopologyInfoTest.cpp.
References MBMesquite::PYRAMID.
{
test_rev_adj( MBMesquite::PYRAMID );
}
| void TopologyInfoTest::pyramid | ( | ) |
Definition at line 887 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::PYRAMID.
{
MsqPrintError err( cout );
const unsigned num_verts = 5;
const unsigned num_edges = 8;
const unsigned num_faces = 5;
CPPUNIT_ASSERT( 3 == TopologyInfo::dimension( PYRAMID ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( PYRAMID, 3 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::adjacent( PYRAMID, 2 ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::adjacent( PYRAMID, 1 ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::adjacent( PYRAMID, 0 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::sides( PYRAMID ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::corners( PYRAMID ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::edges( PYRAMID ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::faces( PYRAMID ) );
const unsigned* side;
unsigned i, count;
const unsigned num_tri_faces = 4;
const unsigned num_quad_faces = 1;
const bool tri_before_quad = true;
CPPUNIT_ASSERT( num_tri_faces + num_quad_faces == num_faces );
unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 3, 0 }, { 0, 4 }, { 1, 4 }, { 2, 4 }, { 3, 4 } };
unsigned tris[num_tri_faces][3] = { { 0, 1, 4 }, { 1, 2, 4 }, { 2, 3, 4 }, { 3, 0, 4 } };
unsigned quads[num_quad_faces][4] = { { 3, 2, 1, 0 } };
for( i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( PYRAMID, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( PYRAMID, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
const unsigned tri_off = num_quad_faces * !tri_before_quad;
for( i = 0; i < num_tri_faces; ++i )
{
side = TopologyInfo::face_vertices( PYRAMID, i + tri_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 3 );
CPPUNIT_ASSERT( compare_face( 3, side, tris[i] ) );
side = TopologyInfo::side_vertices( PYRAMID, 2, i + tri_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 3 );
CPPUNIT_ASSERT( compare_face( 3, side, tris[i] ) );
}
const unsigned quad_off = num_tri_faces * tri_before_quad;
for( i = 0; i < num_quad_faces; ++i )
{
side = TopologyInfo::face_vertices( PYRAMID, i + quad_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 4 );
CPPUNIT_ASSERT( compare_face( 4, side, quads[i] ) );
side = TopologyInfo::side_vertices( PYRAMID, 2, i + quad_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 4 );
CPPUNIT_ASSERT( compare_face( 4, side, quads[i] ) );
}
side = TopologyInfo::side_vertices( PYRAMID, 3, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == num_verts );
for( i = 0; i < num_verts; ++i )
CPPUNIT_ASSERT( side[i] == i );
}
| void TopologyInfoTest::pyramid13 | ( | ) |
Definition at line 977 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::PYRAMID.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 13;
TopologyInfo::higher_order( PYRAMID, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( PYRAMID, num_nodes, 5, 8, 5 );
}
| void TopologyInfoTest::pyramid5 | ( | ) |
Definition at line 962 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::PYRAMID.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 5;
TopologyInfo::higher_order( PYRAMID, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( PYRAMID, num_nodes, 5, 8, 5 );
}
| void TopologyInfoTest::quad | ( | ) |
Definition at line 434 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::QUADRILATERAL.
{
MsqPrintError err( cout );
CPPUNIT_ASSERT( 2 == TopologyInfo::dimension( QUADRILATERAL ) );
CPPUNIT_ASSERT( 4 == TopologyInfo::adjacent( QUADRILATERAL, 1 ) );
CPPUNIT_ASSERT( 4 == TopologyInfo::adjacent( QUADRILATERAL, 0 ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( QUADRILATERAL, 2 ) );
CPPUNIT_ASSERT( 0 == TopologyInfo::adjacent( QUADRILATERAL, 3 ) );
CPPUNIT_ASSERT( 4 == TopologyInfo::sides( QUADRILATERAL ) );
CPPUNIT_ASSERT( 4 == TopologyInfo::corners( QUADRILATERAL ) );
CPPUNIT_ASSERT( 4 == TopologyInfo::edges( QUADRILATERAL ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::faces( QUADRILATERAL ) );
const unsigned num_edges = 4;
const unsigned* side;
const unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 3, 0 } };
unsigned count;
const unsigned face[] = { 0, 1, 2, 3 };
for( unsigned i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( QUADRILATERAL, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( QUADRILATERAL, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
side = TopologyInfo::side_vertices( QUADRILATERAL, 2, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 4 == count );
CPPUNIT_ASSERT( compare_face( 4, side, face ) );
}
| void TopologyInfoTest::quad4 | ( | ) |
Definition at line 473 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::QUADRILATERAL.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 4;
TopologyInfo::higher_order( QUADRILATERAL, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_face_elem( QUADRILATERAL, num_nodes, 4 );
}
| void TopologyInfoTest::quad5 | ( | ) |
Definition at line 488 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::QUADRILATERAL.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 5;
TopologyInfo::higher_order( QUADRILATERAL, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_face_elem( QUADRILATERAL, num_nodes, 4 );
}
| void TopologyInfoTest::quad8 | ( | ) |
Definition at line 503 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::QUADRILATERAL.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 8;
TopologyInfo::higher_order( QUADRILATERAL, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_face_elem( QUADRILATERAL, num_nodes, 4 );
}
| void TopologyInfoTest::quad9 | ( | ) |
Definition at line 518 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::QUADRILATERAL.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 9;
TopologyInfo::higher_order( QUADRILATERAL, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_face_elem( QUADRILATERAL, num_nodes, 4 );
}
| void TopologyInfoTest::quad_adj_vert | ( | ) |
Definition at line 1166 of file TopologyInfoTest.cpp.
References MBMesquite::QUADRILATERAL.
{
unsigned data[][5] = { { 2, 1, 3, 0, 0 }, { 2, 2, 0, 0, 0 }, { 2, 3, 1, 0, 0 }, { 2, 0, 2, 0, 0 } };
test_adj( MBMesquite::QUADRILATERAL, data );
}
| void TopologyInfoTest::quad_rev_adj_vert | ( | ) | [inline] |
Definition at line 191 of file TopologyInfoTest.cpp.
References MBMesquite::QUADRILATERAL.
| void TopologyInfoTest::setUp | ( | ) | [inline] |
Definition at line 112 of file TopologyInfoTest.cpp.
{}
Definition at line 1353 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, CPPUNIT_ASSERT_EQUAL, dim, HEX14, HEX15, HEX20, HEX26, HEX27, HEX9, and MBMesquite::HEXAHEDRON.
{
MsqPrintError err( std::cerr );
unsigned dim, num;
// HEX-27
for( unsigned i = 0; i < 19; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 27, HEX27[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX27[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX27[i].num, num );
}
// HEX-26
for( unsigned i = 0; i < 18; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 26, HEX26[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX26[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX26[i].num, num );
}
// HEX-20
for( unsigned i = 0; i < 12; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 20, HEX20[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX20[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX20[i].num, num );
}
// HEX-15
for( unsigned i = 0; i < 7; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 15, HEX15[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX15[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX15[i].num, num );
}
// HEX-14
for( unsigned i = 0; i < 6; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 14, HEX14[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX14[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX14[i].num, num );
}
// HEX-9
for( unsigned i = 0; i < 1; ++i )
{
TopologyInfo::side_from_higher_order( HEXAHEDRON, 9, HEX9[i].idx, dim, num, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT_EQUAL( HEX9[i].dim, dim );
CPPUNIT_ASSERT_EQUAL( HEX9[i].num, num );
}
}
| void TopologyInfoTest::tearDown | ( | ) | [inline] |
Definition at line 114 of file TopologyInfoTest.cpp.
{}
| void TopologyInfoTest::test_adj | ( | MBMesquite::EntityTopology | type, |
| const unsigned | expected[][5] | ||
| ) |
Definition at line 1199 of file TopologyInfoTest.cpp.
References corners, CPPUNIT_ASSERT, and n.
{
// Get num vertices from type
unsigned n = TopologyInfo::corners( type );
CPPUNIT_ASSERT( n > 0 );
// The first index into data is the vertex.
// Each column of "data", indexed by vertex, is a
// vector containing the number of adjacent vertices
// followed by the list if adjacent vertex indices.
// for each vertex
for( unsigned i = 0; i < n; ++i )
{
// Get the data corresponding to this vertex of the element
unsigned const* corner = data[i];
unsigned expected_count = corner[0];
// Query TopologyInfo for the same data
unsigned actual_count;
unsigned const* actual_adj = TopologyInfo::adjacent_vertices( type, i, actual_count );
// Check result is valid and counts match
CPPUNIT_ASSERT( actual_adj != NULL );
CPPUNIT_ASSERT( expected_count == actual_count );
// For 3-D elements, returned vertices are expected to be oriented
// such that a face bounded by the vertices in the counter-clockwise
// order will have a normal pointing away from the input vertex.
// So the vertices must be in a certain order, but may begin with
// any of the adjacent vertices.
// Find the location in the result list at which the first
// vertex in the expected list occurs.
unsigned j;
for( j = 0; j < actual_count; ++j )
if( corner[1] == actual_adj[j] ) break;
// Asssert that the first expected vertex was somewhere in
// the result list.
CPPUNIT_ASSERT( j < actual_count );
// Compare the remaining vertices, enforcing the order.
for( unsigned k = 1; k < actual_count; ++k )
CPPUNIT_ASSERT( corner[k + 1] == actual_adj[( k + j ) % actual_count] );
}
}
| void TopologyInfoTest::test_face_elem | ( | EntityTopology | topo, |
| unsigned | num_nodes, | ||
| unsigned | num_sides | ||
| ) |
Definition at line 250 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, dim, and moab::side_number().
{
MsqPrintError err( cout );
bool edge, face, vol;
unsigned index = 0;
TopologyInfo::higher_order( topo, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !vol );
unsigned nodes = num_sides + edge * num_sides + face;
CPPUNIT_ASSERT( num_nodes == nodes );
unsigned side, dim;
for( index = 0; index < num_sides; ++index )
{
TopologyInfo::side_number( topo, num_nodes, index, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 0 && side == index );
}
if( edge )
{
for( unsigned s = 0; s < num_sides; ++s )
{
TopologyInfo::side_number( topo, num_nodes, index++, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 1 && side == s );
}
}
if( face )
{
TopologyInfo::side_number( topo, num_nodes, index++, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 2 && side == 0 );
}
}
| void TopologyInfoTest::test_poly | ( | EntityTopology | topo | ) |
Definition at line 1098 of file TopologyInfoTest.cpp.
References corners, CPPUNIT_ASSERT, edges, and MBMesquite::faces.
{
CPPUNIT_ASSERT( TopologyInfo::adjacent( topo, 1 ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::sides( topo ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::corners( topo ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::edges( topo ) == 0 );
CPPUNIT_ASSERT( TopologyInfo::faces( topo ) == 0 );
}
| void TopologyInfoTest::test_rev_adj | ( | MBMesquite::EntityTopology | type | ) |
Definition at line 1243 of file TopologyInfoTest.cpp.
References corners, CPPUNIT_ASSERT, and n.
{
// Get num vertices from type
unsigned n = TopologyInfo::corners( type );
CPPUNIT_ASSERT( n > 0 );
// for each vertex
for( unsigned i = 0; i < n; ++i )
{
// get adjacent vertex list
unsigned num_adj_idx;
unsigned const* adj_idx = TopologyInfo::adjacent_vertices( type, i, num_adj_idx );
CPPUNIT_ASSERT( adj_idx != NULL );
CPPUNIT_ASSERT( num_adj_idx > 1 );
// make sure adjacent vertex list is unique
std::vector< unsigned > adj_idx_copy( num_adj_idx );
std::copy( adj_idx, adj_idx + num_adj_idx, adj_idx_copy.begin() );
std::sort( adj_idx_copy.begin(), adj_idx_copy.end() );
std::vector< unsigned >::iterator iter;
iter = std::unique( adj_idx_copy.begin(), adj_idx_copy.end() );
CPPUNIT_ASSERT( iter == adj_idx_copy.end() );
// Get reverse mapping indices
unsigned num_rev_idx;
unsigned const* rev_idx = TopologyInfo::reverse_vertex_adjacency_offsets( type, i, num_rev_idx );
CPPUNIT_ASSERT( rev_idx != NULL );
CPPUNIT_ASSERT( num_rev_idx == num_adj_idx );
// for each adjacent vertex, test reverse mapping
for( unsigned j = 0; j < num_adj_idx; ++j )
{
unsigned num_adj_adj_idx;
unsigned const* adj_adj_idx = TopologyInfo::adjacent_vertices( type, adj_idx[j], num_adj_adj_idx );
CPPUNIT_ASSERT( rev_idx[j] < num_adj_adj_idx );
CPPUNIT_ASSERT( adj_adj_idx[rev_idx[j]] == i );
}
}
}
| void TopologyInfoTest::test_vol_elem | ( | EntityTopology | topo, |
| unsigned | num_nodes, | ||
| unsigned | num_verts, | ||
| unsigned | num_edges, | ||
| unsigned | num_faces | ||
| ) |
Definition at line 287 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, dim, and moab::side_number().
{
MsqPrintError err( cout );
bool edge, face, vol;
unsigned index = 0;
TopologyInfo::higher_order( topo, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
unsigned nodes = num_verts + edge * num_edges + face * num_faces + vol;
CPPUNIT_ASSERT( num_nodes == nodes );
unsigned side, dim;
for( index = 0; index < num_verts; ++index )
{
TopologyInfo::side_number( topo, num_nodes, index, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 0 && side == index );
}
if( edge )
{
for( unsigned s = 0; s < num_edges; ++s )
{
TopologyInfo::side_number( topo, num_nodes, index++, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 1 && side == s );
}
}
if( face )
{
for( unsigned s = 0; s < num_faces; ++s )
{
TopologyInfo::side_number( topo, num_nodes, index++, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 2 && side == s );
}
}
if( vol )
{
TopologyInfo::side_number( topo, num_nodes, index++, dim, side, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( dim == 3 && side == 0 );
}
}
| void TopologyInfoTest::tet | ( | ) |
Definition at line 533 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
const unsigned num_verts = 4;
const unsigned num_edges = 6;
const unsigned num_faces = 4;
CPPUNIT_ASSERT( 3 == TopologyInfo::dimension( TETRAHEDRON ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( TETRAHEDRON, 3 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::adjacent( TETRAHEDRON, 2 ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::adjacent( TETRAHEDRON, 1 ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::adjacent( TETRAHEDRON, 0 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::sides( TETRAHEDRON ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::corners( TETRAHEDRON ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::edges( TETRAHEDRON ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::faces( TETRAHEDRON ) );
const unsigned* side;
unsigned i, count;
const unsigned vert_per_face = 3;
unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 }, { 0, 3 }, { 1, 3 }, { 2, 3 } };
unsigned faces[num_faces][vert_per_face] = { { 0, 1, 3 }, { 1, 2, 3 }, { 2, 0, 3 }, { 2, 1, 0 } };
for( i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( TETRAHEDRON, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( TETRAHEDRON, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
for( i = 0; i < num_faces; ++i )
{
side = TopologyInfo::face_vertices( TETRAHEDRON, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == vert_per_face );
CPPUNIT_ASSERT( compare_face( vert_per_face, side, faces[i] ) );
side = TopologyInfo::side_vertices( TETRAHEDRON, 2, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == vert_per_face );
CPPUNIT_ASSERT( compare_face( vert_per_face, side, faces[i] ) );
}
side = TopologyInfo::side_vertices( TETRAHEDRON, 3, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == num_verts );
for( i = 0; i < num_verts; ++i )
CPPUNIT_ASSERT( side[i] == i );
}
| void TopologyInfoTest::tet10 | ( | ) |
Definition at line 649 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 10;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet11 | ( | ) |
Definition at line 664 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 11;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet14 | ( | ) |
Definition at line 679 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 14;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet15 | ( | ) |
Definition at line 694 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 15;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet4 | ( | ) |
Definition at line 589 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 4;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet5 | ( | ) |
Definition at line 604 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 5;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet8 | ( | ) |
Definition at line 619 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 8;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet9 | ( | ) |
Definition at line 634 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TETRAHEDRON.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 9;
TopologyInfo::higher_order( TETRAHEDRON, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( vol );
test_vol_elem( TETRAHEDRON, num_nodes, 4, 6, 4 );
}
| void TopologyInfoTest::tet_adj_vert | ( | ) |
Definition at line 1172 of file TopologyInfoTest.cpp.
References MBMesquite::TETRAHEDRON.
{
unsigned data[][5] = { { 3, 1, 2, 3, 0 }, { 3, 2, 0, 3, 0 }, { 3, 0, 1, 3, 0 }, { 3, 2, 1, 0, 0 } };
test_adj( MBMesquite::TETRAHEDRON, data );
}
| void TopologyInfoTest::tet_rev_adj_vert | ( | ) | [inline] |
Definition at line 195 of file TopologyInfoTest.cpp.
References MBMesquite::TETRAHEDRON.
{
test_rev_adj( MBMesquite::TETRAHEDRON );
}
| void TopologyInfoTest::tri | ( | ) |
Definition at line 336 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::TRIANGLE.
{
MsqPrintError err( cout );
CPPUNIT_ASSERT( 2 == TopologyInfo::dimension( TRIANGLE ) );
CPPUNIT_ASSERT( 3 == TopologyInfo::adjacent( TRIANGLE, 1 ) );
CPPUNIT_ASSERT( 3 == TopologyInfo::adjacent( TRIANGLE, 0 ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( TRIANGLE, 2 ) );
CPPUNIT_ASSERT( 0 == TopologyInfo::adjacent( TRIANGLE, 3 ) );
CPPUNIT_ASSERT( 3 == TopologyInfo::sides( TRIANGLE ) );
CPPUNIT_ASSERT( 3 == TopologyInfo::corners( TRIANGLE ) );
CPPUNIT_ASSERT( 3 == TopologyInfo::edges( TRIANGLE ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::faces( TRIANGLE ) );
const unsigned num_edges = 3;
const unsigned* side;
const unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 } };
unsigned count;
const unsigned face[] = { 0, 1, 2 };
for( unsigned i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( TRIANGLE, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( TRIANGLE, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
side = TopologyInfo::side_vertices( TRIANGLE, 2, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 3 == count );
CPPUNIT_ASSERT( compare_face( 3, side, face ) );
}
| void TopologyInfoTest::tri3 | ( | ) |
Definition at line 375 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TRIANGLE.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 3;
TopologyInfo::higher_order( TRIANGLE, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
test_face_elem( TRIANGLE, num_nodes, 3 );
}
| void TopologyInfoTest::tri4 | ( | ) |
Definition at line 389 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TRIANGLE.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 4;
TopologyInfo::higher_order( TRIANGLE, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_face_elem( TRIANGLE, num_nodes, 3 );
}
| void TopologyInfoTest::tri6 | ( | ) |
Definition at line 404 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TRIANGLE.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 6;
TopologyInfo::higher_order( TRIANGLE, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_face_elem( TRIANGLE, num_nodes, 3 );
}
| void TopologyInfoTest::tri7 | ( | ) |
Definition at line 419 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::TRIANGLE.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 7;
TopologyInfo::higher_order( TRIANGLE, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( face );
CPPUNIT_ASSERT( !vol );
test_face_elem( TRIANGLE, num_nodes, 3 );
}
| void TopologyInfoTest::tri_adj_vert | ( | ) |
Definition at line 1160 of file TopologyInfoTest.cpp.
References MBMesquite::TRIANGLE.
{
unsigned data[][5] = { { 2, 1, 2, 0, 0 }, { 2, 2, 0, 0, 0 }, { 2, 0, 1, 0, 0 } };
test_adj( MBMesquite::TRIANGLE, data );
}
| void TopologyInfoTest::tri_rev_adj_vert | ( | ) | [inline] |
Definition at line 187 of file TopologyInfoTest.cpp.
References MBMesquite::TRIANGLE.
{
test_rev_adj( MBMesquite::TRIANGLE );
}
| void TopologyInfoTest::wdg_adj_vert | ( | ) |
Definition at line 1192 of file TopologyInfoTest.cpp.
References MBMesquite::PRISM.
{
unsigned data[][5] = { { 3, 1, 2, 3, 0 }, { 3, 2, 0, 4, 0 }, { 3, 0, 1, 5, 0 },
{ 3, 5, 4, 0, 0 }, { 3, 3, 5, 1, 0 }, { 3, 4, 3, 2, 0 } };
test_adj( MBMesquite::PRISM, data );
}
| void TopologyInfoTest::wdg_rev_adj_vert | ( | ) | [inline] |
Definition at line 207 of file TopologyInfoTest.cpp.
References MBMesquite::PRISM.
{
test_rev_adj( MBMesquite::PRISM );
}
| void TopologyInfoTest::wedge | ( | ) |
Definition at line 992 of file TopologyInfoTest.cpp.
References compare_edge(), corners, CPPUNIT_ASSERT, MBMesquite::edges, edges, MBMesquite::faces, and MBMesquite::PRISM.
{
MsqPrintError err( cout );
const unsigned num_verts = 6;
const unsigned num_edges = 9;
const unsigned num_faces = 5;
CPPUNIT_ASSERT( 3 == TopologyInfo::dimension( PRISM ) );
CPPUNIT_ASSERT( 1 == TopologyInfo::adjacent( PRISM, 3 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::adjacent( PRISM, 2 ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::adjacent( PRISM, 1 ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::adjacent( PRISM, 0 ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::sides( PRISM ) );
CPPUNIT_ASSERT( num_verts == TopologyInfo::corners( PRISM ) );
CPPUNIT_ASSERT( num_edges == TopologyInfo::edges( PRISM ) );
CPPUNIT_ASSERT( num_faces == TopologyInfo::faces( PRISM ) );
const unsigned* side;
unsigned i, count;
const unsigned num_tri_faces = 2;
const unsigned num_quad_faces = 3;
const bool tri_before_quad = false;
CPPUNIT_ASSERT( num_tri_faces + num_quad_faces == num_faces );
unsigned edges[num_edges][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 }, { 0, 3 }, { 1, 4 },
{ 2, 5 }, { 3, 4 }, { 4, 5 }, { 5, 3 } };
unsigned tris[num_tri_faces][3] = { { 2, 1, 0 }, { 3, 4, 5 } };
unsigned quads[num_quad_faces][4] = { { 0, 1, 4, 3 }, { 1, 2, 5, 4 }, { 2, 0, 3, 5 } };
for( i = 0; i < num_edges; ++i )
{
side = TopologyInfo::edge_vertices( PRISM, i, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
side = TopologyInfo::side_vertices( PRISM, 1, i, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( 2 == count );
CPPUNIT_ASSERT( compare_edge( side, edges[i] ) );
}
const unsigned tri_off = num_quad_faces * !tri_before_quad;
for( i = 0; i < num_tri_faces; ++i )
{
side = TopologyInfo::face_vertices( PRISM, i + tri_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 3 );
CPPUNIT_ASSERT( compare_face( 3, side, tris[i] ) );
side = TopologyInfo::side_vertices( PRISM, 2, i + tri_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 3 );
CPPUNIT_ASSERT( compare_face( 3, side, tris[i] ) );
}
const unsigned quad_off = num_tri_faces * tri_before_quad;
for( i = 0; i < num_quad_faces; ++i )
{
side = TopologyInfo::face_vertices( PRISM, i + quad_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 4 );
CPPUNIT_ASSERT( compare_face( 4, side, quads[i] ) );
side = TopologyInfo::side_vertices( PRISM, 2, i + quad_off, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == 4 );
CPPUNIT_ASSERT( compare_face( 4, side, quads[i] ) );
}
side = TopologyInfo::side_vertices( PRISM, 3, 0, count, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( count == num_verts );
for( i = 0; i < num_verts; ++i )
CPPUNIT_ASSERT( side[i] == i );
}
| void TopologyInfoTest::wedge15 | ( | ) |
Definition at line 1083 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::PRISM.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 15;
TopologyInfo::higher_order( PRISM, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( PRISM, num_nodes, 6, 9, 5 );
}
| void TopologyInfoTest::wedge6 | ( | ) |
Definition at line 1068 of file TopologyInfoTest.cpp.
References CPPUNIT_ASSERT, and MBMesquite::PRISM.
{
MsqPrintError err( cout );
bool edge, face, vol;
const int num_nodes = 6;
TopologyInfo::higher_order( PRISM, num_nodes, edge, face, vol, err );
CPPUNIT_ASSERT( !err );
CPPUNIT_ASSERT( !edge );
CPPUNIT_ASSERT( !face );
CPPUNIT_ASSERT( !vol );
test_vol_elem( PRISM, num_nodes, 6, 9, 5 );
}
1.7.6.1