cell_inf_hex.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2014 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);

  //   /**
  //    * @returns 4 for the base \p s=0 and 2 for side faces.
  //    */
  //   unsigned int n_children_per_side(const unsigned int s) const;

  unsigned int n_sides() const { return 5; }

  unsigned int n_vertices() const { return 8; }

  unsigned int n_edges() const { return 8; }

  unsigned int n_faces() const { return 5; }

  unsigned int n_children() const { return 4; }

  /*
   * @returns true iff the specified child is on the
   * specified side
   */
  virtual bool is_child_on_side(const unsigned int c,
                                const unsigned int s) const;

  /*
   * @returns true iff the specified edge is on the specified side
   */
  virtual bool is_edge_on_side(const unsigned int e,
                               const unsigned int s) const;

  dof_id_type key (const unsigned int s) const;

  UniquePtr<Elem> side (const unsigned int i) const;

  Real quality (const ElemQuality q) const;

  std::pair<Real, Real> qual_bounds (const ElemQuality q) const;



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];
};



// ------------------------------------------------------------
// InfHex class member functions
inline
InfHex::InfHex(const unsigned int nn, Elem* p, Node** nodelinkdata) :
  InfCell(nn, InfHex::n_sides(), p, _elemlinks_data, nodelinkdata)
{
}


// inline
// unsigned int InfHex::n_children_per_side(const unsigned int s) const
// {
//   libmesh_assert_less (s, this->n_sides());

//   switch (s)
//   {
//     case 0:
//       // every infinite element has 4 children in the base side
//       return 4;

//     default:
//       // on infinite faces (sides), only 2 children exist
//       //
//       // note that the face at infinity is already caught by the libmesh_assertion
//       return 2;
//   }
// }


} // namespace libMesh

#endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS

#endif // LIBMESH_CELL_INF_HEX_H