RationalMapTest< elem_type > Class Template Reference

Inheritance diagram for RationalMapTest< elem_type >:

Public Member Functions
void	setUp ()
void	tearDown ()
void	testContainsPoint ()

Protected Attributes
std::string	libmesh_suite_name

Private Attributes
unsigned int	_dim
unsigned int	_nx
unsigned int	_ny
unsigned int	_nz
Elem *	_elem
std::vector< dof_id_type >	_dof_indices
std::unique_ptr< Mesh >	_mesh
std::unique_ptr< EquationSystems >	_es
std::unique_ptr< FEBase >	_fe

Detailed Description

template<ElemType elem_type>
class RationalMapTest< elem_type >

Definition at line 22 of file fe_rational_map.C.

Member Function Documentation

setUp()

template<ElemType elem_type>

void RationalMapTest< elem_type >::setUp ( )

inline

Definition at line 36 of file fe_rational_map.C.

References libMesh::System::add_variable(), libMesh::FEGenericBase< OutputType >::build(), libMesh::Elem::build(), libMesh::MeshTools::Generation::build_cube(), libMesh::FIRST, libMesh::RATIONAL_BERNSTEIN_MAP, libMesh::Real, and libMesh::System::variable_type().

  {
    _mesh = std::make_unique<Mesh>(*TestCommWorld);
    const std::unique_ptr<Elem> test_elem = Elem::build(elem_type);
    _dim = test_elem->dim();
    const unsigned int ny = _dim > 1;
    const unsigned int nz = _dim > 2;

    // Make sure we can handle non-zero weight indices
    _mesh->add_node_integer("buffer integer1");
    _mesh->add_node_integer("buffer integer2");

    // Default weight to 1.0 so we don't get NaN from contains_point
    // checks with a default GhostPointNeighbors ghosting
    const Real default_weight = 1.0;
    unsigned char weight_index = cast_int<unsigned char>
      (_mesh->add_node_datum<Real>("rational_weight", true,
                                   &default_weight));

    libmesh_assert_not_equal_to(weight_index, 0);

    _mesh->set_default_mapping_type(RATIONAL_BERNSTEIN_MAP);
    _mesh->set_default_mapping_data(weight_index);

    MeshTools::Generation::build_cube (*_mesh,
                                       1, ny, nz,
                                       0., 1., 0., ny, 0., nz,
                                       elem_type);

    for (auto elem : _mesh->element_ptr_range())
      {
        CPPUNIT_ASSERT_EQUAL(elem->mapping_type(), RATIONAL_BERNSTEIN_MAP);
        CPPUNIT_ASSERT_EQUAL(elem->mapping_data(), weight_index);
      }

    // Transform the cube / square into a rotated quarter-annulus,
    // with central axis at (-.5, 0) and radii ranging from .5 to 1.5

    for (auto node : _mesh->node_ptr_range())
      {
        Real & x = (*node)(0);
        Real & y = (*node)(1);
        node->set_extra_datum<Real>(weight_index, 1);
        if (y > .6)
          {
            y = .5 + x;
            x = -.5;
          }
        else if (y > .4)
          {
            y = .5 + x;
            x = y - .5;
            node->set_extra_datum<Real>(weight_index, sqrt(Real(2))/2);
          }
      }

    _es = std::make_unique<EquationSystems>(*_mesh);
    System * sys = &(_es->add_system<System> ("SimpleSystem"));
    sys->add_variable("u", FIRST);
    _es->init();

    _fe = FEBase::build(_dim, sys->variable_type("u"));
    _fe->get_xyz();
    _fe->get_phi();
    _fe->get_dphi();
    _fe->get_dphidx();
#if LIBMESH_DIM > 1
    _fe->get_dphidy();
#endif
#if LIBMESH_DIM > 2
    _fe->get_dphidz();
#endif

    auto rng = _mesh->active_local_element_ptr_range();
    _elem = rng.begin() == rng.end() ? nullptr : *(rng.begin());

    _nx = 10;
    _ny = (_dim > 1) ? _nx : 0;
    _nz = (_dim > 2) ? _nx : 0;
  }

tearDown()

template<ElemType elem_type>

void RationalMapTest< elem_type >::tearDown ( )

inline

Definition at line 117 of file fe_rational_map.C.

{}

testContainsPoint()

template<ElemType elem_type>

void RationalMapTest< elem_type >::testContainsPoint ( )

inline

Definition at line 119 of file fe_rational_map.C.

References libMesh::Elem::contains_point(), int, libMesh::pi, and libMesh::Real.

  {
    LOG_UNIT_TEST;

    // Handle the "more processors than elements" case
    if (!_elem)
      return;

    // These tests require exceptions to be enabled because a
    // TypeTensor::solve() call down in Elem::contains_point()
    // actually throws a non-fatal exception for a certain Point which
    // is not in the Elem. When exceptions are not enabled, this test
    // simply aborts.
#ifdef LIBMESH_ENABLE_EXCEPTIONS
    for (unsigned int j=0; j != _ny+1; ++j)
      for (unsigned int k=0; k != _nz+1; ++k)
        {
          for (int i=-1; i != int(_nx+2); ++i)
            {
              Real r = (Real(i)/_nx) + 0.5,
                   theta = (Real(j)/_nx)*pi/2,
                   z = (Real(k)/_nx);
              Real x = -.5 + r * std::cos(theta),
                   y = r * std::sin(theta);
              Point p(x,y,z);
              // Test for false negatives
              if (i >= 0 && i <= int(_nx))
                CPPUNIT_ASSERT(_elem->contains_point(p));
              // Also test for false positives
              else
                CPPUNIT_ASSERT(!_elem->contains_point(p));
            }
        }
#endif
  }

Member Data Documentation

_dim

template<ElemType elem_type>

unsigned int RationalMapTest< elem_type >::_dim

private

Definition at line 25 of file fe_rational_map.C.

_dof_indices

template<ElemType elem_type>

std::vector<dof_id_type> RationalMapTest< elem_type >::_dof_indices

private

Definition at line 27 of file fe_rational_map.C.

_elem

template<ElemType elem_type>

Elem* RationalMapTest< elem_type >::_elem

private

Definition at line 26 of file fe_rational_map.C.

_es

template<ElemType elem_type>

std::unique_ptr<EquationSystems> RationalMapTest< elem_type >::_es

private

Definition at line 29 of file fe_rational_map.C.

_fe

template<ElemType elem_type>

std::unique_ptr<FEBase> RationalMapTest< elem_type >::_fe

private

Definition at line 30 of file fe_rational_map.C.

_mesh

template<ElemType elem_type>

std::unique_ptr<Mesh> RationalMapTest< elem_type >::_mesh

private

Definition at line 28 of file fe_rational_map.C.

_nx

template<ElemType elem_type>

unsigned int RationalMapTest< elem_type >::_nx

private

Definition at line 25 of file fe_rational_map.C.

_ny

template<ElemType elem_type>

unsigned int RationalMapTest< elem_type >::_ny

private

Definition at line 25 of file fe_rational_map.C.

_nz

template<ElemType elem_type>

unsigned int RationalMapTest< elem_type >::_nz

private

Definition at line 25 of file fe_rational_map.C.

libmesh_suite_name

template<ElemType elem_type>

std::string RationalMapTest< elem_type >::libmesh_suite_name

protected

Definition at line 33 of file fe_rational_map.C.

---

The documentation for this class was generated from the following file:

• tests/fe/fe_rational_map.C