cell_inf_hex.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2019 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
 
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
 
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
 
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 
 
 
#ifndef LIBMESH_CELL_INF_HEX_H
#define LIBMESH_CELL_INF_HEX_H
 
#include "libmesh/libmesh_config.h"
 
#ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
 
// Local includes
#include "libmesh/cell_inf.h"
 
namespace libMesh
{
 
class InfHex : public InfCell
{
public:
 
  InfHex(const unsigned int nn, Elem * p, Node ** nodelinkdata) :
    InfCell(nn, InfHex::n_sides(), p, _elemlinks_data, nodelinkdata)
  {
    // Make sure the interior parent isn't undefined
    if (LIBMESH_DIM > 3)
      this->set_interior_parent(nullptr);
  }
 
  InfHex (InfHex &&) = delete;
  InfHex (const InfHex &) = delete;
  InfHex & operator= (const InfHex &) = delete;
  InfHex & operator= (InfHex &&) = delete;
  virtual ~InfHex() = default;
 
  virtual Point master_point (const unsigned int i) const override final
  {
    libmesh_assert_less(i, this->n_nodes());
    return Point(_master_points[i][0],
                 _master_points[i][1],
                 _master_points[i][2]);
  }
 
  virtual unsigned int n_sides() const override final { return 5; }
 
  virtual unsigned int n_vertices() const override final { return 8; }
 
  virtual bool is_mid_infinite_edge_node(const unsigned int i) const
    override final { return (i > 3 && i < 8); }
 
  virtual unsigned int n_edges() const override final { return 8; }
 
  virtual unsigned int n_faces() const override final { return 5; }
 
  virtual unsigned int n_children() const override final { return 4; }
 
  virtual bool is_child_on_side(const unsigned int c,
                                const unsigned int s) const override final;
 
  virtual bool is_edge_on_side(const unsigned int e,
                               const unsigned int s) const override final;
 
  using Elem::key;
 
  virtual dof_id_type key (const unsigned int s) const override;
 
  virtual unsigned int which_node_am_i(unsigned int side,
                                       unsigned int side_node) const override;
 
  virtual std::unique_ptr<Elem> side_ptr (const unsigned int i) override final;
 
  virtual void side_ptr (std::unique_ptr<Elem> & side, const unsigned int i) override final;
 
  virtual Real quality (const ElemQuality q) const override;
 
  virtual std::pair<Real, Real> qual_bounds (const ElemQuality q) const override;
 
  virtual bool contains_point (const Point & p, Real tol=TOLERANCE) const override;
 
protected:
 
  Elem * _elemlinks_data[6+(LIBMESH_DIM>3)];
 
 
 
  static const unsigned short int _second_order_adjacent_vertices[8][2];
 
  static const unsigned short int _second_order_vertex_child_number[18];
 
  static const unsigned short int _second_order_vertex_child_index[18];
 
  static const Real _master_points[18][3];
};
 
 
} // namespace libMesh
 
#endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
 
#endif // LIBMESH_CELL_INF_HEX_H