cell_inf_prism12.h
Go to the documentation of this file.
1 // The libMesh Finite Element Library.
2 // Copyright (C) 2002-2018 Benjamin S. Kirk, John W. Peterson, Roy H. Stogner
3 
4 // This library is free software; you can redistribute it and/or
5 // modify it under the terms of the GNU Lesser General Public
6 // License as published by the Free Software Foundation; either
7 // version 2.1 of the License, or (at your option) any later version.
8 
9 // This library is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // Lesser General Public License for more details.
13 
14 // You should have received a copy of the GNU Lesser General Public
15 // License along with this library; if not, write to the Free Software
16 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 
18 
19 
20 #ifndef LIBMESH_CELL_INF_PRISM12_H
21 #define LIBMESH_CELL_INF_PRISM12_H
22 
23 #include "libmesh/libmesh_config.h"
24 
25 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
26 
27 // Local includes
28 #include "libmesh/cell_inf_prism.h"
29 
30 namespace libMesh
31 {
32 
61 class InfPrism12 final : public InfPrism
62 {
63 public:
64 
68  explicit
69  InfPrism12 (Elem * p=nullptr) :
71  {}
72 
73  InfPrism12 (InfPrism12 &&) = delete;
74  InfPrism12 (const InfPrism12 &) = delete;
75  InfPrism12 & operator= (const InfPrism12 &) = delete;
76  InfPrism12 & operator= (InfPrism12 &&) = delete;
77  virtual ~InfPrism12() = default;
78 
82  virtual unsigned int n_nodes() const override { return num_nodes; }
83 
87  virtual ElemType type () const override { return INFPRISM12; }
88 
92  virtual unsigned int n_sub_elem() const override { return 4; }
93 
97  virtual bool is_vertex(const unsigned int i) const override;
98 
102  virtual bool is_edge(const unsigned int i) const override;
103 
107  virtual bool is_face(const unsigned int i) const override;
108 
113  virtual bool is_node_on_side(const unsigned int n,
114  const unsigned int s) const override;
115 
116  virtual std::vector<unsigned int> nodes_on_side(const unsigned int s) const override;
117 
122  virtual bool is_node_on_edge(const unsigned int n,
123  const unsigned int e) const override;
124 
128  virtual Order default_order() const override;
129 
133  virtual unsigned int which_node_am_i(unsigned int side,
134  unsigned int side_node) const override;
135 
142  virtual std::unique_ptr<Elem> build_side_ptr (const unsigned int i,
143  bool proxy) override;
144 
149  virtual void build_side_ptr (std::unique_ptr<Elem> & elem,
150  const unsigned int i) override;
151 
158  virtual std::unique_ptr<Elem> build_edge_ptr (const unsigned int i) override;
159 
160  virtual void connectivity(const unsigned int sc,
161  const IOPackage iop,
162  std::vector<dof_id_type> & conn) const override;
163 
167  virtual unsigned int n_second_order_adjacent_vertices (const unsigned int) const override
168  { return 2; }
169 
176  virtual unsigned short int second_order_adjacent_vertex (const unsigned int n,
177  const unsigned int v) const override;
178 
184  virtual std::pair<unsigned short int, unsigned short int>
185  second_order_child_vertex (const unsigned int n) const override;
186 
190  static const int num_nodes = 12;
191  static const int num_sides = 4;
192  static const int num_edges = 6;
193  static const int num_children = 4;
194  static const int nodes_per_side = 6;
195  static const int nodes_per_edge = 3;
196 
201  static const unsigned int side_nodes_map[num_sides][nodes_per_side];
202 
207  static const unsigned int edge_nodes_map[num_edges][nodes_per_edge];
208 
209 
210 
211 protected:
212 
217 
218 
219 #ifdef LIBMESH_ENABLE_AMR
220 
224  virtual float embedding_matrix (const unsigned int i,
225  const unsigned int j,
226  const unsigned int k) const override
227  { return _embedding_matrix[i][j][k]; }
228 
234 
236 
237 #endif // LIBMESH_ENABLE_AMR
238 
239 
240 private:
241 
246  static const unsigned short int _second_order_adjacent_vertices[num_edges][2];
247 
251  static const unsigned short int _second_order_vertex_child_number[num_nodes];
252 
256  static const unsigned short int _second_order_vertex_child_index[num_nodes];
257 };
258 
259 } // namespace libMesh
260 
261 #endif // ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
262 
263 #endif // LIBMESH_CELL_INF_PRISM12_H
static const int num_edges
The base class for all 3D infinite prismatic element types.
A geometric point in (x,y,z) space associated with a DOF.
Definition: node.h:52
virtual float embedding_matrix(const unsigned int i, const unsigned int j, const unsigned int k) const override
virtual ~InfPrism12()=default
virtual bool is_edge(const unsigned int i) const override
static const unsigned int edge_nodes_map[num_edges][nodes_per_edge]
static const float _embedding_matrix[num_children][num_nodes][num_nodes]
virtual unsigned short int second_order_adjacent_vertex(const unsigned int n, const unsigned int v) const override
virtual ElemType type() const override
The base class for all geometric element types.
Definition: elem.h:100
virtual unsigned int n_nodes() const override
virtual unsigned int n_sub_elem() const override
static const unsigned short int _second_order_adjacent_vertices[num_edges][2]
virtual void connectivity(const unsigned int sc, const IOPackage iop, std::vector< dof_id_type > &conn) const override
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i, bool proxy) override
virtual bool is_vertex(const unsigned int i) const override
static const int nodes_per_edge
virtual std::unique_ptr< Elem > build_edge_ptr(const unsigned int i) override
InfPrism12(Elem *p=nullptr)
A 3D infinite prismatic element with 12 nodes.
static const unsigned short int _second_order_vertex_child_index[num_nodes]
virtual Order default_order() const override
Node * _nodelinks_data[num_nodes]
static const int num_children
static const unsigned short int _second_order_vertex_child_number[num_nodes]
virtual unsigned int n_second_order_adjacent_vertices(const unsigned int) const override
virtual std::vector< unsigned int > nodes_on_side(const unsigned int s) const override
static const int num_sides
virtual bool is_node_on_edge(const unsigned int n, const unsigned int e) const override
static const int nodes_per_side
virtual std::pair< unsigned short int, unsigned short int > second_order_child_vertex(const unsigned int n) const override
virtual unsigned int which_node_am_i(unsigned int side, unsigned int side_node) const override
static const int num_nodes
static const unsigned int side_nodes_map[num_sides][nodes_per_side]
InfPrism12 & operator=(const InfPrism12 &)=delete
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
std::unique_ptr< Elem > side(const unsigned int i) const
Definition: elem.h:2202