cell_prism18.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_PRISM18_H
#define LIBMESH_CELL_PRISM18_H

// Local includes
#include "libmesh/cell_prism.h"

// C++ includes
#include <cstddef>

namespace libMesh
{




class Prism18 : public Prism
{
public:

  explicit
  Prism18  (Elem* p=NULL);

  ElemType     type () const   { return PRISM18; }

  unsigned int n_nodes() const { return 18; }

  unsigned int n_sub_elem() const { return 8; }

  virtual bool is_vertex(const unsigned int i) const;

  virtual bool is_edge(const unsigned int i) const;

  virtual bool is_face(const unsigned int i) const;

  /*
   * @returns true iff the specified (local) node number is on the
   * specified side
   */
  virtual bool is_node_on_side(const unsigned int n,
                               const unsigned int s) const;

  /*
   * @returns true iff the specified (local) node number is on the
   * specified edge
   */
  virtual bool is_node_on_edge(const unsigned int n,
                               const unsigned int e) const;

  /*
   * @returns true iff the element map is definitely affine within
   * numerical tolerances
   */
  virtual bool has_affine_map () const;

  Order default_order() const { return SECOND; }

  dof_id_type key (const unsigned int s) const;

  UniquePtr<Elem> build_side (const unsigned int i,
                              bool proxy) const;

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

  virtual void connectivity(const unsigned int sc,
                            const IOPackage iop,
                            std::vector<dof_id_type>& conn) const;

  unsigned int n_second_order_adjacent_vertices (const unsigned int) const;

  unsigned short int second_order_adjacent_vertex (const unsigned int n,
                                                   const unsigned int v) const;

  virtual std::pair<unsigned short int, unsigned short int>
  second_order_child_vertex (const unsigned int n) const;

  static const unsigned int side_nodes_map[5][9];

  static const unsigned int edge_nodes_map[9][3];



protected:

  Node* _nodelinks_data[18];



#ifdef LIBMESH_ENABLE_AMR

  float embedding_matrix (const unsigned int i,
                          const unsigned int j,
                          const unsigned int k) const
  { return _embedding_matrix[i][j][k]; }

  static const float _embedding_matrix[8][18][18];

#endif

  static const unsigned short int _remaining_second_order_adjacent_vertices[3][4];

};



// ------------------------------------------------------------
// Prism18 class member functions
inline
Prism18::Prism18(Elem* p) :
  Prism(Prism18::n_nodes(), p, _nodelinks_data)
{
}


} // namespace libMesh

#endif // LIBMESH_CELL_PRISM18_H