cell_prism20.h

Go to the documentation of this file.

// The libMesh Finite Element Library.
// Copyright (C) 2002-2026 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_PRISM20_H
#define LIBMESH_CELL_PRISM20_H
 
// Local includes
#include "libmesh/cell_prism.h"
#include "libmesh/cell_prism6.h"
#include "libmesh/fe_reference_element_traits.h"
 
namespace libMesh
{
 
class Prism20 final : public Prism
{
public:
 
  explicit
  Prism20 (Elem * p=nullptr) :
    Prism(num_nodes, p, _nodelinks_data)
  {}
 
  Prism20 (Prism20 &&) = delete;
  Prism20 (const Prism20 &) = delete;
  Prism20 & operator= (const Prism20 &) = delete;
  Prism20 & operator= (Prism20 &&) = delete;
  virtual ~Prism20() = default;
 
  virtual ElemType type () const override { return PRISM20; }
 
  virtual unsigned int n_nodes() const override { return num_nodes; }
 
  virtual unsigned int n_sub_elem() const override { return 8; }
 
  virtual bool is_vertex(const unsigned int i) const override;
 
  virtual bool is_edge(const unsigned int i) const override;
 
  virtual bool is_face(const unsigned int i) const override;
 
  virtual bool is_node_on_side(const unsigned int n,
                               const unsigned int s) const override;
 
  virtual std::vector<unsigned int> nodes_on_side(const unsigned int s) const override;
 
  virtual std::vector<unsigned int> nodes_on_edge(const unsigned int e) const override;
 
  virtual bool is_node_on_edge(const unsigned int n,
                               const unsigned int e) const override;
 
  virtual bool has_affine_map () const override;
 
  virtual Order default_order() const override;
 
  using Elem::key;
 
  virtual dof_id_type key (const unsigned int s) const override;
 
  virtual unsigned int local_side_node(unsigned int side,
                                       unsigned int side_node) const override;
 
  virtual unsigned int local_edge_node(unsigned int edge,
                                       unsigned int edge_node) const override;
 
  virtual std::unique_ptr<Elem> build_side_ptr (const unsigned int i) override;
 
  virtual void build_side_ptr (std::unique_ptr<Elem> & elem,
                               const unsigned int i) override;
 
  // Avoid hiding deprecated version with different signature
  using Elem::build_side_ptr;
 
  virtual std::unique_ptr<Elem> build_edge_ptr (const unsigned int i) override;
 
  virtual void build_edge_ptr (std::unique_ptr<Elem> & edge, const unsigned int i) override;
 
  virtual void connectivity(const unsigned int sc,
                            const IOPackage iop,
                            std::vector<dof_id_type> & conn) const override;
 
  virtual unsigned int n_second_order_adjacent_vertices (const unsigned int) const override;
 
  virtual unsigned short int second_order_adjacent_vertex (const unsigned int n,
                                                           const unsigned int v) const override;
 
  virtual std::pair<unsigned short int, unsigned short int>
  second_order_child_vertex (const unsigned int n) const override;
 
  static const int num_nodes = 20;
  static const int nodes_per_side = 9;
  static const int nodes_per_edge = 3;
 
  static constexpr NodeMapTable<num_edges, nodes_per_edge>
  _edge_nodes = derived_edge_nodes<Prism6, num_edges>();
  static constexpr const unsigned int (&edge_nodes_map)[num_edges][nodes_per_edge] = _edge_nodes.values;
 
  static constexpr NodeMapTable<num_sides, nodes_per_side>
  _side_nodes = derived_side_nodes<Prism6, num_sides, nodes_per_side>
    (_edge_nodes.values, [](unsigned int s) { return s == 0 ? 18u : s == 4 ? 19u : 14 + s; });
  static constexpr const unsigned int (&side_nodes_map)[num_sides][nodes_per_side] = _side_nodes.values;
 
  virtual void permute(unsigned int perm_num) override final;
 
  virtual void flip(BoundaryInfo *) override final;
 
#ifdef LIBMESH_ENABLE_AMR
  virtual
  const std::vector<std::pair<unsigned char, unsigned char>> &
  parent_bracketing_nodes(unsigned int,
                          unsigned int) const override
  {
    // We can't get any good bracketing nodes for child tri-center
    // nodes on the parent prism midplane.  No refining Prism20 for
    // us.
    libmesh_not_implemented_msg("Prism20 cannot be refined; use Prism21 instead.");
  }
#endif
 
  unsigned int center_node_on_side(const unsigned short side) const override final;
 
  ElemType side_type (const unsigned int s) const override final;
 
protected:
 
  Node * _nodelinks_data[num_nodes];
 
 
 
#ifdef LIBMESH_ENABLE_AMR
 
  virtual Real embedding_matrix (const unsigned int,
                                 const unsigned int,
                                 const unsigned int) const override
  {
    // We can't get any good bracketing nodes for child tri-center
    // nodes on the parent prism midplane, so we can't auto-calculate
    // embedding matrices and couldn't use them if we did.
    libmesh_not_implemented_msg("Prism20 cannot be refined; use Prism21 instead.");
    return 0;
  }
 
  LIBMESH_ENABLE_TOPOLOGY_CACHES;
 
#endif // LIBMESH_ENABLE_AMR
 
  static const unsigned short int _remaining_second_order_adjacent_vertices[5][4];
};
 
} // namespace libMesh
 
#endif // LIBMESH_CELL_PRISM20_H