20#ifndef LIBMESH_FACE_TRI7_H
21#define LIBMESH_FACE_TRI7_H
24#include "libmesh/libmesh_common.h"
25#include "libmesh/face_tri.h"
26#include "libmesh/face_tri3.h"
27#include "libmesh/fe_reference_element_traits.h"
93 virtual unsigned int n_sub_elem()
const override {
return 4; }
98 virtual bool is_vertex(
const unsigned int i)
const override;
103 virtual bool is_edge(
const unsigned int i)
const override;
108 virtual bool is_face(
const unsigned int i)
const override;
115 const unsigned int s)
const override;
117 virtual std::vector<unsigned int>
nodes_on_side(
const unsigned int s)
const override;
119 virtual std::vector<unsigned int>
nodes_on_edge(
const unsigned int e)
const override;
126 const unsigned int e)
const override
164 unsigned int side_node)
const override;
166 virtual std::unique_ptr<Elem>
build_side_ptr (
const unsigned int i)
override;
172 const unsigned int i)
override;
179 std::vector<dof_id_type> & conn)
const override;
193 const unsigned int v)
const override;
200 virtual std::pair<unsigned short int, unsigned short int>
224 virtual void permute(
unsigned int perm_num)
override final;
228#ifdef LIBMESH_ENABLE_AMR
230 const std::vector<std::pair<unsigned char, unsigned char>> &
232 unsigned int n)
const override
249#ifdef LIBMESH_ENABLE_AMR
255 const unsigned int j,
256 const unsigned int k)
const override
269 static const std::vector<std::pair<unsigned char, unsigned char>>
void ErrorVector unsigned int
The BoundaryInfo class contains information relevant to boundary conditions including storing faces,...
Defines a Cartesian bounding box by the two corner extremum.
This is the base class from which all geometric element types are derived.
virtual dof_id_type key(const unsigned int s) const =0
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i)=0
A Node is like a Point, but with more information.
The Tri7 is an element in 2D composed of 7 nodes.
virtual Order default_order() const override
virtual void connectivity(const unsigned int sf, const IOPackage iop, std::vector< dof_id_type > &conn) const override
static constexpr const unsigned int(& side_nodes_map)[num_sides][nodes_per_side]
virtual Order default_side_order() const override
ElemType side_type(const unsigned int s) const override final
virtual std::pair< unsigned short int, unsigned short int > second_order_child_vertex(const unsigned int n) const override
virtual unsigned int local_side_node(unsigned int side, unsigned int side_node) const override
virtual BoundingBox loose_bounding_box() const override
virtual bool has_affine_map() const override
virtual void flip(BoundaryInfo *) override final
Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sig...
virtual std::vector< unsigned int > nodes_on_side(const unsigned int s) const override
virtual const std::vector< std::pair< unsigned char, unsigned char > > & parent_bracketing_nodes(unsigned int c, unsigned int n) const override
virtual bool is_node_on_edge(const unsigned int n, const unsigned int e) const override
virtual bool is_edge(const unsigned int i) const override
virtual unsigned int n_nodes() const override
virtual bool is_face(const unsigned int i) const override
virtual std::unique_ptr< Elem > build_side_ptr(const unsigned int i) override
static const int nodes_per_side
virtual bool is_node_on_side(const unsigned int n, const unsigned int s) const override
unsigned int center_node_on_side(const unsigned short side) const override final
Tri7(Elem *p=nullptr)
Constructor.
Node * _nodelinks_data[num_nodes]
Data for links to nodes.
virtual std::vector< unsigned int > nodes_on_edge(const unsigned int e) const override
virtual unsigned int n_second_order_adjacent_vertices(const unsigned int) const override
Tri7 & operator=(const Tri7 &)=delete
LIBMESH_ENABLE_TOPOLOGY_CACHES
virtual dof_id_type key() const
Don't hide Elem::key() defined in the base class.
virtual void permute(unsigned int perm_num) override final
Permutes the element (by swapping node and neighbor pointers) according to the specified index.
static const int num_nodes
Geometric constants for Tri7.
virtual unsigned int n_sub_elem() const override
static const unsigned short int _second_order_adjacent_vertices[num_sides][2]
Matrix that tells which vertices define the location of mid-side (or second-order) nodes.
static constexpr NodeMapTable< num_sides, nodes_per_side > _side_nodes
This maps the node of the side to element node numbers.
static const std::vector< std::pair< unsigned char, unsigned char > > _parent_bracketing_nodes[num_children][num_nodes]
Pairs of nodes that bracket child nodes when doing mesh refinement.
Tri7(const Tri7 &)=delete
virtual unsigned short int second_order_adjacent_vertex(const unsigned int n, const unsigned int v) const override
static const unsigned short int _second_order_vertex_child_number[num_nodes]
Vector that names a child sharing each second order node.
virtual ElemType type() const override
static const unsigned short int _second_order_vertex_child_index[num_nodes]
Vector that names the child vertex index for each second order node.
static const Real _embedding_matrix[num_children][num_nodes][num_nodes]
Matrix that computes new nodal locations/solution values from current nodes/solution.
virtual bool is_vertex(const unsigned int i) const override
virtual Real embedding_matrix(const unsigned int i, const unsigned int j, const unsigned int k) const override
Matrix used to create the elements children.
The Tri is an element in 2D composed of 3 sides.
static const int num_children
static const int num_sides
Geometric constants for all Tris.
The libMesh namespace provides an interface to certain functionality in the library.
IOPackage
libMesh interfaces with several different software packages for the purposes of creating,...
ElemType
Defines an enum for geometric element types.
DIE A HORRIBLE DEATH HERE typedef LIBMESH_DEFAULT_SCALAR_TYPE Real
A fixed-size table that constexpr functions can return.
unsigned int values[Rows][Cols]