The Hex20 is an element in 3D composed of 20 nodes. More...

#include <cell_hex20.h>

Inheritance diagram for libMesh::Hex20:

Public Types
enum	RefinementState { COARSEN = 0, DO_NOTHING, REFINE, JUST_REFINED, JUST_COARSENED, INACTIVE, COARSEN_INACTIVE, INVALID_REFINEMENTSTATE }
	Enumeration of possible element refinement states. More...

typedef Elem const	NeighborPtrIter
	Nested "classes" for use iterating over all neighbors of an element. More...

typedef const Elem const	ConstNeighborPtrIter

typedef Predicates::multi_predicate	Predicate
	Useful iterator typedefs. More...

Public Member Functions
	Hex20 (Elem *p=nullptr)
	Constructor. More...

	Hex20 (Hex20 &&)=delete

	Hex20 (const Hex20 &)=delete

Hex20 &	operator= (const Hex20 &)=delete

Hex20 &	operator= (Hex20 &&)=delete

virtual	~Hex20 ()=default

virtual ElemType	type () const override

virtual unsigned int	n_nodes () const override

virtual unsigned int	n_sub_elem () const override

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

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, bool proxy=false) override
	Builds a `QUAD8` built coincident with face i. More...

virtual void	build_side_ptr (std::unique_ptr< Elem > &elem, const unsigned int i) override
	Rebuilds a `QUAD8` built coincident with face i. More...

virtual std::unique_ptr< Elem >	build_edge_ptr (const unsigned int i) override
	Builds a `EDGE3` built coincident with edge i. More...

virtual void	build_edge_ptr (std::unique_ptr< Elem > &edge, const unsigned int i) override
	Rebuilds a `EDGE3` built coincident with edge i. More...

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

virtual Real	volume () const override
	A specialization for computing the volume of a Hex20. More...

virtual void	permute (unsigned int perm_num) override final
	Permutes the element (by swapping node and neighbor pointers) according to the specified index. More...

virtual void	flip (BoundaryInfo *) override final
	Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sign. More...

ElemType	side_type (const unsigned int s) const override final

virtual Point	master_point (const unsigned int i) const override final

virtual unsigned int	n_sides () const override final

virtual unsigned int	n_vertices () const override final

virtual unsigned int	n_edges () const override final

virtual unsigned int	n_faces () const override final

virtual unsigned int	n_children () const override final

virtual bool	is_child_on_side (const unsigned int c, const unsigned int s) const override final

virtual bool	is_edge_on_side (const unsigned int e, const unsigned int s) const override final

virtual unsigned int	opposite_side (const unsigned int s) const override final

virtual unsigned int	opposite_node (const unsigned int n, const unsigned int s) const override final

virtual dof_id_type	key (const unsigned int s) const override

virtual dof_id_type	key (const unsigned int s) const=0
	Don't hide Elem::key() defined in the base class. More...

virtual dof_id_type	key () const
	Don't hide Elem::key() defined in the base class. More...

virtual dof_id_type	key () const

virtual dof_id_type	low_order_key (const unsigned int s) const override

virtual std::unique_ptr< Elem >	side_ptr (const unsigned int i) override final

virtual void	side_ptr (std::unique_ptr< Elem > &side, const unsigned int i) override final
	Rebuilds a primitive (4-noded) quad for face i. More...

std::unique_ptr< const Elem >	side_ptr (unsigned int i) const

void	side_ptr (std::unique_ptr< const Elem > &side, const unsigned int i) const

virtual Real	quality (const ElemQuality q) const override

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

virtual std::vector< unsigned int >	sides_on_edge (const unsigned int e) const override final

virtual unsigned int	n_permutations () const override final
	Six sides, four orientations per side. More...

virtual bool	is_flipped () const override final

virtual std::vector< unsigned int >	edges_adjacent_to_node (const unsigned int n) const override

virtual bool	on_reference_element (const Point &p, const Real eps=TOLERANCE) const override final

virtual unsigned short	dim () const override

virtual BoundingBox	loose_bounding_box () const override

virtual bool	infinite () const override

const Point &	point (const unsigned int i) const

Point &	point (const unsigned int i)

dof_id_type	node_id (const unsigned int i) const

unsigned int	local_node (const dof_id_type i) const

unsigned int	get_node_index (const Node *node_ptr) const

const Node const	get_nodes () const

const Node *	node_ptr (const unsigned int i) const

Node *	node_ptr (const unsigned int i)

const Node &	node_ref (const unsigned int i) const

Node &	node_ref (const unsigned int i)

virtual Node *&	set_node (const unsigned int i)

SimpleRange< NodeRefIter >	node_ref_range ()
	Returns a range with all nodes of an element, usable in range-based for loops. More...

SimpleRange< ConstNodeRefIter >	node_ref_range () const

subdomain_id_type	subdomain_id () const

subdomain_id_type &	subdomain_id ()

virtual bool	runtime_topology () const

const Elem *	reference_elem () const

bool	operator== (const Elem &rhs) const

bool	topologically_equal (const Elem &rhs) const

const Elem *	neighbor_ptr (unsigned int i) const

Elem *	neighbor_ptr (unsigned int i)

SimpleRange< NeighborPtrIter >	neighbor_ptr_range ()
	Returns a range with all neighbors of an element, usable in range-based for loops. More...

SimpleRange< ConstNeighborPtrIter >	neighbor_ptr_range () const

const Elem *	topological_neighbor (const unsigned int i, const MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries *pb) const

Elem *	topological_neighbor (const unsigned int i, MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries *pb)

bool	has_topological_neighbor (const Elem elem, const MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries pb) const

void	set_neighbor (const unsigned int i, Elem *n)
	Assigns `n` as the $i^{th}$ neighbor. More...

bool	has_neighbor (const Elem *elem) const

Elem *	child_neighbor (Elem *elem)

const Elem *	child_neighbor (const Elem *elem) const

bool	on_boundary () const

bool	is_semilocal (const processor_id_type my_pid) const

unsigned int	which_neighbor_am_i (const Elem *e) const
	This function tells you which neighbor `e` is. More...

unsigned int	which_side_am_i (const Elem *e) const
	This function tells you which side the boundary element `e` is. More...

unsigned int	which_node_am_i (unsigned int side, unsigned int side_node) const
	This function is deprecated, call local_side_node(side, side_node) instead. More...

bool	contains_vertex_of (const Elem *e, bool mesh_connection=false) const

bool	contains_edge_of (const Elem *e) const

void	find_point_neighbors (const Point &p, std::set< const Elem *> &neighbor_set) const
	This function finds all active elements (including this one) which are in the same manifold as this element and which touch the current active element at the specified point, which should be a point in the current element. More...

void	find_point_neighbors (std::set< const Elem *> &neighbor_set) const
	This function finds all active elements (including this one) in the same manifold as this element which touch this active element at any point. More...

void	find_point_neighbors (std::set< const Elem > &neighbor_set, const Elem start_elem) const
	This function finds all active elements (including this one) in the same manifold as start_elem (which must be active and must touch this element) which touch this element at any point. More...

void	find_point_neighbors (std::set< Elem > &neighbor_set, Elem start_elem)
	Non-const version of function above. More...

void	find_edge_neighbors (const Point &p1, const Point &p2, std::set< const Elem *> &neighbor_set) const
	This function finds all active elements in the same manifold as this element which touch the current active element along the whole edge defined by the two points `p1` and `p2`. More...

void	find_edge_neighbors (std::set< const Elem *> &neighbor_set) const
	This function finds all active elements in the same manifold as this element which touch the current active element along any edge (more precisely, at at least two points). More...

void	find_interior_neighbors (std::set< const Elem *> &neighbor_set) const
	This function finds all active elements (not including this one) in the parent manifold of this element whose intersection with this element has non-zero measure. More...

void	find_interior_neighbors (std::set< Elem *> &neighbor_set)
	Non-const version of function above that fills up a vector of non-const Elem pointers instead. More...

void	remove_links_to_me ()
	Resets this element's neighbors' appropriate neighbor pointers and its parent's and children's appropriate pointers to point to null instead of to this. More...

void	make_links_to_me_remote ()
	Resets this element's neighbors' appropriate neighbor pointers and its parent's and children's appropriate pointers to point to the global remote_elem instead of this. More...

void	make_links_to_me_local (unsigned int n, unsigned int neighbor_side)
	Resets the `neighbor_side` pointers of our nth neighbor (and its descendants, if appropriate) to point to this Elem instead of to the global remote_elem. More...

virtual bool	is_remote () const

void	write_connectivity (std::ostream &out, const IOPackage iop) const
	Writes the element connectivity for various IO packages to the passed ostream "out". More...

IntRange< unsigned short >	node_index_range () const

virtual unsigned int	n_nodes_in_child (unsigned int) const

IntRange< unsigned short >	side_index_range () const

unsigned int	n_neighbors () const

IntRange< unsigned short >	edge_index_range () const

virtual bool	is_vertex_on_child (unsigned int, unsigned int n) const

virtual bool	is_vertex_on_parent (unsigned int c, unsigned int n) const

bool	is_internal (const unsigned int i) const

std::unique_ptr< const Elem >	build_side_ptr (const unsigned int i, bool proxy=false) const

void	build_side_ptr (std::unique_ptr< const Elem > &side, const unsigned int i) const

std::unique_ptr< const Elem >	build_edge_ptr (const unsigned int i) const

void	build_edge_ptr (std::unique_ptr< const Elem > &edge, const unsigned int i) const

virtual Order	supported_nodal_order () const

virtual Order	default_side_order () const

virtual Point	centroid () const
	Calls Elem::vertex_average() for backwards compatibility. More...

virtual Point	true_centroid () const

Point	vertex_average () const

virtual Point	quasicircumcenter () const

virtual Real	hmin () const

virtual Real	hmax () const

virtual bool	contains_point (const Point &p, Real tol=TOLERANCE) const

virtual bool	close_to_point (const Point &p, Real tol) const

bool	positive_edge_orientation (const unsigned int i) const

bool	positive_face_orientation (const unsigned int i) const

virtual bool	has_invertible_map (Real tol=TOLERANCE *TOLERANCE) const

virtual bool	is_linear () const

void	print_info (std::ostream &os=libMesh::out) const
	Prints relevant information about the element. More...

std::string	get_info () const
	Prints relevant information about the element to a string. More...

bool	active () const

bool	ancestor () const

bool	subactive () const

bool	has_children () const

bool	has_ancestor_children () const

bool	is_ancestor_of (const Elem *descendant) const

const Elem *	parent () const

Elem *	parent ()

void	set_parent (Elem *p)
	Sets the pointer to the element's parent. More...

const Elem *	top_parent () const

const Elem *	interior_parent () const

Elem *	interior_parent ()

void	set_interior_parent (Elem *p)
	Sets the pointer to the element's interior_parent. More...

Real	length (const unsigned int n1, const unsigned int n2) const

unsigned int	level () const

unsigned int	p_level () const

ElemMappingType	mapping_type () const

void	set_mapping_type (const ElemMappingType type)
	Sets the value of the mapping type for the element. More...

unsigned char	mapping_data () const

void	set_mapping_data (const unsigned char data)
	Sets the value of the mapping data for the element. More...

const Elem *	raw_child_ptr (unsigned int i) const

const Elem *	child_ptr (unsigned int i) const

Elem *	child_ptr (unsigned int i)

SimpleRange< ChildRefIter >	child_ref_range ()
	Returns a range with all children of a parent element, usable in range-based for loops. More...

SimpleRange< ConstChildRefIter >	child_ref_range () const

unsigned int	which_child_am_i (const Elem *e) const

virtual bool	is_child_on_edge (const unsigned int c, const unsigned int e) const

void	add_child (Elem *elem)
	Adds a child pointer to the array of children of this element. More...

void	add_child (Elem *elem, unsigned int c)
	Adds a new child pointer to the specified index in the array of children of this element. More...

void	replace_child (Elem *elem, unsigned int c)
	Replaces the child pointer at the specified index in the child array. More...

void	family_tree (std::vector< const Elem *> &family, bool reset=true) const
	Fills the vector `family` with the children of this element, recursively. More...

void	family_tree (std::vector< Elem *> &family, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	total_family_tree (std::vector< const Elem *> &family, bool reset=true) const
	Same as the `family_tree()` member, but also adds any subactive descendants. More...

void	total_family_tree (std::vector< Elem *> &family, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	active_family_tree (std::vector< const Elem *> &active_family, bool reset=true) const
	Same as the `family_tree()` member, but only adds the active children. More...

void	active_family_tree (std::vector< Elem *> &active_family, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	family_tree_by_side (std::vector< const Elem *> &family, unsigned int side, bool reset=true) const
	Same as the `family_tree()` member, but only adds elements which are next to `side`. More...

void	family_tree_by_side (std::vector< Elem *> &family, unsigned int side, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	active_family_tree_by_side (std::vector< const Elem *> &family, unsigned int side, bool reset=true) const
	Same as the `active_family_tree()` member, but only adds elements which are next to `side`. More...

void	active_family_tree_by_side (std::vector< Elem *> &family, unsigned int side, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	family_tree_by_neighbor (std::vector< const Elem > &family, const Elem neighbor, bool reset=true) const
	Same as the `family_tree()` member, but only adds elements which are next to `neighbor`. More...

void	family_tree_by_neighbor (std::vector< Elem > &family, Elem neighbor, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	total_family_tree_by_neighbor (std::vector< const Elem > &family, const Elem neighbor, bool reset=true) const
	Same as the `family_tree_by_neighbor()` member, but also adds any subactive descendants. More...

void	total_family_tree_by_neighbor (std::vector< Elem > &family, Elem neighbor, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	family_tree_by_subneighbor (std::vector< const Elem > &family, const Elem neighbor, const Elem *subneighbor, bool reset=true) const
	Same as the `family_tree()` member, but only adds elements which are next to `subneighbor`. More...

void	family_tree_by_subneighbor (std::vector< Elem > &family, Elem neighbor, Elem *subneighbor, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	total_family_tree_by_subneighbor (std::vector< const Elem > &family, const Elem neighbor, const Elem *subneighbor, bool reset=true) const
	Same as the `family_tree_by_subneighbor()` member, but also adds any subactive descendants. More...

void	total_family_tree_by_subneighbor (std::vector< Elem > &family, Elem neighbor, Elem *subneighbor, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	active_family_tree_by_neighbor (std::vector< const Elem > &family, const Elem neighbor, bool reset=true) const
	Same as the `active_family_tree()` member, but only adds elements which are next to `neighbor`. More...

void	active_family_tree_by_neighbor (std::vector< Elem > &family, Elem neighbor, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

void	active_family_tree_by_topological_neighbor (std::vector< const Elem > &family, const Elem neighbor, const MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries *pb, bool reset=true) const
	Same as the `active_family_tree_by_neighbor()` member, but the `neighbor` here may be a topological (e.g. More...

void	active_family_tree_by_topological_neighbor (std::vector< Elem > &family, Elem neighbor, const MeshBase &mesh, const PointLocatorBase &point_locator, const PeriodicBoundaries *pb, bool reset=true)
	Non-const version of function above; fills a vector of non-const pointers. More...

RefinementState	refinement_flag () const

void	set_refinement_flag (const RefinementState rflag)
	Sets the value of the refinement flag for the element. More...

RefinementState	p_refinement_flag () const

void	set_p_refinement_flag (const RefinementState pflag)
	Sets the value of the p-refinement flag for the element. More...

unsigned int	max_descendant_p_level () const

unsigned int	min_p_level_by_neighbor (const Elem *neighbor, unsigned int current_min) const

unsigned int	min_new_p_level_by_neighbor (const Elem *neighbor, unsigned int current_min) const

void	set_p_level (const unsigned int p)
	Sets the value of the p-refinement level for the element. More...

void	hack_p_level (const unsigned int p)
	Sets the value of the p-refinement level for the element without altering the p-level of its ancestors. More...

void	hack_p_level_and_refinement_flag (const unsigned int p, RefinementState pflag)
	Sets the value of the p-refinement level for the element without altering the p-level of its ancestors; also sets the p_refinement_flag, simultaneously so that they can be safely checked for mutual consistency. More...

virtual void	refine (MeshRefinement &mesh_refinement)
	Refine the element. More...

void	coarsen ()
	Coarsen the element. More...

void	contract ()
	Contract an active element, i.e. More...

void	libmesh_assert_valid_neighbors () const
	Checks for consistent neighbor links on this element. More...

void	libmesh_assert_valid_node_pointers () const
	Checks for a valid id and pointers to nodes with valid ids on this element. More...

virtual unsigned int	local_singular_node (const Point &, const Real=TOLERANCE *TOLERANCE) const

virtual bool	is_singular_node (unsigned int) const

virtual unsigned int	center_node_on_side (const unsigned short side) const

side_iterator	boundary_sides_begin ()
	Iterator accessor functions. More...

side_iterator	boundary_sides_end ()

virtual bool	is_mid_infinite_edge_node (const unsigned int) const

virtual Point	origin () const

virtual std::unique_ptr< Elem >	disconnected_clone () const

void	orient (BoundaryInfo *boundary_info)
	Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sign, iff we find a negative orientation. More...

virtual unsigned int	as_parent_node (unsigned int c, unsigned int n) const

virtual const std::vector< std::pair< unsigned char, unsigned char > > &	parent_bracketing_nodes (unsigned int c, unsigned int n) const

virtual const std::vector< std::pair< dof_id_type, dof_id_type > >	bracketing_nodes (unsigned int c, unsigned int n) const

virtual unsigned int	embedding_matrix_version () const

void	nullify_neighbors ()
	Replaces this element with `nullptr` for all of its neighbors. More...

DofObject *	get_old_dof_object ()
	Pointer accessor for previously public old_dof_object. More...

const DofObject *	get_old_dof_object () const

DofObject &	get_old_dof_object_ref ()
	As above, but do not use in situations where the old_dof_object may be nullptr, since this function asserts that the old_dof_object is valid before returning a reference to it. More...

const DofObject &	get_old_dof_object_ref () const

void	clear_old_dof_object ()
	Sets the `old_dof_object` to nullptr. More...

void	set_old_dof_object ()
	Sets the `old_dof_object` to a copy of `this`. More...

void	clear_dofs ()
	Clear the `DofMap` data structures holding degree of freedom data. More...

void	invalidate_dofs (const unsigned int sys_num=libMesh::invalid_uint)
	Sets all degree of freedom numbers to `invalid_id`. More...

void	invalidate_id ()
	Sets the id to `invalid_id`. More...

void	invalidate_processor_id ()
	Sets the processor id to `invalid_processor_id`. More...

void	invalidate ()
	Invalidates all the indices for this `DofObject`. More...

unsigned int	n_dofs (const unsigned int s, const unsigned int var=libMesh::invalid_uint) const

dof_id_type	id () const

dof_id_type &	set_id ()

void	set_id (const dof_id_type dofid)
	Sets the `id` for this `DofObject`. More...

unique_id_type	unique_id () const

unique_id_type &	set_unique_id ()

void	set_unique_id (unique_id_type new_id)
	Sets the `unique_id` for this `DofObject`. More...

bool	valid_id () const

bool	valid_unique_id () const

processor_id_type	processor_id () const

processor_id_type &	processor_id ()

void	processor_id (const processor_id_type pid)
	Sets the `processor_id` for this `DofObject`. More...

bool	valid_processor_id () const

unsigned int	n_systems () const

unsigned int	n_pseudo_systems () const

void	set_n_systems (const unsigned int s)
	Sets the number of systems for this `DofObject`. More...

void	set_extra_integer (const unsigned int index, const dof_id_type value)
	Sets the value on this object of the extra integer associated with `index`, which should have been obtained via a call to `MeshBase::add_elem_integer` or `MeshBase::add_node_integer`. More...

dof_id_type	get_extra_integer (const unsigned int index) const
	Gets the value on this object of the extra integer associated with `index`, which should have been obtained via a call to `MeshBase::add_elem_integer` or `MeshBase::add_node_integer`. More...

template<typename T >
void	set_extra_datum (const unsigned int index, const T value)
	Sets the value on this object of the extra datum associated with `index`, which should have been obtained via a call to `MeshBase::add_elem_datum` or `MeshBase::add_node_datum` using the same type T. More...

template<typename T >
T	get_extra_datum (const unsigned int index) const
	Gets the value on this object of the extra datum associated with `index`, which should have been obtained via a call to `MeshBase::add_elem_datum` or `MeshBase::add_node_datum` using the same type T. More...

void	add_system ()
	Adds an additional system to the `DofObject`. More...

unsigned int	n_var_groups (const unsigned int s) const

unsigned int	n_vars (const unsigned int s, const unsigned int vg) const

unsigned int	n_vars (const unsigned int s) const

void	set_n_vars_per_group (const unsigned int s, const std::vector< unsigned int > &nvpg)
	Sets number of variables in each group associated with system `s` for this `DofObject`. More...

unsigned int	n_comp (const unsigned int s, const unsigned int var) const

unsigned int	n_comp_group (const unsigned int s, const unsigned int vg) const

void	set_n_comp (const unsigned int s, const unsigned int var, const unsigned int ncomp)
	Sets the number of components for `Variable` `var` of system `s` associated with this `DofObject`. More...

void	set_n_comp_group (const unsigned int s, const unsigned int vg, const unsigned int ncomp)
	Sets the number of components for `VariableGroup` `vg` of system `s` associated with this `DofObject`. More...

dof_id_type	dof_number (const unsigned int s, const unsigned int var, const unsigned int comp) const

dof_id_type	dof_number (const unsigned int s, const unsigned int vg, const unsigned int vig, const unsigned int comp, const unsigned int n_comp) const

std::pair< unsigned int, unsigned int >	var_to_vg_and_offset (const unsigned int s, const unsigned int var) const

void	set_dof_number (const unsigned int s, const unsigned int var, const unsigned int comp, const dof_id_type dn)
	Sets the global degree of freedom number for variable `var`, component `comp` for system `s` associated with this `DofObject`. More...

bool	has_dofs (const unsigned int s=libMesh::invalid_uint) const

void	set_vg_dof_base (const unsigned int s, const unsigned int vg, const dof_id_type db)
	`VariableGroup` DoF indices are indexed as id = base + var_in_vg*ncomp + comp This method allows for direct access to the base. More...

dof_id_type	vg_dof_base (const unsigned int s, const unsigned int vg) const
	`VariableGroup` DoF indices are indexed as id = base + var_in_vg*ncomp + comp This method allows for direct access to the base. More...

void	add_extra_integers (const unsigned int n_integers)
	Assigns a set of extra integers to this `DofObject`. More...

void	add_extra_integers (const unsigned int n_integers, const std::vector< dof_id_type > &default_values)
	Assigns a set of extra integers to this `DofObject`. More...

unsigned int	n_extra_integers () const
	Returns how many extra integers are associated to the `DofObject`. More...

bool	has_extra_integers () const
	Returns whether extra integers are associated to the `DofObject`. More...

unsigned int	packed_indexing_size () const
	If we pack our indices into an buffer for communications, how many ints do we need? More...

void	unpack_indexing (std::vector< largest_id_type >::const_iterator begin)
	A method for creating our index buffer from packed data - basically with our current implementation we investigate the size term and then copy. More...

void	pack_indexing (std::back_insert_iterator< std::vector< largest_id_type >> target) const
	A method for creating packed data from our index buffer - basically a copy with prepended size with our current implementation. More...

void	debug_buffer () const
	Print our buffer for debugging. More...

void	print_dof_info () const
	Print out info for debugging. More...

void	set_buffer (const std::vector< dof_id_type > &buf)

Static Public Member Functions
static constexpr bool	infinite ()

static void	print_info (std::ostream &out_stream=libMesh::out)
	Prints the reference information, by default to `libMesh::out`. More...

static void	print_info (std::ostream &out_stream=libMesh::out)
	Prints the reference information, by default to `libMesh::out`. More...

static std::string	get_info ()
	Gets a string containing the reference information. More...

static std::string	get_info ()
	Gets a string containing the reference information. More...

static ElemType	second_order_equivalent_type (const ElemType et, const bool full_ordered=true)

static ElemType	first_order_equivalent_type (const ElemType et)

static ElemType	complete_order_equivalent_type (const ElemType et)

static std::unique_ptr< Elem >	build (const ElemType type, Elem *p=nullptr)

static std::unique_ptr< Elem >	build_with_id (const ElemType type, dof_id_type id)
	Calls the build() method above with a nullptr parent, and additionally sets the newly-created Elem's id. More...

static unsigned int	n_objects ()
	Prints the number of outstanding (created, but not yet destroyed) objects. More...

static unsigned int	n_objects ()
	Prints the number of outstanding (created, but not yet destroyed) objects. More...

static void	enable_print_counter_info ()
	Methods to enable/disable the reference counter output from print_info() More...

static void	enable_print_counter_info ()
	Methods to enable/disable the reference counter output from print_info() More...

static void	disable_print_counter_info ()

static void	disable_print_counter_info ()

static unsigned int	unpackable_indexing_size (std::vector< largest_id_type >::const_iterator begin)
	If we have indices packed into an buffer for communications, how much of that buffer applies to this dof object? More...

Static Public Attributes
static const int	num_nodes = 20
	Geometric constants for Hex20. More...

static const int	nodes_per_side = 8

static const int	nodes_per_edge = 3

static const unsigned int	side_nodes_map [num_sides][nodes_per_side]
	This maps the $j^{th}$ node of the $i^{th}$ side to element node numbers. More...

static const unsigned int	edge_nodes_map [num_edges][nodes_per_edge]
	This maps the $j^{th}$ node of the $i^{th}$ edge to element node numbers. More...

static const int	num_sides = 6
	Geometric constants for all Hexes. More...

static const int	num_edges = 12

static const int	num_children = 8

static const unsigned int	edge_sides_map [12][2]
	This maps each edge to the sides that contain said edge. More...

static const subdomain_id_type	invalid_subdomain_id = std::numeric_limits<subdomain_id_type>::max()
	A static integral constant representing an invalid subdomain id. More...

static const unsigned int	type_to_n_nodes_map [INVALID_ELEM]
	This array maps the integer representation of the `ElemType` enum to the number of nodes in the element. More...

static const unsigned int	max_n_nodes = 27
	The maximum number of nodes any element can contain. More...

static const unsigned int	type_to_n_sides_map [INVALID_ELEM]
	This array maps the integer representation of the `ElemType` enum to the number of sides on the element. More...

static const unsigned int	type_to_n_edges_map [INVALID_ELEM]
	This array maps the integer representation of the `ElemType` enum to the number of edges on the element. More...

static const dof_id_type	invalid_id = static_cast<dof_id_type>(-1)
	An invalid `id` to distinguish an uninitialized `DofObject`. More...

static const unique_id_type	invalid_unique_id = static_cast<unique_id_type>(-1)
	An invalid `unique_id` to distinguish an uninitialized `DofObject`. More...

static const processor_id_type	invalid_processor_id = static_cast<processor_id_type>(-1)
	An invalid `processor_id` to distinguish DoFs that have not been assigned to a processor. More...

Protected Types
typedef std::map< std::string, std::pair< unsigned int, unsigned int > >	Counts
	Data structure to log the information. More...

typedef std::map< std::string, std::pair< unsigned int, unsigned int > >	Counts
	Data structure to log the information. More...

Protected Member Functions
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. More...

void	swap2nodes (unsigned int n1, unsigned int n2)
	Swaps two node_ptrs. More...

void	swap2neighbors (unsigned int n1, unsigned int n2)
	Swaps two neighbor_ptrs. More...

void	swap2boundarysides (unsigned short s1, unsigned short s2, BoundaryInfo *boundary_info) const
	Swaps two sides in `boundary_info`, if it is non-null. More...

void	swap2boundaryedges (unsigned short e1, unsigned short e2, BoundaryInfo *boundary_info) const
	Swaps two edges in `boundary_info`, if it is non-null. More...

void	swap3nodes (unsigned int n1, unsigned int n2, unsigned int n3)
	Swaps three node_ptrs, "rotating" them. More...

void	swap3neighbors (unsigned int n1, unsigned int n2, unsigned int n3)
	Swaps three neighbor_ptrs, "rotating" them. More...

void	swap4nodes (unsigned int n1, unsigned int n2, unsigned int n3, unsigned int n4)
	Swaps four node_ptrs, "rotating" them. More...

void	swap4neighbors (unsigned int n1, unsigned int n2, unsigned int n3, unsigned int n4)
	Swaps four neighbor_ptrs, "rotating" them. More...

template<typename Sideclass , typename Subclass >
std::unique_ptr< Elem >	simple_build_side_ptr (const unsigned int i, bool proxy)
	An implementation for simple (all sides equal) elements. More...

template<typename Subclass >
void	simple_build_side_ptr (std::unique_ptr< Elem > &side, const unsigned int i, ElemType sidetype)
	An implementation for simple (all sides equal) elements. More...

template<typename Subclass , typename Mapclass >
void	simple_side_ptr (std::unique_ptr< Elem > &side, const unsigned int i, ElemType sidetype)
	An implementation for simple (all sides equal) elements. More...

template<typename Edgeclass , typename Subclass >
std::unique_ptr< Elem >	simple_build_edge_ptr (const unsigned int i)
	An implementation for simple (all edges equal) elements. More...

template<typename Subclass >
void	simple_build_edge_ptr (std::unique_ptr< Elem > &edge, const unsigned int i, ElemType edgetype)
	An implementation for simple (all edges equal) elements. More...

virtual std::vector< std::vector< std::vector< std::vector< std::pair< unsigned char, unsigned char > > > > > &	_get_bracketing_node_cache () const
	Elem subclasses which don't do their own bracketing node calculations will need to supply a static cache, since the default calculation is slow. More...

virtual std::vector< std::vector< std::vector< signed char > > > &	_get_parent_indices_cache () const
	Elem subclasses which don't do their own child-to-parent node calculations will need to supply a static cache, since the default calculation is slow. More...

void	increment_constructor_count (const std::string &name) noexcept
	Increments the construction counter. More...

void	increment_constructor_count (const std::string &name) noexcept
	Increments the construction counter. More...

void	increment_destructor_count (const std::string &name) noexcept
	Increments the destruction counter. More...

void	increment_destructor_count (const std::string &name) noexcept
	Increments the destruction counter. More...

Static Protected Member Functions
static dof_id_type	compute_key (dof_id_type n0)

static dof_id_type	compute_key (dof_id_type n0, dof_id_type n1)

static dof_id_type	compute_key (dof_id_type n0, dof_id_type n1, dof_id_type n2)

static dof_id_type	compute_key (dof_id_type n0, dof_id_type n1, dof_id_type n2, dof_id_type n3)

Protected Attributes
Node *	_nodelinks_data [num_nodes]
	Data for links to nodes. More...

	LIBMESH_ENABLE_TOPOLOGY_CACHES

Elem *	_elemlinks_data [7+(LIBMESH_DIM >3)]
	Data for links to parent/neighbor/interior_parent elements. More...

Node **	_nodes
	Pointers to the nodes we are connected to. More...

Elem **	_elemlinks
	Pointers to this element's parent and neighbors, and for lower-dimensional elements' interior_parent. More...

std::unique_ptr< Elem *[]>	_children
	unique_ptr to array of this element's children. More...

subdomain_id_type	_sbd_id
	The subdomain to which this element belongs. More...

unsigned char	_rflag
	h refinement flag. More...

unsigned char	_pflag
	p refinement flag. More...

unsigned char	_p_level
	p refinement level - the difference between the polynomial degree on this element and the minimum polynomial degree on the mesh. More...

unsigned char	_map_type
	Mapping function type; currently either 0 (LAGRANGE) or 1 (RATIONAL_BERNSTEIN). More...

unsigned char	_map_data
	Mapping function data; currently used when needed to store the RATIONAL_BERNSTEIN nodal weight data index. More...

std::unique_ptr< DofObject >	old_dof_object
	This object on the last mesh. More...

Static Protected Attributes
static const Real	_embedding_matrix [num_children][num_nodes][num_nodes]
	Matrix that computes new nodal locations/solution values from current nodes/solution. More...

static const unsigned short int	_second_order_adjacent_vertices [12][2]
	Matrix that tells which vertices define the location of mid-side (or second-order) nodes. More...

static const unsigned short int	_second_order_vertex_child_number [27]
	Vector that names a child sharing each second order node. More...

static const unsigned short int	_second_order_vertex_child_index [27]
	Vector that names the child vertex index for each second order node. More...

static const Real	_master_points [27][3]
	Master element node locations. More...

static const int	_child_node_lookup [8][27]
	Lookup table from child id, child node id to "possible node location" (a simple dictionary-index in a 5x5x5 grid) More...

static const unsigned int	adjacent_edges_map [8][3]
	This maps the $j^{th}$ node to the (in this case) 3 edge ids adjacent to the node. More...

static constexpr Real	affine_tol = TOLERANCE*TOLERANCE
	Default tolerance to use in has_affine_map(). More...

static Counts	_counts
	Actually holds the data. More...

static Counts	_counts
	Actually holds the data. More...

static Threads::atomic< unsigned int >	_n_objects
	The number of objects. More...

static Threads::atomic< unsigned int >	_n_objects
	The number of objects. More...

static Threads::spin_mutex	_mutex
	Mutual exclusion object to enable thread-safe reference counting. More...

static Threads::spin_mutex	_mutex
	Mutual exclusion object to enable thread-safe reference counting. More...

static bool	_enable_print_counter = true
	Flag to control whether reference count information is printed when print_info is called. More...

static bool	_enable_print_counter = true
	Flag to control whether reference count information is printed when print_info is called. More...

Detailed Description

The Hex20 is an element in 3D composed of 20 nodes.

It is numbered like this:

*   HEX20:      7              18             6
*               o--------------o--------------o
*              /:                            /|
*             / :                           / |
*            /  :                          /  |
*         19/   :                       17/   |
*          o    :                        o    |
*         /     :                       /     |
*        /    15o                      /    14o
*       /       :                     /       |           zeta
*     4/        :    16             5/        |            ^   eta (into page)
*     o--------------o--------------o         |            | /
*     |         :                   |         |            |/
*     |         :                   |         |            o---> xi
*     |         :              10   |         |
*     |        3o..............o....|.........o
*     |        .                    |        / 2
*     |       .                   13|       /
*  12 o      .                      o      /
*     |     .                       |     /
*     |  11o                        |    o
*     |   .                         |   / 9
*     |  .                          |  /
*     | .                           | /
*     |.                            |/
*     o--------------o--------------o
*     0              8              1
*

(xi, eta, zeta) in [-1,1]^3 are the reference element coordinates associated with the given numbering.

Author: Benjamin S. Kirk

Date: 2002 A 3D hexahedral element with 20 nodes.

Definition at line 70 of file cell_hex20.h.

Member Typedef Documentation

◆ ConstNeighborPtrIter

typedef const Elem* const* libMesh::Elem::ConstNeighborPtrIter

inherited

Definition at line 321 of file elem.h.

◆ Counts [1/2]

typedef std::map<std::string, std::pair<unsigned int, unsigned int> > libMesh::ReferenceCounter::Counts

protectedinherited

Data structure to log the information.

The log is identified by the class name.

Definition at line 119 of file reference_counter.h.

◆ Counts [2/2]

typedef std::map<std::string, std::pair<unsigned int, unsigned int> > libMesh::ReferenceCounter::Counts

protectedinherited

Data structure to log the information.

The log is identified by the class name.

Definition at line 119 of file reference_counter.h.

◆ NeighborPtrIter

typedef Elem* const* libMesh::Elem::NeighborPtrIter

inherited

Nested "classes" for use iterating over all neighbors of an element.

Definition at line 320 of file elem.h.

◆ Predicate

typedef Predicates::multi_predicate libMesh::Elem::Predicate

inherited

Useful iterator typedefs.

Definition at line 1809 of file elem.h.

Member Enumeration Documentation

◆ RefinementState

enum libMesh::Elem::RefinementState

inherited

Enumeration of possible element refinement states.

Enumerator
COARSEN
DO_NOTHING
REFINE
JUST_REFINED
JUST_COARSENED
INACTIVE
COARSEN_INACTIVE
INVALID_REFINEMENTSTATE

Definition at line 1401 of file elem.h.

                        { COARSEN = 0,
                          DO_NOTHING,
                          REFINE,
                          JUST_REFINED,
                          JUST_COARSENED,
                          INACTIVE,
                          COARSEN_INACTIVE,
                          INVALID_REFINEMENTSTATE };

Constructor & Destructor Documentation

◆ Hex20() [1/3]

libMesh::Hex20::Hex20 ( Elem * p = nullptr )

inlineexplicit

Constructor.

By default this element has no parent.

Definition at line 78 of file cell_hex20.h.

                            :
     Hex(num_nodes, p, _nodelinks_data)
   {}

◆ Hex20() [2/3]

libMesh::Hex20::Hex20 ( Hex20 && )

delete

◆ Hex20() [3/3]

libMesh::Hex20::Hex20 ( const Hex20 & )

delete

◆ ~Hex20()

virtual libMesh::Hex20::~Hex20 ( )

virtualdefault

Member Function Documentation

◆ _get_bracketing_node_cache()

virtual std::vector<std::vector<std::vector<std::vector<std::pair<unsigned char, unsigned char> > > > >& libMesh::Elem::_get_bracketing_node_cache ( ) const

inlineprotectedvirtualinherited

Elem subclasses which don't do their own bracketing node calculations will need to supply a static cache, since the default calculation is slow.

Definition at line 2159 of file elem.h.

Referenced by libMesh::Elem::parent_bracketing_nodes().

   {
     static std::vector<std::vector<std::vector<std::vector<std::pair<unsigned char, unsigned char>>>>> c;
     libmesh_error();
     return c;
   }

◆ _get_parent_indices_cache()

virtual std::vector<std::vector<std::vector<signed char> > >& libMesh::Elem::_get_parent_indices_cache ( ) const

inlineprotectedvirtualinherited

Elem subclasses which don't do their own child-to-parent node calculations will need to supply a static cache, since the default calculation is slow.

Definition at line 2173 of file elem.h.

Referenced by libMesh::Elem::as_parent_node().

   {
     static std::vector<std::vector<std::vector<signed char>>> c;
     libmesh_error();
     return c;
   }

◆ active()

bool libMesh::Elem::active ( ) const

inlineinherited

Returns: true if the element is active (i.e. has no active descendants) or AMR is disabled, false otherwise.

Note: It suffices to check the first child only.

Definition at line 2891 of file elem.h.

References libMesh::Elem::COARSEN_INACTIVE, libMesh::Elem::INACTIVE, and libMesh::Elem::refinement_flag().

Referenced by libMesh::DofMap::_dof_indices(), libMesh::DofMap::_node_dof_indices(), libMesh::HPCoarsenTest::add_projection(), libMesh::Elem::ancestor(), assemble_ellipticdg(), libMesh::Patch::build_around_element(), libMesh::Elem::coarsen(), compute_jacobian(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::FEAbstract::compute_periodic_node_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints(), compute_residual(), libMesh::Elem::contract(), libMesh::DofMap::dof_indices(), libMesh::JumpErrorEstimator::estimate_error(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SubFunctor::find_dofs_to_send(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::find_point_neighbors(), libMesh::ReplicatedMesh::get_disconnected_subdomains(), libMesh::Elem::get_info(), libMesh::ErrorVector::is_active_elem(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_flags(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_p_levels(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::Elem::make_links_to_me_local(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::Elem::max_descendant_p_level(), libMesh::DofMap::merge_ghost_functor_outputs(), libMesh::Elem::min_new_p_level_by_neighbor(), libMesh::Elem::min_p_level_by_neighbor(), libMesh::PointLocatorTree::operator()(), libMesh::EquationSystems::redundant_added_side(), libMesh::Elem::refine(), libMesh::Elem::subactive(), libMesh::Parallel::sync_element_data_by_parent_id(), libMesh::MeshRefinement::test_level_one(), EquationSystemsTest::testRefineThenReinitPreserveFlags(), and libMesh::BoundaryInfo::transfer_boundary_ids_from_children().

 {
 #ifdef LIBMESH_ENABLE_AMR
   if ((this->refinement_flag() == INACTIVE) ||
       (this->refinement_flag() == COARSEN_INACTIVE))
     return false;
   else
     return true;
 #else
   return true;
 #endif
 }

◆ active_family_tree() [1/2]

void libMesh::Elem::active_family_tree	(	std::vector< const Elem *> &	active_family,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree() member, but only adds the active children.

Can be thought of as removing all the inactive elements from the vector created by family_tree, but is implemented more efficiently.

Definition at line 2004 of file elem.C.

References libMesh::ElemInternal::active_family_tree().

Referenced by libMesh::MeshCommunication::delete_remote_elements(), libMesh::DofMap::merge_ghost_functor_outputs(), and libMesh::SiblingCoupling::operator()().

 {
   ElemInternal::active_family_tree(this, active_family, reset);
 }

◆ active_family_tree() [2/2]

void libMesh::Elem::active_family_tree	(	std::vector< Elem *> &	active_family,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2012 of file elem.C.

References libMesh::ElemInternal::active_family_tree().

 {
   ElemInternal::active_family_tree(this, active_family, reset);
 }

◆ active_family_tree_by_neighbor() [1/2]

void libMesh::Elem::active_family_tree_by_neighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		bool	reset = `true`
	)		const

inherited

Same as the active_family_tree() member, but only adds elements which are next to neighbor.

Definition at line 2132 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_neighbor().

Referenced by libMesh::DefaultCoupling::operator()().

 {
   ElemInternal::active_family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ active_family_tree_by_neighbor() [2/2]

void libMesh::Elem::active_family_tree_by_neighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2141 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_neighbor().

 {
   ElemInternal::active_family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ active_family_tree_by_side() [1/2]

void libMesh::Elem::active_family_tree_by_side	(	std::vector< const Elem *> &	family,
		unsigned int	side,
		bool	reset = `true`
	)		const

inherited

Same as the active_family_tree() member, but only adds elements which are next to side.

Definition at line 2038 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_side().

Referenced by libMesh::BoundaryInfo::build_node_list_from_side_list(), libMesh::Nemesis_IO_Helper::write_sidesets(), and libMesh::ExodusII_IO_Helper::write_sidesets().

 {
   ElemInternal::active_family_tree_by_side(this, family, side, reset);
 }

◆ active_family_tree_by_side() [2/2]

void libMesh::Elem::active_family_tree_by_side	(	std::vector< Elem *> &	family,
		unsigned int	side,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2047 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_side().

 {
   ElemInternal::active_family_tree_by_side(this, family, side, reset);
 }

◆ active_family_tree_by_topological_neighbor() [1/2]

void libMesh::Elem::active_family_tree_by_topological_neighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		const MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb,
		bool	reset = `true`
	)		const

inherited

Same as the active_family_tree_by_neighbor() member, but the neighbor here may be a topological (e.g.

periodic boundary condition) neighbor, not just a local neighbor.

Definition at line 2150 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_topological_neighbor(), and mesh.

Referenced by libMesh::GhostPointNeighbors::operator()(), and libMesh::DefaultCoupling::operator()().

 {
   ElemInternal::active_family_tree_by_topological_neighbor(this, family, neighbor,
                                                            mesh, point_locator, pb,
                                                            reset);
 }

◆ active_family_tree_by_topological_neighbor() [2/2]

void libMesh::Elem::active_family_tree_by_topological_neighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		const MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2164 of file elem.C.

References libMesh::ElemInternal::active_family_tree_by_topological_neighbor(), and mesh.

 {
   ElemInternal::active_family_tree_by_topological_neighbor(this, family, neighbor,
                                                            mesh, point_locator, pb,
                                                            reset);
 }

◆ add_child() [1/2]

void libMesh::Elem::add_child ( Elem * elem )

inherited

Adds a child pointer to the array of children of this element.

If this is the first child to be added, this method allocates memory in the parent's _children array, otherwise, it just sets the pointer.

Definition at line 1915 of file elem.C.

References libMesh::Elem::_children, libMesh::Elem::n_children(), libMesh::Elem::parent(), libMesh::remote_elem, and libMesh::Elem::set_child().

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::CheckpointIO::read_connectivity(), and libMesh::CheckpointIO::read_remote_elem().

 {
   const unsigned int nc = this->n_children();
 
   if (!_children)
     {
       _children = std::make_unique<Elem *[]>(nc);
 
       for (unsigned int c = 0; c != nc; c++)
         this->set_child(c, nullptr);
     }
 
   for (unsigned int c = 0; c != nc; c++)
     {
       if (this->_children[c] == nullptr || this->_children[c] == remote_elem)
         {
           libmesh_assert_equal_to (this, elem->parent());
           this->set_child(c, elem);
           return;
         }
     }
 
   libmesh_error_msg("Error: Tried to add a child to an element with full children array");
 }

◆ add_child() [2/2]

void libMesh::Elem::add_child	(	Elem *	elem,
		unsigned int	c
	)

inherited

Adds a new child pointer to the specified index in the array of children of this element.

If this is the first child to be added, this method allocates memory in the parent's _children array, otherwise, it just sets the pointer.

Definition at line 1942 of file elem.C.

References libMesh::Elem::_children, libMesh::Elem::child_ptr(), libMesh::Elem::has_children(), libMesh::libmesh_assert(), libMesh::Elem::n_children(), libMesh::Elem::parent(), libMesh::remote_elem, and libMesh::Elem::set_child().

 {
   if (!this->has_children())
     {
       const unsigned int nc = this->n_children();
       _children = std::make_unique<Elem *[]>(nc);
 
       for (unsigned int i = 0; i != nc; i++)
         this->set_child(i, nullptr);
     }
 
   libmesh_assert (this->_children[c] == nullptr || this->child_ptr(c) == remote_elem);
   libmesh_assert (elem == remote_elem || this == elem->parent());
 
   this->set_child(c, elem);
 }

◆ add_extra_integers() [1/2]

void libMesh::DofObject::add_extra_integers ( const unsigned int n_integers )

inherited

Assigns a set of extra integers to this DofObject.

There will now be n_integers associated; this replaces, not augments, any previous count.

Any newly-added values will initially be DofObject::invalid_id

If non-integer data is in the set, each datum of type T should be counted sizeof(T)/sizeof(dof_id_type) times in n_integers.

Definition at line 490 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::invalid_id, and libMesh::DofObject::n_extra_integers().

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::DofObject::add_extra_integers(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::UnstructuredMesh::create_submesh(), libMesh::ReplicatedMesh::insert_elem(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_node(), DofObjectTest< Node >::testAddExtraData(), DofObjectTest< Node >::testAddSystemExtraInts(), DofObjectTest< Node >::testSetNSystemsExtraInts(), and DofObjectTest< Node >::testSetNVariableGroupsExtraInts().

 {
   if (_idx_buf.empty())
     {
       if (n_integers)
         {
           _idx_buf.resize(n_integers+1, DofObject::invalid_id);
           _idx_buf[0] = dof_id_type(-1);
         }
       return;
     }
   else
     {
       const int hdr = dof_id_signed_type(_idx_buf[0]);
 
       // We already have some extra integers, but may need more or
       // less now.
       if (hdr < 0)
         {
           const unsigned int old_n_integers = this->n_extra_integers();
           if (n_integers != old_n_integers)
             {
               // Make or remove space as needed by count change
               _idx_buf.resize(_idx_buf.size()+n_integers-old_n_integers, DofObject::invalid_id);
 
               // The start index for the extra integers is unchanged.
             }
         }
       else if (n_integers)
       // We had no extra integers, but need to add some
         {
           // Mark the DofObject as holding extra integers
           _idx_buf[0] = dof_id_type(-hdr-1);
 
           // Insert the integer start position
           DofObject::index_buffer_t::iterator it = _idx_buf.begin() + hdr;
           _idx_buf.insert(it, _idx_buf.size()+1);
 
           // Increment the previous system start positions to account
           // for the new header entry creating an offset
           for (int i=1; i<hdr; i++)
             _idx_buf[i]++;
 
           // Append space for extra integers
           _idx_buf.resize(_idx_buf.size()+n_integers, DofObject::invalid_id);
         }
     }
 }

◆ add_extra_integers() [2/2]

void libMesh::DofObject::add_extra_integers	(	const unsigned int	n_integers,
		const std::vector< dof_id_type > &	default_values
	)

inherited

Assigns a set of extra integers to this DofObject.

There will now be n_integers associated; this replaces, not augments, any previous count.

Any newly-added values will be copied from default_values.

If non-integer data is in the set, each datum of type T should be counted sizeof(T)/sizeof(dof_id_type) times in n_integers, and its data should be expressed in default_values as per memcpy.

Definition at line 542 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::add_extra_integers(), and libMesh::DofObject::n_extra_integers().

 {
   libmesh_assert_equal_to(n_integers, default_values.size());
 
   const unsigned int n_old_integers = this->n_extra_integers();
   this->add_extra_integers(n_integers);
   if (n_integers > n_old_integers)
     {
       const unsigned int n_more_integers = n_integers - n_old_integers;
       std::copy(default_values.begin()+n_old_integers,
                 default_values.end(),
                 _idx_buf.end()-n_more_integers);
     }
 }

◆ add_system()

void libMesh::DofObject::add_system ( )

inherited

Adds an additional system to the DofObject.

Definition at line 195 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::has_extra_integers(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::n_vars(), and libMesh::DofObject::set_n_systems().

Referenced by DofObjectTest< Node >::testAddSystemExtraInts().

 {
   // quick return?
   if (this->n_systems() == 0)
     {
       this->set_n_systems(1);
       return;
     }
 
   // cache this value before we screw it up!
   const unsigned int ns_orig = this->n_systems();
 
   DofObject::index_buffer_t::iterator it = _idx_buf.begin() + ns_orig;
 
   // Create the entry for the new system indicating 0 variables.
   //
   // increment the number of systems and the offsets for each of
   // the systems including the new one we just added.
   if (this->has_extra_integers())
     {
       // this inserts the extra_integers' start position as the start
       // position for the new system.  We'll increment all those
       // counts in one sweep next, to account for header expansion.
       _idx_buf.insert(it, *it);
 
       _idx_buf[0]--;
       for (unsigned int i=1; i<ns_orig+2; i++)
         {
           libmesh_assert_less(i, _idx_buf.size());
           _idx_buf[i]++;
         }
     }
   else
     {
       // this inserts the current vector size at the position for the
       // new system
       _idx_buf.insert(it, cast_int<dof_id_type>(_idx_buf.size()));
 
       for (unsigned int i=0; i<ns_orig+1; i++)
         {
           libmesh_assert_less(i, _idx_buf.size());
           _idx_buf[i]++;
         }
     }
 
   libmesh_assert_equal_to (this->n_systems(), (ns_orig+1));
   libmesh_assert_equal_to (this->n_vars(ns_orig), 0);
   libmesh_assert_equal_to (this->n_var_groups(ns_orig), 0);
 }

◆ ancestor()

bool libMesh::Elem::ancestor ( ) const

inherited

Returns: true if the element is an ancestor (i.e. has an active child or ancestor child), false otherwise or when AMR is disabled.

Definition at line 1881 of file elem.C.

References libMesh::Elem::active(), libMesh::Elem::child_ref_range(), libMesh::Elem::has_children(), libMesh::libmesh_assert(), libMesh::remote_elem, and libMesh::Elem::subactive().

Referenced by libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::get_info(), and libMesh::Elem::refine().

 {
 #ifdef LIBMESH_ENABLE_AMR
 
   // Use a fast, DistributedMesh-safe definition
   const bool is_ancestor =
     !this->active() && !this->subactive();
 
   // But check for inconsistencies if we have time
 #ifdef DEBUG
   if (!is_ancestor && this->has_children())
     {
       for (auto & c : this->child_ref_range())
         {
           if (&c != remote_elem)
             {
               libmesh_assert(!c.active());
               libmesh_assert(!c.ancestor());
             }
         }
     }
 #endif // DEBUG
 
   return is_ancestor;
 
 #else
   return false;
 #endif
 }

◆ as_parent_node()

unsigned int libMesh::Elem::as_parent_node	(	unsigned int	c,
		unsigned int	n
	)		const

virtualinherited

Returns: The local node id on the parent which corresponds to node n of child c, or invalid_uint if no such parent node exists.

Definition at line 2257 of file elem.C.

References libMesh::Elem::_get_parent_indices_cache(), libMesh::Elem::embedding_matrix(), libMesh::Elem::embedding_matrix_version(), libMesh::invalid_uint, libMesh::Elem::n_children(), libMesh::Elem::n_nodes(), libMesh::Elem::n_nodes_in_child(), libMesh::parent_indices_mutex, and libMesh::Real.

Referenced by libMesh::MeshRefinement::add_node(), and libMesh::Elem::parent_bracketing_nodes().

 {
   const unsigned int nc = this->n_children();
   libmesh_assert_less(child, nc);
 
   // Cached return values, indexed first by embedding_matrix version,
   // then by child number, then by child node number.
   std::vector<std::vector<std::vector<signed char>>> &
     cached_parent_indices = this->_get_parent_indices_cache();
 
   unsigned int em_vers = this->embedding_matrix_version();
 
   // We may be updating the cache on one thread, and while that
   // happens we can't safely access the cache from other threads.
   Threads::spin_mutex::scoped_lock lock(parent_indices_mutex);
 
   if (em_vers >= cached_parent_indices.size())
     cached_parent_indices.resize(em_vers+1);
 
   if (child >= cached_parent_indices[em_vers].size())
     {
       const signed char nn = cast_int<signed char>(this->n_nodes());
 
       cached_parent_indices[em_vers].resize(nc);
 
       for (unsigned int c = 0; c != nc; ++c)
         {
           const unsigned int ncn = this->n_nodes_in_child(c);
           cached_parent_indices[em_vers][c].resize(ncn);
           for (unsigned int cn = 0; cn != ncn; ++cn)
             {
               for (signed char n = 0; n != nn; ++n)
                 {
                   const Real em_val = this->embedding_matrix
                     (c, cn, n);
                   if (em_val == 1)
                     {
                       cached_parent_indices[em_vers][c][cn] = n;
                       break;
                     }
 
                   if (em_val != 0)
                     {
                       cached_parent_indices[em_vers][c][cn] =
                         -1;
                       break;
                     }
 
                   // We should never see an all-zero embedding matrix
                   // row
                   libmesh_assert_not_equal_to (n+1, nn);
                 }
             }
         }
     }
 
   const signed char cache_val =
     cached_parent_indices[em_vers][child][child_node];
   if (cache_val == -1)
     return libMesh::invalid_uint;
 
   return cached_parent_indices[em_vers][child][child_node];
 }

◆ boundary_sides_begin()

Elem::side_iterator libMesh::Elem::boundary_sides_begin ( )

inherited

Iterator accessor functions.

Definition at line 3282 of file elem.C.

References libMesh::Elem::_first_side(), and libMesh::Elem::_last_side().

 {
   Predicates::BoundarySide<SideIter> bsp;
   return side_iterator(this->_first_side(), this->_last_side(), bsp);
 }

◆ boundary_sides_end()

Elem::side_iterator libMesh::Elem::boundary_sides_end ( )

inherited

Definition at line 3291 of file elem.C.

References libMesh::Elem::_last_side().

 {
   Predicates::BoundarySide<SideIter> bsp;
   return side_iterator(this->_last_side(), this->_last_side(), bsp);
 }

◆ bracketing_nodes()

const std::vector< std::pair< dof_id_type, dof_id_type > > libMesh::Elem::bracketing_nodes	(	unsigned int	c,
		unsigned int	n
	)		const

virtualinherited

Returns: All the pairs of nodes (indexed by global node id) which should bracket node n of child c.

Definition at line 2528 of file elem.C.

References libMesh::Elem::build(), libMesh::Elem::child_ptr(), libMesh::Elem::default_order(), libMesh::FIRST, libMesh::HEX20, libMesh::DofObject::invalid_id, libMesh::make_range(), libMesh::Elem::n_nodes(), libMesh::Elem::n_nodes_in_child(), libMesh::Elem::node_id(), libMesh::Elem::parent_bracketing_nodes(), libMesh::Elem::second_order_equivalent_type(), and libMesh::Elem::type().

Referenced by libMesh::MeshRefinement::add_node(), and libMesh::TopologyMap::fill().

 {
   std::vector<std::pair<dof_id_type, dof_id_type>> returnval;
 
   const std::vector<std::pair<unsigned char, unsigned char>> & pbc =
     this->parent_bracketing_nodes(child,child_node);
 
   for (const auto & pb : pbc)
     {
       const unsigned short n_n = this->n_nodes();
       if (pb.first < n_n && pb.second < n_n)
         returnval.emplace_back(this->node_id(pb.first), this->node_id(pb.second));
       else
         {
           // We must be on a non-full-order higher order element...
           libmesh_assert_not_equal_to(this->default_order(), FIRST);
           libmesh_assert_not_equal_to
             (second_order_equivalent_type (this->type(), true),
              this->type());
           libmesh_assert_equal_to
             (second_order_equivalent_type (this->type(), false),
              this->type());
 
           // And that's a shame, because this is a nasty search:
 
           // Build the full-order type
           ElemType full_type =
             second_order_equivalent_type(this->type(), /*full_ordered=*/ true);
           std::unique_ptr<Elem> full_elem = Elem::build(full_type);
 
           dof_id_type pt1 = DofObject::invalid_id;
           dof_id_type pt2 = DofObject::invalid_id;
 
           // Find the bracketing nodes by figuring out what
           // already-created children will have them.
 
           // This only doesn't break horribly because we add children
           // and nodes in straightforward + hierarchical orders...
           for (unsigned int c=0; c <= child; ++c)
             for (auto n : make_range(this->n_nodes_in_child(c)))
               {
                 if (c == child && n == child_node)
                   break;
 
                 if (pb.first == full_elem->as_parent_node(c,n))
                   {
                     // We should be consistent
                     if (pt1 != DofObject::invalid_id)
                       libmesh_assert_equal_to(pt1, this->child_ptr(c)->node_id(n));
 
                     pt1 = this->child_ptr(c)->node_id(n);
                   }
 
                 if (pb.second == full_elem->as_parent_node(c,n))
                   {
                     // We should be consistent
                     if (pt2 != DofObject::invalid_id)
                       libmesh_assert_equal_to(pt2, this->child_ptr(c)->node_id(n));
 
                     pt2 = this->child_ptr(c)->node_id(n);
                   }
               }
 
           // We should *usually* find all bracketing nodes by the time
           // we query them (again, because of the child & node add
           // order)
           //
           // The exception is if we're a HEX20, in which case we will
           // find pairs of vertex nodes and edge nodes bracketing the
           // new central node but we *won't* find the pairs of face
           // nodes which we would have had on a HEX27.  In that case
           // we'll still have enough bracketing nodes for a
           // topological lookup, but we won't be able to make the
           // following assertions.
           if (this->type() != HEX20)
             {
               libmesh_assert_not_equal_to (pt1, DofObject::invalid_id);
               libmesh_assert_not_equal_to (pt2, DofObject::invalid_id);
             }
 
           if (pt1 != DofObject::invalid_id &&
               pt2 != DofObject::invalid_id)
             returnval.emplace_back(pt1, pt2);
         }
     }
 
   return returnval;
 }

◆ build()

std::unique_ptr< Elem > libMesh::Elem::build	(	const ElemType	type,
		Elem *	p = `nullptr`
	)

staticinherited

Returns: An Elem of type type wrapped in a smart pointer.

Definition at line 321 of file elem.C.

References libMesh::C0POLYGON, libMesh::EDGE2, libMesh::EDGE3, libMesh::EDGE4, libMesh::Utility::enum_to_string(), libMesh::HEX20, libMesh::HEX27, libMesh::HEX8, libMesh::INFEDGE2, libMesh::INFHEX16, libMesh::INFHEX18, libMesh::INFHEX8, libMesh::INFPRISM12, libMesh::INFPRISM6, libMesh::INFQUAD4, libMesh::INFQUAD6, libMesh::NODEELEM, libMesh::PRISM15, libMesh::PRISM18, libMesh::PRISM20, libMesh::PRISM21, libMesh::PRISM6, libMesh::PYRAMID13, libMesh::PYRAMID14, libMesh::PYRAMID18, libMesh::PYRAMID5, libMesh::QUAD4, libMesh::QUAD8, libMesh::QUAD9, libMesh::QUADSHELL4, libMesh::QUADSHELL8, libMesh::QUADSHELL9, libMesh::TET10, libMesh::TET14, libMesh::TET4, libMesh::TRI3, libMesh::TRI3SUBDIVISION, libMesh::TRI6, libMesh::TRI7, libMesh::TRISHELL3, and libMesh::Elem::type().

Referenced by libMesh::GMVIO::_read_one_cell(), libMesh::MeshTools::Subdivision::add_boundary_ghosts(), add_cube_convex_hull_to_mesh(), libMesh::UnstructuredMesh::all_first_order(), libMesh::MeshTools::Modification::all_tri(), AllSecondOrderTest::allCompleteOrderMixed(), AllSecondOrderTest::allCompleteOrderRange(), AllSecondOrderTest::allSecondOrderMixed(), AllSecondOrderTest::allSecondOrderRange(), libMesh::Elem::bracketing_nodes(), libMesh::MeshTools::Generation::build_cube(), libMesh::Nemesis_IO_Helper::build_element_and_node_maps(), libMesh::MeshTools::Generation::build_extrusion(), libMesh::InfElemBuilder::build_inf_elem(), MixedDimensionMeshTest::build_mesh(), ExtraIntegersTest::build_mesh(), MeshfunctionDFEM::build_mesh(), MixedDimensionNonUniformRefinement::build_mesh(), MixedDimensionNonUniformRefinementTriangle::build_mesh(), MixedDimensionNonUniformRefinement3D::build_mesh(), libMesh::Elem::build_with_id(), VolumeTest::construct_elem(), ContainsPointTest::containsPointTri3Helper(), libMesh::MeshBase::copy_constraint_rows(), libMesh::TriangleWrapper::copy_tri_to_mesh(), libMesh::Elem::disconnected_clone(), libMesh::UNVIO::elements_in(), libMesh::MeshTools::Modification::flatten(), libMesh::ExodusII_IO_Helper::init_conversion_map(), main(), libMesh::Elem::parent_bracketing_nodes(), libMesh::TetGenMeshInterface::pointset_convexhull(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::VTKIO::read(), libMesh::CheckpointIO::read_connectivity(), libMesh::ExodusII_IO_Helper::read_edge_blocks(), libMesh::AbaqusIO::read_elements(), libMesh::UCDIO::read_implementation(), libMesh::DynaIO::read_mesh(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::OFFIO::read_stream(), libMesh::Elem::refine(), libMesh::SimplexRefiner::refine_via_edges(), PerElemTest< elem_type >::setUp(), RationalMapTest< elem_type >::setUp(), FETestBase< order, family, elem_type, 1 >::setUp(), libMesh::MeshTools::Generation::surface_octahedron(), SystemsTest::test2DProjectVectorFE(), SystemsTest::test3DProjectVectorFE(), ContainsPointTest::testContainsPointNodeElem(), ContainsPointTest::testContainsPointTet4(), DefaultCouplingTest::testCoupling(), PointNeighborCouplingTest::testCoupling(), SystemsTest::testDofCouplingWithVarGroups(), DofMapTest::testDofOwner(), MeshTriangulationTest::testEdgesMesh(), MeshTriangulationTest::testHalfDomain(), PointLocatorTest::testLocator(), QuadratureTest::testNodalQuadrature(), MeshTriangulationTest::testPoly2TriBad1DMultiBoundary(), MeshTriangulationTest::testPoly2TriBad2DMultiBoundary(), MeshTriangulationTest::testPoly2TriBadEdges(), QuadratureTest::testPolynomials(), EquationSystemsTest::testReinitWithNodeElem(), BoundaryInfoTest::testShellFaceConstraints(), MeshTetTest::testTetsToTets(), MeshSubdomainIDTest::testUnpartitioned(), libMesh::TetGenMeshInterface::triangulate_conformingDelaunayMesh_carvehole(), libMesh::TetGenMeshInterface::triangulate_pointset(), and libMesh::GMVIO::write_ascii_old_impl().

 {
   switch (type)
     {
       // 0D elements
     case NODEELEM:
       return std::make_unique<NodeElem>(p);
 
       // 1D elements
     case EDGE2:
       return std::make_unique<Edge2>(p);
     case EDGE3:
       return std::make_unique<Edge3>(p);
     case EDGE4:
       return std::make_unique<Edge4>(p);
 
       // 2D elements
     case TRI3:
       return std::make_unique<Tri3>(p);
     case TRISHELL3:
       return std::make_unique<TriShell3>(p);
     case TRI3SUBDIVISION:
       return std::make_unique<Tri3Subdivision>(p);
     case TRI6:
       return std::make_unique<Tri6>(p);
     case TRI7:
       return std::make_unique<Tri7>(p);
     case QUAD4:
       return std::make_unique<Quad4>(p);
     case QUADSHELL4:
       return std::make_unique<QuadShell4>(p);
     case QUAD8:
       return std::make_unique<Quad8>(p);
     case QUADSHELL8:
       return std::make_unique<QuadShell8>(p);
     case QUAD9:
       return std::make_unique<Quad9>(p);
     case QUADSHELL9:
       return std::make_unique<QuadShell9>(p);
 
     // Well, a hexagon is *a* polygon...
     case C0POLYGON:
       return std::make_unique<C0Polygon>(6, p);
 
       // 3D elements
     case TET4:
       return std::make_unique<Tet4>(p);
     case TET10:
       return std::make_unique<Tet10>(p);
     case TET14:
       return std::make_unique<Tet14>(p);
     case HEX8:
       return std::make_unique<Hex8>(p);
     case HEX20:
       return std::make_unique<Hex20>(p);
     case HEX27:
       return std::make_unique<Hex27>(p);
     case PRISM6:
       return std::make_unique<Prism6>(p);
     case PRISM15:
       return std::make_unique<Prism15>(p);
     case PRISM18:
       return std::make_unique<Prism18>(p);
     case PRISM20:
       return std::make_unique<Prism20>(p);
     case PRISM21:
       return std::make_unique<Prism21>(p);
     case PYRAMID5:
       return std::make_unique<Pyramid5>(p);
     case PYRAMID13:
       return std::make_unique<Pyramid13>(p);
     case PYRAMID14:
       return std::make_unique<Pyramid14>(p);
     case PYRAMID18:
       return std::make_unique<Pyramid18>(p);
 
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
       // 1D infinite elements
     case INFEDGE2:
       return std::make_unique<InfEdge2>(p);
 
       // 2D infinite elements
     case INFQUAD4:
       return std::make_unique<InfQuad4>(p);
     case INFQUAD6:
       return std::make_unique<InfQuad6>(p);
 
       // 3D infinite elements
     case INFHEX8:
       return std::make_unique<InfHex8>(p);
     case INFHEX16:
       return std::make_unique<InfHex16>(p);
     case INFHEX18:
       return std::make_unique<InfHex18>(p);
     case INFPRISM6:
       return std::make_unique<InfPrism6>(p);
     case INFPRISM12:
       return std::make_unique<InfPrism12>(p);
 #endif
 
     default:
       libmesh_error_msg("ERROR: Undefined element type == " << Utility::enum_to_string(type));
     }
 }

◆ build_edge_ptr() [1/4]

std::unique_ptr< Elem > libMesh::Hex20::build_edge_ptr ( const unsigned int i )

overridevirtual

Builds a EDGE3 built coincident with edge i.

The std::unique_ptr<Elem> handles the memory aspect.

Implements libMesh::Elem.

Definition at line 203 of file cell_hex20.C.

 {
   return this->simple_build_edge_ptr<Edge3,Hex20>(i);
 }

◆ build_edge_ptr() [2/4]

void libMesh::Hex20::build_edge_ptr	(	std::unique_ptr< Elem > &	edge,
		const unsigned int	i
	)

overridevirtual

Rebuilds a EDGE3 built coincident with edge i.

Implements libMesh::Elem.

Definition at line 210 of file cell_hex20.C.

References libMesh::EDGE3.

 {
   this->simple_build_edge_ptr<Hex20>(edge, i, EDGE3);
 }

◆ build_edge_ptr() [3/4]

std::unique_ptr< const Elem > libMesh::Elem::build_edge_ptr ( const unsigned int i ) const

inlineinherited

Definition at line 2781 of file elem.h.

References libMesh::Elem::build_edge_ptr().

 {
   // Call the non-const version of this function, return the result as
   // a std::unique_ptr<const Elem>.
   Elem * me = const_cast<Elem *>(this);
   const Elem * e = const_cast<const Elem *>(me->build_edge_ptr(i).release());
   return std::unique_ptr<const Elem>(e);
 }

◆ build_edge_ptr() [4/4]

void libMesh::Elem::build_edge_ptr	(	std::unique_ptr< const Elem > &	edge,
		const unsigned int	i
	)		const

inlineinherited

Definition at line 2794 of file elem.h.

References libMesh::Elem::build_edge_ptr().

 {
   // Hand off to the non-const version of this function
   Elem * me = const_cast<Elem *>(this);
   std::unique_ptr<Elem> e {const_cast<Elem *>(elem.release())};
   me->build_edge_ptr(e, i);
   elem = std::move(e);
 }

◆ build_side_ptr() [1/4]

std::unique_ptr< Elem > libMesh::Hex20::build_side_ptr	(	const unsigned int	i,
		bool	proxy = `false`
	)

overridevirtual

Builds a QUAD8 built coincident with face i.

The std::unique_ptr<Elem> handles the memory aspect.

Implements libMesh::Elem.

Definition at line 165 of file cell_hex20.C.

 {
   return this->simple_build_side_ptr<Quad8, Hex20>(i, proxy);
 }

◆ build_side_ptr() [2/4]

void libMesh::Hex20::build_side_ptr	(	std::unique_ptr< Elem > &	elem,
		const unsigned int	i
	)

overridevirtual

Rebuilds a QUAD8 built coincident with face i.

Implements libMesh::Elem.

Definition at line 173 of file cell_hex20.C.

References libMesh::QUAD8.

 {
   this->simple_build_side_ptr<Hex20>(side, i, QUAD8);
 }

◆ build_side_ptr() [3/4]

std::unique_ptr< const Elem > libMesh::Elem::build_side_ptr	(	const unsigned int	i,
		bool	proxy = `false`
	)		const

inlineinherited

Definition at line 2659 of file elem.h.

References libMesh::Elem::build_side_ptr().

 {
   // Call the non-const version of this function, return the result as
   // a std::unique_ptr<const Elem>.
   Elem * me = const_cast<Elem *>(this);
   const Elem * s = const_cast<const Elem *>(me->build_side_ptr(i, proxy).release());
   return std::unique_ptr<const Elem>(s);
 }

◆ build_side_ptr() [4/4]

void libMesh::Elem::build_side_ptr	(	std::unique_ptr< const Elem > &	side,
		const unsigned int	i
	)		const

inlineinherited

Definition at line 2672 of file elem.h.

References libMesh::Elem::build_side_ptr().

 {
   // Hand off to the non-const version of this function
   Elem * me = const_cast<Elem *>(this);
   std::unique_ptr<Elem> e {const_cast<Elem *>(elem.release())};
   me->build_side_ptr(e, i);
   elem = std::move(e);
 }

◆ build_with_id()

std::unique_ptr< Elem > libMesh::Elem::build_with_id	(	const ElemType	type,
		dof_id_type	id
	)

staticinherited

Calls the build() method above with a nullptr parent, and additionally sets the newly-created Elem's id.

This can be useful when adding pre-numbered Elems to a Mesh via add_elem() calls.

Definition at line 429 of file elem.C.

References libMesh::Elem::build(), and libMesh::Elem::type().

Referenced by libMesh::MeshTools::Subdivision::all_subdivision(), libMesh::MeshTools::Generation::build_cube(), GetBoundaryPointsTest::build_mesh(), SlitMeshTest::build_mesh(), OverlappingTestBase::build_quad_mesh(), libMesh::TetGenIO::element_in(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::GmshIO::read_mesh(), libMesh::MatlabIO::read_stream(), NodalNeighborsTest::testOrientation(), EquationSystemsTest::testPostInitAddElem(), SystemsTest::testProjectMatrix3D(), InfFERadialTest::testRefinement(), libMesh::NetGenMeshInterface::triangulate(), and libMesh::Poly2TriTriangulator::triangulate_current_points().

 {
   // Call the other build() method with nullptr parent, then set the
   // required id.
   auto temp = Elem::build(type, nullptr);
   temp->set_id(id);
   return temp;
 }

◆ center_node_on_side()

unsigned int libMesh::Elem::center_node_on_side ( const unsigned short side ) const

virtualinherited

Returns: The local index of the center node on the side side.

A center node is a node that is located at the centroid of the given side. If the given side does not have a center node, this will return invalid_uint.

Reimplemented in libMesh::Prism20, libMesh::Prism21, libMesh::Prism18, libMesh::Hex27, libMesh::RemoteElem, libMesh::Pyramid18, libMesh::Pyramid14, libMesh::Edge, libMesh::Tri7, libMesh::Tri6, libMesh::Quad9, and libMesh::Quad8.

Definition at line 3398 of file elem.C.

References libMesh::invalid_uint, and libMesh::Elem::n_sides().

 {
   libmesh_assert_less (side, this->n_sides());
   return invalid_uint;
 }

◆ centroid()

Point libMesh::Elem::centroid ( ) const

virtualinherited

Calls Elem::vertex_average() for backwards compatibility.

Definition at line 449 of file elem.C.

References libMesh::err, and libMesh::Elem::vertex_average().

 {
   libmesh_do_once(libMesh::err
                   << "Elem::centroid() has been deprecated. Replace with either "
                   << "Elem::vertex_average() to maintain existing behavior, or "
                   << "the more expensive Elem::true_centroid() "
                   << "in cases where the true 'geometric' centroid is required."
                   << std::endl);
   libmesh_deprecated();
 
   return Elem::vertex_average();
 }

◆ child_neighbor() [1/2]

Elem * libMesh::Elem::child_neighbor ( Elem * elem )

inlineinherited

Returns: If elem is a neighbor of a child of this element, a pointer to that child, otherwise nullptr.

Definition at line 2562 of file elem.h.

References libMesh::Elem::neighbor_ptr_range().

 {
   for (auto n : elem->neighbor_ptr_range())
     if (n && n->parent() == this)
       return n;
 
   return nullptr;
 }

◆ child_neighbor() [2/2]

const Elem * libMesh::Elem::child_neighbor ( const Elem * elem ) const

inlineinherited

Returns: If elem is a neighbor of a child of this element, a pointer to that child, otherwise nullptr.

Definition at line 2574 of file elem.h.

References libMesh::Elem::neighbor_ptr_range().

 {
   for (auto n : elem->neighbor_ptr_range())
     if (n && n->parent() == this)
       return n;
 
   return nullptr;
 }

◆ child_ptr() [1/2]

const Elem * libMesh::Elem::child_ptr ( unsigned int i ) const

inlineinherited

Returns: A constant pointer to the $i^{th}$ child for this element. Do not call if this element has no children, i.e. is active.

Definition at line 3113 of file elem.h.

References libMesh::Elem::_children, and libMesh::libmesh_assert().

Referenced by libMesh::Elem::add_child(), libMesh::UnstructuredMesh::all_first_order(), libMesh::Elem::bracketing_nodes(), libMesh::Elem::coarsen(), libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values(), libMesh::TopologyMap::fill(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::is_child_on_edge(), libMesh::Elem::is_vertex_on_parent(), libMesh::Elem::make_links_to_me_remote(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectEdges::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectSides::operator()(), libMesh::Elem::refine(), libMesh::Elem::replace_child(), libMesh::Parallel::sync_element_data_by_parent_id(), InfFERadialTest::testRefinement(), EquationSystemsTest::testRefineThenReinitPreserveFlags(), libMesh::BoundaryInfo::transfer_boundary_ids_from_children(), libMesh::Elem::which_child_am_i(), and libMesh::CheckpointIO::write_remote_elem().

 {
   libmesh_assert(_children);
   libmesh_assert(_children[i]);
 
   return _children[i];
 }

◆ child_ptr() [2/2]

Elem * libMesh::Elem::child_ptr ( unsigned int i )

inlineinherited

Returns: A non-constant pointer to the $i^{th}$ child for this element. Do not call if this element has no children, i.e. is active.

Definition at line 3122 of file elem.h.

References libMesh::Elem::_children, and libMesh::libmesh_assert().

 {
   libmesh_assert(_children);
   libmesh_assert(_children[i]);
 
   return _children[i];
 }

◆ child_ref_range() [1/2]

SimpleRange< Elem::ChildRefIter > libMesh::Elem::child_ref_range ( )

inlineinherited

Returns a range with all children of a parent element, usable in range-based for loops.

The exact type of the return value here may be subject to change in future libMesh releases, but the iterators will always dereference to produce a reference to a child element.

Definition at line 2296 of file elem.h.

References libMesh::Elem::_children, libMesh::libmesh_assert(), and libMesh::Elem::n_children().

Referenced by libMesh::HPCoarsenTest::add_projection(), libMesh::Elem::ancestor(), libMesh::OldSolutionBase< Output, point_output >::check_old_context(), libMesh::Elem::coarsen(), libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values(), libMesh::connect_children(), libMesh::JumpErrorEstimator::estimate_error(), libMesh::ExactErrorEstimator::estimate_error(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::MeshRefinement::flag_elements_by_nelem_target(), libMesh::Elem::has_ancestor_children(), libMesh::MeshTools::libmesh_assert_topology_consistent_procids< Elem >(), main(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::Elem::make_links_to_me_remote(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::Elem::max_descendant_p_level(), libMesh::Elem::min_new_p_level_by_neighbor(), libMesh::Elem::min_p_level_by_neighbor(), libMesh::Elem::set_p_level(), and libMesh::Partitioner::set_parent_processor_ids().

 {
   libmesh_assert(_children);
   return {_children.get(), _children.get() + this->n_children()};
 }

◆ child_ref_range() [2/2]

SimpleRange< Elem::ConstChildRefIter > libMesh::Elem::child_ref_range ( ) const

inlineinherited

Definition at line 2304 of file elem.h.

References libMesh::Elem::_children, libMesh::libmesh_assert(), and libMesh::Elem::n_children().

 {
   libmesh_assert(_children);
   return {_children.get(), _children.get() + this->n_children()};
 }

◆ clear_dofs()

void libMesh::DofObject::clear_dofs ( )

inlineinherited

Clear the DofMap data structures holding degree of freedom data.

If any extra integers are associated with this DofObject, their count and values are unchanged.

Definition at line 798 of file dof_object.h.

References libMesh::DofObject::set_n_systems().

 {
   this->set_n_systems(0);
 }

◆ clear_old_dof_object()

void libMesh::DofObject::clear_old_dof_object ( )

inherited

Sets the old_dof_object to nullptr.

Definition at line 128 of file dof_object.C.

References libMesh::DofObject::old_dof_object.

Referenced by libMesh::DofObject::operator=(), libMesh::DofObject::set_old_dof_object(), and libMesh::DofObject::unpack_indexing().

 {
   this->old_dof_object.reset(nullptr);
 }

◆ close_to_point()

bool libMesh::Elem::close_to_point	(	const Point &	p,
		Real	tol
	)		const

virtualinherited

Returns: true if this element is "close" to the point p, where "close" is determined by the tolerance tol.

Reimplemented in libMesh::NodeElem.

Definition at line 2647 of file elem.C.

References libMesh::Elem::point_test().

Referenced by assemble_SchroedingerEquation(), libMesh::PointLocatorNanoflann::operator()(), and libMesh::PointLocatorTree::operator()().

 {
   // This test uses the user's passed-in tolerance for the
   // bounding box test as well, thereby allowing the routine to
   // find points which are not only "in" the element, but also
   // "nearby" to within some tolerance.
   return this->point_test(p, tol, tol);
 }

◆ coarsen()

void libMesh::Elem::coarsen ( )

inherited

Coarsen the element.

This function is non-virtual since it is the same for all element types.

Definition at line 163 of file elem_refinement.C.

References libMesh::Elem::active(), libMesh::TypeVector< T >::add_scaled(), libMesh::Elem::child_ptr(), libMesh::Elem::child_ref_range(), libMesh::Elem::COARSEN, libMesh::Elem::COARSEN_INACTIVE, libMesh::Elem::embedding_matrix(), libMesh::Elem::INACTIVE, libMesh::Elem::JUST_COARSENED, libMesh::libmesh_assert(), libMesh::Elem::n_children(), libMesh::Elem::n_nodes(), libMesh::Elem::node_index_range(), libMesh::Elem::point(), libMesh::Real, libMesh::Elem::refinement_flag(), libMesh::remote_elem, libMesh::Elem::set_p_level(), and libMesh::Elem::set_refinement_flag().

 {
   libmesh_assert_equal_to (this->refinement_flag(), Elem::COARSEN_INACTIVE);
   libmesh_assert (!this->active());
 
   // We no longer delete children until MeshRefinement::contract()
 
   unsigned int parent_p_level = 0;
 
   const unsigned int n_n = this->n_nodes();
 
   // re-compute hanging node nodal locations
   for (unsigned int c = 0, nc = this->n_children(); c != nc; ++c)
     {
       Elem * mychild = this->child_ptr(c);
       if (mychild == remote_elem)
         continue;
       for (auto cnode : mychild->node_index_range())
         {
           Point new_pos;
           bool calculated_new_pos = false;
 
           for (unsigned int n=0; n<n_n; n++)
             {
               // The value from the embedding matrix
               const Real em_val = this->embedding_matrix(c,cnode,n);
 
               // The node location is somewhere between existing vertices
               if ((em_val != 0.) && (em_val != 1.))
                 {
                   new_pos.add_scaled (this->point(n), em_val);
                   calculated_new_pos = true;
                 }
             }
 
           if (calculated_new_pos)
             {
               //Move the existing node back into it's original location
               for (unsigned int i=0; i<LIBMESH_DIM; i++)
                 {
                   Point & child_node = mychild->point(cnode);
                   child_node(i)=new_pos(i);
                 }
             }
         }
     }
 
   for (auto & mychild : this->child_ref_range())
     {
       if (&mychild == remote_elem)
         continue;
       libmesh_assert_equal_to (mychild.refinement_flag(), Elem::COARSEN);
       mychild.set_refinement_flag(Elem::INACTIVE);
       if (mychild.p_level() > parent_p_level)
         parent_p_level = mychild.p_level();
     }
 
   this->set_refinement_flag(Elem::JUST_COARSENED);
   this->set_p_level(parent_p_level);
 
   libmesh_assert (this->active());
 }

◆ complete_order_equivalent_type()

ElemType libMesh::Elem::complete_order_equivalent_type ( const ElemType et )

staticinherited

Returns: The ElemType of the associated "complete" order element (which will be the same as the input if the input is already a complete-order ElemType), or INVALID_ELEM for elements that cannot be converted into complete-order equivalents.

The "complete" version of an element is an element which can represent the same geometry but which has nodes available to restore degrees of freedom on any vertex, edge, or face.

For example, when this is a TET4, then TET14 is returned.

Definition at line 3190 of file elem.C.

References libMesh::EDGE2, libMesh::EDGE3, libMesh::EDGE4, libMesh::Utility::enum_to_string(), libMesh::HEX20, libMesh::HEX27, libMesh::HEX8, libMesh::INFEDGE2, libMesh::INFHEX16, libMesh::INFHEX18, libMesh::INFHEX8, libMesh::INFPRISM12, libMesh::INFPRISM6, libMesh::INFQUAD4, libMesh::INFQUAD6, libMesh::NODEELEM, libMesh::PRISM15, libMesh::PRISM18, libMesh::PRISM20, libMesh::PRISM21, libMesh::PRISM6, libMesh::PYRAMID13, libMesh::PYRAMID14, libMesh::PYRAMID18, libMesh::PYRAMID5, libMesh::QUAD4, libMesh::QUAD8, libMesh::QUAD9, libMesh::QUADSHELL4, libMesh::QUADSHELL8, libMesh::QUADSHELL9, libMesh::TET10, libMesh::TET14, libMesh::TET4, libMesh::TRI3, libMesh::TRI6, libMesh::TRI7, and libMesh::TRISHELL3.

Referenced by libMesh::UnstructuredMesh::all_complete_order_range().

 {
   switch (et)
     {
     case NODEELEM:
       return NODEELEM;
     case EDGE2:
     case EDGE3:
       return EDGE3;
 
     case EDGE4:
       return EDGE4;
 
     case TRI3:
     case TRI6:
     case TRI7:
       return TRI7;
 
       // Currently there is no TRISHELL6, so similarly to other types
       // where this is the case, we just return the input.
     case TRISHELL3:
       return TRISHELL3;
 
     case QUAD4:
     case QUAD8:
     case QUAD9:
       return QUAD9;
 
     case QUADSHELL4:
     case QUADSHELL8:
     case QUADSHELL9:
       return QUADSHELL9;
 
     case TET4:
     case TET10:
     case TET14:
       return TET14;
 
     case HEX8:
     case HEX20:
     case HEX27:
       return HEX27;
 
     // We don't strictly need the 21st node for DoFs, but some code
     // depends on it for e.g. refinement patterns
     case PRISM6:
     case PRISM15:
     case PRISM18:
     case PRISM20:
     case PRISM21:
       return PRISM21;
 
     case PYRAMID5:
     case PYRAMID13:
     case PYRAMID14:
     case PYRAMID18:
       return PYRAMID18;
 
 
 
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
     case INFEDGE2:
       return INFEDGE2;
 
     case INFQUAD4:
     case INFQUAD6:
       return INFQUAD6;
 
     case INFHEX8:
     case INFHEX16:
     case INFHEX18:
       return INFHEX18;
 
     // Probably ought to implement INFPRISM13 and/or 14; until then
     // we'll just return the not-complete-order ElemType, in
     // accordance which what seems like bad precedent...
     case INFPRISM6:
     case INFPRISM12:
       return INFPRISM12;
 #endif // LIBMESH_ENABLE_INFINITE_ELEMENTS
 
     default:
       {
         // what did we miss?
         libmesh_error_msg("No complete order equivalent element type for et =  "
                           << Utility::enum_to_string(et));
       }
     }
 }

◆ compute_key() [1/4]

dof_id_type libMesh::Elem::compute_key ( dof_id_type n0 )

inlinestaticprotectedinherited

Returns: A hash key computed from a single node id.

Definition at line 3244 of file elem.h.

 {
   return n0;
 }

◆ compute_key() [2/4]

dof_id_type libMesh::Elem::compute_key	(	dof_id_type	n0,
		dof_id_type	n1
	)

inlinestaticprotectedinherited

Returns: A hash key computed from two node ids.

Definition at line 3252 of file elem.h.

References libMesh::Utility::hashword2().

 {
   // Order the two so that n0 < n1
   if (n0 > n1) std::swap (n0, n1);
 
   return Utility::hashword2(n0, n1);
 }

◆ compute_key() [3/4]

dof_id_type libMesh::Elem::compute_key	(	dof_id_type	n0,
		dof_id_type	n1,
		dof_id_type	n2
	)

inlinestaticprotectedinherited

Returns: A hash key computed from three node ids.

Definition at line 3264 of file elem.h.

References libMesh::Utility::hashword().

 {
   std::array<dof_id_type, 3> array = {{n0, n1, n2}};
   std::sort(array.begin(), array.end());
   return Utility::hashword(array);
 }

◆ compute_key() [4/4]

dof_id_type libMesh::Elem::compute_key	(	dof_id_type	n0,
		dof_id_type	n1,
		dof_id_type	n2,
		dof_id_type	n3
	)

inlinestaticprotectedinherited

Returns: A hash key computed from four node ids.

Definition at line 3276 of file elem.h.

References libMesh::Utility::hashword().

 {
   std::array<dof_id_type, 4> array = {{n0, n1, n2, n3}};
   std::sort(array.begin(), array.end());
   return Utility::hashword(array);
 }

◆ connectivity()

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

overridevirtual

Returns: The connectivity for this element in a specific format, which is specified by the IOPackage tag.

Implements libMesh::Elem.

Definition at line 217 of file cell_hex20.C.

References libMesh::Elem::_nodes, libMesh::INVALID_IO_PACKAGE, libMesh::libmesh_assert(), n_sub_elem(), libMesh::Elem::node_id(), libMesh::TECPLOT, and libMesh::VTK.

 {
   libmesh_assert(_nodes);
   libmesh_assert_less (sc, this->n_sub_elem());
   libmesh_assert_not_equal_to (iop, INVALID_IO_PACKAGE);
 
 
   switch (iop)
     {
     case TECPLOT:
       {
         switch (sc)
           {
           case 0:
             conn.resize(8);
             conn[0] = this->node_id(0)+1;
             conn[1] = this->node_id(1)+1;
             conn[2] = this->node_id(2)+1;
             conn[3] = this->node_id(3)+1;
             conn[4] = this->node_id(4)+1;
             conn[5] = this->node_id(5)+1;
             conn[6] = this->node_id(6)+1;
             conn[7] = this->node_id(7)+1;
 
             return;
 
           default:
             libmesh_error_msg("Unknown sc = " << sc);
           }
       }
 
     case VTK:
       {
         switch (sc)
           {
           case 0:
             conn.resize(20);
             conn[0] = this->node_id(0);
             conn[1] = this->node_id(1);
             conn[2] = this->node_id(2);
             conn[3] = this->node_id(3);
             conn[4] = this->node_id(4);
             conn[5] = this->node_id(5);
             conn[6] = this->node_id(6);
             conn[7] = this->node_id(7);
             conn[8] = this->node_id(8);
             conn[9] = this->node_id(9);
             conn[10] = this->node_id(10);
             conn[11] = this->node_id(11);
             conn[12] = this->node_id(16);
             conn[13] = this->node_id(17);
             conn[14] = this->node_id(18);
             conn[15] = this->node_id(19);
             conn[16] = this->node_id(12);
             conn[17] = this->node_id(13);
             conn[18] = this->node_id(14);
             conn[19] = this->node_id(15);
             return;
 
           default:
             libmesh_error_msg("Unknown sc = " << sc);
           }
       }
 
     default:
       libmesh_error_msg("Unsupported IO package " << iop);
     }
 }

◆ contains_edge_of()

bool libMesh::Elem::contains_edge_of ( const Elem * e ) const

inherited

Returns: true if an edge of e is contained in this element. (Internally, this is done by checking whether at least two vertices of e are contained in this element).

Definition at line 843 of file elem.C.

References libMesh::Elem::contains_point(), libMesh::make_range(), libMesh::Elem::n_vertices(), and libMesh::Elem::point().

Referenced by libMesh::Elem::find_edge_neighbors().

 {
   unsigned int num_contained_edges = 0;
 
   // Our vertices are the first numbered nodes
   for (auto n : make_range(e->n_vertices()))
     {
       if (this->contains_point(e->point(n)))
         {
           num_contained_edges++;
           if (num_contained_edges>=2)
             {
               return true;
             }
         }
     }
   return false;
 }

◆ contains_point()

bool libMesh::Elem::contains_point	(	const Point &	p,
		Real	tol = `TOLERANCE`
	)		const

virtualinherited

Returns: true if the physical point p is contained in this element, false otherwise.

For linear elements, performs an initial tight bounding box check (as an optimization step) and (if that passes) then uses the user-defined tolerance "tol" in a call to inverse_map() to actually test if the point is in the element. For quadratic elements, the bounding box optimization is skipped, and only the inverse_map() steps are performed.

Note: This routine should not be used to determine if a point is merely "nearby" an element to within some tolerance. For that, use Elem::close_to_point() instead.

Reimplemented in libMesh::NodeElem, libMesh::Tet4, libMesh::InfHex, libMesh::InfPrism, libMesh::Tri3, and libMesh::InfQuad4.

Definition at line 2622 of file elem.C.

References libMesh::err, libMesh::Elem::point_test(), and libMesh::TOLERANCE.

Referenced by libMesh::Elem::contains_edge_of(), libMesh::Elem::contains_vertex_of(), libMesh::Elem::find_edge_neighbors(), libMesh::Elem::find_point_neighbors(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_constraints(), libMesh::PointLocatorNanoflann::operator()(), libMesh::PointLocatorTree::operator()(), libMesh::System::point_gradient(), libMesh::System::point_hessian(), libMesh::System::point_value(), NavierSystem::side_constraint(), RationalMapTest< elem_type >::testContainsPoint(), PointLocatorTest::testLocator(), and PointLocatorTest::testPlanar().

 {
   // We currently allow the user to enlarge the bounding box by
   // providing a tol > TOLERANCE (so this routine is identical to
   // Elem::close_to_point()), but print a warning so that the
   // user can eventually switch his code over to calling close_to_point()
   // instead, which is intended to be used for this purpose.
   if (tol > TOLERANCE)
     {
       libmesh_do_once(libMesh::err
                       << "WARNING: Resizing bounding box to match user-specified tolerance!\n"
                       << "In the future, calls to Elem::contains_point() with tol > TOLERANCE\n"
                       << "will be more optimized, but should not be used\n"
                       << "to search for points 'close to' elements!\n"
                       << "Instead, use Elem::close_to_point() for this purpose.\n"
                       << std::endl;);
       return this->point_test(p, tol, tol);
     }
   else
     return this->point_test(p, TOLERANCE, tol);
 }

◆ contains_vertex_of()

bool libMesh::Elem::contains_vertex_of	(	const Elem *	e,
		bool	mesh_connection = `false`
	)		const

inherited

Returns: true if a vertex of e is contained in this element. If mesh_connection is true, looks specifically for containment possibilities of an element e that is connected to this via membership in the same manifold of the same mesh.

Definition at line 805 of file elem.C.

References libMesh::Elem::contains_point(), libMesh::Elem::level(), libMesh::make_range(), libMesh::Elem::n_vertices(), libMesh::Elem::node_ptr(), libMesh::Elem::node_ref(), and libMesh::Elem::point().

 {
   // Our vertices are the first numbered nodes
   const unsigned int nv = e->n_vertices();
   const unsigned int my_nv = this->n_vertices();
 
   // Check for vertex-to-vertex containment first; contains_point() is
   // expensive
   for (auto n : make_range(nv))
     {
       const Node * vertex = e->node_ptr(n);
       for (auto my_n : make_range(my_nv))
         if (&this->node_ref(my_n) == vertex)
           return true;
     }
 
   // If e is in our mesh, then we might be done testing
   if (mesh_connection)
     {
       const unsigned int l = this->level();
       const unsigned int el = e->level();
 
       if (l >= el)
         return false;
 
       // We could also return false for l==el-1 iff we knew we had no
       // triangular faces, but we don't have an API to check that.
     }
 
   // Our vertices are the first numbered nodes
   for (auto n : make_range(nv))
     if (this->contains_point(e->point(n)))
       return true;
   return false;
 }

◆ contract()

void libMesh::Elem::contract ( )

inherited

Contract an active element, i.e.

remove pointers to any subactive children. This should only be called via MeshRefinement::contract, which will also remove subactive children from the mesh.

Definition at line 228 of file elem_refinement.C.

References libMesh::Elem::_children, libMesh::Elem::active(), libMesh::Elem::DO_NOTHING, libMesh::Elem::JUST_COARSENED, libMesh::libmesh_assert(), libMesh::Elem::refinement_flag(), and libMesh::Elem::set_refinement_flag().

 {
   // Subactive elements get deleted entirely, not contracted
   libmesh_assert (this->active());
 
   // Active contracted elements no longer can have children
   _children.reset(nullptr);
 
   if (this->refinement_flag() == Elem::JUST_COARSENED)
     this->set_refinement_flag(Elem::DO_NOTHING);
 }

◆ debug_buffer()

void libMesh::DofObject::debug_buffer ( ) const

inherited

Print our buffer for debugging.

Definition at line 660 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::MeshTools::Generation::Private::idx(), and libMesh::out.

 {
   libMesh::out << " [ ";
   for (const auto & idx : _idx_buf)
     libMesh::out << idx << " ";
   libMesh::out << "]\n";
 }

◆ default_order()

Order libMesh::Hex20::default_order ( ) const

overridevirtual

Returns: SECOND.

Implements libMesh::Elem.

Definition at line 158 of file cell_hex20.C.

References libMesh::SECOND.

 {
   return SECOND;
 }

◆ default_side_order()

virtual Order libMesh::Elem::default_side_order ( ) const

inlinevirtualinherited

Returns: The default approximation order for side elements of this element type. This may be lower for elements with 'bubble functions' in the Lagrange basis.

Reimplemented in libMesh::Tri7.

Definition at line 972 of file elem.h.

References libMesh::Elem::default_order().

Referenced by libMesh::FEAbstract::compute_node_constraints(), and libMesh::FEAbstract::compute_periodic_node_constraints().

972 { return default_order(); }

libMesh::Elem::default_order

virtual Order default_order() const =0

◆ dim()

virtual unsigned short libMesh::Cell::dim ( ) const

inlineoverridevirtualinherited

Returns: 3, the dimensionality of the object.

Implements libMesh::Elem.

Definition at line 61 of file cell.h.

61 { return 3; }

◆ disable_print_counter_info() [1/2]

void libMesh::ReferenceCounter::disable_print_counter_info ( )

staticinherited

Definition at line 100 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = false;
   return;
 }

◆ disable_print_counter_info() [2/2]

void libMesh::ReferenceCounter::disable_print_counter_info ( )

staticinherited

Definition at line 100 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = false;
   return;
 }

◆ disconnected_clone()

std::unique_ptr< Elem > libMesh::Elem::disconnected_clone ( ) const

virtualinherited

Returns: An Elem of the same type as this, wrapped in a smart pointer.

This is not a complete clone() method (since e.g. it does not set node pointers; the standard use case reassigns node pointers from a different mesh), but it is necessary to use this instead of build() for runtime-polymorphic elements like Polygon subtypes whose "type" depends on more than their type(), and it is useful to use this for elements whose id, unique_id, extra integers, etc. should be preserved in the near-clone.

Definition at line 287 of file elem.C.

References libMesh::Elem::build(), libMesh::C0POLYGON, libMesh::DofObject::id(), libMesh::Elem::mapping_data(), libMesh::Elem::mapping_type(), libMesh::DofObject::n_extra_integers(), libMesh::Elem::n_sides(), libMesh::DofObject::processor_id(), libMesh::Elem::subdomain_id(), libMesh::Elem::type(), and libMesh::DofObject::unique_id().

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::Elem::true_centroid().

 {
   std::unique_ptr<Elem> returnval;
 
   switch (this->type())
     {
     case C0POLYGON:
       returnval = std::make_unique<C0Polygon>(this->n_sides());
       break;
 
     default:
       returnval = Elem::build(this->type());
     }
 
   returnval->set_id() = this->id();
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   returnval->set_unique_id(this->unique_id());
 #endif
   returnval->subdomain_id() = this->subdomain_id();
   returnval->processor_id() = this->processor_id();
 
   const auto n_elem_ints = this->n_extra_integers();
   returnval->add_extra_integers(n_elem_ints);
   for (unsigned int i = 0; i != n_elem_ints; ++i)
     returnval->set_extra_integer(i, this->get_extra_integer(i));
 
   returnval->set_mapping_type(this->mapping_type());
   returnval->set_mapping_data(this->mapping_data());
 
   return returnval;
 }

◆ dof_number() [1/2]

dof_id_type libMesh::DofObject::dof_number	(	const unsigned int	s,
		const unsigned int	var,
		const unsigned int	comp
	)		const

inlineinherited

Returns: The global degree of freedom number for variable var, component comp for system s associated with this DofObject

When partitioning and DoF numbering have been performed by libMesh, every current DoF on this DofObject will belong to its processor.

Definition at line 1032 of file dof_object.h.

References libMesh::DofObject::n_comp(), libMesh::DofObject::n_comp_group(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_vars(), and libMesh::DofObject::var_to_vg_and_offset().

 {
   libmesh_assert_less (s,    this->n_systems());
   libmesh_assert_less (var,  this->n_vars(s));
   libmesh_assert_less (comp, this->n_comp(s,var));
 
   const std::pair<unsigned int, unsigned int>
     vg_vig = this->var_to_vg_and_offset(s,var);
 
   const unsigned int
     n_comp = this->n_comp_group(s,vg_vig.first);
 
   return this->dof_number(s, vg_vig.first, vg_vig.second,
                           comp, n_comp);
 }

◆ dof_number() [2/2]

dof_id_type libMesh::DofObject::dof_number	(	const unsigned int	s,
		const unsigned int	vg,
		const unsigned int	vig,
		const unsigned int	comp,
		const unsigned int	n_comp
	)		const

inlineinherited

Returns: The global degree of freedom number for variable group vg, variable index vig within the group, component comp out of n_comp, for system s on this DofObject

Even users who need to call dof_number from user code probably don't want to call this overload.

Definition at line 1053 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::invalid_id, libMesh::DofObject::n_comp(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::n_vars(), and libMesh::DofObject::start_idx().

 {
   libmesh_assert_less (s,   this->n_systems());
   libmesh_assert_less (vg,  this->n_var_groups(s));
   libmesh_assert_less (vig, this->n_vars(s,vg));
 
   const unsigned int
     start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg + 1), _idx_buf.size());
 
   const dof_id_type
     base_idx = _idx_buf[start_idx_sys + 2*vg + 1];
 
   // if the first component is invalid, they
   // are all invalid
   if (base_idx == invalid_id)
     return invalid_id;
 
   // otherwise the index is the first component
   // index augmented by the component number
   else
     return cast_int<dof_id_type>(base_idx + vig*n_comp + comp);
 }

◆ edge_index_range()

IntRange< unsigned short > libMesh::Elem::edge_index_range ( ) const

inlineinherited

Returns: An integer range from 0 up to (but not including) the number of edges this element has.

Definition at line 2614 of file elem.h.

References libMesh::Elem::n_edges().

Referenced by libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values(), libMesh::BoundaryInfo::copy_boundary_ids(), libMesh::ElemCutter::find_intersection_points(), and libMesh::Elem::quality().

 {
   return {0, cast_int<unsigned short>(this->n_edges())};
 }

◆ edges_adjacent_to_node()

std::vector< unsigned int > libMesh::Hex::edges_adjacent_to_node ( const unsigned int int ) const

overridevirtualinherited

Returns: the (local) edge numbers that touch the specified node

Implements libMesh::Elem.

Definition at line 263 of file cell_hex.C.

References libMesh::Hex::adjacent_edges_map, libMesh::Elem::is_edge(), libMesh::Elem::is_face(), libMesh::Elem::is_internal(), libMesh::Elem::is_vertex(), libMesh::libmesh_assert(), libMesh::Elem::n_nodes(), and libMesh::Hex::n_vertices().

 {
   libmesh_assert_less(n, this->n_nodes());
 
   // For vertices, we use the Hex::adjacent_edges_map, otherwise each
   // of the mid-edge nodes is adjacent only to the edge it is on, and
   // face/internal nodes are not adjacent to any edge.
   if (this->is_vertex(n))
     return {std::begin(adjacent_edges_map[n]), std::end(adjacent_edges_map[n])};
   else if (this->is_edge(n))
     return {n - this->n_vertices()};
 
   libmesh_assert(this->is_face(n) || this->is_internal(n));
   return {};
 }

◆ embedding_matrix()

virtual Real libMesh::Hex20::embedding_matrix	(	const unsigned int	i,
		const unsigned int	j,
		const unsigned int	k
	)		const

inlineoverrideprotectedvirtual

Matrix used to create the elements children.

Implements libMesh::Elem.

Definition at line 254 of file cell_hex20.h.

References _embedding_matrix.

257 { return _embedding_matrix[i][j][k]; }

libMesh::Hex20::_embedding_matrix

static const Real _embedding_matrix[num_children][num_nodes][num_nodes]

Matrix that computes new nodal locations/solution values from current nodes/solution.

Definition: cell_hex20.h:263

◆ embedding_matrix_version()

virtual unsigned int libMesh::Elem::embedding_matrix_version ( ) const

inlinevirtualinherited

Returns: A "version number" that identifies which embedding matrix is in use.

Some element types may use a different embedding matrix depending on their geometric characteristics.

Reimplemented in libMesh::Tet.

Definition at line 2000 of file elem.h.

Referenced by libMesh::Elem::as_parent_node(), and libMesh::Elem::parent_bracketing_nodes().

2000 { return 0; }

◆ enable_print_counter_info() [1/2]

void libMesh::ReferenceCounter::enable_print_counter_info ( )

staticinherited

Methods to enable/disable the reference counter output from print_info()

Definition at line 94 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = true;
   return;
 }

◆ enable_print_counter_info() [2/2]

void libMesh::ReferenceCounter::enable_print_counter_info ( )

staticinherited

Methods to enable/disable the reference counter output from print_info()

Definition at line 94 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter.

 {
   _enable_print_counter = true;
   return;
 }

◆ family_tree() [1/2]

void libMesh::Elem::family_tree	(	std::vector< const Elem *> &	family,
		bool	reset = `true`
	)		const

inherited

Fills the vector family with the children of this element, recursively.

Calling this method on a twice-refined element will give you the element itself, its direct children, and their children, etc... When the optional parameter reset is true, the vector will be cleared before the element and its descendants are added.

The family tree only includes ancestor and active elements. To include subactive elements as well, use total_family_tree().

Definition at line 1972 of file elem.C.

References libMesh::ElemInternal::family_tree().

 {
   ElemInternal::family_tree(this, family, reset);
 }

◆ family_tree() [2/2]

void libMesh::Elem::family_tree	(	std::vector< Elem *> &	family,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 1980 of file elem.C.

References libMesh::ElemInternal::family_tree().

 {
   ElemInternal::family_tree(this, family, reset);
 }

◆ family_tree_by_neighbor() [1/2]

void libMesh::Elem::family_tree_by_neighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree() member, but only adds elements which are next to neighbor.

Definition at line 2056 of file elem.C.

References libMesh::ElemInternal::family_tree_by_neighbor().

 {
   ElemInternal::family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ family_tree_by_neighbor() [2/2]

void libMesh::Elem::family_tree_by_neighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2065 of file elem.C.

References libMesh::ElemInternal::family_tree_by_neighbor().

 {
   ElemInternal::family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ family_tree_by_side() [1/2]

void libMesh::Elem::family_tree_by_side	(	std::vector< const Elem *> &	family,
		unsigned int	side,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree() member, but only adds elements which are next to side.

Definition at line 2020 of file elem.C.

References libMesh::ElemInternal::family_tree_by_side().

Referenced by libMesh::Elem::make_links_to_me_local().

 {
   ElemInternal::family_tree_by_side(this, family, side, reset);
 }

◆ family_tree_by_side() [2/2]

void libMesh::Elem::family_tree_by_side	(	std::vector< Elem *> &	family,
		unsigned int	side,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2029 of file elem.C.

References libMesh::ElemInternal::family_tree_by_side().

 {
   ElemInternal::family_tree_by_side(this, family, side, reset);
 }

◆ family_tree_by_subneighbor() [1/2]

void libMesh::Elem::family_tree_by_subneighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		const Elem *	subneighbor,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree() member, but only adds elements which are next to subneighbor.

Only applicable when this->has_neighbor(neighbor) and neighbor->is_ancestor(subneighbor)

Definition at line 2092 of file elem.C.

References libMesh::ElemInternal::family_tree_by_subneighbor().

 {
   ElemInternal::family_tree_by_subneighbor(this, family, neighbor, subneighbor, reset);
 }

◆ family_tree_by_subneighbor() [2/2]

void libMesh::Elem::family_tree_by_subneighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		Elem *	subneighbor,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2102 of file elem.C.

References libMesh::ElemInternal::family_tree_by_subneighbor().

 {
   ElemInternal::family_tree_by_subneighbor(this, family, neighbor, subneighbor, reset);
 }

◆ find_edge_neighbors() [1/2]

void libMesh::Elem::find_edge_neighbors	(	const Point &	p1,
		const Point &	p2,
		std::set< const Elem *> &	neighbor_set
	)		const

inherited

This function finds all active elements in the same manifold as this element which touch the current active element along the whole edge defined by the two points p1 and p2.

Definition at line 954 of file elem.C.

References libMesh::Elem::contains_point(), libMesh::Elem::find_point_neighbors(), and libMesh::libmesh_assert().

Referenced by libMesh::MeshRefinement::enforce_mismatch_limit_prior_to_refinement().

 {
   // Simple but perhaps suboptimal code: find elements containing the
   // first point, then winnow this set down by removing elements which
   // don't also contain the second point
 
   libmesh_assert(this->contains_point(p2));
   this->find_point_neighbors(p1, neighbor_set);
 
   std::set<const Elem *>::iterator        it = neighbor_set.begin();
   const std::set<const Elem *>::iterator end = neighbor_set.end();
 
   while (it != end)
     {
       // As of C++11, set::erase returns an iterator to the element
       // following the erased element, or end.
       if (!(*it)->contains_point(p2))
         it = neighbor_set.erase(it);
       else
         ++it;
     }
 }

◆ find_edge_neighbors() [2/2]

void libMesh::Elem::find_edge_neighbors ( std::set< const Elem *> & neighbor_set ) const

inherited

This function finds all active elements in the same manifold as this element which touch the current active element along any edge (more precisely, at at least two points).

In this case, elements are included even if they do not touch a whole edge of this element.

Definition at line 981 of file elem.C.

References libMesh::Elem::contains_edge_of(), and libMesh::remote_elem.

 {
   neighbor_set.clear();
   neighbor_set.insert(this);
 
   std::set<const Elem *> untested_set, next_untested_set;
   untested_set.insert(this);
 
   while (!untested_set.empty())
     {
       // Loop over all the elements in the patch that haven't already
       // been tested
       for (const auto & elem : untested_set)
         {
           for (auto current_neighbor : elem->neighbor_ptr_range())
             {
               if (current_neighbor &&
                   current_neighbor != remote_elem)    // we have a real neighbor on this side
                 {
                   if (current_neighbor->active())                // ... if it is active
                     {
                       if (this->contains_edge_of(current_neighbor) // ... and touches us
                           || current_neighbor->contains_edge_of(this))
                         {
                           // Make sure we'll test it
                           if (!neighbor_set.count(current_neighbor))
                             next_untested_set.insert (current_neighbor);
 
                           // And add it
                           neighbor_set.insert (current_neighbor);
                         }
                     }
 #ifdef LIBMESH_ENABLE_AMR
                   else                                 // ... the neighbor is *not* active,
                     {                                  // ... so add *all* neighboring
                                                        // active children
                       std::vector<const Elem *> active_neighbor_children;
 
                       current_neighbor->active_family_tree_by_neighbor
                         (active_neighbor_children, elem);
 
                       for (const auto & current_child : active_neighbor_children)
                         if (this->contains_edge_of(current_child) || current_child->contains_edge_of(this))
                           {
                             // Make sure we'll test it
                             if (!neighbor_set.count(current_child))
                               next_untested_set.insert (current_child);
 
                             neighbor_set.insert (current_child);
                           }
                     }
 #endif // #ifdef LIBMESH_ENABLE_AMR
                 }
             }
         }
       untested_set.swap(next_untested_set);
       next_untested_set.clear();
     }
 }

◆ find_interior_neighbors() [1/2]

void libMesh::Elem::find_interior_neighbors ( std::set< const Elem *> & neighbor_set ) const

inherited

This function finds all active elements (not including this one) in the parent manifold of this element whose intersection with this element has non-zero measure.

Definition at line 1043 of file elem.C.

References libMesh::ElemInternal::find_interior_neighbors().

 {
   ElemInternal::find_interior_neighbors(this, neighbor_set);
 }

◆ find_interior_neighbors() [2/2]

void libMesh::Elem::find_interior_neighbors ( std::set< Elem *> & neighbor_set )

inherited

Non-const version of function above that fills up a vector of non-const Elem pointers instead.

Definition at line 1050 of file elem.C.

References libMesh::ElemInternal::find_interior_neighbors().

 {
   ElemInternal::find_interior_neighbors(this, neighbor_set);
 }

◆ find_point_neighbors() [1/4]

void libMesh::Elem::find_point_neighbors	(	const Point &	p,
		std::set< const Elem *> &	neighbor_set
	)		const

inherited

This function finds all active elements (including this one) which are in the same manifold as this element and which touch the current active element at the specified point, which should be a point in the current element.

Elements which are not "in the same manifold" (e.g. the interior_parent of a boundary element) will not be found with this method.

Elements which overlap the specified point but which are only connected to the current element via elements which do not overlap that point (e.g. in a folded or tangled mesh) are not considered to "touch" the current element and will not be found with this method.

Definition at line 864 of file elem.C.

References libMesh::Elem::active(), libMesh::Elem::contains_point(), libMesh::libmesh_assert(), and libMesh::remote_elem.

Referenced by libMesh::MeshFunction::check_found_elem(), libMesh::MeshRefinement::enforce_mismatch_limit_prior_to_refinement(), libMesh::Elem::find_edge_neighbors(), libMesh::Elem::find_point_neighbors(), libMesh::ReplicatedMesh::get_boundary_points(), libMesh::Elem::is_semilocal(), libMesh::GhostPointNeighbors::operator()(), and InfFERadialTest::testRefinement().

 {
   libmesh_assert(this->contains_point(p));
   libmesh_assert(this->active());
 
   neighbor_set.clear();
   neighbor_set.insert(this);
 
   std::set<const Elem *> untested_set, next_untested_set;
   untested_set.insert(this);
 
 #ifdef LIBMESH_ENABLE_AMR
   std::vector<const Elem *> active_neighbor_children;
 #endif // #ifdef LIBMESH_ENABLE_AMR
 
   while (!untested_set.empty())
     {
       // Loop over all the elements in the patch that haven't already
       // been tested
       for (const auto & elem : untested_set)
           for (auto current_neighbor : elem->neighbor_ptr_range())
             {
               if (current_neighbor &&
                   current_neighbor != remote_elem)    // we have a real neighbor on this side
                 {
                   if (current_neighbor->active())                // ... if it is active
                     {
                       auto it = neighbor_set.lower_bound(current_neighbor);
                       if ((it == neighbor_set.end() || *it != current_neighbor) &&
                           current_neighbor->contains_point(p))   // ... don't have and touches p
                         {
                           // Add it and test it
                           next_untested_set.insert(current_neighbor);
                           neighbor_set.emplace_hint(it, current_neighbor);
                         }
                     }
 #ifdef LIBMESH_ENABLE_AMR
                   else                                 // ... the neighbor is *not* active,
                     {                                  // ... so add *all* neighboring
                                                        // active children that touch p
                       active_neighbor_children.clear();
                       current_neighbor->active_family_tree_by_neighbor
                         (active_neighbor_children, elem);
 
                       for (const auto & current_child : active_neighbor_children)
                         {
                           auto it = neighbor_set.lower_bound(current_child);
                           if ((it == neighbor_set.end() || *it != current_child) &&
                               current_child->contains_point(p))
                             {
                               // Add it and test it
                               next_untested_set.insert(current_child);
                               neighbor_set.emplace_hint(it, current_child);
                             }
                         }
                     }
 #endif // #ifdef LIBMESH_ENABLE_AMR
                 }
             }
       untested_set.swap(next_untested_set);
       next_untested_set.clear();
     }
 }

◆ find_point_neighbors() [2/4]

void libMesh::Elem::find_point_neighbors ( std::set< const Elem *> & neighbor_set ) const

inherited

This function finds all active elements (including this one) in the same manifold as this element which touch this active element at any point.

Definition at line 931 of file elem.C.

References libMesh::Elem::find_point_neighbors().

 {
   this->find_point_neighbors(neighbor_set, this);
 }

◆ find_point_neighbors() [3/4]

void libMesh::Elem::find_point_neighbors	(	std::set< const Elem *> &	neighbor_set,
		const Elem *	start_elem
	)		const

inherited

This function finds all active elements (including this one) in the same manifold as start_elem (which must be active and must touch this element) which touch this element at any point.

Definition at line 938 of file elem.C.

References libMesh::ElemInternal::find_point_neighbors().

 {
   ElemInternal::find_point_neighbors(this, neighbor_set, start_elem);
 }

◆ find_point_neighbors() [4/4]

void libMesh::Elem::find_point_neighbors	(	std::set< Elem *> &	neighbor_set,
		Elem *	start_elem
	)

inherited

Non-const version of function above.

Fills a set of non-const Elem pointers.

Definition at line 946 of file elem.C.

References libMesh::ElemInternal::find_point_neighbors().

 {
   ElemInternal::find_point_neighbors(this, neighbor_set, start_elem);
 }

◆ first_order_equivalent_type()

ElemType libMesh::Elem::first_order_equivalent_type ( const ElemType et )

staticinherited

Returns: The element type of the associated first-order element, or INVALID_ELEM for first-order or other elements that cannot be converted into lower order equivalents.

For example, when this is a TET10, then TET4 is returned.

Definition at line 2937 of file elem.C.

References libMesh::EDGE2, libMesh::EDGE3, libMesh::EDGE4, libMesh::HEX20, libMesh::HEX27, libMesh::HEX8, libMesh::INFEDGE2, libMesh::INFHEX16, libMesh::INFHEX18, libMesh::INFHEX8, libMesh::INFPRISM12, libMesh::INFPRISM6, libMesh::INFQUAD4, libMesh::INFQUAD6, libMesh::INVALID_ELEM, libMesh::NODEELEM, libMesh::PRISM15, libMesh::PRISM18, libMesh::PRISM20, libMesh::PRISM21, libMesh::PRISM6, libMesh::PYRAMID13, libMesh::PYRAMID14, libMesh::PYRAMID18, libMesh::PYRAMID5, libMesh::QUAD4, libMesh::QUAD8, libMesh::QUAD9, libMesh::QUADSHELL4, libMesh::QUADSHELL8, libMesh::QUADSHELL9, libMesh::TET10, libMesh::TET14, libMesh::TET4, libMesh::TRI3, libMesh::TRI6, libMesh::TRI7, and libMesh::TRISHELL3.

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::ExodusII_IO_Helper::read_edge_blocks(), SideTest< ElemClass, side_type, indexbegin, indexend >::testSidePtr(), SideTest< ElemClass, side_type, indexbegin, indexend >::testSidePtrFill(), and libMesh::GMVIO::write_ascii_old_impl().

 {
   switch (et)
     {
     case NODEELEM:
       return NODEELEM;
     case EDGE2:
     case EDGE3:
     case EDGE4:
       return EDGE2;
     case TRI3:
     case TRI6:
     case TRI7:
       return TRI3;
     case TRISHELL3:
       return TRISHELL3;
     case QUAD4:
     case QUAD8:
     case QUAD9:
       return QUAD4;
     case QUADSHELL4:
     case QUADSHELL8:
     case QUADSHELL9:
       return QUADSHELL4;
     case TET4:
     case TET10:
     case TET14:
       return TET4;
     case HEX8:
     case HEX27:
     case HEX20:
       return HEX8;
     case PRISM6:
     case PRISM15:
     case PRISM18:
     case PRISM20:
     case PRISM21:
       return PRISM6;
     case PYRAMID5:
     case PYRAMID13:
     case PYRAMID14:
     case PYRAMID18:
       return PYRAMID5;
 
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
 
     case INFEDGE2:
       return INFEDGE2;
     case INFQUAD4:
     case INFQUAD6:
       return INFQUAD4;
     case INFHEX8:
     case INFHEX16:
     case INFHEX18:
       return INFHEX8;
     case INFPRISM6:
     case INFPRISM12:
       return INFPRISM6;
 
 #endif
 
     default:
       // unknown element
       return INVALID_ELEM;
     }
 }

◆ flip()

void libMesh::Hex20::flip ( BoundaryInfo * boundary_info )

finaloverridevirtual

Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sign.

This is useful for automatically fixing up elements that have been newly created (e.g. from extrusions) with a negative Jacobian.

If boundary_info is not null, swap boundary side/edge ids consistently.

Implements libMesh::Elem.

Definition at line 762 of file cell_hex20.C.

References libMesh::libmesh_assert(), libMesh::Elem::swap2boundaryedges(), libMesh::Elem::swap2boundarysides(), libMesh::Elem::swap2neighbors(), and libMesh::Elem::swap2nodes().

 {
   libmesh_assert(boundary_info);
 
   swap2nodes(0,1);
   swap2nodes(2,3);
   swap2nodes(4,5);
   swap2nodes(6,7);
   swap2nodes(9,11);
   swap2nodes(12,13);
   swap2nodes(14,15);
   swap2nodes(17,19);
   swap2neighbors(2,4);
   swap2boundarysides(2,4,boundary_info);
   swap2boundaryedges(1,3,boundary_info);
   swap2boundaryedges(4,5,boundary_info);
   swap2boundaryedges(6,7,boundary_info);
   swap2boundaryedges(9,11,boundary_info);
 }

◆ get_extra_datum()

template<typename T >

T libMesh::DofObject::get_extra_datum ( const unsigned int index ) const

inlineinherited

Gets the value on this object of the extra datum associated with index, which should have been obtained via a call to MeshBase::add_elem_datum or MeshBase::add_node_datum using the same type T.

Definition at line 1146 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_systems(), and libMesh::DofObject::start_idx_ints().

Referenced by libMesh::Elem::get_info(), libMesh::VTKIO::nodes_to_vtk(), libMesh::rational_fe_shape(), libMesh::rational_fe_shape_deriv(), libMesh::rational_fe_shape_second_deriv(), libMesh::rational_fe_weighted_shapes(), libMesh::rational_fe_weighted_shapes_derivs(), libMesh::ExodusII_IO::read(), and DofObjectTest< Node >::testAddExtraData().

 {
 #ifndef NDEBUG
   const unsigned int n_more_integers = (sizeof(T)-1)/sizeof(dof_id_type);
 #endif
   libmesh_assert_less(index+n_more_integers, this->n_extra_integers());
   libmesh_assert_less(this->n_systems(), _idx_buf.size());
 
   const unsigned int start_idx_i = this->start_idx_ints();
 
   libmesh_assert_less(start_idx_i+index+n_more_integers, _idx_buf.size());
   T returnval;
   std::memcpy(&returnval, &_idx_buf[start_idx_i+index], sizeof(T));
   return returnval;
 }

◆ get_extra_integer()

dof_id_type libMesh::DofObject::get_extra_integer ( const unsigned int index ) const

inlineinherited

Gets the value on this object of the extra integer associated with index, which should have been obtained via a call to MeshBase::add_elem_integer or MeshBase::add_node_integer.

Definition at line 1102 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_systems(), and libMesh::DofObject::start_idx_ints().

Referenced by libMesh::MeshTools::Modification::all_tri(), WriteElemsetData::checkByCentroid(), libMesh::MeshTools::Modification::flatten(), libMesh::SyncElementIntegers::gather_data(), libMesh::XdrIO::pack_element(), libMesh::CheckpointIO::read_connectivity(), libMesh::SimplexRefiner::refine_via_edges(), libMesh::DofObject::set_n_vars_per_group(), DofObjectTest< Node >::testAddExtraData(), DofObjectTest< Node >::testAddSystemExtraInts(), ExtraIntegersTest::testExtraIntegersExodusReading(), DofObjectTest< Node >::testSetNSystemsExtraInts(), DofObjectTest< Node >::testSetNVariableGroupsExtraInts(), and libMesh::XdrIO::write_serialized_nodes().

 {
   libmesh_assert_less(index, this->n_extra_integers());
   libmesh_assert_less(this->n_systems(), _idx_buf.size());
 
   const unsigned int start_idx_i = this->start_idx_ints();
 
   libmesh_assert_less(start_idx_i+index, _idx_buf.size());
   return _idx_buf[start_idx_i+index];
 }

◆ get_info() [1/3]

std::string libMesh::ReferenceCounter::get_info ( )

staticinherited

Gets a string containing the reference information.

Definition at line 47 of file reference_counter.C.

References libMesh::ReferenceCounter::_counts, and libMesh::Quality::name().

Referenced by libMesh::ReferenceCounter::print_info().

 {
 #if defined(LIBMESH_ENABLE_REFERENCE_COUNTING) && defined(DEBUG)
 
   std::ostringstream oss;
 
   oss << '\n'
       << " ---------------------------------------------------------------------------- \n"
       << "| Reference count information                                                |\n"
       << " ---------------------------------------------------------------------------- \n";
 
   for (const auto & [name, cd] : _counts)
     oss << "| " << name << " reference count information:\n"
         << "|  Creations:    " << cd.first    << '\n'
         << "|  Destructions: " << cd.second << '\n';
 
   oss << " ---------------------------------------------------------------------------- \n";
 
   return oss.str();
 
 #else
 
   return "";
 
 #endif
 }

◆ get_info() [2/3]

std::string libMesh::ReferenceCounter::get_info ( )

staticinherited

Gets a string containing the reference information.

Definition at line 47 of file reference_counter.C.

References libMesh::ReferenceCounter::_counts, and libMesh::Quality::name().

Referenced by libMesh::ReferenceCounter::print_info().

 {
 #if defined(LIBMESH_ENABLE_REFERENCE_COUNTING) && defined(DEBUG)
 
   std::ostringstream oss;
 
   oss << '\n'
       << " ---------------------------------------------------------------------------- \n"
       << "| Reference count information                                                |\n"
       << " ---------------------------------------------------------------------------- \n";
 
   for (const auto & [name, cd] : _counts)
     oss << "| " << name << " reference count information:\n"
         << "|  Creations:    " << cd.first    << '\n'
         << "|  Destructions: " << cd.second << '\n';
 
   oss << " ---------------------------------------------------------------------------- \n";
 
   return oss.str();
 
 #else
 
   return "";
 
 #endif
 }

◆ get_info() [3/3]

std::string libMesh::Elem::get_info ( ) const

inherited

Prints relevant information about the element to a string.

Definition at line 2794 of file elem.C.

Referenced by libMesh::Elem::print_info().

 {
   std::ostringstream oss;
 
   oss << "  Elem Information"                                      << '\n'
       << "   id()=";
 
   if (this->valid_id())
     oss << this->id();
   else
     oss << "invalid";
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   oss << ", unique_id()=";
   if (this->valid_unique_id())
     oss << this->unique_id();
   else
     oss << "invalid";
 #endif
 
   oss << ", subdomain_id()=" << this->subdomain_id();
   oss << ", processor_id()=" << this->processor_id()               << '\n';
 
   oss << "   type()="    << Utility::enum_to_string(this->type())  << '\n'
       << "   dim()="     << this->dim()                            << '\n'
       << "   n_nodes()=" << this->n_nodes()                        << '\n';
 
   oss << "   mapping=" << Utility::enum_to_string(this->mapping_type()) << '\n';
 
   for (auto n : this->node_index_range())
     {
       oss << "    " << n << this->node_ref(n);
       if (this->mapping_type() == RATIONAL_BERNSTEIN_MAP)
         {
           const unsigned char datum_index = this->mapping_data();
           oss << "    weight=" <<
             this->node_ref(n).get_extra_datum<Real>(datum_index) << '\n';
         }
     }
 
   oss << "   n_sides()=" << this->n_sides()                        << '\n';
 
   for (auto s : this->side_index_range())
     {
       oss << "    neighbor(" << s << ")=";
       if (this->neighbor_ptr(s))
         oss << this->neighbor_ptr(s)->id() << '\n';
       else
         oss << "nullptr\n";
     }
 
   if (!this->infinite())
     {
     oss << "   hmin()=" << this->hmin()
         << ", hmax()=" << this->hmax()                             << '\n'
         << "   volume()=" << this->volume()                        << '\n';
     }
   oss << "   active()=" << this->active()
     << ", ancestor()=" << this->ancestor()
     << ", subactive()=" << this->subactive()
     << ", has_children()=" << this->has_children()               << '\n'
     << "   parent()=";
   if (this->parent())
     oss << this->parent()->id() << '\n';
   else
     oss << "nullptr\n";
   oss << "   level()=" << this->level()
       << ", p_level()=" << this->p_level()                         << '\n'
 #ifdef LIBMESH_ENABLE_AMR
       << "   refinement_flag()=" << Utility::enum_to_string(this->refinement_flag())        << '\n'
       << "   p_refinement_flag()=" << Utility::enum_to_string(this->p_refinement_flag())    << '\n'
 #endif
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
       << "   infinite()=" << this->infinite()    << '\n';
   if (this->infinite())
     oss << "   origin()=" << this->origin()    << '\n'
 #endif
       ;
 
   oss << "   DoFs=";
   for (auto s : make_range(this->n_systems()))
     for (auto v : make_range(this->n_vars(s)))
       for (auto c : make_range(this->n_comp(s,v)))
         oss << '(' << s << '/' << v << '/' << this->dof_number(s,v,c) << ") ";
 
 
   return oss.str();
 }

◆ get_node_index()

unsigned int libMesh::Elem::get_node_index ( const Node * node_ptr ) const

inlineinherited

Returns: The local index for the Node pointer node_ptr, or invalid_uint if node_ptr is not a local node.

Definition at line 2482 of file elem.h.

References libMesh::Elem::_nodes, libMesh::invalid_uint, libMesh::make_range(), libMesh::Elem::n_nodes(), and libMesh::Elem::node_ptr().

Referenced by libMesh::OldSolutionValue< Output, point_output >::eval_at_node(), libMesh::ElemCutter::find_intersection_points(), and libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()().

 {
   for (auto n : make_range(this->n_nodes()))
     if (this->_nodes[n] == node_ptr)
       return n;
 
   return libMesh::invalid_uint;
 }

◆ get_nodes()

const Node *const * libMesh::Elem::get_nodes ( ) const

inlineinherited

Returns: A pointer to an array of local node pointers.

Definition at line 2436 of file elem.h.

References libMesh::Elem::_nodes.

Referenced by libMesh::DofMap::dof_indices(), and libMesh::DofMap::old_dof_indices().

 {
   return _nodes;
 }

◆ get_old_dof_object() [1/2]

DofObject* libMesh::DofObject::get_old_dof_object ( )

inlineinherited

Pointer accessor for previously public old_dof_object.

If you want to assert that the old_dof_object pointer is valid as well, consider using the get_old_dof_object_ref() accessor instead.

Definition at line 96 of file dof_object.h.

References libMesh::DofObject::old_dof_object.

Referenced by libMesh::OldSolutionBase< Output, point_output >::check_old_context(), libMesh::OldSolutionCoefs< Output, point_output >::eval_at_node(), libMesh::OldSolutionValue< Output, point_output >::eval_at_node(), libMesh::OldSolutionCoefs< Output, point_output >::eval_mixed_derivatives(), libMesh::OldSolutionValue< Output, point_output >::eval_mixed_derivatives(), libMesh::DofMap::old_dof_indices(), libMesh::BuildProjectionList::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SortAndCopy::operator()(), and libMesh::DofObject::operator=().

96 { return old_dof_object.get(); }

libMesh::DofObject::old_dof_object

std::unique_ptr< DofObject > old_dof_object

This object on the last mesh.

Definition: dof_object.h:88

◆ get_old_dof_object() [2/2]

const DofObject* libMesh::DofObject::get_old_dof_object ( ) const

inlineinherited

Definition at line 97 of file dof_object.h.

References libMesh::DofObject::old_dof_object.

97 { return old_dof_object.get(); }

libMesh::DofObject::old_dof_object

std::unique_ptr< DofObject > old_dof_object

This object on the last mesh.

Definition: dof_object.h:88

◆ get_old_dof_object_ref() [1/2]

DofObject& libMesh::DofObject::get_old_dof_object_ref ( )

inlineinherited

As above, but do not use in situations where the old_dof_object may be nullptr, since this function asserts that the old_dof_object is valid before returning a reference to it.

Definition at line 104 of file dof_object.h.

References libMesh::libmesh_assert(), and libMesh::DofObject::old_dof_object.

Referenced by libMesh::OldSolutionCoefs< Output, point_output >::eval_old_dofs(), libMesh::OldSolutionValue< Output, point_output >::eval_old_dofs(), and libMesh::DofMap::old_dof_indices().

   {
     libmesh_assert(old_dof_object);
     return *old_dof_object;
   }

◆ get_old_dof_object_ref() [2/2]

const DofObject& libMesh::DofObject::get_old_dof_object_ref ( ) const

inlineinherited

Definition at line 110 of file dof_object.h.

References libMesh::libmesh_assert(), and libMesh::DofObject::old_dof_object.

   {
     libmesh_assert(old_dof_object);
     return *old_dof_object;
   }

◆ hack_p_level()

void libMesh::Elem::hack_p_level ( const unsigned int p )

inlineinherited

Sets the value of the p-refinement level for the element without altering the p-level of its ancestors.

Definition at line 3214 of file elem.h.

References libMesh::Elem::_p_level, libMesh::Elem::JUST_REFINED, and libMesh::Elem::p_refinement_flag().

Referenced by libMesh::Elem::hack_p_level_and_refinement_flag(), libMesh::HPCoarsenTest::select_refinement(), and libMesh::Elem::set_p_level().

 {
   if (p == 0)
     libmesh_assert_not_equal_to
       (this->p_refinement_flag(), Elem::JUST_REFINED);
 
   _p_level = cast_int<unsigned char>(p);
 }

◆ hack_p_level_and_refinement_flag()

void libMesh::Elem::hack_p_level_and_refinement_flag	(	const unsigned int	p,
		RefinementState	pflag
	)

inlineinherited

Sets the value of the p-refinement level for the element without altering the p-level of its ancestors; also sets the p_refinement_flag, simultaneously so that they can be safely checked for mutual consistency.

Definition at line 3225 of file elem.h.

References libMesh::Elem::_pflag, and libMesh::Elem::hack_p_level().

 {
   _pflag = cast_int<unsigned char>(pflag);
   this->hack_p_level(p);
 }

◆ has_affine_map()

bool libMesh::Hex20::has_affine_map ( ) const

overridevirtual

Returns: true if the element map is definitely affine within numerical tolerances.

Reimplemented from libMesh::Elem.

Definition at line 120 of file cell_hex20.C.

References libMesh::Elem::affine_tol, libMesh::Elem::point(), and libMesh::TypeVector< T >::relative_fuzzy_equals().

 {
   // Make sure x-edge endpoints are affine
   Point v = this->point(1) - this->point(0);
   if (!v.relative_fuzzy_equals(this->point(2) - this->point(3), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(5) - this->point(4), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(6) - this->point(7), affine_tol))
     return false;
   // Make sure x-edges are straight
   v /= 2;
   if (!v.relative_fuzzy_equals(this->point(8) - this->point(0), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(10) - this->point(3), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(16) - this->point(4), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(18) - this->point(7), affine_tol))
     return false;
   // Make sure xz-faces are identical parallelograms
   v = this->point(4) - this->point(0);
   if (!v.relative_fuzzy_equals(this->point(7) - this->point(3), affine_tol))
     return false;
   v /= 2;
   if (!v.relative_fuzzy_equals(this->point(12) - this->point(0), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(13) - this->point(1), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(14) - this->point(2), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(15) - this->point(3), affine_tol))
     return false;
   // Make sure y-edges are straight
   v = (this->point(3) - this->point(0))/2;
   if (!v.relative_fuzzy_equals(this->point(11) - this->point(0), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(9) - this->point(1), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(17) - this->point(5), affine_tol) ||
       !v.relative_fuzzy_equals(this->point(19) - this->point(4), affine_tol))
     return false;
   // If all the above checks out, the map is affine
   return true;
 }

◆ has_ancestor_children()

bool libMesh::Elem::has_ancestor_children ( ) const

inlineinherited

Returns: true if the element has any descendants other than its immediate children, false otherwise, or if AMR is disabled.

Definition at line 2943 of file elem.h.

References libMesh::Elem::_children, and libMesh::Elem::child_ref_range().

 {
 #ifdef LIBMESH_ENABLE_AMR
   if (!_children)
     return false;
   else
     for (auto & c : child_ref_range())
       if (c.has_children())
         return true;
 #endif
   return false;
 }

◆ has_children()

bool libMesh::Elem::has_children ( ) const

inlineinherited

Returns: true if the element has any children (active or not), false otherwise, or if AMR is disabled.

Definition at line 2929 of file elem.h.

References libMesh::Elem::_children.

Referenced by libMesh::Elem::add_child(), libMesh::Elem::ancestor(), libMesh::connect_children(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::MeshRefinement::flag_elements_by_nelem_target(), libMesh::Elem::get_info(), libMesh::MeshTools::libmesh_assert_topology_consistent_procids< Elem >(), main(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::Elem::make_links_to_me_local(), libMesh::Elem::make_links_to_me_remote(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::FEMSystem::mesh_position_set(), libMesh::Elem::remove_links_to_me(), libMesh::Elem::replace_child(), libMesh::Elem::set_child(), libMesh::Elem::subactive(), libMesh::Parallel::sync_element_data_by_parent_id(), and libMesh::Elem::which_child_am_i().

 {
 #ifdef LIBMESH_ENABLE_AMR
   if (!_children)
     return false;
   else
     return true;
 #else
   return false;
 #endif
 }

◆ has_dofs()

bool libMesh::DofObject::has_dofs ( const unsigned int s = libMesh::invalid_uint ) const

inlineinherited

Returns: true if any system has variables which have been assigned, false otherwise.

Definition at line 1226 of file dof_object.h.

References libMesh::invalid_uint, libMesh::make_range(), libMesh::DofObject::n_systems(), and libMesh::DofObject::n_vars().

Referenced by libMesh::DofMap::old_dof_indices().

 {
   if (sys == libMesh::invalid_uint)
     {
       for (auto s : make_range(this->n_systems()))
         if (this->n_vars(s))
           return true;
     }
 
   else
     {
       libmesh_assert_less (sys, this->n_systems());
 
       if (this->n_vars(sys))
         return true;
     }
 
   return false;
 }

◆ has_extra_integers()

bool libMesh::DofObject::has_extra_integers ( ) const

inlineinherited

Returns whether extra integers are associated to the DofObject.

Definition at line 1188 of file dof_object.h.

References libMesh::DofObject::_idx_buf.

Referenced by libMesh::DofObject::add_system(), libMesh::DofObject::end_idx_ints(), libMesh::DofObject::set_n_vars_per_group(), libMesh::DofObject::start_idx_ints(), DofObjectTest< Node >::testAddExtraData(), DofObjectTest< Node >::testAddSystemExtraInts(), and DofObjectTest< Node >::testSetNSystemsExtraInts().

 {
   if (_idx_buf.empty())
     return 0;
 
   return (dof_id_signed_type(_idx_buf[0]) < 0);
 }

◆ has_invertible_map()

bool libMesh::Elem::has_invertible_map ( Real tol = TOLERANCE*TOLERANCE ) const

virtualinherited

Returns: true if the element map is invertible everywhere on the element, to within a user-specified tolerance. The tolerance is generally used in comparisons against zero, so it should be an absolute rather than a relative tolerance. Throws a libmesh_not_implemented() error unless specialized by derived classes.

Reimplemented in libMesh::NodeElem, libMesh::Tet4, libMesh::Tri3, libMesh::Edge4, libMesh::Edge3, libMesh::Quad4, and libMesh::Edge2.

Definition at line 2752 of file elem.C.

References libMesh::FEMap::compute_map(), libMesh::Elem::dim(), libMesh::FEMap::get_jacobian(), libMesh::index_range(), libMesh::FEMap::init_reference_to_physical_map(), libMesh::Elem::is_singular_node(), and libMesh::Elem::n_nodes().

Referenced by VolumeTest::testEdge4Invertible().

 {
   QNodal qnodal {this->dim()};
   FEMap fe_map;
   auto & jac = fe_map.get_jacobian();
 
   // We have a separate check for is_singular_node() below, so in this
   // case its "OK" to do nodal quadrature on pyramids.
   qnodal.allow_nodal_pyramid_quadrature = true;
   qnodal.init(*this);
   auto & qp = qnodal.get_points();
   libmesh_assert_equal_to(qp.size(), this->n_nodes());
 
   std::vector<Point> one_point(1);
   std::vector<Real> one_weight(1,1);
   for (auto i : index_range(qp))
     {
       if (this->is_singular_node(i))
         continue;
 
       one_point[0] = qp[i];
 
       fe_map.init_reference_to_physical_map(this->dim(), one_point, this);
       fe_map.compute_map(this->dim(), one_weight, this, false);
 
       if (jac[0] <= 0)
         return false;
     }
 
   return true;
 }

◆ has_neighbor()

bool libMesh::Elem::has_neighbor ( const Elem * elem ) const

inlineinherited

Returns: true if the element elem in question is a neighbor of this element, false otherwise.

Definition at line 2550 of file elem.h.

References libMesh::Elem::neighbor_ptr_range().

Referenced by libMesh::Elem::has_topological_neighbor(), libMesh::MeshRefinement::has_topological_neighbor(), libMesh::Elem::min_new_p_level_by_neighbor(), libMesh::Elem::min_p_level_by_neighbor(), and libMesh::Elem::on_boundary().

 {
   for (auto n : this->neighbor_ptr_range())
     if (n == elem)
       return true;
 
   return false;
 }

◆ has_topological_neighbor()

bool libMesh::Elem::has_topological_neighbor	(	const Elem *	elem,
		const MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb
	)		const

inherited

Returns: true if the element elem in question is a neighbor or topological neighbor of this element, false otherwise.

Definition at line 1221 of file elem.C.

References libMesh::Elem::has_neighbor(), mesh, libMesh::Elem::side_index_range(), and libMesh::Elem::topological_neighbor().

Referenced by libMesh::MeshRefinement::has_topological_neighbor().

 {
   // First see if this is a normal "interior" neighbor
   if (has_neighbor(elem))
     return true;
 
   for (auto n : this->side_index_range())
     if (this->topological_neighbor(n, mesh, point_locator, pb))
       return true;
 
   return false;
 }

◆ hmax()

Real libMesh::Elem::hmax ( ) const

virtualinherited

Returns: The maximum vertex separation for the element.

Definition at line 593 of file elem.C.

References libMesh::Elem::n_vertices(), libMesh::Elem::point(), and libMesh::Real.

Referenced by libMesh::DiscontinuityMeasure::boundary_side_integration(), libMesh::KellyErrorEstimator::boundary_side_integration(), libMesh::OldSolutionBase< Output, point_output >::check_old_context(), libMesh::Elem::get_info(), libMesh::LaplacianErrorEstimator::internal_side_integration(), libMesh::DiscontinuityMeasure::internal_side_integration(), libMesh::KellyErrorEstimator::internal_side_integration(), and libMesh::Elem::point_test().

 {
   Real h_max=0;
 
   // Avoid calling a virtual a lot of times
   const auto n_vertices = this->n_vertices();
 
   for (unsigned int n_outer=0; n_outer<n_vertices; n_outer++)
     for (unsigned int n_inner=n_outer+1; n_inner<n_vertices; n_inner++)
       {
         const auto diff = (this->point(n_outer) - this->point(n_inner));
 
         h_max = std::max(h_max, diff.norm_sq());
       }
 
   return std::sqrt(h_max);
 }

◆ hmin()

Real libMesh::Elem::hmin ( ) const

virtualinherited

Returns: The minimum vertex separation for the element.

Definition at line 573 of file elem.C.

References libMesh::Elem::n_vertices(), libMesh::Elem::point(), and libMesh::Real.

Referenced by compute_enriched_soln(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), compute_tau(), libMesh::MeshTools::Modification::distort(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::get_info(), libMesh::FEMSystem::numerical_jacobian(), and libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()().

 {
   Real h_min=std::numeric_limits<Real>::max();
 
   // Avoid calling a virtual a lot of times
   const auto n_vertices = this->n_vertices();
 
   for (unsigned int n_outer=0; n_outer<n_vertices; n_outer++)
     for (unsigned int n_inner=n_outer+1; n_inner<n_vertices; n_inner++)
       {
         const auto diff = (this->point(n_outer) - this->point(n_inner));
 
         h_min = std::min(h_min, diff.norm_sq());
       }
 
   return std::sqrt(h_min);
 }

◆ id()

dof_id_type libMesh::DofObject::id ( ) const

inlineinherited

Returns: The id for this DofObject

Definition at line 828 of file dof_object.h.

References libMesh::DofObject::_id.

 {
   return _id;
 }

◆ increment_constructor_count() [1/2]

void libMesh::ReferenceCounter::increment_constructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the construction counter.

Should be called in the constructor of any derived class that will be reference counted.

Definition at line 183 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.first++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_constructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ increment_constructor_count() [2/2]

void libMesh::ReferenceCounter::increment_constructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the construction counter.

Should be called in the constructor of any derived class that will be reference counted.

Definition at line 183 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.first++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_constructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ increment_destructor_count() [1/2]

void libMesh::ReferenceCounter::increment_destructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the destruction counter.

Should be called in the destructor of any derived class that will be reference counted.

Definition at line 207 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::~ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.second++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_destructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ increment_destructor_count() [2/2]

void libMesh::ReferenceCounter::increment_destructor_count ( const std::string & name )

inlineprotectednoexceptinherited

Increments the destruction counter.

Should be called in the destructor of any derived class that will be reference counted.

Definition at line 207 of file reference_counter.h.

References libMesh::err, libMesh::BasicOStreamProxy< charT, traits >::get(), libMesh::Quality::name(), and libMesh::Threads::spin_mtx.

Referenced by libMesh::ReferenceCountedObject< RBParametrized >::~ReferenceCountedObject().

 {
   libmesh_try
   {
     Threads::spin_mutex::scoped_lock lock(Threads::spin_mtx);
     std::pair<unsigned int, unsigned int> & p = _counts[name];
     p.second++;
   }
   libmesh_catch (...)
   {
     auto stream = libMesh::err.get();
     stream->exceptions(stream->goodbit); // stream must not throw
     libMesh::err << "Encountered unrecoverable error while calling "
                  << "ReferenceCounter::increment_destructor_count() "
                  << "for a(n) " << name << " object." << std::endl;
     std::terminate();
   }
 }

◆ infinite() [1/2]

virtual bool libMesh::Cell::infinite ( ) const

inlineoverridevirtualinherited

Returns: false. All classes derived from Cell are finite elements.

Implements libMesh::Elem.

Definition at line 75 of file cell.h.

75 { return false; }

◆ infinite() [2/2]

static constexpr bool libMesh::Elem::infinite ( )

inlinestaticinherited

Definition at line 1867 of file elem.h.

1867 { return false; }

◆ interior_parent() [1/2]

const Elem * libMesh::Elem::interior_parent ( ) const

inherited

Returns: The higher-dimensional Elem for which this Elem is a face.

In some cases it is desirable to extract the boundary (or a subset thereof) of a D-dimensional mesh as a (D-1)-dimensional manifold. In this case we may want to know the 'parent' element from which the manifold elements were extracted. We can easily do that for the level-0 manifold elements by storing the D-dimensional parent. This method provides access to that element.

This method returns nullptr if this->dim() == LIBMESH_DIM; in such cases no data storage for an interior parent pointer has been allocated.

Definition at line 1057 of file elem.C.

References libMesh::Elem::_elemlinks, libMesh::Elem::dim(), libMesh::DofObject::id(), libMesh::DofObject::invalid_id, libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::Elem::n_sides(), and libMesh::remote_elem.

Referenced by libMesh::FEMap::compute_face_map(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::BoundaryInfo::get_side_and_node_maps(), libMesh::InfFE< Dim, T_radial, T_map >::init_face_shape_functions(), libMesh::MeshTools::libmesh_assert_valid_amr_interior_parents(), libMesh::GhostPointNeighbors::operator()(), BoundaryMeshTest::sanityCheck(), libMesh::Elem::topologically_equal(), libMesh::BoundaryVolumeSolutionTransfer::transfer_boundary_volume(), and libMesh::BoundaryVolumeSolutionTransfer::transfer_volume_boundary().

 {
   // interior parents make no sense for full-dimensional elements.
   if (this->dim() >= LIBMESH_DIM)
       return nullptr;
 
   // they USED TO BE only good for level-0 elements, but we now
   // support keeping interior_parent() valid on refined boundary
   // elements.
   // if (this->level() != 0)
   // return this->parent()->interior_parent();
 
   // We store the interior_parent pointer after both the parent
   // neighbor and neighbor pointers
   Elem * interior_p = _elemlinks[1+this->n_sides()];
 
   // If we have an interior_parent, we USED TO assume it was a
   // one-higher-dimensional interior element, but we now allow e.g.
   // edge elements to have a 3D interior_parent with no
   // intermediate 2D element.
   // libmesh_assert (!interior_p ||
   //                interior_p->dim() == (this->dim()+1));
   libmesh_assert (!interior_p ||
                   (interior_p == remote_elem) ||
                   (interior_p->dim() > this->dim()));
 
   // If an element in a multi-dimensional mesh has an interior_parent
   // link, it should be at our level or coarser, just like a neighbor
   // link.  Our collect_families() code relies on this, but it might
   // be tempting for users to manually assign something that breaks
   // it.
   //
   // However, we *also* create temporary side elements, and we don't
   // bother with creating ancestors for those, so they can be at level
   // 0 even when they're sides of non-level-0 elements.
   libmesh_assert (!interior_p ||
                   (interior_p->level() <= this->level()) ||
                   (this->level() == 0 &&
                    this->id() == DofObject::invalid_id));
 
   return interior_p;
 }

◆ interior_parent() [2/2]

Elem * libMesh::Elem::interior_parent ( )

inherited

Definition at line 1102 of file elem.C.

References libMesh::Elem::_elemlinks, libMesh::Elem::dim(), libMesh::libmesh_assert(), libMesh::Elem::n_sides(), and libMesh::remote_elem.

 {
   // See the const version for comments
   if (this->dim() >= LIBMESH_DIM)
       return nullptr;
 
   Elem * interior_p = _elemlinks[1+this->n_sides()];
 
   libmesh_assert (!interior_p ||
                   (interior_p == remote_elem) ||
                   (interior_p->dim() > this->dim()));
 
   return interior_p;
 }

◆ invalidate()

void libMesh::DofObject::invalidate ( )

inlineinherited

Invalidates all the indices for this DofObject.

Definition at line 788 of file dof_object.h.

References libMesh::DofObject::invalidate_dofs(), libMesh::DofObject::invalidate_id(), and libMesh::DofObject::invalidate_processor_id().

Referenced by libMesh::DofObject::DofObject().

 {
   this->invalidate_dofs ();
   this->invalidate_id ();
   this->invalidate_processor_id ();
 }

◆ invalidate_dofs()

void libMesh::DofObject::invalidate_dofs ( const unsigned int sys_num = libMesh::invalid_uint )

inlineinherited

Sets all degree of freedom numbers to invalid_id.

Definition at line 751 of file dof_object.h.

References libMesh::DofObject::invalid_id, libMesh::make_range(), libMesh::DofObject::n_comp_group(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), and libMesh::DofObject::set_vg_dof_base().

Referenced by libMesh::DofObject::invalidate().

 {
   const unsigned int n_sys = this->n_systems();
   // If the user does not specify the system number...
   if (sys_num >= n_sys)
     {
       for (auto s : make_range(n_sys))
         for (auto vg : make_range(this->n_var_groups(s)))
           if (this->n_comp_group(s,vg))
             this->set_vg_dof_base(s,vg,invalid_id);
     }
   // ...otherwise invalidate the dofs for all systems
   else
     for (auto vg : make_range(this->n_var_groups(sys_num)))
       if (this->n_comp_group(sys_num,vg))
         this->set_vg_dof_base(sys_num,vg,invalid_id);
 }

◆ invalidate_id()

void libMesh::DofObject::invalidate_id ( )

inlineinherited

Sets the id to invalid_id.

Definition at line 772 of file dof_object.h.

References libMesh::DofObject::invalid_id, and libMesh::DofObject::set_id().

Referenced by libMesh::DofObject::invalidate(), and DofObjectTest< Node >::testInvalidateId().

 {
   this->set_id (invalid_id);
 }

◆ invalidate_processor_id()

void libMesh::DofObject::invalidate_processor_id ( )

inlineinherited

Sets the processor id to invalid_processor_id.

Definition at line 780 of file dof_object.h.

References libMesh::DofObject::invalid_processor_id, and libMesh::DofObject::processor_id().

Referenced by libMesh::DofObject::invalidate(), libMesh::Partitioner::set_parent_processor_ids(), and DofObjectTest< Node >::testInvalidateProcId().

 {
   this->processor_id (invalid_processor_id);
 }

◆ is_ancestor_of()

bool libMesh::Elem::is_ancestor_of ( const Elem * descendant ) const

inlineinherited

Returns: true if descendant is a child of this, or a child of a child of this, etc., false otherwise or if AMR is disabled.

Definition at line 2959 of file elem.h.

References libMesh::Elem::parent().

Referenced by libMesh::UnstructuredMesh::find_neighbors().

 {
 #ifdef LIBMESH_ENABLE_AMR
   const Elem * e = descendant;
   while (e)
     {
       if (this == e)
         return true;
       e = e->parent();
     }
 #endif
   return false;
 }

◆ is_child_on_edge()

bool libMesh::Elem::is_child_on_edge	(	const unsigned int	c,
		const unsigned int	e
	)		const

virtualinherited

Returns: true if the specified child is on the specified edge.

Definition at line 2177 of file elem.C.

References libMesh::Elem::build_edge_ptr(), libMesh::Elem::child_ptr(), libMesh::Elem::n_children(), and libMesh::Elem::n_edges().

Referenced by libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values(), libMesh::BoundaryInfo::edge_boundary_ids(), and libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectEdges::operator()().

 {
   libmesh_assert_less (c, this->n_children());
   libmesh_assert_less (e, this->n_edges());
 
   std::unique_ptr<const Elem> my_edge = this->build_edge_ptr(e);
   std::unique_ptr<const Elem> child_edge = this->child_ptr(c)->build_edge_ptr(e);
 
   // We're assuming that an overlapping child edge has the same
   // number and orientation as its parent
   return (child_edge->node_id(0) == my_edge->node_id(0) ||
           child_edge->node_id(1) == my_edge->node_id(1));
 }

◆ is_child_on_side()

bool libMesh::Hex::is_child_on_side	(	const unsigned int	c,
		const unsigned int	s
	)		const

finaloverridevirtualinherited

Returns: true if the specified child is on the specified side.

Implements libMesh::Elem.

Definition at line 170 of file cell_hex.C.

References libMesh::Hex::n_children(), libMesh::Hex::n_sides(), and libMesh::Hex8::side_nodes_map.

 {
   libmesh_assert_less (c, this->n_children());
   libmesh_assert_less (s, this->n_sides());
 
   // This array maps the Hex8 node numbering to the Hex8 child
   // numbering.  I.e.
   //   node 6 touches child 7, and
   //   node 7 touches child 6, etc.
   const unsigned int node_child_map[8] = { 0, 1, 3, 2, 4, 5, 7, 6 };
 
   for (unsigned int i = 0; i != 4; ++i)
     if (node_child_map[Hex8::side_nodes_map[s][i]] == c)
       return true;
 
   return false;
 }

◆ is_edge()

bool libMesh::Hex20::is_edge ( const unsigned int i ) const

overridevirtual

Returns: true if the specified (local) node number is an edge.

Implements libMesh::Elem.

Definition at line 74 of file cell_hex20.C.

 {
   if (i > 7)
     return true;
   return false;
 }

◆ is_edge_on_side()

bool libMesh::Hex::is_edge_on_side	(	const unsigned int	e,
		const unsigned int	s
	)		const

finaloverridevirtualinherited

Returns: true if the specified edge is on the specified side.

Implements libMesh::Elem.

Definition at line 191 of file cell_hex.C.

References libMesh::Hex::edge_sides_map, libMesh::Hex::n_edges(), and libMesh::Hex::n_sides().

 {
   libmesh_assert_less (e, this->n_edges());
   libmesh_assert_less (s, this->n_sides());
 
   return (edge_sides_map[e][0] == s || edge_sides_map[e][1] == s);
 }

◆ is_face()

bool libMesh::Hex20::is_face ( const unsigned int i ) const

overridevirtual

Returns: true if the specified (local) node number is a face.

Implements libMesh::Elem.

Definition at line 81 of file cell_hex20.C.

 {
   return false;
 }

◆ is_flipped()

bool libMesh::Hex::is_flipped ( ) const

finaloverridevirtualinherited

Returns: Whether the element is flipped compared to standard libMesh (e.g. clockwise for 2D elements) node orientations.

Always returns false if a 2D element is not in the XY plane or a 1D element is not on the X axis; user code designed to work for embedded manifolds should handle any consistent orientation, and determining whether an orientation is consistent is not a local operation.

Implements libMesh::Elem.

Definition at line 254 of file cell_hex.C.

References libMesh::Elem::point(), and libMesh::triple_product().

 {
   return (triple_product(this->point(1)-this->point(0),
                          this->point(3)-this->point(0),
                          this->point(4)-this->point(0)) < 0);
 }

◆ is_internal()

bool libMesh::Elem::is_internal ( const unsigned int i ) const

inherited

Returns: true if the specified (local) node number is an internal node.

Definition at line 3437 of file elem.C.

References libMesh::Elem::dim(), libMesh::Elem::is_edge(), libMesh::Elem::is_face(), and libMesh::Elem::is_vertex().

Referenced by libMesh::Prism::edges_adjacent_to_node(), libMesh::Hex::edges_adjacent_to_node(), libMesh::InfPrism::edges_adjacent_to_node(), and libMesh::InfHex::edges_adjacent_to_node().

 {
   switch (this->dim())
   {
     case 0:
       return false;
 
     case 1:
       return !this->is_vertex(i);
 
     case 2:
       return !this->is_vertex(i) && !this->is_edge(i);
 
     case 3:
       return !this->is_vertex(i) && !this->is_edge(i) && !this->is_face(i);
 
     default:
       libmesh_error_msg("impossible element dimension " << std::to_string(this->dim()));
       return 0;
   }
 }

◆ is_linear()

virtual bool libMesh::Elem::is_linear ( ) const

inlinevirtualinherited

Returns: true if the Lagrange shape functions on this element are linear.

Reimplemented in libMesh::NodeElem, libMesh::Tet4, libMesh::Tri3, libMesh::Edge2, and libMesh::Tri3Subdivision.

Definition at line 1162 of file elem.h.

Referenced by libMesh::FEMap::init_reference_to_physical_map().

1162 { return false; }

◆ is_mid_infinite_edge_node()

virtual bool libMesh::Elem::is_mid_infinite_edge_node ( const unsigned int ) const

inlinevirtualinherited

Returns: true if the specified (local) node number is a "mid-edge" node on an infinite element edge.

This is false for all nodes on non-infinite elements, so we won't make it pure virtual, to simplify their code.

Reimplemented in libMesh::InfEdge2, libMesh::InfQuad, libMesh::InfPrism, and libMesh::InfHex.

Definition at line 1854 of file elem.h.

References libMesh::Elem::infinite(), and libMesh::libmesh_assert().

Referenced by libMesh::Elem::parent_bracketing_nodes().

1855 { libmesh_assert (!this->infinite()); return false; }

libMesh::libmesh_assert

libmesh_assert(ctx)

libMesh::Elem::infinite

virtual bool infinite() const =0

◆ is_node_on_edge()

bool libMesh::Hex20::is_node_on_edge	(	const unsigned int	n,
		const unsigned int	e
	)		const

overridevirtual

Returns: true if the specified (local) node number is on the specified edge.

Implements libMesh::Elem.

Definition at line 109 of file cell_hex20.C.

References edge_nodes_map, and libMesh::Hex::n_edges().

 {
   libmesh_assert_less (e, n_edges());
   return std::find(std::begin(edge_nodes_map[e]),
                    std::end(edge_nodes_map[e]),
                    n) != std::end(edge_nodes_map[e]);
 }

◆ is_node_on_side()

bool libMesh::Hex20::is_node_on_side	(	const unsigned int	n,
		const unsigned int	s
	)		const

overridevirtual

Returns: true if the specified (local) node number is on the specified side.

Implements libMesh::Elem.

Definition at line 86 of file cell_hex20.C.

References libMesh::Hex::n_sides(), and side_nodes_map.

 {
   libmesh_assert_less (s, n_sides());
   return std::find(std::begin(side_nodes_map[s]),
                    std::end(side_nodes_map[s]),
                    n) != std::end(side_nodes_map[s]);
 }

◆ is_remote()

virtual bool libMesh::Elem::is_remote ( ) const

inlinevirtualinherited

Returns: true if this element is remote, false otherwise.

A remote element (see RemoteElem) is a syntactic convenience – it is a placeholder for an element which exists on some other processor. Local elements are required to have valid neighbors, and these ghost elements may have remote neighbors for data structure consistency. The use of remote elements helps ensure that any element we may access has a nullptr neighbor only if it lies on the physical boundary of the domain.

Reimplemented in libMesh::RemoteElem.

Definition at line 590 of file elem.h.

Referenced by libMesh::Elem::make_links_to_me_local().

591 { return false; }

◆ is_semilocal()

bool libMesh::Elem::is_semilocal ( const processor_id_type my_pid ) const

inherited

Returns: true if this element is "semilocal" to the calling processor, which must specify its rank.

This method is discouraged, as it uses the old definition of semilocal (elements which are not local but which are point neighbors of something local) rather than any of the new definitions discussed in ghosting_functor.h

Definition at line 726 of file elem.C.

References libMesh::Elem::find_point_neighbors().

 {
   std::set<const Elem *> point_neighbors;
 
   this->find_point_neighbors(point_neighbors);
 
   for (const auto & elem : point_neighbors)
     if (elem->processor_id() == my_pid)
       return true;
 
   return false;
 }

◆ is_singular_node()

virtual bool libMesh::Elem::is_singular_node ( unsigned int ) const

inlinevirtualinherited

Returns: true iff the node at the given index has a singular mapping; i.e. is the degree-4 node on a Pyramid.

Reimplemented in libMesh::Pyramid.

Definition at line 1787 of file elem.h.

Referenced by libMesh::Elem::has_invertible_map().

1787 { return false; }

◆ is_vertex()

bool libMesh::Hex20::is_vertex ( const unsigned int i ) const

overridevirtual

Returns: true if the specified (local) node number is a vertex.

Implements libMesh::Elem.

Definition at line 67 of file cell_hex20.C.

 {
   if (i < 8)
     return true;
   return false;
 }

◆ is_vertex_on_child()

virtual bool libMesh::Elem::is_vertex_on_child	(	unsigned	int,
		unsigned int	n
	)		const

inlinevirtualinherited

Returns: true if the specified child has a vertex at the specified (child-local) node number. Except in odd cases like pyramid refinement the child will have the same local structure as the parent element.

Definition at line 746 of file elem.h.

References libMesh::Elem::is_vertex().

Referenced by libMesh::Elem::parent_bracketing_nodes().

748 { return this->is_vertex(n); }

libMesh::Elem::is_vertex

virtual bool is_vertex(const unsigned int i) const =0

◆ is_vertex_on_parent()

bool libMesh::Elem::is_vertex_on_parent	(	unsigned int	c,
		unsigned int	n
	)		const

virtualinherited

Returns: true if this element has a vertex at the specified (child-local) node number n of the specified child c.

Definition at line 3358 of file elem.C.

References libMesh::Elem::child_ptr(), libMesh::libmesh_ignore(), libMesh::Elem::n_vertices(), and libMesh::Elem::node_ptr().

Referenced by libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()().

 {
 #ifdef LIBMESH_ENABLE_AMR
 
   unsigned int my_n_vertices = this->n_vertices();
   for (unsigned int n_parent = 0; n_parent != my_n_vertices;
        ++n_parent)
     if (this->node_ptr(n_parent) == this->child_ptr(c)->node_ptr(n))
       return true;
   return false;
 
 #else
 
   // No AMR?
   libmesh_ignore(c,n);
   libmesh_error_msg("ERROR: AMR disabled, how did we get here?");
   return true;
 
 #endif
 }

◆ key() [1/4]

virtual dof_id_type libMesh::Elem::key

inherited

Don't hide Elem::key() defined in the base class.

◆ key() [2/4]

dof_id_type libMesh::Elem::key

inherited

Don't hide Elem::key() defined in the base class.

Definition at line 624 of file elem.C.

 {
   const unsigned short n_n = this->n_nodes();
 
   std::array<dof_id_type, Elem::max_n_nodes> node_ids;
 
   for (unsigned short n=0; n != n_n; ++n)
     node_ids[n] = this->node_id(n);
 
   // Always sort, so that different local node numberings hash to the
   // same value.
   std::sort (node_ids.begin(), node_ids.begin()+n_n);
 
   return Utility::hashword(node_ids.data(), n_n);
 }

◆ key() [3/4]

dof_id_type libMesh::Hex::key ( const unsigned int s ) const

overridevirtualinherited

Returns: An id associated with the s side of this element. The id is not necessarily unique, but should be close.

Implements libMesh::Elem.

Reimplemented in libMesh::Hex27.

Definition at line 102 of file cell_hex.C.

References libMesh::Elem::compute_key(), libMesh::Hex::n_sides(), libMesh::Elem::node_id(), and libMesh::Hex8::side_nodes_map.

 {
   libmesh_assert_less (s, this->n_sides());
 
   return this->compute_key(this->node_id(Hex8::side_nodes_map[s][0]),
                            this->node_id(Hex8::side_nodes_map[s][1]),
                            this->node_id(Hex8::side_nodes_map[s][2]),
                            this->node_id(Hex8::side_nodes_map[s][3]));
 }

◆ key() [4/4]

dof_id_type libMesh::Elem::key ( ) const

virtualinherited

Returns: An id associated with the global node ids of this element. The id is not necessarily unique, but should be close. Uses the same hash as the key(s) function, so for example if "tri3" is side 0 of "tet4", then tri3->key()==tet4->key(0).

Reimplemented in libMesh::Tet4, libMesh::Edge3, libMesh::Edge4, libMesh::Edge2, libMesh::Quad9, libMesh::Quad, libMesh::Polygon, and libMesh::Tri.

Definition at line 624 of file elem.C.

References libMesh::Utility::hashword(), libMesh::Elem::n_nodes(), and libMesh::Elem::node_id().

Referenced by libMesh::InfQuad6::key(), libMesh::Prism18::key(), libMesh::Pyramid14::key(), and libMesh::InfHex18::key().

 {
   const unsigned short n_n = this->n_nodes();
 
   std::array<dof_id_type, Elem::max_n_nodes> node_ids;
 
   for (unsigned short n=0; n != n_n; ++n)
     node_ids[n] = this->node_id(n);
 
   // Always sort, so that different local node numberings hash to the
   // same value.
   std::sort (node_ids.begin(), node_ids.begin()+n_n);
 
   return Utility::hashword(node_ids.data(), n_n);
 }

◆ length()

Real libMesh::Elem::length	(	const unsigned int	n1,
		const unsigned int	n2
	)		const

inherited

Returns: The distance between nodes n1 and n2.

Useful for computing the lengths of the sides of elements.

Definition at line 613 of file elem.C.

References libMesh::Elem::n_vertices(), and libMesh::Elem::point().

Referenced by libMesh::Hex::quality(), libMesh::Quad::quality(), and libMesh::InfHex::quality().

 {
   libmesh_assert_less ( n1, this->n_vertices() );
   libmesh_assert_less ( n2, this->n_vertices() );
 
   return (this->point(n1) - this->point(n2)).norm();
 }

◆ level()

unsigned int libMesh::Elem::level ( ) const

inlineinherited

Returns: The refinement level of the current element.

If the element's parent is nullptr then by convention it is at level 0, otherwise it is simply at one level greater than its parent.

Definition at line 3024 of file elem.h.

References libMesh::Elem::dim(), libMesh::Elem::level(), and libMesh::Elem::parent().

 {
 #ifdef LIBMESH_ENABLE_AMR
 
   // if I don't have a parent I was
   // created directly from file
   // or by the user, so I am a
   // level-0 element
   if (this->parent() == nullptr)
     return 0;
 
   // if the parent and this element are of different
   // dimensionality we are at the same level as
   // the parent (e.g. we are the 2D side of a
   // 3D element)
   if (this->dim() != this->parent()->dim())
     return this->parent()->level();
 
   // otherwise we are at a level one
   // higher than our parent
   return (this->parent()->level() + 1);
 
 #else
 
   // Without AMR all elements are
   // at level 0.
   return 0;
 
 #endif
 }

◆ libmesh_assert_valid_neighbors()

void libMesh::Elem::libmesh_assert_valid_neighbors ( ) const

inherited

Checks for consistent neighbor links on this element.

Definition at line 1254 of file elem.C.

References libMesh::Elem::dim(), libMesh::libmesh_assert(), libMesh::Elem::n_neighbors(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::parent(), libMesh::remote_elem, libMesh::Elem::side_index_range(), libMesh::Elem::subactive(), and libMesh::Elem::which_neighbor_am_i().

 {
   for (auto n : this->side_index_range())
     {
       const Elem * neigh = this->neighbor_ptr(n);
 
       // Any element might have a remote neighbor; checking
       // to make sure that's not inaccurate is tough.
       if (neigh == remote_elem)
         continue;
 
       if (neigh)
         {
           // Only subactive elements have subactive neighbors
           libmesh_assert (this->subactive() || !neigh->subactive());
 
           const Elem * elem = this;
 
           // If we're subactive but our neighbor isn't, its
           // return neighbor link will be to our first active
           // ancestor OR to our inactive ancestor of the same
           // level as neigh,
           if (this->subactive() && !neigh->subactive())
             {
               for (elem = this; !elem->active();
                    elem = elem->parent())
                 libmesh_assert(elem);
             }
           else
             {
               unsigned int rev = neigh->which_neighbor_am_i(elem);
               libmesh_assert_less (rev, neigh->n_neighbors());
 
               if (this->subactive() && !neigh->subactive())
                 {
                   while (neigh->neighbor_ptr(rev) != elem)
                     {
                       libmesh_assert(elem->parent());
                       elem = elem->parent();
                     }
                 }
               else
                 {
                   const Elem * nn = neigh->neighbor_ptr(rev);
                   libmesh_assert(nn);
 
                   for (; elem != nn; elem = elem->parent())
                     libmesh_assert(elem);
                 }
             }
         }
       // If we don't have a neighbor and we're not subactive, our
       // ancestors shouldn't have any neighbors in this same
       // direction.
       else if (!this->subactive())
         {
           const Elem * my_parent = this->parent();
           if (my_parent &&
               // A parent with a different dimension isn't really one of
               // our ancestors, it means we're on a boundary mesh and this
               // is an interior mesh element for which we're on a side.
               // Nothing to test for in that case.
               (my_parent->dim() == this->dim()))
             libmesh_assert (!my_parent->neighbor_ptr(n));
         }
     }
 }

◆ libmesh_assert_valid_node_pointers()

void libMesh::Elem::libmesh_assert_valid_node_pointers ( ) const

inherited

Checks for a valid id and pointers to nodes with valid ids on this element.

Definition at line 1242 of file elem.C.

References libMesh::libmesh_assert(), libMesh::Elem::node_index_range(), libMesh::Elem::node_ptr(), and libMesh::DofObject::valid_id().

 {
   libmesh_assert(this->valid_id());
   for (auto n : this->node_index_range())
     {
       libmesh_assert(this->node_ptr(n));
       libmesh_assert(this->node_ptr(n)->valid_id());
     }
 }

◆ local_edge_node()

unsigned int libMesh::Hex20::local_edge_node	(	unsigned int	edge,
		unsigned int	edge_node
	)		const

overridevirtual

Returns: Hex20::edge_nodes_map[edge][edge_node] after doing some range checking.

Reimplemented from libMesh::Hex.

Definition at line 192 of file cell_hex20.C.

References edge_nodes_map, libMesh::Hex::n_edges(), and nodes_per_edge.

 {
   libmesh_assert_less (edge, this->n_edges());
   libmesh_assert_less (edge_node, Hex20::nodes_per_edge);
 
   return Hex20::edge_nodes_map[edge][edge_node];
 }

◆ local_node()

unsigned int libMesh::Elem::local_node ( const dof_id_type i ) const

inlineinherited

Returns: The local id number of global Node id i, or invalid_uint if Node id i is not local.

Definition at line 2424 of file elem.h.

References libMesh::invalid_uint, libMesh::make_range(), libMesh::Elem::n_nodes(), and libMesh::Elem::node_id().

Referenced by libMesh::UnstructuredMesh::stitching_helper().

 {
   for (auto n : make_range(this->n_nodes()))
     if (this->node_id(n) == i)
       return n;
 
   return libMesh::invalid_uint;
 }

◆ local_side_node()

unsigned int libMesh::Hex20::local_side_node	(	unsigned int	side,
		unsigned int	side_node
	)		const

overridevirtual

Returns: Hex20::side_nodes_map[side][side_node] after doing some range checking.

Reimplemented from libMesh::Hex.

Definition at line 181 of file cell_hex20.C.

References libMesh::Hex::n_sides(), nodes_per_side, and side_nodes_map.

 {
   libmesh_assert_less (side, this->n_sides());
   libmesh_assert_less (side_node, Hex20::nodes_per_side);
 
   return Hex20::side_nodes_map[side][side_node];
 }

◆ local_singular_node()

virtual unsigned int libMesh::Elem::local_singular_node	(	const Point &	,
		const Real	= `TOLERANCE*TOLERANCE`
	)		const

inlinevirtualinherited

Returns: The local node index of the given point IF said node has a singular Jacobian for this element. If the given point is not a node or is a node and does not have a singular Jacobian, this will return invalid_uint.

The intention is for this to be overridden in derived element classes that do have nodes that have singular Jacobians. When mapping failures are caught, we can check this to see if the failed physical point is actually a singular point and return the correct master point.

Reimplemented in libMesh::Pyramid.

Definition at line 1780 of file elem.h.

References libMesh::invalid_uint.

Referenced by libMesh::FEMap::inverse_map().

1781 { return invalid_uint; }

libMesh::invalid_uint

const unsigned int invalid_uint

A number which is used quite often to represent an invalid or uninitialized value for an unsigned int...

Definition: libmesh.h:293

◆ loose_bounding_box()

BoundingBox libMesh::Cell::loose_bounding_box ( ) const

overridevirtualinherited

Returns: A bounding box (not necessarily the minimal bounding box) containing the geometric element.

Reimplemented from libMesh::Elem.

Reimplemented in libMesh::Hex8, libMesh::Prism6, and libMesh::Pyramid5.

Definition at line 26 of file cell.C.

References libMesh::Elem::build_side_ptr(), libMesh::Elem::n_sides(), libMesh::Elem::side_ptr(), and libMesh::BoundingBox::union_with().

 {
   // This might have curved sides, but it's definitely *not* curving
   // through 4-D space, so the full bounding box is just the merger of
   // the sides' bounding boxes.
 
   std::unique_ptr<const Elem> side_ptr { this->build_side_ptr(0, false) };
   BoundingBox bbox = side_ptr->loose_bounding_box();
   unsigned int my_n_sides = this->n_sides();
   for (unsigned s=1; s < my_n_sides; ++s)
     {
       this->build_side_ptr(side_ptr, s);
       bbox.union_with(side_ptr->loose_bounding_box());
     }
 
   return bbox;
 }

◆ low_order_key()

dof_id_type libMesh::Hex::low_order_key ( const unsigned int s ) const

overridevirtualinherited

Returns: An id associated with the s side of this element, as defined solely by element vertices. The id is not necessarily unique, but should be close. This is particularly useful in the MeshBase::find_neighbors() routine.

Implements libMesh::Elem.

Definition at line 114 of file cell_hex.C.

References libMesh::Elem::compute_key(), libMesh::Hex::n_sides(), libMesh::Elem::node_id(), and libMesh::Hex8::side_nodes_map.

 {
   libmesh_assert_less (s, this->n_sides());
 
   return this->compute_key(this->node_id(Hex8::side_nodes_map[s][0]),
                            this->node_id(Hex8::side_nodes_map[s][1]),
                            this->node_id(Hex8::side_nodes_map[s][2]),
                            this->node_id(Hex8::side_nodes_map[s][3]));
 }

◆ make_links_to_me_local()

void libMesh::Elem::make_links_to_me_local	(	unsigned int	n,
		unsigned int	neighbor_side
	)

inherited

Resets the neighbor_side pointers of our nth neighbor (and its descendants, if appropriate) to point to this Elem instead of to the global remote_elem.

Used by the library when a formerly remote element is being added to the local processor.

Definition at line 1326 of file elem.C.

References libMesh::Elem::active(), libMesh::Elem::family_tree_by_side(), libMesh::Elem::has_children(), libMesh::Elem::is_remote(), libMesh::Elem::JUST_REFINED, libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::parent(), libMesh::Elem::refinement_flag(), libMesh::remote_elem, and libMesh::Elem::subactive().

 {
   Elem * neigh = this->neighbor_ptr(n);
 
   // Don't bother calling this function unless it's necessary
   libmesh_assert(neigh);
   libmesh_assert(!neigh->is_remote());
 
   // We never have neighbors more refined than us
   libmesh_assert_less_equal (neigh->level(), this->level());
 
   // We never have subactive neighbors of non subactive elements
   libmesh_assert(!neigh->subactive() || this->subactive());
 
   // If we have a neighbor less refined than us then it must not
   // have any more refined descendants we could have pointed to
   // instead.
   libmesh_assert((neigh->level() == this->level()) ||
                  (neigh->active() && !this->subactive()) ||
                  (!neigh->has_children() && this->subactive()));
 
   // If neigh is at our level, then its family might have
   // remote_elem neighbor links which need to point to us
   // instead, but if not, then we're done.
   if (neigh->level() != this->level())
     return;
 
   // What side of neigh are we on?  nn.
   //
   // We can't use the usual Elem method because we're in the middle of
   // restoring topology.  We can't compare side_ptr nodes because
   // users want to abuse neighbor_ptr to point to
   // not-technically-neighbors across mesh slits.  We can't compare
   // node locations because users want to move those
   // not-technically-neighbors until they're
   // not-even-geometrically-neighbors.
 
   // Find any elements that ought to point to elem
   std::vector<Elem *> neigh_family;
 #ifdef LIBMESH_ENABLE_AMR
   if (this->active())
     neigh->family_tree_by_side(neigh_family, nn);
   else
 #endif
     neigh_family.push_back(neigh);
 
   // And point them to elem
   for (auto & neigh_family_member : neigh_family)
     {
       // Only subactive elements point to other subactive elements
       if (this->subactive() && !neigh_family_member->subactive())
         continue;
 
       // Ideally, the neighbor link ought to either be correct
       // already or ought to be to remote_elem.
       //
       // However, if we're redistributing a newly created elem,
       // after an AMR step but before find_neighbors has fixed up
       // neighbor links, we might have an out of date neighbor
       // link to elem's parent instead.
 #ifdef LIBMESH_ENABLE_AMR
       libmesh_assert((neigh_family_member->neighbor_ptr(nn) &&
                       (neigh_family_member->neighbor_ptr(nn)->active() ||
                        neigh_family_member->neighbor_ptr(nn)->is_ancestor_of(this))) ||
                      (neigh_family_member->neighbor_ptr(nn) == remote_elem) ||
                      ((this->refinement_flag() == JUST_REFINED) &&
                       (this->parent() != nullptr) &&
                       (neigh_family_member->neighbor_ptr(nn) == this->parent())));
 #else
       libmesh_assert((neigh_family_member->neighbor_ptr(nn) == this) ||
                      (neigh_family_member->neighbor_ptr(nn) == remote_elem));
 #endif
 
       neigh_family_member->set_neighbor(nn, this);
     }
 }

◆ make_links_to_me_remote()

void libMesh::Elem::make_links_to_me_remote ( )

inherited

Resets this element's neighbors' appropriate neighbor pointers and its parent's and children's appropriate pointers to point to the global remote_elem instead of this.

Used by the library before an element becomes remote on the local processor.

Definition at line 1404 of file elem.C.

References libMesh::Elem::child_ptr(), libMesh::Elem::child_ref_range(), libMesh::Elem::dim(), libMesh::Elem::has_children(), libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::Elem::neighbor_ptr_range(), libMesh::Elem::parent(), libMesh::remote_elem, libMesh::Elem::set_child(), libMesh::Elem::subactive(), and libMesh::Elem::which_child_am_i().

Referenced by libMesh::MeshCommunication::delete_remote_elements().

 {
   libmesh_assert_not_equal_to (this, remote_elem);
 
   // We need to have handled any children first
 #if defined(LIBMESH_ENABLE_AMR) && defined(DEBUG)
   if (this->has_children())
     for (auto & child : this->child_ref_range())
       libmesh_assert_equal_to (&child, remote_elem);
 #endif
 
   // Remotify any neighbor links
   for (auto neigh : this->neighbor_ptr_range())
     {
       if (neigh && neigh != remote_elem)
         {
           // My neighbor should never be more refined than me; my real
           // neighbor would have been its parent in that case.
           libmesh_assert_greater_equal (this->level(), neigh->level());
 
           if (this->level() == neigh->level() &&
               neigh->has_neighbor(this))
             {
 #ifdef LIBMESH_ENABLE_AMR
               // My neighbor may have descendants which also consider me a
               // neighbor
               std::vector<Elem *> family;
               neigh->total_family_tree_by_neighbor (family, this);
 
               // FIXME - There's a lot of ugly const_casts here; we
               // may want to make remote_elem non-const
               for (auto & n : family)
                 {
                   libmesh_assert (n);
                   if (n == remote_elem)
                     continue;
                   unsigned int my_s = n->which_neighbor_am_i(this);
                   libmesh_assert_less (my_s, n->n_neighbors());
                   libmesh_assert_equal_to (n->neighbor_ptr(my_s), this);
                   n->set_neighbor(my_s, const_cast<RemoteElem *>(remote_elem));
                 }
 #else
               unsigned int my_s = neigh->which_neighbor_am_i(this);
               libmesh_assert_less (my_s, neigh->n_neighbors());
               libmesh_assert_equal_to (neigh->neighbor_ptr(my_s), this);
               neigh->set_neighbor(my_s, const_cast<RemoteElem *>(remote_elem));
 #endif
             }
 #ifdef LIBMESH_ENABLE_AMR
           // Even if my neighbor doesn't link back to me, it might
           // have subactive descendants which do
           else if (neigh->has_children())
             {
               // If my neighbor at the same level doesn't have me as a
               // neighbor, I must be subactive
               libmesh_assert(this->level() > neigh->level() ||
                              this->subactive());
 
               // My neighbor must have some ancestor of mine as a
               // neighbor
               Elem * my_ancestor = this->parent();
               libmesh_assert(my_ancestor);
               while (!neigh->has_neighbor(my_ancestor))
                 {
                   my_ancestor = my_ancestor->parent();
                   libmesh_assert(my_ancestor);
                 }
 
               // My neighbor may have descendants which consider me a
               // neighbor
               std::vector<Elem *> family;
               neigh->total_family_tree_by_subneighbor (family, my_ancestor, this);
 
               for (auto & n : family)
                 {
                   libmesh_assert (n);
                   if (n->is_remote())
                     continue;
                   unsigned int my_s = n->which_neighbor_am_i(this);
                   libmesh_assert_less (my_s, n->n_neighbors());
                   libmesh_assert_equal_to (n->neighbor_ptr(my_s), this);
                   // TODO: we may want to make remote_elem non-const.
                   n->set_neighbor(my_s, const_cast<RemoteElem *>(remote_elem));
                 }
             }
 #endif
         }
     }
 
 #ifdef LIBMESH_ENABLE_AMR
   // Remotify parent's child link
   Elem * my_parent = this->parent();
   if (my_parent &&
       // As long as it's not already remote
       my_parent != remote_elem &&
       // And it's a real parent, not an interior parent
       this->dim() == my_parent->dim())
     {
       unsigned int me = my_parent->which_child_am_i(this);
       libmesh_assert_equal_to (my_parent->child_ptr(me), this);
       my_parent->set_child(me, const_cast<RemoteElem *>(remote_elem));
     }
 #endif
 }

◆ mapping_data()

unsigned char libMesh::Elem::mapping_data ( ) const

inlineinherited

Returns: The value of the mapping data for the element.

Definition at line 3086 of file elem.h.

References libMesh::Elem::_map_data.

Referenced by libMesh::MeshTools::Modification::all_tri(), libMesh::Elem::disconnected_clone(), libMesh::MeshTools::Modification::flatten(), libMesh::Elem::get_info(), libMesh::Polygon::Polygon(), libMesh::rational_fe_shape(), libMesh::rational_fe_shape_deriv(), libMesh::rational_fe_shape_second_deriv(), libMesh::rational_fe_weighted_shapes(), libMesh::rational_fe_weighted_shapes_derivs(), and libMesh::SimplexRefiner::refine_via_edges().

 {
   return _map_data;
 }

◆ mapping_type()

ElemMappingType libMesh::Elem::mapping_type ( ) const

inlineinherited

Returns: The value of the mapping type for the element.

Definition at line 3070 of file elem.h.

References libMesh::Elem::_map_type.

 {
   return static_cast<ElemMappingType>(_map_type);
 }

◆ master_point()

virtual Point libMesh::Hex::master_point ( const unsigned int i ) const

inlinefinaloverridevirtualinherited

Returns: The Point associated with local Node i, in master element rather than physical coordinates.

Implements libMesh::Elem.

Definition at line 62 of file cell_hex.h.

References libMesh::Hex::_master_points, and libMesh::Elem::n_nodes().

   {
     libmesh_assert_less(i, this->n_nodes());
     return Point(_master_points[i][0],
                  _master_points[i][1],
                  _master_points[i][2]);
   }

◆ max_descendant_p_level()

unsigned int libMesh::Elem::max_descendant_p_level ( ) const

inlineinherited

Returns: The maximum value of the p-refinement levels of an ancestor element's descendants.

Definition at line 3196 of file elem.h.

References libMesh::Elem::_p_level, libMesh::Elem::active(), libMesh::Elem::child_ref_range(), libMesh::libmesh_assert(), libMesh::Elem::p_level(), and libMesh::Elem::subactive().

Referenced by libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values().

 {
   // This is undefined for subactive elements,
   // which have no active descendants
   libmesh_assert (!this->subactive());
   if (this->active())
     return this->p_level();
 
   unsigned int max_p_level = _p_level;
   for (auto & c : child_ref_range())
     max_p_level = std::max(max_p_level,
                            c.max_descendant_p_level());
   return max_p_level;
 }

◆ min_new_p_level_by_neighbor()

unsigned int libMesh::Elem::min_new_p_level_by_neighbor	(	const Elem *	neighbor,
		unsigned int	current_min
	)		const

inherited

Returns: The minimum new p-refinement level (i.e. after refinement and coarsening is done) of elements which are descended from this element and which share a side with the active neighbor.

Definition at line 2223 of file elem.C.

References libMesh::Elem::active(), libMesh::Elem::child_ref_range(), libMesh::Elem::COARSEN, libMesh::Elem::has_neighbor(), libMesh::libmesh_assert(), libMesh::Elem::p_level(), libMesh::Elem::p_refinement_flag(), libMesh::Elem::REFINE, libMesh::remote_elem, and libMesh::Elem::subactive().

 {
   libmesh_assert(!this->subactive());
   libmesh_assert(neighbor_in->active());
 
   // If we're an active element this is simple
   if (this->active())
     {
       unsigned int new_p_level = this->p_level();
       if (this->p_refinement_flag() == Elem::REFINE)
         new_p_level += 1;
       if (this->p_refinement_flag() == Elem::COARSEN)
         {
           libmesh_assert_greater (new_p_level, 0);
           new_p_level -= 1;
         }
       return std::min(current_min, new_p_level);
     }
 
   libmesh_assert(has_neighbor(neighbor_in));
 
   unsigned int min_p_level = current_min;
 
   for (auto & c : this->child_ref_range())
     if (&c != remote_elem && c.has_neighbor(neighbor_in))
       min_p_level =
         c.min_new_p_level_by_neighbor(neighbor_in, min_p_level);
 
   return min_p_level;
 }

◆ min_p_level_by_neighbor()

unsigned int libMesh::Elem::min_p_level_by_neighbor	(	const Elem *	neighbor,
		unsigned int	current_min
	)		const

inherited

Returns: The minimum p-refinement level of elements which are descended from this element, and which share a side with the active neighbor.

Definition at line 2194 of file elem.C.

References libMesh::Elem::active(), libMesh::Elem::child_ref_range(), libMesh::Elem::has_neighbor(), libMesh::libmesh_assert(), libMesh::Elem::p_level(), libMesh::remote_elem, and libMesh::Elem::subactive().

Referenced by libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), and libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints().

 {
   libmesh_assert(!this->subactive());
   libmesh_assert(neighbor_in->active());
 
   // If we're an active element this is simple
   if (this->active())
     return std::min(current_min, this->p_level());
 
   libmesh_assert(has_neighbor(neighbor_in));
 
   // The p_level() of an ancestor element is already the minimum
   // p_level() of its children - so if that's high enough, we don't
   // need to examine any children.
   if (current_min <= this->p_level())
     return current_min;
 
   unsigned int min_p_level = current_min;
 
   for (auto & c : this->child_ref_range())
     if (&c != remote_elem && c.has_neighbor(neighbor_in))
       min_p_level =
         c.min_p_level_by_neighbor(neighbor_in, min_p_level);
 
   return min_p_level;
 }

◆ n_children()

virtual unsigned int libMesh::Hex::n_children ( ) const

inlinefinaloverridevirtualinherited

Returns: 8.

Implements libMesh::Elem.

Definition at line 100 of file cell_hex.h.

Referenced by libMesh::Hex::is_child_on_side().

100 { return 8; }

◆ n_comp()

unsigned int libMesh::DofObject::n_comp	(	const unsigned int	s,
		const unsigned int	var
	)		const

inlineinherited

Returns: The number of components for variable var of system s associated with this DofObject. For example, the HIERARCHIC shape functions may have multiple DoFs associated with one node. Another example is the MONOMIALs, where only the elements hold the DoFs. For the different spatial directions, and orders, see FE.

Definition at line 1002 of file dof_object.h.

References libMesh::DofObject::n_comp_group(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_vars(), and libMesh::DofObject::var_to_vg().

Referenced by libMesh::DofMap::allgather_recursive_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::DofMap::constrain_p_dofs(), libMesh::ExodusII_IO::copy_elemental_solution(), libMesh::Nemesis_IO::copy_elemental_solution(), libMesh::ExodusII_IO::copy_nodal_solution(), libMesh::Nemesis_IO::copy_nodal_solution(), libMesh::DofMap::distribute_dofs(), libMesh::DofObject::dof_number(), libMesh::DofObject::DofObject(), libMesh::OldSolutionCoefs< Output, point_output >::eval_at_node(), libMesh::OldSolutionValue< Output, point_output >::eval_at_node(), libMesh::OldSolutionCoefs< Output, point_output >::eval_mixed_derivatives(), libMesh::OldSolutionValue< Output, point_output >::eval_mixed_derivatives(), libMesh::Node::get_info(), libMesh::Elem::get_info(), libMesh::DofMap::local_variable_indices(), main(), libMesh::DofObject::n_dofs(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectSides::operator()(), libMesh::DofObject::operator=(), libMesh::DofObject::print_dof_info(), libMesh::DofObject::set_dof_number(), libMesh::DofObject::set_n_vars_per_group(), libMesh::DofMap::set_nonlocal_dof_objects(), and libMesh::Nemesis_IO_Helper::write_nodal_solution().

 {
   libmesh_assert_less (s,   this->n_systems());
   libmesh_assert_less (var, this->n_vars(s));
 
   return this->n_comp_group(s,this->var_to_vg(s,var));
 }

◆ n_comp_group()

unsigned int libMesh::DofObject::n_comp_group	(	const unsigned int	s,
		const unsigned int	vg
	)		const

inlineinherited

Returns: The number of components for VariableGroup vg of system s associated with this DofObject. For example, the HIERARCHIC shape functions may have multiple DoFs associated with one node. Another example is the MONOMIALs, where only the elements hold the DoFs. For the different spatial directions, and orders, see FE.

Definition at line 1015 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::ncv_magic, and libMesh::DofObject::start_idx().

Referenced by libMesh::DofMap::_dof_indices(), libMesh::DofMap::_node_dof_indices(), libMesh::DofMap::distribute_local_dofs_node_major(), libMesh::DofMap::distribute_local_dofs_var_major(), libMesh::DofMap::dof_indices(), libMesh::DofObject::dof_number(), libMesh::OldSolutionCoefs< Output, point_output >::eval_old_dofs(), libMesh::OldSolutionValue< Output, point_output >::eval_old_dofs(), libMesh::DofObject::invalidate_dofs(), libMesh::DofObject::n_comp(), libMesh::DofMap::old_dof_indices(), libMesh::BuildProjectionList::operator()(), libMesh::DofMap::reinit(), libMesh::DofObject::set_dof_number(), libMesh::DofObject::set_n_comp_group(), libMesh::DofObject::set_n_vars_per_group(), and libMesh::DofMap::set_nonlocal_dof_objects().

 {
   libmesh_assert_less (s,  this->n_systems());
   libmesh_assert_less (vg, this->n_var_groups(s));
 
   const unsigned int
     start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg), _idx_buf.size());
 
   return (_idx_buf[start_idx_sys + 2*vg] % ncv_magic);
 }

◆ n_dofs()

unsigned int libMesh::DofObject::n_dofs	(	const unsigned int	s,
		const unsigned int	var = `libMesh::invalid_uint`
	)		const

inlineinherited

Returns: The number of degrees of freedom associated with system s directly stored on this object. Optionally only degrees of freedom for variable number var are counted. Does not count degrees of freedom only indirectly associated with this object, such as those stored on an element's nodes when n_dofs() is called on the element itself.

Definition at line 806 of file dof_object.h.

References libMesh::invalid_uint, libMesh::make_range(), libMesh::DofObject::n_comp(), libMesh::DofObject::n_systems(), and libMesh::DofObject::n_vars().

Referenced by libMesh::PetscDMWrapper::add_dofs_helper(), and libMesh::EquationSystems::build_parallel_solution_vector().

 {
   libmesh_assert_less (s, this->n_systems());
 
   unsigned int num = 0;
 
   // Count all variables
   if (var == libMesh::invalid_uint)
     for (auto v : make_range(this->n_vars(s)))
       num += this->n_comp(s,v);
 
   // Only count specified variable
   else
     num = this->n_comp(s,var);
 
   return num;
 }

◆ n_edges()

virtual unsigned int libMesh::Hex::n_edges ( ) const

inlinefinaloverridevirtualinherited

Returns: 12. All hexahedra have 12 edges.

Implements libMesh::Elem.

Definition at line 90 of file cell_hex.h.

Referenced by libMesh::Hex::is_edge_on_side(), libMesh::Hex8::is_node_on_edge(), is_node_on_edge(), libMesh::Hex27::is_node_on_edge(), libMesh::Hex::local_edge_node(), local_edge_node(), libMesh::Hex27::local_edge_node(), libMesh::Hex8::nodes_on_edge(), libMesh::Hex27::nodes_on_edge(), nodes_on_edge(), and libMesh::Hex::sides_on_edge().

90 { return 12; }

◆ n_extra_integers()

unsigned int libMesh::DofObject::n_extra_integers ( ) const

inlineinherited

Returns how many extra integers are associated to the DofObject.

If non-integer data has been associated, each datum of type T counts for sizeof(T)/sizeof(dof_id_type) times in the return value.

Definition at line 1170 of file dof_object.h.

References libMesh::DofObject::_idx_buf, and libMesh::DofObject::start_idx_ints().

Referenced by libMesh::DofObject::add_extra_integers(), libMesh::MeshTools::Modification::all_tri(), libMesh::Elem::disconnected_clone(), libMesh::MeshTools::Modification::flatten(), libMesh::DofObject::get_extra_datum(), libMesh::DofObject::get_extra_integer(), libMesh::CheckpointIO::read_connectivity(), libMesh::CheckpointIO::read_nodes(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::Elem::refine(), libMesh::SimplexRefiner::refine_via_edges(), libMesh::DofObject::set_extra_datum(), libMesh::DofObject::set_extra_integer(), libMesh::DofObject::set_n_systems(), libMesh::DofObject::set_n_vars_per_group(), DofObjectTest< Node >::testAddExtraData(), DofObjectTest< Node >::testAddSystemExtraInts(), DofObjectTest< Node >::testSetNSystemsExtraInts(), and DofObjectTest< Node >::testSetNVariableGroupsExtraInts().

 {
   if (_idx_buf.empty())
     return 0;
 
   const int hdr = dof_id_signed_type(_idx_buf[0]);
   if (hdr >= 0)
     return 0;
 
   const unsigned int start_idx_i = this->start_idx_ints();
 
   return _idx_buf.size() - start_idx_i;
 }

◆ n_faces()

virtual unsigned int libMesh::Hex::n_faces ( ) const

inlinefinaloverridevirtualinherited

Returns: 6. All hexahedra have 6 faces.

Implements libMesh::Elem.

Definition at line 95 of file cell_hex.h.

95 { return 6; }

◆ n_neighbors()

unsigned int libMesh::Elem::n_neighbors ( ) const

inlineinherited

Returns: The number of neighbors the element that has been derived from this class has.

Only face (or edge in 2D) neighbors are stored, so this method returns n_sides(). At one point we intended to allow derived classes to override this, but too much current libMesh code assumes n_neighbors==n_sides.

Definition at line 692 of file elem.h.

References libMesh::Elem::n_sides().

Referenced by libMesh::Elem::_last_side(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints(), libMesh::MeshTools::find_hanging_nodes_and_parents(), libMesh::Tri3Subdivision::get_ordered_valence(), libMesh::MeshTools::libmesh_assert_valid_neighbors(), libMesh::Elem::libmesh_assert_valid_neighbors(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::neighbor_ptr_range(), libMesh::Elem::nullify_neighbors(), libMesh::Elem::set_neighbor(), libMesh::Elem::topological_neighbor(), and libMesh::Elem::topologically_equal().

693 { return this->n_sides(); }

libMesh::Elem::n_sides

virtual unsigned int n_sides() const =0

◆ n_nodes()

virtual unsigned int libMesh::Hex20::n_nodes ( ) const

inlineoverridevirtual

Returns: 20.

Implements libMesh::Elem.

Definition at line 96 of file cell_hex20.h.

References num_nodes.

Referenced by second_order_adjacent_vertex(), and second_order_child_vertex().

96 { return num_nodes; }

libMesh::Hex20::num_nodes

static const int num_nodes

Geometric constants for Hex20.

Definition: cell_hex20.h:213

◆ n_nodes_in_child()

virtual unsigned int libMesh::Elem::n_nodes_in_child ( unsigned int ) const

inlinevirtualinherited

Returns: The number of nodes the given child of this element contains. Except in odd cases like pyramid refinement this will be the same as the number of nodes in the parent element.

Definition at line 652 of file elem.h.

References libMesh::Elem::n_nodes().

Referenced by libMesh::Elem::as_parent_node(), libMesh::Elem::bracketing_nodes(), and libMesh::Elem::parent_bracketing_nodes().

653 { return this->n_nodes(); }

libMesh::Elem::n_nodes

virtual unsigned int n_nodes() const =0

◆ n_objects() [1/2]

static unsigned int libMesh::ReferenceCounter::n_objects ( )

inlinestaticinherited

Prints the number of outstanding (created, but not yet destroyed) objects.

Definition at line 85 of file reference_counter.h.

References libMesh::ReferenceCounter::_n_objects.

Referenced by libMesh::LibMeshInit::~LibMeshInit().

86 { return _n_objects; }

libMesh::ReferenceCounter::_n_objects

static Threads::atomic< unsigned int > _n_objects

The number of objects.

Definition: reference_counter.h:132

◆ n_objects() [2/2]

static unsigned int libMesh::ReferenceCounter::n_objects ( )

inlinestaticinherited

Prints the number of outstanding (created, but not yet destroyed) objects.

Definition at line 85 of file reference_counter.h.

References libMesh::ReferenceCounter::_n_objects.

Referenced by libMesh::LibMeshInit::~LibMeshInit().

86 { return _n_objects; }

libMesh::ReferenceCounter::_n_objects

static Threads::atomic< unsigned int > _n_objects

The number of objects.

Definition: reference_counter.h:132

◆ n_permutations()

virtual unsigned int libMesh::Hex::n_permutations ( ) const

inlinefinaloverridevirtualinherited

Six sides, four orientations per side.

Implements libMesh::Elem.

Definition at line 187 of file cell_hex.h.

187 { return 24; }

◆ n_pseudo_systems()

unsigned int libMesh::DofObject::n_pseudo_systems ( ) const

inlineinherited

Returns: The total number of pseudo-systems associated with this DofObject : n_systems(), plus one iff this->has_extra_integers()

Definition at line 947 of file dof_object.h.

References libMesh::DofObject::_idx_buf.

Referenced by libMesh::DofObject::end_idx(), libMesh::DofObject::set_extra_datum(), and libMesh::DofObject::set_extra_integer().

 {
   const int hdr = _idx_buf.empty() ?
     0 : cast_int<int>(dof_id_signed_type(_idx_buf[0]));
   return std::abs(hdr);
 }

◆ n_second_order_adjacent_vertices()

virtual unsigned int libMesh::Hex20::n_second_order_adjacent_vertices ( const unsigned int ) const

inlineoverridevirtual

Returns: 2 for all n.

Reimplemented from libMesh::Elem.

Definition at line 190 of file cell_hex20.h.

191 { return 2; }

◆ n_sides()

virtual unsigned int libMesh::Hex::n_sides ( ) const

inlinefinaloverridevirtualinherited

Returns: 6.

Implements libMesh::Elem.

Definition at line 80 of file cell_hex.h.

Referenced by libMesh::Hex::is_child_on_side(), libMesh::Hex::is_edge_on_side(), libMesh::Hex8::is_node_on_side(), is_node_on_side(), libMesh::Hex27::is_node_on_side(), libMesh::Hex::key(), libMesh::Hex27::key(), local_side_node(), libMesh::Hex::local_side_node(), libMesh::Hex27::local_side_node(), libMesh::Hex::low_order_key(), libMesh::Hex8::nodes_on_side(), libMesh::Hex27::nodes_on_side(), nodes_on_side(), libMesh::Hex::opposite_node(), and libMesh::Hex::side_ptr().

80 { return 6; }

◆ n_sub_elem()

virtual unsigned int libMesh::Hex20::n_sub_elem ( ) const

inlineoverridevirtual

Returns: 1.

Implements libMesh::Elem.

Definition at line 101 of file cell_hex20.h.

Referenced by connectivity().

101 { return 1; }

◆ n_systems()

unsigned int libMesh::DofObject::n_systems ( ) const

inlineinherited

Returns: The number of systems associated with this DofObject

Definition at line 937 of file dof_object.h.

References libMesh::DofObject::_idx_buf.

 {
   const int hdr = _idx_buf.empty() ?
     0 : cast_int<int>(dof_id_signed_type(_idx_buf[0]));
   return hdr >= 0 ? hdr : (-hdr-1);
 }

◆ n_var_groups()

unsigned int libMesh::DofObject::n_var_groups ( const unsigned int s ) const

inlineinherited

Returns: The number of VariableGroup variable groups associated with system s for this DofObject

Definition at line 957 of file dof_object.h.

References libMesh::DofObject::end_idx(), libMesh::DofObject::n_systems(), and libMesh::DofObject::start_idx().

 {
   libmesh_assert_less (s, this->n_systems());
 
   return (this->end_idx(s) - this->start_idx(s)) / 2;
 }

◆ n_vars() [1/2]

unsigned int libMesh::DofObject::n_vars	(	const unsigned int	s,
		const unsigned int	vg
	)		const

inlineinherited

Returns: The number of Variable variables associated with VariableGroup vg in system s for this DofObject

Definition at line 967 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::ncv_magic_exp, and libMesh::DofObject::start_idx().

 {
   libmesh_assert_less (s,  this->n_systems());
   libmesh_assert_less (vg, this->n_var_groups(s));
 
   const unsigned int start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg), _idx_buf.size());
 
   return (cast_int<unsigned int>
           (_idx_buf[start_idx_sys + 2*vg]) >> ncv_magic_exp);
 }

◆ n_vars() [2/2]

unsigned int libMesh::DofObject::n_vars ( const unsigned int s ) const

inlineinherited

Returns: The number of Variable variables associated with system s for this DofObject

Definition at line 984 of file dof_object.h.

References libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), and libMesh::DofObject::n_vars().

 {
   libmesh_assert_less (s, this->n_systems());
 
   const unsigned int nvg = this->n_var_groups(s);
 
   unsigned int val=0;
 
   for (unsigned int vg=0; vg<nvg; vg++)
     val += this->n_vars(s,vg);
 
   return val;
 }

◆ n_vertices()

virtual unsigned int libMesh::Hex::n_vertices ( ) const

inlinefinaloverridevirtualinherited

Returns: 8. All hexahedra have 8 vertices.

Implements libMesh::Elem.

Definition at line 85 of file cell_hex.h.

Referenced by libMesh::Hex::edges_adjacent_to_node(), second_order_adjacent_vertex(), libMesh::Hex27::second_order_adjacent_vertex(), second_order_child_vertex(), and libMesh::Hex27::second_order_child_vertex().

85 { return 8; }

◆ neighbor_ptr() [1/2]

const Elem * libMesh::Elem::neighbor_ptr ( unsigned int i ) const

inlineinherited

Returns: A const pointer to the $i^{th}$ neighbor of this element, or nullptr if MeshBase::find_neighbors() has not been called.

Note: If MeshBase::find_neighbors() has been called and this function still returns nullptr, then the side is on a boundary of the domain.

Definition at line 2520 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::n_neighbors().

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::MeshTools::Subdivision::add_boundary_ghosts(), libMesh::BoundaryInfo::add_elements(), libMesh::RBConstruction::add_scaled_matrix_and_vector(), libMesh::MeshTools::Modification::all_tri(), libMesh::ClawSystem::assemble_avg_coupling_matrices(), assemble_ellipticdg(), libMesh::ClawSystem::assemble_jump_coupling_matrix(), assemble_SchroedingerEquation(), assembly_with_dg_fem_context(), libMesh::BoundaryInfo::boundary_ids(), libMesh::EquationSystems::build_discontinuous_solution_vector(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::BoundaryInfo::clear_stitched_boundary_side_ids(), compute_enriched_soln(), compute_jacobian(), libMesh::FEAbstract::compute_node_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::FEAbstract::compute_periodic_node_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints(), compute_residual(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::BoundaryInfo::edge_boundary_ids(), libMesh::JumpErrorEstimator::estimate_error(), libMesh::MeshTools::find_hanging_nodes_and_parents(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::MeshTools::Subdivision::find_one_ring(), libMesh::MeshTools::Modification::flatten(), libMesh::ReplicatedMesh::get_disconnected_subdomains(), libMesh::Elem::get_info(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_constraints(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_node_constraints(), libMesh::RBEIMConstruction::initialize_qp_data(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::Poly2TriTriangulator::is_refine_boundary_allowed(), libMesh::HDGProblem::jacobian(), libMesh::MeshTools::libmesh_assert_valid_neighbors(), libMesh::Elem::libmesh_assert_valid_neighbors(), libMesh::Elem::make_links_to_me_local(), libMesh::Elem::nullify_neighbors(), libMesh::DefaultCoupling::operator()(), libMesh::C0Polygon::permute(), libMesh::CheckpointIO::read_remote_elem(), libMesh::EquationSystems::redundant_added_side(), libMesh::SimplexRefiner::refine_via_edges(), libMesh::InfFE< Dim, T_radial, T_map >::reinit(), libMesh::FE< Dim, LAGRANGE_VEC >::reinit(), libMesh::FEXYZ< Dim >::reinit(), libMesh::HDGProblem::residual(), libMesh::FE< Dim, LAGRANGE_VEC >::side_map(), libMesh::Elem::SideIter::side_on_boundary(), libMesh::BoundaryInfo::side_with_boundary_id(), libMesh::BoundaryInfo::sides_with_boundary_id(), libMesh::MeshTools::Modification::smooth(), libMesh::UnstructuredMesh::stitching_helper(), libMesh::Elem::swap2neighbors(), ElemTest< elem_type >::test_orient_elements(), DefaultCouplingTest::testCoupling(), PointNeighborCouplingTest::testCoupling(), MeshBaseTest::testMeshBaseVerifyIsPrepared(), InfFERadialTest::testSides(), libMesh::Elem::topological_neighbor(), libMesh::MeshRefinement::topological_neighbor(), libMesh::Elem::topologically_equal(), libMesh::MeshTetInterface::volume_to_surface_mesh(), libMesh::Elem::which_neighbor_am_i(), and libMesh::CheckpointIO::write_remote_elem().

 {
   libmesh_assert_less (i, this->n_neighbors());
 
   return _elemlinks[i+1];
 }

◆ neighbor_ptr() [2/2]

Elem * libMesh::Elem::neighbor_ptr ( unsigned int i )

inlineinherited

Returns: A non-const pointer to the $i^{th}$ neighbor of this element.

Definition at line 2530 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::n_neighbors().

 {
   libmesh_assert_less (i, this->n_neighbors());
 
   return _elemlinks[i+1];
 }

◆ neighbor_ptr_range() [1/2]

SimpleRange< Elem::NeighborPtrIter > libMesh::Elem::neighbor_ptr_range ( )

inlineinherited

Returns a range with all neighbors of an element, usable in range-based for loops.

The exact type of the return value here may be subject to change in future libMesh releases, but the iterators will always dereference to produce a pointer to a neighbor element (or a null pointer, for sides which have no neighbors).

Definition at line 3439 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::n_neighbors().

Referenced by ContrivedPartitioner::_do_partition(), libMesh::MeshTetInterface::check_hull_integrity(), libMesh::Elem::child_neighbor(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::has_neighbor(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_constraints(), libMesh::Elem::make_links_to_me_remote(), libMesh::Elem::remove_links_to_me(), and DistributedMeshTest::testRemoteElemError().

 {
   return {_elemlinks+1, _elemlinks + 1 + this->n_neighbors()};
 }

◆ neighbor_ptr_range() [2/2]

SimpleRange< Elem::ConstNeighborPtrIter > libMesh::Elem::neighbor_ptr_range ( ) const

inlineinherited

Definition at line 3446 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::n_neighbors().

 {
   return {_elemlinks+1, _elemlinks + 1 + this->n_neighbors()};
 }

◆ node_id()

dof_id_type libMesh::Elem::node_id ( const unsigned int i ) const

inlineinherited

Returns: The global id number of local Node i.

Definition at line 2412 of file elem.h.

References libMesh::Elem::_nodes, libMesh::DofObject::id(), libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), and libMesh::Elem::n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
   libmesh_assert_not_equal_to (_nodes[i]->id(), Node::invalid_id);
 
   return _nodes[i]->id();
 }

◆ node_index_range()

IntRange< unsigned short > libMesh::Elem::node_index_range ( ) const

inlineinherited

Returns: An integer range from 0 up to (but not including) the number of nodes this element contains.

Definition at line 2605 of file elem.h.

References libMesh::Elem::n_nodes().

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::MeshRefinement::add_node(), assemble_stokes(), libMesh::TetGenMeshInterface::assign_nodes_to_elem(), libMesh::BoundaryInfo::build_node_list_from_side_list(), libMesh::Elem::coarsen(), libMesh::FEMap::compute_map(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::MeshTools::Modification::flatten(), libMesh::Elem::get_info(), libMesh::MeshTools::libmesh_assert_equal_connectivity(), libMesh::Elem::libmesh_assert_valid_node_pointers(), libMesh::XdrIO::pack_element(), libMesh::Elem::quality(), libMesh::FE< Dim, LAGRANGE_VEC >::reinit(), libMesh::MeshTools::Modification::smooth(), libMesh::Elem::true_centroid(), and libMesh::Elem::write_connectivity().

 {
   return {0, cast_int<unsigned short>(this->n_nodes())};
 }

◆ node_ptr() [1/2]

const Node * libMesh::Elem::node_ptr ( const unsigned int i ) const

inlineinherited

Returns: A const pointer to local Node i.

Definition at line 2444 of file elem.h.

References libMesh::Elem::_nodes, libMesh::libmesh_assert(), and libMesh::Elem::n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
 
   return _nodes[i];
 }

◆ node_ptr() [2/2]

Node * libMesh::Elem::node_ptr ( const unsigned int i )

inlineinherited

Returns: A non-const pointer to local Node i.

Definition at line 2455 of file elem.h.

References libMesh::Elem::_nodes, libMesh::libmesh_assert(), and libMesh::Elem::n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
 
   return _nodes[i];
 }

◆ node_ref() [1/2]

const Node & libMesh::Elem::node_ref ( const unsigned int i ) const

inlineinherited

Returns: A const reference to local Node i.

Definition at line 2466 of file elem.h.

References libMesh::Elem::node_ptr().

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::DofMap::allgather_recursive_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::DofMap::constrain_p_dofs(), libMesh::Elem::contains_vertex_of(), libMesh::DofMap::dof_indices(), libMesh::TopologyMap::fill(), libMesh::Elem::get_info(), libMesh::Pyramid::local_singular_node(), libMesh::MeshCommunication::make_new_node_proc_ids_parallel_consistent(), libMesh::DofMap::old_dof_indices(), libMesh::DofMap::process_mesh_constraint_rows(), libMesh::rational_fe_shape(), libMesh::rational_fe_shape_deriv(), libMesh::rational_fe_shape_second_deriv(), libMesh::rational_fe_weighted_shapes(), libMesh::rational_fe_weighted_shapes_derivs(), ParsedFEMFunctionTest::setUp(), libMesh::MeshTools::Modification::smooth(), libMesh::Parallel::sync_node_data_by_element_id_once(), VolumeTest::testEdge3Volume(), and SlitMeshRefinedSystemTest::testRestart().

 {
   return *this->node_ptr(i);
 }

◆ node_ref() [2/2]

Node & libMesh::Elem::node_ref ( const unsigned int i )

inlineinherited

Returns: A writable reference to local Node i.

Definition at line 2474 of file elem.h.

References libMesh::Elem::node_ptr().

 {
   return *this->node_ptr(i);
 }

◆ node_ref_range() [1/2]

SimpleRange< Elem::NodeRefIter > libMesh::Elem::node_ref_range ( )

inlineinherited

Returns a range with all nodes of an element, usable in range-based for loops.

The exact type of the return value here may be subject to change in future libMesh releases, but the iterators will always dereference to produce a reference to a Node.

Definition at line 2587 of file elem.h.

References libMesh::Elem::_nodes, and libMesh::Elem::n_nodes().

Referenced by libMesh::BoundaryInfo::build_side_list_from_node_list(), libMesh::MeshTools::Modification::distort(), libMesh::MeshBase::get_info(), libMesh::Polygon::key(), libMesh::MeshCommunication::make_new_node_proc_ids_parallel_consistent(), ExodusTest< elem_type >::meshes_equal_enough(), libMesh::Elem::point_test(), libMesh::ReplicatedMesh::renumber_nodes_and_elements(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_second_deriv(), libMesh::BoundaryVolumeSolutionTransfer::transfer_boundary_volume(), libMesh::BoundaryVolumeSolutionTransfer::transfer_volume_boundary(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
   return {_nodes, _nodes+this->n_nodes()};
 }

◆ node_ref_range() [2/2]

SimpleRange< Elem::ConstNodeRefIter > libMesh::Elem::node_ref_range ( ) const

inlineinherited

Definition at line 2596 of file elem.h.

References libMesh::Elem::_nodes, and libMesh::Elem::n_nodes().

 {
   return {_nodes, _nodes+this->n_nodes()};
 }

◆ nodes_on_edge()

std::vector< unsigned > libMesh::Hex20::nodes_on_edge ( const unsigned int int ) const

overridevirtual

Returns: the (local) node numbers on the specified edge

Implements libMesh::Elem.

Definition at line 103 of file cell_hex20.C.

References edge_nodes_map, and libMesh::Hex::n_edges().

 {
   libmesh_assert_less(e, n_edges());
   return {std::begin(edge_nodes_map[e]), std::end(edge_nodes_map[e])};
 }

◆ nodes_on_side()

std::vector< unsigned > libMesh::Hex20::nodes_on_side ( const unsigned int int ) const

overridevirtual

Returns: the (local) node numbers on the specified side

Implements libMesh::Elem.

Definition at line 96 of file cell_hex20.C.

References libMesh::Hex::n_sides(), and side_nodes_map.

 {
   libmesh_assert_less(s, n_sides());
   return {std::begin(side_nodes_map[s]), std::end(side_nodes_map[s])};
 }

◆ nullify_neighbors()

void libMesh::Elem::nullify_neighbors ( )

inherited

Replaces this element with nullptr for all of its neighbors.

This is useful when deleting an element.

Definition at line 2885 of file elem.C.

References libMesh::Elem::level(), libMesh::Elem::n_neighbors(), libMesh::Elem::neighbor_ptr(), libMesh::remote_elem, libMesh::Elem::set_neighbor(), libMesh::Elem::side_index_range(), and libMesh::Elem::which_neighbor_am_i().

 {
   // Tell any of my neighbors about my death...
   // Looks strange, huh?
   for (auto n : this->side_index_range())
     {
       Elem * current_neighbor = this->neighbor_ptr(n);
       if (current_neighbor && current_neighbor != remote_elem)
         {
           // Note:  it is possible that I see the neighbor
           // (which is coarser than me)
           // but they don't see me, so avoid that case.
           if (current_neighbor->level() == this->level())
             {
               const unsigned int w_n_a_i = current_neighbor->which_neighbor_am_i(this);
               libmesh_assert_less (w_n_a_i, current_neighbor->n_neighbors());
               current_neighbor->set_neighbor(w_n_a_i, nullptr);
               this->set_neighbor(n, nullptr);
             }
         }
     }
 }

◆ on_boundary()

bool libMesh::Elem::on_boundary ( ) const

inlineinherited

Returns: true if this element has a side coincident with a boundary (indicated by a nullptr neighbor), false otherwise.

Definition at line 2859 of file elem.h.

References libMesh::Elem::has_neighbor().

 {
   // By convention, the element is on the boundary
   // if it has a nullptr neighbor.
   return this->has_neighbor(nullptr);
 }

◆ on_reference_element()

bool libMesh::Hex::on_reference_element	(	const Point &	p,
		const Real	eps = `TOLERANCE`
	)		const

finaloverridevirtualinherited

Returns: true if the master-space point p is contained in the reference element corresponding to this element, false otherwise.

Since we are doing floating point comparisons here the parameter eps can be specified to indicate a tolerance. For example, $x \le 1$ becomes $x \le 1 + \epsilon$ .

Implements libMesh::Elem.

Definition at line 577 of file cell_hex.C.

References libMesh::Real.

 {
   const Real & xi = p(0);
   const Real & eta = p(1);
   const Real & zeta = p(2);
 
   // The reference hexahedral element is [-1,1]^3.
   return ((xi   >= -1.-eps) &&
           (xi   <=  1.+eps) &&
           (eta  >= -1.-eps) &&
           (eta  <=  1.+eps) &&
           (zeta >= -1.-eps) &&
           (zeta <=  1.+eps));
 }

◆ operator=() [1/2]

Hex20& libMesh::Hex20::operator= ( const Hex20 & )

delete

◆ operator=() [2/2]

Hex20& libMesh::Hex20::operator= ( Hex20 && )

delete

◆ operator==()

bool libMesh::Elem::operator== ( const Elem & rhs ) const

inherited

Returns: true if two elements are equivalent, false otherwise. This is true if the elements are connected to identical global nodes, regardless of how those nodes might be numbered local to the elements.

Definition at line 642 of file elem.C.

References libMesh::Elem::n_nodes(), libMesh::Elem::node_id(), and libMesh::Elem::type().

 {
   // If the elements aren't the same type, they aren't equal
   if (this->type() != rhs.type())
     return false;
 
   const unsigned short n_n = this->n_nodes();
   libmesh_assert_equal_to(n_n, rhs.n_nodes());
 
   // Make two sorted arrays of global node ids and compare them for
   // equality.
   std::array<dof_id_type, Elem::max_n_nodes> this_ids, rhs_ids;
 
   for (unsigned short n = 0; n != n_n; n++)
     {
       this_ids[n] = this->node_id(n);
       rhs_ids[n] = rhs.node_id(n);
     }
 
   // Sort the vectors to rule out different local node numberings.
   std::sort(this_ids.begin(), this_ids.begin()+n_n);
   std::sort(rhs_ids.begin(), rhs_ids.begin()+n_n);
 
   // If the node ids match, the elements are equal!
   for (unsigned short n = 0; n != n_n; ++n)
     if (this_ids[n] != rhs_ids[n])
       return false;
   return true;
 }

◆ opposite_node()

unsigned int libMesh::Hex::opposite_node	(	const unsigned int	n,
		const unsigned int	s
	)		const

finaloverridevirtualinherited

Returns: The local node number for the node opposite to node n on side opposite_side(s) (for a tensor product element), or throws an error otherwise.

Reimplemented from libMesh::Elem.

Definition at line 220 of file cell_hex.C.

References libMesh::Elem::is_node_on_side(), libMesh::libmesh_assert(), libMesh::Elem::n_nodes(), and libMesh::Hex::n_sides().

 {
   libmesh_assert_less (node_in, 26);
   libmesh_assert_less (node_in, this->n_nodes());
   libmesh_assert_less (side_in, this->n_sides());
   libmesh_assert(this->is_node_on_side(node_in, side_in));
 
   static const unsigned char side05_nodes_map[] =
     {4, 5, 6, 7, 0, 1, 2, 3, 16, 17, 18, 19, 255, 255, 255, 255, 8, 9, 10, 11, 25, 255, 255, 255, 255, 20};
   static const unsigned char side13_nodes_map[] =
     {3, 2, 1, 0, 7, 6, 5, 4, 10, 255, 8, 255, 15, 14, 13, 12, 18, 255, 16, 255, 255, 23, 255, 21, 255, 255};
   static const unsigned char side24_nodes_map[] =
     {1, 0, 3, 2, 5, 4, 7, 6, 255, 11, 255, 9, 13, 12, 15, 14, 255, 19, 255, 17, 255, 255, 24, 255, 22, 255};
 
   switch (side_in)
     {
     case 0:
     case 5:
       return side05_nodes_map[node_in];
     case 1:
     case 3:
       return side13_nodes_map[node_in];
     case 2:
     case 4:
       return side24_nodes_map[node_in];
     default:
       libmesh_error_msg("Unsupported side_in = " << side_in);
     }
 }

◆ opposite_side()

unsigned int libMesh::Hex::opposite_side ( const unsigned int s ) const

finaloverridevirtualinherited

Returns: The side number opposite to s (for a tensor product element), or throws an error otherwise.

Reimplemented from libMesh::Elem.

Definition at line 211 of file cell_hex.C.

 {
   libmesh_assert_less (side_in, 6);
   static const unsigned char hex_opposites[6] = {5, 3, 4, 1, 2, 0};
   return hex_opposites[side_in];
 }

◆ orient()

void libMesh::Elem::orient ( BoundaryInfo * boundary_info )

inlineinherited

Flips the element (by swapping node and neighbor pointers) to have a mapping Jacobian of opposite sign, iff we find a negative orientation.

This only fixes flipped elements; for tangled elements the only fixes possible are non-local.

Definition at line 3236 of file elem.h.

References libMesh::Elem::flip(), and libMesh::Elem::is_flipped().

Referenced by libMesh::MeshTools::Modification::orient_elements().

 {
   if (this->is_flipped())
     this->flip(boundary_info);
 }

◆ origin()

virtual Point libMesh::Elem::origin ( ) const

inlinevirtualinherited

Returns: The origin for an infinite element.

Currently, all infinite elements used in a mesh share the same origin. Override this in infinite element classes.

Reimplemented in libMesh::InfQuad, libMesh::InfEdge2, and libMesh::InfCell.

Definition at line 1863 of file elem.h.

Referenced by InfFERadialTest::base_point(), libMesh::InfFE< Dim, T_radial, T_map >::compute_data(), libMesh::InfFE< Dim, T_radial, T_map >::compute_shape_functions(), libMesh::Elem::get_info(), libMesh::InfFEMap::inverse_map(), libMesh::InfFEMap::map(), InfFERadialTest::testInfQuants(), and InfFERadialTest::testInfQuants_numericDeriv().

1863 { libmesh_not_implemented(); return Point(); }

◆ p_level()

unsigned int libMesh::Elem::p_level ( ) const

inlineinherited

Returns: The value of the p refinement level of an active element, or the minimum value of the p refinement levels of an ancestor element's descendants.

Definition at line 3058 of file elem.h.

References libMesh::Elem::_p_level.

 {
 #ifdef LIBMESH_ENABLE_AMR
   return _p_level;
 #else
   return 0;
 #endif
 }

◆ p_refinement_flag()

Elem::RefinementState libMesh::Elem::p_refinement_flag ( ) const

inlineinherited

Returns: The value of the p-refinement flag for the element.

Definition at line 3176 of file elem.h.

References libMesh::Elem::_pflag.

Referenced by libMesh::Elem::get_info(), libMesh::Elem::hack_p_level(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_flags(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshRefinement::make_flags_parallel_consistent(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::Elem::min_new_p_level_by_neighbor(), libMesh::DofMap::old_dof_indices(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectEdges::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectSides::operator()(), and libMesh::Elem::refine().

 {
   return static_cast<RefinementState>(_pflag);
 }

◆ pack_indexing()

void libMesh::DofObject::pack_indexing ( std::back_insert_iterator< std::vector< largest_id_type >> target ) const

inherited

A method for creating packed data from our index buffer - basically a copy with prepended size with our current implementation.

Definition at line 642 of file dof_object.C.

References libMesh::DofObject::_idx_buf, and libMesh::DofObject::old_dof_object.

 {
 #ifdef LIBMESH_ENABLE_AMR
   // We might need to pack old_dof_object too
   *target++ = (old_dof_object == nullptr) ? 0 : 1;
 #endif
 
   *target++ = _idx_buf.size();
   std::copy(_idx_buf.begin(), _idx_buf.end(), target);
 
 #ifdef LIBMESH_ENABLE_AMR
   if (old_dof_object)
     old_dof_object->pack_indexing(target);
 #endif
 }

◆ packed_indexing_size()

unsigned int libMesh::DofObject::packed_indexing_size ( ) const

inherited

If we pack our indices into an buffer for communications, how many ints do we need?

Definition at line 560 of file dof_object.C.

References libMesh::DofObject::_idx_buf, and libMesh::DofObject::old_dof_object.

Referenced by libMesh::Node::packed_size().

 {
   return
     cast_int<unsigned int> (
 #ifdef LIBMESH_ENABLE_AMR
                             ((old_dof_object == nullptr) ? 0 : old_dof_object->packed_indexing_size()) + 2 +
 #else
                             1 +
 #endif
                             _idx_buf.size());
 }

◆ parent() [1/2]

const Elem * libMesh::Elem::parent ( ) const

inlineinherited

Returns: A const pointer to the element's parent, or nullptr if the element was not created via refinement.

Definition at line 2980 of file elem.h.

References libMesh::Elem::_elemlinks.

 {
   return _elemlinks[0];
 }

◆ parent() [2/2]

Elem * libMesh::Elem::parent ( )

inlineinherited

Returns: A pointer to the element's parent, or nullptr if the element was not created via refinement.

Definition at line 2988 of file elem.h.

References libMesh::Elem::_elemlinks.

 {
   return _elemlinks[0];
 }

◆ parent_bracketing_nodes()

const std::vector< std::pair< unsigned char, unsigned char > > & libMesh::Elem::parent_bracketing_nodes	(	unsigned int	c,
		unsigned int	n
	)		const

virtualinherited

Returns: All the pairs of nodes (indexed by local node id) which should bracket node n of child c.

Reimplemented in libMesh::Prism21, libMesh::Prism20, libMesh::Tet14, and libMesh::Tri7.

Definition at line 2325 of file elem.C.

References libMesh::Elem::_get_bracketing_node_cache(), libMesh::TypeVector< T >::absolute_fuzzy_equals(), libMesh::TypeVector< T >::add_scaled(), libMesh::Elem::as_parent_node(), libMesh::Elem::build(), libMesh::Elem::default_order(), libMesh::Elem::embedding_matrix(), libMesh::Elem::embedding_matrix_version(), libMesh::FIRST, libMesh::invalid_uint, libMesh::Elem::is_mid_infinite_edge_node(), libMesh::Elem::is_vertex_on_child(), libMesh::libmesh_assert(), libMesh::Elem::master_point(), libMesh::Elem::n_children(), libMesh::Elem::n_nodes(), libMesh::Elem::n_nodes_in_child(), libMesh::parent_bracketing_nodes_mutex, libMesh::Real, libMesh::Elem::second_order_equivalent_type(), and libMesh::Elem::type().

Referenced by libMesh::Elem::bracketing_nodes(), and main().

 {
   // Indexed first by embedding matrix type, then by child id, then by
   // child node, then by bracketing pair
   std::vector<std::vector<std::vector<std::vector<std::pair<unsigned char, unsigned char>>>>> &
     cached_bracketing_nodes = this->_get_bracketing_node_cache();
 
   const unsigned int em_vers = this->embedding_matrix_version();
 
   // We may be updating the cache on one thread, and while that
   // happens we can't safely access the cache from other threads.
   Threads::spin_mutex::scoped_lock lock(parent_bracketing_nodes_mutex);
 
   if (cached_bracketing_nodes.size() <= em_vers)
     cached_bracketing_nodes.resize(em_vers+1);
 
   const unsigned int nc = this->n_children();
 
   // If we haven't cached the bracketing nodes corresponding to this
   // embedding matrix yet, let's do so now.
   if (cached_bracketing_nodes[em_vers].size() < nc)
     {
       // If we're a second-order element but we're not a full-order
       // element, then some of our bracketing nodes may not exist
       // except on the equivalent full-order element.  Let's build an
       // equivalent full-order element and make a copy of its cache to
       // use.
       if (this->default_order() != FIRST &&
           second_order_equivalent_type(this->type(), /*full_ordered=*/ true) != this->type())
         {
           // Check that we really are the non-full-order type
           libmesh_assert_equal_to
             (second_order_equivalent_type (this->type(), false),
              this->type());
 
           // Build the full-order type
           ElemType full_type =
             second_order_equivalent_type(this->type(), /*full_ordered=*/ true);
           std::unique_ptr<Elem> full_elem = Elem::build(full_type);
 
           // This won't work for elements with multiple
           // embedding_matrix versions, but every such element is full
           // order anyways.
           libmesh_assert_equal_to(em_vers, 0);
 
           // Make sure its cache has been built.  We temporarily
           // release our mutex lock so that the inner call can
           // re-acquire it.
           lock.release();
           full_elem->parent_bracketing_nodes(0,0);
 
           // And then we need to lock again, so that if someone *else*
           // grabbed our lock before we did we don't risk accessing
           // cached_bracketing_nodes while they're working on it.
           // Threading is hard.
           lock.acquire(parent_bracketing_nodes_mutex);
 
           // Copy its cache
           cached_bracketing_nodes =
             full_elem->_get_bracketing_node_cache();
 
           // Now we don't need to build the cache ourselves.
           return cached_bracketing_nodes[em_vers][child][child_node];
         }
 
       cached_bracketing_nodes[em_vers].resize(nc);
 
       const unsigned int nn = this->n_nodes();
 
       // We have to examine each child
       for (unsigned int c = 0; c != nc; ++c)
         {
           const unsigned int ncn = this->n_nodes_in_child(c);
 
           cached_bracketing_nodes[em_vers][c].resize(ncn);
 
           // We have to examine each node in that child
           for (unsigned int n = 0; n != ncn; ++n)
             {
               // If this child node isn't a vertex or an infinite
               // child element's mid-infinite-edge node, then we need
               // to find bracketing nodes on the child.
               if (!this->is_vertex_on_child(c, n)
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
                   && !this->is_mid_infinite_edge_node(n)
 #endif
                   )
                 {
                   // Use the embedding matrix to find the child node
                   // location in parent master element space
                   Point bracketed_pt;
 
                   for (unsigned int pn = 0; pn != nn; ++pn)
                     {
                       const Real em_val =
                         this->embedding_matrix(c,n,pn);
 
                       libmesh_assert_not_equal_to (em_val, 1);
                       if (em_val != 0.)
                         bracketed_pt.add_scaled(this->master_point(pn), em_val);
                     }
 
                   // Check each pair of nodes on the child which are
                   // also both parent nodes
                   for (unsigned int n1 = 0; n1 != ncn; ++n1)
                     {
                       if (n1 == n)
                         continue;
 
                       unsigned int parent_n1 =
                         this->as_parent_node(c,n1);
 
                       if (parent_n1 == libMesh::invalid_uint)
                         continue;
 
                       Point p1 = this->master_point(parent_n1);
 
                       for (unsigned int n2 = n1+1; n2 < nn; ++n2)
                         {
                           if (n2 == n)
                             continue;
 
                           unsigned int parent_n2 =
                             this->as_parent_node(c,n2);
 
                           if (parent_n2 == libMesh::invalid_uint)
                             continue;
 
                           Point p2 = this->master_point(parent_n2);
 
                           Point pmid = (p1 + p2)/2;
 
                           if (pmid == bracketed_pt)
                             {
                               cached_bracketing_nodes[em_vers][c][n].emplace_back(parent_n1, parent_n2);
                               break;
                             }
                           else
                             libmesh_assert(!pmid.absolute_fuzzy_equals(bracketed_pt));
                         }
                     }
                 }
               // If this child node is a parent node, we need to
               // find bracketing nodes on the parent.
               else
                 {
                   unsigned int parent_node = this->as_parent_node(c,n);
 
                   Point bracketed_pt;
 
                   // If we're not a parent node, use the embedding
                   // matrix to find the child node location in parent
                   // master element space
                   if (parent_node == libMesh::invalid_uint)
                     {
                       for (unsigned int pn = 0; pn != nn; ++pn)
                         {
                           const Real em_val =
                             this->embedding_matrix(c,n,pn);
 
                           libmesh_assert_not_equal_to (em_val, 1);
                           if (em_val != 0.)
                             bracketed_pt.add_scaled(this->master_point(pn), em_val);
                         }
                     }
                   // If we're a parent node then we need no arithmetic
                   else
                     bracketed_pt = this->master_point(parent_node);
 
                   for (unsigned int n1 = 0; n1 != nn; ++n1)
                     {
                       if (n1 == parent_node)
                         continue;
 
                       Point p1 = this->master_point(n1);
 
                       for (unsigned int n2 = n1+1; n2 < nn; ++n2)
                         {
                           if (n2 == parent_node)
                             continue;
 
                           Point pmid = (p1 + this->master_point(n2))/2;
 
                           if (pmid == bracketed_pt)
                             {
                               cached_bracketing_nodes[em_vers][c][n].emplace_back(n1, n2);
                               break;
                             }
                           else
                             libmesh_assert(!pmid.absolute_fuzzy_equals(bracketed_pt));
                         }
                     }
                 }
             }
         }
     }
 
   return cached_bracketing_nodes[em_vers][child][child_node];
 }

◆ permute()

void libMesh::Hex20::permute ( unsigned int perm_num )

finaloverridevirtual

Permutes the element (by swapping node and neighbor pointers) according to the specified index.

This is useful for regression testing, by making it easy to make a structured mesh behave more like an arbitrarily unstructured mesh.

This is so far only used for regression testing, so we do not currently provide a way to permute any boundary side/edge ids along with the element permutation.

Implements libMesh::Elem.

Definition at line 690 of file cell_hex20.C.

References libMesh::MeshTools::Modification::rotate(), libMesh::Elem::swap2neighbors(), libMesh::Elem::swap2nodes(), libMesh::Elem::swap4neighbors(), and libMesh::Elem::swap4nodes().

 {
   libmesh_assert_less (perm_num, 24);
   const unsigned int side = perm_num % 6;
   const unsigned int rotate = perm_num / 6;
 
   for (unsigned int i = 0; i != rotate; ++i)
     {
       swap4nodes(0,1,2,3);
       swap4nodes(4,5,6,7);
       swap4nodes(8,9,10,11);
       swap4nodes(12,13,14,15);
       swap4nodes(16,17,18,19);
       swap4neighbors(1,2,3,4);
     }
 
   switch (side) {
   case 0:
     break;
   case 1:
     swap4nodes(3,7,4,0);
     swap4nodes(11,15,19,12);
     swap4nodes(10,18,16,8);
     swap4nodes(2,6,5,1);
     swap4nodes(9,14,17,13);
     swap4neighbors(0,3,5,1);
     break;
   case 2:
     swap4nodes(0,4,5,1);
     swap4nodes(8,12,16,13);
     swap4nodes(3,7,6,2);
     swap4nodes(10,15,18,14);
     swap4nodes(11,19,17,9);
     swap4neighbors(0,4,5,2);
     break;
   case 3:
     swap4nodes(0,4,7,3);
     swap4nodes(12,19,15,11);
     swap4nodes(8,16,18,10);
     swap4nodes(1,5,6,2);
     swap4nodes(13,17,14,9);
     swap4neighbors(0,1,5,3);
     break;
   case 4:
     swap4nodes(1,5,4,0);
     swap4nodes(8,13,16,12);
     swap4nodes(9,17,19,11);
     swap4nodes(2,6,7,3);
     swap4nodes(10,14,18,15);
     swap4neighbors(0,2,5,4);
     break;
   case 5:
     swap2nodes(0,7);
     swap2nodes(8,18);
     swap2nodes(1,6);
     swap2nodes(2,5);
     swap2nodes(10,16);
     swap2nodes(3,4);
     swap2nodes(11,19);
     swap2nodes(12,15);
     swap2nodes(9,17);
     swap2nodes(13,14);
     swap2neighbors(0,5);
     swap2neighbors(1,3);
     break;
   default:
     libmesh_error();
   }
 }

◆ point() [1/2]

const Point & libMesh::Elem::point ( const unsigned int i ) const

inlineinherited

Returns: The Point associated with local Node i.

Definition at line 2390 of file elem.h.

References libMesh::Elem::_nodes, libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), and libMesh::Elem::n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
   libmesh_assert_not_equal_to (_nodes[i]->id(), Node::invalid_id);
 
   return *_nodes[i];
 }

◆ point() [2/2]

Point & libMesh::Elem::point ( const unsigned int i )

inlineinherited

Returns: The Point associated with local Node i as a writable reference.

Definition at line 2402 of file elem.h.

References libMesh::Elem::_nodes, and libMesh::Elem::n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
 
   return *_nodes[i];
 }

◆ positive_edge_orientation()

bool libMesh::Elem::positive_edge_orientation ( const unsigned int i ) const

inherited

Returns: true if edge i is positively oriented. An edge is positively oriented iff its first vertex (i.e. zeroth node) is lexicographically greater than its second vertex (i.e. first node).

Definition at line 3460 of file elem.C.

References libMesh::Elem::local_edge_node(), libMesh::Elem::n_edges(), and libMesh::Elem::point().

Referenced by libMesh::FE< Dim, LAGRANGE_VEC >::shape(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv(), and libMesh::FE< Dim, LAGRANGE_VEC >::shape_second_deriv().

 {
   libmesh_assert_less (i, this->n_edges());
 
   return this->point(this->local_edge_node(i, 0)) >
          this->point(this->local_edge_node(i, 1));
 }

◆ positive_face_orientation()

bool libMesh::Elem::positive_face_orientation ( const unsigned int i ) const

inherited

Returns: true if face i is positively oriented. A face with N vertices is positively oriented iff its 3 lexicographically greatest vertices (i.e. 3 lexicographically greatest nodes amongst the N leading nodes) are an odd permutation relative to their lexicographic ordering.

Definition at line 3469 of file elem.C.

References libMesh::Elem::n_faces(), libMesh::Elem::nodes_on_side(), libMesh::Elem::point(), libMesh::MeshTools::Modification::rotate(), and libMesh::Elem::side_ptr().

Referenced by libMesh::FE< Dim, LAGRANGE_VEC >::shape(), and libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv().

 {
   libmesh_assert_less (i, this->n_faces());
 
   // Get the number of vertices N of face i. Note that for 3d elements, i.e.
   // elements for which this->n_faces() > 0, the number of vertices on any of
   // its sides (or faces) is just the number of that face's sides (or edges).
   auto side_i = this->side_ptr(i);
   const unsigned int N = side_i->n_sides();
 
   const std::vector<unsigned int> nodes = this->nodes_on_side(i);
   std::vector<Point> vertices(N);
   std::transform(nodes.begin(), nodes.begin() + N, vertices.begin(),
                  [&](unsigned int n) { return this->point(n); });
 
   for (unsigned int j = 0; j < N - 3; j++)
     std::rotate(vertices.begin() + j,
                 std::min_element(vertices.begin() + j, vertices.end()),
                 vertices.end());
 
   unsigned int cnt = 0;
   for (unsigned int j = N - 3; j < N; j++)
     for (unsigned int k = j + 1; k < N; k++)
       if (vertices[j] > vertices[k])
         cnt++;
 
   return cnt % 2;
 }

◆ print_dof_info()

void libMesh::DofObject::print_dof_info ( ) const

inherited

Print out info for debugging.

Definition at line 670 of file dof_object.C.

References libMesh::DofObject::dof_number(), libMesh::DofObject::id(), libMesh::make_range(), libMesh::DofObject::n_comp(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_vars(), and libMesh::out.

 {
   libMesh::out << this->id() << " [ ";
 
   for (auto s : make_range(this->n_systems()))
     {
       libMesh::out << "s:" << s << " ";
       for (auto var : make_range(this->n_vars(s)))
         {
           libMesh::out << "v:" << var << " ";
           for (auto comp : make_range(this->n_comp(s,var)))
             {
               libMesh::out << "c:" << comp << " dof:" << this->dof_number(s,var,comp) << " ";
             }
         }
     }
 
   libMesh::out << "]\n";
 }

◆ print_info() [1/3]

void libMesh::ReferenceCounter::print_info ( std::ostream & out_stream = libMesh::out )

staticinherited

Prints the reference information, by default to libMesh::out.

Definition at line 81 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter, and libMesh::ReferenceCounter::get_info().

Referenced by libMesh::LibMeshInit::~LibMeshInit().

 {
   if (_enable_print_counter)
     out_stream << ReferenceCounter::get_info();
 }

◆ print_info() [2/3]

void libMesh::ReferenceCounter::print_info ( std::ostream & out_stream = libMesh::out )

staticinherited

Prints the reference information, by default to libMesh::out.

Definition at line 81 of file reference_counter.C.

References libMesh::ReferenceCounter::_enable_print_counter, and libMesh::ReferenceCounter::get_info().

Referenced by libMesh::LibMeshInit::~LibMeshInit().

 {
   if (_enable_print_counter)
     out_stream << ReferenceCounter::get_info();
 }

◆ print_info() [3/3]

void libMesh::Elem::print_info ( std::ostream & os = libMesh::out ) const

inherited

Prints relevant information about the element.

Definition at line 2786 of file elem.C.

References libMesh::Elem::get_info().

Referenced by libMesh::FEMap::compute_single_point_map(), libMesh::FEMap::inverse_map(), and libMesh::operator<<().

 {
   os << this->get_info()
      << std::endl;
 }

◆ processor_id() [1/3]

processor_id_type libMesh::DofObject::processor_id ( ) const

inlineinherited

Returns: The processor that this DofObject belongs to.

When partitioning and DoF numbering have been performed by libMesh, every current DoF on this DofObject will belong to its processor.

Definition at line 905 of file dof_object.h.

References libMesh::DofObject::_processor_id.

Referenced by NonManifoldTestPartitioner::_do_partition(), libMesh::BoundaryInfo::_find_id_maps(), libMesh::DistributedMesh::add_elem(), libMesh::BoundaryInfo::add_elements(), libMesh::DistributedMesh::add_node(), libMesh::MeshRefinement::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::DistributedMesh::add_point(), libMesh::RBConstruction::add_scaled_matrix_and_vector(), libMesh::UnstructuredMesh::all_first_order(), libMesh::MeshTools::Modification::all_tri(), libMesh::DofMap::allgather_recursive_constraints(), libMesh::Patch::build_around_element(), libMesh::Partitioner::build_graph(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::BoundaryInfo::build_node_list_from_side_list(), libMesh::MeshFunction::check_found_elem(), libMesh::Nemesis_IO_Helper::compute_num_global_nodesets(), libMesh::Nemesis_IO_Helper::compute_num_global_sidesets(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SubProjector::construct_projection(), libMesh::MeshBase::copy_constraint_rows(), libMesh::ExodusII_IO::copy_nodal_solution(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::delete_elem(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::Elem::disconnected_clone(), libMesh::DofMap::distribute_dofs(), libMesh::DofMap::distribute_local_dofs_node_major(), libMesh::DofMap::distribute_local_dofs_var_major(), libMesh::Elem::Elem(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SubFunctor::find_dofs_to_send(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::MeshTools::Modification::flatten(), libMesh::Node::get_info(), libMesh::Elem::get_info(), libMesh::RBEIMConstruction::initialize_qp_data(), libMesh::DistributedMesh::insert_elem(), libMesh::DofObject::invalidate_processor_id(), libMesh::MeshTools::libmesh_assert_consistent_distributed(), libMesh::MeshTools::libmesh_assert_consistent_distributed_nodes(), libMesh::MeshTools::libmesh_assert_parallel_consistent_new_node_procids(), libMesh::MeshTools::libmesh_assert_parallel_consistent_procids< Elem >(), libMesh::MeshTools::libmesh_assert_parallel_consistent_procids< Node >(), libMesh::MeshTools::libmesh_assert_topology_consistent_procids< Elem >(), libMesh::MeshTools::libmesh_assert_valid_amr_elem_ids(), libMesh::MeshTools::libmesh_assert_valid_neighbors(), libMesh::DofMap::local_variable_indices(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshCommunication::make_new_node_proc_ids_parallel_consistent(), AugmentSparsityOnInterface::mesh_reinit(), ExodusTest< elem_type >::meshes_equal_enough(), libMesh::PeriodicBoundaries::neighbor(), libMesh::RBEIMEvaluation::node_distribute_bfs(), OverlappingCouplingFunctor::operator()(), AugmentSparsityOnInterface::operator()(), AugmentSparsityOnNodes::operator()(), libMesh::GhostPointNeighbors::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SortAndCopy::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectEdges::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectSides::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectInteriors::operator()(), libMesh::CompareDofObjectsByPIDAndThenID::operator()(), libMesh::DistributedMesh::own_node(), libMesh::XdrIO::pack_element(), libMesh::LinearPartitioner::partition_range(), libMesh::SFCPartitioner::partition_range(), libMesh::CentroidPartitioner::partition_range(), libMesh::System::point_gradient(), libMesh::System::point_hessian(), libMesh::System::point_value(), libMesh::Polygon::Polygon(), libMesh::DofMap::process_mesh_constraint_rows(), libMesh::DofObject::processor_id(), libMesh::CheckpointIO::read_connectivity(), libMesh::SimplexRefiner::refine_via_edges(), libMesh::DistributedMesh::renumber_nodes_and_elements(), libMesh::DofMap::scatter_constraints(), libMesh::Partitioner::set_interface_node_processor_ids_BFS(), libMesh::Partitioner::set_interface_node_processor_ids_linear(), libMesh::Partitioner::set_interface_node_processor_ids_petscpartitioner(), libMesh::Partitioner::set_node_processor_ids(), libMesh::DofMap::set_nonlocal_dof_objects(), libMesh::Partitioner::set_parent_processor_ids(), ParsedFEMFunctionTest::setUp(), libMesh::Partitioner::single_partition_range(), libMesh::Parallel::sync_dofobject_data_by_id(), libMesh::Parallel::sync_element_data_by_parent_id(), libMesh::Parallel::sync_node_data_by_element_id_once(), DefaultCouplingTest::testCoupling(), PointNeighborCouplingTest::testCoupling(), DofObjectTest< Node >::testInvalidateProcId(), EquationSystemsTest::testPostInitAddElem(), DofObjectTest< Node >::testSetProcId(), BoundaryInfoTest::testShellFaceConstraints(), DofObjectTest< Node >::testValidProcId(), libMesh::DTKAdapter::update_variable_values(), NonManifoldGhostingFunctorTest::verify_send_list_entries_helper(), libMesh::GmshIO::write_mesh(), and libMesh::Nemesis_IO_Helper::write_sidesets().

 {
   return _processor_id;
 }

◆ processor_id() [2/3]

processor_id_type & libMesh::DofObject::processor_id ( )

inlineinherited

Returns: The processor that this DofObject belongs to as a writable reference.

Definition at line 913 of file dof_object.h.

References libMesh::DofObject::_processor_id.

 {
   return _processor_id;
 }

◆ processor_id() [3/3]

void libMesh::DofObject::processor_id ( const processor_id_type pid )

inlineinherited

Sets the processor_id for this DofObject.

Definition at line 921 of file dof_object.h.

References libMesh::DofObject::processor_id().

 {
   this->processor_id() = pid;
 }

◆ qual_bounds()

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

overridevirtualinherited

Returns: The suggested quality bounds for the hex based on quality measure q. These are the values suggested by the CUBIT User's Manual.

Reimplemented from libMesh::Elem.

Definition at line 507 of file cell_hex.C.

References libMesh::ASPECT_RATIO, libMesh::CONDITION, libMesh::DIAGONAL, libMesh::DISTORTION, libMesh::JACOBIAN, libMesh::out, libMesh::SCALED_JACOBIAN, libMesh::SHAPE, libMesh::SHEAR, libMesh::SIZE, libMesh::SKEW, libMesh::STRETCH, and libMesh::TAPER.

 {
   std::pair<Real, Real> bounds;
 
   switch (q)
     {
 
     case ASPECT_RATIO:
       bounds.first  = 1.;
       bounds.second = 4.;
       break;
 
     case SKEW:
       bounds.first  = 0.;
       bounds.second = 0.5;
       break;
 
     case SHEAR:
     case SHAPE:
       bounds.first  = 0.3;
       bounds.second = 1.;
       break;
 
     case CONDITION:
       bounds.first  = 1.;
       bounds.second = 8.;
       break;
 
     case SCALED_JACOBIAN:
     case JACOBIAN:
       bounds.first  = 0.5;
       bounds.second = 1.;
       break;
 
     case DISTORTION:
       bounds.first  = 0.6;
       bounds.second = 1.;
       break;
 
     case TAPER:
       bounds.first  = 0.;
       bounds.second = 0.4;
       break;
 
     case STRETCH:
       bounds.first  = 0.25;
       bounds.second = 1.;
       break;
 
     case DIAGONAL:
       bounds.first  = 0.65;
       bounds.second = 1.;
       break;
 
     case SIZE:
       bounds.first  = 0.5;
       bounds.second = 1.;
       break;
 
     default:
       libMesh::out << "Warning: Invalid quality measure chosen." << std::endl;
       bounds.first  = -1;
       bounds.second = -1;
     }
 
   return bounds;
 }

◆ quality()

Real libMesh::Hex::quality ( const ElemQuality q ) const

overridevirtualinherited

Returns: A quantitative assessment of element quality based on the quality metric q specified by the user.

Compute the min/max diagonal ratio. Source: CUBIT User's Manual.

Minimum ratio of lengths derived from opposite edges. Source: CUBIT User's Manual.

Compute the side lengths.

Minimum edge length divided by max diagonal length. Source: CUBIT User's Manual.

Compute the maximum diagonal.

Compute the minimum edge length.

I don't know what to do for this metric. Maybe the base class knows...

Reimplemented from libMesh::Elem.

Definition at line 280 of file cell_hex.C.

References libMesh::TypeTensor< T >::det(), libMesh::DIAGONAL, libMesh::Elem::length(), libMesh::Elem::point(), libMesh::Utility::pow(), libMesh::Elem::quality(), libMesh::Real, libMesh::SHAPE, libMesh::SKEW, libMesh::STRETCH, and libMesh::TAPER.

 {
   switch (q)
     {
 
 #if LIBMESH_DIM >= 3
 
     case DIAGONAL:
       {
         // Diagonal between node 0 and node 6
         const Real d06 = this->length(0,6);
 
         // Diagonal between node 3 and node 5
         const Real d35 = this->length(3,5);
 
         // Diagonal between node 1 and node 7
         const Real d17 = this->length(1,7);
 
         // Diagonal between node 2 and node 4
         const Real d24 = this->length(2,4);
 
         // Find the biggest and smallest diagonals
         const Real min = std::min(d06, std::min(d35, std::min(d17, d24)));
         const Real max = std::max(d06, std::max(d35, std::max(d17, d24)));
 
         libmesh_assert_not_equal_to (max, 0.0);
 
         return min / max;
 
         break;
       }
 
     case TAPER:
       {
 
         const Real d01 = this->length(0,1);
         const Real d12 = this->length(1,2);
         const Real d23 = this->length(2,3);
         const Real d03 = this->length(0,3);
         const Real d45 = this->length(4,5);
         const Real d56 = this->length(5,6);
         const Real d67 = this->length(6,7);
         const Real d47 = this->length(4,7);
         const Real d04 = this->length(0,4);
         const Real d15 = this->length(1,5);
         const Real d37 = this->length(3,7);
         const Real d26 = this->length(2,6);
 
         std::vector<Real> edge_ratios(12);
         // Front
         edge_ratios[0] = std::min(d01, d45) / std::max(d01, d45);
         edge_ratios[1] = std::min(d04, d15) / std::max(d04, d15);
 
         // Right
         edge_ratios[2] = std::min(d15, d26) / std::max(d15, d26);
         edge_ratios[3] = std::min(d12, d56) / std::max(d12, d56);
 
         // Back
         edge_ratios[4] = std::min(d67, d23) / std::max(d67, d23);
         edge_ratios[5] = std::min(d26, d37) / std::max(d26, d37);
 
         // Left
         edge_ratios[6] = std::min(d04, d37) / std::max(d04, d37);
         edge_ratios[7] = std::min(d03, d47) / std::max(d03, d47);
 
         // Bottom
         edge_ratios[8] = std::min(d01, d23) / std::max(d01, d23);
         edge_ratios[9] = std::min(d03, d12) / std::max(d03, d12);
 
         // Top
         edge_ratios[10] = std::min(d45, d67) / std::max(d45, d67);
         edge_ratios[11] = std::min(d56, d47) / std::max(d56, d47);
 
         return *(std::min_element(edge_ratios.begin(), edge_ratios.end())) ;
 
         break;
       }
 
 
     case STRETCH:
       {
         const Real sqrt3 = 1.73205080756888;
 
         const Real d06 = this->length(0,6);
         const Real d17 = this->length(1,7);
         const Real d35 = this->length(3,5);
         const Real d24 = this->length(2,4);
         const Real max_diag = std::max(d06, std::max(d17, std::max(d35, d24)));
 
         libmesh_assert_not_equal_to ( max_diag, 0.0 );
 
         std::vector<Real> edges(12);
         edges[0]  = this->length(0,1);
         edges[1]  = this->length(1,2);
         edges[2]  = this->length(2,3);
         edges[3]  = this->length(0,3);
         edges[4]  = this->length(4,5);
         edges[5]  = this->length(5,6);
         edges[6]  = this->length(6,7);
         edges[7]  = this->length(4,7);
         edges[8]  = this->length(0,4);
         edges[9]  = this->length(1,5);
         edges[10] = this->length(2,6);
         edges[11] = this->length(3,7);
 
         const Real min_edge = *(std::min_element(edges.begin(), edges.end()));
         return sqrt3 * min_edge / max_diag ;
       }
 
 
     case SHAPE:
     case SKEW:
       {
         // From: P. Knupp, "Algebraic mesh quality metrics for
         // unstructured initial meshes," Finite Elements in Analysis
         // and Design 39, 2003, p. 217-241, Sections 6.2 and 6.3.
 
         // Make local copies of points, we will access these several
         // times below.
         const Point
           x0 = point(0), x1 = point(1), x2 = point(2), x3 = point(3),
           x4 = point(4), x5 = point(5), x6 = point(6), x7 = point(7);
 
         // The columns of the Jacobian matrices are:
         // \vec{x}_{\xi}   = \vec{a1}*eta*zeta + \vec{b1}*eta + \vec{c1}*zeta + \vec{d1}
         // \vec{x}_{\eta}  = \vec{a2}*xi*zeta  + \vec{b2}*xi  + \vec{c2}*zeta + \vec{d2}
         // \vec{x}_{\zeta} = \vec{a3}*xi*eta   + \vec{b3}*xi  + \vec{c3}*eta  + \vec{d3}
         // where the ai, bi, ci, and di are constants defined below.
         const Point a1 = -x0 + x1 - x2 + x3 + x4 - x5 + x6 - x7;
         const Point b1 =  x0 - x1 + x2 - x3 + x4 - x5 + x6 - x7;
         const Point c1 =  x0 - x1 - x2 + x3 - x4 + x5 + x6 - x7;
         const Point d1 = -x0 + x1 + x2 - x3 - x4 + x5 + x6 - x7;
 
         const Point a2 =  a1;
         const Point b2 =  b1;
         const Point c2 =  x0 + x1 - x2 - x3 - x4 - x5 + x6 + x7;
         const Point d2 = -x0 - x1 + x2 + x3 - x4 - x5 + x6 + x7;
 
         const Point a3 =  a1;
         const Point b3 =  c1;
         const Point c3 =  c2;
         const Point d3 = -x0 - x1 - x2 - x3 + x4 + x5 + x6 + x7;
 
         // Form the nodal Jacobians. These were computed using a
         // Python script and the formulas above. Note that we are
         // actually computing the Jacobian _columns_ and passing them
         // to the RealTensor constructor which expects _rows_, but
         // it's OK because we are only interested in determinants and
         // products which are not affected by taking the transpose.
         std::array<RealTensor, 8> A =
           {{
             RealTensor(d1, d2, d3),
             RealTensor(d1, b2 + d2, b3 + d3),
             RealTensor(b1 + d1, b2 + d2, a3 + b3 + c3 + d3),
             RealTensor(b1 + d1, d2, c3 + d3),
             RealTensor(c1 + d1, c2 + d2, d3),
             RealTensor(c1 + d1, a2 + b2 + c2 + d2, b3 + d3),
             RealTensor(a1 + b1 + c1 + d1, a2 + b2 + c2 + d2, a3 + b3 + c3 + d3),
             RealTensor(a1 + b1 + c1 + d1, c2 + d2, c3 + d3)
           }};
 
         // Compute Nodal areas, alpha_k = det(A_k).
         // If any of these are zero or negative, we return zero
         // (lowest possible value) for the quality, since the formulas
         // below require positive nodal areas.
         std::array<Real, 8> alpha;
         for (unsigned int k=0; k<alpha.size(); ++k)
           {
             alpha[k] = A[k].det();
             if (alpha[k] <= 0.)
               return 0.;
           }
 
         // Compute metric tensors, T_k = A_k^T * A_k.
         std::array<RealTensor, 8> T;
         for (unsigned int k=0; k<T.size(); ++k)
           T[k] = A[k] * A[k].transpose();
 
         // Compute and return the shape metric. These only use the
         // diagonal entries of the T_k.
         Real den = 0.;
         if (q == SHAPE)
           {
             for (unsigned int k=0; k<T.size(); ++k)
               den += T[k].tr() / std::pow(alpha[k], 2./3.);
             return (den == 0.) ? 0 : (24. / den);
           }
         else
           {
             for (unsigned int k=0; k<T.size(); ++k)
               den += std::pow(std::sqrt(T[k](0,0) * T[k](1,1) * T[k](2,2)) / alpha[k], 2./3.);
             return (den == 0.) ? 0 : (8. / den);
           }
       }
 #endif // LIBMESH_DIM >= 3
 
     default:
       return Elem::quality(q);
     }
 }

◆ quasicircumcenter()

virtual Point libMesh::Elem::quasicircumcenter ( ) const

inlinevirtualinherited

Returns: The "circumcenter of mass" (area-weighted average of triangulation circumcenters) of the element.

Not implemented for infinite elements, not currently implemented for 3D elements, currently ignores curvature of element edges.

Reimplemented in libMesh::NodeElem, libMesh::Edge, and libMesh::Face.

Definition at line 1020 of file elem.h.

Referenced by libMesh::Poly2TriTriangulator::insert_refinement_points().

1021 { libmesh_not_implemented(); }

◆ raw_child_ptr()

const Elem * libMesh::Elem::raw_child_ptr ( unsigned int i ) const

inlineinherited

Returns: A constant pointer to the $i^{th}$ child for this element. For internal use only - skips assertions about null pointers.

Definition at line 3104 of file elem.h.

References libMesh::Elem::_children.

Referenced by libMesh::CheckpointIO::read_remote_elem().

 {
   if (!_children)
     return nullptr;
 
   return _children[i];
 }

◆ reference_elem()

const Elem * libMesh::Elem::reference_elem ( ) const

inherited

Returns: A pointer to the "reference element" associated with this element. The reference element is the image of this element in reference parametric space. Importantly, it is not an actual element in the mesh, but rather a Singleton-type object, so for example all Quad4 elements share the same reference_elem().

If the element is of a type that can admit multiple topologies, such as a Polygon subtype, then there is no reference element; for such types this method should not be used.

Definition at line 441 of file elem.C.

References libMesh::ReferenceElem::get(), and libMesh::Elem::type().

Referenced by libMesh::RBEIMConstruction::enrich_eim_approximation_on_interiors(), libMesh::QComposite< QSubCell >::init(), and libMesh::RBParametrizedFunction::preevaluate_parametrized_function_on_mesh().

 {
   return &(ReferenceElem::get(this->type()));
 }

◆ refine()

void libMesh::Elem::refine ( MeshRefinement & mesh_refinement )

virtualinherited

Refine the element.

Definition at line 87 of file elem_refinement.C.

References libMesh::Elem::_children, libMesh::Elem::active(), libMesh::MeshRefinement::add_elem(), libMesh::MeshRefinement::add_node(), libMesh::Elem::ancestor(), libMesh::Elem::build(), libMesh::Elem::child_ptr(), libMesh::Elem::INACTIVE, libMesh::Elem::JUST_REFINED, libMesh::libmesh_assert(), libMesh::Elem::n_children(), libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_systems(), libMesh::Elem::p_level(), libMesh::Elem::p_refinement_flag(), libMesh::Elem::parent(), libMesh::Elem::REFINE, libMesh::Elem::refinement_flag(), libMesh::remote_elem, libMesh::DofObject::set_extra_integer(), libMesh::DofObject::set_n_systems(), libMesh::Elem::set_p_level(), libMesh::Elem::set_p_refinement_flag(), libMesh::Elem::set_refinement_flag(), libMesh::Elem::subactive(), and libMesh::Elem::type().

 {
   libmesh_assert_equal_to (this->refinement_flag(), Elem::REFINE);
   libmesh_assert (this->active());
 
   const unsigned int nc = this->n_children();
 
   // Create my children if necessary
   if (!_children)
     {
       _children = std::make_unique<Elem *[]>(nc);
 
       unsigned int parent_p_level = this->p_level();
       const unsigned int nei = this->n_extra_integers();
       for (unsigned int c = 0; c != nc; c++)
         {
           auto current_child = Elem::build(this->type(), this);
           _children[c] = current_child.get();
 
           current_child->set_refinement_flag(Elem::JUST_REFINED);
           current_child->set_p_level(parent_p_level);
           current_child->set_p_refinement_flag(this->p_refinement_flag());
 
           for (auto cnode : current_child->node_index_range())
             {
               Node * node =
                 mesh_refinement.add_node(*this, c, cnode,
                                          current_child->processor_id());
               node->set_n_systems (this->n_systems());
               current_child->set_node(cnode) = node;
             }
 
           Elem * added_child = mesh_refinement.add_elem (std::move(current_child));
           added_child->set_n_systems(this->n_systems());
           libmesh_assert_equal_to (added_child->n_extra_integers(),
                                    this->n_extra_integers());
           for (unsigned int i=0; i != nei; ++i)
             added_child->set_extra_integer(i, this->get_extra_integer(i));
         }
     }
   else
     {
       unsigned int parent_p_level = this->p_level();
       for (unsigned int c = 0; c != nc; c++)
         {
           Elem * current_child = this->child_ptr(c);
           if (current_child != remote_elem)
             {
               libmesh_assert(current_child->subactive());
               current_child->set_refinement_flag(Elem::JUST_REFINED);
               current_child->set_p_level(parent_p_level);
               current_child->set_p_refinement_flag(this->p_refinement_flag());
             }
         }
     }
 
   // Un-set my refinement flag now
   this->set_refinement_flag(Elem::INACTIVE);
 
   // Leave the p refinement flag set - we will need that later to get
   // projection operations correct
   // this->set_p_refinement_flag(Elem::INACTIVE);
 
 #ifndef NDEBUG
   for (unsigned int c = 0; c != nc; c++)
     if (this->child_ptr(c) != remote_elem)
       {
         libmesh_assert_equal_to (this->child_ptr(c)->parent(), this);
         libmesh_assert(this->child_ptr(c)->active());
       }
 #endif
   libmesh_assert (this->ancestor());
 }

◆ refinement_flag()

Elem::RefinementState libMesh::Elem::refinement_flag ( ) const

inlineinherited

Returns: The value of the refinement flag for the element.

Definition at line 3160 of file elem.h.

References libMesh::Elem::_rflag.

Referenced by libMesh::Elem::active(), libMesh::OldSolutionBase< Output, point_output >::check_old_context(), libMesh::Elem::coarsen(), libMesh::Elem::contract(), libMesh::MeshRefinement::enforce_mismatch_limit_prior_to_refinement(), libMesh::OldSolutionCoefs< Output, point_output >::eval_at_node(), libMesh::OldSolutionValue< Output, point_output >::eval_at_node(), libMesh::OldSolutionCoefs< Output, point_output >::eval_old_dofs(), libMesh::OldSolutionValue< Output, point_output >::eval_old_dofs(), libMesh::Elem::get_info(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_flags(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshRefinement::make_flags_parallel_consistent(), libMesh::Elem::make_links_to_me_local(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectEdges::operator()(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectSides::operator()(), libMesh::Elem::refine(), EquationSystemsTest::testRefineThenReinitPreserveFlags(), libMesh::BoundaryInfo::transfer_boundary_ids_from_children(), and libMesh::MeshRefinement::uniformly_coarsen().

 {
   return static_cast<RefinementState>(_rflag);
 }

◆ remove_links_to_me()

void libMesh::Elem::remove_links_to_me ( )

inherited

Resets this element's neighbors' appropriate neighbor pointers and its parent's and children's appropriate pointers to point to null instead of to this.

To be used before an element is deleted from a mesh.

Definition at line 1510 of file elem.C.

References libMesh::Elem::has_children(), libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::Elem::neighbor_ptr_range(), libMesh::Elem::parent(), libMesh::remote_elem, and libMesh::Elem::subactive().

Referenced by MeshDeletionsTest::testDeleteElem().

 {
   libmesh_assert_not_equal_to (this, remote_elem);
 
   // We need to have handled any children first
 #ifdef LIBMESH_ENABLE_AMR
   libmesh_assert (!this->has_children());
 #endif
 
   // Nullify any neighbor links
   for (auto neigh : this->neighbor_ptr_range())
     {
       if (neigh && neigh != remote_elem)
         {
           // My neighbor should never be more refined than me; my real
           // neighbor would have been its parent in that case.
           libmesh_assert_greater_equal (this->level(), neigh->level());
 
           if (this->level() == neigh->level() &&
               neigh->has_neighbor(this))
             {
 #ifdef LIBMESH_ENABLE_AMR
               // My neighbor may have descendants which also consider me a
               // neighbor
               std::vector<Elem *> family;
               neigh->total_family_tree_by_neighbor (family, this);
 
               for (auto & n : family)
                 {
                   libmesh_assert (n);
                   if (n->is_remote())
                     continue;
                   unsigned int my_s = n->which_neighbor_am_i(this);
                   libmesh_assert_less (my_s, n->n_neighbors());
                   libmesh_assert_equal_to (n->neighbor_ptr(my_s), this);
                   n->set_neighbor(my_s, nullptr);
                 }
 #else
               unsigned int my_s = neigh->which_neighbor_am_i(this);
               libmesh_assert_less (my_s, neigh->n_neighbors());
               libmesh_assert_equal_to (neigh->neighbor_ptr(my_s), this);
               neigh->set_neighbor(my_s, nullptr);
 #endif
             }
 #ifdef LIBMESH_ENABLE_AMR
           // Even if my neighbor doesn't link back to me, it might
           // have subactive descendants which do
           else if (neigh->has_children())
             {
               // If my neighbor at the same level doesn't have me as a
               // neighbor, I must be subactive
               libmesh_assert(this->level() > neigh->level() ||
                              this->subactive());
 
               // My neighbor must have some ancestor of mine as a
               // neighbor
               Elem * my_ancestor = this->parent();
               libmesh_assert(my_ancestor);
               while (!neigh->has_neighbor(my_ancestor))
                 {
                   my_ancestor = my_ancestor->parent();
                   libmesh_assert(my_ancestor);
                 }
 
               // My neighbor may have descendants which consider me a
               // neighbor
               std::vector<Elem *> family;
               neigh->total_family_tree_by_subneighbor (family, my_ancestor, this);
 
               for (auto & n : family)
                 {
                   libmesh_assert (n);
                   if (n->is_remote())
                     continue;
                   unsigned int my_s = n->which_neighbor_am_i(this);
                   libmesh_assert_less (my_s, n->n_neighbors());
                   libmesh_assert_equal_to (n->neighbor_ptr(my_s), this);
                   n->set_neighbor(my_s, nullptr);
                 }
             }
 #endif
         }
     }
 
 #ifdef LIBMESH_ENABLE_AMR
   // We can't currently delete a child with a parent!
   libmesh_assert (!this->parent());
 #endif
 }

◆ replace_child()

void libMesh::Elem::replace_child	(	Elem *	elem,
		unsigned int	c
	)

inherited

Replaces the child pointer at the specified index in the child array.

Definition at line 1961 of file elem.C.

References libMesh::Elem::child_ptr(), libMesh::Elem::has_children(), libMesh::libmesh_assert(), and libMesh::Elem::set_child().

Referenced by libMesh::UnstructuredMesh::all_first_order().

 {
   libmesh_assert(this->has_children());
 
   libmesh_assert(this->child_ptr(c));
 
   this->set_child(c, elem);
 }

◆ runtime_topology()

virtual bool libMesh::Elem::runtime_topology ( ) const

inlinevirtualinherited

Returns: true iff this element type can vary in topology (e.g. have different numbers of sides and/or nodes) at runtime. For such general polygons or polyhedra, APIs which assume a fixed topology are not safe to use.

Reimplemented in libMesh::Polygon.

Definition at line 246 of file elem.h.

Referenced by libMesh::FE< Dim, LAGRANGE_VEC >::edge_map(), libMesh::FE< Dim, LAGRANGE_VEC >::edge_reinit(), libMesh::QBase::init(), libMesh::FE< Dim, LAGRANGE_VEC >::reinit(), and libMesh::FE< Dim, LAGRANGE_VEC >::side_map().

246 { return false; }

◆ second_order_adjacent_vertex()

unsigned short int libMesh::Hex20::second_order_adjacent_vertex	(	const unsigned int	n,
		const unsigned int	v
	)		const

overridevirtual

Returns: The element-local number of the $v^{th}$ vertex that defines the $n^{th}$ second-order node.

Note: n uses the numbering shown above, $8 \le n < 20$ .

Reimplemented from libMesh::Elem.

Definition at line 291 of file cell_hex20.C.

References libMesh::Hex::_second_order_adjacent_vertices, n_nodes(), and libMesh::Hex::n_vertices().

 {
   libmesh_assert_greater_equal (n, this->n_vertices());
   libmesh_assert_less (n, this->n_nodes());
   libmesh_assert_less (v, 2);
   /*
    * the _second_order_adjacent_vertices matrix is
    * stored in cell_hex.C, since this matrix is identical
    * for Hex20 and Hex27 (for the first 12 higher-order nodes)
    */
   return _second_order_adjacent_vertices[n-this->n_vertices()][v];
 }

◆ second_order_child_vertex()

std::pair< unsigned short int, unsigned short int > libMesh::Hex20::second_order_child_vertex ( const unsigned int n ) const

overridevirtual

Returns: The child number c and element-local index v of the $n^{th}$ second-order node on the parent element. See elem.h for further details.

Reimplemented from libMesh::Elem.

Definition at line 308 of file cell_hex20.C.

References libMesh::Hex::_second_order_vertex_child_index, libMesh::Hex::_second_order_vertex_child_number, n_nodes(), and libMesh::Hex::n_vertices().

 {
   libmesh_assert_greater_equal (n, this->n_vertices());
   libmesh_assert_less (n, this->n_nodes());
   /*
    * the _second_order_vertex_child_* vectors are
    * stored in cell_hex.C, since they are identical
    * for Hex20 and Hex27 (for the first 12 higher-order nodes)
    */
   return std::pair<unsigned short int, unsigned short int>
     (_second_order_vertex_child_number[n],
      _second_order_vertex_child_index[n]);
 }

◆ second_order_equivalent_type()

ElemType libMesh::Elem::second_order_equivalent_type	(	const ElemType	et,
		const bool	full_ordered = `true`
	)

staticinherited

Returns: The ElemType of the associated second-order element (which will be the same as the input if the input is already a second-order ElemType) or INVALID_ELEM for elements that cannot be converted into higher order equivalents.

For example, when this is a TET4, then TET10 is returned.

For some elements, there exist two second-order equivalents, e.g. for Quad4 there is Quad8 and Quad9. When the optional full_ordered is true, then QUAD9 is returned. When full_ordered is false, then QUAD8 is returned.

Definition at line 3006 of file elem.C.

References libMesh::EDGE2, libMesh::EDGE3, libMesh::EDGE4, libMesh::Utility::enum_to_string(), libMesh::HEX20, libMesh::HEX27, libMesh::HEX8, libMesh::INFEDGE2, libMesh::INFHEX16, libMesh::INFHEX18, libMesh::INFHEX8, libMesh::INFPRISM12, libMesh::INFPRISM6, libMesh::INFQUAD4, libMesh::INFQUAD6, libMesh::NODEELEM, libMesh::PRISM15, libMesh::PRISM18, libMesh::PRISM20, libMesh::PRISM21, libMesh::PRISM6, libMesh::PYRAMID13, libMesh::PYRAMID14, libMesh::PYRAMID18, libMesh::PYRAMID5, libMesh::QUAD4, libMesh::QUAD8, libMesh::QUAD9, libMesh::QUADSHELL4, libMesh::QUADSHELL8, libMesh::QUADSHELL9, libMesh::TET10, libMesh::TET14, libMesh::TET4, libMesh::TRI3, libMesh::TRI6, libMesh::TRI7, and libMesh::TRISHELL3.

Referenced by libMesh::UnstructuredMesh::all_second_order_range(), libMesh::Elem::bracketing_nodes(), and libMesh::Elem::parent_bracketing_nodes().

 {
   switch (et)
     {
     case NODEELEM:
       return NODEELEM;
     case EDGE2:
     case EDGE3:
       {
         // full_ordered not relevant
         return EDGE3;
       }
 
     case EDGE4:
       {
         // full_ordered not relevant
         return EDGE4;
       }
 
     case TRI3:
     case TRI6:
       {
         // full_ordered not relevant
         return TRI6;
       }
 
     case TRI7:
       return TRI7;
 
       // Currently there is no TRISHELL6, so similarly to other types
       // where this is the case, we just return the input.
     case TRISHELL3:
       return TRISHELL3;
 
     case QUAD4:
     case QUAD8:
       {
         if (full_ordered)
           return QUAD9;
         else
           return QUAD8;
       }
 
     case QUADSHELL4:
     case QUADSHELL8:
       {
         if (full_ordered)
           return QUADSHELL9;
         else
           return QUADSHELL8;
       }
 
     case QUAD9:
       {
         // full_ordered not relevant
         return QUAD9;
       }
 
     case QUADSHELL9:
       {
         // full_ordered not relevant
         return QUADSHELL9;
       }
 
     case TET4:
     case TET10:
       {
         // full_ordered not relevant
         return TET10;
       }
 
     case TET14:
       return TET14;
 
     case HEX8:
     case HEX20:
       {
         // see below how this correlates with INFHEX8
         if (full_ordered)
           return HEX27;
         else
           return HEX20;
       }
 
     case HEX27:
       {
         // full_ordered not relevant
         return HEX27;
       }
 
     case PRISM6:
     case PRISM15:
       {
         if (full_ordered)
           return PRISM18;
         else
           return PRISM15;
       }
 
     // full_ordered not relevant, already fully second order
     case PRISM18:
       return PRISM18;
     case PRISM20:
       return PRISM20;
     case PRISM21:
       return PRISM21;
     case PYRAMID18:
       return PYRAMID18;
 
     case PYRAMID5:
     case PYRAMID13:
       {
         if (full_ordered)
           return PYRAMID14;
         else
           return PYRAMID13;
       }
 
     case PYRAMID14:
       {
         // full_ordered not relevant
         return PYRAMID14;
       }
 
 
 
 #ifdef LIBMESH_ENABLE_INFINITE_ELEMENTS
 
       // infinite elements
     case INFEDGE2:
       {
         return INFEDGE2;
       }
 
     case INFQUAD4:
     case INFQUAD6:
       {
         // full_ordered not relevant
         return INFQUAD6;
       }
 
     case INFHEX8:
     case INFHEX16:
       {
         /*
          * Note that this matches with \p Hex8:
          * For full-ordered, \p InfHex18 and \p Hex27
          * belong together, and for not full-ordered,
          * \p InfHex16 and \p Hex20 belong together.
          */
         if (full_ordered)
           return INFHEX18;
         else
           return INFHEX16;
       }
 
     case INFHEX18:
       {
         // full_ordered not relevant
         return INFHEX18;
       }
 
     case INFPRISM6:
     case INFPRISM12:
       {
         // full_ordered not relevant
         return INFPRISM12;
       }
 
 #endif
 
 
     default:
       {
         // what did we miss?
         libmesh_error_msg("No second order equivalent element type for et =  "
                           << Utility::enum_to_string(et));
       }
     }
 }

◆ set_buffer()

void libMesh::DofObject::set_buffer ( const std::vector< dof_id_type > & buf )

inlineinherited

Definition at line 717 of file dof_object.h.

References libMesh::DofObject::_idx_buf.

Referenced by DofObjectTest< Node >::testJensEftangBug().

718 { _idx_buf = buf; }

libMesh::DofObject::_idx_buf

index_buffer_t _idx_buf

Definition: dof_object.h:680

◆ set_dof_number()

void libMesh::DofObject::set_dof_number	(	const unsigned int	s,
		const unsigned int	var,
		const unsigned int	comp,
		const dof_id_type	dn
	)

inherited

Sets the global degree of freedom number for variable var, component comp for system s associated with this DofObject.

Definition at line 454 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::dof_number(), libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), libMesh::DofObject::n_comp(), libMesh::DofObject::n_comp_group(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_vars(), libMesh::DofObject::start_idx(), libMesh::DofObject::system_var_to_vg_var(), and libMesh::DofObject::var_to_vg().

 {
   libmesh_assert_less (s,    this->n_systems());
   libmesh_assert_less (var,  this->n_vars(s));
   libmesh_assert_less (comp, this->n_comp(s,var));
 
   const unsigned int
     vg            = this->var_to_vg(s,var),
 #ifndef NDEBUG
     ncg           = this->n_comp_group(s,vg),
 #endif
     vig           = this->system_var_to_vg_var(s,vg,var),
     start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg + 1), _idx_buf.size());
 
   dof_id_type & base_idx = _idx_buf[start_idx_sys + 2*vg + 1];
 
   // We intend to change all dof numbers together or not at all
   if (comp || vig)
     libmesh_assert ((dn == invalid_id && base_idx == invalid_id) ||
                     (dn == base_idx + vig*ncg + comp));
 
   // only explicitly store the base index for vig==0, comp==0
   else
     base_idx = dn;
 
   libmesh_assert_equal_to (this->dof_number(s, var, comp), dn);
 }

◆ set_extra_datum()

template<typename T >

void libMesh::DofObject::set_extra_datum	(	const unsigned int	index,
		const T	value
	)

inlineinherited

Sets the value on this object of the extra datum associated with index, which should have been obtained via a call to MeshBase::add_elem_datum or MeshBase::add_node_datum using the same type T.

Definition at line 1126 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_pseudo_systems(), libMesh::DofObject::start_idx_ints(), and value.

Referenced by libMesh::ExodusII_IO::read(), libMesh::DynaIO::read_mesh(), and DofObjectTest< Node >::testAddExtraData().

 {
 #ifndef NDEBUG
   const unsigned int n_more_integers = (sizeof(T)-1)/sizeof(dof_id_type);
 #endif
   libmesh_assert_less(index+n_more_integers, this->n_extra_integers());
   libmesh_assert_less(this->n_pseudo_systems(), _idx_buf.size());
 
   const unsigned int start_idx_i = this->start_idx_ints();
 
   libmesh_assert_less(start_idx_i+index+n_more_integers, _idx_buf.size());
   std::memcpy(&_idx_buf[start_idx_i+index], &value, sizeof(T));
 }

◆ set_extra_integer()

void libMesh::DofObject::set_extra_integer	(	const unsigned int	index,
		const dof_id_type	value
	)

inlineinherited

Sets the value on this object of the extra integer associated with index, which should have been obtained via a call to MeshBase::add_elem_integer or MeshBase::add_node_integer.

Definition at line 1086 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_pseudo_systems(), libMesh::DofObject::start_idx_ints(), and value.

Referenced by libMesh::SyncElementIntegers::act_on_data(), libMesh::BoundaryInfo::add_elements(), libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::create_submesh(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_connectivity(), libMesh::CheckpointIO::read_nodes(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::XdrIO::read_serialized_nodes(), libMesh::Elem::refine(), DofObjectTest< Node >::testAddExtraData(), DofObjectTest< Node >::testAddSystemExtraInts(), DofObjectTest< Node >::testSetNSystemsExtraInts(), and DofObjectTest< Node >::testSetNVariableGroupsExtraInts().

 {
   libmesh_assert_less(index, this->n_extra_integers());
   libmesh_assert_less(this->n_pseudo_systems(), _idx_buf.size());
 
   const unsigned int start_idx_i = this->start_idx_ints();
 
   libmesh_assert_less(start_idx_i+index, _idx_buf.size());
   _idx_buf[start_idx_i+index] = value;
 }

◆ set_id() [1/2]

dof_id_type & libMesh::DofObject::set_id ( )

inlineinherited

Returns: The id for this DofObject as a writable reference.

Definition at line 836 of file dof_object.h.

References libMesh::DofObject::_id.

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::UnstructuredMesh::all_first_order(), libMesh::DistributedMesh::fix_broken_node_and_element_numbering(), libMesh::DofObject::invalidate_id(), libMesh::Node::Node(), libMesh::DistributedMesh::own_node(), libMesh::VTKIO::read(), libMesh::RemoteElem::RemoteElem(), libMesh::ReplicatedMesh::renumber_elem(), libMesh::DistributedMesh::renumber_elem(), libMesh::ReplicatedMesh::renumber_node(), libMesh::DistributedMesh::renumber_node(), libMesh::ReplicatedMesh::renumber_nodes_and_elements(), libMesh::DofObject::set_id(), VolumeTest::testC0Polygon(), DofObjectTest< Node >::testInvalidateId(), DofObjectTest< Node >::testSetId(), DofObjectTest< Node >::testValidId(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
   return _id;
 }

◆ set_id() [2/2]

void libMesh::DofObject::set_id ( const dof_id_type dofid )

inlineinherited

Sets the id for this DofObject.

Definition at line 201 of file dof_object.h.

References libMesh::DofObject::set_id().

202 { this->set_id() = dofid; }

libMesh::DofObject::set_id

dof_id_type & set_id()

Definition: dof_object.h:836

◆ set_interior_parent()

void libMesh::Elem::set_interior_parent ( Elem * p )

inherited

Sets the pointer to the element's interior_parent.

Dangerous! Only use this if you know what you are doing!

Definition at line 1119 of file elem.C.

References libMesh::Elem::_elemlinks, libMesh::Elem::dim(), libMesh::libmesh_assert(), libMesh::Elem::n_sides(), and libMesh::remote_elem.

Referenced by libMesh::BoundaryInfo::add_elements(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::Edge::Edge(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Hex::Hex(), libMesh::InfHex::InfHex(), libMesh::InfQuad::InfQuad(), libMesh::NodeElem::NodeElem(), libMesh::Polygon::Polygon(), libMesh::Prism::Prism(), libMesh::Pyramid::Pyramid(), libMesh::Quad::Quad(), libMesh::Tet::Tet(), libMesh::Tri::Tri(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
   // interior parents make no sense for full-dimensional elements.
   libmesh_assert (!p ||
                   this->dim() < LIBMESH_DIM);
 
   // If we have an interior_parent, we USED TO assume it was a
   // one-higher-dimensional interior element, but we now allow e.g.
   // edge elements to have a 3D interior_parent with no
   // intermediate 2D element.
   // libmesh_assert (!p ||
   //                 p->dim() == (this->dim()+1));
   libmesh_assert (!p ||
                   (p == remote_elem) ||
                   (p->dim() > this->dim()));
 
   _elemlinks[1+this->n_sides()] = p;
 }

◆ set_mapping_data()

void libMesh::Elem::set_mapping_data ( const unsigned char data )

inlineinherited

Sets the value of the mapping data for the element.

Definition at line 3094 of file elem.h.

References libMesh::Elem::_map_data.

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::UnstructuredMesh::all_first_order(), libMesh::ReplicatedMesh::insert_elem(), and libMesh::DistributedMesh::insert_elem().

 {
   _map_data = data;
 }

◆ set_mapping_type()

void libMesh::Elem::set_mapping_type ( const ElemMappingType type )

inlineinherited

Sets the value of the mapping type for the element.

Definition at line 3078 of file elem.h.

References libMesh::Elem::_map_type, and libMesh::Elem::type().

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::UnstructuredMesh::all_first_order(), libMesh::ReplicatedMesh::insert_elem(), and libMesh::DistributedMesh::insert_elem().

 {
   _map_type = cast_int<unsigned char>(type);
 }

◆ set_n_comp()

void libMesh::DofObject::set_n_comp	(	const unsigned int	s,
		const unsigned int	var,
		const unsigned int	ncomp
	)

inherited

Sets the number of components for Variable var of system s associated with this DofObject.

Definition at line 385 of file dof_object.C.

References libMesh::DofObject::n_systems(), libMesh::DofObject::n_vars(), libMesh::DofObject::set_n_comp_group(), and libMesh::DofObject::var_to_vg().

 {
   libmesh_assert_less (s,   this->n_systems());
   libmesh_assert_less (var, this->n_vars(s));
 
   this->set_n_comp_group(s, this->var_to_vg(s,var), ncomp);
 }

◆ set_n_comp_group()

void libMesh::DofObject::set_n_comp_group	(	const unsigned int	s,
		const unsigned int	vg,
		const unsigned int	ncomp
	)

inherited

Sets the number of components for VariableGroup vg of system s associated with this DofObject.

Definition at line 397 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::invalid_id, libMesh::DofObject::n_comp_group(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::n_vars(), libMesh::DofObject::ncv_magic, and libMesh::DofObject::start_idx().

Referenced by libMesh::DofMap::reinit(), libMesh::DofObject::set_n_comp(), libMesh::DofObject::set_n_vars_per_group(), libMesh::DofMap::set_nonlocal_dof_objects(), and DofObjectTest< Node >::testManualDofCalculation().

 {
   libmesh_assert_less (s,  this->n_systems());
   libmesh_assert_less (vg, this->n_var_groups(s));
 
   // Check for trivial return
   if (ncomp == this->n_comp_group(s,vg)) return;
 
 #ifndef NDEBUG
   if (ncomp >= ncv_magic)
     {
       const index_t ncvm = ncv_magic;
       libmesh_error_msg("ERROR: ncomp must be less than DofObject::ncv_magic!\n" \
                         << "ncomp = "                                   \
                         << ncomp                                \
                         << ", ncv_magic = "                     \
                         << ncvm                                 \
                         << "\nrecompile and try again!");
     }
 #endif
 
   const unsigned int
     start_idx_sys = this->start_idx(s),
     n_vars_group  = this->n_vars(s,vg),
     base_offset   = start_idx_sys + 2*vg;
 
   libmesh_assert_less ((base_offset + 1), _idx_buf.size());
 
   // if (ncomp)
   //   libMesh::out << "s,vg,ncomp="
   //       << s  << ","
   //       << vg << ","
   //       << ncomp << '\n';
 
   // set the number of components, maintaining the number
   // of variables in the group
   _idx_buf[base_offset] = ncv_magic*n_vars_group + ncomp;
 
   // We use (invalid_id - 1) to signify no
   // components for this object
   _idx_buf[base_offset + 1] = (ncomp == 0) ? invalid_id - 1 : invalid_id;
 
   // this->debug_buffer();
   // libMesh::out << "s,vg = " << s << "," << vg << '\n'
   //     << "base_offset=" << base_offset << '\n'
   //     << "this->n_comp(s,vg)=" << this->n_comp(s,vg) << '\n'
   //     << "this->n_comp_group(s,vg)=" << this->n_comp_group(s,vg) << '\n'
   //     << "this->n_vars(s,vg)=" << this->n_vars(s,vg) << '\n'
   //     << "this->n_var_groups(s)=" << this->n_var_groups(s) << '\n';
 
   libmesh_assert_equal_to (ncomp, this->n_comp_group(s,vg));
 }

◆ set_n_systems()

void libMesh::DofObject::set_n_systems ( const unsigned int s )

inherited

Sets the number of systems for this DofObject.

If this number is a change, also clears all variable count and DoF indexing associated with this DofObject.

If any extra integers are associated with this DofObject, their count and values are unchanged.

Definition at line 150 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::make_range(), libMesh::DofObject::n_extra_integers(), libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::n_vars(), and libMesh::DofObject::start_idx_ints().

Referenced by libMesh::DofObject::add_system(), libMesh::DofObject::clear_dofs(), libMesh::Elem::refine(), DofObjectTest< Node >::testManualDofCalculation(), DofObjectTest< Node >::testSetNSystems(), DofObjectTest< Node >::testSetNSystemsExtraInts(), DofObjectTest< Node >::testSetNVariableGroups(), and DofObjectTest< Node >::testSetNVariableGroupsExtraInts().

 {
   const unsigned int old_ns = this->n_systems();
 
   // Check for trivial return
   if (ns == old_ns)
     return;
 
   const unsigned int nei = this->n_extra_integers();
   const dof_id_type header_size = ns + bool(nei);
   const dof_id_type hdr = nei ?
     static_cast<dof_id_type>(-static_cast<std::ptrdiff_t>(header_size))
     : header_size;
   index_buffer_t new_buf(header_size + nei, hdr);
   if (nei)
     {
       const unsigned int start_idx_ints = old_ns ?
         cast_int<unsigned int>(_idx_buf[old_ns]) :
         1;
       libmesh_assert_less(start_idx_ints, _idx_buf.size());
       std::copy(_idx_buf.begin()+start_idx_ints,
                 _idx_buf.end(),
                 new_buf.begin()+header_size);
       if (ns)
         std::fill(new_buf.begin()+1, new_buf.begin()+ns+1, ns+1);
     }
 
   // vector swap trick to force deallocation when shrinking
   new_buf.swap(_idx_buf);
 
 #ifdef DEBUG
   libmesh_assert_equal_to(nei, this->n_extra_integers());
 
   // check that all systems now exist and that they have 0 size
   libmesh_assert_equal_to (ns, this->n_systems());
   for (auto s : make_range(this->n_systems()))
     {
       libmesh_assert_equal_to (this->n_vars(s),       0);
       libmesh_assert_equal_to (this->n_var_groups(s), 0);
     }
 #endif
 }

◆ set_n_vars_per_group()

void libMesh::DofObject::set_n_vars_per_group	(	const unsigned int	s,
		const std::vector< unsigned int > &	nvpg
	)

inherited

Sets number of variables in each group associated with system s for this DofObject.

Implicit in this is also setting the number of VariableGroup variable groups for the system. Has the effect of setting the number of components to 0 even when called even with (nvg == this->n_var_groups(s)).

Definition at line 247 of file dof_object.C.

Referenced by DofObjectTest< Node >::testManualDofCalculation(), DofObjectTest< Node >::testSetNVariableGroups(), and DofObjectTest< Node >::testSetNVariableGroupsExtraInts().

 {
   const unsigned int n_sys = this->n_systems();
 
   libmesh_assert_less (s, n_sys);
 
   // number of variable groups for this system - inferred
   const unsigned int nvg = cast_int<unsigned int>(nvpg.size());
 
   // BSK - note that for compatibility with the previous implementation
   // calling this method when (nvars == this->n_vars()) requires that
   // we invalidate the DOF indices and set the number of components to 0.
   // Note this was a bit of a surprise to me - there was no quick return in
   // the old method, which caused removal and readdition of the DOF indices
   // even in the case of (nvars == this->n_vars()), resulting in n_comp(s,v)
   // implicitly becoming 0 regardless of any previous value.
   // quick return?
   if (nvg == this->n_var_groups(s))
     {
       for (unsigned int vg=0; vg<nvg; vg++)
         {
           this->set_n_comp_group(s,vg,0);
           libmesh_assert_equal_to (this->n_vars(s,vg), nvpg[vg]);
         }
       return;
     }
 
   const bool hei = this->has_extra_integers();
 
   // since there is ample opportunity to screw up other systems, let us
   // cache their current sizes and later assert that they are unchanged.
 #ifdef DEBUG
   const unsigned int nei = this->n_extra_integers();
 
   DofObject::index_buffer_t old_system_sizes, old_extra_integers;
   old_system_sizes.reserve(n_sys);
   old_extra_integers.reserve(nei);
 
   for (unsigned int s_ctr=0; s_ctr<n_sys; s_ctr++)
     old_system_sizes.push_back(this->n_var_groups(s_ctr));
 
   for (unsigned int ei=0; ei != nei; ++ei)
     old_extra_integers.push_back(this->get_extra_integer(ei));
 #endif
 
   // remove current indices if we have some
   if (this->n_var_groups(s) != 0)
     {
       const unsigned int old_nvg_s = this->n_var_groups(s);
 
       DofObject::index_buffer_t::iterator
         it  = _idx_buf.begin(),
         end = _idx_buf.begin();
 
       std::advance(it,  this->start_idx(s));
       std::advance(end, this->end_idx(s));
       _idx_buf.erase(it,end);
 
       for (unsigned int ctr=(s+1); ctr<n_sys; ctr++)
         _idx_buf[ctr] -= 2*old_nvg_s;
 
       if (hei)
         _idx_buf[n_sys] -= 2*old_nvg_s;
     }
 
   // better not have any now!
   libmesh_assert_equal_to (this->n_var_groups(s), 0);
 
   // Make sure we didn't screw up any of our sizes!
 #ifdef DEBUG
   for (auto s_ctr : make_range(this->n_systems()))
     if (s_ctr != s)
       libmesh_assert_equal_to (this->n_var_groups(s_ctr), old_system_sizes[s_ctr]);
 
   libmesh_assert_equal_to (nei, this->n_extra_integers());
 
   for (unsigned int ei=0; ei != nei; ++ei)
     libmesh_assert_equal_to(old_extra_integers[ei], this->get_extra_integer(ei));
 #endif
 
   // OK, if the user requested 0 that is what we have
   if (nvg == 0)
     return;
 
   {
     // array to hold new indices
     DofObject::index_buffer_t var_idxs(2*nvg);
     for (unsigned int vg=0; vg<nvg; vg++)
       {
         var_idxs[2*vg    ] = ncv_magic*nvpg[vg] + 0;
         var_idxs[2*vg + 1] = invalid_id - 1;
       }
 
     DofObject::index_buffer_t::iterator it = _idx_buf.begin();
     std::advance(it, this->end_idx(s));
     _idx_buf.insert(it, var_idxs.begin(), var_idxs.end());
 
     for (unsigned int ctr=(s+1); ctr<n_sys; ctr++)
       _idx_buf[ctr] += 2*nvg;
 
     if (hei)
       _idx_buf[n_sys] += 2*nvg;
 
     // resize _idx_buf to fit so no memory is wasted.
     DofObject::index_buffer_t(_idx_buf).swap(_idx_buf);
   }
 
   libmesh_assert_equal_to (nvg, this->n_var_groups(s));
 
 #ifdef DEBUG
 
   libmesh_assert_equal_to (this->n_var_groups(s), nvpg.size());
 
   for (auto vg : make_range(this->n_var_groups(s)))
     {
       libmesh_assert_equal_to (this->n_vars(s,vg), nvpg[vg]);
       libmesh_assert_equal_to (this->n_comp_group(s,vg), 0);
     }
 
   for (auto v : make_range(this->n_vars(s)))
     libmesh_assert_equal_to (this->n_comp(s,v), 0);
 
   // again, all other system sizes should be unchanged!
   for (auto s_ctr : make_range(this->n_systems()))
     if (s_ctr != s)
       libmesh_assert_equal_to (this->n_var_groups(s_ctr), old_system_sizes[s_ctr]);
 
   // Extra integers count and values should also be unchanged!
   libmesh_assert_equal_to (nei, this->n_extra_integers());
 
   for (unsigned int ei=0; ei != nei; ++ei)
     libmesh_assert_equal_to(old_extra_integers[ei], this->get_extra_integer(ei));
 #endif
 }

◆ set_neighbor()

void libMesh::Elem::set_neighbor	(	const unsigned int	i,
		Elem *	n
	)

inlineinherited

Assigns n as the $i^{th}$ neighbor.

Definition at line 2540 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::n_neighbors().

Referenced by libMesh::MeshTools::Subdivision::add_boundary_ghosts(), libMesh::BoundaryInfo::add_elements(), libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::Elem::nullify_neighbors(), libMesh::C0Polygon::permute(), libMesh::CheckpointIO::read_remote_elem(), libMesh::UnstructuredMesh::stitching_helper(), libMesh::Elem::swap2neighbors(), MeshBaseTest::testMeshBaseVerifyIsPrepared(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
   libmesh_assert_less (i, this->n_neighbors());
 
   _elemlinks[i+1] = n;
 }

◆ set_node()

Node *& libMesh::Elem::set_node ( const unsigned int i )

inlinevirtualinherited

Returns: The pointer to local Node i as a writable reference.

Reimplemented in libMesh::RemoteElem.

Definition at line 2494 of file elem.h.

References libMesh::Elem::_nodes, and libMesh::Elem::n_nodes().

Referenced by LinearElasticityWithContact::add_contact_edge_elements(), add_cube_convex_hull_to_mesh(), libMesh::UnstructuredMesh::all_first_order(), AllSecondOrderTest::allCompleteOrderMixed(), AllSecondOrderTest::allCompleteOrderRange(), AllSecondOrderTest::allSecondOrderMixed(), AllSecondOrderTest::allSecondOrderRange(), libMesh::TetGenMeshInterface::assign_nodes_to_elem(), libMesh::MeshTools::Generation::build_cube(), GetBoundaryPointsTest::build_mesh(), MixedDimensionMeshTest::build_mesh(), MeshfunctionDFEM::build_mesh(), SlitMeshTest::build_mesh(), MixedDimensionNonUniformRefinement::build_mesh(), MixedDimensionNonUniformRefinementTriangle::build_mesh(), MixedDimensionNonUniformRefinement3D::build_mesh(), OverlappingTestBase::build_quad_mesh(), libMesh::TriangleWrapper::copy_tri_to_mesh(), libMesh::UnstructuredMesh::create_submesh(), libMesh::C0Polygon::permute(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::AbaqusIO::read_elements(), libMesh::GmshIO::read_mesh(), libMesh::DynaIO::read_mesh(), libMesh::MatlabIO::read_stream(), libMesh::RemoteElem::set_node(), PerElemTest< elem_type >::setUp(), libMesh::FE< Dim, LAGRANGE_VEC >::shape(), libMesh::UnstructuredMesh::stitching_helper(), libMesh::MeshTools::Generation::surface_octahedron(), libMesh::Elem::swap2nodes(), SystemsTest::testDofCouplingWithVarGroups(), MeshTriangulationTest::testEdgesMesh(), MeshTriangulationTest::testHalfDomain(), NodalNeighborsTest::testOrientation(), MeshTriangulationTest::testPoly2TriBad1DMultiBoundary(), MeshTriangulationTest::testPoly2TriBad2DMultiBoundary(), MeshTriangulationTest::testPoly2TriBadEdges(), EquationSystemsTest::testPostInitAddElem(), SystemsTest::testProjectMatrix3D(), InfFERadialTest::testRefinement(), EquationSystemsTest::testReinitWithNodeElem(), BoundaryInfoTest::testShellFaceConstraints(), InfFERadialTest::testSides(), MeshTetTest::testTetsToTets(), MeshSubdomainIDTest::testUnpartitioned(), and libMesh::Poly2TriTriangulator::triangulate_current_points().

 {
   libmesh_assert_less (i, this->n_nodes());
 
   return _nodes[i];
 }

◆ set_old_dof_object()

void libMesh::DofObject::set_old_dof_object ( )

inherited

Sets the old_dof_object to a copy of this.

Definition at line 135 of file dof_object.C.

References libMesh::DofObject::clear_old_dof_object(), libMesh::DofObject::construct(), libMesh::libmesh_assert(), and libMesh::DofObject::old_dof_object.

 {
   this->clear_old_dof_object();
 
   libmesh_assert (!this->old_dof_object);
 
   // Make a new DofObject, assign a copy of \p this.
   // Make sure the copy ctor for DofObject works!!
   this->old_dof_object = this->construct(this);
 }

◆ set_p_level()

void libMesh::Elem::set_p_level ( const unsigned int p )

inherited

Sets the value of the p-refinement level for the element.

The following functions only apply when AMR is enabled and thus are not present otherwise.

Note: The maximum p-refinement level is currently 255.

Definition at line 41 of file elem_refinement.C.

References libMesh::Elem::_p_level, libMesh::Elem::child_ref_range(), libMesh::Elem::hack_p_level(), libMesh::Elem::JUST_COARSENED, libMesh::Elem::JUST_REFINED, libMesh::Elem::p_level(), libMesh::Elem::parent(), libMesh::Elem::set_p_level(), and libMesh::Elem::set_p_refinement_flag().

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::Elem::coarsen(), libMesh::Elem::Elem(), libMesh::Polygon::Polygon(), libMesh::Elem::refine(), libMesh::Elem::set_p_level(), and VolumeTest::testHex20PLevelTrueCentroid().

 {
   // Maintain the parent's p level as the minimum of it's children
   if (this->parent() != nullptr)
     {
       unsigned int parent_p_level = this->parent()->p_level();
 
       // If our new p level is less than our parents, our parents drops
       if (parent_p_level > p)
         {
           this->parent()->set_p_level(p);
 
           // And we should keep track of the drop, in case we need to
           // do a projection later.
           this->parent()->set_p_refinement_flag(Elem::JUST_COARSENED);
         }
       // If we are the lowest p level and it increases, so might
       // our parent's, but we have to check every other child to see
       else if (parent_p_level == _p_level && _p_level < p)
         {
           _p_level = cast_int<unsigned char>(p);
           parent_p_level = cast_int<unsigned char>(p);
           for (auto & c : this->parent()->child_ref_range())
             parent_p_level = std::min(parent_p_level,
                                       c.p_level());
 
           // When its children all have a higher p level, the parent's
           // should rise
           if (parent_p_level > this->parent()->p_level())
             {
               this->parent()->set_p_level(parent_p_level);
 
               // And we should keep track of the rise, in case we need to
               // do a projection later.
               this->parent()->set_p_refinement_flag(Elem::JUST_REFINED);
             }
 
           return;
         }
     }
 
   this->hack_p_level(p);
 }

◆ set_p_refinement_flag()

void libMesh::Elem::set_p_refinement_flag ( const RefinementState pflag )

inlineinherited

Sets the value of the p-refinement flag for the element.

Definition at line 3184 of file elem.h.

References libMesh::Elem::_pflag, libMesh::Elem::JUST_REFINED, and libMesh::Elem::p_level().

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::MeshRefinement::enforce_mismatch_limit_prior_to_refinement(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshRefinement::make_flags_parallel_consistent(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::Elem::refine(), and libMesh::Elem::set_p_level().

 {
   if (this->p_level() == 0)
     libmesh_assert_not_equal_to
       (pflag, Elem::JUST_REFINED);
 
   _pflag = cast_int<unsigned char>(pflag);
 }

◆ set_parent()

void libMesh::Elem::set_parent ( Elem * p )

inlineinherited

Sets the pointer to the element's parent.

Dangerous! Only use this if you know what you are doing!

Definition at line 2996 of file elem.h.

References libMesh::Elem::_elemlinks, and libMesh::Elem::dim().

Referenced by libMesh::BoundaryInfo::add_elements(), and libMesh::UnstructuredMesh::all_first_order().

 {
   // We no longer support using parent() as interior_parent()
   libmesh_assert_equal_to(this->dim(), p ? p->dim() : this->dim());
   _elemlinks[0] = p;
 }

◆ set_refinement_flag()

void libMesh::Elem::set_refinement_flag ( const RefinementState rflag )

inlineinherited

Sets the value of the refinement flag for the element.

Definition at line 3168 of file elem.h.

References libMesh::Elem::_rflag.

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::Elem::coarsen(), libMesh::Elem::contract(), libMesh::MeshRefinement::enforce_mismatch_limit_prior_to_refinement(), libMesh::MeshRefinement::flag_elements_by_elem_fraction(), libMesh::MeshRefinement::flag_elements_by_nelem_target(), main(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshRefinement::make_flags_parallel_consistent(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::Elem::refine(), InfFERadialTest::testRefinement(), EquationSystemsTest::testRefineThenReinitPreserveFlags(), EquationSystemsTest::testSelectivePRefine(), and libMesh::MeshRefinement::uniformly_coarsen().

 {
   _rflag = cast_int<unsigned char>(rflag);
 }

◆ set_unique_id() [1/2]

unique_id_type & libMesh::DofObject::set_unique_id ( )

inlineinherited

Returns: The globally unique_id for this DofObject as a writable reference. Deprecated; use the API taking an input instead.

Definition at line 858 of file dof_object.h.

References libMesh::DofObject::_unique_id.

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::create_submesh(), libMesh::ReplicatedMesh::insert_elem(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_node(), ExodusTest< elem_type >::meshes_equal_enough(), libMesh::Nemesis_IO::read(), libMesh::CheckpointIO::read_nodes(), libMesh::XdrIO::read_serialized_nodes(), libMesh::SimplexRefiner::refine_via_edges(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   libmesh_deprecated();
   return _unique_id;
 #else
   libmesh_not_implemented();
 #endif
 }

◆ set_unique_id() [2/2]

void libMesh::DofObject::set_unique_id ( unique_id_type new_id )

inlineinherited

Sets the unique_id for this DofObject.

Definition at line 872 of file dof_object.h.

References libMesh::DofObject::_unique_id, and libMesh::libmesh_ignore().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   _unique_id = new_id;
 #else
   libmesh_ignore(new_id);
   libmesh_not_implemented();
 #endif
 }

◆ set_vg_dof_base()

void libMesh::DofObject::set_vg_dof_base	(	const unsigned int	s,
		const unsigned int	vg,
		const dof_id_type	db
	)

inlineinherited

VariableGroup DoF indices are indexed as id = base + var_in_vg*ncomp + comp This method allows for direct access to the base.

Definition at line 1297 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), libMesh::DofObject::start_idx(), and libMesh::DofObject::vg_dof_base().

Referenced by libMesh::DofMap::distribute_local_dofs_node_major(), libMesh::DofMap::distribute_local_dofs_var_major(), libMesh::DofObject::invalidate_dofs(), libMesh::DofMap::reinit(), libMesh::DofMap::set_nonlocal_dof_objects(), and DofObjectTest< Node >::testManualDofCalculation().

 {
   libmesh_assert_less (s,  this->n_systems());
   libmesh_assert_less (vg, this->n_var_groups(s));
 
   const unsigned int
     start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg + 1), _idx_buf.size());
 
   _idx_buf[start_idx_sys + 2*vg + 1] = db;
 
   libmesh_assert_equal_to (this->vg_dof_base(s,vg), db);
 }

◆ side_index_range()

IntRange< unsigned short > libMesh::Elem::side_index_range ( ) const

inlineinherited

Returns: An integer range from 0 up to (but not including) the number of sides this element has.

Definition at line 2623 of file elem.h.

References libMesh::Elem::n_sides().

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::MeshTools::Subdivision::add_boundary_ghosts(), libMesh::BoundaryInfo::add_elements(), libMesh::MeshTools::Modification::all_tri(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::FEGenericBase< FEOutputType< T >::type >::coarsened_dof_values(), compute_enriched_soln(), libMesh::FEAbstract::compute_node_constraints(), libMesh::FEAbstract::compute_periodic_node_constraints(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints(), libMesh::BoundaryInfo::copy_boundary_ids(), libMesh::BoundaryInfo::edge_boundary_ids(), libMesh::JumpErrorEstimator::estimate_error(), libMesh::MeshTools::Modification::flatten(), libMesh::ReplicatedMesh::get_disconnected_subdomains(), libMesh::Elem::get_info(), libMesh::BoundaryInfo::get_side_and_node_maps(), libMesh::Elem::has_topological_neighbor(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_constraints(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_node_constraints(), libMesh::LaplaceMeshSmoother::init(), libMesh::Elem::libmesh_assert_valid_neighbors(), libMesh::Elem::nullify_neighbors(), libMesh::PostscriptIO::plot_quadratic_elem(), libMesh::MeshTools::Modification::smooth(), libMesh::UnstructuredMesh::stitching_helper(), MeshBaseTest::testMeshBaseVerifyIsPrepared(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

 {
   return {0, cast_int<unsigned short>(this->n_sides())};
 }

◆ side_ptr() [1/4]

std::unique_ptr< Elem > libMesh::Hex::side_ptr ( const unsigned int i )

finaloverridevirtualinherited

Returns: A primitive (4-noded) quad for face i.

Implements libMesh::Elem.

Definition at line 148 of file cell_hex.C.

References libMesh::Hex::n_sides(), libMesh::Elem::node_ptr(), and libMesh::Hex8::side_nodes_map.

 {
   libmesh_assert_less (i, this->n_sides());
 
   std::unique_ptr<Elem> face = std::make_unique<Quad4>();
 
   for (auto n : face->node_index_range())
     face->set_node(n) = this->node_ptr(Hex8::side_nodes_map[i][n]);
 
   return face;
 }

◆ side_ptr() [2/4]

void libMesh::Hex::side_ptr	(	std::unique_ptr< Elem > &	side,
		const unsigned int	i
	)

finaloverridevirtualinherited

Rebuilds a primitive (4-noded) quad for face i.

Implements libMesh::Elem.

Definition at line 162 of file cell_hex.C.

References libMesh::QUAD4.

 {
   this->simple_side_ptr<Hex,Hex8>(side, i, QUAD4);
 }

◆ side_ptr() [3/4]

std::unique_ptr< const Elem > libMesh::Elem::side_ptr ( unsigned int i ) const

inlineinherited

Definition at line 2632 of file elem.h.

References libMesh::Elem::side_ptr().

 {
   // Call the non-const version of this function, return the result as
   // a std::unique_ptr<const Elem>.
   Elem * me = const_cast<Elem *>(this);
   const Elem * s = const_cast<const Elem *>(me->side_ptr(i).release());
   return std::unique_ptr<const Elem>(s);
 }

◆ side_ptr() [4/4]

void libMesh::Elem::side_ptr	(	std::unique_ptr< const Elem > &	side,
		const unsigned int	i
	)		const

inlineinherited

Definition at line 2645 of file elem.h.

References libMesh::Elem::side_ptr().

 {
   // Hand off to the non-const version of this function
   Elem * me = const_cast<Elem *>(this);
   std::unique_ptr<Elem> e {const_cast<Elem *>(elem.release())};
   me->side_ptr(e, i);
   elem = std::move(e);
 }

◆ side_type()

ElemType libMesh::Hex20::side_type ( const unsigned int s ) const

finaloverridevirtual

Returns: The type of element for side s.

Implements libMesh::Elem.

Definition at line 784 of file cell_hex20.C.

References libMesh::QUAD8.

 {
   libmesh_assert_less (s, 6);
   return QUAD8;
 }

◆ sides_on_edge()

std::vector< unsigned int > libMesh::Hex::sides_on_edge ( const unsigned int int ) const

finaloverridevirtualinherited

Returns: the (local) side numbers that touch the specified edge

Implements libMesh::Elem.

Definition at line 202 of file cell_hex.C.

References libMesh::Hex::edge_sides_map, and libMesh::Hex::n_edges().

 {
   libmesh_assert_less(e, this->n_edges());
 
   return {edge_sides_map[e][0], edge_sides_map[e][1]};
 }

◆ simple_build_edge_ptr() [1/2]

template<typename Edgeclass , typename Subclass >

std::unique_ptr< Elem > libMesh::Elem::simple_build_edge_ptr ( const unsigned int i )

inlineprotectedinherited

An implementation for simple (all edges equal) elements.

Definition at line 2808 of file elem.h.

References libMesh::Elem::mapping_type(), libMesh::Elem::n_edges(), libMesh::Elem::node_ptr(), libMesh::Elem::p_level(), and libMesh::Elem::subdomain_id().

 {
   libmesh_assert_less (i, this->n_edges());
 
   std::unique_ptr<Elem> edge = std::make_unique<Edgeclass>(this);
 
   for (auto n : edge->node_index_range())
     edge->set_node(n) = this->node_ptr(Subclass::edge_nodes_map[i][n]);
 
   edge->set_interior_parent(this);
   edge->set_mapping_type(this->mapping_type());
   edge->subdomain_id() = this->subdomain_id();
 #ifdef LIBMESH_ENABLE_AMR
   edge->set_p_level(this->p_level());
 #endif
 
   return edge;
 }

◆ simple_build_edge_ptr() [2/2]

template<typename Subclass >

void libMesh::Elem::simple_build_edge_ptr	(	std::unique_ptr< Elem > &	edge,
		const unsigned int	i,
		ElemType	edgetype
	)

inlineprotectedinherited

An implementation for simple (all edges equal) elements.

Definition at line 2833 of file elem.h.

References libMesh::Elem::mapping_type(), libMesh::Elem::n_edges(), libMesh::Elem::node_ptr(), libMesh::Elem::p_level(), and libMesh::Elem::subdomain_id().

 {
   libmesh_assert_less (i, this->n_edges());
 
   if (!edge.get() || edge->type() != edgetype)
     {
       Subclass & real_me = cast_ref<Subclass&>(*this);
       edge = real_me.Subclass::build_edge_ptr(i);
     }
   else
     {
       edge->set_mapping_type(this->mapping_type());
       edge->subdomain_id() = this->subdomain_id();
 #ifdef LIBMESH_ENABLE_AMR
       edge->set_p_level(this->p_level());
 #endif
       for (auto n : edge->node_index_range())
         edge->set_node(n) = this->node_ptr(Subclass::edge_nodes_map[i][n]);
     }
 }

◆ simple_build_side_ptr() [1/2]

template<typename Sideclass , typename Subclass >

std::unique_ptr< Elem > libMesh::Elem::simple_build_side_ptr	(	const unsigned int	i,
		bool	proxy
	)

inlineprotectedinherited

An implementation for simple (all sides equal) elements.

Definition at line 2687 of file elem.h.

References libMesh::Elem::mapping_type(), libMesh::Elem::n_sides(), libMesh::Elem::node_ptr(), libMesh::Elem::p_level(), and libMesh::Elem::subdomain_id().

 {
   libmesh_assert_less (i, this->n_sides());
 
   std::unique_ptr<Elem> face;
   if (proxy)
     {
 #ifdef LIBMESH_ENABLE_DEPRECATED
       face = std::make_unique<Side<Sideclass,Subclass>>(this,i);
       libmesh_deprecated();
 #else
       libmesh_error();
 #endif
     }
   else
     {
       face = std::make_unique<Sideclass>(this);
       for (auto n : face->node_index_range())
         face->set_node(n) = this->node_ptr(Subclass::side_nodes_map[i][n]);
     }
 
 #ifdef LIBMESH_ENABLE_DEPRECATED
   if (!proxy) // proxy sides used to leave parent() set
 #endif
     face->set_parent(nullptr);
   face->set_interior_parent(this);
 
   face->set_mapping_type(this->mapping_type());
   face->subdomain_id() = this->subdomain_id();
 #ifdef LIBMESH_ENABLE_AMR
   face->set_p_level(this->p_level());
 #endif
 
   return face;
 }

◆ simple_build_side_ptr() [2/2]

template<typename Subclass >

void libMesh::Elem::simple_build_side_ptr	(	std::unique_ptr< Elem > &	side,
		const unsigned int	i,
		ElemType	sidetype
	)

inlineprotectedinherited

An implementation for simple (all sides equal) elements.

Definition at line 2729 of file elem.h.

References libMesh::Elem::mapping_type(), libMesh::Elem::n_sides(), libMesh::Elem::node_ptr(), libMesh::Elem::p_level(), and libMesh::Elem::subdomain_id().

 {
   libmesh_assert_less (i, this->n_sides());
 
   if (!side.get() || side->type() != sidetype)
     {
       Subclass & real_me = cast_ref<Subclass&>(*this);
       side = real_me.Subclass::build_side_ptr(i, false);
     }
   else
     {
       side->subdomain_id() = this->subdomain_id();
       side->set_mapping_type(this->mapping_type());
 #ifdef LIBMESH_ENABLE_AMR
       side->set_p_level(this->p_level());
 #endif
       for (auto n : side->node_index_range())
         side->set_node(n) = this->node_ptr(Subclass::side_nodes_map[i][n]);
     }
 }

◆ simple_side_ptr()

template<typename Subclass , typename Mapclass >

void libMesh::Elem::simple_side_ptr	(	std::unique_ptr< Elem > &	side,
		const unsigned int	i,
		ElemType	sidetype
	)

inlineprotectedinherited

An implementation for simple (all sides equal) elements.

Definition at line 2757 of file elem.h.

References libMesh::Elem::n_sides(), libMesh::Elem::node_ptr(), and libMesh::Elem::subdomain_id().

 {
   libmesh_assert_less (i, this->n_sides());
 
   if (!side.get() || side->type() != sidetype)
     {
       Subclass & real_me = cast_ref<Subclass&>(*this);
       side = real_me.Subclass::side_ptr(i);
     }
   else
     {
       side->subdomain_id() = this->subdomain_id();
 
       for (auto n : side->node_index_range())
         side->set_node(n) = this->node_ptr(Mapclass::side_nodes_map[i][n]);
     }
 }

◆ subactive()

bool libMesh::Elem::subactive ( ) const

inlineinherited

Returns: true if the element is subactive (i.e. has no active descendants), false otherwise or if AMR is disabled.

Definition at line 2909 of file elem.h.

References libMesh::Elem::active(), libMesh::Elem::has_children(), and libMesh::Elem::parent().

Referenced by libMesh::HPCoarsenTest::add_projection(), libMesh::Elem::ancestor(), libMesh::FEAbstract::compute_node_constraints(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::get_info(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_constraints(), libMesh::InfFE< Dim, T_radial, T_map >::inf_compute_node_constraints(), libMesh::Elem::libmesh_assert_valid_neighbors(), libMesh::Elem::make_links_to_me_local(), libMesh::Elem::make_links_to_me_remote(), libMesh::Elem::max_descendant_p_level(), libMesh::Elem::min_new_p_level_by_neighbor(), libMesh::Elem::min_p_level_by_neighbor(), libMesh::Elem::refine(), libMesh::Elem::remove_links_to_me(), and libMesh::UnstructuredMesh::stitching_helper().

 {
 #ifdef LIBMESH_ENABLE_AMR
   if (this->active())
     return false;
   if (!this->has_children())
     return true;
   for (const Elem * my_ancestor = this->parent();
        my_ancestor != nullptr;
        my_ancestor = my_ancestor->parent())
     if (my_ancestor->active())
       return true;
 #endif
 
   return false;
 }

◆ subdomain_id() [1/2]

subdomain_id_type libMesh::Elem::subdomain_id ( ) const

inlineinherited

Returns: The subdomain that this element belongs to.

Definition at line 2504 of file elem.h.

References libMesh::Elem::_sbd_id.

 {
   return _sbd_id;
 }

◆ subdomain_id() [2/2]

subdomain_id_type & libMesh::Elem::subdomain_id ( )

inlineinherited

Returns: The subdomain that this element belongs to as a writable reference.

Definition at line 2512 of file elem.h.

References libMesh::Elem::_sbd_id.

 {
   return _sbd_id;
 }

◆ supported_nodal_order()

virtual Order libMesh::Elem::supported_nodal_order ( ) const

inlinevirtualinherited

Returns: The maximum supported approximation order for nodal (Lagrange or Rational Bezier-Bernstein) variables on this element type. This is usually the same as the default order.

Reimplemented in libMesh::NodeElem.

Definition at line 965 of file elem.h.

References libMesh::Elem::default_order().

Referenced by libMesh::MeshBase::copy_constraint_rows().

965 { return default_order(); }

libMesh::Elem::default_order

virtual Order default_order() const =0

◆ swap2boundaryedges()

void libMesh::Elem::swap2boundaryedges	(	unsigned short	e1,
		unsigned short	e2,
		BoundaryInfo *	boundary_info
	)		const

protectedinherited

Swaps two edges in boundary_info, if it is non-null.

Definition at line 3421 of file elem.C.

References libMesh::BoundaryInfo::add_edge(), libMesh::BoundaryInfo::edge_boundary_ids(), and libMesh::BoundaryInfo::remove_edge().

Referenced by libMesh::InfQuad4::flip(), libMesh::InfPrism6::flip(), libMesh::InfHex8::flip(), libMesh::Quad4::flip(), libMesh::InfQuad6::flip(), libMesh::C0Polygon::flip(), libMesh::Pyramid5::flip(), libMesh::Tri3::flip(), libMesh::Prism6::flip(), libMesh::InfPrism12::flip(), libMesh::Quad8::flip(), libMesh::Hex8::flip(), libMesh::Quad9::flip(), libMesh::InfHex16::flip(), libMesh::Tri7::flip(), libMesh::Tri6::flip(), libMesh::Pyramid13::flip(), libMesh::InfHex18::flip(), flip(), libMesh::Tet14::flip(), libMesh::Tet10::flip(), libMesh::Prism15::flip(), libMesh::Tet4::flip(), libMesh::Pyramid14::flip(), libMesh::Pyramid18::flip(), libMesh::Hex27::flip(), libMesh::Prism18::flip(), libMesh::Prism20::flip(), and libMesh::Prism21::flip().

 {
   std::vector<boundary_id_type> ids1, ids2;
   boundary_info->edge_boundary_ids(this, e1, ids1);
   boundary_info->edge_boundary_ids(this, e2, ids2);
   boundary_info->remove_edge(this, e1);
   boundary_info->remove_edge(this, e2);
   if (!ids1.empty())
     boundary_info->add_edge(this, e2, ids1);
   if (!ids2.empty())
     boundary_info->add_edge(this, e1, ids2);
 }

◆ swap2boundarysides()

void libMesh::Elem::swap2boundarysides	(	unsigned short	s1,
		unsigned short	s2,
		BoundaryInfo *	boundary_info
	)		const

protectedinherited

Swaps two sides in boundary_info, if it is non-null.

Definition at line 3405 of file elem.C.

References libMesh::BoundaryInfo::add_side(), libMesh::BoundaryInfo::boundary_ids(), and libMesh::BoundaryInfo::remove_side().

Referenced by libMesh::InfQuad4::flip(), libMesh::InfPrism6::flip(), libMesh::InfHex8::flip(), libMesh::Edge2::flip(), libMesh::Quad4::flip(), libMesh::InfQuad6::flip(), libMesh::C0Polygon::flip(), libMesh::Pyramid5::flip(), libMesh::Edge4::flip(), libMesh::Tri3::flip(), libMesh::Prism6::flip(), libMesh::Edge3::flip(), libMesh::InfPrism12::flip(), libMesh::Quad8::flip(), libMesh::Hex8::flip(), libMesh::Quad9::flip(), libMesh::InfHex16::flip(), libMesh::Tri7::flip(), libMesh::Tri6::flip(), libMesh::Pyramid13::flip(), libMesh::InfHex18::flip(), flip(), libMesh::Tet10::flip(), libMesh::Tet14::flip(), libMesh::Prism15::flip(), libMesh::Tet4::flip(), libMesh::Pyramid14::flip(), libMesh::Pyramid18::flip(), libMesh::Hex27::flip(), libMesh::Prism20::flip(), libMesh::Prism18::flip(), and libMesh::Prism21::flip().

 {
   std::vector<boundary_id_type> ids1, ids2;
   boundary_info->boundary_ids(this, s1, ids1);
   boundary_info->boundary_ids(this, s2, ids2);
   boundary_info->remove_side(this, s1);
   boundary_info->remove_side(this, s2);
   if (!ids1.empty())
     boundary_info->add_side(this, s2, ids1);
   if (!ids2.empty())
     boundary_info->add_side(this, s1, ids2);
 }

◆ swap2neighbors()

void libMesh::Elem::swap2neighbors	(	unsigned int	n1,
		unsigned int	n2
	)

inlineprotectedinherited

Swaps two neighbor_ptrs.

Definition at line 2051 of file elem.h.

References libMesh::Elem::neighbor_ptr(), and libMesh::Elem::set_neighbor().

Referenced by libMesh::InfQuad4::flip(), libMesh::InfPrism6::flip(), libMesh::InfHex8::flip(), libMesh::Quad4::flip(), libMesh::Edge2::flip(), libMesh::InfQuad6::flip(), libMesh::C0Polygon::flip(), libMesh::Pyramid5::flip(), libMesh::Edge4::flip(), libMesh::Tri3::flip(), libMesh::Prism6::flip(), libMesh::Edge3::flip(), libMesh::InfPrism12::flip(), libMesh::Quad8::flip(), libMesh::Hex8::flip(), libMesh::Quad9::flip(), libMesh::Tri7::flip(), libMesh::InfHex16::flip(), libMesh::Tri6::flip(), libMesh::Pyramid13::flip(), libMesh::InfHex18::flip(), flip(), libMesh::Tet14::flip(), libMesh::Tet10::flip(), libMesh::Prism15::flip(), libMesh::Tet4::flip(), libMesh::Pyramid14::flip(), libMesh::Pyramid18::flip(), libMesh::Hex27::flip(), libMesh::Prism18::flip(), libMesh::Prism20::flip(), libMesh::Prism21::flip(), libMesh::Prism6::permute(), libMesh::Hex8::permute(), permute(), libMesh::Prism15::permute(), libMesh::Hex27::permute(), libMesh::Prism20::permute(), libMesh::Prism18::permute(), libMesh::Prism21::permute(), libMesh::Elem::swap3neighbors(), and libMesh::Elem::swap4neighbors().

   {
     Elem * temp = this->neighbor_ptr(n1);
     this->set_neighbor(n1, this->neighbor_ptr(n2));
     this->set_neighbor(n2, temp);
   }

◆ swap2nodes()

void libMesh::Elem::swap2nodes	(	unsigned int	n1,
		unsigned int	n2
	)

inlineprotectedinherited

Swaps two node_ptrs.

Definition at line 2041 of file elem.h.

References libMesh::Elem::node_ptr(), and libMesh::Elem::set_node().

Referenced by libMesh::InfQuad4::flip(), libMesh::InfPrism6::flip(), libMesh::InfHex8::flip(), libMesh::Quad4::flip(), libMesh::Edge2::flip(), libMesh::InfQuad6::flip(), libMesh::C0Polygon::flip(), libMesh::Pyramid5::flip(), libMesh::Edge4::flip(), libMesh::Tri3::flip(), libMesh::Prism6::flip(), libMesh::Edge3::flip(), libMesh::InfPrism12::flip(), libMesh::Quad8::flip(), libMesh::Hex8::flip(), libMesh::Quad9::flip(), libMesh::Tri7::flip(), libMesh::InfHex16::flip(), libMesh::Tri6::flip(), libMesh::Pyramid13::flip(), libMesh::InfHex18::flip(), flip(), libMesh::Tet14::flip(), libMesh::Tet10::flip(), libMesh::Prism15::flip(), libMesh::Tet4::flip(), libMesh::Pyramid14::flip(), libMesh::Pyramid18::flip(), libMesh::Hex27::flip(), libMesh::Prism18::flip(), libMesh::Prism20::flip(), libMesh::Prism21::flip(), libMesh::Prism6::permute(), libMesh::Hex8::permute(), permute(), libMesh::Prism15::permute(), libMesh::Hex27::permute(), libMesh::Prism20::permute(), libMesh::Prism18::permute(), libMesh::Prism21::permute(), libMesh::Elem::swap3nodes(), and libMesh::Elem::swap4nodes().

   {
     Node * temp = this->node_ptr(n1);
     this->set_node(n1) = this->node_ptr(n2);
     this->set_node(n2) = temp;
   }

◆ swap3neighbors()

void libMesh::Elem::swap3neighbors	(	unsigned int	n1,
		unsigned int	n2,
		unsigned int	n3
	)

inlineprotectedinherited

Swaps three neighbor_ptrs, "rotating" them.

Definition at line 2082 of file elem.h.

References libMesh::Elem::swap2neighbors().

Referenced by libMesh::InfPrism6::permute(), libMesh::Tri3::permute(), libMesh::Prism6::permute(), libMesh::InfPrism12::permute(), libMesh::Tri7::permute(), libMesh::Tri6::permute(), libMesh::Tet14::permute(), libMesh::Tet10::permute(), libMesh::Prism15::permute(), libMesh::Tet4::permute(), libMesh::Prism20::permute(), libMesh::Prism18::permute(), libMesh::Prism21::permute(), and libMesh::Elem::swap4neighbors().

   {
     swap2neighbors(n1, n2);
     swap2neighbors(n2, n3);
   }

◆ swap3nodes()

void libMesh::Elem::swap3nodes	(	unsigned int	n1,
		unsigned int	n2,
		unsigned int	n3
	)

inlineprotectedinherited

Swaps three node_ptrs, "rotating" them.

Definition at line 2073 of file elem.h.

References libMesh::Elem::swap2nodes().

Referenced by libMesh::InfPrism6::permute(), libMesh::Tri3::permute(), libMesh::Prism6::permute(), libMesh::InfPrism12::permute(), libMesh::Tri7::permute(), libMesh::Tri6::permute(), libMesh::Tet14::permute(), libMesh::Tet10::permute(), libMesh::Prism15::permute(), libMesh::Tet4::permute(), libMesh::Prism20::permute(), libMesh::Prism18::permute(), libMesh::Prism21::permute(), and libMesh::Elem::swap4nodes().

   {
     swap2nodes(n1, n2);
     swap2nodes(n2, n3);
   }

◆ swap4neighbors()

void libMesh::Elem::swap4neighbors	(	unsigned int	n1,
		unsigned int	n2,
		unsigned int	n3,
		unsigned int	n4
	)

inlineprotectedinherited

Swaps four neighbor_ptrs, "rotating" them.

Definition at line 2102 of file elem.h.

References libMesh::Elem::swap2neighbors(), and libMesh::Elem::swap3neighbors().

Referenced by libMesh::InfHex8::permute(), libMesh::Quad4::permute(), libMesh::Pyramid5::permute(), libMesh::Hex8::permute(), libMesh::Quad8::permute(), libMesh::Quad9::permute(), libMesh::InfHex16::permute(), libMesh::Pyramid13::permute(), libMesh::InfHex18::permute(), permute(), libMesh::Pyramid14::permute(), libMesh::Pyramid18::permute(), and libMesh::Hex27::permute().

   {
     swap3neighbors(n1, n2, n3);
     swap2neighbors(n3, n4);
   }

◆ swap4nodes()

void libMesh::Elem::swap4nodes	(	unsigned int	n1,
		unsigned int	n2,
		unsigned int	n3,
		unsigned int	n4
	)

inlineprotectedinherited

Swaps four node_ptrs, "rotating" them.

Definition at line 2092 of file elem.h.

References libMesh::Elem::swap2nodes(), and libMesh::Elem::swap3nodes().

Referenced by libMesh::InfHex8::permute(), libMesh::Quad4::permute(), libMesh::Pyramid5::permute(), libMesh::Hex8::permute(), libMesh::Quad8::permute(), libMesh::Quad9::permute(), libMesh::InfHex16::permute(), libMesh::Pyramid13::permute(), libMesh::InfHex18::permute(), permute(), libMesh::Pyramid14::permute(), libMesh::Pyramid18::permute(), and libMesh::Hex27::permute().

   {
     swap3nodes(n1, n2, n3);
     swap2nodes(n3, n4);
   }

◆ top_parent()

const Elem * libMesh::Elem::top_parent ( ) const

inlineinherited

Returns: A pointer to the element's top-most (i.e. level-0) parent.

That is, this if this is a level-0 element, this element's parent if this is a level-1 element, this element's grandparent if this is a level-2 element, etc...

Definition at line 3006 of file elem.h.

References libMesh::Elem::level(), libMesh::libmesh_assert(), and libMesh::Elem::parent().

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::BoundaryInfo::add_elements(), libMesh::BoundaryInfo::boundary_ids(), libMesh::BoundaryInfo::edge_boundary_ids(), libMesh::MeshTools::libmesh_assert_valid_amr_interior_parents(), libMesh::ExodusII_IO::read_elemental_variable(), libMesh::BoundaryInfo::side_with_boundary_id(), libMesh::BoundaryInfo::sides_with_boundary_id(), and ExtraIntegersTest::test_final_integers().

 {
   const Elem * tp = this;
 
   // Keep getting the element's parent
   // until that parent is at level-0
   while (tp->parent() != nullptr)
     tp = tp->parent();
 
   libmesh_assert(tp);
   libmesh_assert_equal_to (tp->level(), 0);
 
   return tp;
 }

◆ topological_neighbor() [1/2]

const Elem * libMesh::Elem::topological_neighbor	(	const unsigned int	i,
		const MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb
	)		const

inherited

Returns: A pointer to the $i^{th}$ neighbor of this element for interior elements. If an element is on a periodic boundary, it will return a corresponding element on the opposite side.

Definition at line 1184 of file elem.C.

References libMesh::PeriodicBoundaries::boundary(), libMesh::Elem::level(), mesh, libMesh::Elem::n_neighbors(), libMesh::PeriodicBoundaries::neighbor(), libMesh::Elem::neighbor_ptr(), and libMesh::Elem::parent().

Referenced by libMesh::Elem::has_topological_neighbor(), libMesh::GhostPointNeighbors::operator()(), libMesh::DefaultCoupling::operator()(), and libMesh::MeshRefinement::topological_neighbor().

 {
   libmesh_assert_less (i, this->n_neighbors());
 
   const Elem * neighbor_i = this->neighbor_ptr(i);
   if (neighbor_i != nullptr)
     return neighbor_i;
 
   if (pb)
     {
       // Since the neighbor is nullptr it must be on a boundary. We need
       // see if this is a periodic boundary in which case it will have a
       // topological neighbor
       std::vector<boundary_id_type> bc_ids;
       mesh.get_boundary_info().boundary_ids(this, cast_int<unsigned short>(i), bc_ids);
       for (const auto & id : bc_ids)
         if (pb->boundary(id))
           {
             neighbor_i = pb->neighbor(id, point_locator, this, i);
 
             // Since coarse elements do not have more refined
             // neighbors we need to make sure that we don't return one
             // of these types of neighbors.
             if (neighbor_i)
               while (level() < neighbor_i->level())
                 neighbor_i = neighbor_i->parent();
             return neighbor_i;
           }
     }
 
   return nullptr;
 }

◆ topological_neighbor() [2/2]

Elem * libMesh::Elem::topological_neighbor	(	const unsigned int	i,
		MeshBase &	mesh,
		const PointLocatorBase &	point_locator,
		const PeriodicBoundaries *	pb
	)

inherited

Returns: A writable pointer to the $i^{th}$ neighbor of this element for interior elements. If an element is on a periodic boundary, it will return a corresponding element on the opposite side.

Definition at line 1142 of file elem.C.

References libMesh::PeriodicBoundaries::boundary(), libMesh::Elem::level(), mesh, libMesh::Elem::n_neighbors(), libMesh::PeriodicBoundaries::neighbor(), libMesh::Elem::neighbor_ptr(), and libMesh::Elem::parent().

 {
   libmesh_assert_less (i, this->n_neighbors());
 
   Elem * neighbor_i = this->neighbor_ptr(i);
   if (neighbor_i != nullptr)
     return neighbor_i;
 
   if (pb)
     {
       // Since the neighbor is nullptr it must be on a boundary. We need
       // see if this is a periodic boundary in which case it will have a
       // topological neighbor
       std::vector<boundary_id_type> bc_ids;
       mesh.get_boundary_info().boundary_ids(this, cast_int<unsigned short>(i), bc_ids);
       for (const auto & id : bc_ids)
         if (pb->boundary(id))
           {
             // Since the point locator inside of periodic boundaries
             // returns a const pointer we will retrieve the proper
             // pointer directly from the mesh object.
             const Elem * const cn = pb->neighbor(id, point_locator, this, i);
             neighbor_i = const_cast<Elem *>(cn);
 
             // Since coarse elements do not have more refined
             // neighbors we need to make sure that we don't return one
             // of these types of neighbors.
             if (neighbor_i)
               while (level() < neighbor_i->level())
                 neighbor_i = neighbor_i->parent();
             return neighbor_i;
           }
     }
 
   return nullptr;
 }

◆ topologically_equal()

bool libMesh::Elem::topologically_equal ( const Elem & rhs ) const

inherited

Returns: true if two elements have equal topologies, false otherwise. This is true if the elements connect to nodes of the same id in the same order, and neighbors of the same id on each side, the same id on any parent and/or interior_parent link, etc.

Definition at line 674 of file elem.C.

References libMesh::DofObject::id(), libMesh::Elem::interior_parent(), libMesh::make_range(), libMesh::Elem::n_neighbors(), libMesh::Elem::n_nodes(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::node_id(), libMesh::Elem::parent(), and libMesh::Elem::type().

 {
   // If the elements aren't the same type, they aren't equal
   if (this->type() != rhs.type())
     return false;
 
   libmesh_assert_equal_to(this->n_nodes(), rhs.n_nodes());
 
   for (auto n : make_range(this->n_nodes()))
     if (this->node_id(n) != rhs.node_id(n))
       return false;
 
   for (auto neigh : make_range(this->n_neighbors()))
     {
       if (!this->neighbor_ptr(neigh))
         {
           if (rhs.neighbor_ptr(neigh))
             return false;
           continue;
         }
       if (!rhs.neighbor_ptr(neigh) ||
           this->neighbor_ptr(neigh)->id() !=
           rhs.neighbor_ptr(neigh)->id())
         return false;
     }
 
   if (this->parent())
     {
       if (!rhs.parent())
         return false;
       if (this->parent()->id() != rhs.parent()->id())
         return false;
     }
   else if (rhs.parent())
     return false;
 
   if (this->interior_parent())
     {
       if (!rhs.interior_parent())
         return false;
       if (this->interior_parent()->id() !=
           rhs.interior_parent()->id())
         return false;
     }
   else if (rhs.interior_parent())
     return false;
 
   return true;
 }

◆ total_family_tree() [1/2]

void libMesh::Elem::total_family_tree	(	std::vector< const Elem *> &	family,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree() member, but also adds any subactive descendants.

Definition at line 1988 of file elem.C.

References libMesh::ElemInternal::total_family_tree().

Referenced by libMesh::Partitioner::set_parent_processor_ids().

 {
   ElemInternal::total_family_tree(this, family, reset);
 }

◆ total_family_tree() [2/2]

void libMesh::Elem::total_family_tree	(	std::vector< Elem *> &	family,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 1996 of file elem.C.

References libMesh::ElemInternal::total_family_tree().

 {
   ElemInternal::total_family_tree(this, family, reset);
 }

◆ total_family_tree_by_neighbor() [1/2]

void libMesh::Elem::total_family_tree_by_neighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree_by_neighbor() member, but also adds any subactive descendants.

Definition at line 2074 of file elem.C.

References libMesh::ElemInternal::total_family_tree_by_neighbor().

 {
   ElemInternal::total_family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ total_family_tree_by_neighbor() [2/2]

void libMesh::Elem::total_family_tree_by_neighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2083 of file elem.C.

References libMesh::ElemInternal::total_family_tree_by_neighbor().

 {
   ElemInternal::total_family_tree_by_neighbor(this, family, neighbor, reset);
 }

◆ total_family_tree_by_subneighbor() [1/2]

void libMesh::Elem::total_family_tree_by_subneighbor	(	std::vector< const Elem *> &	family,
		const Elem *	neighbor,
		const Elem *	subneighbor,
		bool	reset = `true`
	)		const

inherited

Same as the family_tree_by_subneighbor() member, but also adds any subactive descendants.

Definition at line 2112 of file elem.C.

References libMesh::ElemInternal::total_family_tree_by_subneighbor().

 {
   ElemInternal::total_family_tree_by_subneighbor(this, family, neighbor, subneighbor, reset);
 }

◆ total_family_tree_by_subneighbor() [2/2]

void libMesh::Elem::total_family_tree_by_subneighbor	(	std::vector< Elem *> &	family,
		Elem *	neighbor,
		Elem *	subneighbor,
		bool	reset = `true`
	)

inherited

Non-const version of function above; fills a vector of non-const pointers.

Definition at line 2122 of file elem.C.

References libMesh::ElemInternal::total_family_tree_by_subneighbor().

 {
   ElemInternal::total_family_tree_by_subneighbor(this, family, neighbor, subneighbor, reset);
 }

◆ true_centroid()

Point libMesh::Elem::true_centroid ( ) const

virtualinherited

Returns: The "true" geometric centroid of the element, c=(cx, cy, cz), where:

[cx] [ x dV] [cy] := (1/V) * [ y dV] [cz] [ z dV]

This method is virtual since some derived elements might want to use shortcuts to compute their centroid. For most element types, this method is more expensive than calling vertex_average(), so if you only need a point which is located "somewhere" in the interior of the element, consider calling vertex_average() instead.

Reimplemented in libMesh::Tet4, libMesh::Hex8, libMesh::Prism6, libMesh::C0Polygon, libMesh::Pyramid5, libMesh::Tri3, libMesh::Quad4, and libMesh::Edge2.

Definition at line 465 of file elem.C.

References libMesh::Elem::_nodes, libMesh::FEGenericBase< OutputType >::build(), libMesh::Elem::default_order(), libMesh::FEType::default_quadrature_order(), libMesh::Elem::dim(), libMesh::Elem::disconnected_clone(), libMesh::index_range(), libMesh::make_range(), libMesh::FEMap::map_fe_type(), libMesh::Elem::n_nodes(), libMesh::Elem::node_index_range(), libMesh::Elem::p_level(), libMesh::Elem::point(), libMesh::Real, and libMesh::QBase::size().

Referenced by VolumeTest::testHex20PLevelTrueCentroid(), VolumeTest::testPyramid5TrueCentroid(), VolumeTest::testQuad4TrueCentroid(), VolumeTest::testTri3TrueCentroid(), and libMesh::C0Polygon::true_centroid().

 {
   // The base class implementation builds a finite element of the correct
   // order and computes the centroid, c=(cx, cy, cz), where:
   //
   // [cx]            [\int x dV]
   // [cy] := (1/V) * [\int y dV]
   // [cz]            [\int z dV]
   //
   // using quadrature. Note that we can expand "x" in the FE space as:
   //
   // x = \sum_i x_i \phi_i
   //
   // where x_i are the nodal positions of the element and \phi_i are the
   // associated Lagrange shape functions. This allows us to write the
   // integrals above as e.g.:
   //
   // \int x dV = \sum_i x_i \int \phi_i dV
   //
   // Defining:
   //
   // V_i := \int \phi_i dV
   //
   // we then have:
   //
   // [cx]           [\sum_i x_i V_i]
   // [cy] = (1/V) * [\sum_i y_i V_i]
   // [cz]           [\sum_i z_i V_i]
   //
   // where:
   // V = \sum_i V_i
   //
   // Derived element types can overload this method to compute
   // the centroid more efficiently when possible.
 
   // If this Elem has an elevated p_level, then we need to generate a
   // barebones copy of it with zero p_level and call true_centroid()
   // on that instead.  This workaround allows us to avoid issues with
   // calling FE::reinit() with a default_order() FEType, and then
   // having that order incorrectly boosted by p_level.
   if (this->p_level())
     {
       auto elem_copy = this->disconnected_clone();
 #ifdef LIBMESH_ENABLE_AMR
       elem_copy->set_p_level(0);
 #endif
 
       // Set node pointers
       for (auto n : this->node_index_range())
         elem_copy->set_node(n) = _nodes[n];
 
       return elem_copy->true_centroid();
     }
 
   const FEFamily mapping_family = FEMap::map_fe_type(*this);
   const FEType fe_type(this->default_order(), mapping_family);
 
   // Build FE and attach quadrature rule.  The default quadrature rule
   // integrates the mass matrix exactly, thus it is overkill to
   // integrate the basis functions, but this is convenient.
   std::unique_ptr<FEBase> fe = FEBase::build(this->dim(), fe_type);
   QGauss qrule (this->dim(), fe_type.default_quadrature_order());
   fe->attach_quadrature_rule(&qrule);
 
   // Pre-request required data
   const auto & JxW = fe->get_JxW();
   const auto & phi = fe->get_phi();
 
   // Re-compute element-specific values
   fe->reinit(this);
 
   // Number of basis functions
   auto N = phi.size();
   libmesh_assert_equal_to(N, this->n_nodes());
 
   // Compute V_i
   std::vector<Real> V(N);
   for (auto qp : index_range(JxW))
     for (auto i : make_range(N))
       V[i] += JxW[qp] * phi[i][qp];
 
   // Compute centroid
   Point cp;
   Real vol = 0.;
 
   for (auto i : make_range(N))
     {
       cp += this->point(i) * V[i];
       vol += V[i];
     }
 
   return cp / vol;
 }

◆ type()

virtual ElemType libMesh::Hex20::type ( ) const

inlineoverridevirtual

Returns: HEX20.

Implements libMesh::Elem.

Definition at line 91 of file cell_hex20.h.

References libMesh::HEX20.

91 { return HEX20; }

libMesh::HEX20

Definition: enum_elem_type.h:48

◆ unique_id()

unique_id_type libMesh::DofObject::unique_id ( ) const

inlineinherited

Returns: The globally unique_id for this DofObject

Definition at line 844 of file dof_object.h.

References libMesh::DofObject::_unique_id, libMesh::DofObject::invalid_unique_id, libMesh::libmesh_assert(), and libMesh::DofObject::valid_unique_id().

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::MeshTools::Modification::all_tri(), libMesh::Elem::disconnected_clone(), libMesh::MeshTools::Modification::flatten(), libMesh::Elem::get_info(), libMesh::ReplicatedMesh::insert_elem(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_node(), libMesh::XdrIO::pack_element(), libMesh::ExodusII_IO::read_elemental_variable(), SlitMeshRefinedSystemTest::testRestart(), and libMesh::XdrIO::write_serialized_nodes().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   libmesh_assert (this->valid_unique_id());
   return _unique_id;
 #else
   return invalid_unique_id;
 #endif
 }

◆ unpack_indexing()

void libMesh::DofObject::unpack_indexing ( std::vector< largest_id_type >::const_iterator begin )

inherited

A method for creating our index buffer from packed data - basically with our current implementation we investigate the size term and then copy.

Definition at line 595 of file dof_object.C.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::clear_old_dof_object(), libMesh::DofObject::construct(), libMesh::libmesh_assert(), and libMesh::DofObject::old_dof_object.

 {
   _idx_buf.clear();
 
 #ifdef LIBMESH_ENABLE_AMR
   this->clear_old_dof_object();
   const bool has_old_dof_object = cast_int<bool>(*begin++);
 #endif
 
   const largest_id_type size = *begin++;
   _idx_buf.reserve(size);
   std::copy(begin, begin+size, back_inserter(_idx_buf));
 
   // Check as best we can for internal consistency now
   libmesh_assert(_idx_buf.empty() ||
                  (std::abs(dof_id_signed_type(_idx_buf[0])) <=
                   cast_int<dof_id_signed_type>(_idx_buf.size())));
 #ifdef DEBUG
   if (!_idx_buf.empty())
     {
       const int hdr = cast_int<int>(dof_id_signed_type(_idx_buf[0]));
       const unsigned int ns = hdr >= 0 ? hdr : (-hdr-1);
       for (unsigned int i=1; i < ns; ++i)
         {
           if (hdr > 0 || i > 1)
             libmesh_assert_greater_equal (_idx_buf[i], _idx_buf[i-1]);
           else
             libmesh_assert_greater_equal (_idx_buf[i], ns);
           libmesh_assert_equal_to ((_idx_buf[i] - _idx_buf[i-1])%2, 0);
           libmesh_assert_less_equal (_idx_buf[i], _idx_buf.size());
         }
       if (hdr < 0 && ns > 0)
         libmesh_assert_less_equal(_idx_buf[ns], _idx_buf.size());
     }
 #endif
 
 #ifdef LIBMESH_ENABLE_AMR
   if (has_old_dof_object)
     {
       this->old_dof_object = this->construct();
       this->old_dof_object->unpack_indexing(begin+size);
     }
 #endif
 }

◆ unpackable_indexing_size()

unsigned int libMesh::DofObject::unpackable_indexing_size ( std::vector< largest_id_type >::const_iterator begin )

staticinherited

If we have indices packed into an buffer for communications, how much of that buffer applies to this dof object?

Definition at line 575 of file dof_object.C.

 {
 #ifdef LIBMESH_ENABLE_AMR
   const bool has_old_dof_object = cast_int<bool>(*begin++);
 
   static const int dof_header_size = 2;
 #else
   static const bool has_old_dof_object = false;
   static const int dof_header_size = 1;
 #endif
 
   const largest_id_type this_indexing_size = *begin++;
 
   return cast_int<unsigned int>
     (dof_header_size + this_indexing_size +
      (has_old_dof_object ?
       unpackable_indexing_size(begin+this_indexing_size) : 0));
 }

◆ valid_id()

bool libMesh::DofObject::valid_id ( ) const

inlineinherited

Returns: true if this DofObject has a valid id set, false otherwise.

Definition at line 885 of file dof_object.h.

References libMesh::DofObject::_id, and libMesh::DofObject::invalid_id.

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::Node::get_info(), libMesh::Elem::get_info(), libMesh::ReplicatedMesh::insert_node(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::Elem::libmesh_assert_valid_node_pointers(), DofObjectTest< Node >::testInvalidateId(), and DofObjectTest< Node >::testValidId().

 {
   return (DofObject::invalid_id != _id);
 }

◆ valid_processor_id()

bool libMesh::DofObject::valid_processor_id ( ) const

inlineinherited

Returns: true if this DofObject has a valid id set, false otherwise.

Definition at line 929 of file dof_object.h.

References libMesh::DofObject::_processor_id, and libMesh::DofObject::invalid_processor_id.

Referenced by DofObjectTest< Node >::testInvalidateProcId(), and DofObjectTest< Node >::testValidProcId().

 {
   return (DofObject::invalid_processor_id != _processor_id);
 }

◆ valid_unique_id()

bool libMesh::DofObject::valid_unique_id ( ) const

inlineinherited

Returns: true if this DofObject has a valid unique_id set, false otherwise.

Definition at line 893 of file dof_object.h.

References libMesh::DofObject::_unique_id, and libMesh::DofObject::invalid_unique_id.

Referenced by libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_node(), libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::Elem::get_info(), libMesh::ReplicatedMesh::insert_elem(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_node(), and libMesh::DofObject::unique_id().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   return (DofObject::invalid_unique_id != _unique_id);
 #else
   return false;
 #endif
 }

◆ var_to_vg_and_offset()

std::pair< unsigned int, unsigned int > libMesh::DofObject::var_to_vg_and_offset	(	const unsigned int	s,
		const unsigned int	var
	)		const

inlineinherited

Returns: A pair consisting of the variable group number and the offset index from the start of that group for variable var on system s associated with this DofObject

Definition at line 1200 of file dof_object.h.

References libMesh::DofObject::n_var_groups(), and libMesh::DofObject::n_vars().

Referenced by libMesh::DofMap::_dof_indices(), libMesh::DofMap::_node_dof_indices(), libMesh::DofObject::dof_number(), libMesh::OldSolutionCoefs< Output, point_output >::eval_old_dofs(), and libMesh::OldSolutionValue< Output, point_output >::eval_old_dofs().

 {
   std::pair<unsigned int, unsigned int> returnval(0,0);
 
   unsigned int & vg = returnval.first;
   unsigned int & offset = returnval.second;
 
   unsigned int vg_start = 0;
   for (; ; vg++)
     {
       libmesh_assert_less(vg, this->n_var_groups(s));
 
       const unsigned int vg_end = vg_start + this->n_vars(s,vg);
       if (var < vg_end)
         {
           offset = var - vg_start;
           return returnval;
         }
       vg_start = vg_end;
     }
 }

◆ vertex_average()

Point libMesh::Elem::vertex_average ( ) const

inherited

Returns: A Point at the average of the elment's vertices.

Note: This used to be the base class centroid() implementation, but the centroid is only equal to the vertex average in some special cases. The centroid() implementation now returns the "true" centroid of the element (up to quadrature error).

Definition at line 559 of file elem.C.

References libMesh::TypeVector< T >::add(), and libMesh::Elem::n_vertices().

Referenced by libMesh::Elem::centroid(), libMesh::RBEIMConstruction::enrich_eim_approximation_on_interiors(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::BoundaryInfo::get_side_and_node_maps(), libMesh::Poly2TriTriangulator::insert_refinement_points(), A0::interior_assembly(), A1::interior_assembly(), OutputAssembly::interior_assembly(), SlitFunc::operator()(), libMesh::LocationMap< T >::point_of(), libMesh::RBParametrizedFunction::preevaluate_parametrized_function_on_mesh(), libMesh::SimplexRefiner::refine_via_edges(), libMesh::C0Polygon::retriangulate(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_deriv(), libMesh::FE< Dim, LAGRANGE_VEC >::shape_second_deriv(), DefaultCouplingTest::testCoupling(), PointNeighborCouplingTest::testCoupling(), libMesh::Tri3::true_centroid(), and libMesh::Tet4::true_centroid().

 {
   Point cp;
 
   const auto n_vertices = this->n_vertices();
 
   for (unsigned int n=0; n<n_vertices; n++)
     cp.add (this->point(n));
 
   return (cp /= static_cast<Real>(n_vertices));
 }

◆ vg_dof_base()

dof_id_type libMesh::DofObject::vg_dof_base	(	const unsigned int	s,
		const unsigned int	vg
	)		const

inlineinherited

VariableGroup DoF indices are indexed as id = base + var_in_vg*ncomp + comp This method allows for direct access to the base.

Definition at line 1317 of file dof_object.h.

References libMesh::DofObject::_idx_buf, libMesh::DofObject::n_systems(), libMesh::DofObject::n_var_groups(), and libMesh::DofObject::start_idx().

Referenced by libMesh::DofMap::distribute_local_dofs_node_major(), libMesh::DofMap::distribute_local_dofs_var_major(), libMesh::DofMap::reinit(), libMesh::DofMap::set_nonlocal_dof_objects(), libMesh::DofObject::set_vg_dof_base(), and DofObjectTest< Node >::testManualDofCalculation().

 {
   libmesh_assert_less (s,  this->n_systems());
   libmesh_assert_less (vg, this->n_var_groups(s));
 
   const unsigned int
     start_idx_sys = this->start_idx(s);
 
   libmesh_assert_less ((start_idx_sys + 2*vg + 1), _idx_buf.size());
 
   // #ifdef DEBUG
   //   std::cout << " [ ";
   //   for (auto i : _idx_buf)
   //     std::cout << i << " ";
   //   std::cout << "]\n";
   // #endif
 
   return _idx_buf[start_idx_sys + 2*vg + 1];
 }

◆ volume()

Real libMesh::Hex20::volume ( ) const

overridevirtual

A specialization for computing the volume of a Hex20.

Reimplemented from libMesh::Elem.

Definition at line 324 of file cell_hex20.C.

References libMesh::LAGRANGE_MAP, libMesh::Elem::mapping_type(), libMesh::Elem::point(), libMesh::Real, libMesh::triple_product(), and libMesh::Elem::volume().

 {
   // This specialization is good for Lagrange mappings only
   if (this->mapping_type() != LAGRANGE_MAP)
     return this->Elem::volume();
 
   // Make copies of our points.  It makes the subsequent calculations a bit
   // shorter and avoids dereferencing the same pointer multiple times.
   Point
     x0 = point(0),   x1 = point(1),   x2 = point(2),   x3 = point(3),   x4 = point(4),
     x5 = point(5),   x6 = point(6),   x7 = point(7),   x8 = point(8),   x9 = point(9),
     x10 = point(10), x11 = point(11), x12 = point(12), x13 = point(13), x14 = point(14),
     x15 = point(15), x16 = point(16), x17 = point(17), x18 = point(18), x19 = point(19);
 
   // The constant components of the dx/dxi vector,
   // dx/dxi = \vec{a000} + \vec{a001}*zeta + \vec{a002}*zeta^2 + ...
   // These were copied directly from the output of a Python script.
   // There are at most 17 terms with total degree <=3, but only 12
   // of them are non-zero for each direction.
   Point dx_dxi[17] =
     {
       x0/8 - x1/8 - x11/4 - x12/4 + x13/4 + x14/4 - x15/4 + x17/4 - x19/4 - x2/8 + x3/8 + x4/8 - x5/8 - x6/8 + x7/8 + x9/4,
       x11/4 + x17/4 - x19/4 - x9/4,
       -x0/8 + x1/8 + x12/4 - x13/4 - x14/4 + x15/4 + x2/8 - x3/8 - x4/8 + x5/8 + x6/8 - x7/8,
       x12/4 - x13/4 + x14/4 - x15/4,
       -x0/8 + x1/8 - x2/8 + x3/8 + x4/8 - x5/8 + x6/8 - x7/8,
       x0/8 - x1/8 - x12/4 + x13/4 - x14/4 + x15/4 + x2/8 - x3/8 + x4/8 - x5/8 + x6/8 - x7/8,
       -x0/8 + x1/8 + x11/4 - x17/4 + x19/4 + x2/8 - x3/8 - x4/8 + x5/8 + x6/8 - x7/8 - x9/4,
       x0/8 - x1/8 - x11/4 - x17/4 + x19/4 - x2/8 + x3/8 - x4/8 + x5/8 + x6/8 - x7/8 + x9/4,
       x0/4 + x1/4 - x10/2 - x16/2 - x18/2 + x2/4 + x3/4 + x4/4 + x5/4 + x6/4 + x7/4 - x8/2,
       -x0/4 - x1/4 + x10/2 - x16/2 - x18/2 - x2/4 - x3/4 + x4/4 + x5/4 + x6/4 + x7/4 + x8/2,
       Point(0,0,0),
       -x0/4 - x1/4 - x10/2 + x16/2 - x18/2 + x2/4 + x3/4 - x4/4 - x5/4 + x6/4 + x7/4 + x8/2,
       x0/4 + x1/4 + x10/2 + x16/2 - x18/2 - x2/4 - x3/4 - x4/4 - x5/4 + x6/4 + x7/4 - x8/2,
       Point(0,0,0),
       Point(0,0,0),
       Point(0,0,0),
       Point(0,0,0)
     };
 
   // The constant components of the dx/deta vector. These were copied
   // directly from the output of a Python script.  There are at most
   // 17 terms with total degree <=3, but only 12 of them are non-zero
   // for each direction.
   Point dx_deta[17] =
     {
       x0/8 + x1/8 + x10/4 - x12/4 - x13/4 + x14/4 + x15/4 - x16/4 + x18/4 - x2/8 - x3/8 + x4/8 + x5/8 - x6/8 - x7/8 - x8/4,
       -x10/4 - x16/4 + x18/4 + x8/4,
       -x0/8 - x1/8 + x12/4 + x13/4 - x14/4 - x15/4 + x2/8 + x3/8 - x4/8 - x5/8 + x6/8 + x7/8,
       x0/4 + x1/4 - x11/2 - x17/2 - x19/2 + x2/4 + x3/4 + x4/4 + x5/4 + x6/4 + x7/4 - x9/2,
       -x0/4 - x1/4 + x11/2 - x17/2 - x19/2 - x2/4 - x3/4 + x4/4 + x5/4 + x6/4 + x7/4 + x9/2,
       Point(0,0,0),
       Point(0,0,0),
       Point(0,0,0),
       x12/4 - x13/4 + x14/4 - x15/4,
       -x0/8 + x1/8 - x2/8 + x3/8 + x4/8 - x5/8 + x6/8 - x7/8,
       x0/8 - x1/8 - x12/4 + x13/4 - x14/4 + x15/4 + x2/8 - x3/8 + x4/8 - x5/8 + x6/8 - x7/8,
       -x0/4 + x1/4 + x11/2 - x17/2 + x19/2 + x2/4 - x3/4 - x4/4 + x5/4 + x6/4 - x7/4 - x9/2,
       x0/4 - x1/4 - x11/2 - x17/2 + x19/2 - x2/4 + x3/4 - x4/4 + x5/4 + x6/4 - x7/4 + x9/2,
       Point(0,0,0),
       -x0/8 - x1/8 - x10/4 + x16/4 - x18/4 + x2/8 + x3/8 - x4/8 - x5/8 + x6/8 + x7/8 + x8/4,
       x0/8 + x1/8 + x10/4 + x16/4 - x18/4 - x2/8 - x3/8 - x4/8 - x5/8 + x6/8 + x7/8 - x8/4,
       Point(0,0,0)
     };
 
   // The constant components of the dx/dzeta vector. These were copied
   // directly from the output of a Python script.  There are at most
   // 17 terms with total degree <=3, but only 12 of them are non-zero
   // for each direction.
   Point dx_dzeta[17] =
     {
       x0/8 + x1/8 - x10/4 - x11/4 + x16/4 + x17/4 + x18/4 + x19/4 + x2/8 + x3/8 - x4/8 - x5/8 - x6/8 - x7/8 - x8/4 - x9/4,
       x0/4 + x1/4 - x12/2 - x13/2 - x14/2 - x15/2 + x2/4 + x3/4 + x4/4 + x5/4 + x6/4 + x7/4,
       Point(0,0,0),
       -x10/4 - x16/4 + x18/4 + x8/4,
       -x0/4 - x1/4 + x12/2 + x13/2 - x14/2 - x15/2 + x2/4 + x3/4 - x4/4 - x5/4 + x6/4 + x7/4,
       Point(0,0,0),
       -x0/8 - x1/8 + x11/4 - x17/4 - x19/4 - x2/8 - x3/8 + x4/8 + x5/8 + x6/8 + x7/8 + x9/4,
       Point(0,0,0),
       x11/4 + x17/4 - x19/4 - x9/4,
       -x0/4 + x1/4 + x12/2 - x13/2 - x14/2 + x15/2 + x2/4 - x3/4 - x4/4 + x5/4 + x6/4 - x7/4,
       Point(0,0,0),
       -x0/8 + x1/8 - x2/8 + x3/8 + x4/8 - x5/8 + x6/8 - x7/8,
       x0/4 - x1/4 - x12/2 + x13/2 - x14/2 + x15/2 + x2/4 - x3/4 + x4/4 - x5/4 + x6/4 - x7/4,
       x0/8 - x1/8 - x11/4 - x17/4 + x19/4 - x2/8 + x3/8 - x4/8 + x5/8 + x6/8 - x7/8 + x9/4,
       -x0/8 - x1/8 + x10/4 - x16/4 - x18/4 - x2/8 - x3/8 + x4/8 + x5/8 + x6/8 + x7/8 + x8/4,
       Point(0,0,0),
       x0/8 + x1/8 + x10/4 + x16/4 - x18/4 - x2/8 - x3/8 - x4/8 - x5/8 + x6/8 + x7/8 - x8/4,
     };
 
   // The integer exponents for each term.
   static const int exponents[17][3] =
     {
       {0, 0, 0},
       {0, 0, 1},
       {0, 0, 2},
       {0, 1, 0},
       {0, 1, 1},
       {0, 1, 2},
       {0, 2, 0},
       {0, 2, 1},
       {1, 0, 0},
       {1, 0, 1},
       {1, 0, 2},
       {1, 1, 0},
       {1, 1, 1},
       {1, 2, 0},
       {2, 0, 0},
       {2, 0, 1},
       {2, 1, 0}
     };
 
 
   // 3x3 quadrature, exact for bi-quintics
   const int N = 3;
   const Real w[N] = {5./9, 8./9, 5./9};
 
   // Quadrature point locations raised to powers.  q[0][2] is
   // quadrature point 0, squared, q[1][1] is quadrature point 1 to the
   // first power, etc.
   const Real q[N][N] =
     {
       //^0   ^1                 ^2
       {  1., -std::sqrt(15)/5., 15./25},
       {  1., 0.,                0.},
       {  1., std::sqrt(15)/5.,  15./25}
     };
 
 
   Real vol = 0.;
   for (int i=0; i<N; ++i)
     for (int j=0; j<N; ++j)
       for (int k=0; k<N; ++k)
         {
           // Compute dx_dxi, dx_deta, dx_dzeta at the current quadrature point.
           Point dx_dxi_q, dx_deta_q, dx_dzeta_q;
           for (int c=0; c<17; ++c)
             {
               Real coeff =
                 q[i][exponents[c][0]] *
                 q[j][exponents[c][1]] *
                 q[k][exponents[c][2]];
 
               dx_dxi_q   += coeff * dx_dxi[c];
               dx_deta_q  += coeff * dx_deta[c];
               dx_dzeta_q += coeff * dx_dzeta[c];
             }
 
           // Compute scalar triple product, multiply by weight, and accumulate volume.
           vol += w[i] * w[j] * w[k] * triple_product(dx_dxi_q, dx_deta_q, dx_dzeta_q);
         }
 
   return vol;
 }

◆ which_child_am_i()

unsigned int libMesh::Elem::which_child_am_i ( const Elem * e ) const

inlineinherited

Returns: The child index which e corresponds to.

I.e. if c = a->which_child_am_i(e); then a->child_ptr(c) will be e.

Definition at line 3142 of file elem.h.

References libMesh::Elem::child_ptr(), libMesh::Elem::has_children(), libMesh::invalid_uint, libMesh::libmesh_assert(), and libMesh::Elem::n_children().

Referenced by libMesh::BoundaryInfo::boundary_ids(), libMesh::BoundaryInfo::edge_boundary_ids(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::Elem::make_links_to_me_remote(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()(), libMesh::BoundaryInfo::side_with_boundary_id(), libMesh::BoundaryInfo::sides_with_boundary_id(), libMesh::MeshTools::Modification::smooth(), and libMesh::Parallel::sync_element_data_by_parent_id().

 {
   libmesh_assert(e);
   libmesh_assert (this->has_children());
 
   unsigned int nc = this->n_children();
   for (unsigned int c=0; c != nc; c++)
     if (this->child_ptr(c) == e)
       return c;
 
   libmesh_error_msg("ERROR:  which_child_am_i() was called with a non-child!");
 
   return libMesh::invalid_uint;
 }

◆ which_neighbor_am_i()

unsigned int libMesh::Elem::which_neighbor_am_i ( const Elem * e ) const

inlineinherited

This function tells you which neighbor e is.

I.e. if s = a->which_neighbor_am_i(e); then a->neighbor(s) will be an ancestor of e.

Definition at line 2869 of file elem.h.

References libMesh::invalid_uint, libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::make_range(), libMesh::Elem::n_sides(), libMesh::Elem::neighbor_ptr(), and libMesh::Elem::parent().

Referenced by assemble_ellipticdg(), libMesh::EquationSystems::build_discontinuous_solution_vector(), libMesh::BoundaryInfo::clear_stitched_boundary_side_ids(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_proj_constraints(), libMesh::MeshTools::find_hanging_nodes_and_parents(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::Elem::libmesh_assert_valid_neighbors(), libMesh::Elem::nullify_neighbors(), and MeshBaseTest::testMeshBaseVerifyIsPrepared().

 {
   libmesh_assert(e);
 
   const Elem * eparent = e;
 
   while (eparent->level() > this->level())
     {
       eparent = eparent->parent();
       libmesh_assert(eparent);
     }
 
   for (auto s : make_range(this->n_sides()))
     if (this->neighbor_ptr(s) == eparent)
       return s;
 
   return libMesh::invalid_uint;
 }

◆ which_node_am_i()

unsigned int libMesh::Elem::which_node_am_i	(	unsigned int	side,
		unsigned int	side_node
	)		const

inherited

This function is deprecated, call local_side_node(side, side_node) instead.

Definition at line 795 of file elem.C.

References libMesh::Elem::local_side_node().

 {
   libmesh_deprecated();
   return local_side_node(side, side_node);
 }

◆ which_side_am_i()

unsigned int libMesh::Elem::which_side_am_i ( const Elem * e ) const

inherited

This function tells you which side the boundary element e is.

I.e. if e = a->build_side_ptr(s) or e = a->side_ptr(s); then a->which_side_am_i(e) will be s.

Note: An exact floating point comparison of the nodal positions of e is made with the nodal positions of this in order to perform this test. The idea is that the test will return a valid side id if e either directly shares Node pointers with this, or was created by exactly copying some of the nodes of this (e.g. through BoundaryMesh::sync()). In these circumstances, non-fuzzy floating point equality is expected.

Returns: The side of this the element which e is, otherwise invalid_uint.

Definition at line 741 of file elem.C.

References libMesh::invalid_uint, libMesh::Elem::is_node_on_side(), libMesh::libmesh_assert(), libMesh::Elem::n_nodes(), libMesh::Elem::n_sides(), and libMesh::Elem::point().

 {
   libmesh_assert(e);
 
   const unsigned int ns = this->n_sides();
   const unsigned int nn = this->n_nodes();
 
   const unsigned int en = e->n_nodes();
 
   // e might be on any side until proven otherwise
   std::vector<bool> might_be_side(ns, true);
 
   for (unsigned int i=0; i != en; ++i)
     {
       Point side_point = e->point(i);
       unsigned int local_node_id = libMesh::invalid_uint;
 
       // Look for a node of this that's contiguous with node i of
       // e. Note that the exact floating point comparison of Point
       // positions is intentional, see the class documentation for
       // this function.
       for (unsigned int j=0; j != nn; ++j)
         if (this->point(j) == side_point)
           local_node_id = j;
 
       // If a node of e isn't contiguous with some node of this, then
       // e isn't a side of this.
       if (local_node_id == libMesh::invalid_uint)
         return libMesh::invalid_uint;
 
       // If a node of e isn't contiguous with some node on side s of
       // this, then e isn't on side s.
       for (unsigned int s=0; s != ns; ++s)
         if (!this->is_node_on_side(local_node_id, s))
           might_be_side[s] = false;
     }
 
   for (unsigned int s=0; s != ns; ++s)
     if (might_be_side[s])
       {
 #ifdef DEBUG
         for (unsigned int s2=s+1; s2 < ns; ++s2)
           libmesh_assert (!might_be_side[s2]);
 #endif
         return s;
       }
 
   // Didn't find any matching side
   return libMesh::invalid_uint;
 }

◆ write_connectivity()

void libMesh::Elem::write_connectivity	(	std::ostream &	out,
		const IOPackage	iop
	)		const

inherited

Writes the element connectivity for various IO packages to the passed ostream "out".

Not virtual, since it is implemented in the base class.

Definition at line 1602 of file elem.C.

References libMesh::Elem::_nodes, libMesh::Elem::connectivity(), libMesh::INVALID_IO_PACKAGE, libMesh::libmesh_assert(), libMesh::make_range(), libMesh::Elem::n_sub_elem(), libMesh::Elem::node_id(), libMesh::Elem::node_index_range(), libMesh::TECPLOT, and libMesh::UCD.

 {
   libmesh_assert (out_stream.good());
   libmesh_assert(_nodes);
   libmesh_assert_not_equal_to (iop, INVALID_IO_PACKAGE);
 
   switch (iop)
     {
     case TECPLOT:
       {
         // This connectivity vector will be used repeatedly instead
         // of being reconstructed inside the loop.
         std::vector<dof_id_type> conn;
         for (auto sc : make_range(this->n_sub_elem()))
           {
             this->connectivity(sc, TECPLOT, conn);
 
             std::copy(conn.begin(),
                       conn.end(),
                       std::ostream_iterator<dof_id_type>(out_stream, " "));
 
             out_stream << '\n';
           }
         return;
       }
 
     case UCD:
       {
         for (auto i : this->node_index_range())
           out_stream << this->node_id(i)+1 << "\t";
 
         out_stream << '\n';
         return;
       }
 
     default:
       libmesh_error_msg("Unsupported IO package " << iop);
     }
 }

Member Data Documentation

◆ _child_node_lookup

const int libMesh::Hex::_child_node_lookup

staticprotectedinherited

Lookup table from child id, child node id to "possible node location" (a simple dictionary-index in a 5x5x5 grid)

Definition at line 236 of file cell_hex.h.

◆ _children

std::unique_ptr<Elem *[]> libMesh::Elem::_children

protectedinherited

unique_ptr to array of this element's children.

A Mesh ultimately owns the child Elems so we are not responsible for deleting them, but we are responsible for cleaning up the array allocated to hold those Elems, hence the unique_ptr.

Definition at line 2211 of file elem.h.

Referenced by libMesh::Elem::add_child(), libMesh::Elem::child_ptr(), libMesh::Elem::child_ref_range(), libMesh::Elem::contract(), libMesh::Elem::has_ancestor_children(), libMesh::Elem::has_children(), libMesh::Elem::raw_child_ptr(), libMesh::Elem::refine(), and libMesh::Elem::set_child().

◆ _counts [1/2]

ReferenceCounter::Counts libMesh::ReferenceCounter::_counts

staticprotectedinherited

Actually holds the data.

Definition at line 124 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::get_info().

◆ _counts [2/2]

ReferenceCounter::Counts libMesh::ReferenceCounter::_counts

staticprotectedinherited

Actually holds the data.

Definition at line 124 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::get_info().

◆ _elemlinks

Elem** libMesh::Elem::_elemlinks

protectedinherited

Pointers to this element's parent and neighbors, and for lower-dimensional elements' interior_parent.

Definition at line 2201 of file elem.h.

Referenced by libMesh::Elem::Elem(), libMesh::Elem::interior_parent(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::neighbor_ptr_range(), libMesh::Elem::parent(), libMesh::Polygon::Polygon(), libMesh::Elem::set_interior_parent(), libMesh::Elem::set_neighbor(), and libMesh::Elem::set_parent().

◆ _elemlinks_data

Elem* libMesh::Hex::_elemlinks_data[7+(LIBMESH_DIM >3)]

protectedinherited

Data for links to parent/neighbor/interior_parent elements.

Definition at line 206 of file cell_hex.h.

◆ _embedding_matrix

const Real libMesh::Hex20::_embedding_matrix

staticprotected

Matrix that computes new nodal locations/solution values from current nodes/solution.

Definition at line 263 of file cell_hex20.h.

Referenced by embedding_matrix().

◆ _enable_print_counter [1/2]

bool libMesh::ReferenceCounter::_enable_print_counter = true

staticprotectedinherited

Flag to control whether reference count information is printed when print_info is called.

Definition at line 143 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::disable_print_counter_info(), libMesh::ReferenceCounter::enable_print_counter_info(), and libMesh::ReferenceCounter::print_info().

◆ _enable_print_counter [2/2]

bool libMesh::ReferenceCounter::_enable_print_counter = true

staticprotectedinherited

Flag to control whether reference count information is printed when print_info is called.

Definition at line 143 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::disable_print_counter_info(), libMesh::ReferenceCounter::enable_print_counter_info(), and libMesh::ReferenceCounter::print_info().

◆ _map_data

unsigned char libMesh::Elem::_map_data

protectedinherited

Mapping function data; currently used when needed to store the RATIONAL_BERNSTEIN nodal weight data index.

Definition at line 2253 of file elem.h.

Referenced by libMesh::Elem::Elem(), libMesh::Elem::mapping_data(), libMesh::Polygon::Polygon(), and libMesh::Elem::set_mapping_data().

◆ _map_type

unsigned char libMesh::Elem::_map_type

protectedinherited

Mapping function type; currently either 0 (LAGRANGE) or 1 (RATIONAL_BERNSTEIN).

Definition at line 2247 of file elem.h.

Referenced by libMesh::Elem::Elem(), libMesh::Elem::mapping_type(), libMesh::Polygon::Polygon(), and libMesh::Elem::set_mapping_type().

◆ _master_points

const Real libMesh::Hex::_master_points

staticprotectedinherited

Initial value:

=
  {
    {-1, -1, -1},
    {1, -1, -1},
    {1, 1, -1},
    {-1, 1, -1},
    {-1, -1, 1},
    {1, -1, 1},
    {1, 1, 1},
    {-1, 1, 1},
    {0, -1, -1},
    {1, 0, -1},
    {0, 1, -1},
    {-1, 0, -1},
    {-1, -1, 0},
    {1, -1, 0},
    {1, 1, 0},
    {-1, 1, 0},
    {0, -1, 1},
    {1, 0, 1},
    {0, 1, 1},
    {-1, 0, 1},
    {0, 0, -1},
    {0, -1, 0},
    {1, 0, 0},
    {0, 1, 0},
    {-1, 0, 0},
    {0, 0, 1}
  }

Master element node locations.

Definition at line 230 of file cell_hex.h.

Referenced by libMesh::Hex::master_point().

◆ _mutex [1/2]

Threads::spin_mutex libMesh::ReferenceCounter::_mutex

staticprotectedinherited

Mutual exclusion object to enable thread-safe reference counting.

Definition at line 137 of file reference_counter.h.

◆ _mutex [2/2]

Threads::spin_mutex libMesh::ReferenceCounter::_mutex

staticprotectedinherited

Mutual exclusion object to enable thread-safe reference counting.

Definition at line 137 of file reference_counter.h.

◆ _n_objects [1/2]

Threads::atomic< unsigned int > libMesh::ReferenceCounter::_n_objects

staticprotectedinherited

The number of objects.

Print the reference count information when the number returns to 0.

Definition at line 132 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::n_objects(), libMesh::ReferenceCounter::ReferenceCounter(), and libMesh::ReferenceCounter::~ReferenceCounter().

◆ _n_objects [2/2]

Threads::atomic< unsigned int > libMesh::ReferenceCounter::_n_objects

staticprotectedinherited

The number of objects.

Print the reference count information when the number returns to 0.

Definition at line 132 of file reference_counter.h.

Referenced by libMesh::ReferenceCounter::n_objects(), libMesh::ReferenceCounter::ReferenceCounter(), and libMesh::ReferenceCounter::~ReferenceCounter().

◆ _nodelinks_data

Node* libMesh::Hex20::_nodelinks_data[num_nodes]

protected

Data for links to nodes.

Definition at line 245 of file cell_hex20.h.

◆ _nodes

Node** libMesh::Elem::_nodes

protectedinherited

Pointers to the nodes we are connected to.

Definition at line 2195 of file elem.h.

◆ _p_level

unsigned char libMesh::Elem::_p_level

protectedinherited

p refinement level - the difference between the polynomial degree on this element and the minimum polynomial degree on the mesh.

This is stored as an unsigned char to save space. In theory, these last four bytes might have been padding anyway.

Definition at line 2240 of file elem.h.

Referenced by libMesh::Elem::hack_p_level(), libMesh::Elem::max_descendant_p_level(), libMesh::Elem::p_level(), and libMesh::Elem::set_p_level().

◆ _pflag

unsigned char libMesh::Elem::_pflag

protectedinherited

p refinement flag.

This is stored as an unsigned char to save space.

Definition at line 2230 of file elem.h.

Referenced by libMesh::Elem::hack_p_level_and_refinement_flag(), libMesh::Elem::p_refinement_flag(), and libMesh::Elem::set_p_refinement_flag().

◆ _rflag

unsigned char libMesh::Elem::_rflag

protectedinherited

h refinement flag.

This is stored as an unsigned char to save space.

Definition at line 2224 of file elem.h.

Referenced by libMesh::Elem::refinement_flag(), and libMesh::Elem::set_refinement_flag().

◆ _sbd_id

subdomain_id_type libMesh::Elem::_sbd_id

protectedinherited

The subdomain to which this element belongs.

Definition at line 2217 of file elem.h.

Referenced by libMesh::Elem::subdomain_id().

◆ _second_order_adjacent_vertices

const unsigned short int libMesh::Hex::_second_order_adjacent_vertices

staticprotectedinherited

Initial value:

=
  {
    { 0,  1}, 
    { 1,  2}, 
    { 2,  3}, 
    { 0,  3}, 
    { 0,  4}, 
    { 1,  5}, 
    { 2,  6}, 
    { 3,  7}, 
    { 4,  5}, 
    { 5,  6}, 
    { 6,  7}, 
    { 4,  7}  
  }

Matrix that tells which vertices define the location of mid-side (or second-order) nodes.

This matrix is kept here, since the matrix (for the first 12 higher-order nodes) is identical for Hex20 and Hex27.

Definition at line 215 of file cell_hex.h.

Referenced by second_order_adjacent_vertex(), and libMesh::Hex27::second_order_adjacent_vertex().

◆ _second_order_vertex_child_index

const unsigned short int libMesh::Hex::_second_order_vertex_child_index

staticprotectedinherited

Initial value:

=
  {
    99,99,99,99,99,99,99,99, 
    1,2,3,3,4,5,6,7,5,6,7,7, 
    2,5,6,7,7,6,             
    6                        
  }

Vector that names the child vertex index for each second order node.

Definition at line 225 of file cell_hex.h.

Referenced by second_order_child_vertex(), and libMesh::Hex27::second_order_child_vertex().

◆ _second_order_vertex_child_number

const unsigned short int libMesh::Hex::_second_order_vertex_child_number

staticprotectedinherited

Initial value:

=
  {
    99,99,99,99,99,99,99,99, 
    0,1,2,0,0,1,2,3,4,5,6,5, 
    0,0,1,2,0,4,             
    0                        
  }

Vector that names a child sharing each second order node.

Definition at line 220 of file cell_hex.h.

Referenced by second_order_child_vertex(), and libMesh::Hex27::second_order_child_vertex().

◆ adjacent_edges_map

const unsigned int libMesh::Hex::adjacent_edges_map

staticprotectedinherited

Initial value:

=
  {
    {0,  3,  4}, 
    {0,  1,  5}, 
    {1,  2,  6}, 
    {2,  3,  7}, 
    {4,  8, 11}, 
    {5,  8,  9}, 
    {6,  9, 10}, 
    {7, 10, 11}  
  }

This maps the $j^{th}$ node to the (in this case) 3 edge ids adjacent to the node.

The edge numbering matches the one used in the derived classes' edge_nodes_map. This data structure is used in the Hex::edges_adjacent_to_node() override and is shared by all the derived Hex types.

Definition at line 245 of file cell_hex.h.

Referenced by libMesh::Hex::edges_adjacent_to_node().

◆ affine_tol

constexpr Real libMesh::Elem::affine_tol = TOLERANCE*TOLERANCE

staticprotectedinherited

Default tolerance to use in has_affine_map().

Definition at line 2010 of file elem.h.

◆ edge_nodes_map

const unsigned int libMesh::Hex20::edge_nodes_map

static

Initial value:

=
  {
    {0, 1, 8},  
    {1, 2, 9},  
    {2, 3, 10}, 
    {0, 3, 11}, 
    {0, 4, 12}, 
    {1, 5, 13}, 
    {2, 6, 14}, 
    {3, 7, 15}, 
    {4, 5, 16}, 
    {5, 6, 17}, 
    {6, 7, 18}, 
    {4, 7, 19}  
  }

This maps the $j^{th}$ node of the $i^{th}$ edge to element node numbers.

Definition at line 227 of file cell_hex20.h.

Referenced by is_node_on_edge(), local_edge_node(), and nodes_on_edge().

◆ edge_sides_map

const unsigned int libMesh::Hex::edge_sides_map

staticinherited

Initial value:

=
  {
    {0, 1}, 
    {0, 2}, 
    {0, 3}, 
    {0, 4}, 
    {1, 4}, 
    {1, 2}, 
    {2, 3}, 
    {3, 4}, 
    {1, 5}, 
    {2, 5}, 
    {3, 5}, 
    {4, 5}  
  }

This maps each edge to the sides that contain said edge.

Definition at line 196 of file cell_hex.h.

Referenced by libMesh::Hex::is_edge_on_side(), and libMesh::Hex::sides_on_edge().

◆ invalid_id

const dof_id_type libMesh::DofObject::invalid_id = static_cast<dof_id_type>(-1)

staticinherited

An invalid id to distinguish an uninitialized DofObject.

Definition at line 482 of file dof_object.h.

◆ invalid_processor_id

const processor_id_type libMesh::DofObject::invalid_processor_id = static_cast<processor_id_type>(-1)

staticinherited

An invalid processor_id to distinguish DoFs that have not been assigned to a processor.

Definition at line 493 of file dof_object.h.

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::add_node(), libMesh::MeshRefinement::add_node(), libMesh::MeshCommunication::allgather(), libMesh::Node::choose_processor_id(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SubProjector::construct_projection(), libMesh::MeshTools::correct_node_proc_ids(), libMesh::MeshTools::create_bounding_box(), libMesh::MeshTools::create_nodal_bounding_box(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::Elem::Elem(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::SubFunctor::find_dofs_to_send(), libMesh::MeshCommunication::find_global_indices(), libMesh::MeshBase::get_info(), libMesh::DistributedMesh::insert_elem(), libMesh::DofObject::invalidate_processor_id(), libMesh::MeshTools::libmesh_assert_consistent_distributed(), libMesh::MeshTools::libmesh_assert_consistent_distributed_nodes(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_object_ids(), libMesh::MeshCommunication::make_new_node_proc_ids_parallel_consistent(), libMesh::DistributedMesh::n_active_elem(), libMesh::MeshBase::n_constraint_rows(), libMesh::MeshBase::n_elem_on_proc(), libMesh::MeshBase::n_nodes_on_proc(), libMesh::MeshBase::n_unpartitioned_elem(), libMesh::MeshBase::n_unpartitioned_nodes(), libMesh::SparsityPattern::Build::operator()(), libMesh::Partitioner::processor_pairs_to_interface_nodes(), libMesh::Nemesis_IO_Helper::read_var_names_impl(), libMesh::DistributedMesh::renumber_dof_objects(), libMesh::DistributedMesh::renumber_nodes_and_elements(), OverlappingFunctorTest::run_coupling_functor_test(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::send_and_insert_dof_values(), libMesh::Partitioner::set_node_processor_ids(), libMesh::DofMap::set_nonlocal_dof_objects(), libMesh::Partitioner::set_parent_processor_ids(), libMesh::LaplaceMeshSmoother::smooth(), libMesh::Parallel::sync_dofobject_data_by_id(), libMesh::Parallel::sync_dofobject_data_by_xyz(), libMesh::Parallel::sync_element_data_by_parent_id(), libMesh::Parallel::sync_node_data_by_element_id_once(), DofObjectTest< Node >::testValidProcId(), libMesh::MeshTools::total_weight(), libMesh::DofObject::valid_processor_id(), and libMesh::CheckpointIO::write().

◆ invalid_subdomain_id

const subdomain_id_type libMesh::Elem::invalid_subdomain_id = std::numeric_limits<subdomain_id_type>::max()

staticinherited

A static integral constant representing an invalid subdomain id.

See also DofObject::{invalid_id, invalid_unique_id, invalid_processor_id}.

Note: We don't use the static_cast(-1) trick here since subdomain_id_type is sometimes a signed integer for compatibility reasons (see libmesh/id_types.h).; Normally you can declare static const integral types directly in the header file (C++ standard, 9.4.2/4) but std::numeric_limits<T>::max() is not considered a "constant expression". This one is therefore defined in elem.C. http://stackoverflow.com/questions/2738435/using-numeric-limitsmax-in-constant-expressions

Definition at line 238 of file elem.h.

Referenced by libMesh::BoundaryInfo::_find_id_maps(), libMesh::BoundaryInfo::add_elements(), libMesh::ReplicatedMesh::get_disconnected_subdomains(), libMesh::MeshBase::get_id_by_name(), libMesh::BoundaryInfo::sync(), and MeshSubdomainIDTest::testMultiple().

◆ invalid_unique_id

const unique_id_type libMesh::DofObject::invalid_unique_id = static_cast<unique_id_type>(-1)

staticinherited

An invalid unique_id to distinguish an uninitialized DofObject.

Definition at line 487 of file dof_object.h.

Referenced by libMesh::DistributedMesh::renumber_dof_objects(), libMesh::DofObject::unique_id(), and libMesh::DofObject::valid_unique_id().

◆ LIBMESH_ENABLE_TOPOLOGY_CACHES

libMesh::Hex20::LIBMESH_ENABLE_TOPOLOGY_CACHES

protected

Definition at line 265 of file cell_hex20.h.

◆ max_n_nodes

const unsigned int libMesh::Elem::max_n_nodes = 27

staticinherited

The maximum number of nodes any element can contain.

This is useful for replacing heap vectors with stack arrays.

Definition at line 639 of file elem.h.

Referenced by libMesh::Elem::Elem(), and ElemTest< elem_type >::test_static_data().

◆ nodes_per_edge

const int libMesh::Hex20::nodes_per_edge = 3

static

Definition at line 215 of file cell_hex20.h.

Referenced by local_edge_node().

◆ nodes_per_side

const int libMesh::Hex20::nodes_per_side = 8

static

Definition at line 214 of file cell_hex20.h.

Referenced by local_side_node().

◆ num_children

const int libMesh::Hex::num_children = 8

staticinherited

Definition at line 75 of file cell_hex.h.

◆ num_edges

const int libMesh::Hex::num_edges = 12

staticinherited

Definition at line 74 of file cell_hex.h.

◆ num_nodes

const int libMesh::Hex20::num_nodes = 20

static

Geometric constants for Hex20.

Definition at line 213 of file cell_hex20.h.

Referenced by n_nodes().

◆ num_sides

const int libMesh::Hex::num_sides = 6

staticinherited

Geometric constants for all Hexes.

Definition at line 73 of file cell_hex.h.

Referenced by libMesh::Hex27::center_node_on_side().

◆ old_dof_object

std::unique_ptr<DofObject> libMesh::DofObject::old_dof_object

protectedinherited

This object on the last mesh.

Useful for projecting solutions from one mesh to another.

Public access to old_dof_object is now officially deprecated and will be removed in future libMesh versions. Use the get_old_dof_object() accessor instead.

Definition at line 88 of file dof_object.h.

Referenced by libMesh::DofObject::clear_old_dof_object(), libMesh::DofObject::get_old_dof_object(), libMesh::DofObject::get_old_dof_object_ref(), libMesh::DofObject::operator=(), libMesh::DofObject::pack_indexing(), libMesh::DofObject::packed_indexing_size(), libMesh::DofObject::set_old_dof_object(), and libMesh::DofObject::unpack_indexing().

◆ side_nodes_map

const unsigned int libMesh::Hex20::side_nodes_map

static

Initial value:

=
  {
    {0, 3, 2, 1, 11, 10,  9,  8}, 
    {0, 1, 5, 4,  8, 13, 16, 12}, 
    {1, 2, 6, 5,  9, 14, 17, 13}, 
    {2, 3, 7, 6, 10, 15, 18, 14}, 
    {3, 0, 4, 7, 11, 12, 19, 15}, 
    {4, 5, 6, 7, 16, 17, 18, 19}  
  }

This maps the $j^{th}$ node of the $i^{th}$ side to element node numbers.

Definition at line 221 of file cell_hex20.h.

Referenced by is_node_on_side(), local_side_node(), and nodes_on_side().

◆ type_to_n_edges_map

const unsigned int libMesh::Elem::type_to_n_edges_map

staticinherited

This array maps the integer representation of the ElemType enum to the number of edges on the element.

This is only usable for simple types for which the node number is fixed; for more general types like Polygon subclasses an actual instantiated Elem must be queried.

Definition at line 721 of file elem.h.

Referenced by ElemTest< elem_type >::test_static_data().

◆ type_to_n_nodes_map

const unsigned int libMesh::Elem::type_to_n_nodes_map

staticinherited

This array maps the integer representation of the ElemType enum to the number of nodes in the element.

This is only usable for simple types for which the node number is fixed; for more general types like Polygon subclasses an actual instantiated Elem must be queried.

Definition at line 628 of file elem.h.

Referenced by libMesh::DynaIO::ElementDefinition::ElementDefinition(), libMesh::FEAbstract::get_refspace_nodes(), libMesh::XdrIO::pack_element(), libMesh::CheckpointIO::read_connectivity(), libMesh::XdrIO::read_serialized_connectivity(), ElemTest< elem_type >::test_static_data(), MeshGenerationTest::testBuildCube(), MeshGenerationTest::testBuildLine(), and libMesh::ExodusII_IO_Helper::write_elements().

◆ type_to_n_sides_map

const unsigned int libMesh::Elem::type_to_n_sides_map

staticinherited

This array maps the integer representation of the ElemType enum to the number of sides on the element.

This is only usable for simple types for which the node number is fixed; for more general types like Polygon subclasses an actual instantiated Elem must be queried.

Definition at line 663 of file elem.h.

Referenced by ElemTest< elem_type >::test_static_data(), MeshGenerationTest::testBuildCube(), and MeshGenerationTest::testBuildSquare().

The documentation for this class was generated from the following files:

include/geom/cell_hex20.h
src/geom/cell_hex20.C

Public Types

Public Member Functions

Static Public Member Functions

Static Public Attributes

Protected Types

Protected Member Functions

Static Protected Member Functions

Protected Attributes

Static Protected Attributes

Detailed Description

Member Typedef Documentation

◆ ConstNeighborPtrIter

◆ Counts [1/2]

◆ Counts [2/2]

◆ NeighborPtrIter

◆ Predicate

Member Enumeration Documentation

◆ RefinementState

Constructor & Destructor Documentation

◆ Hex20() [1/3]

◆ Hex20() [2/3]

◆ Hex20() [3/3]

◆ ~Hex20()

Member Function Documentation

◆ _get_bracketing_node_cache()

◆ _get_parent_indices_cache()

◆ active()

◆ active_family_tree() [1/2]

◆ active_family_tree() [2/2]

◆ active_family_tree_by_neighbor() [1/2]

◆ active_family_tree_by_neighbor() [2/2]

◆ active_family_tree_by_side() [1/2]

◆ active_family_tree_by_side() [2/2]

◆ active_family_tree_by_topological_neighbor() [1/2]

◆ active_family_tree_by_topological_neighbor() [2/2]

◆ add_child() [1/2]

◆ add_child() [2/2]

◆ add_extra_integers() [1/2]

◆ add_extra_integers() [2/2]

◆ add_system()

◆ ancestor()

◆ as_parent_node()

◆ boundary_sides_begin()

◆ boundary_sides_end()

◆ bracketing_nodes()

◆ build()

◆ build_edge_ptr() [1/4]

◆ build_edge_ptr() [2/4]

◆ build_edge_ptr() [3/4]

◆ build_edge_ptr() [4/4]

◆ build_side_ptr() [1/4]

◆ build_side_ptr() [2/4]

◆ build_side_ptr() [3/4]

◆ build_side_ptr() [4/4]

◆ build_with_id()

◆ center_node_on_side()

◆ centroid()

◆ child_neighbor() [1/2]

◆ child_neighbor() [2/2]

◆ child_ptr() [1/2]

◆ child_ptr() [2/2]

◆ child_ref_range() [1/2]

◆ child_ref_range() [2/2]

◆ clear_dofs()

◆ clear_old_dof_object()

◆ close_to_point()

◆ coarsen()

◆ complete_order_equivalent_type()

◆ compute_key() [1/4]

◆ compute_key() [2/4]

◆ compute_key() [3/4]

◆ compute_key() [4/4]

◆ connectivity()

◆ contains_edge_of()

◆ contains_point()

◆ contains_vertex_of()

◆ contract()

◆ debug_buffer()

◆ default_order()

◆ default_side_order()