|
MOAB: Mesh Oriented datABase
(version 5.4.1)
|
|
MOAB: Mesh Oriented datABase
(version 5.4.1)
|
Include dependency graph for mbcn_test.cpp:Go to the source code of this file.
| static void do_test_side_number_1d | ( | EntityType | type, |
| int | idx | ||
| ) | [static] |
Definition at line 544 of file mbcn_test.cpp.
References CHECK, CHECK_EQUAL, moab::CN::SideNumber(), and moab::CN::SubEntityVertexIndices().
Referenced by test_side_number_hex(), test_side_number_pri(), test_side_number_pyr(), test_side_number_quad(), test_side_number_tet(), and test_side_number_tri().
{
// define a random handle list
const int elem_verts[] = { 7400, 6233, 3027, 0454, 6839, 5391, 7735, 3603 };
// get side indices
int side_idx[4] = { 0, 0 };
CN::SubEntityVertexIndices( type, 1, idx, side_idx );
// "reversed" and "offset" are the same thing for edges.
int side_conn[2] = { elem_verts[side_idx[0]], elem_verts[side_idx[1]] };
int rev_conn[2] = { elem_verts[side_idx[1]], elem_verts[side_idx[0]] };
int result_side = -100, result_sense = -100, result_offset = -100;
int err = CN::SideNumber( type, elem_verts, side_conn, 2, 1, result_side, result_sense, result_offset );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( idx, result_side );
CHECK_EQUAL( 1, result_sense );
CHECK_EQUAL( 0, result_offset );
err = CN::SideNumber( type, elem_verts, rev_conn, 2, 1, result_side, result_sense, result_offset );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( idx, result_side );
CHECK( result_offset == 1 || result_sense == -1 );
}
| static void do_test_side_number_2d | ( | EntityType | type, |
| int | idx | ||
| ) | [static] |
Definition at line 567 of file mbcn_test.cpp.
References CHECK_EQUAL, moab::CN::SideNumber(), moab::CN::SubEntityType(), moab::CN::SubEntityVertexIndices(), and moab::CN::VerticesPerEntity().
Referenced by test_side_number_hex(), test_side_number_pri(), test_side_number_pyr(), and test_side_number_tet().
{
// define a random handle list
const int elem_verts[] = { 7400, 6233, 3027, 0454, 6839, 5391, 7735, 3603 };
// get side indices
const int side_size = CN::VerticesPerEntity( CN::SubEntityType( type, 2, idx ) );
int side_idx[4] = { 0, 0, 0, 0 };
CN::SubEntityVertexIndices( type, 2, idx, side_idx );
// for each possible forward or reverse offset
for( int rev = -1; rev < 2; rev += 2 )
{
for( int off = 0; off < side_size; ++off )
{
int side_conn[4];
side_conn[3] = 0;
for( int i = 0; i < side_size; ++i )
side_conn[( side_size + rev * i ) % side_size] = elem_verts[side_idx[( i + off ) % side_size]];
int result_side = -100, result_sense = -100, result_offset = -100;
int err =
CN::SideNumber( type, elem_verts, side_conn, side_size, 2, result_side, result_sense, result_offset );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( idx, result_side );
CHECK_EQUAL( rev, result_sense );
CHECK_EQUAL( off, result_offset );
}
}
}
| void do_test_sub_entity_type_2d | ( | EntityType | type | ) |
Definition at line 299 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBVERTEX, moab::CN::SubEntityType(), and moab::CN::VerticesPerEntity().
Referenced by test_sub_entity_type_quad(), and test_sub_entity_type_tri().
{
for( int j = 0; j < CN::VerticesPerEntity( type ); ++j )
{
CHECK_EQUAL( MBVERTEX, CN::SubEntityType( type, 0, j ) );
CHECK_EQUAL( MBEDGE, CN::SubEntityType( type, 1, j ) );
}
CHECK_EQUAL( type, CN::SubEntityType( type, 2, 0 ) );
}
| void do_test_sub_entity_type_3d | ( | EntityType | type, |
| int | num_faces, | ||
| const EntityType * | face_types | ||
| ) |
Definition at line 309 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBVERTEX, moab::CN::NumSubEntities(), moab::CN::SubEntityType(), and moab::CN::VerticesPerEntity().
Referenced by test_sub_entity_type_hex(), test_sub_entity_type_knife(), test_sub_entity_type_pri(), test_sub_entity_type_pyr(), and test_sub_entity_type_tet().
{
for( int j = 0; j < CN::VerticesPerEntity( type ); ++j )
{
CHECK_EQUAL( MBVERTEX, CN::SubEntityType( type, 0, j ) );
}
for( int j = 0; j < CN::NumSubEntities( type, 1 ); ++j )
{
CHECK_EQUAL( MBEDGE, CN::SubEntityType( type, 1, j ) );
}
for( int j = 0; j < num_faces; ++j )
{
EntityType sub_type = CN::SubEntityType( type, 2, j );
CHECK_EQUAL( face_types[j], sub_type );
}
CHECK_EQUAL( type, CN::SubEntityType( type, 3, 0 ) );
}
| int main | ( | ) |
Definition at line 133 of file mbcn_test.cpp.
References prism_issue(), RUN_TEST, test_dimension(), test_dimension_pair(), test_has_mid_nodes_edge(), test_has_mid_nodes_hex(), test_has_mid_nodes_knife(), test_has_mid_nodes_pri(), test_has_mid_nodes_pyr(), test_has_mid_nodes_quad(), test_has_mid_nodes_tet(), test_has_mid_nodes_tri(), test_ho_node_index(), test_ho_node_parent(), test_num_sub_entities(), test_opposite_side_hex(), test_opposite_side_quad(), test_opposite_side_tet(), test_opposite_side_tri(), test_side_number_hex(), test_side_number_pri(), test_side_number_pyr(), test_side_number_quad(), test_side_number_tet(), test_side_number_tri(), test_sub_entity_indices_edge(), test_sub_entity_indices_hex(), test_sub_entity_indices_pri(), test_sub_entity_indices_pyr(), test_sub_entity_indices_quad(), test_sub_entity_indices_tet(), test_sub_entity_indices_tri(), test_sub_entity_indices_vtx(), test_sub_entity_nodes_hex_edges(), test_sub_entity_nodes_hex_faces(), test_sub_entity_nodes_kni_edges(), test_sub_entity_nodes_kni_faces(), test_sub_entity_nodes_pri_edges(), test_sub_entity_nodes_pri_faces(), test_sub_entity_nodes_pyr_edges(), test_sub_entity_nodes_pyr_faces(), test_sub_entity_nodes_quad_edges(), test_sub_entity_nodes_tet_edges(), test_sub_entity_nodes_tet_faces(), test_sub_entity_nodes_tri_edges(), test_sub_entity_type_edge(), test_sub_entity_type_hex(), test_sub_entity_type_knife(), test_sub_entity_type_pri(), test_sub_entity_type_pyr(), test_sub_entity_type_quad(), test_sub_entity_type_tet(), test_sub_entity_type_tri(), test_sub_entity_type_vtx(), test_type_names(), test_vertices_per_entity(), and test_wedges().
{
int result = 0;
result += RUN_TEST( test_dimension_pair );
result += RUN_TEST( test_type_names );
result += RUN_TEST( test_dimension );
result += RUN_TEST( test_vertices_per_entity );
result += RUN_TEST( test_num_sub_entities );
result += RUN_TEST( test_sub_entity_type_vtx );
result += RUN_TEST( test_sub_entity_type_edge );
result += RUN_TEST( test_sub_entity_type_tri );
result += RUN_TEST( test_sub_entity_type_quad );
result += RUN_TEST( test_sub_entity_type_tet );
result += RUN_TEST( test_sub_entity_type_pyr );
result += RUN_TEST( test_sub_entity_type_pri );
result += RUN_TEST( test_sub_entity_type_knife );
result += RUN_TEST( test_sub_entity_type_hex );
result += RUN_TEST( test_sub_entity_indices_vtx );
result += RUN_TEST( test_sub_entity_indices_edge );
result += RUN_TEST( test_sub_entity_indices_tri );
result += RUN_TEST( test_sub_entity_indices_quad );
result += RUN_TEST( test_sub_entity_indices_tet );
result += RUN_TEST( test_sub_entity_indices_pyr );
result += RUN_TEST( test_sub_entity_indices_pri );
result += RUN_TEST( test_sub_entity_indices_hex );
result += RUN_TEST( test_side_number_tri );
result += RUN_TEST( test_side_number_quad );
result += RUN_TEST( test_side_number_tet );
result += RUN_TEST( test_side_number_pyr );
result += RUN_TEST( test_side_number_pri );
result += RUN_TEST( test_side_number_hex );
result += RUN_TEST( test_opposite_side_tri );
result += RUN_TEST( test_opposite_side_quad );
result += RUN_TEST( test_opposite_side_tet );
result += RUN_TEST( test_opposite_side_hex );
result += RUN_TEST( test_has_mid_nodes_edge );
result += RUN_TEST( test_has_mid_nodes_tri );
result += RUN_TEST( test_has_mid_nodes_quad );
result += RUN_TEST( test_has_mid_nodes_tet );
result += RUN_TEST( test_has_mid_nodes_pyr );
result += RUN_TEST( test_has_mid_nodes_pri );
result += RUN_TEST( test_has_mid_nodes_knife );
result += RUN_TEST( test_has_mid_nodes_hex );
result += RUN_TEST( test_sub_entity_nodes_tri_edges );
result += RUN_TEST( test_sub_entity_nodes_quad_edges );
result += RUN_TEST( test_sub_entity_nodes_tet_edges );
result += RUN_TEST( test_sub_entity_nodes_tet_faces );
result += RUN_TEST( test_sub_entity_nodes_pyr_edges );
result += RUN_TEST( test_sub_entity_nodes_pyr_faces );
result += RUN_TEST( test_sub_entity_nodes_pri_edges );
result += RUN_TEST( test_sub_entity_nodes_pri_faces );
result += RUN_TEST( test_sub_entity_nodes_kni_edges );
result += RUN_TEST( test_sub_entity_nodes_kni_faces );
result += RUN_TEST( test_sub_entity_nodes_hex_edges );
result += RUN_TEST( test_sub_entity_nodes_hex_faces );
result += RUN_TEST( test_ho_node_parent );
result += RUN_TEST( test_ho_node_index );
result += RUN_TEST( prism_issue );
result += RUN_TEST( test_wedges );
return result;
}
| void prism_issue | ( | ) |
Definition at line 1166 of file mbcn_test.cpp.
References CHECK, moab::Core::create_element(), moab::Core::create_vertex(), moab::Core::get_adjacencies(), moab::Core::get_connectivity(), moab::Core::get_entities_by_dimension(), mb, and MBPRISM.
Referenced by main().
{
moab::Core mb;
std::vector< moab::EntityHandle > conn;
double coords[3];
for( int i = 0; i < 15; ++i )
{
moab::EntityHandle h;
mb.create_vertex( coords, h );
conn.push_back( h );
}
moab::EntityHandle w;
mb.create_element( moab::MBPRISM, conn.data(), 15, w );
// this leads to the failure
{
std::vector< moab::EntityHandle > adj;
mb.get_adjacencies( &w, 1, 2, true, adj );
}
std::vector< moab::EntityHandle > edges;
std::vector< moab::EntityHandle > faces;
mb.get_entities_by_dimension( 0, 1, edges );
for( const auto& e : edges )
{
std::vector< moab::EntityHandle > conn;
std::cout << "edge " << e << " connectivity: ";
mb.get_connectivity( &e, 1, conn );
for( const auto& n : conn )
std::cout << n << " ";
std::cout << "\n";
}
mb.get_entities_by_dimension( 0, 2, faces );
for( const auto& f : faces )
{
std::vector< moab::EntityHandle > conn;
std::cout << "face " << f << " connectivity: ";
mb.get_connectivity( &f, 1, conn );
for( const auto& n : conn )
std::cout << n << " ";
std::cout << "\n";
}
std::vector< moab::EntityHandle > nodes;
mb.get_entities_by_dimension( 0, 0, nodes );
for( const auto& n : nodes )
{
std::vector< moab::EntityHandle > adj;
std::cout << "node " << n << " connection: ";
adj.clear();
mb.get_adjacencies( &n, 1, 1, true, adj );
std::cout << adj.size() << " edges,";
// there are either 1 or 3 adjacent edges to each vertex (1 for mid edge vertex)
CHECK( 1 == adj.size() || 3 == adj.size() );
adj.clear();
mb.get_adjacencies( &n, 1, 2, true, adj );
std::cout << adj.size() << " faces,";
// there are either 2 or 3 adjacent faces to each vertex ( 2 for mid edge evertex)
CHECK( 2 == adj.size() || 3 == adj.size() );
adj.clear();
mb.get_adjacencies( &n, 1, 3, true, adj );
std::cout << adj.size() << " volumes\n";
}
}
| void test_0d_sub_entity_indices | ( | EntityType | type, |
| int | num_vtx | ||
| ) |
Definition at line 382 of file mbcn_test.cpp.
References CHECK_EQUAL, and moab::CN::SubEntityVertexIndices().
Referenced by test_sub_entity_indices_edge(), test_sub_entity_indices_hex(), test_sub_entity_indices_pri(), test_sub_entity_indices_pyr(), test_sub_entity_indices_quad(), test_sub_entity_indices_tet(), and test_sub_entity_indices_tri().
{
for( int i = 0; i < num_vtx; ++i )
{
// zero input array
int indices[2] = { 0, -100 };
// check correct results
CN::SubEntityVertexIndices( type, 0, i, indices );
CHECK_EQUAL( i, indices[0] );
// check didn't write past end of array
CHECK_EQUAL( -100, indices[1] );
}
}
| void test_1d_sub_entity_indices | ( | EntityType | type, |
| int | num_edges, | ||
| const int(*) | edge_indices[2] | ||
| ) |
Definition at line 396 of file mbcn_test.cpp.
References CHECK_EQUAL, and moab::CN::SubEntityVertexIndices().
Referenced by test_sub_entity_indices_hex(), test_sub_entity_indices_pri(), test_sub_entity_indices_pyr(), test_sub_entity_indices_quad(), test_sub_entity_indices_tet(), and test_sub_entity_indices_tri().
{
for( int i = 0; i < num_edges; ++i )
{
// zero input array
int indices[3] = { 0, 0, -99 };
// check correct results
CN::SubEntityVertexIndices( type, 1, i, indices );
if( edge_indices[i][0] == indices[0] )
{
CHECK_EQUAL( edge_indices[i][1], indices[1] );
}
else
{
CHECK_EQUAL( edge_indices[i][0], indices[1] );
CHECK_EQUAL( edge_indices[i][1], indices[0] );
}
// check didn't write past end of array
CHECK_EQUAL( -99, indices[2] );
}
}
| void test_2d_sub_entity_indices | ( | EntityType | type, |
| int | num_faces, | ||
| const int(*) | face_indices[5] | ||
| ) |
Definition at line 418 of file mbcn_test.cpp.
References CHECK, CHECK_EQUAL, and moab::CN::SubEntityVertexIndices().
Referenced by test_sub_entity_indices_hex(), test_sub_entity_indices_pri(), test_sub_entity_indices_pyr(), and test_sub_entity_indices_tet().
{
for( int i = 0; i < num_faces; ++i )
{
// zero input array
int indices[5] = { 0, 0, 0, -99, -99 };
// check correct results
CN::SubEntityVertexIndices( type, 2, i, indices );
const int num_vtx = face_indices[i][0];
if( num_vtx != 3 ) CHECK_EQUAL( 4, num_vtx );
const int* exp_index = face_indices[i] + 1;
int off = std::find( indices, indices + num_vtx, exp_index[0] ) - indices;
CHECK( off < num_vtx );
/* Expect faces to be ordered such that CCW normal is outwards
*
bool reverse = indices[(off+num_vtx-1)%num_vtx] == exp_index[1];
if (reverse) {
CHECK_EQUAL( exp_index[1], indices[(off+num_vtx-1)%num_vtx] );
CHECK_EQUAL( exp_index[2], indices[(off+num_vtx-2)%num_vtx] );
if (num_vtx == 4)
CHECK_EQUAL( exp_index[3], indices[(off+num_vtx-3)%num_vtx] );
}
else {
*/
CHECK_EQUAL( exp_index[1], indices[( off + 1 ) % num_vtx] );
CHECK_EQUAL( exp_index[2], indices[( off + 2 ) % num_vtx] );
if( num_vtx == 4 ) CHECK_EQUAL( exp_index[3], indices[( off + 3 ) % num_vtx] );
/*
}
*/
// check didn't write past end of array
if( num_vtx == 3 ) CHECK_EQUAL( -99, indices[3] );
CHECK_EQUAL( -99, indices[4] );
}
}
| void test_dimension | ( | ) |
Definition at line 235 of file mbcn_test.cpp.
References CHECK_EQUAL, moab::CN::Dimension(), MBEDGE, MBHEX, MBKNIFE, MBPOLYGON, MBPOLYHEDRON, MBPRISM, MBPYRAMID, MBQUAD, MBTET, MBTRI, and MBVERTEX.
Referenced by main().
{
CHECK_EQUAL( 0, CN::Dimension( MBVERTEX ) );
CHECK_EQUAL( 1, CN::Dimension( MBEDGE ) );
CHECK_EQUAL( 2, CN::Dimension( MBTRI ) );
CHECK_EQUAL( 2, CN::Dimension( MBQUAD ) );
CHECK_EQUAL( 2, CN::Dimension( MBPOLYGON ) );
CHECK_EQUAL( 3, CN::Dimension( MBTET ) );
CHECK_EQUAL( 3, CN::Dimension( MBPYRAMID ) );
CHECK_EQUAL( 3, CN::Dimension( MBPRISM ) );
CHECK_EQUAL( 3, CN::Dimension( MBKNIFE ) );
CHECK_EQUAL( 3, CN::Dimension( MBHEX ) );
CHECK_EQUAL( 3, CN::Dimension( MBPOLYHEDRON ) );
}
| void test_dimension_pair | ( | ) |
Definition at line 205 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBPOLYGON, MBPOLYHEDRON, MBTET, MBTRI, MBVERTEX, and moab::CN::TypeDimensionMap.
Referenced by main().
{
DimensionPair dp;
dp = CN::TypeDimensionMap[0];
CHECK_EQUAL( MBVERTEX, dp.first );
CHECK_EQUAL( MBVERTEX, dp.second );
dp = CN::TypeDimensionMap[1];
CHECK_EQUAL( MBEDGE, dp.first );
CHECK_EQUAL( MBEDGE, dp.second );
dp = CN::TypeDimensionMap[2];
CHECK_EQUAL( MBTRI, dp.first );
CHECK_EQUAL( MBPOLYGON, dp.second );
dp = CN::TypeDimensionMap[3];
CHECK_EQUAL( MBTET, dp.first );
CHECK_EQUAL( MBPOLYHEDRON, dp.second );
}
| void test_elem_as_sub_entity | ( | EntityType | type, |
| int | dim, | ||
| int | num_vertices | ||
| ) |
Definition at line 455 of file mbcn_test.cpp.
References CHECK_EQUAL, and moab::CN::SubEntityVertexIndices().
Referenced by test_sub_entity_indices_edge(), test_sub_entity_indices_hex(), test_sub_entity_indices_pri(), test_sub_entity_indices_pyr(), test_sub_entity_indices_quad(), test_sub_entity_indices_tet(), test_sub_entity_indices_tri(), and test_sub_entity_indices_vtx().
{
int indices[9] = { -2, -2, -2, -2, -2, -2, -2, -2, -2 };
CN::SubEntityVertexIndices( type, dim, 0, indices );
for( int i = 0; i < num_vertices; ++i )
CHECK_EQUAL( i, indices[i] );
// make sure didn't write past end
CHECK_EQUAL( -2, indices[num_vertices] );
}
| void test_has_mid_nodes | ( | EntityType | type | ) |
Definition at line 884 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, moab::CN::Dimension(), moab::CN::HasMidEdgeNodes(), moab::CN::HasMidFaceNodes(), moab::CN::HasMidNodes(), moab::CN::HasMidRegionNodes(), moab::CN::NumSubEntities(), and moab::CN::VerticesPerEntity().
Referenced by test_has_mid_nodes_edge(), test_has_mid_nodes_hex(), test_has_mid_nodes_knife(), test_has_mid_nodes_pri(), test_has_mid_nodes_pyr(), test_has_mid_nodes_quad(), test_has_mid_nodes_tet(), and test_has_mid_nodes_tri().
{
const int combinations[][4] = { { 0, 0, 0, 0 }, { 0, 1, 0, 0 }, { 0, 0, 1, 0 }, { 0, 1, 1, 0 },
{ 0, 0, 0, 1 }, { 0, 1, 0, 1 }, { 0, 0, 1, 1 }, { 0, 1, 1, 1 } };
const int dim = CN::Dimension( type );
// calculate number of valid combinations of ho node flags
int num_comb = 1;
for( int i = 0; i < dim; ++i )
num_comb *= 2;
// for each valid combination
for( int c = 0; c < num_comb; ++c )
{
// calculate corresponding number of vertices in element
const int* ho_nodes = combinations[c];
int num_vtx = CN::VerticesPerEntity( type );
switch( dim )
{
case 3:
case 2:
// extra clauses to avoid fall-through error
if( 3 == dim && ho_nodes[2] ) num_vtx += CN::NumSubEntities( type, 2 );
if( 2 <= dim && ho_nodes[1] ) num_vtx += CN::NumSubEntities( type, 1 );
}
if( ho_nodes[dim] ) ++num_vtx;
CHECK_EQUAL( ho_nodes[1], (int)CN::HasMidEdgeNodes( type, num_vtx ) );
CHECK_EQUAL( ho_nodes[2], (int)CN::HasMidFaceNodes( type, num_vtx ) );
CHECK_EQUAL( ho_nodes[3], (int)CN::HasMidRegionNodes( type, num_vtx ) );
int results[4] = { 0, -1, -1, -1 };
CN::HasMidNodes( type, num_vtx, results );
CHECK_EQUAL( 0, !!results[0] );
CHECK_EQUAL( ho_nodes[1], !!results[1] );
CHECK_EQUAL( ho_nodes[2], !!results[2] );
CHECK_EQUAL( ho_nodes[3], !!results[3] );
}
}
| void test_has_mid_nodes_edge | ( | ) |
Definition at line 44 of file mbcn_test.cpp.
References MBEDGE, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBEDGE );
}
| void test_has_mid_nodes_hex | ( | ) |
Definition at line 72 of file mbcn_test.cpp.
References MBHEX, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBHEX );
}
| void test_has_mid_nodes_knife | ( | ) |
Definition at line 68 of file mbcn_test.cpp.
References MBKNIFE, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBKNIFE );
}
| void test_has_mid_nodes_pri | ( | ) |
Definition at line 64 of file mbcn_test.cpp.
References MBPRISM, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBPRISM );
}
| void test_has_mid_nodes_pyr | ( | ) |
Definition at line 60 of file mbcn_test.cpp.
References MBPYRAMID, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBPYRAMID );
}
| void test_has_mid_nodes_quad | ( | ) |
Definition at line 52 of file mbcn_test.cpp.
References MBQUAD, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBQUAD );
}
| void test_has_mid_nodes_tet | ( | ) |
Definition at line 56 of file mbcn_test.cpp.
References MBTET, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBTET );
}
| void test_has_mid_nodes_tri | ( | ) |
Definition at line 48 of file mbcn_test.cpp.
References MBTRI, and test_has_mid_nodes().
Referenced by main().
{
test_has_mid_nodes( MBTRI );
}
| void test_ho_node_index | ( | ) |
Definition at line 991 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, moab::CN::Dimension(), elem_types, moab::CN::HONodeIndex(), MBMAXTYPE, moab::CN::NumSubEntities(), t, and moab::CN::VerticesPerEntity().
Referenced by main().
{
const int combinations[][4] = { { 0, 0, 0, 0 }, { 0, 1, 0, 0 }, { 0, 0, 1, 0 }, { 0, 1, 1, 0 },
{ 0, 0, 0, 1 }, { 0, 1, 0, 1 }, { 0, 0, 1, 1 }, { 0, 1, 1, 1 } };
for( const EntityType* t = elem_types; *t != MBMAXTYPE; ++t )
{
const EntityType type = *t;
const int dim = CN::Dimension( type );
// calculate number of valid combinations of ho node flags
int num_comb = 1;
for( int i = 0; i < dim; ++i )
num_comb *= 2;
// for each valid combination
for( int c = 0; c < num_comb; ++c )
{
// calculate corresponding number of vertices in element
const int* ho_nodes = combinations[c];
int num_vtx = CN::VerticesPerEntity( type );
switch( dim )
{
case 3:
case 2:
// extra clauses to avoid fall-through error
if( 3 == dim && ho_nodes[2] ) num_vtx += CN::NumSubEntities( type, 2 );
if( 2 <= dim && ho_nodes[1] ) num_vtx += CN::NumSubEntities( type, 1 );
}
if( ho_nodes[dim] ) ++num_vtx;
// start at first higher-order node
int pos = CN::VerticesPerEntity( type );
// check mid-edge
if( dim > 1 && ho_nodes[1] )
{
for( int i = 0; i < CN::NumSubEntities( type, 1 ); ++i )
{
int idx = CN::HONodeIndex( type, num_vtx, 1, i );
CHECK_EQUAL( pos++, idx );
}
}
// check mid-face
if( dim > 2 && ho_nodes[2] )
{
for( int i = 0; i < CN::NumSubEntities( type, 2 ); ++i )
{
int idx = CN::HONodeIndex( type, num_vtx, 2, i );
CHECK_EQUAL( pos++, idx );
}
}
// check mid-volume
if( ho_nodes[dim] )
{
int idx = CN::HONodeIndex( type, num_vtx, dim, 0 );
CHECK_EQUAL( pos++, idx );
}
} // for ho_node combinatinos
} // for each type
}
| void test_ho_node_parent | ( | ) |
Definition at line 923 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, moab::CN::Dimension(), elem_types, moab::CN::HONodeParent(), MBMAXTYPE, moab::CN::NumSubEntities(), t, and moab::CN::VerticesPerEntity().
Referenced by main().
{
const int combinations[][4] = { { 0, 0, 0, 0 }, { 0, 1, 0, 0 }, { 0, 0, 1, 0 }, { 0, 1, 1, 0 },
{ 0, 0, 0, 1 }, { 0, 1, 0, 1 }, { 0, 0, 1, 1 }, { 0, 1, 1, 1 } };
for( const EntityType* t = elem_types; *t != MBMAXTYPE; ++t )
{
const EntityType type = *t;
const int dim = CN::Dimension( type );
// calculate number of valid combinations of ho node flags
int num_comb = 1;
for( int i = 0; i < dim; ++i )
num_comb *= 2;
// for each valid combination
for( int c = 0; c < num_comb; ++c )
{
// calculate corresponding number of vertices in element
const int* ho_nodes = combinations[c];
int num_vtx = CN::VerticesPerEntity( type );
switch( dim )
{
case 3:
case 2:
// extra clauses to avoid fall-through error
if( 3 == dim && ho_nodes[2] ) num_vtx += CN::NumSubEntities( type, 2 );
if( 2 <= dim && ho_nodes[1] ) num_vtx += CN::NumSubEntities( type, 1 );
}
if( ho_nodes[dim] ) ++num_vtx;
// start at first higher-order node
int pos = CN::VerticesPerEntity( type );
// check mid-edge
if( dim > 1 && ho_nodes[1] )
{
for( int i = 0; i < CN::NumSubEntities( type, 1 ); ++i )
{
int pdim = -1, pidx = -1;
CN::HONodeParent( type, num_vtx, pos++, pdim, pidx );
CHECK_EQUAL( 1, pdim );
CHECK_EQUAL( i, pidx );
}
}
// check mid-face
if( dim > 2 && ho_nodes[2] )
{
for( int i = 0; i < CN::NumSubEntities( type, 2 ); ++i )
{
int pdim = -1, pidx = -1;
CN::HONodeParent( type, num_vtx, pos++, pdim, pidx );
CHECK_EQUAL( 2, pdim );
CHECK_EQUAL( i, pidx );
}
}
// check mid-volume
if( ho_nodes[dim] )
{
int pdim = -1, pidx = -1;
CN::HONodeParent( type, num_vtx, pos++, pdim, pidx );
CHECK_EQUAL( dim, pdim );
CHECK_EQUAL( 0, pidx );
}
} // for ho_node combinatinos
} // for each type
}
| void test_num_sub_entities | ( | ) |
Definition at line 263 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBHEX, MBKNIFE, MBPRISM, MBPYRAMID, MBQUAD, MBTET, MBTRI, MBVERTEX, and moab::CN::NumSubEntities().
Referenced by main().
{
CHECK_EQUAL( 1, CN::NumSubEntities( MBVERTEX, 0 ) );
CHECK_EQUAL( 2, CN::NumSubEntities( MBEDGE, 0 ) );
CHECK_EQUAL( 1, CN::NumSubEntities( MBEDGE, 1 ) );
CHECK_EQUAL( 3, CN::NumSubEntities( MBTRI, 0 ) );
CHECK_EQUAL( 3, CN::NumSubEntities( MBTRI, 1 ) );
CHECK_EQUAL( 1, CN::NumSubEntities( MBTRI, 2 ) );
CHECK_EQUAL( 4, CN::NumSubEntities( MBQUAD, 0 ) );
CHECK_EQUAL( 4, CN::NumSubEntities( MBQUAD, 1 ) );
CHECK_EQUAL( 1, CN::NumSubEntities( MBQUAD, 2 ) );
CHECK_EQUAL( 4, CN::NumSubEntities( MBTET, 0 ) );
CHECK_EQUAL( 6, CN::NumSubEntities( MBTET, 1 ) );
CHECK_EQUAL( 4, CN::NumSubEntities( MBTET, 2 ) );
CHECK_EQUAL( 5, CN::NumSubEntities( MBPYRAMID, 0 ) );
CHECK_EQUAL( 8, CN::NumSubEntities( MBPYRAMID, 1 ) );
CHECK_EQUAL( 5, CN::NumSubEntities( MBPYRAMID, 2 ) );
CHECK_EQUAL( 6, CN::NumSubEntities( MBPRISM, 0 ) );
CHECK_EQUAL( 9, CN::NumSubEntities( MBPRISM, 1 ) );
CHECK_EQUAL( 5, CN::NumSubEntities( MBPRISM, 2 ) );
CHECK_EQUAL( 7, CN::NumSubEntities( MBKNIFE, 0 ) );
CHECK_EQUAL( 10, CN::NumSubEntities( MBKNIFE, 1 ) );
CHECK_EQUAL( 5, CN::NumSubEntities( MBKNIFE, 2 ) );
CHECK_EQUAL( 8, CN::NumSubEntities( MBHEX, 0 ) );
CHECK_EQUAL( 12, CN::NumSubEntities( MBHEX, 1 ) );
CHECK_EQUAL( 6, CN::NumSubEntities( MBHEX, 2 ) );
}
| void test_opposite_side_hex | ( | ) |
Definition at line 772 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, MBHEX, and moab::CN::OppositeSide().
Referenced by main().
{
int idx, dim, err;
err = CN::OppositeSide( MBHEX, 0, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 6, idx );
err = CN::OppositeSide( MBHEX, 1, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 7, idx );
err = CN::OppositeSide( MBHEX, 2, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 4, idx );
err = CN::OppositeSide( MBHEX, 3, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 5, idx );
err = CN::OppositeSide( MBHEX, 4, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBHEX, 5, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBHEX, 6, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBHEX, 7, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBHEX, 0, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 10, idx );
err = CN::OppositeSide( MBHEX, 1, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 11, idx );
err = CN::OppositeSide( MBHEX, 2, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 8, idx );
err = CN::OppositeSide( MBHEX, 3, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 9, idx );
err = CN::OppositeSide( MBHEX, 4, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 6, idx );
err = CN::OppositeSide( MBHEX, 5, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 7, idx );
err = CN::OppositeSide( MBHEX, 6, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 4, idx );
err = CN::OppositeSide( MBHEX, 7, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 5, idx );
err = CN::OppositeSide( MBHEX, 8, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBHEX, 9, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBHEX, 10, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBHEX, 11, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBHEX, 0, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBHEX, 1, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBHEX, 2, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBHEX, 3, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBHEX, 4, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 5, idx );
err = CN::OppositeSide( MBHEX, 5, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 4, idx );
}
| void test_opposite_side_quad | ( | ) |
Definition at line 670 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, MBQUAD, and moab::CN::OppositeSide().
Referenced by main().
{
int idx, dim, err;
err = CN::OppositeSide( MBQUAD, 0, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBQUAD, 1, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBQUAD, 2, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBQUAD, 3, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBQUAD, 0, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBQUAD, 1, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBQUAD, 2, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBQUAD, 3, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 1, idx );
}
| void test_opposite_side_tet | ( | ) |
Definition at line 708 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, MBTET, and moab::CN::OppositeSide().
Referenced by main().
{
int idx, dim, err;
err = CN::OppositeSide( MBTET, 0, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBTET, 1, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBTET, 2, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBTET, 3, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 2, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBTET, 0, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBTET, 1, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBTET, 2, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBTET, 3, 2, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBTET, 0, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 5, idx );
err = CN::OppositeSide( MBTET, 1, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 3, idx );
err = CN::OppositeSide( MBTET, 2, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 4, idx );
err = CN::OppositeSide( MBTET, 3, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBTET, 4, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBTET, 5, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 0, idx );
}
| void test_opposite_side_tri | ( | ) |
Definition at line 641 of file mbcn_test.cpp.
References CHECK_EQUAL, dim, MBTRI, and moab::CN::OppositeSide().
Referenced by main().
{
int idx, dim, err;
err = CN::OppositeSide( MBTRI, 0, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 1, idx );
err = CN::OppositeSide( MBTRI, 1, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBTRI, 2, 0, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 1, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBTRI, 0, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 2, idx );
err = CN::OppositeSide( MBTRI, 1, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 0, idx );
err = CN::OppositeSide( MBTRI, 2, 1, idx, dim );
CHECK_EQUAL( 0, err );
CHECK_EQUAL( 0, dim );
CHECK_EQUAL( 1, idx );
}
| void test_side_number_hex | ( | ) |
Definition at line 633 of file mbcn_test.cpp.
References do_test_side_number_1d(), do_test_side_number_2d(), and MBHEX.
Referenced by main().
| void test_side_number_pri | ( | ) |
Definition at line 625 of file mbcn_test.cpp.
References do_test_side_number_1d(), do_test_side_number_2d(), and MBPRISM.
Referenced by main().
| void test_side_number_pyr | ( | ) |
Definition at line 617 of file mbcn_test.cpp.
References do_test_side_number_1d(), do_test_side_number_2d(), and MBPYRAMID.
Referenced by main().
| void test_side_number_quad | ( | ) |
Definition at line 603 of file mbcn_test.cpp.
References do_test_side_number_1d(), and MBQUAD.
Referenced by main().
{
for( int side = 0; side < 4; ++side )
do_test_side_number_1d( MBQUAD, side );
}
| void test_side_number_tet | ( | ) |
Definition at line 609 of file mbcn_test.cpp.
References do_test_side_number_1d(), do_test_side_number_2d(), and MBTET.
Referenced by main().
| void test_side_number_tri | ( | ) |
Definition at line 597 of file mbcn_test.cpp.
References do_test_side_number_1d(), and MBTRI.
Referenced by main().
{
for( int side = 0; side < 3; ++side )
do_test_side_number_1d( MBTRI, side );
}
| void test_sub_entity_indices_edge | ( | ) |
Definition at line 470 of file mbcn_test.cpp.
References MBEDGE, test_0d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
test_0d_sub_entity_indices( MBEDGE, 2 );
test_elem_as_sub_entity( MBEDGE, 1, 2 );
}
| void test_sub_entity_indices_hex | ( | ) |
Definition at line 530 of file mbcn_test.cpp.
References MBHEX, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), test_2d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const EntityType type = MBHEX;
const int num_vtx = 8;
const int 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 } };
const int faces[][5] = { { 4, 0, 1, 5, 4 }, { 4, 1, 2, 6, 5 }, { 4, 2, 3, 7, 6 },
{ 4, 3, 0, 4, 7 }, { 4, 3, 2, 1, 0 }, { 4, 4, 5, 6, 7 } };
test_0d_sub_entity_indices( type, num_vtx );
test_1d_sub_entity_indices( type, sizeof( edges ) / sizeof( edges[0] ), edges );
test_2d_sub_entity_indices( type, sizeof( faces ) / sizeof( faces[0] ), faces );
test_elem_as_sub_entity( type, 3, num_vtx );
}
| void test_sub_entity_indices_pri | ( | ) |
Definition at line 517 of file mbcn_test.cpp.
References MBPRISM, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), test_2d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const EntityType type = MBPRISM;
const int num_vtx = 6;
const int edges[][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 }, { 0, 3 }, { 1, 4 }, { 2, 5 }, { 3, 4 }, { 4, 5 }, { 5, 3 } };
const int faces[][5] = {
{ 4, 0, 1, 4, 3 }, { 4, 1, 2, 5, 4 }, { 4, 2, 0, 3, 5 }, { 3, 2, 1, 0, 0 }, { 3, 3, 4, 5, 0 } };
test_0d_sub_entity_indices( type, num_vtx );
test_1d_sub_entity_indices( type, sizeof( edges ) / sizeof( edges[0] ), edges );
test_2d_sub_entity_indices( type, sizeof( faces ) / sizeof( faces[0] ), faces );
test_elem_as_sub_entity( type, 3, num_vtx );
}
| void test_sub_entity_indices_pyr | ( | ) |
Definition at line 504 of file mbcn_test.cpp.
References MBPYRAMID, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), test_2d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const EntityType type = MBPYRAMID;
const int num_vtx = 5;
const int edges[][2] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 3, 0 }, { 0, 4 }, { 1, 4 }, { 2, 4 }, { 3, 4 } };
const int faces[][5] = {
{ 3, 0, 1, 4, 0 }, { 3, 1, 2, 4, 0 }, { 3, 2, 3, 4, 0 }, { 3, 3, 0, 4, 0 }, { 4, 3, 2, 1, 0 } };
test_0d_sub_entity_indices( type, num_vtx );
test_1d_sub_entity_indices( type, sizeof( edges ) / sizeof( edges[0] ), edges );
test_2d_sub_entity_indices( type, sizeof( faces ) / sizeof( faces[0] ), faces );
test_elem_as_sub_entity( type, 3, num_vtx );
}
| void test_sub_entity_indices_quad | ( | ) |
Definition at line 484 of file mbcn_test.cpp.
References MBQUAD, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const int edges[4][2] = { { 0, 1 }, { 1, 2 }, { 2, 3 }, { 3, 0 } };
test_0d_sub_entity_indices( MBQUAD, 4 );
test_1d_sub_entity_indices( MBQUAD, 4, edges );
test_elem_as_sub_entity( MBQUAD, 2, 4 );
}
| void test_sub_entity_indices_tet | ( | ) |
Definition at line 492 of file mbcn_test.cpp.
References MBTET, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), test_2d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const EntityType type = MBTET;
const int num_vtx = 4;
const int edges[][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 }, { 0, 3 }, { 1, 3 }, { 2, 3 } };
const int faces[][5] = { { 3, 0, 1, 3, 0 }, { 3, 1, 2, 3, 0 }, { 3, 2, 0, 3, 0 }, { 3, 2, 1, 0, 0 } };
test_0d_sub_entity_indices( type, num_vtx );
test_1d_sub_entity_indices( type, sizeof( edges ) / sizeof( edges[0] ), edges );
test_2d_sub_entity_indices( type, sizeof( faces ) / sizeof( faces[0] ), faces );
test_elem_as_sub_entity( type, 3, num_vtx );
}
| void test_sub_entity_indices_tri | ( | ) |
Definition at line 476 of file mbcn_test.cpp.
References MBTRI, test_0d_sub_entity_indices(), test_1d_sub_entity_indices(), and test_elem_as_sub_entity().
Referenced by main().
{
const int edges[3][2] = { { 0, 1 }, { 1, 2 }, { 2, 0 } };
test_0d_sub_entity_indices( MBTRI, 3 );
test_1d_sub_entity_indices( MBTRI, 3, edges );
test_elem_as_sub_entity( MBTRI, 2, 3 );
}
| void test_sub_entity_indices_vtx | ( | ) |
Definition at line 465 of file mbcn_test.cpp.
References MBVERTEX, and test_elem_as_sub_entity().
Referenced by main().
{
test_elem_as_sub_entity( MBVERTEX, 0, 1 );
}
| void test_sub_entity_nodes | ( | EntityType | parent, |
| int | sub_dimension | ||
| ) |
Definition at line 1053 of file mbcn_test.cpp.
References CHECK, dim, moab::CN::Dimension(), moab::CN::NumSubEntities(), and moab::CN::VerticesPerEntity().
Referenced by test_sub_entity_nodes_hex_edges(), test_sub_entity_nodes_hex_faces(), test_sub_entity_nodes_kni_edges(), test_sub_entity_nodes_kni_faces(), test_sub_entity_nodes_pri_edges(), test_sub_entity_nodes_pri_faces(), test_sub_entity_nodes_pyr_edges(), test_sub_entity_nodes_pyr_faces(), test_sub_entity_nodes_quad_edges(), test_sub_entity_nodes_tet_edges(), test_sub_entity_nodes_tet_faces(), and test_sub_entity_nodes_tri_edges().
{
const int num_corner = CN::VerticesPerEntity( parent );
const int num_edge = CN::NumSubEntities( parent, 1 );
const int num_face = CN::NumSubEntities( parent, 2 );
auto dim = CN::Dimension( parent );
switch( dim )
{
case 3:
case 2:
case 1:
test_sub_entity_nodes( parent, num_corner + num_face, sub_dimension );
test_sub_entity_nodes( parent, num_corner + num_edge + num_face, sub_dimension );
test_sub_entity_nodes( parent, num_corner + num_face + 1, sub_dimension );
test_sub_entity_nodes( parent, num_corner + num_edge + num_face + 1, sub_dimension );
if( 2 <= dim )
{
test_sub_entity_nodes( parent, num_corner + num_edge, sub_dimension );
test_sub_entity_nodes( parent, num_corner + num_edge + 1, sub_dimension );
}
if( 1 <= dim )
{
test_sub_entity_nodes( parent, num_corner, sub_dimension );
test_sub_entity_nodes( parent, num_corner + 1, sub_dimension );
}
break;
default:
CHECK( false );
}
}
| void test_sub_entity_nodes | ( | EntityType | parent, |
| int | num_nodes, | ||
| int | sub_dimension | ||
| ) |
Definition at line 1085 of file mbcn_test.cpp.
References CHECK, CHECK_EQUAL, moab::CN::Dimension(), moab::CN::HasMidNodes(), moab::CN::HONodeIndex(), moab::MAX_SUB_ENTITY_VERTICES, moab::CN::MID_EDGE_BIT, moab::CN::MID_FACE_BIT, moab::CN::NumSubEntities(), moab::CN::SideNumber(), moab::CN::SubEntityNodeIndices(), moab::CN::SubEntityType(), moab::CN::SubEntityVertexIndices(), and moab::CN::VerticesPerEntity().
{
const int num_sub = CN::NumSubEntities( parent, sub_dimension );
const int parent_ho = CN::HasMidNodes( parent, num_nodes );
int child_ho = 0;
for( int d = 1; d <= sub_dimension; ++d )
child_ho |= ( parent_ho & ( 1 << d ) );
// first test the types
for( int i = 0; i < num_sub; ++i )
{
int num, conn[moab::MAX_SUB_ENTITY_VERTICES];
EntityType type;
CN::SubEntityNodeIndices( parent, num_nodes, sub_dimension, i, type, num, conn );
CHECK_EQUAL( CN::SubEntityType( parent, sub_dimension, i ), type );
}
// now test that they have the correct number of higher-order node
for( int i = 0; i < num_sub; ++i )
{
int num, conn[moab::MAX_SUB_ENTITY_VERTICES];
EntityType type;
CN::SubEntityNodeIndices( parent, num_nodes, sub_dimension, i, type, num, conn );
const int ho = CN::HasMidNodes( type, num );
CHECK_EQUAL( child_ho, ho );
}
// now test the actual indices
for( int i = 0; i < num_sub; ++i )
{
int num, conn[moab::MAX_SUB_ENTITY_VERTICES], corners[moab::MAX_SUB_ENTITY_VERTICES];
EntityType type;
CN::SubEntityNodeIndices( parent, num_nodes, sub_dimension, i, type, num, conn );
// check corner indices against SubEntityVertexIndices
const int num_corner = CN::VerticesPerEntity( type );
CHECK( num >= num_corner );
CN::SubEntityVertexIndices( parent, sub_dimension, i, corners );
for( int j = 0; j < num_corner; ++j )
CHECK_EQUAL( corners[j], conn[j] );
// check mid-edge indices, if present
int idx = num_corner;
if( child_ho & CN::MID_EDGE_BIT )
{
// for each edge in the sub-entity type
const int num_edge = CN::NumSubEntities( type, 1 );
for( int j = 0; j < num_edge; ++j )
{
// get edge indices for sub-entity connectivity
int edge_ends[2];
CN::SubEntityVertexIndices( type, 1, j, edge_ends );
// convert to indices into parent type's connectivity
CHECK( edge_ends[0] < num_corner );
edge_ends[0] = corners[edge_ends[0]];
CHECK( edge_ends[1] < num_corner );
edge_ends[1] = corners[edge_ends[1]];
// find edge index in parent element
int side, sense, off;
int result = CN::SideNumber( parent, edge_ends, 2, 1, side, sense, off );
CHECK_EQUAL( 0, result );
// get location in parent entity connectivity for mid-edge node
int loc = CN::HONodeIndex( parent, num_nodes, 1, side );
CHECK_EQUAL( loc, conn[idx++] );
}
}
// check mid-face indices, if present
if( child_ho & CN::MID_FACE_BIT )
{
CHECK_EQUAL( 2, CN::Dimension( type ) );
int loc = CN::HONodeIndex( parent, num_nodes, 2, i );
CHECK_EQUAL( loc, conn[idx++] );
}
// make sure there were no extra node indices returned
CHECK_EQUAL( idx, num );
}
}
| void test_sub_entity_nodes_hex_edges | ( | ) |
Definition at line 122 of file mbcn_test.cpp.
References MBHEX, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBHEX, 1 );
}
| void test_sub_entity_nodes_hex_faces | ( | ) |
Definition at line 126 of file mbcn_test.cpp.
References MBHEX, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBHEX, 2 );
}
| void test_sub_entity_nodes_kni_edges | ( | ) |
Definition at line 114 of file mbcn_test.cpp.
References MBKNIFE, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBKNIFE, 1 );
}
| void test_sub_entity_nodes_kni_faces | ( | ) |
Definition at line 118 of file mbcn_test.cpp.
References MBKNIFE, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBKNIFE, 2 );
}
| void test_sub_entity_nodes_pri_edges | ( | ) |
Definition at line 106 of file mbcn_test.cpp.
References MBPRISM, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBPRISM, 1 );
}
| void test_sub_entity_nodes_pri_faces | ( | ) |
Definition at line 110 of file mbcn_test.cpp.
References MBPRISM, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBPRISM, 2 );
}
| void test_sub_entity_nodes_pyr_edges | ( | ) |
Definition at line 98 of file mbcn_test.cpp.
References MBPYRAMID, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBPYRAMID, 1 );
}
| void test_sub_entity_nodes_pyr_faces | ( | ) |
Definition at line 102 of file mbcn_test.cpp.
References MBPYRAMID, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBPYRAMID, 2 );
}
| void test_sub_entity_nodes_quad_edges | ( | ) |
Definition at line 86 of file mbcn_test.cpp.
References MBQUAD, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBQUAD, 1 );
}
| void test_sub_entity_nodes_tet_edges | ( | ) |
Definition at line 90 of file mbcn_test.cpp.
References MBTET, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBTET, 1 );
}
| void test_sub_entity_nodes_tet_faces | ( | ) |
Definition at line 94 of file mbcn_test.cpp.
References MBTET, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBTET, 2 );
}
| void test_sub_entity_nodes_tri_edges | ( | ) |
Definition at line 82 of file mbcn_test.cpp.
References MBTRI, and test_sub_entity_nodes().
Referenced by main().
{
test_sub_entity_nodes( MBTRI, 1 );
}
| void test_sub_entity_type_edge | ( | ) |
Definition at line 335 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBVERTEX, and moab::CN::SubEntityType().
Referenced by main().
{
CHECK_EQUAL( MBVERTEX, CN::SubEntityType( MBEDGE, 0, 0 ) );
CHECK_EQUAL( MBVERTEX, CN::SubEntityType( MBEDGE, 0, 1 ) );
CHECK_EQUAL( MBEDGE, CN::SubEntityType( MBEDGE, 1, 0 ) );
}
| void test_sub_entity_type_hex | ( | ) |
Definition at line 376 of file mbcn_test.cpp.
References do_test_sub_entity_type_3d(), MBHEX, and MBQUAD.
Referenced by main().
{
const EntityType types[] = { MBQUAD, MBQUAD, MBQUAD, MBQUAD, MBQUAD, MBQUAD };
do_test_sub_entity_type_3d( MBHEX, sizeof( types ) / sizeof( types[0] ), types );
}
| void test_sub_entity_type_knife | ( | ) |
Definition at line 370 of file mbcn_test.cpp.
References do_test_sub_entity_type_3d(), MBKNIFE, and MBQUAD.
Referenced by main().
{
const EntityType types[] = { MBQUAD, MBQUAD, MBQUAD, MBQUAD, MBQUAD };
do_test_sub_entity_type_3d( MBKNIFE, sizeof( types ) / sizeof( types[0] ), types );
}
| void test_sub_entity_type_pri | ( | ) |
Definition at line 364 of file mbcn_test.cpp.
References do_test_sub_entity_type_3d(), MBPRISM, MBQUAD, and MBTRI.
Referenced by main().
{
const EntityType types[] = { MBQUAD, MBQUAD, MBQUAD, MBTRI, MBTRI };
do_test_sub_entity_type_3d( MBPRISM, sizeof( types ) / sizeof( types[0] ), types );
}
| void test_sub_entity_type_pyr | ( | ) |
Definition at line 358 of file mbcn_test.cpp.
References do_test_sub_entity_type_3d(), MBPYRAMID, MBQUAD, and MBTRI.
Referenced by main().
{
const EntityType types[] = { MBTRI, MBTRI, MBTRI, MBTRI, MBQUAD };
do_test_sub_entity_type_3d( MBPYRAMID, sizeof( types ) / sizeof( types[0] ), types );
}
| void test_sub_entity_type_quad | ( | ) |
Definition at line 347 of file mbcn_test.cpp.
References do_test_sub_entity_type_2d(), and MBQUAD.
Referenced by main().
{
do_test_sub_entity_type_2d( MBQUAD );
}
| void test_sub_entity_type_tet | ( | ) |
Definition at line 352 of file mbcn_test.cpp.
References do_test_sub_entity_type_3d(), MBTET, and MBTRI.
Referenced by main().
{
const EntityType types[] = { MBTRI, MBTRI, MBTRI, MBTRI };
do_test_sub_entity_type_3d( MBTET, sizeof( types ) / sizeof( types[0] ), types );
}
| void test_sub_entity_type_tri | ( | ) |
Definition at line 342 of file mbcn_test.cpp.
References do_test_sub_entity_type_2d(), and MBTRI.
Referenced by main().
{
do_test_sub_entity_type_2d( MBTRI );
}
| void test_sub_entity_type_vtx | ( | ) |
Definition at line 330 of file mbcn_test.cpp.
References CHECK_EQUAL, MBVERTEX, and moab::CN::SubEntityType().
Referenced by main().
{
CHECK_EQUAL( MBVERTEX, CN::SubEntityType( MBVERTEX, 0, 0 ) );
}
| void test_type_names | ( | ) |
Definition at line 226 of file mbcn_test.cpp.
References CHECK_EQUAL, moab::CN::EntityTypeFromName(), moab::CN::EntityTypeName(), MBMAXTYPE, MBVERTEX, and t.
Referenced by main().
{
for( EntityType t = MBVERTEX; t != MBMAXTYPE; ++t )
{
const char* name = CN::EntityTypeName( t );
CHECK_EQUAL( t, CN::EntityTypeFromName( name ) );
}
}
| void test_vertices_per_entity | ( | ) |
Definition at line 250 of file mbcn_test.cpp.
References CHECK_EQUAL, MBEDGE, MBHEX, MBKNIFE, MBPRISM, MBPYRAMID, MBQUAD, MBTET, MBTRI, MBVERTEX, and moab::CN::VerticesPerEntity().
Referenced by main().
{
CHECK_EQUAL( 1, CN::VerticesPerEntity( MBVERTEX ) );
CHECK_EQUAL( 2, CN::VerticesPerEntity( MBEDGE ) );
CHECK_EQUAL( 3, CN::VerticesPerEntity( MBTRI ) );
CHECK_EQUAL( 4, CN::VerticesPerEntity( MBQUAD ) );
CHECK_EQUAL( 4, CN::VerticesPerEntity( MBTET ) );
CHECK_EQUAL( 5, CN::VerticesPerEntity( MBPYRAMID ) );
CHECK_EQUAL( 6, CN::VerticesPerEntity( MBPRISM ) );
CHECK_EQUAL( 7, CN::VerticesPerEntity( MBKNIFE ) );
CHECK_EQUAL( 8, CN::VerticesPerEntity( MBHEX ) );
}
| void test_wedges | ( | ) |
Definition at line 1233 of file mbcn_test.cpp.
References CHECK, moab::Core::create_element(), moab::Core::create_vertex(), moab::Core::get_adjacencies(), moab::Core::get_connectivity(), moab::Core::get_entities_by_dimension(), moab::Core::id_from_handle(), mb, and MBPRISM.
Referenced by main().
{
moab::Core mb;
//mb.load_file("./wed15_2.h5m");
std::vector< moab::EntityHandle > conn;
double coords[3];
for( int i = 0; i < 22; ++i )
{
moab::EntityHandle h;
mb.create_vertex( coords, h );
}
moab::EntityHandle conn1[15] = { 10, 20, 14, 1, 8, 5, 21, 19, 15, 16, 22, 18, 9, 7, 6 };
moab::EntityHandle conn2[15] = { 10, 14, 12, 1, 5, 3, 15, 13, 11, 16, 18, 17, 6, 4, 2 };
moab::EntityHandle w;
mb.create_element( moab::MBPRISM, conn1, 15, w );
mb.create_element( moab::MBPRISM, conn2, 15, w );
std::vector< moab::EntityHandle > wedges;
mb.get_entities_by_dimension( 0, 3, wedges );
// > If I comment this block there is no problem
for( const auto& w : wedges )
{
std::vector< moab::EntityHandle > adj;
mb.get_adjacencies( &w, 1, 2, true, adj );
CHECK( 5 == adj.size() );
}
// <
for( const auto& w : wedges )
{
std::vector< moab::EntityHandle > conn;
mb.get_connectivity( &w, 1, conn );
CHECK( 15 == conn.size() );
for( const auto& n : conn )
{
std::vector< moab::EntityHandle > edges;
mb.get_adjacencies( &n, 1, 1, true, edges );
if( edges.size() == 0 )
{
std::cout << " node " << n << " not connected to edges \n";
std::vector< moab::EntityHandle > faces;
mb.get_adjacencies( &n, 1, 2, false, faces );
for( const auto& f : faces )
{
std::vector< moab::EntityHandle > connf;
mb.get_connectivity( &f, 1, connf );
std::cout << "face:" << mb.id_from_handle( f );
for( const auto& n1 : connf )
std::cout << " " << n1;
std::cout << "\n";
}
std::vector< moab::EntityHandle > prisms;
mb.get_adjacencies( &n, 1, 3, false, prisms );
for( const auto& p : prisms )
{
std::vector< moab::EntityHandle > connf;
mb.get_connectivity( &p, 1, connf );
std::cout << "prism:" << mb.id_from_handle( p );
for( const auto& n1 : connf )
std::cout << " " << n1;
std::cout << "\n";
}
CHECK( edges.size() != 0 );
}
}
}
}
Definition at line 202 of file mbcn_test.cpp.
Referenced by test_ho_node_index(), and test_ho_node_parent().
1.7.6.1