#include <parallel_mesh.h>

Inheritance diagram for libMesh::ParallelMesh:

Public Types
template<typename Obj >
using	dofobject_container = mapvector< Obj *, dof_id_type >

using	dofobject_container = chunked_mapvector< Obj *, dof_id_type, LIBMESH_MAPVECTOR_CHUNK_SIZE >

typedef std::set< elemset_id_type >	elemset_type
	Typedef for the "set" container used to store elemset ids.

typedef std::vector< GhostingFunctor * >::const_iterator	GhostingFunctorIterator
	Iterator type for ghosting functor ranges.

typedef Predicates::multi_predicate	Predicate
	We need an empty, generic class to act as a predicate for this and derived mesh classes.

typedef StoredRange< MeshBase::const_element_iterator, const Elem * >	ConstElemRange

typedef std::vector< std::pair< std::pair< const Elem *, unsigned int >, Real > >	constraint_rows_mapped_type

typedef std::map< const Node *, constraint_rows_mapped_type >	constraint_rows_type

Public Member Functions
	ParallelMesh (const Parallel::Communicator &comm_in, unsigned char dim=1)

	ParallelMesh (const UnstructuredMesh &other_mesh)

virtual std::unique_ptr< MeshBase >	clone () const override
	Virtual copy-constructor, creates a copy of this mesh.

	~ParallelMesh ()=default

virtual MeshBase &	assign (MeshBase &&other_mesh) override
	Shim to call the move assignment operator for this class.

virtual bool	subclass_locally_equals (const MeshBase &other_mesh) const override
	Shim to allow operator == (&) to behave like a virtual function without having to be one.

virtual void	clear () override
	Clear all internal data.

virtual void	clear_elems () override
	Clear internal Elem data.

virtual void	redistribute () override
	Redistribute elements between processors.

virtual void	update_post_partitioning () override
	Recalculate cached data after elements and nodes have been repartitioned.

virtual bool	is_serial () const override final

virtual bool	is_serial_on_zero () const override final

virtual void	set_distributed () override final
	Asserts that not all elements and nodes of the mesh necessarily exist on the current processor.

virtual bool	is_replicated () const override final

template<typename T >
void	libmesh_assert_valid_parallel_object_ids (const dofobject_container< T > &) const
	Verify id, processor_id, and if applicable unique_id consistency of a parallel objects container.

virtual void	libmesh_assert_valid_parallel_ids () const override
	Verify id and processor_id consistency of our elements and nodes containers.

void	libmesh_assert_valid_parallel_p_levels () const
	Verify p_level consistency of our elements containers.

void	libmesh_assert_valid_parallel_flags () const
	Verify refinement_flag and p_refinement_flag consistency of our elements containers.

template<typename T >
dof_id_type	renumber_dof_objects (dofobject_container< T > &)
	Renumber a parallel objects container.

virtual void	renumber_nodes_and_elements () override
	Remove nullptr elements from arrays.

virtual void	allgather () override
	Gathers all elements and nodes of the mesh onto every processor.

virtual void	gather_to_zero () override
	Gathers all elements and nodes of the mesh onto processor zero.

virtual void	delete_remote_elements () override
	Deletes all nonlocal elements of the mesh except for "ghosts" which touch a local element, and deletes all nodes which are not part of a local or ghost element.

virtual void	add_extra_ghost_elem (Elem *e)
	Inserts the element and adds it to a list of elements that should not get deleted or have their descendants deleted by delete_remote_elements.

virtual void	clear_extra_ghost_elems ()
	Clears extra ghost elements.

virtual void	clear_extra_ghost_elems (const std::set< Elem * > &extra_ghost_elems)
	Clears specified extra ghost elements.

const std::set< Elem * > &	extra_ghost_elems () const
	Const accessor to the ghosted elements.

virtual dof_id_type	n_nodes () const override final

virtual dof_id_type	max_node_id () const override final

virtual void	reserve_nodes (const dof_id_type) override final
	Reserves space for a known number of nodes.

virtual dof_id_type	n_elem () const override final

virtual dof_id_type	n_active_elem () const override final

virtual dof_id_type	max_elem_id () const override final

virtual void	reserve_elem (const dof_id_type) override final
	Reserves space for a known number of elements.

virtual void	update_parallel_id_counts () override
	Updates parallel caches so that methods like n_elem() accurately reflect changes on other processors.

virtual dof_id_type	parallel_n_nodes () const override

dof_id_type	parallel_max_node_id () const

virtual dof_id_type	parallel_n_elem () const override

dof_id_type	parallel_max_elem_id () const

virtual unique_id_type	parallel_max_unique_id () const override

virtual void	set_next_unique_id (unique_id_type id) override
	Sets the next available unique id to be used.

virtual const Point &	point (const dof_id_type i) const override final

virtual const Node *	node_ptr (const dof_id_type i) const override final

virtual Node *	node_ptr (const dof_id_type i) override final

virtual const Node *	query_node_ptr (const dof_id_type i) const override final

virtual Node *	query_node_ptr (const dof_id_type i) override final

virtual const Elem *	elem_ptr (const dof_id_type i) const override final

virtual Elem *	elem_ptr (const dof_id_type i) override final

virtual const Elem *	query_elem_ptr (const dof_id_type i) const override final

virtual Elem *	query_elem_ptr (const dof_id_type i) override final

virtual Node *	add_point (const Point &p, const dof_id_type id=DofObject::invalid_id, const processor_id_type proc_id=DofObject::invalid_processor_id) override final
	functions for adding /deleting nodes elements.

virtual Node *	add_node (Node *n) override final
	Add `Node` `n` to the end of the vertex array.

virtual Node *	add_node (std::unique_ptr< Node > n) override final
	Version of add_node() taking a std::unique_ptr by value.

virtual void	own_node (Node &n) override final
	Takes ownership of node `n` on this partition of a distributed mesh, by setting n.processor_id() to this->processor_id(), as well as changing n.id() and moving it in the mesh's internal container to give it a new authoritative id.

virtual void	delete_node (Node *n) override final
	Removes the Node n from the mesh.

virtual void	renumber_node (dof_id_type old_id, dof_id_type new_id) override final
	Changes the id of node `old_id`, both by changing node(old_id)->id() and by moving node(old_id) in the mesh's internal container.

virtual Elem *	add_elem (Elem *e) override final
	Add elem `e` to the end of the element array.

virtual Elem *	add_elem (std::unique_ptr< Elem > e) override final
	Version of add_elem() taking a std::unique_ptr by value.

virtual Elem *	insert_elem (Elem *e) override final
	Insert elem `e` to the element array, preserving its id and replacing/deleting any existing element with the same id.

virtual Elem *	insert_elem (std::unique_ptr< Elem > e) override final
	Version of insert_elem() taking a std::unique_ptr by value.

virtual void	delete_elem (Elem *e) override final
	Removes element `e` from the mesh.

virtual void	renumber_elem (dof_id_type old_id, dof_id_type new_id) override final
	Changes the id of element `old_id`, both by changing elem(old_id)->id() and by moving elem(old_id) in the mesh's internal container.

virtual void	fix_broken_node_and_element_numbering () override
	There is no reason for a user to ever call this function.

	DECLARE_ELEM_ITERATORS (,,)
	Elem and Node iterator accessor functions.

	DECLARE_ELEM_ITERATORS (active_,,)

	DECLARE_ELEM_ITERATORS (ancestor_,,) DECLARE_ELEM_ITERATORS(subactive_

	DECLARE_ELEM_ITERATORS (local_,,) DECLARE_ELEM_ITERATORS(unpartitioned_

	DECLARE_ELEM_ITERATORS (facelocal_,,) DECLARE_ELEM_ITERATORS(level_

unsigned int level	DECLARE_ELEM_ITERATORS (pid_, processor_id_type pid, pid) DECLARE_ELEM_ITERATORS(type_

unsigned int level ElemType type	DECLARE_ELEM_ITERATORS (active_subdomain_, subdomain_id_type sid, sid) DECLARE_ELEM_ITERATORS(active_subdomain_set_

	DECLARE_ELEM_ITERATORS (not_active_,,)

	DECLARE_ELEM_ITERATORS (not_ancestor_,,)

	DECLARE_ELEM_ITERATORS (not_subactive_,,)

	DECLARE_ELEM_ITERATORS (not_local_,,)

	DECLARE_ELEM_ITERATORS (not_level_, unsigned int level, level) DECLARE_ELEM_ITERATORS(active_local_

	DECLARE_ELEM_ITERATORS (active_not_local_,,) DECLARE_ELEM_ITERATORS(active_unpartitioned_

	DECLARE_ELEM_ITERATORS (active_type_, ElemType type, type) DECLARE_ELEM_ITERATORS(active_pid_

processor_id_type pid	DECLARE_ELEM_ITERATORS (local_level_, unsigned int level, level) DECLARE_ELEM_ITERATORS(local_not_level_

processor_id_type pid unsigned int level	DECLARE_ELEM_ITERATORS (active_local_subdomain_, subdomain_id_type sid, sid) DECLARE_ELEM_ITERATORS(active_local_subdomain_set_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss	DECLARE_ELEM_ITERATORS (semilocal_,,) DECLARE_ELEM_ITERATORS(ghost_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss	DECLARE_ELEM_ITERATORS (active_semilocal_,,) DECLARE_ELEM_ITERATORS(evaluable_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num	DECLARE_ELEM_ITERATORS (multi_evaluable_, std::vector< const DofMap * > dof_maps, dof_maps) DECLARE_ELEM_ITERATORS(flagged_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag	DECLARE_ELEM_ITERATORS (flagged_pid_, unsigned char rflag LIBMESH_COMMA processor_id_type pid, rflag LIBMESH_COMMA pid) DECLARE_NODE_ITERATORS(

unsigned int level ElemType type std::set< subdomain_id_type > virtual ss SimpleRange< element_iterator >	active_subdomain_elements_ptr_range (subdomain_id_type sid) override final

virtual SimpleRange< const_element_iterator >	active_subdomain_elements_ptr_range (subdomain_id_type sid) const override final

virtual SimpleRange< element_iterator >	active_local_subdomain_elements_ptr_range (subdomain_id_type sid) override final

virtual SimpleRange< const_element_iterator >	active_local_subdomain_elements_ptr_range (subdomain_id_type sid) const override final

virtual SimpleRange< element_iterator >	active_subdomain_set_elements_ptr_range (std::set< subdomain_id_type > ss) override final

virtual SimpleRange< const_element_iterator >	active_subdomain_set_elements_ptr_range (std::set< subdomain_id_type > ss) const override final

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag	DECLARE_NODE_ITERATORS (active_,,) DECLARE_NODE_ITERATORS(local_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag	DECLARE_NODE_ITERATORS (bnd_,,) DECLARE_NODE_ITERATORS(pid_

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid	DECLARE_NODE_ITERATORS (bid_, boundary_id_type bid, bid) DECLARE_NODE_ITERATORS(evaluable_

virtual void	read (const std::string &name, void *mesh_data=nullptr, bool skip_renumber_nodes_and_elements=false, bool skip_find_neighbors=false, bool skip_detect_interior_parents=false) override
	Reads the file specified by `name`.

virtual void	write (const std::string &name) const override
	Write the file specified by `name`.

void	write (const std::string &name, const std::vector< Number > &values, const std::vector< std::string > &variable_names) const
	Write to the file specified by `name`.

virtual void	all_first_order () override
	Converts a mesh with higher-order elements into a mesh with linear elements.

virtual void	all_second_order_range (const SimpleRange< element_iterator > &range, const bool full_ordered=true) override
	Converts a (conforming, non-refined) mesh with linear elements into a mesh with second-order elements.

virtual void	all_complete_order_range (const SimpleRange< element_iterator > &range) override
	Converts a (conforming, non-refined) mesh with linear elements into a mesh with "complete" order elements, i.e.

void	create_pid_mesh (UnstructuredMesh &pid_mesh, const processor_id_type pid) const
	Generates a new mesh containing all the elements which are assigned to processor `pid`.

void	create_submesh (UnstructuredMesh &new_mesh, const const_element_iterator &it, const const_element_iterator &it_end) const
	Constructs a mesh called "new_mesh" from the current mesh by iterating over the elements between it and it_end and adding them to the new mesh.

std::size_t	stitch_meshes (const MeshBase &other_mesh, boundary_id_type this_mesh_boundary, boundary_id_type other_mesh_boundary, Real tol=TOLERANCE, bool clear_stitched_boundary_ids=false, bool verbose=true, bool use_binary_search=true, bool enforce_all_nodes_match_on_boundaries=false, bool merge_boundary_nodes_all_or_nothing=false, bool remap_subdomain_ids=false, bool prepare_after_stitching=true)
	Stitch `other_mesh` to this mesh so that this mesh is the union of the two meshes.

std::size_t	stitch_surfaces (boundary_id_type boundary_id_1, boundary_id_type boundary_id_2, Real tol=TOLERANCE, bool clear_stitched_boundary_ids=false, bool verbose=true, bool use_binary_search=true, bool enforce_all_nodes_match_on_boundaries=false, bool merge_boundary_nodes_all_or_nothing=false, bool prepare_after_stitching=true)
	Similar to stitch_meshes, except that we stitch two adjacent surfaces within this mesh.

virtual void	copy_nodes_and_elements (const MeshBase &other_mesh, const bool skip_find_neighbors=false, dof_id_type element_id_offset=0, dof_id_type node_id_offset=0, unique_id_type unique_id_offset=0, std::unordered_map< subdomain_id_type, subdomain_id_type > *id_remapping=nullptr, const bool skip_preparation=false)
	Deep copy of nodes and elements from another mesh object (used by subclass copy constructors and by mesh merging operations)

virtual void	move_nodes_and_elements (MeshBase &&other_mesh)=0
	Move node and elements from other_mesh to this mesh.

virtual void	find_neighbors (const bool reset_remote_elements=false, const bool reset_current_list=true, const bool assert_valid=true, const bool check_non_remote=true) override
	Other functions from MeshBase requiring re-definition.

virtual bool	contract () override
	Delete subactive (i.e.

bool	operator== (const MeshBase &other_mesh) const
	This tests for exactly-equal data in all the senses that a mathematician would care about (element connectivity, nodal coordinates), but in the senses a programmer would care about it allows for non-equal equivalence in some ways (we accept different Elem/Node addresses in memory) but not others (we do not accept different subclass types, nor even different Elem/Node ids).

bool	operator!= (const MeshBase &other_mesh) const

bool	locally_equals (const MeshBase &other_mesh) const
	This behaves the same as operator==, but only for the local and ghosted aspects of the mesh; i.e.

virtual std::unique_ptr< Partitioner > &	partitioner ()
	A partitioner to use at each partitioning.

const BoundaryInfo &	get_boundary_info () const
	The information about boundary ids on the mesh.

BoundaryInfo &	get_boundary_info ()
	Writable information about boundary ids on the mesh.

bool	is_prepared () const

Preparation	preparation () const

void	set_isnt_prepared ()
	Tells this we have done some operation where we should no longer consider ourself prepared.

void	unset_is_prepared ()
	Tells this we have done some operation where we should no longer consider ourself prepared.

void	unset_is_partitioned ()
	Tells this we have done some operation creating unpartitioned elements.

void	unset_has_synched_id_counts ()
	Tells this we have done some operation (e.g.

void	unset_has_neighbor_ptrs ()
	Tells this we have done some operation (e.g.

void	unset_has_cached_elem_data ()
	Tells this we have done some operation (e.g.

void	unset_has_interior_parent_ptrs ()
	Tells this we have done some operation (e.g.

void	unset_has_removed_remote_elements ()
	Tells this we have done some operation (e.g.

void	unset_has_removed_orphaned_nodes ()
	Tells this we have done some operation (e.g.

void	unset_has_reinit_ghosting_functors ()
	Tells this we have done some operation (e.g.

void	unset_has_boundary_id_sets ()
	Tells this we have done some operation which may have invalidated our cached boundary id sets.

void	unset_has_synched_subdomain_name_map ()
	Tells this we have done some operation which may have left the subdomain id to name map inconsistent across processors.

void	reinit_ghosting_functors ()
	Loops over ghosting functors and calls mesh_reinit()

unsigned int	mesh_dimension () const

void	set_mesh_dimension (unsigned char d)
	Resets the logical dimension of the mesh.

const std::set< unsigned char > &	elem_dimensions () const

const std::set< Order > &	elem_default_orders () const

Order	supported_nodal_order () const

void	set_elem_dimensions (std::set< unsigned char > elem_dims)
	Most of the time you should not need to call this, as the element dimensions will be set automatically by a call to cache_elem_data(), therefore only call this if you know what you're doing.

void	add_elemset_code (dof_id_type code, MeshBase::elemset_type id_set)
	Tabulate a user-defined "code" for elements which belong to the element sets specified in `id_set`.

unsigned int	n_elemsets () const
	Returns the number of unique elemset ids which have been added via add_elemset_code(), which is the size of the _all_elemset_ids set.

void	get_elemsets (dof_id_type elemset_code, MeshBase::elemset_type &id_set_to_fill) const
	Look up the element sets for a given elemset code and vice-versa.

dof_id_type	get_elemset_code (const MeshBase::elemset_type &id_set) const

std::vector< dof_id_type >	get_elemset_codes () const
	Return a vector of all elemset codes defined on the mesh.

void	change_elemset_code (dof_id_type old_code, dof_id_type new_code)
	Replace elemset code "old_code" with "new_code".

void	change_elemset_id (elemset_id_type old_id, elemset_id_type new_id)
	Replace elemset id "old_id" with "new_id".

unsigned int	spatial_dimension () const

void	set_spatial_dimension (unsigned char d)
	Sets the "spatial dimension" of the Mesh.

dof_id_type	n_nodes_on_proc (const processor_id_type proc) const

dof_id_type	n_local_nodes () const

dof_id_type	n_unpartitioned_nodes () const

unique_id_type	next_unique_id () const

dof_id_type	n_elem_on_proc (const processor_id_type proc) const

dof_id_type	n_local_elem () const

dof_id_type	n_unpartitioned_elem () const

dof_id_type	n_active_elem_on_proc (const processor_id_type proc) const

dof_id_type	n_active_local_elem () const

dof_id_type	n_sub_elem () const

dof_id_type	n_active_sub_elem () const
	Same as `n_sub_elem()`, but only counts active elements.

virtual const Node &	node_ref (const dof_id_type i) const

virtual Node &	node_ref (const dof_id_type i)

virtual const Elem &	elem_ref (const dof_id_type i) const

virtual Elem &	elem_ref (const dof_id_type i)

ElemMappingType	default_mapping_type () const
	Returns the default master space to physical space mapping basis functions to be used on newly added elements.

void	set_default_mapping_type (const ElemMappingType type)
	Set the default master space to physical space mapping basis functions to be used on newly added elements.

unsigned char	default_mapping_data () const
	Returns any default data value used by the master space to physical space mapping.

void	set_default_mapping_data (const unsigned char data)
	Set the default master space to physical space mapping basis functions to be used on newly added elements.

void	remove_orphaned_nodes ()
	Removes any orphaned nodes, nodes not connected to any elements.

unsigned int	add_elem_integer (std::string name, bool allocate_data=true, dof_id_type default_value=DofObject::invalid_id)
	Register an integer datum (of type dof_id_type) to be added to each element in the mesh.

std::vector< unsigned int >	add_elem_integers (const std::vector< std::string > &names, bool allocate_data=true, const std::vector< dof_id_type > *default_values=nullptr)
	Register integer data (of type dof_id_type) to be added to each element in the mesh, one string name for each new integer.

unsigned int	get_elem_integer_index (std::string_view name) const

bool	has_elem_integer (std::string_view name) const

const std::string &	get_elem_integer_name (unsigned int i) const

unsigned int	n_elem_integers () const

template<typename T >
unsigned int	add_elem_datum (const std::string &name, bool allocate_data=true, const T *default_value=nullptr)
	Register a datum (of type T) to be added to each element in the mesh.

template<typename T >
std::vector< unsigned int >	add_elem_data (const std::vector< std::string > &names, bool allocate_data=true, const std::vector< T > *default_values=nullptr)
	Register data (of type T) to be added to each element in the mesh.

unsigned int	add_node_integer (std::string name, bool allocate_data=true, dof_id_type default_value=DofObject::invalid_id)
	Register an integer datum (of type dof_id_type) to be added to each node in the mesh.

std::vector< unsigned int >	add_node_integers (const std::vector< std::string > &names, bool allocate_data=true, const std::vector< dof_id_type > *default_values=nullptr)
	Register integer data (of type dof_id_type) to be added to each node in the mesh.

unsigned int	get_node_integer_index (std::string_view name) const

bool	has_node_integer (std::string_view name) const

const std::string &	get_node_integer_name (unsigned int i) const

unsigned int	n_node_integers () const

template<typename T >
unsigned int	add_node_datum (const std::string &name, bool allocate_data=true, const T *default_value=nullptr)
	Register a datum (of type T) to be added to each node in the mesh.

template<typename T >
std::vector< unsigned int >	add_node_data (const std::vector< std::string > &name, bool allocate_data=true, const std::vector< T > *default_values=nullptr)
	Register data (of type T) to be added to each node in the mesh.

void	prepare_for_use (const bool skip_renumber_nodes_and_elements, const bool skip_find_neighbors)
	Prepare a newly created (or read) mesh for use.

void	prepare_for_use (const bool skip_renumber_nodes_and_elements)

void	prepare_for_use ()

void	complete_preparation ()

virtual void	partition (const unsigned int n_parts)
	Call the default partitioner (currently `metis_partition()`).

void	partition ()

void	allow_renumbering (bool allow)
	If false is passed in then this mesh will no longer be renumbered when being prepared for use.

bool	allow_renumbering () const

void	allow_find_neighbors (bool allow)
	If `false` is passed then this mesh will no longer work to find element neighbors when being prepared for use.

bool	allow_find_neighbors () const

void	allow_detect_interior_parents (bool allow)
	If `false` is passed then this mesh will no longer work to detect interior parents when being prepared for use.

bool	allow_detect_interior_parents () const

void	allow_remote_element_removal (bool allow)
	If false is passed in then this mesh will no longer have remote elements deleted when being prepared for use; i.e.

bool	allow_remote_element_removal () const

void	allow_node_and_elem_unique_id_overlap (bool allow)
	If `true` is passed, then this mesh will no longer require unique_ids to be unique across the set of all DofObjects.

bool	allow_node_and_elem_unique_id_overlap () const

void	skip_noncritical_partitioning (bool skip)
	If true is passed in then the elements on this mesh will no longer be (re)partitioned, and the nodes on this mesh will only be repartitioned if they are found "orphaned" via coarsening or other removal of the last element responsible for their node/element processor id consistency.

bool	skip_noncritical_partitioning () const

void	skip_partitioning (bool skip)
	If true is passed in then nothing on this mesh will be (re)partitioned.

bool	skip_partitioning () const

void	add_ghosting_functor (GhostingFunctor &ghosting_functor)
	Adds a functor which can specify ghosting requirements for use on distributed meshes.

void	add_ghosting_functor (std::shared_ptr< GhostingFunctor > ghosting_functor)
	Adds a functor which can specify ghosting requirements for use on distributed meshes.

void	remove_ghosting_functor (GhostingFunctor &ghosting_functor)
	Removes a functor which was previously added to the set of ghosting functors.

GhostingFunctorIterator	ghosting_functors_begin () const
	Beginning of range of ghosting functors.

GhostingFunctorIterator	ghosting_functors_end () const
	End of range of ghosting functors.

GhostingFunctor &	default_ghosting ()
	Default ghosting functor.

void	subdomain_ids (std::set< subdomain_id_type > &ids, const bool global=true) const
	Constructs a list of all subdomain identifiers in the local mesh if `global` == false, and in the global mesh if `global` == true (default).

subdomain_id_type	n_subdomains () const

subdomain_id_type	n_local_subdomains () const

unsigned int	n_partitions () const

std::string	get_info (const unsigned int verbosity=0, const bool global=true) const

void	print_info (std::ostream &os=libMesh::out, const unsigned int verbosity=0, const bool global=true) const
	Prints relevant information about the mesh.

void	all_second_order (const bool full_ordered=true)
	Calls the range-based version of this function with a range consisting of all elements in the mesh.

virtual void	all_complete_order ()
	Calls the range-based version of this function with a range consisting of all elements in the mesh.

unsigned int	recalculate_n_partitions ()
	In a few (very rare) cases, the user may have manually tagged the elements with specific processor IDs by hand, without using a partitioner.

std::unique_ptr< PointLocatorBase >	sub_point_locator () const

void	set_point_locator_close_to_point_tol (Real val)
	Set value used by PointLocatorBase::close_to_point_tol().

Real	get_point_locator_close_to_point_tol () const

void	clear_point_locator ()
	Releases the current `PointLocator` object.

void	set_count_lower_dim_elems_in_point_locator (bool count_lower_dim_elems)
	In the point locator, do we count lower dimensional elements when we refine point locator regions? This is relevant in tree-based point locators, for example.

bool	get_count_lower_dim_elems_in_point_locator () const
	Get the current value of _count_lower_dim_elems_in_point_locator.

std::string &	subdomain_name (subdomain_id_type id)

const std::string &	subdomain_name (subdomain_id_type id) const

void	set_subdomain_name (subdomain_id_type id, const std::string &name, bool synchronous=false)
	Sets the `name` for the provided `id`.

subdomain_id_type	get_id_by_name (std::string_view name) const

	ABSTRACT_ELEM_ITERATORS (,) ABSTRACT_ELEM_ITERATORS(active_

	ABSTRACT_ELEM_ITERATORS (ancestor_,) ABSTRACT_ELEM_ITERATORS(subactive_

	ABSTRACT_ELEM_ITERATORS (local_,) ABSTRACT_ELEM_ITERATORS(unpartitioned_

	ABSTRACT_ELEM_ITERATORS (facelocal_,) ABSTRACT_ELEM_ITERATORS(level_

unsigned int level	ABSTRACT_ELEM_ITERATORS (pid_, processor_id_type pid) ABSTRACT_ELEM_ITERATORS(type_

unsigned int level ElemType type	ABSTRACT_ELEM_ITERATORS (active_subdomain_, subdomain_id_type sid) ABSTRACT_ELEM_ITERATORS(active_subdomain_set_

unsigned int level ElemType type std::set< subdomain_id_type > ss	ABSTRACT_ELEM_ITERATORS (not_active_,) ABSTRACT_ELEM_ITERATORS(not_ancestor_

unsigned int level ElemType type std::set< subdomain_id_type > ss	ABSTRACT_ELEM_ITERATORS (not_subactive_,) ABSTRACT_ELEM_ITERATORS(not_local_

unsigned int level ElemType type std::set< subdomain_id_type > ss	ABSTRACT_ELEM_ITERATORS (not_level_, unsigned int level) ABSTRACT_ELEM_ITERATORS(active_local_

unsigned int level ElemType type std::set< subdomain_id_type > ss	ABSTRACT_ELEM_ITERATORS (active_not_local_,) ABSTRACT_ELEM_ITERATORS(active_unpartitioned_

unsigned int level ElemType type std::set< subdomain_id_type > ss	ABSTRACT_ELEM_ITERATORS (active_type_, ElemType type) ABSTRACT_ELEM_ITERATORS(active_pid_

unsigned int level ElemType type std::set< subdomain_id_type > ss processor_id_type pid	ABSTRACT_ELEM_ITERATORS (local_level_, unsigned int level) ABSTRACT_ELEM_ITERATORS(local_not_level_

unsigned int level ElemType type std::set< subdomain_id_type > ss processor_id_type pid unsigned int level	ABSTRACT_ELEM_ITERATORS (active_local_subdomain_, subdomain_id_type sid) ABSTRACT_ELEM_ITERATORS(active_local_subdomain_set_

	ABSTRACT_ELEM_ITERATORS (semilocal_,) ABSTRACT_ELEM_ITERATORS(ghost_

	ABSTRACT_ELEM_ITERATORS (active_semilocal_,) ABSTRACT_ELEM_ITERATORS(evaluable_

const ElemRange &	element_stored_range ()

const ConstElemRange &	active_local_element_stored_range () const

void	clear_stored_ranges ()
	Clears stored ranges, to indicate that the mesh has changed and they should be regenerated when next needed.

std::map< subdomain_id_type, std::string > &	set_subdomain_name_map ()

const std::map< subdomain_id_type, std::string > &	get_subdomain_name_map () const

constraint_rows_type &	get_constraint_rows ()
	Constraint rows accessors.

const constraint_rows_type &	get_constraint_rows () const

constraint_rows_type &	set_constraint_rows ()

dof_id_type	n_constraint_rows () const
	Returns how many total constraint rows we have.

void	copy_constraint_rows (const MeshBase &other_mesh)
	Copy the constraints from the other mesh to this mesh.

template<typename T >
void	copy_constraint_rows (const SparseMatrix< T > &constraint_operator, bool precondition_constraint_operator=false)
	Copy the constraints from the given matrix to this mesh.

void	print_constraint_rows (std::ostream &os=libMesh::out, bool print_nonlocal=false) const
	Prints (from processor 0) all mesh constraint rows.

std::string	get_local_constraints (bool print_nonlocal=false) const
	Gets a string reporting all mesh constraint rows local to this processor.

void	cache_elem_dims ()

void	cache_elem_data ()

void	sync_subdomain_name_map ()
	libMesh often expects all processors to know about names of all subdomain ids, but distributed mesh generators may only know about part of a mesh when creating names.

void	detect_interior_parents ()
	Search the mesh for elements that have a neighboring element of dim+1 and set that element as the interior parent.

const MeshBase &	interior_mesh () const

MeshBase &	interior_mesh ()

void	set_interior_mesh (MeshBase &int_mesh)
	Sets the interior mesh.

const std::set< subdomain_id_type > &	get_mesh_subdomains () const

void	add_disjoint_neighbor_boundary_pairs (const boundary_id_type b1, const boundary_id_type b2, const RealVectorValue &translation)
	Register a pair of boundaries as disjoint neighbor boundary pairs.

PeriodicBoundaries *	get_disjoint_neighbor_boundary_pairs ()

const PeriodicBoundaries *	get_disjoint_neighbor_boundary_pairs () const

void	remove_disjoint_boundary_pair (const boundary_id_type b1, const boundary_id_type b2)

const Parallel::Communicator &	comm () const

processor_id_type	n_processors () const

processor_id_type	processor_id () const

Public Attributes
unsigned int	level

processor_id_type pid unsigned int	level

unsigned int level ElemType	type

unsigned int level ElemType type std::set< subdomain_id_type >	ss

processor_id_type pid unsigned int level std::set< subdomain_id_type >	ss

processor_id_type	pid

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type	pid

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int	var_num = libMesh::invalid_uint

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid const DofMap &dof_map LIBMESH_COMMA unsigned int	var_num = libMesh::invalid_uint

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char	rflag

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num DECLARE_NODE_ITERATORS(multi_evaluable_, std::vector< const DofMap * > dof_maps, dof_maps) protected dofobject_container< Node >	_nodes
	Move node and elements from a DistributedMesh.

dofobject_container< Elem >	_elements
	The elements in the mesh.

bool	_is_serial
	A boolean remembering whether we're serialized or not.

bool	_is_serial_on_proc_0
	A boolean remembering whether we're serialized to proc 0 or not.

bool	_deleted_coarse_elements
	A boolean remembering whether we've recently deleted top-level elements or not.

dof_id_type	_n_nodes
	Cached data from the last renumber_nodes_and_elements call.

dof_id_type	_n_elem

dof_id_type	_max_node_id

dof_id_type	_max_elem_id

dof_id_type	_next_free_local_node_id
	Guaranteed globally unused IDs for use when adding new nodes or elements.

dof_id_type	_next_free_local_elem_id

dof_id_type	_next_free_unpartitioned_node_id

dof_id_type	_next_free_unpartitioned_elem_id

unique_id_type	_next_unpartitioned_unique_id
	The next available unique id for assigning ids to unpartitioned DOF objects.

std::set< Elem * >	_extra_ghost_elems
	These are extra ghost elements that we want to make sure not to delete when we call delete_remote_elements()

const DofMap &dof_map LIBMESH_COMMA unsigned int Elem *	ElemRange

Protected Types
typedef variant_filter_iterator< MeshBase::Predicate, Elem * >	elem_filter_iter
	The original iterator classes weren't properly const-safe; relying on their const-incorrectness is now deprecated.

typedef variant_filter_iterator< MeshBase::Predicate, Elem const, Elem const &, Elem const , const Elem const, const Elem const &, const Elem const >	elem_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, Elem const, Elem const &, Elem const >	const_elem_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, const Elem const, const Elem const &, const Elem const >	const_elem_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, Node * >	node_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, Node const, Node const &, Node const , const Node const, const Node const &, const Node const >	node_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, Node const, Node const &, Node const >	const_node_filter_iter

typedef variant_filter_iterator< MeshBase::Predicate, const Node const, const Node const &, const Node const >	const_node_filter_iter

Protected Member Functions
void	post_dofobject_moves (MeshBase &&other_mesh)
	Moves any superclass data (e.g.

void	copy_cached_data (const MeshBase &other_mesh)
	Helper class to copy cached data, to synchronize with a possibly unprepared `other_mesh`.

bool	nodes_and_elements_equal (const MeshBase &other_mesh) const
	Tests for equality of all elements and nodes in the mesh.

unsigned int &	set_n_partitions ()

void	size_elem_extra_integers ()
	Size extra-integer arrays of all elements in the mesh.

void	size_node_extra_integers ()
	Size extra-integer arrays of all nodes in the mesh.

std::pair< std::vector< unsigned int >, std::vector< unsigned int > >	merge_extra_integer_names (const MeshBase &other)
	Merge extra-integer arrays from an `other` mesh.

dof_id_type	count_constraint_rows ()
	Helper function for subclasses to use to set _n_constraint_rows.

Protected Attributes
std::unique_ptr< PeriodicBoundaries >	_disjoint_neighbor_boundary_pairs
	The disjoint neighbor boundary id pairs.

std::unique_ptr< BoundaryInfo >	boundary_info
	This class holds the boundary information.

unsigned int	_n_parts
	The number of partitions the mesh has.

ElemMappingType	_default_mapping_type
	The default mapping type (typically Lagrange) between master and physical space to assign to newly added elements.

unsigned char	_default_mapping_data
	The default mapping data (unused with Lagrange, used for nodal weight lookup index with rational bases) to assign to newly added elements.

Preparation	_preparation
	Flags indicating in what ways `this` mesh has been prepared.

std::unique_ptr< ElemRange >	_element_stored_range
	A cached `ElemRange` for threaded mutation of all semilocal elements of this mesh.

std::unique_ptr< ConstElemRange >	_const_active_local_element_stored_range
	A cached `ConstElemRange` for threaded calculation on all local elements of this mesh.

std::unique_ptr< PointLocatorBase >	_point_locator
	A `PointLocator` class for this mesh.

bool	_count_lower_dim_elems_in_point_locator
	Do we count lower dimensional elements in point locator refinement? This is relevant in tree-based point locators, for example.

std::unique_ptr< Partitioner >	_partitioner
	A partitioner to use at each prepare_for_use().

unique_id_type	_next_unique_id
	The next available unique id for assigning ids to DOF objects.

MeshBase *	_interior_mesh
	Defaulting to `this`, a pointer to the mesh used to generate boundary elements on `this`.

bool	_skip_noncritical_partitioning
	If this is true then no partitioning should be done with the possible exception of orphaned nodes.

bool	_skip_all_partitioning
	If this is true then no partitioning should be done.

bool	_skip_renumber_nodes_and_elements
	If this is true then renumbering will be kept to a minimum.

bool	_skip_find_neighbors
	If this is `true` then we will skip `find_neighbors` in `prepare_for_use`.

bool	_skip_detect_interior_parents
	If this is `true` then we will skip `detect_interior_parents` in `prepare_for_use`.

bool	_allow_remote_element_removal
	If this is false then even on DistributedMesh remote elements will not be deleted during mesh preparation.

bool	_allow_node_and_elem_unique_id_overlap
	The Exodus reader (and potentially other readers in the future?) now supports setting Node and Elem unique_ids based on values from within the Exodus file itself, rather than generating them automatically in LibMesh.

std::map< subdomain_id_type, std::string >	_block_id_to_name
	This structure maintains the mapping of named blocks for file formats that support named blocks.

std::set< unsigned char >	_elem_dims
	We cache the dimension of the elements present in the mesh.

std::set< Order >	_elem_default_orders
	We cache the (default) order of the geometric elements present in the mesh.

Order	_supported_nodal_order
	We cache the maximum nodal order supported by all the mesh's elements (the minimum supported_nodal_order() of any element)

std::set< subdomain_id_type >	_mesh_subdomains
	We cache the subdomain ids of the elements present in the mesh.

std::map< dof_id_type, const MeshBase::elemset_type * >	_elemset_codes
	Map from "element set code" to list of set ids to which that element belongs (and vice-versa).

std::map< MeshBase::elemset_type, dof_id_type >	_elemset_codes_inverse_map

MeshBase::elemset_type	_all_elemset_ids

unsigned char	_spatial_dimension
	The "spatial dimension" of the Mesh.

std::vector< std::string >	_elem_integer_names
	The array of names for integer data associated with each element in the mesh.

std::vector< dof_id_type >	_elem_integer_default_values
	The array of default initialization values for integer data associated with each element in the mesh.

std::vector< std::string >	_node_integer_names
	The array of names for integer data associated with each node in the mesh.

std::vector< dof_id_type >	_node_integer_default_values
	The array of default initialization values for integer data associated with each node in the mesh.

std::unique_ptr< GhostingFunctor >	_default_ghosting
	The default geometric GhostingFunctor, used to implement standard libMesh element ghosting behavior.

std::vector< GhostingFunctor * >	_ghosting_functors
	The list of all GhostingFunctor objects to be used when distributing a DistributedMesh.

std::map< GhostingFunctor *, std::shared_ptr< GhostingFunctor > >	_shared_functors
	Hang on to references to any GhostingFunctor objects we were passed in shared_ptr form.

constraint_rows_type	_constraint_rows

dof_id_type	_n_constraint_rows

Real	_point_locator_close_to_point_tol
	If nonzero, we will call PointLocatorBase::set_close_to_point_tol() on any PointLocators that we create.

const Parallel::Communicator &	_communicator

Private Types
typedef dofobject_container< Elem >::veclike_iterator	elem_iterator_imp
	Typedefs for the container implementation.

typedef dofobject_container< Elem >::const_veclike_iterator	const_elem_iterator_imp

typedef dofobject_container< Node >::veclike_iterator	node_iterator_imp
	Typedefs for the container implementation.

typedef dofobject_container< Node >::const_veclike_iterator	const_node_iterator_imp

Private Member Functions
void	set_next_ids ()
	Derives _next_free_local_node_id, _next_free_local_elem_id, _next_free_unpartitioned_node_id, and _next_free_unpartitioned_elem_id from the current _max_node_id and _max_elem_id, interleaving ids among processors so that each processor (and the unpartitioned pool) has its own reserved slot in every repeating group of n_processors()+1 ids.

void	set_next_unique_ids (unique_id_type parallel_max_unique_id)
	Derives _next_unique_id and _next_unpartitioned_unique_id from `parallel_max_unique_id`, the largest unique id currently in use (or any other value guaranteed to be at least that large, such as a trusted next_unique_id()), using the same processor-interleaved id ranges as set_next_ids().

std::size_t	stitching_helper (const MeshBase *other_mesh, boundary_id_type boundary_id_1, boundary_id_type boundary_id_2, Real tol, bool clear_stitched_boundary_ids, bool verbose, bool use_binary_search, bool enforce_all_nodes_match_on_boundaries, bool skip_find_neighbors, bool merge_boundary_nodes_all_or_nothing, bool remap_subdomain_ids, bool prepare_after_stitching)
	Helper function for stitch_meshes and stitch_surfaces that does the mesh stitching.

Detailed Description

Definition at line 34 of file parallel_mesh.h.

Member Typedef Documentation

◆ const_elem_filter_iter [1/2]

typedef variant_filter_iterator<MeshBase::Predicate, Elem * const, Elem * const &, Elem * const *> libMesh::MeshBase::const_elem_filter_iter

protectedinherited

Definition at line 2504 of file mesh_base.h.

◆ const_elem_filter_iter [2/2]

typedef variant_filter_iterator<MeshBase::Predicate, const Elem * const, const Elem * const &, const Elem * const *> libMesh::MeshBase::const_elem_filter_iter

protectedinherited

Definition at line 2524 of file mesh_base.h.

◆ const_elem_iterator_imp

typedef dofobject_container<Elem>::const_veclike_iterator libMesh::DistributedMesh::const_elem_iterator_imp

privateinherited

Definition at line 496 of file distributed_mesh.h.

◆ const_node_filter_iter [1/2]

typedef variant_filter_iterator<MeshBase::Predicate, Node * const, Node * const &, Node * const *> libMesh::MeshBase::const_node_filter_iter

protectedinherited

Definition at line 2511 of file mesh_base.h.

◆ const_node_filter_iter [2/2]

typedef variant_filter_iterator<MeshBase::Predicate, const Node * const, const Node * const &, const Node * const *> libMesh::MeshBase::const_node_filter_iter

protectedinherited

Definition at line 2537 of file mesh_base.h.

◆ const_node_iterator_imp

typedef dofobject_container<Node>::const_veclike_iterator libMesh::DistributedMesh::const_node_iterator_imp

privateinherited

Definition at line 502 of file distributed_mesh.h.

◆ ConstElemRange

typedef StoredRange<MeshBase::const_element_iterator, const Elem *> libMesh::MeshBase::ConstElemRange

inherited

Definition at line 1899 of file mesh_base.h.

◆ constraint_rows_mapped_type

typedef std::vector<std::pair<std::pair<const Elem *, unsigned int>, Real> > libMesh::MeshBase::constraint_rows_mapped_type

inherited

Definition at line 1933 of file mesh_base.h.

◆ constraint_rows_type

typedef std::map<const Node *, constraint_rows_mapped_type> libMesh::MeshBase::constraint_rows_type

inherited

Definition at line 1934 of file mesh_base.h.

◆ dofobject_container [1/2]

template<typename Obj >

using libMesh::DistributedMesh::dofobject_container = mapvector<Obj *, dof_id_type>

inherited

Definition at line 63 of file distributed_mesh.h.

◆ dofobject_container [2/2]

using libMesh::DistributedMesh::dofobject_container = chunked_mapvector<Obj *, dof_id_type, LIBMESH_MAPVECTOR_CHUNK_SIZE>

inherited

Definition at line 65 of file distributed_mesh.h.

◆ elem_filter_iter [1/2]

typedef variant_filter_iterator<MeshBase::Predicate, Elem *> libMesh::MeshBase::elem_filter_iter

protectedinherited

The original iterator classes weren't properly const-safe; relying on their const-incorrectness is now deprecated.

Definition at line 2499 of file mesh_base.h.

◆ elem_filter_iter [2/2]

typedef variant_filter_iterator<MeshBase::Predicate, Elem * const, Elem * const &, Elem * const *, const Elem * const, const Elem * const &, const Elem * const *> libMesh::MeshBase::elem_filter_iter

protectedinherited

Definition at line 2519 of file mesh_base.h.

◆ elem_iterator_imp

typedef dofobject_container<Elem>::veclike_iterator libMesh::DistributedMesh::elem_iterator_imp

privateinherited

Typedefs for the container implementation.

Definition at line 495 of file distributed_mesh.h.

◆ elemset_type

typedef std::set<elemset_id_type> libMesh::MeshBase::elemset_type

inherited

Typedef for the "set" container used to store elemset ids.

The main requirements are that the entries be sorted and unique, so std::set works for this, but there may be more efficient alternatives.

Definition at line 463 of file mesh_base.h.

◆ GhostingFunctorIterator

typedef std::vector<GhostingFunctor*>::const_iterator libMesh::MeshBase::GhostingFunctorIterator

inherited

Iterator type for ghosting functor ranges.

This has changed in the past and may change again; code should use auto or the type here.

Definition at line 1471 of file mesh_base.h.

◆ node_filter_iter [1/2]

typedef variant_filter_iterator<MeshBase::Predicate, Node *> libMesh::MeshBase::node_filter_iter

protectedinherited

Definition at line 2506 of file mesh_base.h.

◆ node_filter_iter [2/2]

typedef variant_filter_iterator<MeshBase::Predicate, Node * const, Node * const &, Node * const *, const Node * const, const Node * const &, const Node * const *> libMesh::MeshBase::node_filter_iter

protectedinherited

Definition at line 2532 of file mesh_base.h.

◆ node_iterator_imp

typedef dofobject_container<Node>::veclike_iterator libMesh::DistributedMesh::node_iterator_imp

privateinherited

Typedefs for the container implementation.

Definition at line 501 of file distributed_mesh.h.

◆ Predicate

typedef Predicates::multi_predicate libMesh::MeshBase::Predicate

inherited

We need an empty, generic class to act as a predicate for this and derived mesh classes.

Definition at line 1589 of file mesh_base.h.

Constructor & Destructor Documentation

◆ ParallelMesh() [1/2]

libMesh::ParallelMesh::ParallelMesh	(	const Parallel::Communicator &	comm_in,
		unsigned char	dim = `1`
	)

inlineexplicit

Definition at line 38 of file parallel_mesh.h.

40 : DistributedMesh(comm_in,dim) {}

dim

unsigned int dim

Definition adaptivity_ex3.C:114

libMesh::DistributedMesh::DistributedMesh

DistributedMesh(const Parallel::Communicator &comm_in, unsigned char dim=1)

Constructor.

Definition distributed_mesh.C:42

◆ ParallelMesh() [2/2]

libMesh::ParallelMesh::ParallelMesh ( const UnstructuredMesh & other_mesh )

inline

Definition at line 42 of file parallel_mesh.h.

42: DistributedMesh(other_mesh) {}

◆ ~ParallelMesh()

libMesh::ParallelMesh::~ParallelMesh ( )

default

Member Function Documentation

◆ ABSTRACT_ELEM_ITERATORS() [1/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [2/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss processor_id_type pid unsigned int level libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	active_local_subdomain_	,
		subdomain_id_type	sid
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [3/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( active_not_local_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [4/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( active_semilocal_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [5/15]

unsigned int level ElemType type libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	active_subdomain_	,
		subdomain_id_type	sid
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [6/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	active_type_	,
		ElemType	type
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [7/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( ancestor_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [8/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( facelocal_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [9/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( local_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [10/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss processor_id_type pid libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	local_level_	,
		unsigned int	level
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [11/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( not_active_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [12/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	not_level_	,
		unsigned int	level
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [13/15]

unsigned int level ElemType type std::set< subdomain_id_type > ss libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( not_subactive_ )

inherited

◆ ABSTRACT_ELEM_ITERATORS() [14/15]

unsigned int level libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS	(	pid_	,
		processor_id_type	pid
	)

inherited

◆ ABSTRACT_ELEM_ITERATORS() [15/15]

libMesh::MeshBase::ABSTRACT_ELEM_ITERATORS ( semilocal_ )

inherited

◆ active_local_element_stored_range()

const ConstElemRange & libMesh::MeshBase::active_local_element_stored_range ( ) const

inherited

Returns: A reference to a cached vector copy of a range of pointers to all active local elements, suitable for threading.

Iterating over only local elements is most useful for computing on the mesh, so we only have a non-const version for now.

Definition at line 1969 of file mesh_base.C.

{
  if (!_const_active_local_element_stored_range)
  {
    // Range construction may not be safe within threads
    libmesh_assert(!Threads::in_threads);
 
    _const_active_local_element_stored_range =
      std::make_unique<ConstElemRange>(this->active_local_elements_begin(),
                                  this->active_local_elements_end());
  }
 
  return *_const_active_local_element_stored_range;
}

References libMesh::MeshBase::_const_active_local_element_stored_range, libMesh::Threads::in_threads, and libMesh::libmesh_assert().

Referenced by libMesh::FEMSystem::assemble_qoi(), libMesh::FEMSystem::assemble_qoi_derivative(), libMesh::FEMSystem::assembly(), libMesh::EquationSystems::build_parallel_elemental_solution_vector(), libMesh::MeshTetInterface::check_hull_integrity(), libMesh::MeshRefinement::create_parent_error_vector(), libMesh::MeshTools::n_active_local_levels(), libMesh::FEMSystem::postprocess(), and libMesh::MeshBase::subdomain_ids().

◆ active_local_subdomain_elements_ptr_range() [1/2]

virtual SimpleRange< const_element_iterator > libMesh::DistributedMesh::active_local_subdomain_elements_ptr_range ( subdomain_id_type sid ) const

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 363 of file distributed_mesh.h.

363{ return active_local_subdomain_element_ptr_range(sid); }

◆ active_local_subdomain_elements_ptr_range() [2/2]

virtual SimpleRange< element_iterator > libMesh::DistributedMesh::active_local_subdomain_elements_ptr_range ( subdomain_id_type sid )

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 362 of file distributed_mesh.h.

362{ return active_local_subdomain_element_ptr_range(sid); }

◆ active_subdomain_elements_ptr_range() [1/2]

virtual SimpleRange< const_element_iterator > libMesh::DistributedMesh::active_subdomain_elements_ptr_range ( subdomain_id_type sid ) const

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 361 of file distributed_mesh.h.

361{ return active_subdomain_element_ptr_range(sid); }

◆ active_subdomain_elements_ptr_range() [2/2]

unsigned int level ElemType type std::set< subdomain_id_type > virtual ss SimpleRange< element_iterator > libMesh::DistributedMesh::active_subdomain_elements_ptr_range ( subdomain_id_type sid )

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 360 of file distributed_mesh.h.

360{ return active_subdomain_element_ptr_range(sid); }

◆ active_subdomain_set_elements_ptr_range() [1/2]

virtual SimpleRange< const_element_iterator > libMesh::DistributedMesh::active_subdomain_set_elements_ptr_range ( std::set< subdomain_id_type > ss ) const

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 365 of file distributed_mesh.h.

365{ return active_subdomain_set_element_ptr_range(ss); }

libMesh::DistributedMesh::ss

unsigned int level ElemType type std::set< subdomain_id_type > ss

Definition distributed_mesh.h:357

References libMesh::DistributedMesh::ss.

◆ active_subdomain_set_elements_ptr_range() [2/2]

virtual SimpleRange< element_iterator > libMesh::DistributedMesh::active_subdomain_set_elements_ptr_range ( std::set< subdomain_id_type > ss )

inlinefinaloverridevirtualinherited

Implements libMesh::MeshBase.

Definition at line 364 of file distributed_mesh.h.

364{ return active_subdomain_set_element_ptr_range(ss); }

References libMesh::DistributedMesh::ss.

◆ add_disjoint_neighbor_boundary_pairs()

void libMesh::MeshBase::add_disjoint_neighbor_boundary_pairs	(	const boundary_id_type	b1,
		const boundary_id_type	b2,
		const RealVectorValue &	translation
	)

inherited

Register a pair of boundaries as disjoint neighbor boundary pairs.

Definition at line 2287 of file mesh_base.C.

    {
      // Lazily allocate the container the first time it’s needed
      if (!_disjoint_neighbor_boundary_pairs)
        _disjoint_neighbor_boundary_pairs = std::make_unique<PeriodicBoundaries>();
 
      PeriodicBoundaries & db = *_disjoint_neighbor_boundary_pairs;
 
      // Create forward and inverse boundary mappings
      PeriodicBoundary forward(translation);
      PeriodicBoundary inverse(translation * -1.0);
 
      forward.myboundary       = b1;
      forward.pairedboundary   = b2;
      inverse.myboundary       = b2;
      inverse.pairedboundary   = b1;
 
      // Add both directions into the container
      db.emplace(b1, forward.clone());
      db.emplace(b2, inverse.clone());
    }

References libMesh::MeshBase::_disjoint_neighbor_boundary_pairs, libMesh::PeriodicBoundary::clone(), libMesh::PeriodicBoundaryBase::myboundary, and libMesh::PeriodicBoundaryBase::pairedboundary.

Referenced by DisjointNeighborTest::build_four_disjoint_elems(), DisjointNeighborTest::build_split_mesh_with_interface(), DisjointNeighborTest::build_two_disjoint_elems(), libMesh::CheckpointIO::read_header(), libMesh::UnstructuredMesh::stitching_helper(), DisjointNeighborTest::testDisjointNeighborConflictError(), CheckpointIOTest::testDisjointNeighborPairsCheckpoint(), and DisjointNeighborTest::testStitchCrossMesh().

◆ add_elem() [1/2]

Elem * libMesh::DistributedMesh::add_elem ( Elem * e )

finaloverridevirtualinherited

Add elem e to the end of the element array.

To add an element locally, set e->processor_id() before adding it. To ensure a specific element id, call e->set_id() before adding it; only do this in parallel if you are manually keeping ids consistent.

Users should call MeshBase::complete_preparation() after elements are added to and/or deleted from the mesh.

Implements libMesh::MeshBase.

Definition at line 594 of file distributed_mesh.C.

{
  // Don't try to add nullptrs!
  libmesh_assert(e);
 
  // Trying to add an existing element is a no-op
  if (e->valid_id() && _elements[e->id()] == e)
    return e;
 
  const processor_id_type elem_procid = e->processor_id();
 
  if (!e->valid_id())
    {
      // We should only be creating new ids past the end of the range
      // of existing ids
      libmesh_assert_greater_equal(_next_free_unpartitioned_elem_id,
                                   _max_elem_id);
      libmesh_assert_greater_equal(_next_free_local_elem_id, _max_elem_id);
 
      // Use the unpartitioned ids for unpartitioned elems, and
      // temporarily for ghost elems
      dof_id_type * next_id = &_next_free_unpartitioned_elem_id;
      if (elem_procid == this->processor_id())
        next_id = &_next_free_local_elem_id;
      e->set_id (*next_id);
    }
 
  {
    // Advance next_ids up high enough that each is pointing to an
    // unused id and any subsequent increments will still point us
    // to unused ids
    _max_elem_id = std::max(_max_elem_id,
                            static_cast<dof_id_type>(e->id()+1));
 
    if (_next_free_unpartitioned_elem_id < _max_elem_id)
      _next_free_unpartitioned_elem_id =
        ((_max_elem_id-1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->n_processors();
    if (_next_free_local_elem_id < _max_elem_id)
      _next_free_local_elem_id =
        ((_max_elem_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->processor_id();
 
#ifndef NDEBUG
    // We need a const dofobject_container so we don't inadvertently create
    // nullptr entries when testing for non-nullptr ones
    const dofobject_container<Elem> & const_elements = _elements;
#endif
    libmesh_assert(!const_elements[_next_free_unpartitioned_elem_id]);
    libmesh_assert(!const_elements[_next_free_local_elem_id]);
  }
 
  // Don't try to overwrite existing elems
  libmesh_assert (!_elements[e->id()]);
 
  _elements[e->id()] = e;
 
  // We actually added a new element.  Some of our caches might still
  // be valid, but we should clear the ones which definitely are not.
  this->clear_point_locator();
  this->clear_stored_ranges();
 
  // Try to make the cached elem data more accurate
  if (elem_procid == this->processor_id() ||
      elem_procid == DofObject::invalid_processor_id)
    _n_elem++;
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  if (!e->valid_unique_id())
    {
      if (processor_id() == e->processor_id())
        {
          e->set_unique_id(_next_unique_id);
          _next_unique_id += this->n_processors() + 1;
        }
      else
        {
          e->set_unique_id(_next_unpartitioned_unique_id);
          _next_unpartitioned_unique_id += this->n_processors() + 1;
        }
    }
  else
    {
      _next_unique_id = std::max(_next_unique_id, e->unique_id()+1);
      _next_unique_id =
        ((_next_unique_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->processor_id();
    }
#endif
 
  // Unpartitioned elems should be added on every processor
  // And shouldn't be added in the same batch as ghost elems
  // But we might be just adding on processor 0 to
  // broadcast later
  // #ifdef DEBUG
  //   if (elem_procid == DofObject::invalid_processor_id)
  //     {
  //       dof_id_type elem_id = e->id();
  //       this->comm().max(elem_id);
  //       libmesh_assert_equal_to (elem_id, e->id());
  //     }
  // #endif
 
  // Make sure any new element is given space for any extra integers
  // we've requested
  e->add_extra_integers(_elem_integer_names.size(),
                        _elem_integer_default_values);
 
  // And set mapping type and data on any new element
  e->set_mapping_type(this->default_mapping_type());
  e->set_mapping_data(this->default_mapping_data());
 
  return e;
}

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::add_extra_ghost_elem(), DisjointNeighborTest::testDisjointNeighborConflictError(), and DisjointNeighborTest::testStitchCrossMesh().

◆ add_elem() [2/2]

Elem * libMesh::DistributedMesh::add_elem ( std::unique_ptr< Elem > e )

finaloverridevirtualinherited

Version of add_elem() taking a std::unique_ptr by value.

The version taking a dumb pointer will eventually be deprecated in favor of this version. This API is intended to indicate that ownership of the Elem is transferred to the Mesh when this function is called, and it should play more nicely with the Elem::build() API which has always returned a std::unique_ptr.

Implements libMesh::MeshBase.

Definition at line 711 of file distributed_mesh.C.

{
  // The mesh now takes ownership of the Elem. Eventually the guts of
  // add_elem() will get moved to a private helper function, and
  // calling add_elem() directly will be deprecated.
  return add_elem(e.release());
}

References libMesh::DistributedMesh::add_elem().

◆ add_elem_data()

template<typename T >

std::vector< unsigned int > libMesh::MeshBase::add_elem_data	(	const std::vector< std::string > &	names,
		bool	allocate_data = `true`,
		const std::vector< T > *	default_values = `nullptr`
	)

inlineinherited

Register data (of type T) to be added to each element in the mesh.

If the mesh already has elements, data is allocated in each.

Newly allocated values for the new datum with name names[i] will be initialized to default_values[i], or to meaningless memcpy output if default_values is null.

Returns: The starting index number for the new data, or for the existing data if one by the same name has already been added.

If type T is larger than dof_id_type, each datum will end up spanning multiple index values, but will be queried with the starting index number.

No type checking is done with this function! If you add data of type T, don't try to access it with a call specifying type U.

Definition at line 2725 of file mesh_base.h.

{
  libmesh_assert(!default_values || default_values->size() == names.size());
 
  std::vector<unsigned int> returnval(names.size());
 
  const std::size_t old_size = _elem_integer_names.size();
 
  for (auto i : index_range(names))
    returnval[i] =
      this->add_elem_datum<T>(names[i], false,
                              default_values ?
                              (*default_values)[i] : nullptr);
 
  if (allocate_data && old_size != _elem_integer_names.size())
    this->size_elem_extra_integers();
 
  return returnval;
}

References libMesh::MeshBase::_elem_integer_names, libMesh::index_range(), libMesh::libmesh_assert(), and libMesh::MeshBase::size_elem_extra_integers().

◆ add_elem_datum()

template<typename T >

unsigned int libMesh::MeshBase::add_elem_datum	(	const std::string &	name,
		bool	allocate_data = `true`,
		const T *	default_value = `nullptr`
	)

inlineinherited

Register a datum (of type T) to be added to each element in the mesh.

If the mesh already has elements, data by default is allocated in each of them. This may be expensive to do repeatedly; use add_elem_data instead. Alternatively, the allocate_data option can be manually set to false, but if this is done then a manual call to size_elem_extra_integers() will need to be done before the new space is usable.

Newly allocated values for the new datum will be initialized to *default_value if default_value is not null, or to meaningless memcpy output otherwise.

Returns: The index numbers for the new data, and/or for existing data if data by some of the same names has already been added.

If type T is larger than dof_id_type, its data will end up spanning multiple index values, but will be queried with the starting index number.

No type checking is done with this function! If you add data of type T, don't try to access it with a call specifying type U.

Definition at line 2701 of file mesh_base.h.

{
  const std::size_t old_size = _elem_integer_names.size();
 
  unsigned int n_more_integers = (sizeof(T)-1)/sizeof(dof_id_type);
  std::vector<dof_id_type> int_data(n_more_integers+1, DofObject::invalid_id);
  if (default_value)
    std::memcpy(int_data.data(), default_value, sizeof(T));
 
  unsigned int start_idx = this->add_elem_integer(name, false, int_data[0]);
  for (unsigned int i=0; i != n_more_integers; ++i)
    this->add_elem_integer(name+"__"+std::to_string(i), false, int_data[i+1]);
 
  if (allocate_data && old_size != _elem_integer_names.size())
    this->size_elem_extra_integers();
 
  return start_idx;
}

References libMesh::MeshBase::_elem_integer_names, libMesh::MeshBase::add_elem_integer(), libMesh::DofObject::invalid_id, and libMesh::MeshBase::size_elem_extra_integers().

Referenced by ExtraIntegersTest::build_mesh().

◆ add_elem_integer()

unsigned int libMesh::MeshBase::add_elem_integer	(	std::string	name,
		bool	allocate_data = `true`,
		dof_id_type	default_value = `DofObject::invalid_id`
	)

inherited

Register an integer datum (of type dof_id_type) to be added to each element in the mesh.

If the mesh already has elements, data by default is allocated in each of them. This may be expensive to do repeatedly; use add_elem_integers instead. Alternatively, the allocate_data option can be manually set to false, but if this is done then a manual call to size_elem_extra_integers() will need to be done before the new space is usable.

Newly allocated values for the new datum will be initialized to default_value

Returns: The index number for the new datum, or for the existing datum if one by the same name has already been added.

Definition at line 623 of file mesh_base.C.

{
  for (auto i : index_range(_elem_integer_names))
    if (_elem_integer_names[i] == name)
      {
        libmesh_assert_less(i, _elem_integer_default_values.size());
        _elem_integer_default_values[i] = default_value;
        return i;
      }
 
  libmesh_assert_equal_to(_elem_integer_names.size(),
                          _elem_integer_default_values.size());
  _elem_integer_names.push_back(std::move(name));
  _elem_integer_default_values.push_back(default_value);
  if (allocate_data)
    this->size_elem_extra_integers();
  return _elem_integer_names.size()-1;
}

References libMesh::MeshBase::_elem_integer_default_values, libMesh::MeshBase::_elem_integer_names, libMesh::index_range(), and libMesh::MeshBase::size_elem_extra_integers().

Referenced by libMesh::MeshBase::add_elem_datum(), libMesh::BoundaryInfo::add_elements(), ExtraIntegersTest::build_mesh(), ExtraIntegersTest::checkpoint_helper(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_header(), ExtraIntegersTest::test_helper(), MeshStitchTest::testMeshStitchElemsets(), and WriteElemsetData::testWriteImpl().

◆ add_elem_integers()

std::vector< unsigned int > libMesh::MeshBase::add_elem_integers	(	const std::vector< std::string > &	names,
		bool	allocate_data = `true`,
		const std::vector< dof_id_type > *	default_values = `nullptr`
	)

inherited

Register integer data (of type dof_id_type) to be added to each element in the mesh, one string name for each new integer.

If the mesh already has elements, data by default is allocated in each of them.

Newly allocated values for the new datum with name names[i] will be initialized to default_values[i], or to DofObject::invalid_id if default_values is null.

Returns: The index numbers for the new data, and/or for existing data if data by some of the same names has already been added.

Definition at line 646 of file mesh_base.C.

{
  libmesh_assert(!default_values || default_values->size() == names.size());
  libmesh_assert_equal_to(_elem_integer_names.size(), _elem_integer_default_values.size());
 
  std::unordered_map<std::string, std::size_t> name_indices;
  for (auto i : index_range(_elem_integer_names))
    name_indices[_elem_integer_names[i]] = i;
 
  std::vector<unsigned int> returnval(names.size());
 
  bool added_an_integer = false;
  for (auto i : index_range(names))
    {
      const std::string & name = names[i];
      if (const auto it = name_indices.find(name);
          it != name_indices.end())
        {
          returnval[i] = it->second;
          _elem_integer_default_values[it->second] =
            default_values ? (*default_values)[i] : DofObject::invalid_id;
        }
      else
        {
          returnval[i] = _elem_integer_names.size();
          name_indices[name] = returnval[i];
          _elem_integer_names.push_back(name);
          _elem_integer_default_values.push_back
            (default_values ? (*default_values)[i] : DofObject::invalid_id);
          added_an_integer = true;
        }
    }
 
  if (allocate_data && added_an_integer)
    this->size_elem_extra_integers();
 
  return returnval;
}

References libMesh::MeshBase::_elem_integer_default_values, libMesh::MeshBase::_elem_integer_names, libMesh::index_range(), libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), and libMesh::MeshBase::size_elem_extra_integers().

Referenced by libMesh::MeshBase::merge_extra_integer_names(), and libMesh::XdrIO::read_header().

◆ add_elemset_code()

void libMesh::MeshBase::add_elemset_code	(	dof_id_type	code,
		MeshBase::elemset_type	id_set
	)

inherited

Tabulate a user-defined "code" for elements which belong to the element sets specified in id_set.

For example, suppose that we have two elemsets A and B with the following Elem ids: Elemset A = {1, 3} Elemset B = {2, 3}

This implies the following mapping from elem id to elemset id: Elem 1 -> {A} Elem 2 -> {B} Elem 3 -> {A,B}

In this case, we would need to tabulate three different elemset codes, e.g.: 0 -> {A} 1 -> {B} 2 -> {A,B}

Also sets up the inverse mapping, so that if one knows all the element sets an Elem belongs to, one can look up the corresponding elemset code.

Definition at line 461 of file mesh_base.C.

{
  // Populate inverse map, stealing id_set's resources
  auto [it1, inserted1] = _elemset_codes_inverse_map.emplace(std::move(id_set), code);
 
  // Reference to the newly inserted (or previously existing) id_set
  const auto & inserted_id_set = it1->first;
 
  // Keep track of all elemset ids ever added for O(1) n_elemsets()
  // performance. Only need to do this if we didn't know about this
  // id_set before...
  if (inserted1)
    _all_elemset_ids.insert(inserted_id_set.begin(), inserted_id_set.end());
 
  // Take the address of the newly emplaced set to use in
  // _elemset_codes, avoid duplicating std::set storage
  auto [it2, inserted2] = _elemset_codes.emplace(code, &inserted_id_set);
 
  // Throw an error if this code already exists with a pointer to a
  // different set of ids.
  libmesh_error_msg_if(!inserted2 && it2->second != &inserted_id_set,
                       "The elemset code " << code << " already exists with a different id_set.");
}

References libMesh::MeshBase::_all_elemset_ids, libMesh::MeshBase::_elemset_codes, and libMesh::MeshBase::_elemset_codes_inverse_map.

Referenced by libMesh::MeshBase::change_elemset_code(), libMesh::ExodusII_IO::read(), libMesh::XdrIO::read_header(), libMesh::UnstructuredMesh::stitching_helper(), MeshStitchTest::testMeshStitchElemsets(), and WriteElemsetData::testWriteImpl().

◆ add_extra_ghost_elem()

void libMesh::DistributedMesh::add_extra_ghost_elem ( Elem * e )

virtualinherited

Inserts the element and adds it to a list of elements that should not get deleted or have their descendants deleted by delete_remote_elements.

This is handy for inserting otherwise off-processor elements that you want to keep track of on this processor.

Definition at line 1876 of file distributed_mesh.C.

{
  // First add the elem like normal
  add_elem(e);
 
  // Now add it to the set that won't be deleted when we call
  // delete_remote_elements()
  _extra_ghost_elems.insert(e);
}

References libMesh::DistributedMesh::_extra_ghost_elems, and libMesh::DistributedMesh::add_elem().

◆ add_ghosting_functor() [1/2]

void libMesh::MeshBase::add_ghosting_functor ( GhostingFunctor & ghosting_functor )

inherited

Adds a functor which can specify ghosting requirements for use on distributed meshes.

Multiple ghosting functors can be added; any element which is required by any functor will be ghosted.

GhostingFunctor memory must be managed by the code which calls this function; the GhostingFunctor lifetime is expected to extend until either the functor is removed or the Mesh is destructed.

Definition at line 1079 of file mesh_base.C.

{
  // We used to implicitly support duplicate inserts to std::set
#ifdef LIBMESH_ENABLE_DEPRECATED
  _ghosting_functors.erase
    (std::remove(_ghosting_functors.begin(),
                 _ghosting_functors.end(),
                 &ghosting_functor),
     _ghosting_functors.end());
#endif
 
  // We shouldn't have two copies of the same functor
  libmesh_assert(std::find(_ghosting_functors.begin(),
                           _ghosting_functors.end(),
                           &ghosting_functor) ==
                 _ghosting_functors.end());
 
  _ghosting_functors.push_back(&ghosting_functor);
}

References libMesh::MeshBase::_ghosting_functors, and libMesh::libmesh_assert().

Referenced by libMesh::MeshBase::add_ghosting_functor(), main(), libMesh::MeshBase::MeshBase(), and EquationSystemsTest::testDisableDefaultGhosting().

◆ add_ghosting_functor() [2/2]

void libMesh::MeshBase::add_ghosting_functor ( std::shared_ptr< GhostingFunctor > ghosting_functor )

inlineinherited

Adds a functor which can specify ghosting requirements for use on distributed meshes.

Multiple ghosting functors can be added; any element which is required by any functor will be ghosted.

GhostingFunctor memory when using this method is managed by the shared_ptr mechanism.

Definition at line 1456 of file mesh_base.h.

1457 { _shared_functors[ghosting_functor.get()] = ghosting_functor;

1458 this->add_ghosting_functor(*ghosting_functor); }

libMesh::MeshBase::_shared_functors

std::map< GhostingFunctor *, std::shared_ptr< GhostingFunctor > > _shared_functors

Hang on to references to any GhostingFunctor objects we were passed in shared_ptr form.

Definition mesh_base.h:2442

libMesh::MeshBase::add_ghosting_functor

void add_ghosting_functor(GhostingFunctor &ghosting_functor)

Adds a functor which can specify ghosting requirements for use on distributed meshes.

Definition mesh_base.C:1079

References libMesh::MeshBase::_shared_functors, and libMesh::MeshBase::add_ghosting_functor().

◆ add_node() [1/2]

Node * libMesh::DistributedMesh::add_node ( Node * n )

finaloverridevirtualinherited

Add Node n to the end of the vertex array.

Implements libMesh::MeshBase.

Definition at line 884 of file distributed_mesh.C.

{
  // Don't try to add nullptrs!
  libmesh_assert(n);
 
  // Trying to add an existing node is a no-op
  if (n->valid_id() && _nodes[n->id()] == n)
    return n;
 
  const processor_id_type node_procid = n->processor_id();
 
  if (!n->valid_id())
    {
      // We should only be creating new ids past the end of the range
      // of existing ids
      libmesh_assert_greater_equal(_next_free_unpartitioned_node_id,
                                   _max_node_id);
      libmesh_assert_greater_equal(_next_free_local_node_id, _max_node_id);
 
      // Use the unpartitioned ids for unpartitioned nodes,
      // and temporarily for ghost nodes
      dof_id_type * next_id = &_next_free_unpartitioned_node_id;
      if (node_procid == this->processor_id())
        next_id = &_next_free_local_node_id;
      n->set_id (*next_id);
    }
 
  {
    // Advance next_ids up high enough that each is pointing to an
    // unused id and any subsequent increments will still point us
    // to unused ids
    _max_node_id = std::max(_max_node_id,
                            static_cast<dof_id_type>(n->id()+1));
 
    if (_next_free_unpartitioned_node_id < _max_node_id)
      _next_free_unpartitioned_node_id =
        ((_max_node_id-1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->n_processors();
    if (_next_free_local_node_id < _max_node_id)
      _next_free_local_node_id =
        ((_max_node_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->processor_id();
 
#ifndef NDEBUG
    // We need a const dofobject_container so we don't inadvertently create
    // nullptr entries when testing for non-nullptr ones
    const dofobject_container<Node> & const_nodes = _nodes;
#endif
    libmesh_assert(!const_nodes[_next_free_unpartitioned_node_id]);
    libmesh_assert(!const_nodes[_next_free_local_node_id]);
  }
 
  // Don't try to overwrite existing nodes
  libmesh_assert (!_nodes[n->id()]);
 
  _nodes[n->id()] = n;
 
  // Try to make the cached node data more accurate
  if (node_procid == this->processor_id() ||
      node_procid == DofObject::invalid_processor_id)
    _n_nodes++;
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  if (!n->valid_unique_id())
    {
      if (processor_id() == n->processor_id())
        {
          n->set_unique_id(_next_unique_id);
          _next_unique_id += this->n_processors() + 1;
        }
      else
        {
          n->set_unique_id(_next_unpartitioned_unique_id);
          _next_unpartitioned_unique_id += this->n_processors() + 1;
        }
    }
  else
    {
      _next_unique_id = std::max(_next_unique_id, n->unique_id()+1);
      _next_unique_id =
        ((_next_unique_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->processor_id();
    }
#endif
 
  n->add_extra_integers(_node_integer_names.size(),
                        _node_integer_default_values);
 
  // Unpartitioned nodes should be added on every processor
  // And shouldn't be added in the same batch as ghost nodes
  // But we might be just adding on processor 0 to
  // broadcast later
  // #ifdef DEBUG
  //   if (node_procid == DofObject::invalid_processor_id)
  //     {
  //       dof_id_type node_id = n->id();
  //       this->comm().max(node_id);
  //       libmesh_assert_equal_to (node_id, n->id());
  //     }
  // #endif
 
  return n;
}

Referenced by libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::add_point(), and libMesh::DistributedMesh::own_node().

◆ add_node() [2/2]

Node * libMesh::DistributedMesh::add_node ( std::unique_ptr< Node > n )

finaloverridevirtualinherited

Version of add_node() taking a std::unique_ptr by value.

The version taking a dumb pointer will eventually be deprecated in favor of this version. This API is intended to indicate that ownership of the Node is transferred to the Mesh when this function is called, and it should play more nicely with the Node::build() API which has always returned a std::unique_ptr.

Implements libMesh::MeshBase.

Definition at line 988 of file distributed_mesh.C.

{
  // The mesh now takes ownership of the Node. Eventually the guts of
  // add_node() will get moved to a private helper function, and
  // calling add_node() directly will be deprecated.
  return add_node(n.release());
}

References libMesh::DistributedMesh::add_node().

◆ add_node_data()

template<typename T >

std::vector< unsigned int > libMesh::MeshBase::add_node_data	(	const std::vector< std::string > &	name,
		bool	allocate_data = `true`,
		const std::vector< T > *	default_values = `nullptr`
	)

inlineinherited

Register data (of type T) to be added to each node in the mesh.

If the mesh already has nodes, data by default is allocated in each.

Newly allocated values for the new datum with name names[i] will be initialized to default_values[i], or to meaningless memcpy output if default_values is null.

Returns: The starting index number for the new data, or for the existing data if one by the same name has already been added.

If type T is larger than dof_id_type, its data will end up spanning multiple index values, but will be queried with the starting index number.

No type checking is done with this function! If you add data of type T, don't try to access it with a call specifying type U.

Definition at line 2774 of file mesh_base.h.

{
  libmesh_assert(!default_values || default_values->size() == names.size());
 
  std::vector<unsigned int> returnval(names.size());
 
  const std::size_t old_size = _node_integer_names.size();
 
  for (auto i : index_range(names))
    returnval[i] =
      this->add_node_datum<T>(names[i], false,
                              default_values ?
                              (*default_values)[i] : nullptr);
 
  if (allocate_data && old_size != _node_integer_names.size())
    this->size_node_extra_integers();
 
  return returnval;
}

References libMesh::MeshBase::_node_integer_names, libMesh::index_range(), libMesh::libmesh_assert(), and libMesh::MeshBase::size_node_extra_integers().

◆ add_node_datum()

template<typename T >

unsigned int libMesh::MeshBase::add_node_datum	(	const std::string &	name,
		bool	allocate_data = `true`,
		const T *	default_value = `nullptr`
	)

inlineinherited

Register a datum (of type T) to be added to each node in the mesh.

If the mesh already has nodes, data by default is allocated in each of them. This may be expensive to do repeatedly; use add_node_data instead. Alternatively, the allocate_data option can be manually set to false, but if this is done then a manual call to size_node_extra_integers() will need to be done before the new space is usable.

Newly allocated values for the new datum will be initialized to *default_value if default_value is not null, or to meaningless memcpy output otherwise.

Returns: The starting index number for the new datum, or for the existing datum if one by the same name has already been added.

If type T is larger than dof_id_type, its data will end up spanning multiple index values, but will be queried with the starting index number.

No type checking is done with this function! If you add data of type T, don't try to access it with a call specifying type U.

Definition at line 2750 of file mesh_base.h.

{
  const std::size_t old_size = _node_integer_names.size();
 
  unsigned int n_more_integers = (sizeof(T)-1)/sizeof(dof_id_type);
  std::vector<dof_id_type> int_data(n_more_integers+1, DofObject::invalid_id);
  if (default_value)
    std::memcpy(int_data.data(), default_value, sizeof(T));
 
  unsigned int start_idx = this->add_node_integer(name, false, int_data[0]);
  for (unsigned int i=0; i != n_more_integers; ++i)
    this->add_node_integer(name+"__"+std::to_string(i), false, int_data[i+1]);
 
  if (allocate_data && old_size != _node_integer_names.size())
    this->size_node_extra_integers();
 
  return start_idx;
}

References libMesh::MeshBase::_node_integer_names, libMesh::MeshBase::add_node_integer(), libMesh::DofObject::invalid_id, and libMesh::MeshBase::size_node_extra_integers().

Referenced by libMesh::MeshTools::Modification::all_rbb(), ExtraIntegersTest::build_mesh(), libMesh::ExodusII_IO::read(), and libMesh::DynaIO::read_mesh().

◆ add_node_integer()

unsigned int libMesh::MeshBase::add_node_integer	(	std::string	name,
		bool	allocate_data = `true`,
		dof_id_type	default_value = `DofObject::invalid_id`
	)

inherited

Register an integer datum (of type dof_id_type) to be added to each node in the mesh.

If the mesh already has nodes, data by default is allocated in each of them. This may be expensive to do repeatedly; use add_node_integers instead. Alternatively, the allocate_data option can be manually set to false, but if this is done then a manual call to size_node_extra_integers() will need to be done before the new space is usable.

Newly allocated values for the new datum will be initialized to default_value

Returns: The index number for the new datum, or for the existing datum if one by the same name has already been added.

Definition at line 712 of file mesh_base.C.

{
  for (auto i : index_range(_node_integer_names))
    if (_node_integer_names[i] == name)
      {
        libmesh_assert_less(i, _node_integer_default_values.size());
        _node_integer_default_values[i] = default_value;
        return i;
      }
 
  libmesh_assert_equal_to(_node_integer_names.size(),
                          _node_integer_default_values.size());
  _node_integer_names.push_back(std::move(name));
  _node_integer_default_values.push_back(default_value);
  if (allocate_data)
    this->size_node_extra_integers();
  return _node_integer_names.size()-1;
}

References libMesh::MeshBase::_node_integer_default_values, libMesh::MeshBase::_node_integer_names, libMesh::index_range(), and libMesh::MeshBase::size_node_extra_integers().

Referenced by libMesh::MeshBase::add_node_datum(), ExtraIntegersTest::build_mesh(), ExtraIntegersTest::checkpoint_helper(), libMesh::CheckpointIO::read_header(), and ExtraIntegersTest::test_helper().

◆ add_node_integers()

std::vector< unsigned int > libMesh::MeshBase::add_node_integers	(	const std::vector< std::string > &	names,
		bool	allocate_data = `true`,
		const std::vector< dof_id_type > *	default_values = `nullptr`
	)

inherited

Register integer data (of type dof_id_type) to be added to each node in the mesh.

If the mesh already has nodes, data by default is allocated in each.

Newly allocated values for the new datum with name names[i] will be initialized to default_values[i], or to DofObject::invalid_id if default_values is null.

Returns: The index numbers for the new data, and/or for existing data if data by some of the same names has already been added.

Definition at line 735 of file mesh_base.C.

{
  libmesh_assert(!default_values || default_values->size() == names.size());
  libmesh_assert_equal_to(_node_integer_names.size(), _node_integer_default_values.size());
 
  std::unordered_map<std::string, std::size_t> name_indices;
  for (auto i : index_range(_node_integer_names))
    name_indices[_node_integer_names[i]] = i;
 
  std::vector<unsigned int> returnval(names.size());
 
  bool added_an_integer = false;
  for (auto i : index_range(names))
    {
      const std::string & name = names[i];
      if (const auto it = name_indices.find(name);
          it != name_indices.end())
        {
          returnval[i] = it->second;
          _node_integer_default_values[it->second] =
            default_values ? (*default_values)[i] : DofObject::invalid_id;
        }
      else
        {
          returnval[i] = _node_integer_names.size();
          name_indices[name] = returnval[i];
          _node_integer_names.push_back(name);
          _node_integer_default_values.push_back
            (default_values ? (*default_values)[i] : DofObject::invalid_id);
          added_an_integer = true;
        }
    }
 
  if (allocate_data && added_an_integer)
    this->size_node_extra_integers();
 
  return returnval;
}

References libMesh::MeshBase::_node_integer_default_values, libMesh::MeshBase::_node_integer_names, libMesh::index_range(), libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), and libMesh::MeshBase::size_node_extra_integers().

Referenced by libMesh::MeshBase::merge_extra_integer_names(), and libMesh::XdrIO::read_header().

◆ add_point()

Node * libMesh::DistributedMesh::add_point	(	const Point &	p,
		const dof_id_type	id = `DofObject::invalid_id`,
		const processor_id_type	proc_id = `DofObject::invalid_processor_id`
	)

finaloverridevirtualinherited

functions for adding /deleting nodes elements.

Implements libMesh::MeshBase.

Definition at line 848 of file distributed_mesh.C.

{
  Node * old_n = this->query_node_ptr(id);
 
  if (old_n)
    {
      *old_n = p;
      old_n->processor_id() = proc_id;
 
      return old_n;
    }
 
  Node * n = Node::build(p, id).release();
  n->processor_id() = proc_id;
 
  return DistributedMesh::add_node(n);
}

References libMesh::DistributedMesh::add_node(), libMesh::Node::build(), libMesh::DofObject::processor_id(), and libMesh::DistributedMesh::query_node_ptr().

Referenced by DisjointNeighborTest::testDisjointNeighborConflictError(), and DisjointNeighborTest::testStitchCrossMesh().

◆ all_complete_order()

void libMesh::MeshBase::all_complete_order ( )

virtualinherited

Calls the range-based version of this function with a range consisting of all elements in the mesh.

Definition at line 1823 of file mesh_base.C.

{
  this->all_complete_order_range(this->element_ptr_range());
}

References libMesh::MeshBase::all_complete_order_range().

Referenced by AllSecondOrderTest::allCompleteOrder(), libMesh::MeshTools::Generation::build_cube(), FEHybridOrientationTest< order, family >::build_mesh(), libMesh::MeshTetInterface::increase_tet_order(), libMesh::TriangulatorInterface::increase_triangle_order(), main(), and MeshTetTest::testNetGenTet14Curved().

◆ all_complete_order_range()

void libMesh::UnstructuredMesh::all_complete_order_range ( const SimpleRange< element_iterator > & range )

overridevirtualinherited

Converts a (conforming, non-refined) mesh with linear elements into a mesh with "complete" order elements, i.e.

elements which can store degrees of freedom on any vertex, edge, or face. For example, a mesh consisting of Tet4 or Tet10 will be converted to a mesh with Tet14 etc.

Implements libMesh::MeshBase.

Definition at line 1848 of file unstructured_mesh.C.

{
  LOG_SCOPE("all_complete_order()", "Mesh");
 
  /*
   * The maximum number of new higher-order nodes we might be adding,
   * for use when picking unique unique_id values later. This variable
   * is not used unless unique ids are enabled.
   */
  unsigned int max_new_nodes_per_elem;
 
  /*
   * for speed-up of the \p add_point() method, we
   * can reserve memory.  Guess the number of additional
   * nodes based on the element spatial dimensions and the
   * total number of nodes in the mesh as an upper bound.
   */
  switch (this->mesh_dimension())
    {
    case 1:
      /*
       * in 1D, there can only be order-increase from Edge2
       * to Edge3.  Something like 1/2 of n_nodes() have
       * to be added
       */
      max_new_nodes_per_elem = 3 - 2;
      this->reserve_nodes(static_cast<unsigned int>
                          (1.5*static_cast<double>(this->n_nodes())));
      break;
 
    case 2:
      /*
       * in 2D, we typically refine from Tri3 or Tri6 to Tri7 (2.3333
       * or 1.1667 times the nodes) but might refine from Quad4 to
       * Quad9 (2.25 times the nodes)
       */
      max_new_nodes_per_elem = 9 - 4;
      this->reserve_nodes(static_cast<unsigned int>
                          (2*static_cast<double>(this->n_nodes())));
      break;
 
 
    case 3:
      /*
       * in 3D, we typically refine from Tet10 to Tet14 (factor = 1.4)
       * but may go Hex8 to Hex27 or Tet4 to Tet14 (something  > 3).
       * Since in 3D there _are_ already quite some nodes, and since
       * we do not want to overburden the memory by a too-conservative
       * guess, use a moderate bound
       */
      max_new_nodes_per_elem = 27 - 8;
      this->reserve_nodes(static_cast<unsigned int>
                          (2.5*static_cast<double>(this->n_nodes())));
      break;
 
    default:
      // Hm?
      libmesh_error_msg("Unknown mesh dimension " << this->mesh_dimension());
    }
 
  // All the real work is done in the helper function
  all_increased_order_range(*this, range, max_new_nodes_per_elem,
    [](ElemType t) {
      return Elem::complete_order_equivalent_type(t);
    });
}

References libMesh::Elem::complete_order_equivalent_type(), libMesh::MeshBase::mesh_dimension(), libMesh::MeshBase::n_nodes(), and libMesh::MeshBase::reserve_nodes().

◆ all_first_order()

void libMesh::UnstructuredMesh::all_first_order ( )

overridevirtualinherited

Converts a mesh with higher-order elements into a mesh with linear elements.

For example, a mesh consisting of Tet10 will be converted to a mesh with Tet4 etc.

Prepare to identify (and then delete) a bunch of no-longer-used nodes.

If the second order element had any boundary conditions they should be transferred to the first-order element. The old boundary conditions will be removed from the BoundaryInfo data structure by insert_elem.

Implements libMesh::MeshBase.

Definition at line 1646 of file unstructured_mesh.C.

{
  LOG_SCOPE("all_first_order()", "Mesh");
 
  std::vector<bool> node_touched_by_me(this->max_node_id(), false);
 
  // Loop over the high-ordered elements.
  // First make sure they _are_ indeed high-order, and then replace
  // them with an equivalent first-order element.
  for (auto & so_elem : element_ptr_range())
    {
      libmesh_assert(so_elem);
 
      /*
       * build the first-order equivalent, add to
       * the new_elements list.
       */
      auto lo_elem = Elem::build
        (Elem::first_order_equivalent_type
         (so_elem->type()), so_elem->parent());
 
      const unsigned short n_sides = so_elem->n_sides();
 
      for (unsigned short s=0; s != n_sides; ++s)
        if (so_elem->neighbor_ptr(s) == remote_elem)
          lo_elem->set_neighbor(s, const_cast<RemoteElem *>(remote_elem));
 
#ifdef LIBMESH_ENABLE_AMR
      /*
       * Reset the parent links of any child elements
       */
      if (so_elem->has_children())
        for (unsigned int c = 0, nc = so_elem->n_children(); c != nc; ++c)
          {
            Elem * child = so_elem->child_ptr(c);
            if (child != remote_elem)
              child->set_parent(lo_elem.get());
            lo_elem->add_child(child, c);
          }
 
      /*
       * Reset the child link of any parent element
       */
      if (so_elem->parent())
        {
          unsigned int c =
            so_elem->parent()->which_child_am_i(so_elem);
          lo_elem->parent()->replace_child(lo_elem.get(), c);
        }
 
      /*
       * Copy as much data to the new element as makes sense
       */
      lo_elem->set_p_level(so_elem->p_level());
      lo_elem->set_refinement_flag(so_elem->refinement_flag());
      lo_elem->set_p_refinement_flag(so_elem->p_refinement_flag());
#endif
 
      libmesh_assert_equal_to (lo_elem->n_vertices(), so_elem->n_vertices());
 
      /*
       * By definition the vertices of the linear and
       * second order element are identically numbered.
       * transfer these.
       */
      for (unsigned int v=0, snv=so_elem->n_vertices(); v < snv; v++)
        {
          lo_elem->set_node(v, so_elem->node_ptr(v));
          node_touched_by_me[lo_elem->node_id(v)] = true;
        }
 
      /*
       * find_neighbors relies on remote_elem neighbor links being
       * properly maintained.
       */
      for (unsigned short s=0; s != n_sides; s++)
        {
          if (so_elem->neighbor_ptr(s) == remote_elem)
            lo_elem->set_neighbor(s, const_cast<RemoteElem*>(remote_elem));
        }
 
      this->get_boundary_info().copy_boundary_ids
        (this->get_boundary_info(), so_elem, lo_elem.get());
 
      /*
       * The new first-order element is ready.
       * Inserting it into the mesh will replace and delete
       * the second-order element.
       */
      lo_elem->set_id(so_elem->id());
#ifdef LIBMESH_ENABLE_UNIQUE_ID
      lo_elem->set_unique_id(so_elem->unique_id());
#endif
 
      const unsigned int nei = so_elem->n_extra_integers();
      lo_elem->add_extra_integers(nei);
      for (unsigned int i=0; i != nei; ++i)
        lo_elem->set_extra_integer(i, so_elem->get_extra_integer(i));
 
      lo_elem->inherit_data_from(*so_elem);
 
      this->insert_elem(std::move(lo_elem));
    }
 
  // Deleting nodes does not invalidate iterators, so this is safe.
  for (const auto & node : this->node_ptr_range())
    if (!node_touched_by_me[node->id()])
      this->delete_node(node);
 
  // If crazy people applied boundary info to non-vertices and then
  // deleted those non-vertices, we should make sure their boundary id
  // caches are correct.
  this->get_boundary_info().regenerate_id_sets();
 
  // On hanging nodes that used to also be second order nodes, we
  // might now have an invalid nodal processor_id()
  Partitioner::set_node_processor_ids(*this);
 
  // delete or renumber nodes if desired
  this->prepare_for_use();
}

References libMesh::Elem::add_child(), libMesh::DofObject::add_extra_integers(), libMesh::Elem::build(), libMesh::Elem::child_ptr(), libMesh::BoundaryInfo::copy_boundary_ids(), libMesh::MeshBase::delete_node(), libMesh::Elem::first_order_equivalent_type(), libMesh::MeshBase::get_boundary_info(), libMesh::Elem::inherit_data_from(), libMesh::MeshBase::insert_elem(), libMesh::libmesh_assert(), libMesh::MeshBase::max_node_id(), libMesh::Elem::n_vertices(), libMesh::Elem::node_id(), libMesh::Elem::parent(), libMesh::MeshBase::prepare_for_use(), libMesh::BoundaryInfo::regenerate_id_sets(), libMesh::remote_elem, libMesh::Elem::replace_child(), libMesh::DofObject::set_extra_integer(), libMesh::DofObject::set_id(), libMesh::Elem::set_neighbor(), libMesh::Elem::set_node(), libMesh::Partitioner::set_node_processor_ids(), libMesh::Elem::set_p_level(), libMesh::Elem::set_p_refinement_flag(), libMesh::Elem::set_parent(), libMesh::Elem::set_refinement_flag(), and libMesh::DofObject::set_unique_id().

◆ all_second_order()

void libMesh::MeshBase::all_second_order ( const bool full_ordered = true )

inherited

Calls the range-based version of this function with a range consisting of all elements in the mesh.

Definition at line 1818 of file mesh_base.C.

{
  this->all_second_order_range(this->element_ptr_range(), full_ordered);
}

References libMesh::MeshBase::all_second_order_range().

Referenced by AllSecondOrderTest::allSecondOrder(), libMesh::MeshTools::Generation::build_cube(), build_domain(), libMesh::MeshTetInterface::increase_tet_order(), libMesh::TriangulatorInterface::increase_triangle_order(), main(), ExtraIntegersTest::test_helper(), MeshTetTest::testNetGenQuadraticCurved(), and InfFERadialTest::testRefinement().

◆ all_second_order_range()

void libMesh::UnstructuredMesh::all_second_order_range	(	const SimpleRange< element_iterator > &	range,
		const bool	full_ordered = `true`
	)

overridevirtualinherited

Converts a (conforming, non-refined) mesh with linear elements into a mesh with second-order elements.

For example, a mesh consisting of Tet4 will be converted to a mesh with Tet10 etc.

Note: For some elements like Hex8 there exist two higher order equivalents, Hex20 and Hex27. When full_ordered is true (default), then Hex27 is built. Otherwise, Hex20 is built. The same holds obviously for Quad4, Prism6, etc.

Implements libMesh::MeshBase.

Definition at line 1780 of file unstructured_mesh.C.

{
  LOG_SCOPE("all_second_order_range()", "Mesh");
 
  /*
   * The maximum number of new second order nodes we might be adding,
   * for use when picking unique unique_id values later. This variable
   * is not used unless unique ids are enabled.
   */
  unsigned int max_new_nodes_per_elem;
 
  /*
   * For speed-up of the \p add_point() method, we
   * can reserve memory.  Guess the number of additional
   * nodes based on the element spatial dimensions and the
   * total number of nodes in the mesh as an upper bound.
   */
  switch (this->mesh_dimension())
    {
    case 1:
      /*
       * in 1D, there can only be order-increase from Edge2
       * to Edge3.  Something like 1/2 of n_nodes() have
       * to be added
       */
      max_new_nodes_per_elem = 3 - 2;
      this->reserve_nodes(static_cast<unsigned int>
                          (1.5*static_cast<double>(this->n_nodes())));
      break;
 
    case 2:
      /*
       * in 2D, either refine from Tri3 to Tri6 (double the nodes)
       * or from Quad4 to Quad8 (again, double) or Quad9 (2.25 that much)
       */
      max_new_nodes_per_elem = 9 - 4;
      this->reserve_nodes(static_cast<unsigned int>
                          (2*static_cast<double>(this->n_nodes())));
      break;
 
 
    case 3:
      /*
       * in 3D, either refine from Tet4 to Tet10 (factor = 2.5) up to
       * Hex8 to Hex27 (something  > 3).  Since in 3D there _are_ already
       * quite some nodes, and since we do not want to overburden the memory by
       * a too conservative guess, use the lower bound
       */
      max_new_nodes_per_elem = 27 - 8;
      this->reserve_nodes(static_cast<unsigned int>
                          (2.5*static_cast<double>(this->n_nodes())));
      break;
 
    default:
      // Hm?
      libmesh_error_msg("Unknown mesh dimension " << this->mesh_dimension());
    }
 
  // All the real work is done in the helper function
  all_increased_order_range(*this, range, max_new_nodes_per_elem,
    [full_ordered](ElemType t) {
      return Elem::second_order_equivalent_type(t, full_ordered);
    });
}

References libMesh::MeshBase::mesh_dimension(), libMesh::MeshBase::n_nodes(), libMesh::MeshBase::reserve_nodes(), and libMesh::Elem::second_order_equivalent_type().

◆ allgather()

void libMesh::DistributedMesh::allgather ( )

overridevirtualinherited

Gathers all elements and nodes of the mesh onto every processor.

Reimplemented from libMesh::MeshBase.

Definition at line 1896 of file distributed_mesh.C.

{
  if (_is_serial)
    return;
  MeshCommunication().allgather(*this);
  _is_serial = true;
  _is_serial_on_proc_0 = true;
 
  // Make sure our caches are up to date and our
  // DofObjects are well packed
#ifdef DEBUG
  libmesh_assert_equal_to (this->n_nodes(), this->parallel_n_nodes());
  libmesh_assert_equal_to (this->n_elem(), this->parallel_n_elem());
  const dof_id_type pmax_node_id = this->parallel_max_node_id();
  const dof_id_type pmax_elem_id = this->parallel_max_elem_id();
  libmesh_assert_equal_to (this->max_node_id(), pmax_node_id);
  libmesh_assert_equal_to (this->max_elem_id(), pmax_elem_id);
 
  // If we've disabled renumbering we can't be sure we're contiguous
  // libmesh_assert_equal_to (this->n_nodes(), this->max_node_id());
  // libmesh_assert_equal_to (this->n_elem(), this->max_elem_id());
 
  // Make sure our neighbor links are all fine
  MeshTools::libmesh_assert_valid_neighbors(*this);
 
  // Make sure our ids and flags are consistent
  this->libmesh_assert_valid_parallel_ids();
  this->libmesh_assert_valid_parallel_flags();
#endif
}

◆ allow_detect_interior_parents() [1/2]

bool libMesh::MeshBase::allow_detect_interior_parents ( ) const

inlineinherited

Definition at line 1374 of file mesh_base.h.

1374{ return !_skip_detect_interior_parents; }

libMesh::MeshBase::_skip_detect_interior_parents

bool _skip_detect_interior_parents

If this is true then we will skip detect_interior_parents in prepare_for_use.

Definition mesh_base.h:2292

References libMesh::MeshBase::_skip_detect_interior_parents.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::UnstructuredMesh::read(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ allow_detect_interior_parents() [2/2]

void libMesh::MeshBase::allow_detect_interior_parents ( bool allow )

inlineinherited

If false is passed then this mesh will no longer work to detect interior parents when being prepared for use.

Definition at line 1373 of file mesh_base.h.

1373{ _skip_detect_interior_parents = !allow; }

References libMesh::MeshBase::_skip_detect_interior_parents.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ allow_find_neighbors() [1/2]

bool libMesh::MeshBase::allow_find_neighbors ( ) const

inlineinherited

Definition at line 1367 of file mesh_base.h.

1367{ return !_skip_find_neighbors; }

libMesh::MeshBase::_skip_find_neighbors

bool _skip_find_neighbors

If this is true then we will skip find_neighbors in prepare_for_use.

Definition mesh_base.h:2287

References libMesh::MeshBase::_skip_find_neighbors.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::prepare_for_use(), libMesh::UnstructuredMesh::read(), libMesh::ReplicatedMesh::ReplicatedMesh(), and libMesh::UnstructuredMesh::stitching_helper().

◆ allow_find_neighbors() [2/2]

void libMesh::MeshBase::allow_find_neighbors ( bool allow )

inlineinherited

If false is passed then this mesh will no longer work to find element neighbors when being prepared for use.

Definition at line 1366 of file mesh_base.h.

1366{ _skip_find_neighbors = !allow; }

References libMesh::MeshBase::_skip_find_neighbors.

Referenced by libMesh::DistributedMesh::DistributedMesh(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ allow_node_and_elem_unique_id_overlap() [1/2]

bool libMesh::MeshBase::allow_node_and_elem_unique_id_overlap ( ) const

inlineinherited

Definition at line 1392 of file mesh_base.h.

1392{ return _allow_node_and_elem_unique_id_overlap; }

libMesh::MeshBase::_allow_node_and_elem_unique_id_overlap

bool _allow_node_and_elem_unique_id_overlap

The Exodus reader (and potentially other readers in the future?) now supports setting Node and Elem u...

Definition mesh_base.h:2313

References libMesh::MeshBase::_allow_node_and_elem_unique_id_overlap.

◆ allow_node_and_elem_unique_id_overlap() [2/2]

void libMesh::MeshBase::allow_node_and_elem_unique_id_overlap ( bool allow )

inlineinherited

If true is passed, then this mesh will no longer require unique_ids to be unique across the set of all DofObjects.

That is, although no two Elems (resp. Nodes) will share the same unique_id, a given Elem and Node might share the same unique_id.

Definition at line 1391 of file mesh_base.h.

1391{ _allow_node_and_elem_unique_id_overlap = allow; }

References libMesh::MeshBase::_allow_node_and_elem_unique_id_overlap.

Referenced by libMesh::MeshTools::libmesh_assert_valid_unique_ids(), and libMesh::ExodusII_IO::read().

◆ allow_remote_element_removal() [1/2]

bool libMesh::MeshBase::allow_remote_element_removal ( ) const

inlineinherited

Definition at line 1383 of file mesh_base.h.

1383{ return _allow_remote_element_removal; }

libMesh::MeshBase::_allow_remote_element_removal

bool _allow_remote_element_removal

If this is false then even on DistributedMesh remote elements will not be deleted during mesh prepara...

Definition mesh_base.h:2300

References libMesh::MeshBase::_allow_remote_element_removal.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::ReplicatedMesh::ReplicatedMesh(), and libMesh::UnstructuredMesh::stitching_helper().

◆ allow_remote_element_removal() [2/2]

void libMesh::MeshBase::allow_remote_element_removal ( bool allow )

inlineinherited

If false is passed in then this mesh will no longer have remote elements deleted when being prepared for use; i.e.

even a DistributedMesh will remain (if it is already) serialized. This may adversely affect performance and memory use.

Definition at line 1382 of file mesh_base.h.

1382{ _allow_remote_element_removal = allow; }

References libMesh::MeshBase::_allow_remote_element_removal.

Referenced by AllSecondOrderTest::allCompleteOrder(), AllSecondOrderTest::allCompleteOrderDoNothing(), AllSecondOrderTest::allSecondOrder(), AllSecondOrderTest::allSecondOrderDoNothing(), libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshSerializer::MeshSerializer(), libMesh::ReplicatedMesh::ReplicatedMesh(), ConnectedComponentsTest::testEdge(), PeriodicBCTest::testPeriodicBC(), and libMesh::MeshSerializer::~MeshSerializer().

◆ allow_renumbering() [1/2]

bool libMesh::MeshBase::allow_renumbering ( ) const

inlineinherited

Definition at line 1360 of file mesh_base.h.

1360{ return !_skip_renumber_nodes_and_elements; }

libMesh::MeshBase::_skip_renumber_nodes_and_elements

bool _skip_renumber_nodes_and_elements

If this is true then renumbering will be kept to a minimum.

Definition mesh_base.h:2282

References libMesh::MeshBase::_skip_renumber_nodes_and_elements.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::prepare_for_use(), libMesh::MeshBase::prepare_for_use(), libMesh::UnstructuredMesh::read(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ allow_renumbering() [2/2]

void libMesh::MeshBase::allow_renumbering ( bool allow )

inlineinherited

If false is passed in then this mesh will no longer be renumbered when being prepared for use.

This may slightly adversely affect performance during subsequent element access, particularly when using a distributed mesh.

Important! When allow_renumbering(false) is set, ReplicatedMesh::n_elem() and ReplicatedMesh::n_nodes() will return wrong values whenever adaptive refinement is followed by adaptive coarsening. (Uniform refinement followed by uniform coarsening is OK.) This is due to the fact that n_elem() and n_nodes() are currently O(1) functions that just return the size of the respective underlying vectors, and this size is wrong when the numbering includes "gaps" from nodes and elements that have been deleted. We plan to implement a caching mechanism in the near future that will fix this incorrect behavior.

Definition at line 1359 of file mesh_base.h.

1359{ _skip_renumber_nodes_and_elements = !allow; }

References libMesh::MeshBase::_skip_renumber_nodes_and_elements.

◆ assign()

MeshBase & libMesh::DistributedMesh::assign ( MeshBase && other_mesh )

overridevirtualinherited

Shim to call the move assignment operator for this class.

Implements libMesh::UnstructuredMesh.

Definition at line 91 of file distributed_mesh.C.

{
  *this = std::move(cast_ref<DistributedMesh&>(other_mesh));
 
  return *this;
}

Referenced by libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ cache_elem_data()

void libMesh::MeshBase::cache_elem_data ( )

inherited

Definition at line 2000 of file mesh_base.C.

{
  // This requires an inspection on every processor
  parallel_object_only();
 
  // Need to clear containers first in case all elements of a
  // particular dimension/order/subdomain have been deleted.
  _elem_dims.clear();
  _elem_default_orders.clear();
  _mesh_subdomains.clear();
  _supported_nodal_order = MAXIMUM;
 
  for (const auto & elem : this->active_element_ptr_range())
  {
    _elem_dims.insert(cast_int<unsigned char>(elem->dim()));
    _elem_default_orders.insert(elem->default_order());
    _mesh_subdomains.insert(elem->subdomain_id());
    _supported_nodal_order =
      static_cast<Order>
        (std::min(static_cast<int>(_supported_nodal_order),
                  static_cast<int>(elem->supported_nodal_order())));
  }
 
  if (!this->is_serial())
  {
    // Some different dimension/order/subdomain elements may only live
    // on other processors
    this->comm().set_union(_elem_dims);
    this->comm().set_union(_elem_default_orders);
    this->comm().min(_supported_nodal_order);
    this->comm().set_union(_mesh_subdomains);
  }
 
  // If the largest element dimension found is larger than the current
  // _spatial_dimension, increase _spatial_dimension.
  unsigned int max_dim = this->mesh_dimension();
  if (max_dim > _spatial_dimension)
    _spatial_dimension = cast_int<unsigned char>(max_dim);
 
  // _spatial_dimension may need to increase from 1->2 or 2->3 if the
  // mesh is full of 1D elements but they are not x-aligned, or the
  // mesh is full of 2D elements but they are not in the x-y plane.
  // If the mesh is x-aligned or x-y planar, we will end up checking
  // every node's coordinates and not breaking out of the loop
  // early...
  if (_spatial_dimension < LIBMESH_DIM)
    {
      for (const auto & node : this->node_ptr_range())
        {
          // Note: the exact floating point comparison is intentional,
          // we don't want to get tripped up by tolerances.
          if ((*node)(0) != 0. && _spatial_dimension < 1)
            _spatial_dimension = 1;
 
          if ((*node)(1) != 0. && _spatial_dimension < 2)
            {
              _spatial_dimension = 2;
#if LIBMESH_DIM == 2
              // If libmesh is compiled in 2D mode, this is the
              // largest spatial dimension possible so we can break
              // out.
              break;
#endif
            }
 
#if LIBMESH_DIM > 2
          if ((*node)(2) != 0.)
            {
              // Spatial dimension can't get any higher than this, so
              // we can break out.
              _spatial_dimension = 3;
              break;
            }
#endif
        }
    }
 
  _preparation.has_cached_elem_data = true;
}

References libMesh::MeshBase::_elem_default_orders, libMesh::MeshBase::_elem_dims, libMesh::MeshBase::_mesh_subdomains, libMesh::MeshBase::_preparation, libMesh::MeshBase::_spatial_dimension, libMesh::MeshBase::_supported_nodal_order, libMesh::ParallelObject::comm(), libMesh::MeshBase::Preparation::has_cached_elem_data, libMesh::MeshBase::is_serial(), libMesh::MAXIMUM, libMesh::MeshBase::mesh_dimension(), libMesh::Parallel::Communicator::min(), and libMesh::Parallel::Communicator::set_union().

Referenced by ExodusC0PolyhedronTest::build_c0polyhedron(), libMesh::MeshBase::cache_elem_dims(), libMesh::MeshBase::complete_preparation(), main(), libMesh::MeshBase::set_elem_dimensions(), libMesh::VariationalMeshSmoother::setup(), ExodusC0PolyhedronTest::test_write_and_read_mixed_poly_hex_impl(), ExodusC0PolyhedronTest::test_write_cube_header(), MeshSmootherTest::testVariationalSmoother(), and libMesh::NetGenMeshInterface::triangulate().

◆ cache_elem_dims()

void libMesh::MeshBase::cache_elem_dims ( )

inherited

Deprecated:: This method has ben replaced by cache_elem_data which caches data in addition to elem dimensions (e.g. elem subdomain ids) Search the mesh and cache the different dimensions of the elements present in the mesh. This is done in prepare_for_use(), but can be done manually by other classes after major mesh modifications.

Definition at line 1992 of file mesh_base.C.

{
  libmesh_deprecated();
 
  this->cache_elem_data();
}

References libMesh::MeshBase::cache_elem_data().

◆ change_elemset_code()

void libMesh::MeshBase::change_elemset_code	(	dof_id_type	old_code,
		dof_id_type	new_code
	)

inherited

Replace elemset code "old_code" with "new_code".

This function loops over all elements and changes the extra integer corresponding to the "elemset_code" label, and updates the _elemset_codes and _elemset_codes_inverse_map members. Does not change the elemset ids of any of the sets.

Definition at line 517 of file mesh_base.C.

{
  // Look up elemset ids for old_code
  auto it = _elemset_codes.find(old_code);
 
  // If we don't have the old_code, then do nothing. Alternatively, we
  // could throw an error since trying to change an elemset code you
  // don't have could indicate there's a problem...
  if (it == _elemset_codes.end())
    return;
 
  // Make copy of the set of elemset ids. We are not changing these,
  // only updating the elemset code it corresponds to.
  elemset_type id_set_copy = *(it->second);
 
  // Look up the corresponding entry in the inverse map. Note: we want
  // the iterator because we are going to remove it.
  auto inverse_it = _elemset_codes_inverse_map.find(id_set_copy);
  libmesh_error_msg_if(inverse_it == _elemset_codes_inverse_map.end(),
                       "Expected _elemset_codes_inverse_map entry for elemset code " << old_code);
 
  // Erase entry from inverse map
  _elemset_codes_inverse_map.erase(inverse_it);
 
  // Erase entry from forward map
  _elemset_codes.erase(it);
 
  // Add new code with original set of ids.
  this->add_elemset_code(new_code, id_set_copy);
 
  // We can't update any actual elemset codes if there is no extra integer defined for it.
  if (!this->has_elem_integer("elemset_code"))
    return;
 
  // Get index of elemset_code extra integer
  unsigned int elemset_index = this->get_elem_integer_index("elemset_code");
 
  // Loop over all elems and update code
  Threads::parallel_for
    (this->element_stored_range(),
     [elemset_index, old_code, new_code](const ElemRange & range)
     {
       for (Elem * elem : range)
         {
           dof_id_type elemset_code =
             elem->get_extra_integer(elemset_index);
 
           if (elemset_code == old_code)
             elem->set_extra_integer(elemset_index, new_code);
         }
     });
}

References libMesh::MeshBase::_elemset_codes, libMesh::MeshBase::_elemset_codes_inverse_map, libMesh::MeshBase::add_elemset_code(), libMesh::MeshBase::element_stored_range(), libMesh::MeshBase::get_elem_integer_index(), libMesh::MeshBase::has_elem_integer(), and libMesh::Threads::parallel_for().

◆ change_elemset_id()

void libMesh::MeshBase::change_elemset_id	(	elemset_id_type	old_id,
		elemset_id_type	new_id
	)

inherited

Replace elemset id "old_id" with "new_id".

Does not change any of the elemset codes, so does not need to loop over the elements themselves.

Definition at line 570 of file mesh_base.C.

{
  // Early return if we don't have old_id
  if (!_all_elemset_ids.count(old_id))
    return;
 
  // Throw an error if the new_id is already used
  libmesh_error_msg_if(_all_elemset_ids.count(new_id),
                       "Cannot change elemset id " << old_id <<
                       " to " << new_id << ", " << new_id << " already exists.");
 
  // We will build up a new version of the inverse map so we can iterate over
  // the current one without invalidating anything.
  std::map<MeshBase::elemset_type, dof_id_type> new_elemset_codes_inverse_map;
  for (const auto & [id_set, elemset_code] : _elemset_codes_inverse_map)
    {
      auto id_set_copy = id_set;
      if (id_set_copy.count(old_id))
        {
          // Remove old_id, insert new_id
          id_set_copy.erase(old_id);
          id_set_copy.insert(new_id);
        }
 
      // Store in new version of map
      new_elemset_codes_inverse_map.emplace(id_set_copy, elemset_code);
    }
 
  // Swap existing map with newly-built one
  _elemset_codes_inverse_map.swap(new_elemset_codes_inverse_map);
 
  // Reconstruct _elemset_codes map
  _elemset_codes.clear();
  for (const auto & [id_set, elemset_code] : _elemset_codes_inverse_map)
    _elemset_codes.emplace(elemset_code, &id_set);
 
  // Update _all_elemset_ids
  _all_elemset_ids.erase(old_id);
  _all_elemset_ids.insert(new_id);
}

References libMesh::MeshBase::_all_elemset_ids, libMesh::MeshBase::_elemset_codes, and libMesh::MeshBase::_elemset_codes_inverse_map.

◆ clear()

void libMesh::DistributedMesh::clear ( )

overridevirtualinherited

Clear all internal data.

Reimplemented from libMesh::MeshBase.

Definition at line 1062 of file distributed_mesh.C.

{
  // Call parent clear function
  MeshBase::clear();
 
  // Clear our elements and nodes
  // There is no need to remove them from
  // the BoundaryInfo data structure since we
  // already cleared it.
  this->DistributedMesh::clear_elems();
 
  for (auto & node : _nodes)
    delete node;
 
  _nodes.clear();
 
  // We're no longer distributed if we were before
  _is_serial = true;
  _is_serial_on_proc_0 = true;
 
  // We deleted a ton of coarse elements, but their nodes got deleted too so
  // all is copacetic.
  _deleted_coarse_elements = false;
 
  // Correct our caches
  _n_nodes = 0;
  _max_node_id = 0;
  _next_free_local_node_id = this->processor_id();
  _next_free_unpartitioned_node_id = this->n_processors();
}

Referenced by libMesh::DistributedMesh::~DistributedMesh().

◆ clear_elems()

void libMesh::DistributedMesh::clear_elems ( )

overridevirtualinherited

Clear internal Elem data.

Implements libMesh::MeshBase.

Definition at line 1095 of file distributed_mesh.C.

{
  for (auto & elem : _elements)
    delete elem;
 
  _elements.clear();
 
  // Correct our caches
  _n_elem = 0;
  _max_elem_id = 0;
  _next_free_local_elem_id = this->processor_id();
  _next_free_unpartitioned_elem_id = this->n_processors();
}

References libMesh::DistributedMesh::_elements, libMesh::DistributedMesh::_max_elem_id, libMesh::DistributedMesh::_n_elem, libMesh::DistributedMesh::_next_free_local_elem_id, libMesh::DistributedMesh::_next_free_unpartitioned_elem_id, libMesh::ParallelObject::n_processors(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::DistributedMesh::clear().

◆ clear_extra_ghost_elems() [1/2]

virtual void libMesh::DistributedMesh::clear_extra_ghost_elems ( )

inlinevirtualinherited

Clears extra ghost elements.

Definition at line 257 of file distributed_mesh.h.

257{ _extra_ghost_elems.clear(); }

References libMesh::DistributedMesh::_extra_ghost_elems.

◆ clear_extra_ghost_elems() [2/2]

void libMesh::DistributedMesh::clear_extra_ghost_elems ( const std::set< Elem * > & extra_ghost_elems )

virtualinherited

Clears specified extra ghost elements.

Definition at line 1887 of file distributed_mesh.C.

{
  std::set<Elem *> tmp;
  std::set_difference(_extra_ghost_elems.begin(), _extra_ghost_elems.end(),
                      extra_ghost_elems.begin(), extra_ghost_elems.end(),
                      std::inserter(tmp, tmp.begin()));
  _extra_ghost_elems = tmp;
}

References libMesh::DistributedMesh::_extra_ghost_elems, and libMesh::DistributedMesh::extra_ghost_elems().

◆ clear_point_locator()

void libMesh::MeshBase::clear_point_locator ( )

inherited

Releases the current PointLocator object.

Definition at line 1881 of file mesh_base.C.

{
  _point_locator.reset(nullptr);
}

References libMesh::MeshBase::_point_locator.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), libMesh::MeshBase::clear(), libMesh::UnstructuredMesh::contract(), libMesh::DistributedMesh::delete_elem(), libMesh::ReplicatedMesh::delete_elem(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::MeshTools::Modification::distort(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::MeshTools::Modification::interpolate_surface(), libMesh::MeshBase::prepare_for_use(), libMesh::MeshTools::Modification::redistribute(), libMesh::MeshTools::Modification::rotate(), libMesh::MeshTools::Modification::scale(), libMesh::MeshTools::Modification::smooth(), libMesh::MeshTools::Modification::translate(), and libMesh::MeshBase::unset_is_prepared().

◆ clear_stored_ranges()

void libMesh::MeshBase::clear_stored_ranges ( )

inherited

Clears stored ranges, to indicate that the mesh has changed and they should be regenerated when next needed.

Definition at line 1984 of file mesh_base.C.

{
  _element_stored_range.reset(nullptr);
  _const_active_local_element_stored_range.reset(nullptr);
}

References libMesh::MeshBase::_const_active_local_element_stored_range, and libMesh::MeshBase::_element_stored_range.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), libMesh::MeshBase::clear(), libMesh::DistributedMesh::delete_elem(), libMesh::ReplicatedMesh::delete_elem(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::MeshBase::prepare_for_use(), libMesh::DistributedMesh::renumber_elem(), libMesh::ReplicatedMesh::renumber_elem(), and libMesh::MeshBase::unset_is_prepared().

◆ clone()

virtual std::unique_ptr< MeshBase > libMesh::ParallelMesh::clone ( ) const

inlineoverridevirtual

Virtual copy-constructor, creates a copy of this mesh.

Reimplemented from libMesh::DistributedMesh.

Definition at line 44 of file parallel_mesh.h.

45 { return std::make_unique<ParallelMesh>(*this); }

◆ comm()

const Parallel::Communicator & libMesh::ParallelObject::comm ( ) const

inlineinherited

Returns: A reference to the Parallel::Communicator object used by this mesh.

Definition at line 97 of file parallel_object.h.

98 { return _communicator; }

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition parallel_object.h:120

References libMesh::ParallelObject::_communicator.

◆ complete_preparation()

void libMesh::MeshBase::complete_preparation ( )

inherited

Definition at line 874 of file mesh_base.C.

{
  LOG_SCOPE("complete_preparation()", "MeshBase");
 
  parallel_object_only();
 
  libmesh_assert(this->comm().verify(this->is_serial()));
 
  // If we don't go into this method with valid constraint rows, we're
  // only going to be able to make that worse.
#ifdef DEBUG
  MeshTools::libmesh_assert_valid_constraint_rows(*this);
#endif
 
  // A distributed mesh may have processors with no elements (or
  // processors with no elements of higher dimension, if we ever
  // support mixed-dimension meshes), but we want consistent
  // mesh_dimension anyways.
  //
  // cache_elem_data() should get the elem_dimensions() and
  // mesh_dimension() correct later, and we don't need it earlier.
 
 
  // Renumber the nodes and elements so that they in contiguous
  // blocks.  By default, _skip_renumber_nodes_and_elements is false.
  //
  // Instances where you if prepare_for_use() should not renumber the nodes
  // and elements include reading in e.g. an xda/r or gmv file. In
  // this case, the ordering of the nodes may depend on an accompanying
  // solution, and the node ordering cannot be changed.
 
 
  // Mesh modification operations might not leave us with consistent
  // id counts, or might leave us with orphaned nodes we're no longer
  // using, but our partitioner might need that consistency and/or
  // might be confused by orphaned nodes.
  if (!_skip_renumber_nodes_and_elements)
    {
      if (!_preparation.has_removed_orphaned_nodes ||
          !_preparation.has_synched_id_counts)
        this->renumber_nodes_and_elements();
    }
  else
    {
      if (!_preparation.has_removed_orphaned_nodes)
        this->remove_orphaned_nodes();
      if (!_preparation.has_synched_id_counts)
        this->update_parallel_id_counts();
    }
 
  // Let all the elements find their neighbors
  if (!_skip_find_neighbors && !_preparation.has_neighbor_ptrs)
    this->find_neighbors();
 
  // The user may have set boundary conditions.  We require that the
  // boundary conditions were set consistently.  Because we examine
  // neighbors when evaluating non-raw boundary condition IDs, this
  // assert is only valid when our neighbor links are in place.
#ifdef DEBUG
  MeshTools::libmesh_assert_valid_boundary_ids(*this);
#endif
 
  // Search the mesh for all the dimensions of the elements
  // and cache them.
  if (!_preparation.has_cached_elem_data)
    this->cache_elem_data();
 
  // libMesh expects every processor to know about every subdomain
  // name, but distributed mesh generators may only have set names for
  // the part of the mesh they know about, so make sure the map is
  // consistent everywhere.
  if (!_preparation.has_synched_subdomain_name_map)
    this->sync_subdomain_name_map();
 
  // Search the mesh for elements that have a neighboring element
  // of dim+1 and set that element as the interior parent
  if (!_preparation.has_interior_parent_ptrs)
    {
      if (!_skip_detect_interior_parents)
        this->detect_interior_parents();
      else
        {
          // We must set the flag that says "interior parent pointers have been set up"
          // even though we skip detect_interior_parents().
          _preparation.has_interior_parent_ptrs = true;
        }
    }
 
  // Fix up node unique ids in case mesh generation code didn't take
  // exceptional care to do so.
  //  MeshCommunication().make_node_unique_ids_parallel_consistent(*this);
 
  // We're going to still require that mesh generation code gets
  // element unique ids consistent.
#if defined(DEBUG) && defined(LIBMESH_ENABLE_UNIQUE_ID)
  MeshTools::libmesh_assert_valid_unique_ids(*this);
#endif
 
  // Allow our GhostingFunctor objects to reinit if necessary.
  // Do this before partitioning and redistributing, and before
  // deleting remote elements.
  if (!_preparation.has_reinit_ghosting_functors)
    this->reinit_ghosting_functors();
 
  // Partition the mesh unless *all* partitioning is to be skipped.
  // If only noncritical partitioning is to be skipped, the
  // partition() call will still check for orphaned nodes.
  if (!skip_partitioning() && !_preparation.is_partitioned)
    this->partition();
  else if (!this->n_unpartitioned_elem() &&
           !this->n_unpartitioned_nodes())
    _preparation.is_partitioned = true;
 
  // If we're using DistributedMesh, we'll probably want it
  // parallelized.
  if (this->_allow_remote_element_removal &&
      !_preparation.has_removed_remote_elements)
    this->delete_remote_elements();
  else
    _preparation.has_removed_remote_elements = true;
 
  // Much of our boundary info may have been for now-remote parts of the mesh,
  // in which case we don't want to keep local copies of data meant to be
  // local. On the other hand we may have deleted, or the user may have added in
  // a distributed fashion, boundary data that is meant to be global. So we
  // handle both of those scenarios here
  if (!_preparation.has_boundary_id_sets)
    this->get_boundary_info().regenerate_id_sets();
 
  if (!_skip_renumber_nodes_and_elements)
    this->renumber_nodes_and_elements();
 
  // The mesh is now prepared for use, with the possible exception of
  // partitioning that was supposed to be skipped, and it should know
  // it.
#ifndef NDEBUG
  Preparation completed_preparation = _preparation;
  if (skip_partitioning())
    completed_preparation.is_partitioned = true;
  libmesh_assert(completed_preparation);
#endif
 
#ifdef DEBUG
  MeshTools::libmesh_assert_valid_boundary_ids(*this);
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  MeshTools::libmesh_assert_valid_unique_ids(*this);
#endif
#endif
}

Referenced by main(), libMesh::MeshBase::prepare_for_use(), BoundaryMeshSubdomainTest::testDefaultSubdomain(), MeshBaseTest::testMeshBaseVerifyHasCachedElemData(), MeshBaseTest::testMeshBaseVerifyHasNeighborPtrs(), MeshBaseTest::testMeshBaseVerifyRemovalPreparation(), BoundaryMeshSubdomainTest::testPerBoundarySubdomain(), and BoundaryMeshSubdomainTest::testSingleSubdomain().

◆ contract()

bool libMesh::UnstructuredMesh::contract ( )

overridevirtualinherited

Delete subactive (i.e.

children of coarsened) elements. This removes all elements descended from currently active elements in the mesh.

Implements libMesh::MeshBase.

Definition at line 1583 of file unstructured_mesh.C.

{
  LOG_SCOPE ("contract()", "Mesh");
 
  // Flag indicating if this call actually changes the mesh
  bool mesh_changed = false;
 
#ifdef DEBUG
  for (const auto & elem : this->element_ptr_range())
    libmesh_assert(elem->active() || elem->subactive() || elem->ancestor());
#endif
 
  // Loop over the elements.
  for (auto & elem : this->element_ptr_range())
    {
      // Delete all the subactive ones
      if (elem->subactive())
        {
          // No level-0 element should be subactive.
          // Note that we CAN'T test elem->level(), as that
          // touches elem->parent()->dim(), and elem->parent()
          // might have already been deleted!
          libmesh_assert(elem->parent());
 
          // Delete the element
          // This just sets a pointer to nullptr, and doesn't
          // invalidate any iterators
          this->delete_elem(elem);
 
          // the mesh has certainly changed
          mesh_changed = true;
        }
      else
        {
          // Compress all the active ones
          if (elem->active())
            elem->contract();
          else
            libmesh_assert (elem->ancestor());
        }
    }
 
  // Strip any newly-created nullptr voids out of the element array
  this->renumber_nodes_and_elements();
 
  // FIXME: Need to understand why deleting subactive children
  // invalidates the point locator.  For now we will clear it explicitly
  this->clear_point_locator();
 
  // Allow our GhostingFunctor objects to reinit if necessary.
  for (auto & gf : as_range(this->ghosting_functors_begin(),
                            this->ghosting_functors_end()))
    {
      libmesh_assert(gf);
      gf->mesh_reinit();
    }
 
  return mesh_changed;
}

References libMesh::as_range(), libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::delete_elem(), libMesh::MeshBase::ghosting_functors_begin(), libMesh::MeshBase::ghosting_functors_end(), libMesh::libmesh_assert(), and libMesh::MeshBase::renumber_nodes_and_elements().

◆ copy_cached_data()

void libMesh::MeshBase::copy_cached_data ( const MeshBase & other_mesh )

protectedinherited

Helper class to copy cached data, to synchronize with a possibly unprepared other_mesh.

Definition at line 2447 of file mesh_base.C.

{
  this->_spatial_dimension = other_mesh._spatial_dimension;
  this->_elem_dims = other_mesh._elem_dims;
  this->_elem_default_orders = other_mesh._elem_default_orders;
  this->_supported_nodal_order = other_mesh._supported_nodal_order;
  this->_mesh_subdomains = other_mesh._mesh_subdomains;
}

References libMesh::MeshBase::_elem_default_orders, libMesh::MeshBase::_elem_dims, libMesh::MeshBase::_mesh_subdomains, libMesh::MeshBase::_spatial_dimension, and libMesh::MeshBase::_supported_nodal_order.

◆ copy_constraint_rows() [1/2]

void libMesh::MeshBase::copy_constraint_rows ( const MeshBase & other_mesh )

inherited

Copy the constraints from the other mesh to this mesh.

Definition at line 2506 of file mesh_base.C.

{
  LOG_SCOPE("copy_constraint_rows(mesh)", "MeshBase");
 
  _n_constraint_rows = other_mesh._n_constraint_rows;
 
  _constraint_rows.clear();
 
  const auto & other_constraint_rows = other_mesh.get_constraint_rows();
  for (const auto & [other_node, other_node_constraints] : other_constraint_rows)
  {
    const Node * const our_node = this->node_ptr(other_node->id());
    constraint_rows_mapped_type our_node_constraints;
    for (const auto & [other_inner_key_pair, constraint_value] : other_node_constraints)
    {
      const auto & [other_elem, local_node_id] = other_inner_key_pair;
      const Elem * const our_elem = this->elem_ptr(other_elem->id());
      our_node_constraints.emplace_back(std::make_pair(our_elem, local_node_id), constraint_value);
    }
    _constraint_rows[our_node] = std::move(our_node_constraints);
  }
}

References libMesh::MeshBase::_constraint_rows, libMesh::MeshBase::_n_constraint_rows, libMesh::MeshBase::elem_ptr(), libMesh::MeshBase::get_constraint_rows(), and libMesh::MeshBase::node_ptr().

Referenced by libMesh::DistributedMesh::DistributedMesh(), main(), libMesh::ReplicatedMesh::ReplicatedMesh(), ConstraintOperatorTest::test1DCoarseningNewNodes(), ConstraintOperatorTest::test1DCoarseningOperator(), ConstraintOperatorTest::testCoreform(), and ConnectedComponentsTest::testEdge().

◆ copy_constraint_rows() [2/2]

template<typename T >

void libMesh::MeshBase::copy_constraint_rows	(	const SparseMatrix< T > &	constraint_operator,
		bool	precondition_constraint_operator = `false`
	)

inherited

Copy the constraints from the given matrix to this mesh.

The constraint_operator should be an mxn matrix, where m == this->n_nodes() and the operator indexing matches the current node indexing. This may require users to disable mesh renumbering in between loading a mesh file and loading a constraint matrix which matches it.

If any "constraint" rows in the matrix are unit vectors, the node corresponding to that row index will be left unconstrained, and will be used to constrain any other nodes which have a non-zero in the column index of that unit vector.

For each matrix column index which does not correspond to an existing node, a new NodeElem will be added to the mesh on which to store the new unconstrained degree(s) of freedom.

If precondition_constraint_operator is true, then the values of those new unconstrained degrees of freedom may be scaled to improve the conditioning of typical PDE matrices integrated on constrained mesh elements.

T for the constraint_operator in this function should be Real or Number ... and the data should be Real - we just allow complex T for the sake of subclasses which have to be configured and compiled with only one runtime option.

Definition at line 2532 of file mesh_base.C.

{
  LOG_SCOPE("copy_constraint_rows(mat)", "MeshBase");
 
  this->_constraint_rows.clear();
 
  // We're not going to support doing this distributed yet; it'd be
  // pointless unless we temporarily had a linear partitioning to
  // better match the constraint operator.
  MeshSerializer serialize(*this);
 
  // Our current mesh should already reflect the desired assembly space
  libmesh_error_msg_if(this->n_nodes() != constraint_operator.m(),
                       "Constraint operator matrix with " <<
                       constraint_operator.m() <<
                       "rows does not match this mesh with " <<
                       this->n_nodes() << " nodes");
 
  // First, find what new unconstrained DoFs we need to add.  We can't
  // iterate over columns in a SparseMatrix, so we'll iterate over
  // rows and keep track of columns.
 
  // If we have nodes that will work unconstrained, keep track of
  // their node ids and corresponding column indices.
  // existing_unconstrained_nodes[column_id] = node_id
  std::map<dof_id_type, dof_id_type> existing_unconstrained_columns;
  std::set<dof_id_type> existing_unconstrained_nodes;
 
  // In case we need new nodes, keep track of their columns.
  // columns[j][k] will be the kth row index and value of column j
  typedef
    std::unordered_map<dof_id_type,
                       std::vector<std::pair<dof_id_type, Real>>>
    columns_type;
  columns_type columns(constraint_operator.n());
 
  // If we need to precondition the constraint operator (e.g.  it's an
  // unpreconditioned extraction operator for a Flex IGA matrix),
  // we'll want to keep track of the sum of each column, because we'll
  // be dividing each column by that sum (Jacobi preconditioning on
  // the right, which then leads to symmetric preconditioning on a
  // physics Jacobian).
  std::unordered_map<dof_id_type, Real> column_sums;
 
  // Work in parallel, though we'll have to sync shortly
  for (auto i : make_range(constraint_operator.row_start(),
                           constraint_operator.row_stop()))
    {
      std::vector<numeric_index_type> indices;
      std::vector<T> values;
 
      constraint_operator.get_row(i, indices, values);
      libmesh_assert_equal_to(indices.size(), values.size());
 
      if (indices.size() == 1 &&
          values[0] == T(1))
        {
          // If we have multiple simple Ui=Uj constraints, let the
          // first one be our "unconstrained" node and let the others
          // be constrained to it.
          if (existing_unconstrained_columns.find(indices[0]) !=
              existing_unconstrained_columns.end())
            {
              const auto j = indices[0];
              columns[j].emplace_back(i, 1);
            }
          else
            {
              existing_unconstrained_nodes.insert(i);
              existing_unconstrained_columns.emplace(indices[0],i);
            }
        }
      else
        for (auto jj : index_range(indices))
          {
            const auto j = indices[jj];
            const Real coef = libmesh_real(values[jj]);
            libmesh_assert_equal_to(coef, values[jj]);
            columns[j].emplace_back(i, coef);
          }
    }
 
  // Merge data from different processors' slabs of the matrix
  this->comm().set_union(existing_unconstrained_nodes);
  this->comm().set_union(existing_unconstrained_columns);
 
  std::vector<columns_type> all_columns;
  this->comm().allgather(columns, all_columns);
 
  columns.clear();
  for (auto p : index_range(all_columns))
    for (auto & [j, subcol] : all_columns[p])
      for (auto [i, v] : subcol)
        columns[j].emplace_back(i,v);
 
  // Keep track of elements on which unconstrained nodes exist, and
  // their local node indices.
  // node_to_elem_ptrs[node] = [elem_id, local_node_num]
  std::unordered_map<const Node *, std::pair<dof_id_type, unsigned int>> node_to_elem_ptrs;
 
  // Find elements attached to any existing nodes that will stay
  // unconstrained.  We'll also build a subdomain set here so we don't
  // have to assert that the mesh is already prepared before we pick a
  // new subdomain for any NodeElems we need to add.
  std::set<subdomain_id_type> subdomain_ids;
  for (const Elem * elem : this->element_ptr_range())
    {
      subdomain_ids.insert(elem->subdomain_id());
      for (auto n : make_range(elem->n_nodes()))
        {
          const Node * node = elem->node_ptr(n);
          if (existing_unconstrained_nodes.count(node->id()))
            node_to_elem_ptrs.emplace(node, std::make_pair(elem->id(), n));
        }
    }
 
  const subdomain_id_type new_sbd_id = *subdomain_ids.rbegin() + 1;
 
  for (auto j : make_range(constraint_operator.n()))
    {
      // If we already have a good node for this then we're done
      if (existing_unconstrained_columns.count(j))
        continue;
 
      // Get a half-decent spot to place a new NodeElem for
      // unconstrained DoF(s) here.  Getting a *fully*-decent spot
      // would require finding a Moore-Penrose pseudoinverse, and I'm
      // not going to do that, but scaling a transpose will at least
      // get us a little uniqueness to make visualization reasonable.
      Point newpt;
      Real total_scaling = 0;
      unsigned int total_entries = 0;
 
      // We'll get a decent initial pid choice here too, if only to
      // aid in later repartitioning.
      std::map<processor_id_type, int> pids;
 
      auto & column = columns[j];
      for (auto [i, r] : column)
        {
          Node & constrained_node = this->node_ref(i);
          const Point constrained_pt = constrained_node;
          newpt += r*constrained_pt;
          total_scaling += r;
          ++total_entries;
          ++pids[constrained_node.processor_id()];
        }
 
      if (precondition_constraint_operator)
        column_sums[j] = total_scaling;
 
      libmesh_error_msg_if
        (!total_entries,
         "Empty column " << j <<
         " found in constraint operator matrix");
 
      // If we have *cancellation* here then we can end up dividing by
      // zero; try just evenly scaling across all constrained node
      // points instead.
      if (total_scaling > TOLERANCE)
        newpt /= total_scaling;
      else
        newpt /= total_entries;
 
      Node *n = this->add_point(newpt);
      std::unique_ptr<Elem> elem = Elem::build(NODEELEM);
      elem->set_node(0, n);
      elem->subdomain_id() = new_sbd_id;
 
      Elem * added_elem = this->add_elem(std::move(elem));
      this->_elem_dims.insert(0);
      this->_elem_default_orders.insert(added_elem->default_order());
      this->_supported_nodal_order =
        static_cast<Order>
          (std::min(static_cast<int>(this->_supported_nodal_order),
                    static_cast<int>(added_elem->supported_nodal_order())));
      this->_mesh_subdomains.insert(new_sbd_id);
      node_to_elem_ptrs.emplace(n, std::make_pair(added_elem->id(), 0));
      existing_unconstrained_columns.emplace(j,n->id());
 
      // Repartition the new objects *after* adding them, so a
      // DistributedMesh doesn't get confused and think you're not
      // adding them on all processors at once.
      int n_pids = 0;
      for (auto [pid, count] : pids)
        if (count >= n_pids)
          {
            n_pids = count;
            added_elem->processor_id() = pid;
            n->processor_id() = pid;
          }
    }
 
  // Calculate constraint rows in an indexed form that's easy for us
  // to allgather
  std::unordered_map<dof_id_type,
    std::vector<std::pair<std::pair<dof_id_type, unsigned int>,Real>>>
    indexed_constraint_rows;
 
  for (auto i : make_range(constraint_operator.row_start(),
                           constraint_operator.row_stop()))
    {
      if (existing_unconstrained_nodes.count(i))
        continue;
 
      std::vector<numeric_index_type> indices;
      std::vector<T> values;
 
      constraint_operator.get_row(i, indices, values);
 
      std::vector<std::pair<std::pair<dof_id_type, unsigned int>, Real>> constraint_row;
 
      for (auto jj : index_range(indices))
        {
          const dof_id_type node_id =
            existing_unconstrained_columns[indices[jj]];
 
          Node & constraining_node = this->node_ref(node_id);
 
          libmesh_assert(node_to_elem_ptrs.count(&constraining_node));
 
          auto p = node_to_elem_ptrs[&constraining_node];
 
          Real coef = libmesh_real(values[jj]);
          libmesh_assert_equal_to(coef, values[jj]);
 
          // If we're preconditioning and we created a nodeelem then
          // we can scale the meaning of that nodeelem's value to give
          // us a better-conditioned matrix after the constraints are
          // applied.
          if (precondition_constraint_operator)
            if (auto sum_it = column_sums.find(indices[jj]);
                sum_it != column_sums.end())
              {
                const Real scaling = sum_it->second;
 
                if (scaling > TOLERANCE)
                  coef /= scaling;
              }
 
          constraint_row.emplace_back(std::make_pair(p, coef));
        }
 
      indexed_constraint_rows.emplace(i, std::move(constraint_row));
    }
 
  this->comm().set_union(indexed_constraint_rows);
 
  // Add constraint rows as mesh constraint rows
  for (auto & [node_id, indexed_row] : indexed_constraint_rows)
    {
      Node * constrained_node = this->node_ptr(node_id);
 
      constraint_rows_mapped_type constraint_row;
 
      for (auto [p, coef] : indexed_row)
        {
          const Elem * elem = this->elem_ptr(p.first);
          constraint_row.emplace_back
            (std::make_pair(std::make_pair(elem, p.second), coef));
        }
 
      this->_constraint_rows.emplace(constrained_node,
                                     std::move(constraint_row));
    }
 
  _n_constraint_rows = this->count_constraint_rows();
}

◆ copy_nodes_and_elements()

void libMesh::UnstructuredMesh::copy_nodes_and_elements	(	const MeshBase &	other_mesh,
		const bool	skip_find_neighbors = `false`,
		dof_id_type	element_id_offset = `0`,
		dof_id_type	node_id_offset = `0`,
		unique_id_type	unique_id_offset = `0`,
		std::unordered_map< subdomain_id_type, subdomain_id_type > *	id_remapping = `nullptr`,
		const bool	skip_preparation = `false`
	)

virtualinherited

Deep copy of nodes and elements from another mesh object (used by subclass copy constructors and by mesh merging operations)

This will not copy most "high level" data in the mesh; that is done separately by constructors. An exception is that, if the other_mesh has element or node extra_integer data, any names for that data which do not already exist on this mesh are added so that all such data can be copied.

If an id_remapping map is provided, then element subdomain ids in other_mesh will be converted using it before adding them to this mesh.

For backwards compatibility, this does some limited mesh preparation after the copy: everything except for renumbering, remote element removal, and partitioning. To skip just the step of that preparation which finds new neighbor_ptr links between elements, set skip_find_neighbors. To skip all of that preparation, set skip_preparation. If preparation is skipped, it is the users responsibility to set the flags indicating what preparation may still be necessary before using the mesh later.

Definition at line 648 of file unstructured_mesh.C.

{
  LOG_SCOPE("copy_nodes_and_elements()", "UnstructuredMesh");
 
  // If we're asked to skip all preparation, we should be skipping
  // find_neighbors specifically.
  libmesh_assert(!skip_preparation || skip_find_neighbors);
 
  std::pair<std::vector<unsigned int>, std::vector<unsigned int>>
    extra_int_maps = this->merge_extra_integer_names(other_mesh);
 
  const unsigned int n_old_node_ints = extra_int_maps.second.size(),
                     n_new_node_ints = _node_integer_names.size(),
                     n_old_elem_ints = extra_int_maps.first.size(),
                     n_new_elem_ints = _elem_integer_names.size();
 
  // If we are partitioned into fewer parts than the incoming mesh has
  // processors to handle, then we need to "wrap" the other Mesh's
  // processor ids to fit within our range. This can happen, for
  // example, while stitching meshes with small numbers of elements in
  // parallel...
  bool wrap_proc_ids = (this->n_processors() <
                        other_mesh.n_partitions());
 
  // We're assuming the other mesh has proper element number ordering,
  // so that we add parents before their children, and that the other
  // mesh is consistently partitioned.  We're not assuming that node
  // proc ids are topologically consistent, so we don't just
  // libmesh_assert_valid_procids.
#ifdef DEBUG
  MeshTools::libmesh_assert_valid_amr_elem_ids(other_mesh);
  MeshTools::libmesh_assert_parallel_consistent_procids<Node>(other_mesh);
#endif
 
  //Copy in Nodes
  {
    //Preallocate Memory if necessary
    this->reserve_nodes(other_mesh.n_nodes());
 
    for (const auto & oldn : other_mesh.node_ptr_range())
      {
        processor_id_type added_pid = cast_int<processor_id_type>
          (wrap_proc_ids ? oldn->processor_id() % this->n_processors() : oldn->processor_id());
 
        // Add new nodes in old node Point locations
        Node * newn =
          this->add_point(*oldn,
                          oldn->id() + node_id_offset,
                          added_pid);
 
        newn->add_extra_integers(n_new_node_ints);
        for (unsigned int i = 0; i != n_old_node_ints; ++i)
          newn->set_extra_integer(extra_int_maps.second[i],
                                  oldn->get_extra_integer(i));
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
        newn->set_unique_id(oldn->unique_id() + unique_id_offset);
#endif
      }
  }
 
  //Copy in Elements
  {
    //Preallocate Memory if necessary
    this->reserve_elem(other_mesh.n_elem());
 
    // Declare a map linking old and new elements, needed to copy the neighbor lists
    typedef std::unordered_map<const Elem *, Elem *> map_type;
    map_type old_elems_to_new_elems, ip_map;
 
    // Loop over the elements
    for (const auto & old : other_mesh.element_ptr_range())
      {
        // Build a new element
        Elem * newparent = old->parent() ?
          this->elem_ptr(old->parent()->id() + element_id_offset) :
          nullptr;
        auto el = old->disconnected_clone();
        el->set_parent(newparent);
 
        subdomain_id_type sbd_id = old->subdomain_id();
        if (id_remapping)
          {
            auto remapping_it = id_remapping->find(sbd_id);
            if (remapping_it != id_remapping->end())
              sbd_id = remapping_it->second;
          }
        el->subdomain_id() = sbd_id;
 
        // Hold off on trying to set the interior parent because we may actually
        // add lower dimensional elements before their interior parents
        if (old->interior_parent())
          ip_map[old] = el.get();
 
#ifdef LIBMESH_ENABLE_AMR
        if (old->has_children())
          for (unsigned int c = 0, nc = old->n_children(); c != nc; ++c)
            if (old->child_ptr(c) == remote_elem)
              el->add_child(const_cast<RemoteElem *>(remote_elem), c);
 
        //Create the parent's child pointers if necessary
        if (newparent)
          {
            unsigned int oldc = old->parent()->which_child_am_i(old);
            newparent->add_child(el.get(), oldc);
          }
 
        // Copy the refinement flags
        el->set_refinement_flag(old->refinement_flag());
 
        // Use hack_p_level since we may not have sibling elements
        // added yet
        el->hack_p_level(old->p_level());
 
        el->set_p_refinement_flag(old->p_refinement_flag());
#endif // #ifdef LIBMESH_ENABLE_AMR
 
        //Assign all the nodes
        for (auto i : el->node_index_range())
          el->set_node(i,
            this->node_ptr(old->node_id(i) + node_id_offset));
 
        // And start it off with the same processor id (mod _n_parts).
        el->processor_id() = cast_int<processor_id_type>
          (wrap_proc_ids ? old->processor_id() % this->n_processors() : old->processor_id());
 
        // Give it the same element and unique ids
        el->set_id(old->id() + element_id_offset);
 
        el->add_extra_integers(n_new_elem_ints);
        for (unsigned int i = 0; i != n_old_elem_ints; ++i)
          el->set_extra_integer(extra_int_maps.first[i],
                                old->get_extra_integer(i));
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
        el->set_unique_id(old->unique_id() + unique_id_offset);
#endif
 
        //Hold onto it
        if (!skip_find_neighbors)
          {
            for (auto s : old->side_index_range())
              if (old->neighbor_ptr(s) == remote_elem)
                el->set_neighbor(s, const_cast<RemoteElem *>(remote_elem));
            this->add_elem(std::move(el));
          }
        else
          {
            Elem * new_el = this->add_elem(std::move(el));
            old_elems_to_new_elems[old] = new_el;
          }
      }
 
    // If the other_mesh had some interior parents, we may need to
    // copy those pointers (if they're to elements in a third mesh),
    // or create new equivalent pointers (if they're to elements we
    // just copied), or scream and die (if the other mesh had interior
    // parents from a third mesh but we already have interior parents
    // that aren't to that same third mesh.
    if (!ip_map.empty())
      {
        std::atomic<bool> existing_interior_parents{false};
 
        Threads::parallel_for
          (this->element_stored_range(),
           [&existing_interior_parents](const ElemRange & range)
           {
             for (Elem * elem : range)
               if (elem->interior_parent())
                 {
                   existing_interior_parents = true;
                   break;
                 }
           });
 
        MeshBase * other_interior_mesh =
          const_cast<MeshBase *>(&other_mesh.interior_mesh());
 
        // If we don't already have interior parents, then we can just
        // use whatever interior_mesh we need for the incoming
        // elements.
        if (!existing_interior_parents)
          {
            if (other_interior_mesh == &other_mesh)
              this->set_interior_mesh(*this);
            else
              this->set_interior_mesh(*other_interior_mesh);
          }
 
        if (other_interior_mesh == &other_mesh &&
            _interior_mesh == this)
          for (auto & elem_pair : ip_map)
            elem_pair.second->set_interior_parent(
              this->elem_ptr(elem_pair.first->interior_parent()->id() + element_id_offset));
        else if (other_interior_mesh == _interior_mesh)
          for (auto & elem_pair : ip_map)
            {
              Elem * ip = const_cast<Elem *>(elem_pair.first->interior_parent());
              libmesh_assert(ip == remote_elem ||
                             ip == other_interior_mesh->elem_ptr(ip->id()));
              elem_pair.second->set_interior_parent(ip);
            }
        else
          libmesh_error_msg("Cannot copy boundary elements between meshes with different interior meshes");
      }
 
    // Loop (again) over the elements to fill in the neighbors
    if (skip_find_neighbors)
      {
        old_elems_to_new_elems[remote_elem] = const_cast<RemoteElem*>(remote_elem);
 
        for (const auto & old_elem : other_mesh.element_ptr_range())
          {
            Elem * new_elem = old_elems_to_new_elems[old_elem];
            for (auto s : old_elem->side_index_range())
              {
                const Elem * old_neighbor = old_elem->neighbor_ptr(s);
                Elem * new_neighbor = old_elems_to_new_elems[old_neighbor];
                new_elem->set_neighbor(s, new_neighbor);
              }
          }
      }
  }
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  // We set the unique ids of nodes after adding them to the mesh such that our value of
  // _next_unique_id may be wrong. So we amend that here
  this->set_next_unique_id(other_mesh.parallel_max_unique_id() + unique_id_offset + 1);
#endif
 
  // Finally, partially prepare the new Mesh for use, if that isn't
  // being skipped.
  // Even the default behavior here is for backwards compatibility,
  // and we don't want to prepare everything.
 
  if (!skip_preparation)
    {
      // Keep the same numbering and partitioning and distribution
      // status for now, but save our original policies to restore
      // later.
      const bool allowed_renumbering = this->allow_renumbering();
      const bool allowed_find_neighbors = this->allow_find_neighbors();
      const bool allowed_elem_removal = this->allow_remote_element_removal();
      const bool allowed_detect_detect_interior_parents = this->allow_detect_interior_parents();
      this->allow_renumbering(false);
      this->allow_remote_element_removal(false);
      this->allow_find_neighbors(!skip_find_neighbors);
      this->allow_detect_interior_parents(other_mesh.allow_detect_interior_parents());
 
      // We should generally be able to skip *all* partitioning here
      // because we're only adding one already-consistent mesh to
      // another.
      const bool skipped_partitioning = this->skip_partitioning();
      this->skip_partitioning(true);
 
      const bool was_prepared = this->is_prepared();
      this->prepare_for_use();
 
      //But in the long term, don't change our policies.
      this->allow_find_neighbors(allowed_find_neighbors);
      this->allow_renumbering(allowed_renumbering);
      this->allow_remote_element_removal(allowed_elem_removal);
      this->skip_partitioning(skipped_partitioning);
      this->allow_detect_interior_parents(allowed_detect_detect_interior_parents);
 
      // That prepare_for_use() call marked us as prepared, but we
      // specifically avoided some important preparation, so we might not
      // actually be prepared now.
      if (skip_find_neighbors ||
          !was_prepared || !other_mesh.is_prepared())
        this->unset_is_prepared();
    }
 
  // In general we've just invalidated just about everything, and we'd
  // like to unset_is_prepared(), but specific use cases might know a
  // priori that they're still partitioned well, or that they've
  // copied in a disjoint mesh component and don't need new neighbor
  // pointers, or that they're not adding anything that would change
  // cached subdomain/element/boundary sets, etc., so we'll rely on
  // users of the "advanced" skip_preparation option to also set what
  // preparation they still need.
 
  // else
    // this->unset_is_prepared();
}

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::ReplicatedMesh::ReplicatedMesh(), and libMesh::UnstructuredMesh::stitching_helper().

◆ count_constraint_rows()

dof_id_type libMesh::MeshBase::count_constraint_rows ( )

protectedinherited

Helper function for subclasses to use to set _n_constraint_rows.

Definition at line 2487 of file mesh_base.C.

{
  dof_id_type n_local_rows=0, n_unpartitioned_rows=0;
  for (const auto & [node, node_constraints] : _constraint_rows)
    {
      // Unpartitioned nodes
      if (node->processor_id() == DofObject::invalid_processor_id)
        n_unpartitioned_rows++;
      else if (node->processor_id() == this->processor_id())
        n_local_rows++;
    }
 
  this->comm().sum(n_local_rows);
 
  return n_unpartitioned_rows + n_local_rows;
}

References libMesh::MeshBase::_constraint_rows, libMesh::ParallelObject::comm(), libMesh::DofObject::invalid_processor_id, libMesh::ParallelObject::processor_id(), and libMesh::Parallel::Communicator::sum().

Referenced by libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::DistributedMesh::update_parallel_id_counts(), and libMesh::ReplicatedMesh::update_parallel_id_counts().

◆ create_pid_mesh()

void libMesh::UnstructuredMesh::create_pid_mesh	(	UnstructuredMesh &	pid_mesh,
		const processor_id_type	pid
	)		const

inherited

Generates a new mesh containing all the elements which are assigned to processor pid.

This mesh is written to the pid_mesh reference which you must create and pass to the function.

Definition at line 1471 of file unstructured_mesh.C.

{
 
  // Issue a warning if the number the number of processors
  // currently available is less that that requested for
  // partitioning.  This is not necessarily an error since
  // you may run on one processor and still partition the
  // mesh into several partitions.
#ifdef DEBUG
  if (this->n_processors() < pid)
    {
      libMesh::out << "WARNING:  You are creating a "
                   << "mesh for a processor id (="
                   << pid
                   << ") greater than "
                   << "the number of processors available for "
                   << "the calculation. (="
                   << this->n_processors()
                   << ")."
                   << std::endl;
    }
#endif
 
  this->create_submesh (pid_mesh,
                        this->active_pid_elements_begin(pid),
                        this->active_pid_elements_end(pid));
}

References libMesh::UnstructuredMesh::create_submesh(), libMesh::ParallelObject::n_processors(), and libMesh::out.

◆ create_submesh()

void libMesh::UnstructuredMesh::create_submesh	(	UnstructuredMesh &	new_mesh,
		const const_element_iterator &	it,
		const const_element_iterator &	it_end
	)		const

inherited

Constructs a mesh called "new_mesh" from the current mesh by iterating over the elements between it and it_end and adding them to the new mesh.

Definition at line 1506 of file unstructured_mesh.C.

{
  // Just in case the subdomain_mesh already has some information
  // in it, get rid of it.
  new_mesh.clear();
 
  // If we're not serial, our submesh isn't either.
  // There are no remote elements to delete on an empty mesh, but
  // calling the method to do so marks the mesh as parallel.
  if (!this->is_serial())
    new_mesh.delete_remote_elements();
 
  // Fail if (*this == new_mesh), we cannot create a submesh inside ourself!
  // This may happen if the user accidentally passes the original mesh into
  // this function!  We will check this by making sure we did not just
  // clear ourself.
  libmesh_assert_not_equal_to (this->n_nodes(), 0);
  libmesh_assert_not_equal_to (this->n_elem(), 0);
 
  // Container to catch boundary IDs handed back by BoundaryInfo
  std::vector<boundary_id_type> bc_ids;
 
  // Put any extra integers on the new mesh too
  new_mesh.merge_extra_integer_names(*this);
  const unsigned int n_node_ints = _node_integer_names.size();
 
  for (const auto & old_elem : as_range(it, it_end))
    {
      // Add an equivalent element type to the new_mesh.
      // disconnected_clone() copies ids, extra element integers, etc.
      auto uelem = old_elem->disconnected_clone();
      Elem * new_elem = new_mesh.add_elem(std::move(uelem));
      libmesh_assert(new_elem);
 
      // Loop over the nodes on this element.
      for (auto n : old_elem->node_index_range())
        {
          const dof_id_type this_node_id = old_elem->node_id(n);
 
          // Add this node to the new mesh if it's not there already
          if (!new_mesh.query_node_ptr(this_node_id))
            {
              Node * newn =
                new_mesh.add_point (old_elem->point(n),
                                    this_node_id,
                                    old_elem->node_ptr(n)->processor_id());
 
              newn->add_extra_integers(n_node_ints);
              for (unsigned int i = 0; i != n_node_ints; ++i)
                newn->set_extra_integer(i, old_elem->node_ptr(n)->get_extra_integer(i));
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
              newn->set_unique_id(old_elem->node_ptr(n)->unique_id());
#endif
            }
 
          // Define this element's connectivity on the new mesh
          new_elem->set_node(n, new_mesh.node_ptr(this_node_id));
        }
 
      // Maybe add boundary conditions for this element
      for (auto s : old_elem->side_index_range())
        {
          this->get_boundary_info().boundary_ids(old_elem, s, bc_ids);
          new_mesh.get_boundary_info().add_side (new_elem, s, bc_ids);
        }
    } // end loop over elements
 
  // Prepare the new_mesh for use
  new_mesh.prepare_for_use();
}

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

◆ DECLARE_ELEM_ITERATORS() [1/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( )

inherited

Elem and Node iterator accessor functions.

See MeshBase for documentation.

◆ DECLARE_ELEM_ITERATORS() [2/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( active_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [3/20]

processor_id_type pid unsigned int level libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	active_local_subdomain_	,
		subdomain_id_type	sid,
		sid
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [4/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( active_not_local_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [5/20]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( active_semilocal_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [6/20]

unsigned int level ElemType type libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	active_subdomain_	,
		subdomain_id_type	sid,
		sid
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [7/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	active_type_	,
		ElemType	type,
		type
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [8/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( ancestor_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [9/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( facelocal_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [10/20]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	flagged_pid_	,
		unsigned char rflag LIBMESH_COMMA processor_id_type	pid,
		rflag LIBMESH_COMMA	pid
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [11/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( local_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [12/20]

processor_id_type pid libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	local_level_	,
		unsigned int	level,
		level
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [13/20]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	multi_evaluable_	,
		std::vector< const DofMap * >	dof_maps,
		dof_maps
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [14/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( not_active_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [15/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( not_ancestor_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [16/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	not_level_	,
		unsigned int	level,
		level
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [17/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( not_local_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [18/20]

libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( not_subactive_ )

inherited

◆ DECLARE_ELEM_ITERATORS() [19/20]

unsigned int level libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS	(	pid_	,
		processor_id_type	pid,
		pid
	)

inherited

◆ DECLARE_ELEM_ITERATORS() [20/20]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss libMesh::DistributedMesh::DECLARE_ELEM_ITERATORS ( semilocal_ )

inherited

◆ DECLARE_NODE_ITERATORS() [1/3]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag libMesh::DistributedMesh::DECLARE_NODE_ITERATORS ( active_ )

inherited

◆ DECLARE_NODE_ITERATORS() [2/3]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid libMesh::DistributedMesh::DECLARE_NODE_ITERATORS	(	bid_	,
		boundary_id_type	bid,
		bid
	)

inherited

◆ DECLARE_NODE_ITERATORS() [3/3]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag libMesh::DistributedMesh::DECLARE_NODE_ITERATORS ( bnd_ )

inherited

◆ default_ghosting()

GhostingFunctor & libMesh::MeshBase::default_ghosting ( )

inlineinherited

Default ghosting functor.

Definition at line 1488 of file mesh_base.h.

1488{ return *_default_ghosting; }

libMesh::MeshBase::_default_ghosting

std::unique_ptr< GhostingFunctor > _default_ghosting

The default geometric GhostingFunctor, used to implement standard libMesh element ghosting behavior.

Definition mesh_base.h:2427

References libMesh::MeshBase::_default_ghosting.

◆ default_mapping_data()

unsigned char libMesh::MeshBase::default_mapping_data ( ) const

inlineinherited

Returns any default data value used by the master space to physical space mapping.

Definition at line 956 of file mesh_base.h.

  {
    return _default_mapping_data;
  }

References libMesh::MeshBase::_default_mapping_data.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), MeshInputTest::helperTestingDynaQuad(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::VTKIO::nodes_to_vtk(), AllRBBTest::test_box(), and MeshInputTest::testDynaReadPatch().

◆ default_mapping_type()

ElemMappingType libMesh::MeshBase::default_mapping_type ( ) const

inlineinherited

Returns the default master space to physical space mapping basis functions to be used on newly added elements.

Definition at line 938 of file mesh_base.h.

  {
    return _default_mapping_type;
  }

References libMesh::MeshBase::_default_mapping_type.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), libMesh::VTKIO::cells_to_vtk(), MeshInputTest::helperTestingDynaQuad(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::VTKIO::nodes_to_vtk(), libMesh::VTKIO::read(), MeshInputTest::testDynaFileMappings(), MeshInputTest::testDynaReadPatch(), and MeshInputTest::testExodusFileMappings().

◆ delete_elem()

void libMesh::DistributedMesh::delete_elem ( Elem * e )

finaloverridevirtualinherited

Removes element e from the mesh.

This method must be implemented in derived classes in such a way that it does not invalidate element iterators. Users should call MeshBase::complete_preparation() after elements are added to and/or deleted from the mesh.

Note: Calling this method may produce isolated nodes, i.e. nodes not connected to any element.

Implements libMesh::MeshBase.

Definition at line 783 of file distributed_mesh.C.

{
  libmesh_assert (e);
 
  // Try to make the cached elem data more accurate
  _n_elem--;
 
  // Was this a coarse element, not just a coarsening where we still
  // have some ancestor structure?  Was it a *local* element, that we
  // might have been depending on as an owner of local nodes?  We'll
  // have to be more careful with our nodes in contract() later; no
  // telling if we just locally orphaned a node that should be
  // globally retained.
  if (e->processor_id() == this->processor_id() &&
      !e->parent())
    _deleted_coarse_elements = true;
 
  // Delete the element from the BoundaryInfo object
  this->get_boundary_info().remove(e);
 
  // But not yet from the container; we might invalidate
  // an iterator that way!
 
  //_elements.erase(e->id());
 
  // Instead, we set it to nullptr for now
 
  _elements[e->id()] = nullptr;
 
  // delete the element
  delete e;
 
  // Some of our caches might still be valid, but we should clear the
  // ones which definitely are not.
  this->clear_point_locator();
  this->clear_stored_ranges();
}

References libMesh::DistributedMesh::_deleted_coarse_elements, libMesh::DistributedMesh::_elements, libMesh::DistributedMesh::_n_elem, libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::clear_stored_ranges(), libMesh::MeshBase::get_boundary_info(), libMesh::DofObject::id(), libMesh::libmesh_assert(), libMesh::Elem::parent(), libMesh::DofObject::processor_id(), and libMesh::BoundaryInfo::remove().

Referenced by libMesh::DistributedMesh::insert_elem().

◆ delete_node()

void libMesh::DistributedMesh::delete_node ( Node * n )

finaloverridevirtualinherited

Removes the Node n from the mesh.

Implements libMesh::MeshBase.

Definition at line 996 of file distributed_mesh.C.

{
  libmesh_assert(n);
  libmesh_assert(_nodes[n->id()]);
 
  // Try to make the cached elem data more accurate
  _n_nodes--;
 
  // Delete the node from the BoundaryInfo object
  this->get_boundary_info().remove(n);
  _constraint_rows.erase(n);
 
  // But not yet from the container; we might invalidate
  // an iterator that way!
 
  //_nodes.erase(n->id());
 
  // Instead, we set it to nullptr for now
 
  _nodes[n->id()] = nullptr;
 
  // delete the node
  delete n;
}

References libMesh::MeshBase::_constraint_rows, libMesh::DistributedMesh::_n_nodes, libMesh::DistributedMesh::_nodes, libMesh::MeshBase::get_boundary_info(), libMesh::DofObject::id(), libMesh::libmesh_assert(), and libMesh::BoundaryInfo::remove().

◆ delete_remote_elements()

void libMesh::DistributedMesh::delete_remote_elements ( )

overridevirtualinherited

Deletes all nonlocal elements of the mesh except for "ghosts" which touch a local element, and deletes all nodes which are not part of a local or ghost element.

Reimplemented from libMesh::MeshBase.

Definition at line 1800 of file distributed_mesh.C.

{
#ifdef DEBUG
  // Make sure our neighbor links are all fine
  MeshTools::libmesh_assert_valid_neighbors(*this);
 
  // And our child/parent links, and our flags
  MeshTools::libmesh_assert_valid_refinement_tree(*this);
 
  // Make sure our ids and flags are consistent
  this->libmesh_assert_valid_parallel_ids();
  this->libmesh_assert_valid_parallel_flags();
 
  libmesh_assert_equal_to (this->n_nodes(), this->parallel_n_nodes());
  libmesh_assert_equal_to (this->n_elem(), this->parallel_n_elem());
  const dof_id_type pmax_node_id = this->parallel_max_node_id();
  const dof_id_type pmax_elem_id = this->parallel_max_elem_id();
  libmesh_assert_equal_to (this->max_node_id(), pmax_node_id);
  libmesh_assert_equal_to (this->max_elem_id(), pmax_elem_id);
#endif
 
  _is_serial = false;
  _is_serial_on_proc_0 = false;
 
  MeshCommunication().delete_remote_elements(*this, _extra_ghost_elems);
 
  libmesh_assert_equal_to (this->max_elem_id(), this->parallel_max_elem_id());
 
  // Now make sure the containers actually shrink - strip
  // any newly-created nullptr voids out of the element array
  dofobject_container<Elem>::veclike_iterator e_it        = _elements.begin();
  const dofobject_container<Elem>::veclike_iterator e_end = _elements.end();
  while (e_it != e_end)
    if (!*e_it)
      e_it = _elements.erase(e_it);
    else
      ++e_it;
 
  dofobject_container<Node>::veclike_iterator n_it        = _nodes.begin();
  const dofobject_container<Node>::veclike_iterator n_end = _nodes.end();
  while (n_it != n_end)
    if (!*n_it)
      n_it = _nodes.erase(n_it);
    else
      ++n_it;
 
  // We may have deleted no-longer-connected nodes or coarsened-away
  // elements; let's update our caches.
  this->update_parallel_id_counts();
 
  // We may have deleted nodes or elements that were the only local
  // representatives of some particular boundary id(s); let's update
  // those caches.
  this->get_boundary_info().regenerate_id_sets();
 
#ifdef DEBUG
  // We might not have well-packed objects if the user didn't allow us
  // to renumber
  // libmesh_assert_equal_to (this->n_nodes(), this->max_node_id());
  // libmesh_assert_equal_to (this->n_elem(), this->max_elem_id());
 
  // Make sure our neighbor links are all fine
  MeshTools::libmesh_assert_valid_neighbors(*this);
 
  // And our child/parent links, and our flags
  MeshTools::libmesh_assert_valid_refinement_tree(*this);
 
  // Make sure our ids and flags are consistent
  this->libmesh_assert_valid_parallel_ids();
  this->libmesh_assert_valid_parallel_flags();
#endif
 
  this->_preparation.has_removed_remote_elements = true;
}

◆ detect_interior_parents()

void libMesh::MeshBase::detect_interior_parents ( )

inherited

Search the mesh for elements that have a neighboring element of dim+1 and set that element as the interior parent.

Definition at line 2092 of file mesh_base.C.

{
  LOG_SCOPE("detect_interior_parents()", "MeshBase");
 
  // This requires an inspection on every processor
  parallel_object_only();
 
  // This requires up-to-date mesh dimensions, but if we don't have
  // them cached then we can't update them without changing the mesh
  // in unexpected ways that interfere with our tests of
  // partially-prepared meshes in MeshTools::*valid_is_prepared
  std::set<unsigned char> elem_dims_copy;
  if (_preparation.has_cached_elem_data)
    elem_dims_copy = this->elem_dimensions();
  else
    {
      for (const auto & elem : this->active_element_ptr_range())
        elem_dims_copy.insert(cast_int<unsigned char>(elem->dim()));
      if (!this->is_serial())
        this->comm().set_union(elem_dims_copy);
    }
 
  // Early return if the mesh is empty or has elements of a single spatial dimension.
  if (elem_dims_copy.size() <= 1)
    {
      _preparation.has_interior_parent_ptrs = true;
      return;
    }
 
  // Convenient elem_dimensions iterators
  const auto dim_start = elem_dims_copy.begin();
  const auto dim_end = elem_dims_copy.end();
 
  // In this function we find only +1 dimensional interior parents,
  // (so, for a given element el, the interior parent p must satisfy p.dim() == el.dim() + 1).
  // Therefore, we can avoid checking the existence of interior parents
  // for all those elements el such there there is no p with p.dim() == el.dim() + 1.
  // We store whether to skip any given dimension in the construction of interior parents
  // inside the vector in dimensions_to_skip_for_interior_parents.
  std::vector<bool> skip_dimension_for_interior_parents(/*count=*/LIBMESH_DIM+1, /*value=*/false);
  skip_dimension_for_interior_parents.back() = true;
 
  // Moreover, in the following, we will build a node-to-elem map.
  // It is among the elems of this map that we will look for interior parents.
  // Therefore, we can skip all elems p such that there is no el with el.dim() == p.dim() - 1.
  // We store whether to skip any given dimension in the construction of the node-to-elem map
  // in the vector skip_dimensions_for_node_to_el_map.
  std::vector<bool> skip_dimensions_for_node_to_el_map(/*count=*/LIBMESH_DIM+1, /*value=*/false);
  skip_dimensions_for_node_to_el_map[*dim_start] = true;
 
  // We also create a flag to know if all dimensions should be skipped,
  // and if we should therefore return early.
  bool skip_all_dimensions = true;
 
  // Fill dimensions_to_skip_for_interior_parents and dimensions_to_skip_for_node_to_el_map.
  for (auto [it, next] = std::make_tuple(dim_start, std::next(dim_start));
       next != dim_end; ++it, ++next)
    {
      if (*it + 1 != *next) // if sequential dimensions differ by exactly 1
        {
          skip_dimension_for_interior_parents[*it] = true;
          skip_dimensions_for_node_to_el_map[*next] = true;
        }
      else if (!skip_dimension_for_interior_parents[*it])
        skip_all_dimensions = false;
    }
 
  // There is nothing to do if all dimensions should be
  // skipped. Before returning, we must also set the flag that says
  // "interior parent pointers have been set up" even though we
  // determined there was no work to be done.
  if (skip_all_dimensions)
    {
      _preparation.has_interior_parent_ptrs = true;
      return;
    }
 
  // Do we have interior parent pointers going to a different mesh?
  // If so then we'll still check to make sure that's the only place
  // they go, so we can libmesh_not_implemented() if not.
  const bool separate_interior_mesh = (&(this->interior_mesh()) != this);
 
  // This map will be used to set interior parents
  std::unordered_map<dof_id_type, std::vector<dof_id_type>> node_to_elem;
 
  for (const auto & elem : this->element_ptr_range())
    {
      // Ignore element if it cannot be interior parent of any other elem.
      if (skip_dimensions_for_node_to_el_map[elem->dim()])
        continue;
 
      // Populating the node_to_elem map, same as MeshTools::build_nodes_to_elem_map
      for (auto n : make_range(elem->n_vertices()))
        {
          libmesh_assert_less (elem->id(), this->max_elem_id());
 
          node_to_elem[elem->node_id(n)].push_back(elem->id());
        }
    }
 
  // Automatically set interior parents
  for (const auto & element : this->element_ptr_range())
    {
      // Ignore elements with dimensions to skip
      // or elements that already have an interior parent.
      if (skip_dimension_for_interior_parents[element->dim()] || element->interior_parent())
        continue;
 
      // Start by generating sets of dim+1 dimensional elements that
      // touch each vertex of the current element.  If we encounter a
      // vertex not connected to _any_ dim+1 dimensional elements,
      // then we can exit the loop without checking the remaining
      // vertices since an interior parent (if it exists) will be
      // connected to all vertices of the current element.
      std::vector<std::set<dof_id_type>> neighbors( element->n_vertices() );
 
      bool found_interior_parents = true;
 
      for (auto n : make_range(element->n_vertices()))
        {
          auto it = node_to_elem.find(element->node_id(n));
 
          // Check at first that this node is not isolated.
          if (it == node_to_elem.end())
            {
              found_interior_parents = false;
              break; // out of n-loop
            }
 
          for (const auto & vertex_neighbor_id : it->second)
            if (this->elem_ref(vertex_neighbor_id).dim() == element->dim()+1)
              neighbors[n].insert(vertex_neighbor_id);
 
          if (neighbors[n].empty())
            {
              // We have found an empty set for one vertex, no reason
              // to continue.
              found_interior_parents = false;
              break; // out of n-loop
            }
        }
 
      // If we have generated a non-empty set of elements for each
      // vertex, we will now look for a vertex_neighbor_id that
      // appears in _all_ of those sets.  If found, this is our interior
      // parent id.  If multiple such common ids are found, we will
      // take the lowest such id to be the interior parent id.
      if (found_interior_parents)
        {
          std::set<dof_id_type> & neighbors_0 = neighbors[0];
          for (const auto & interior_parent_id : neighbors_0)
            {
              found_interior_parents = false;
              for (auto n : make_range(1u, element->n_vertices()))
                {
                  if (neighbors[n].count(interior_parent_id))
                    {
                      found_interior_parents = true;
                    }
                  else
                    {
                      found_interior_parents = false;
                      break;
                    }
                }
 
              if (found_interior_parents)
                {
                  element->set_interior_parent(this->elem_ptr(interior_parent_id));
                  break;
                }
            }
 
          // Do we have a mixed dimensional mesh that contains some of
          // its own interior parents, but we already expect to have
          // interior parents on a different mesh?  That's going to
          // take some work to support if anyone needs it.
          if (separate_interior_mesh)
            libmesh_not_implemented_msg
              ("interior_parent() values in multiple meshes are unsupported.");
        }
    }
 
  // This flag doesn't necessarily mean any Elems actually have
  // interior parent pointers, just that we did all the work to
  // determine whether or not they do.
  _preparation.has_interior_parent_ptrs = true;
}

References libMesh::MeshBase::_preparation, libMesh::ParallelObject::comm(), libMesh::Elem::dim(), libMesh::MeshBase::elem_dimensions(), libMesh::MeshBase::elem_ptr(), libMesh::MeshBase::elem_ref(), libMesh::MeshBase::Preparation::has_cached_elem_data, libMesh::MeshBase::Preparation::has_interior_parent_ptrs, libMesh::MeshBase::interior_mesh(), libMesh::MeshBase::is_serial(), libMesh::make_range(), and libMesh::Parallel::Communicator::set_union().

Referenced by libMesh::MeshBase::complete_preparation().

◆ elem_default_orders()

const std::set< Order > & libMesh::MeshBase::elem_default_orders ( ) const

inlineinherited

Returns: A const reference to a std::set of element default orders present in the mesh.

Definition at line 2658 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_cached_elem_data);
  return _elem_default_orders;
}

References libMesh::MeshBase::_elem_default_orders, libMesh::MeshBase::_preparation, libMesh::MeshBase::Preparation::has_cached_elem_data, and libMesh::libmesh_assert().

Referenced by MeshSmootherTest::testVariationalSmoother().

◆ elem_dimensions()

const std::set< unsigned char > & libMesh::MeshBase::elem_dimensions ( ) const

inlineinherited

Returns: A const reference to a std::set of element dimensions present in the mesh.

Definition at line 2650 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_cached_elem_data);
  return _elem_dims;
}

References libMesh::MeshBase::_elem_dims, libMesh::MeshBase::_preparation, libMesh::MeshBase::Preparation::has_cached_elem_data, and libMesh::libmesh_assert().

Referenced by libMesh::MeshBase::detect_interior_parents(), libMesh::TreeNode< N >::insert(), and libMesh::VariationalMeshSmoother::setup().

◆ elem_ptr() [1/2]

const Elem * libMesh::DistributedMesh::elem_ptr ( const dof_id_type i ) const

finaloverridevirtualinherited

Returns: A pointer to the \( i^{th} \) element, which should be present in this processor's subset of the mesh data structure.

Implements libMesh::MeshBase.

Definition at line 540 of file distributed_mesh.C.

{
  libmesh_assert(_elements[i]);
  libmesh_assert_equal_to (_elements[i]->id(), i);
 
  return _elements[i];
}

References libMesh::DistributedMesh::_elements, and libMesh::libmesh_assert().

Referenced by libMesh::DistributedMesh::fix_broken_node_and_element_numbering().

◆ elem_ptr() [2/2]

Elem * libMesh::DistributedMesh::elem_ptr ( const dof_id_type i )

finaloverridevirtualinherited

Returns: A writable pointer to the \( i^{th} \) element, which should be present in this processor's subset of the mesh data structure.

Implements libMesh::MeshBase.

Definition at line 551 of file distributed_mesh.C.

{
  libmesh_assert(_elements[i]);
  libmesh_assert_equal_to (_elements[i]->id(), i);
 
  return _elements[i];
}

References libMesh::DistributedMesh::_elements, and libMesh::libmesh_assert().

◆ elem_ref() [1/2]

virtual Elem & libMesh::MeshBase::elem_ref ( const dof_id_type i )

inlinevirtualinherited

Returns: A writable reference to the \( i^{th} \) element, which should be present in this processor's subset of the mesh data structure.

Definition at line 795 of file mesh_base.h.

  {
    return *this->elem_ptr(i);
  }

References libMesh::MeshBase::elem_ptr().

◆ elem_ref() [2/2]

virtual const Elem & libMesh::MeshBase::elem_ref ( const dof_id_type i ) const

inlinevirtualinherited

Returns: A reference to the \( i^{th} \) element, which should be present in this processor's subset of the mesh data structure.

Definition at line 785 of file mesh_base.h.

  {
    return *this->elem_ptr(i);
  }

References libMesh::MeshBase::elem_ptr().

Referenced by GhostDofConstraintPartitioner::_do_partition(), libMesh::SyncSubdomainIds::act_on_data(), libMesh::SyncElementIntegers::act_on_data(), libMesh::SyncRefinementFlags::act_on_data(), libMesh::AbaqusIO::assign_sideset_ids(), libMesh::AbaqusIO::assign_subdomain_ids(), libMesh::Nemesis_IO_Helper::build_element_and_node_maps(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::BoundaryInfo::build_side_list_from_node_list(), libMesh::Nemesis_IO_Helper::compute_num_global_sidesets(), libMesh::MeshBase::detect_interior_parents(), libMesh::RBEIMConstruction::enrich_eim_approximation_on_interiors(), libMesh::RBEIMConstruction::enrich_eim_approximation_on_sides(), libMesh::SyncSubdomainIds::gather_data(), libMesh::SyncElementIntegers::gather_data(), libMesh::SyncRefinementFlags::gather_data(), libMesh::MeshTetInterface::improve_hull_integrity(), main(), MeshPerElemTest< elem_type >::meshes_equal_enough(), libMesh::GenericProjector< FFunctor, GFunctor, FValue, ProjectionAction >::ProjectVertices::operator()(), libMesh::RBParametrizedFunction::preevaluate_parametrized_function_on_mesh(), libMesh::RBParametrizedFunction::preevaluate_parametrized_function_on_mesh_sides(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_remote_elem(), SystemsTest::testDofCouplingWithVarGroups(), MeshExtruderTest::testExtruder(), DofMapTest::testGhostConstraintSendList(), SystemsTest::testSetSystemParameterOverEquationSystem(), libMesh::FroIO::write(), libMesh::ExodusII_IO_Helper::write_elements(), libMesh::Nemesis_IO_Helper::write_elements(), libMesh::GmshIO::write_mesh(), and libMesh::ExodusII_IO_Helper::write_sidesets().

◆ element_stored_range()

const ElemRange & libMesh::MeshBase::element_stored_range ( )

inherited

Returns: A reference to a cached vector copy of a range of pointers to all semilocal elements, suitable for threading.

Iterating over all semilocal elements is most useful for modifying the mesh, so we only have a non-const version for now.

Definition at line 1954 of file mesh_base.C.

{
  if (!_element_stored_range)
  {
    // Range construction may not be safe within threads
    libmesh_assert(!Threads::in_threads);
 
    _element_stored_range =
      std::make_unique<ElemRange>(this->elements_begin(),
                                  this->elements_end());
  }
 
  return *_element_stored_range;
}

References libMesh::MeshBase::_element_stored_range, libMesh::Threads::in_threads, and libMesh::libmesh_assert().

Referenced by libMesh::EquationSystems::allgather(), libMesh::MeshBase::change_elemset_code(), libMesh::MeshTools::Modification::change_subdomain_id(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::EquationSystems::reinit_mesh(), libMesh::EquationSystems::reinit_solutions(), and libMesh::MeshBase::size_elem_extra_integers().

◆ extra_ghost_elems()

const std::set< Elem * > & libMesh::DistributedMesh::extra_ghost_elems ( ) const

inlineinherited

Const accessor to the ghosted elements.

Definition at line 267 of file distributed_mesh.h.

267{ return _extra_ghost_elems; }

References libMesh::DistributedMesh::_extra_ghost_elems.

Referenced by libMesh::DistributedMesh::clear_extra_ghost_elems().

◆ find_neighbors()

void libMesh::UnstructuredMesh::find_neighbors	(	const bool	reset_remote_elements = `false`,
		const bool	reset_current_list = `true`,
		const bool	assert_valid = `true`,
		const bool	check_non_remote = `true`
	)

overridevirtualinherited

Other functions from MeshBase requiring re-definition.

Here we look at all of the child elements which don't already have valid neighbors.

If a child element has a nullptr neighbor it is either because it is on the boundary or because its neighbor is at a different level. In the latter case we must get the neighbor from the parent.

If a child element has a remote_elem neighbor on a boundary it shares with its parent, that info may have become out-dated through coarsening of the neighbor's parent. In this case, if the parent's neighbor is active then the child should share it.

Furthermore, that neighbor better be active, otherwise we missed a child somewhere.

We also need to look through children ordered by increasing refinement level in order to add new interior_parent() links in boundary elements which have just been generated by refinement, and fix links in boundary elements whose previous interior_parent() has just been coarsened away.

Implements libMesh::MeshBase.

Definition at line 999 of file unstructured_mesh.C.

{
  // We might actually want to run this on an empty mesh
  // (e.g. the boundary mesh for a nonexistent bcid!)
  // libmesh_assert_not_equal_to (this->n_nodes(), 0);
  // libmesh_assert_not_equal_to (this->n_elem(), 0);
 
  // This function must be run on all processors at once
  parallel_object_only();
 
  LOG_SCOPE("find_neighbors()", "Mesh");
 
  //TODO:[BSK] This should be removed later?!
  if (reset_current_list)
    Threads::parallel_for
      (this->element_stored_range(),
       [reset_remote_elements](const ElemRange & range)
       {
         for (Elem * e : range)
           for (auto s : e->side_index_range())
             if (e->neighbor_ptr(s) != remote_elem || reset_remote_elements)
               e->set_neighbor(s, nullptr);
       });
 
  // Find neighboring elements by first finding elements
  // with identical side keys and then check to see if they
  // are neighbors
  {
    // data structures -- Use the hash_multimap if available
    typedef dof_id_type                     key_type;
    typedef std::pair<Elem *, unsigned char> val_type;
    typedef std::unordered_multimap<key_type, val_type> map_type;
 
    // A map from side keys to corresponding elements & side numbers
    map_type side_to_elem_map;
 
    // Pull objects out of the loop to reduce heap operations
    std::unique_ptr<Elem> my_side, their_side;
 
    for (const auto & element : this->element_ptr_range())
      {
        for (auto ms : element->side_index_range())
          {
          next_side:
            // If we haven't yet found a neighbor on this side, try.
            // Even if we think our neighbor is remote, that
            // information may be out of date.
            //
            // If we're only checking remote neighbors, after a
            // redistribution, then we'll skip the non-remote ones
            if ((element->neighbor_ptr(ms) == nullptr && check_non_remote) ||
                element->neighbor_ptr(ms) == remote_elem)
              {
                // Get the key for the side of this element.  Use the
                // low_order_key so we can find neighbors in
                // mixed-order meshes if necessary.
                const dof_id_type key = element->low_order_key(ms);
 
                // Look for elements that have an identical side key
                auto bounds = side_to_elem_map.equal_range(key);
 
                // May be multiple keys, check all the possible
                // elements which _might_ be neighbors.
                if (bounds.first != bounds.second)
                  {
                    // Get the side for this element
                    element->side_ptr(my_side, ms);
 
                    // Look at all the entries with an equivalent key
                    while (bounds.first != bounds.second)
                      {
                        // Get the potential element
                        Elem * neighbor = bounds.first->second.first;
 
                        // Get the side for the neighboring element
                        const unsigned int ns = bounds.first->second.second;
                        neighbor->side_ptr(their_side, ns);
                        //libmesh_assert(my_side.get());
                        //libmesh_assert(their_side.get());
 
                        // If found a match with my side
                        //
                        // In 1D, since parents and children have an
                        // equal side (i.e. a node) we need to check
                        // for matching level() to avoid setting our
                        // neighbor pointer to any of our neighbor's
                        // descendants.
                        if (sides_are_the_same_elem(*my_side, *their_side) &&
                            (element->level() == neighbor->level()))
                          {
                            // So share a side.  Is this a mixed pair
                            // of subactive and active/ancestor
                            // elements?
                            // If not, then we're neighbors.
                            // If so, then the subactive's neighbor is
 
                            if (element->subactive() ==
                                neighbor->subactive())
                              {
                                // an element is only subactive if it has
                                // been coarsened but not deleted
                                element->set_neighbor (ms,neighbor);
                                neighbor->set_neighbor(ns,element);
                              }
                            else if (element->subactive())
                              {
                                element->set_neighbor(ms,neighbor);
                              }
                            else if (neighbor->subactive())
                              {
                                neighbor->set_neighbor(ns,element);
                              }
                            side_to_elem_map.erase (bounds.first);
 
                            // get out of this nested crap
                            goto next_side;
                          }
 
                        ++bounds.first;
                      }
                  }
 
                // didn't find a match...
                // Build the map entry for this element
                side_to_elem_map.emplace
                  (key, std::make_pair(element, cast_int<unsigned char>(ms)));
              }
          }
      }
  }
 
#ifdef LIBMESH_ENABLE_PERIODIC
  // Get the disjoint neighbor boundary pairs object (from periodic BCs)
  auto * db = this->get_disjoint_neighbor_boundary_pairs();
 
  if (db)
    {
      // Obtain a point locator
      std::unique_ptr<PointLocatorBase> point_locator = this->sub_point_locator();
 
      for (const auto & element : this->element_ptr_range())
        {
          for (auto ms : element->side_index_range())
            {
              // Skip if this side already has a valid neighbor (including remote neighbors)
              if (element->neighbor_ptr(ms) != nullptr &&
                  element->neighbor_ptr(ms) != remote_elem)
                continue;
 
              for (const auto & [id, boundary_ptr] : *db)
                {
                  if (!this->get_boundary_info().has_boundary_id(element, ms, id))
                    continue;
 
                  unsigned int neigh_side;
                  const Elem * neigh =
                    db->neighbor(id, *point_locator, element, ms, &neigh_side);
 
                  if (neigh && neigh != remote_elem && neigh != element)
                    {
                      auto neigh_changeable = this->elem_ptr(neigh->id());
                      element->set_neighbor(ms, neigh_changeable);
                      neigh_changeable->set_neighbor(neigh_side, element);
                    }
                }
            }
        }
    }
#endif // LIBMESH_ENABLE_PERIODIC
 
#ifdef LIBMESH_ENABLE_AMR
 
  const unsigned int n_levels = MeshTools::n_levels(*this);
  for (unsigned int level = 1; level < n_levels; ++level)
    {
      for (auto & current_elem : as_range(level_elements_begin(level),
                                          level_elements_end(level)))
        {
          libmesh_assert(current_elem);
          Elem * parent = current_elem->parent();
          libmesh_assert(parent);
          const unsigned int my_child_num = parent->which_child_am_i(current_elem);
 
          for (auto s : current_elem->side_index_range())
            {
              if (current_elem->neighbor_ptr(s) == nullptr ||
                  (current_elem->neighbor_ptr(s) == remote_elem &&
                   parent->is_child_on_side(my_child_num, s)))
                {
                  Elem * neigh = parent->neighbor_ptr(s);
 
                  // If neigh was refined and had non-subactive children
                  // made remote earlier, then our current elem should
                  // actually have one of those remote children as a
                  // neighbor
                  if (neigh &&
                      (neigh->ancestor() ||
                       // If neigh has subactive children which should have
                       // matched as neighbors of the current element but
                       // did not, then those likewise must be remote
                       // children.
                       (current_elem->subactive() && neigh->has_children() &&
                        (neigh->level()+1) == current_elem->level())))
                    {
#ifdef DEBUG
                      // Let's make sure that "had children made remote"
                      // situation is actually the case
                      libmesh_assert(neigh->has_children());
                      bool neigh_has_remote_children = false;
                      for (auto & child : neigh->child_ref_range())
                        if (&child == remote_elem)
                          neigh_has_remote_children = true;
                      libmesh_assert(neigh_has_remote_children);
 
                      // And let's double-check that we don't have
                      // a remote_elem neighboring an active local element
                      if (current_elem->active())
                        libmesh_assert_not_equal_to (current_elem->processor_id(),
                                                     this->processor_id());
#endif // DEBUG
                      neigh = const_cast<RemoteElem *>(remote_elem);
                    }
                  // If neigh and current_elem are more than one level
                  // apart, figuring out whether we have a remote
                  // neighbor here becomes much harder.
                  else if (neigh && (current_elem->subactive() &&
                                     neigh->has_children()))
                    {
                      // Find the deepest descendant of neigh which
                      // we could consider for a neighbor.  If we run
                      // out of neigh children, then that's our
                      // neighbor.  If we find a potential neighbor
                      // with remote_children and we don't find any
                      // potential neighbors among its non-remote
                      // children, then our neighbor must be remote.
                      while (neigh != remote_elem &&
                             neigh->has_children())
                        {
                          bool found_neigh = false;
                          for (unsigned int c = 0, nc = neigh->n_children();
                               !found_neigh && c != nc; ++c)
                            {
                              Elem * child = neigh->child_ptr(c);
                              if (child == remote_elem)
                                continue;
                              for (auto ncn : child->neighbor_ptr_range())
                                {
                                  if (ncn != remote_elem &&
                                      ncn->is_ancestor_of(current_elem))
                                    {
                                      neigh = ncn;
                                      found_neigh = true;
                                      break;
                                    }
                                }
                            }
                          if (!found_neigh)
                            neigh = const_cast<RemoteElem *>(remote_elem);
                        }
                    }
                  current_elem->set_neighbor(s, neigh);
#ifdef DEBUG
                  if (neigh != nullptr && neigh != remote_elem)
                    // We ignore subactive elements here because
                    // we don't care about neighbors of subactive element.
                    if ((!neigh->active()) && (!current_elem->subactive()))
                      {
                        libMesh::err << "On processor " << this->processor_id()
                                     << std::endl;
                        libMesh::err << "Bad element ID = " << current_elem->id()
                                     << ", Side " << s << ", Bad neighbor ID = " << neigh->id() << std::endl;
                        libMesh::err << "Bad element proc_ID = " << current_elem->processor_id()
                                     << ", Bad neighbor proc_ID = " << neigh->processor_id() << std::endl;
                        libMesh::err << "Bad element size = " << current_elem->hmin()
                                     << ", Bad neighbor size = " << neigh->hmin() << std::endl;
                        libMesh::err << "Bad element center = " << current_elem->vertex_average()
                                     << ", Bad neighbor center = " << neigh->vertex_average() << std::endl;
                        libMesh::err << "ERROR: "
                                     << (current_elem->active()?"Active":"Ancestor")
                                     << " Element at level "
                                     << current_elem->level() << std::endl;
                        libMesh::err << "with "
                                     << (parent->active()?"active":
                                         (parent->subactive()?"subactive":"ancestor"))
                                     << " parent share "
                                     << (neigh->subactive()?"subactive":"ancestor")
                                     << " neighbor at level " << neigh->level()
                                     << std::endl;
                        NameBasedIO(*this).write ("bad_mesh.gmv");
                        libmesh_error_msg("Problematic mesh written to bad_mesh.gmv.");
                      }
#endif // DEBUG
                }
            }
 
          // We can skip to the next element if we're full-dimension
          // and therefore don't have any interior parents
          if (current_elem->dim() >= LIBMESH_DIM)
            continue;
 
          // We have no interior parents unless we can find one later
          current_elem->set_interior_parent(nullptr);
 
          Elem * pip = parent->interior_parent();
 
          if (!pip)
            continue;
 
          // If there's no interior_parent children, whether due to a
          // remote element or a non-conformity, then there's no
          // children to search.
          if (pip == remote_elem || pip->active())
            {
              current_elem->set_interior_parent(pip);
              continue;
            }
 
          // For node comparisons we'll need a sensible tolerance
          Real node_tolerance = current_elem->hmin() * TOLERANCE;
 
          // Otherwise our interior_parent should be a child of our
          // parent's interior_parent.
          for (auto & child : pip->child_ref_range())
            {
              // If we have a remote_elem, that might be our
              // interior_parent.  We'll set it provisionally now and
              // keep trying to find something better.
              if (&child == remote_elem)
                {
                  current_elem->set_interior_parent
                    (const_cast<RemoteElem *>(remote_elem));
                  continue;
                }
 
              bool child_contains_our_nodes = true;
              for (auto & n : current_elem->node_ref_range())
                {
                  bool child_contains_this_node = false;
                  for (auto & cn : child.node_ref_range())
                    if (cn.absolute_fuzzy_equals
                        (n, node_tolerance))
                      {
                        child_contains_this_node = true;
                        break;
                      }
                  if (!child_contains_this_node)
                    {
                      child_contains_our_nodes = false;
                      break;
                    }
                }
              if (child_contains_our_nodes)
                {
                  current_elem->set_interior_parent(&child);
                  break;
                }
            }
 
          // We should have found *some* interior_parent at this
          // point, whether semilocal or remote.
          libmesh_assert(current_elem->interior_parent());
        }
    }
#endif // AMR
 
#ifdef DEBUG
  if (assert_valid)
    {
      MeshTools::libmesh_assert_valid_neighbors(*this,
                                                !reset_remote_elements);
      MeshTools::libmesh_assert_valid_amr_interior_parents(*this);
    }
#else
  libmesh_ignore(assert_valid);
#endif
 
  this->_preparation.has_neighbor_ptrs = true;
}

References libMesh::MeshBase::_preparation, libMesh::Elem::active(), libMesh::Elem::ancestor(), libMesh::as_range(), libMesh::Elem::child_ptr(), libMesh::Elem::child_ref_range(), libMesh::MeshBase::elem_ptr(), libMesh::MeshBase::element_stored_range(), libMesh::err, libMesh::MeshBase::get_boundary_info(), libMesh::MeshBase::get_disjoint_neighbor_boundary_pairs(), libMesh::BoundaryInfo::has_boundary_id(), libMesh::Elem::has_children(), libMesh::MeshBase::Preparation::has_neighbor_ptrs, libMesh::Elem::hmin(), libMesh::DofObject::id(), libMesh::Elem::interior_parent(), libMesh::Elem::is_ancestor_of(), libMesh::Elem::is_child_on_side(), libMesh::Elem::level(), libMesh::libmesh_assert(), libMesh::MeshTools::libmesh_assert_valid_amr_interior_parents(), libMesh::MeshTools::libmesh_assert_valid_neighbors(), libMesh::libmesh_ignore(), libMesh::Elem::n_children(), libMesh::MeshTools::n_levels(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::neighbor_ptr_range(), libMesh::Threads::parallel_for(), libMesh::Elem::parent(), libMesh::DofObject::processor_id(), libMesh::ParallelObject::processor_id(), libMesh::Real, libMesh::remote_elem, libMesh::Elem::set_interior_parent(), libMesh::Elem::set_neighbor(), libMesh::Elem::side_ptr(), libMesh::MeshBase::sub_point_locator(), libMesh::Elem::subactive(), libMesh::TOLERANCE, libMesh::Elem::vertex_average(), libMesh::Elem::which_child_am_i(), and libMesh::NameBasedIO::write().

Referenced by libMesh::TriangleWrapper::copy_tri_to_mesh(), libMesh::MeshTetInterface::improve_hull_integrity(), libMesh::Poly2TriTriangulator::insert_refinement_points(), libMesh::DistributedMesh::redistribute(), libMesh::UnstructuredMesh::stitching_helper(), libMesh::NetGenMeshInterface::triangulate(), and libMesh::TriangleInterface::triangulate().

◆ fix_broken_node_and_element_numbering()

void libMesh::DistributedMesh::fix_broken_node_and_element_numbering ( )

overridevirtualinherited

There is no reason for a user to ever call this function.

This function restores a previously broken element/node numbering such that mesh.node_ref(n).id() == n.

Implements libMesh::MeshBase.

Definition at line 1745 of file distributed_mesh.C.

{
  // We can't use range-for here because we need access to the special
  // iterators' methods, not just to their dereferenced values.
 
  // Nodes first
  for (auto pr = this->_nodes.begin(),
           end = this->_nodes.end(); pr != end; ++pr)
    {
      Node * n = *pr;
      if (n != nullptr)
        {
          const dof_id_type id = pr.index();
          n->set_id() = id;
          libmesh_assert_equal_to(this->node_ptr(id), n);
        }
    }
 
  // Elements next
  for (auto pr = this->_elements.begin(),
           end = this->_elements.end(); pr != end; ++pr)
    {
      Elem * e = *pr;
      if (e != nullptr)
        {
          const dof_id_type id = pr.index();
          e->set_id() = id;
          libmesh_assert_equal_to(this->elem_ptr(id), e);
        }
    }
}

References libMesh::DistributedMesh::_elements, libMesh::DistributedMesh::_nodes, libMesh::DistributedMesh::elem_ptr(), libMesh::DistributedMesh::node_ptr(), and libMesh::DofObject::set_id().

◆ gather_to_zero()

void libMesh::DistributedMesh::gather_to_zero ( )

overridevirtualinherited

Gathers all elements and nodes of the mesh onto processor zero.

Reimplemented from libMesh::MeshBase.

Definition at line 1927 of file distributed_mesh.C.

{
  if (_is_serial_on_proc_0)
    return;
 
  _is_serial_on_proc_0 = true;
  MeshCommunication().gather(0, *this);
}

References libMesh::DistributedMesh::_is_serial_on_proc_0, and libMesh::MeshCommunication::gather().

◆ get_boundary_info() [1/2]

BoundaryInfo & libMesh::MeshBase::get_boundary_info ( )

inlineinherited

Writable information about boundary ids on the mesh.

Definition at line 175 of file mesh_base.h.

175{ return *boundary_info; }

libMesh::MeshBase::boundary_info

std::unique_ptr< BoundaryInfo > boundary_info

This class holds the boundary information.

Definition mesh_base.h:2143

References libMesh::MeshBase::boundary_info.

◆ get_boundary_info() [2/2]

const BoundaryInfo & libMesh::MeshBase::get_boundary_info ( ) const

inlineinherited

The information about boundary ids on the mesh.

Definition at line 170 of file mesh_base.h.

170{ return *boundary_info; }

References libMesh::MeshBase::boundary_info.

◆ get_constraint_rows() [1/2]

constraint_rows_type & libMesh::MeshBase::get_constraint_rows ( )

inlineinherited

Constraint rows accessors.

Definition at line 1940 of file mesh_base.h.

1941 { libmesh_deprecated(); return _constraint_rows; }

References libMesh::MeshBase::_constraint_rows.

Referenced by libMesh::Partitioner::build_graph(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshTools::libmesh_assert_valid_constraint_rows(), libMesh::MeshBase::locally_equals(), libMesh::MeshTools::n_connected_components(), libMesh::DofMap::process_mesh_constraint_rows(), and scale_mesh_and_plot().

◆ get_constraint_rows() [2/2]

const constraint_rows_type & libMesh::MeshBase::get_constraint_rows ( ) const

inlineinherited

Definition at line 1944 of file mesh_base.h.

1945 { return _constraint_rows; }

References libMesh::MeshBase::_constraint_rows.

◆ get_count_lower_dim_elems_in_point_locator()

bool libMesh::MeshBase::get_count_lower_dim_elems_in_point_locator ( ) const

inherited

Get the current value of _count_lower_dim_elems_in_point_locator.

Definition at line 1895 of file mesh_base.C.

{
  return _count_lower_dim_elems_in_point_locator;
}

References libMesh::MeshBase::_count_lower_dim_elems_in_point_locator.

Referenced by libMesh::TreeNode< N >::insert().

◆ get_disjoint_neighbor_boundary_pairs() [1/2]

PeriodicBoundaries * libMesh::MeshBase::get_disjoint_neighbor_boundary_pairs ( )

inherited

Definition at line 2311 of file mesh_base.C.

    {
      return _disjoint_neighbor_boundary_pairs.get();
    }

References libMesh::MeshBase::_disjoint_neighbor_boundary_pairs.

Referenced by libMesh::UnstructuredMesh::find_neighbors(), libMesh::CheckpointIO::read_header(), libMesh::UnstructuredMesh::stitching_helper(), CheckpointIOTest::testDisjointNeighborPairsCheckpoint(), DisjointNeighborTest::testPreserveDisjointNeighborPairsAfterStitch(), DisjointNeighborTest::testStitchCrossMesh(), and libMesh::CheckpointIO::write_disjoint_neighbor_boundary_pairs().

◆ get_disjoint_neighbor_boundary_pairs() [2/2]

const PeriodicBoundaries * libMesh::MeshBase::get_disjoint_neighbor_boundary_pairs ( ) const

inherited

Definition at line 2316 of file mesh_base.C.

    {
      return _disjoint_neighbor_boundary_pairs.get();
    }

References libMesh::MeshBase::_disjoint_neighbor_boundary_pairs.

◆ get_elem_integer_index()

unsigned int libMesh::MeshBase::get_elem_integer_index ( std::string_view name ) const

inherited

Definition at line 689 of file mesh_base.C.

{
  for (auto i : index_range(_elem_integer_names))
    if (_elem_integer_names[i] == name)
      return i;
 
  libmesh_error_msg("Unknown elem integer " << name);
  return libMesh::invalid_uint;
}

References libMesh::MeshBase::_elem_integer_names, libMesh::index_range(), and libMesh::invalid_uint.

Referenced by libMesh::MeshBase::change_elemset_code(), WriteElemsetData::checkElemsetCodes(), ExtraIntegersTest::testExtraIntegersExodusReading(), and libMesh::ExodusII_IO_Helper::write_elemsets().

◆ get_elem_integer_name()

const std::string & libMesh::MeshBase::get_elem_integer_name ( unsigned int i ) const

inlineinherited

Definition at line 1083 of file mesh_base.h.

1084 { return _elem_integer_names[i]; }

References libMesh::MeshBase::_elem_integer_names.

Referenced by libMesh::XdrIO::write(), and libMesh::CheckpointIO::write().

◆ get_elemset_code()

dof_id_type libMesh::MeshBase::get_elemset_code ( const MeshBase::elemset_type & id_set ) const

inherited

Definition at line 502 of file mesh_base.C.

{
  auto it = _elemset_codes_inverse_map.find(id_set);
  return (it == _elemset_codes_inverse_map.end()) ? DofObject::invalid_id : it->second;
}

References libMesh::MeshBase::_elemset_codes_inverse_map, and libMesh::DofObject::invalid_id.

Referenced by WriteElemsetData::checkElemsetCodes(), and libMesh::ExodusII_IO::read().

◆ get_elemset_codes()

std::vector< dof_id_type > libMesh::MeshBase::get_elemset_codes ( ) const

inherited

Return a vector of all elemset codes defined on the mesh.

We get this by looping over the _elemset_codes map.

Definition at line 508 of file mesh_base.C.

{
  std::vector<dof_id_type> ret;
  ret.reserve(_elemset_codes.size());
  for (const auto & pr : _elemset_codes)
    ret.push_back(pr.first);
  return ret;
}

References libMesh::MeshBase::_elemset_codes.

Referenced by libMesh::UnstructuredMesh::stitching_helper(), and libMesh::XdrIO::write().

◆ get_elemsets()

void libMesh::MeshBase::get_elemsets	(	dof_id_type	elemset_code,
		MeshBase::elemset_type &	id_set_to_fill
	)		const

inherited

Look up the element sets for a given elemset code and vice-versa.

The elemset must have been previously stored by calling add_elemset_code(). If no such code/set is found, returns the empty set or DofObject::invalid_id, respectively.

Definition at line 492 of file mesh_base.C.

{
  // If we don't recognize this elemset_code, hand back an empty set
  id_set_to_fill.clear();
 
  if (const auto it = _elemset_codes.find(elemset_code);
      it != _elemset_codes.end())
    id_set_to_fill.insert(it->second->begin(), it->second->end());
}

References libMesh::MeshBase::_elemset_codes.

Referenced by libMesh::UnstructuredMesh::stitching_helper(), WriteElemsetData::testWriteImpl(), libMesh::XdrIO::write(), and libMesh::ExodusII_IO_Helper::write_elemsets().

◆ get_id_by_name()

subdomain_id_type libMesh::MeshBase::get_id_by_name ( std::string_view name ) const

inherited

Returns: The id of the named subdomain if it exists, Elem::invalid_subdomain_id otherwise.

Definition at line 1941 of file mesh_base.C.

{
  // Linear search over the map values.
  for (const auto & [sbd_id, sbd_name] : _block_id_to_name)
    if (sbd_name == name)
      return sbd_id;
 
  // If we made it here without returning, we don't have a subdomain
  // with the requested name, so return Elem::invalid_subdomain_id.
  return Elem::invalid_subdomain_id;
}

References libMesh::MeshBase::_block_id_to_name, and libMesh::Elem::invalid_subdomain_id.

◆ get_info()

std::string libMesh::MeshBase::get_info	(	const unsigned int	verbosity = `0`,
		const bool	global = `true`
	)		const

inherited

Returns: A string containing relevant information about the mesh.

verbosity sets the verbosity, with 0 being the least and 2 being the greatest. 0 - Dimensions, number of nodes, number of elems, number of subdomains, number of partitions, prepared status. 1 - Adds the mesh bounding box, mesh element types, specific nodesets/edgesets/sidesets with element types, number of nodes/edges/sides. 2 - Adds volume information and bounding boxes to boundary information.

The global parameter pertains primarily to verbosity levels 1 and above. When global == true, information is only output on rank 0 and the information is reduced. When global == false, information is output on all ranks that pertains only to that local partition.

Definition at line 1276 of file mesh_base.C.

{
  std::ostringstream oss;
 
  oss << " Mesh Information:" << '\n';
 
  if (!_elem_dims.empty())
    {
      oss << "  elem_dimensions()={";
      std::copy(_elem_dims.begin(),
                --_elem_dims.end(), // --end() is valid if the set is non-empty
                std::ostream_iterator<unsigned int>(oss, ", "));
      oss << cast_int<unsigned int>(*_elem_dims.rbegin());
      oss << "}";
      if (!this->preparation().has_cached_elem_data)
        oss << " (may be out of date)";
      oss << '\n';
    }
 
  if (!_elem_default_orders.empty())
    {
      oss << "  elem_default_orders()={";
      std::transform(_elem_default_orders.begin(),
                     --_elem_default_orders.end(),
                     std::ostream_iterator<std::string>(oss, ", "),
                     [](Order o)
                       { return Utility::enum_to_string<Order>(o); });
      oss << Utility::enum_to_string<Order>(*_elem_default_orders.rbegin());
      oss << "}";
      if (!this->preparation().has_cached_elem_data)
        oss << " (may be out of date)";
      oss << '\n';
    }
 
  oss << "  supported_nodal_order()=" << this->_supported_nodal_order;
  if (!this->preparation().has_cached_elem_data)
    oss << " (may be out of date)";
  oss << '\n';
 
  oss << "  spatial_dimension()=" << int(this->_spatial_dimension);
  if (!this->preparation().has_cached_elem_data)
    oss << " (may be out of date)";
  oss << '\n';
 
  oss << "  n_nodes()="               << this->n_nodes()                                      << '\n'
      << "    n_local_nodes()="       << this->n_local_nodes()                                << '\n'
      << "  n_elem()="                << this->n_elem()                                       << '\n'
      << "    n_local_elem()="        << this->n_local_elem()                                 << '\n';
#ifdef LIBMESH_ENABLE_AMR
  oss << "    n_active_elem()="       << this->n_active_elem()                                << '\n';
#endif
  if (global)
    oss << "  n_subdomains()="        << static_cast<std::size_t>(this->n_subdomains())       << '\n';
  else
    oss << "  n_local_subdomains()= " << static_cast<std::size_t>(this->n_local_subdomains()) << '\n';
  oss << "  n_elemsets()="            << static_cast<std::size_t>(this->n_elemsets())         << '\n';
  if (!_elemset_codes.empty())
    oss << "    n_elemset_codes="     << _elemset_codes.size()                                << '\n';
  oss << "  n_partitions()="          << static_cast<std::size_t>(this->n_partitions())       << '\n'
      << "  n_processors()="          << static_cast<std::size_t>(this->n_processors())       << '\n'
      << "  n_threads()="             << static_cast<std::size_t>(libMesh::n_threads())       << '\n'
      << "  processor_id()="          << static_cast<std::size_t>(this->processor_id())       << '\n'
      << "  is_prepared()="           << (this->is_prepared() ? "true" : "false")             << '\n'
      << "  is_replicated()="         << (this->is_replicated() ? "true" : "false")           << '\n';
 
  if (verbosity > 0)
    {
      if (global)
        {
          libmesh_parallel_only(this->comm());
          if (this->processor_id() != 0)
            oss << "\n Detailed global get_info() (verbosity > 0) is reduced and output to only rank 0.";
        }
 
      // Helper for printing element types
      const auto elem_type_helper = [](const std::set<int> & elem_types) {
        std::stringstream ss;
        for (auto it = elem_types.begin(); it != elem_types.end();)
          {
            ss << Utility::enum_to_string((ElemType)*it);
            if (++it != elem_types.end())
              ss << ", ";
          }
        return ss.str();
      };
 
      // Helper for whether or not the given DofObject is to be included. If we're doing
      // a global reduction, we also count unpartitioned objects on rank 0.
      const auto include_object = [this, &global](const DofObject & dof_object) {
        return this->processor_id() == dof_object.processor_id() ||
               (global &&
                this->processor_id() == 0 &&
                dof_object.processor_id() == DofObject::invalid_processor_id);
      };
 
      Real volume = 0;
 
      // Add bounding box information
      const auto bbox = global ? MeshTools::create_bounding_box(*this) : MeshTools::create_local_bounding_box(*this);
      if (!global || this->processor_id() == 0)
        oss << "\n " << (global ? "" : "Local ") << "Mesh Bounding Box:\n"
            << "  Minimum: " << bbox.min()                << "\n"
            << "  Maximum: " << bbox.max()                << "\n"
            << "  Delta:   " << (bbox.max() - bbox.min()) << "\n";
 
      // Obtain the global or local element types
      std::set<int> elem_types;
      for (const Elem * elem : this->active_local_element_ptr_range())
        elem_types.insert(elem->type());
      if (global)
        {
          // Pick up unpartitioned elems on rank 0
          if (this->processor_id() == 0)
            for (const Elem * elem : this->active_unpartitioned_element_ptr_range())
              elem_types.insert(elem->type());
 
          this->comm().set_union(elem_types);
        }
 
      // Add element types
      if (!global || this->processor_id() == 0)
        oss << "\n " << (global ? "" : "Local ") << "Mesh Element Type(s):\n  "
            << elem_type_helper(elem_types) << "\n";
 
      // Reduce the nodeset ids
      auto nodeset_ids = this->get_boundary_info().get_node_boundary_ids();
      if (global)
        this->comm().set_union(nodeset_ids);
 
      // Accumulate local information for each nodeset
      struct NodesetInfo
      {
        std::size_t num_nodes = 0;
        BoundingBox bbox;
      };
      std::map<boundary_id_type, NodesetInfo> nodeset_info_map;
      for (const auto & [node, id] : this->get_boundary_info().get_nodeset_map())
        {
          if (!include_object(*node))
            continue;
 
          NodesetInfo & info = nodeset_info_map[id];
 
          ++info.num_nodes;
 
          if (verbosity > 1)
            info.bbox.union_with(*node);
        }
 
      // Add nodeset info
      if (!global || this->processor_id() == 0)
        {
          oss << "\n " << (global ? "" : "Local ") << "Mesh Nodesets:\n";
          if (nodeset_ids.empty())
            oss << "  None\n";
        }
 
      const auto & nodeset_name_map = this->get_boundary_info().get_nodeset_name_map();
      for (const auto id : nodeset_ids)
        {
          NodesetInfo & info = nodeset_info_map[id];
 
          // Reduce the local information for this nodeset if required
          if (global)
            {
              this->comm().sum(info.num_nodes);
              if (verbosity > 1)
                {
                  this->comm().min(info.bbox.min());
                  this->comm().max(info.bbox.max());
                }
            }
 
          const bool has_name = nodeset_name_map.count(id) && nodeset_name_map.at(id).size();
          const std::string name = has_name ? nodeset_name_map.at(id) : "";
          if (global)
            libmesh_assert(this->comm().verify(name));
 
          if (global ? this->processor_id() == 0 : info.num_nodes > 0)
            {
              oss << "  Nodeset " << id;
              if (has_name)
                oss << " (" << name << ")";
              oss << ", " << info.num_nodes << " " << (global ? "" : "local ") << "nodes\n";
 
              if (verbosity > 1)
              {
                oss << "   " << (global ? "Bounding" : "Local bounding") << " box minimum: "
                    << info.bbox.min() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box maximum: "
                    << info.bbox.max() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box delta: "
                    << (info.bbox.max() - info.bbox.min()) << "\n";
              }
            }
        }
 
      // Reduce the sideset ids
      auto sideset_ids = this->get_boundary_info().get_side_boundary_ids();
      if (global)
        this->comm().set_union(sideset_ids);
 
      // Accumulate local information for each sideset
      struct SidesetInfo
      {
        std::size_t num_sides = 0;
        Real volume = 0;
        std::set<int> side_elem_types;
        std::set<int> elem_types;
        std::set<dof_id_type> elem_ids;
        std::set<dof_id_type> node_ids;
        BoundingBox bbox;
      };
      ElemSideBuilder side_builder;
      std::map<boundary_id_type, SidesetInfo> sideset_info_map;
      for (const auto & pair : this->get_boundary_info().get_sideset_map())
        {
          const Elem * elem = pair.first;
          if (!include_object(*elem))
            continue;
 
          const auto id = pair.second.second;
          SidesetInfo & info = sideset_info_map[id];
 
          const auto s = pair.second.first;
          const Elem & side = side_builder(*elem, s);
 
          ++info.num_sides;
          info.side_elem_types.insert(side.type());
          info.elem_types.insert(elem->type());
          info.elem_ids.insert(elem->id());
 
          for (const Node & node : side.node_ref_range())
            if (include_object(node))
              info.node_ids.insert(node.id());
 
          if (verbosity > 1)
          {
            info.volume += side.volume();
            info.bbox.union_with(side.loose_bounding_box());
          }
        }
 
      // Add sideset info
      if (!global || this->processor_id() == 0)
        {
          oss << "\n " << (global ? "" : "Local ") << "Mesh Sidesets:\n";
          if (sideset_ids.empty())
            oss << "  None\n";
        }
      const auto & sideset_name_map = this->get_boundary_info().get_sideset_name_map();
      for (const auto id : sideset_ids)
        {
          SidesetInfo & info = sideset_info_map[id];
 
          auto num_elems = info.elem_ids.size();
          auto num_nodes = info.node_ids.size();
 
          // Reduce the local information for this sideset if required
          if (global)
            {
              this->comm().sum(info.num_sides);
              this->comm().set_union(info.side_elem_types, 0);
              this->comm().sum(num_elems);
              this->comm().set_union(info.elem_types, 0);
              this->comm().sum(num_nodes);
              if (verbosity > 1)
              {
                this->comm().sum(info.volume);
                this->comm().min(info.bbox.min());
                this->comm().max(info.bbox.max());
              }
            }
 
          const bool has_name = sideset_name_map.count(id) && sideset_name_map.at(id).size();
          const std::string name = has_name ? sideset_name_map.at(id) : "";
          if (global)
            libmesh_assert(this->comm().verify(name));
 
          if (global ? this->processor_id() == 0 : info.num_sides > 0)
            {
              oss << "  Sideset " << id;
              if (has_name)
                oss << " (" << name << ")";
              oss << ", " << info.num_sides << " sides (" << elem_type_helper(info.side_elem_types) << ")"
                  << ", " << num_elems << " " << (global ? "" : "local ") << "elems (" << elem_type_helper(info.elem_types) << ")"
                  << ", " << num_nodes << " " << (global ? "" : "local ") << "nodes\n";
 
              if (verbosity > 1)
              {
                oss << "   " << (global ? "Side" : "Local side") << " volume: " << info.volume << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box minimum: "
                    << info.bbox.min() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box maximum: "
                    << info.bbox.max() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box delta: "
                    << (info.bbox.max() - info.bbox.min()) << "\n";
              }
            }
        }
 
      // Reduce the edgeset ids
      auto edgeset_ids = this->get_boundary_info().get_edge_boundary_ids();
      if (global)
        this->comm().set_union(edgeset_ids);
 
      // Accumulate local information for each edgeset
      struct EdgesetInfo
      {
        std::size_t num_edges = 0;
        std::set<int> edge_elem_types;
        BoundingBox bbox;
      };
      std::map<boundary_id_type, EdgesetInfo> edgeset_info_map;
      std::unique_ptr<const Elem> edge;
 
      for (const auto & pair : this->get_boundary_info().get_edgeset_map())
        {
          const Elem * elem = pair.first;
          if (!include_object(*elem))
            continue;
 
          const auto id = pair.second.second;
          EdgesetInfo & info = edgeset_info_map[id];
 
          elem->build_edge_ptr(edge, pair.second.first);
 
          ++info.num_edges;
          info.edge_elem_types.insert(edge->type());
 
          if (verbosity > 1)
            info.bbox.union_with(edge->loose_bounding_box());
        }
 
      // Add edgeset info
      if (!global || this->processor_id() == 0)
        {
          oss << "\n " << (global ? "" : "Local ") << "Mesh Edgesets:\n";
          if (edgeset_ids.empty())
            oss << "  None\n";
        }
 
      const auto & edgeset_name_map = this->get_boundary_info().get_edgeset_name_map();
      for (const auto id : edgeset_ids)
        {
          EdgesetInfo & info = edgeset_info_map[id];
 
          // Reduce the local information for this edgeset if required
          if (global)
            {
              this->comm().sum(info.num_edges);
              this->comm().set_union(info.edge_elem_types, 0);
              if (verbosity > 1)
                {
                  this->comm().min(info.bbox.min());
                  this->comm().min(info.bbox.max());
                }
            }
 
          const bool has_name = edgeset_name_map.count(id) && edgeset_name_map.at(id).size();
          const std::string name = has_name ? edgeset_name_map.at(id) : "";
          if (global)
            libmesh_assert(this->comm().verify(name));
 
          if (global ? this->processor_id() == 0 : info.num_edges > 0)
            {
              oss << "  Edgeset " << id;
              if (has_name)
                oss << " (" << name << ")";
              oss << ", " << info.num_edges << " " << (global ? "" : "local ") << "edges ("
                  << elem_type_helper(info.edge_elem_types) << ")\n";
 
              if (verbosity > 1)
              {
                oss << "   " << (global ? "Bounding" : "Local bounding") << " box minimum: "
                    << info.bbox.min() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box maximum: "
                    << info.bbox.max() << "\n"
                    << "   " << (global ? "Bounding" : "Local bounding") << " box delta: "
                    << (info.bbox.max() - info.bbox.min()) << "\n";
              }
            }
        }
 
      // Reduce the block IDs and block names
      std::set<subdomain_id_type> subdomains;
      for (const Elem * elem : this->active_element_ptr_range())
        if (include_object(*elem))
          subdomains.insert(elem->subdomain_id());
      if (global)
        this->comm().set_union(subdomains);
 
      // Accumulate local information for each subdomain
      struct SubdomainInfo
      {
        std::size_t num_elems = 0;
        Real volume = 0;
        std::set<int> elem_types;
        std::set<dof_id_type> active_node_ids;
#ifdef LIBMESH_ENABLE_AMR
        std::size_t num_active_elems = 0;
#endif
        BoundingBox bbox;
      };
      std::map<subdomain_id_type, SubdomainInfo> subdomain_info_map;
      for (const Elem * elem : this->element_ptr_range())
        if (include_object(*elem))
          {
            SubdomainInfo & info = subdomain_info_map[elem->subdomain_id()];
 
            ++info.num_elems;
            info.elem_types.insert(elem->type());
 
#ifdef LIBMESH_ENABLE_AMR
            if (elem->active())
              ++info.num_active_elems;
#endif
 
            for (const Node & node : elem->node_ref_range())
              if (include_object(node) && node.active())
                info.active_node_ids.insert(node.id());
 
            if (verbosity > 1 && elem->active())
              {
                info.volume += elem->volume();
                info.bbox.union_with(elem->loose_bounding_box());
              }
          }
 
      // Add subdomain info
      oss << "\n " << (global ? "" : "Local ") << "Mesh Subdomains:\n";
      const auto & subdomain_name_map = this->get_subdomain_name_map();
      for (const auto id : subdomains)
      {
        SubdomainInfo & info = subdomain_info_map[id];
 
        auto num_active_nodes = info.active_node_ids.size();
 
        // Reduce the information for this subdomain if needed
        if (global)
          {
            this->comm().sum(info.num_elems);
#ifdef LIBMESH_ENABLE_AMR
            this->comm().sum(info.num_active_elems);
#endif
            this->comm().sum(num_active_nodes);
            this->comm().set_union(info.elem_types, 0);
            if (verbosity > 1)
            {
              this->comm().min(info.bbox.min());
              this->comm().max(info.bbox.max());
              this->comm().sum(info.volume);
            }
          }
        if (verbosity > 1)
          volume += info.volume;
 
        const bool has_name = subdomain_name_map.count(id);
        const std::string name = has_name ? subdomain_name_map.at(id) : "";
        if (global)
          libmesh_assert(this->comm().verify(name));
 
        if (!global || this->processor_id() == 0)
          {
            oss << "  Subdomain " << id;
            if (has_name)
              oss << " (" << name << ")";
            oss << ": " << info.num_elems << " " << (global ? "" : "local ") << "elems "
                << "(" << elem_type_helper(info.elem_types);
#ifdef LIBMESH_ENABLE_AMR
            oss << ", " << info.num_active_elems << " active";
#endif
            oss << "), " << num_active_nodes << " " << (global ? "" : "local ") << "active nodes\n";
            if (verbosity > 1)
            {
              oss << "   " << (global ? "Volume" : "Local volume") << ": " << info.volume << "\n";
              oss << "   " << (global ? "Bounding" : "Local bounding") << " box minimum: "
                  << info.bbox.min() << "\n"
                  << "   " << (global ? "Bounding" : "Local bounding") << " box maximum: "
                  << info.bbox.max() << "\n"
                  << "   " << (global ? "Bounding" : "Local bounding") << " box delta: "
                  << (info.bbox.max() - info.bbox.min()) << "\n";
            }
          }
      }
 
      oss << "  " << (global ? "Global" : "Local") << " mesh volume = " << volume << "\n";
 
    }
 
  return oss.str();
}

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

◆ get_local_constraints()

std::string libMesh::MeshBase::get_local_constraints ( bool print_nonlocal = false ) const

inherited

Gets a string reporting all mesh constraint rows local to this processor.

If print_nonlocal is true, then nonlocal constraints which are locally known are included.

Definition at line 2831 of file mesh_base.C.

{
  std::ostringstream os;
 
  if (print_nonlocal)
    os << "All ";
  else
    os << "Local ";
 
  os << "Mesh Constraint Rows:"
     << std::endl;
 
  for (const auto & [node, row] : _constraint_rows)
    {
      const bool local = (node->processor_id() == this->processor_id());
 
      // Skip non-local dofs if requested
      if (!print_nonlocal && !local)
        continue;
 
      os << "Constraints for " << (local ? "Local" : "Ghost") << " Node " << node->id()
         << ": \t";
 
      for (const auto & [elem_and_node, coef] : row)
        os << " ((" << elem_and_node.first->id() << ',' << elem_and_node.second << "), " << coef << ")\t";
 
      os << std::endl;
    }
 
  return os.str();
}

References libMesh::MeshBase::_constraint_rows, and libMesh::ParallelObject::processor_id().

Referenced by libMesh::MeshBase::print_constraint_rows().

◆ get_mesh_subdomains()

const std::set< subdomain_id_type > & libMesh::MeshBase::get_mesh_subdomains ( ) const

inlineinherited

Returns: The cached mesh subdomains. As long as the mesh is prepared, this should contain all the subdomain ids across processors. Relies on the mesh being prepared

Definition at line 2674 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_cached_elem_data);
  return _mesh_subdomains;
}

References libMesh::MeshBase::_mesh_subdomains, libMesh::MeshBase::_preparation, libMesh::MeshBase::Preparation::has_cached_elem_data, and libMesh::libmesh_assert().

◆ get_node_integer_index()

unsigned int libMesh::MeshBase::get_node_integer_index ( std::string_view name ) const

inherited

Definition at line 778 of file mesh_base.C.

{
  for (auto i : index_range(_node_integer_names))
    if (_node_integer_names[i] == name)
      return i;
 
  libmesh_error_msg("Unknown node integer " << name);
  return libMesh::invalid_uint;
}

References libMesh::MeshBase::_node_integer_names, libMesh::index_range(), and libMesh::invalid_uint.

◆ get_node_integer_name()

const std::string & libMesh::MeshBase::get_node_integer_name ( unsigned int i ) const

inlineinherited

Definition at line 1205 of file mesh_base.h.

1206 { return _node_integer_names[i]; }

References libMesh::MeshBase::_node_integer_names.

Referenced by libMesh::XdrIO::write(), and libMesh::CheckpointIO::write().

◆ get_point_locator_close_to_point_tol()

Real libMesh::MeshBase::get_point_locator_close_to_point_tol ( ) const

inherited

Definition at line 2369 of file mesh_base.C.

{
  return _point_locator_close_to_point_tol;
}

References libMesh::MeshBase::_point_locator_close_to_point_tol.

◆ get_subdomain_name_map()

const std::map< subdomain_id_type, std::string > & libMesh::MeshBase::get_subdomain_name_map ( ) const

inlineinherited

Definition at line 1930 of file mesh_base.h.

1931 { return _block_id_to_name; }

References libMesh::MeshBase::_block_id_to_name.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::get_info(), libMesh::ReplicatedMesh::ReplicatedMesh(), libMesh::UnstructuredMesh::stitching_helper(), MeshInputTest::testGmshBCIDOverlap(), libMesh::XdrIO::write_serialized_subdomain_names(), and libMesh::CheckpointIO::write_subdomain_names().

◆ ghosting_functors_begin()

GhostingFunctorIterator libMesh::MeshBase::ghosting_functors_begin ( ) const

inlineinherited

Beginning of range of ghosting functors.

Definition at line 1476 of file mesh_base.h.

1477 { return _ghosting_functors.begin(); }

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::UnstructuredMesh::contract(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::query_ghosting_functors(), libMesh::MeshBase::redistribute(), and EquationSystemsTest::testDisableDefaultGhosting().

◆ ghosting_functors_end()

GhostingFunctorIterator libMesh::MeshBase::ghosting_functors_end ( ) const

inlineinherited

End of range of ghosting functors.

Definition at line 1482 of file mesh_base.h.

1483 { return _ghosting_functors.end(); }

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::UnstructuredMesh::contract(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::query_ghosting_functors(), libMesh::MeshBase::redistribute(), and EquationSystemsTest::testDisableDefaultGhosting().

◆ has_elem_integer()

bool libMesh::MeshBase::has_elem_integer ( std::string_view name ) const

inherited

Definition at line 701 of file mesh_base.C.

{
  for (auto & entry : _elem_integer_names)
    if (entry == name)
      return true;
 
  return false;
}

References libMesh::MeshBase::_elem_integer_names.

Referenced by libMesh::MeshBase::change_elemset_code(), WriteElemsetData::checkElemsetCodes(), ExtraIntegersTest::checkpoint_helper(), libMesh::ExodusII_IO_Helper::initialize(), ExtraIntegersTest::testExtraIntegersExodusReading(), and libMesh::ExodusII_IO_Helper::write_elemsets().

◆ has_node_integer()

bool libMesh::MeshBase::has_node_integer ( std::string_view name ) const

inherited

Definition at line 790 of file mesh_base.C.

{
  for (auto & entry : _node_integer_names)
    if (entry == name)
      return true;
 
  return false;
}

References libMesh::MeshBase::_node_integer_names.

Referenced by ExtraIntegersTest::checkpoint_helper().

◆ insert_elem() [1/2]

Elem * libMesh::DistributedMesh::insert_elem ( Elem * e )

finaloverridevirtualinherited

Insert elem e to the element array, preserving its id and replacing/deleting any existing element with the same id.

Users should call MeshBase::complete_preparation() after elements are added to and/or deleted from the mesh.

Implements libMesh::MeshBase.

Definition at line 721 of file distributed_mesh.C.

{
  if (_elements[e->id()])
    this->delete_elem(_elements[e->id()]);
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  if (!e->valid_unique_id())
    {
      if (processor_id() == e->processor_id())
        {
          e->set_unique_id(_next_unique_id);
          _next_unique_id += this->n_processors() + 1;
        }
      else
        {
          e->set_unique_id(_next_unpartitioned_unique_id);
          _next_unpartitioned_unique_id += this->n_processors() + 1;
        }
    }
  else
    {
      _next_unique_id = std::max(_next_unique_id, e->unique_id()+1);
      _next_unique_id =
        ((_next_unique_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
        (this->n_processors() + 1) + this->processor_id();
    }
#endif
 
  // Try to make the cached elem data more accurate
  processor_id_type elem_procid = e->processor_id();
  if (elem_procid == this->processor_id() ||
      elem_procid == DofObject::invalid_processor_id)
    _n_elem++;
 
  _elements[e->id()] = e;
 
  // We actually added a new element.  Some of our caches might still
  // be valid, but we should clear the ones which definitely are not.
  this->clear_point_locator();
  this->clear_stored_ranges();
 
  // Make sure any new element is given space for any extra integers
  // we've requested
  e->add_extra_integers(_elem_integer_names.size(),
                        _elem_integer_default_values);
 
  // And set mapping type and data on any new element
  e->set_mapping_type(this->default_mapping_type());
  e->set_mapping_data(this->default_mapping_data());
 
  return e;
}

References libMesh::MeshBase::_elem_integer_default_values, libMesh::MeshBase::_elem_integer_names, libMesh::DistributedMesh::_elements, libMesh::DistributedMesh::_n_elem, libMesh::MeshBase::_next_unique_id, libMesh::DistributedMesh::_next_unpartitioned_unique_id, libMesh::DofObject::add_extra_integers(), libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::clear_stored_ranges(), libMesh::MeshBase::default_mapping_data(), libMesh::MeshBase::default_mapping_type(), libMesh::DistributedMesh::delete_elem(), libMesh::DofObject::id(), libMesh::DofObject::invalid_processor_id, libMesh::ParallelObject::n_processors(), libMesh::DofObject::processor_id(), libMesh::ParallelObject::processor_id(), libMesh::Elem::set_mapping_data(), libMesh::Elem::set_mapping_type(), libMesh::DofObject::set_unique_id(), libMesh::DofObject::unique_id(), and libMesh::DofObject::valid_unique_id().

Referenced by libMesh::DistributedMesh::insert_elem().

◆ insert_elem() [2/2]

Elem * libMesh::DistributedMesh::insert_elem ( std::unique_ptr< Elem > e )

finaloverridevirtualinherited

Version of insert_elem() taking a std::unique_ptr by value.

The version taking a dumb pointer will eventually be deprecated in favor of this version. This API is intended to indicate that ownership of the Elem is transferred to the Mesh when this function is called, and it should play more nicely with the Elem::build() API which has always returned a std::unique_ptr.

Implements libMesh::MeshBase.

Definition at line 774 of file distributed_mesh.C.

{
  // The mesh now takes ownership of the Elem. Eventually the guts of
  // insert_elem(Elem*) will get moved to a private helper function, and
  // calling insert_elem(Elem*) directly will be deprecated.
  return insert_elem(e.release());
}

References libMesh::DistributedMesh::insert_elem().

◆ interior_mesh() [1/2]

MeshBase & libMesh::MeshBase::interior_mesh ( )

inlineinherited

Returns: A writeable reference to the interior mesh.

Definition at line 2058 of file mesh_base.h.

2058{ return *_interior_mesh; }

References libMesh::MeshBase::_interior_mesh.

◆ interior_mesh() [2/2]

const MeshBase & libMesh::MeshBase::interior_mesh ( ) const

inlineinherited

Returns: A mesh that may own interior parents of elements in this mesh. In most cases this mesh includes its own interior parents, but in cases where a separate "interior" mesh was used to create this mesh as a distinct lower-dimensional boundary (or boundary subset) mesh, the original mesh will be returned here.

Definition at line 2053 of file mesh_base.h.

2053{ return *_interior_mesh; }

References libMesh::MeshBase::_interior_mesh.

Referenced by libMesh::BoundaryInfo::add_elements(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::detect_interior_parents(), and libMesh::Parallel::Packing< Elem * >::unpack().

◆ is_prepared()

bool libMesh::MeshBase::is_prepared ( ) const

inherited

Returns: true if the mesh is marked as having undergone all of the preparation done in a call to prepare_for_use, false otherwise.

Definition at line 1065 of file mesh_base.C.

{
  return static_cast<bool>(_preparation);
}

References libMesh::MeshBase::_preparation.

Referenced by libMesh::MeshTools::Modification::all_tri(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DofMap::create_dof_constraints(), libMesh::MeshTools::Modification::flatten(), libMesh::MeshBase::get_info(), libMesh::SimplexRefiner::refine_elements(), libMesh::UnstructuredMesh::stitching_helper(), ConstraintOperatorTest::test1DCoarseningNewNodes(), ConstraintOperatorTest::test1DCoarseningOperator(), ConstraintOperatorTest::testCoreform(), MeshBaseTest::testMeshBaseVerifyHasCachedElemData(), MeshBaseTest::testMeshBaseVerifyHasNeighborPtrs(), MeshBaseTest::testMeshBaseVerifyRemovalPreparation(), libMesh::MeshTools::valid_is_prepared(), and libMesh::MeshTetInterface::volume_to_surface_mesh().

◆ is_replicated()

virtual bool libMesh::DistributedMesh::is_replicated ( ) const

inlinefinaloverridevirtualinherited

Returns: true if new elements and nodes can and should be created in synchronization on all processors, false otherwise

Reimplemented from libMesh::MeshBase.

Definition at line 182 of file distributed_mesh.h.

183 { return false; }

◆ is_serial()

virtual bool libMesh::DistributedMesh::is_serial ( ) const

inlinefinaloverridevirtualinherited

Returns: true if all elements and nodes of the mesh exist on the current processor, false otherwise

Reimplemented from libMesh::MeshBase.

Definition at line 160 of file distributed_mesh.h.

161 { return _is_serial; }

References libMesh::DistributedMesh::_is_serial.

Referenced by libMesh::DistributedMesh::redistribute().

◆ is_serial_on_zero()

virtual bool libMesh::DistributedMesh::is_serial_on_zero ( ) const

inlinefinaloverridevirtualinherited

Returns: true if all elements and nodes of the mesh exist on the processor 0, false otherwise

Reimplemented from libMesh::MeshBase.

Definition at line 167 of file distributed_mesh.h.

168 { return _is_serial || _is_serial_on_proc_0; }

References libMesh::DistributedMesh::_is_serial, and libMesh::DistributedMesh::_is_serial_on_proc_0.

Referenced by main().

◆ libmesh_assert_valid_parallel_flags()

void libMesh::DistributedMesh::libmesh_assert_valid_parallel_flags ( ) const

inherited

Verify refinement_flag and p_refinement_flag consistency of our elements containers.

Calls libmesh_assert() on each possible failure.

Definition at line 1251 of file distributed_mesh.C.

{
#if defined(LIBMESH_ENABLE_AMR) && !defined(NDEBUG)
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type pmax_elem_id = this->parallel_max_elem_id();
 
  for (dof_id_type i=0; i != pmax_elem_id; ++i)
    {
      Elem * el = _elements[i]; // Returns nullptr if there's no map entry
 
      unsigned int refinement_flag   = el ?
        static_cast<unsigned int> (el->refinement_flag()) : libMesh::invalid_uint;
      unsigned int p_refinement_flag = el ?
        static_cast<unsigned int> (el->p_refinement_flag()) : libMesh::invalid_uint;
 
      libmesh_assert(this->comm().semiverify(el ? &refinement_flag : nullptr));
 
      // p refinement flags aren't always kept correct on inactive
      // ghost elements
      libmesh_assert(this->comm().semiverify((el && el->active()) ? &p_refinement_flag : nullptr));
    }
#endif // LIBMESH_ENABLE_AMR
}

References libMesh::DistributedMesh::_elements, libMesh::Elem::active(), libMesh::ParallelObject::comm(), libMesh::invalid_uint, libMesh::libmesh_assert(), libMesh::Elem::p_refinement_flag(), libMesh::DistributedMesh::parallel_max_elem_id(), and libMesh::Elem::refinement_flag().

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), and libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ libmesh_assert_valid_parallel_ids()

void libMesh::DistributedMesh::libmesh_assert_valid_parallel_ids ( ) const

overridevirtualinherited

Verify id and processor_id consistency of our elements and nodes containers.

Calls libmesh_assert() on each possible failure.

Reimplemented from libMesh::MeshBase.

Definition at line 1220 of file distributed_mesh.C.

{
  this->libmesh_assert_valid_parallel_object_ids (this->_elements);
  this->libmesh_assert_valid_parallel_object_ids (this->_nodes);
}

References libMesh::DistributedMesh::_elements, libMesh::DistributedMesh::_nodes, and libMesh::DistributedMesh::libmesh_assert_valid_parallel_object_ids().

Referenced by libMesh::BoundaryInfo::add_elements(), libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), and libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ libmesh_assert_valid_parallel_object_ids()

template<typename T >

void libMesh::DistributedMesh::libmesh_assert_valid_parallel_object_ids ( const dofobject_container< T > & objects ) const

inherited

Verify id, processor_id, and if applicable unique_id consistency of a parallel objects container.

Calls libmesh_assert() on each possible failure in that container.

Definition at line 1164 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  const dof_id_type pmax_node_id = this->parallel_max_node_id();
  const dof_id_type pmax_elem_id = this->parallel_max_elem_id();
  const dof_id_type pmax_id = std::max(pmax_node_id, pmax_elem_id);
 
  for (dof_id_type i=0; i != pmax_id; ++i)
    {
      T * obj = objects[i]; // Returns nullptr if there's no map entry
 
      // Local lookups by id should return the requested object
      libmesh_assert(!obj || obj->id() == i);
 
      // All processors with an object should agree on id
#ifndef NDEBUG
      const dof_id_type dofid = obj && obj->valid_id() ?
        obj->id() : DofObject::invalid_id;
      libmesh_assert(this->comm().semiverify(obj ? &dofid : nullptr));
#endif
 
      // All processors with an object should agree on processor id
      const dof_id_type procid = obj && obj->valid_processor_id() ?
        obj->processor_id() : DofObject::invalid_processor_id;
      libmesh_assert(this->comm().semiverify(obj ? &procid : nullptr));
 
      dof_id_type min_procid = procid;
      this->comm().min(min_procid);
 
      // Either:
      // 1.) I own this elem (min_procid == this->processor_id()) *and* I have a valid pointer to it (obj != nullptr)
      // or
      // 2.) I don't own this elem (min_procid != this->processor_id()).  (In this case I may or may not have a valid pointer to it.)
 
      // Original assert logic
      // libmesh_assert (min_procid != this->processor_id() || obj);
 
      // More human-understandable logic...
      libmesh_assert (
                      ((min_procid == this->processor_id()) && obj)
                      ||
                      (min_procid != this->processor_id())
                      );
 
#if defined(LIBMESH_ENABLE_UNIQUE_ID) && !defined(NDEBUG)
      // All processors with an object should agree on unique id
      const unique_id_type uniqueid = obj ? obj->unique_id() : 0;
      libmesh_assert(this->comm().semiverify(obj ? &uniqueid : nullptr));
#endif
    }
}

References libMesh::ParallelObject::comm(), libMesh::DofObject::invalid_id, libMesh::DofObject::invalid_processor_id, libMesh::libmesh_assert(), libMesh::Parallel::Communicator::min(), libMesh::DistributedMesh::parallel_max_elem_id(), libMesh::DistributedMesh::parallel_max_node_id(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::DistributedMesh::libmesh_assert_valid_parallel_ids().

◆ libmesh_assert_valid_parallel_p_levels()

void libMesh::DistributedMesh::libmesh_assert_valid_parallel_p_levels ( ) const

inherited

Verify p_level consistency of our elements containers.

Calls libmesh_assert() on each possible failure.

Definition at line 1228 of file distributed_mesh.C.

{
#ifndef NDEBUG
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type pmax_elem_id = this->parallel_max_elem_id();
 
  for (dof_id_type i=0; i != pmax_elem_id; ++i)
    {
      Elem * el = _elements[i]; // Returns nullptr if there's no map entry
 
      unsigned int p_level = el ?  (el->p_level()) : libMesh::invalid_uint;
 
      // All processors with an active element should agree on p level
      libmesh_assert(this->comm().semiverify((el && el->active()) ? &p_level : nullptr));
    }
#endif
}

References libMesh::DistributedMesh::_elements, libMesh::Elem::active(), libMesh::ParallelObject::comm(), libMesh::invalid_uint, libMesh::libmesh_assert(), libMesh::Elem::p_level(), and libMesh::DistributedMesh::parallel_max_elem_id().

Referenced by libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ locally_equals()

bool libMesh::MeshBase::locally_equals ( const MeshBase & other_mesh ) const

inherited

This behaves the same as operator==, but only for the local and ghosted aspects of the mesh; i.e.

operator== is true iff local equality is true on every rank.

Definition at line 284 of file mesh_base.C.

{
  // Check whether (almost) everything in the base is equal
  //
  // We don't check _next_unique_id here, because it's expected to
  // change in a DistributedMesh prepare_for_use(); it's conceptually
  // "mutable".
  //
  // We use separate if statements instead of logical operators here,
  // to make it easy to see the failing condition when using a
  // debugger to figure out why a MeshTools::valid_is_prepared(mesh)
  // is failing.
  if (_n_parts != other_mesh._n_parts)
    return false;
  if (_default_mapping_type != other_mesh._default_mapping_type)
    return false;
  if (_default_mapping_data != other_mesh._default_mapping_data)
    return false;
  if (_preparation != other_mesh._preparation)
    return false;
  if (_count_lower_dim_elems_in_point_locator !=
        other_mesh._count_lower_dim_elems_in_point_locator)
    return false;
 
  // We should either both have our own interior parents or both not;
  // but if we both don't then we can't really assert anything else
  // because pointing at the same interior mesh is fair but so is
  // pointing at two different copies of "the same" interior mesh.
  if ((_interior_mesh == this) !=
      (other_mesh._interior_mesh == &other_mesh))
    return false;
 
  if (_skip_noncritical_partitioning != other_mesh._skip_noncritical_partitioning)
    return false;
  if (_skip_all_partitioning != other_mesh._skip_all_partitioning)
    return false;
  if (_skip_renumber_nodes_and_elements != other_mesh._skip_renumber_nodes_and_elements)
    return false;
  if (_skip_find_neighbors != other_mesh._skip_find_neighbors)
    return false;
  if (_skip_detect_interior_parents != other_mesh._skip_detect_interior_parents)
    return false;
  if (_allow_remote_element_removal != other_mesh._allow_remote_element_removal)
    return false;
  if (_allow_node_and_elem_unique_id_overlap != other_mesh._allow_node_and_elem_unique_id_overlap)
    return false;
  if (_spatial_dimension != other_mesh._spatial_dimension)
    return false;
  if (_n_constraint_rows != other_mesh._n_constraint_rows)
    return false;
  if (_point_locator_close_to_point_tol != other_mesh._point_locator_close_to_point_tol)
    return false;
  if (_block_id_to_name != other_mesh._block_id_to_name)
    return false;
  if (_elem_dims != other_mesh._elem_dims)
    return false;
  if (_elem_default_orders != other_mesh._elem_default_orders)
    return false;
  if (_supported_nodal_order != other_mesh._supported_nodal_order)
    return false;
  if (_mesh_subdomains != other_mesh._mesh_subdomains)
    return false;
  if (_all_elemset_ids != other_mesh._all_elemset_ids)
    return false;
  if (_elem_integer_names != other_mesh._elem_integer_names)
    return false;
  if (_elem_integer_default_values != other_mesh._elem_integer_default_values)
    return false;
  if (_node_integer_names != other_mesh._node_integer_names)
    return false;
  if (_node_integer_default_values != other_mesh._node_integer_default_values)
    return false;
  if (static_cast<bool>(_default_ghosting) != static_cast<bool>(other_mesh._default_ghosting))
    return false;
  if (static_cast<bool>(_partitioner) != static_cast<bool>(other_mesh._partitioner))
    return false;
  if (*boundary_info != *other_mesh.boundary_info)
    return false;
 
  // First check whether the "existence" of the two pointers differs (one present, one absent)
  if (static_cast<bool>(_disjoint_neighbor_boundary_pairs) !=
      static_cast<bool>(other_mesh._disjoint_neighbor_boundary_pairs))
    return false;
  // If both exist, compare the contents (Weak Test: just compare sizes like `_ghosting_functors`)
  if (_disjoint_neighbor_boundary_pairs &&
      (_disjoint_neighbor_boundary_pairs->size() != other_mesh._disjoint_neighbor_boundary_pairs->size()))
    return false;
 
  const constraint_rows_type & other_rows =
    other_mesh.get_constraint_rows();
  for (const auto & [node, row] : this->_constraint_rows)
    {
      const dof_id_type node_id = node->id();
      const Node * other_node = other_mesh.query_node_ptr(node_id);
      if (!other_node)
        return false;
 
      auto it = other_rows.find(other_node);
      if (it == other_rows.end())
        return false;
 
      const auto & other_row = it->second;
      if (row.size() != other_row.size())
        return false;
 
      for (auto i : index_range(row))
        {
          const auto & [elem_pair, coef] = row[i];
          const auto & [other_elem_pair, other_coef] = other_row[i];
          libmesh_assert(elem_pair.first);
          libmesh_assert(other_elem_pair.first);
          if (elem_pair.first->id() !=
              other_elem_pair.first->id() ||
              elem_pair.second !=
              other_elem_pair.second ||
              coef != other_coef)
            return false;
        }
    }
 
  for (const auto & [elemset_code, elemset_ptr] : this->_elemset_codes)
    if (const auto it = other_mesh._elemset_codes.find(elemset_code);
        it == other_mesh._elemset_codes.end() || *elemset_ptr != *it->second)
      return false;
 
  // FIXME: we have no good way to compare ghosting functors, since
  // they're in a vector of pointers, and we have no way *at all*
  // to compare ghosting functors, since they don't have operator==
  // defined and we encourage users to subclass them.  We can check if
  // we have the same number, is all.
  if (_ghosting_functors.size() !=
      other_mesh._ghosting_functors.size())
    return false;
 
  // Same deal for partitioners.  We tested that we both have one or
  // both don't, but are they equivalent?  Let's guess "yes".
 
  // Now let the subclasses decide whether everything else is equal
  return this->subclass_locally_equals(other_mesh);
}

Referenced by libMesh::MeshBase::operator==().

◆ max_elem_id()

virtual dof_id_type libMesh::DistributedMesh::max_elem_id ( ) const

inlinefinaloverridevirtualinherited

Returns: A number one greater than the maximum element id in the mesh. A more apt name for this method would be end_elem_id

Implements libMesh::MeshBase.

Definition at line 275 of file distributed_mesh.h.

275{ return _max_elem_id; }

References libMesh::DistributedMesh::_max_elem_id.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), MeshPerElemTest< elem_type >::meshes_equal_enough(), and libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ max_node_id()

virtual dof_id_type libMesh::DistributedMesh::max_node_id ( ) const

inlinefinaloverridevirtualinherited

Returns: A number one greater than the maximum node id in the mesh. A more apt name for this method would be end_node_id

Implements libMesh::MeshBase.

Definition at line 271 of file distributed_mesh.h.

271{ return _max_node_id; }

References libMesh::DistributedMesh::_max_node_id.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), MeshPerElemTest< elem_type >::meshes_equal_enough(), and libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ merge_extra_integer_names()

std::pair< std::vector< unsigned int >, std::vector< unsigned int > > libMesh::MeshBase::merge_extra_integer_names ( const MeshBase & other )

protectedinherited

Merge extra-integer arrays from an other mesh.

Returns two mappings from index values in other to (possibly newly created) index values with the same string name in this mesh, the first for element integers and the second for node integers.

Definition at line 2400 of file mesh_base.C.

{
  std::pair<std::vector<unsigned int>, std::vector<unsigned int>> returnval;
  returnval.first = this->add_elem_integers(other._elem_integer_names, true, &other._elem_integer_default_values);
  returnval.second = this->add_node_integers(other._node_integer_names, true, &other._node_integer_default_values);
  return returnval;
}

References libMesh::MeshBase::_elem_integer_default_values, libMesh::MeshBase::_elem_integer_names, libMesh::MeshBase::_node_integer_default_values, libMesh::MeshBase::_node_integer_names, libMesh::MeshBase::add_elem_integers(), and libMesh::MeshBase::add_node_integers().

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::UnstructuredMesh::create_submesh().

◆ mesh_dimension()

unsigned int libMesh::MeshBase::mesh_dimension ( ) const

inherited

Returns: The logical dimension of the mesh; i.e. the manifold dimension of the elements in the mesh. When we have multi-dimensional meshes (e.g. hexes and quads in the same mesh) then this will return the largest such dimension.

Definition at line 435 of file mesh_base.C.

{
  if (!_elem_dims.empty())
    return cast_int<unsigned int>(*_elem_dims.rbegin());
  return 0;
}

References libMesh::MeshBase::_elem_dims.

Referenced by libMesh::UniformRefinementEstimator::_estimate_error(), libMesh::HPCoarsenTest::add_projection(), libMesh::UnstructuredMesh::all_complete_order_range(), libMesh::UnstructuredMesh::all_second_order_range(), libMesh::MeshTools::Modification::all_tri(), alternative_fe_assembly(), LinearElasticity::assemble(), assemble(), assemble(), assemble_1D(), AssembleOptimization::assemble_A_and_F(), assemble_biharmonic(), assemble_cd(), assemble_cd(), assemble_divgrad(), assemble_elasticity(), assemble_ellipticdg(), assemble_func(), assemble_graddiv(), assemble_helmholtz(), assemble_laplace(), assemble_mass(), assemble_matrices(), assemble_poisson(), assemble_poisson(), assemble_poisson(), assemble_SchroedingerEquation(), assemble_shell(), assemble_stokes(), assemble_temperature_jump(), assemble_wave(), assemble_wave(), libMesh::MeshTools::Generation::build_cube(), libMesh::MeshBase::cache_elem_data(), compute_enriched_soln(), compute_jacobian(), compute_residual(), LinearElasticity::compute_stresses(), LargeDeformationElasticity::compute_stresses(), LinearElasticityWithContact::compute_stresses(), compute_stresses(), libMesh::VariationalSmootherConstraint::constrain(), libMesh::VariationalSmootherConstraint::constrain_node_to_line(), libMesh::VariationalSmootherConstraint::constrain_node_to_plane(), libMesh::DofMap::create_dof_constraints(), libMesh::MeshTools::Modification::distort(), NavierSystem::element_constraint(), HeatSystem::element_time_derivative(), NavierSystem::element_time_derivative(), SolidSystem::element_time_derivative(), libMesh::ExactErrorEstimator::estimate_error(), fe_assembly(), libMesh::VariationalSmootherConstraint::fix_node(), libMesh::MeshRefinement::flag_elements_by_elem_fraction(), libMesh::MeshRefinement::flag_elements_by_nelem_target(), NavierSystem::forcing(), form_functionA(), form_functionB(), form_matrixA(), libMesh::ReplicatedMesh::get_boundary_points(), libMesh::LaplaceMeshSmoother::init(), libMesh::PointLocatorTree::init(), NavierSystem::init_data(), SolidSystem::init_data(), ElasticityRBConstruction::init_data(), libMesh::ExodusII_IO_Helper::initialize(), libMesh::Nemesis_IO_Helper::initialize(), integrate_function(), LargeDeformationElasticity::jacobian(), LaplaceYoung::jacobian(), main(), NavierSystem::mass_residual(), Integrate::operator()(), libMesh::PatchRecoveryErrorEstimator::EstimateError::operator()(), libMesh::SmoothnessEstimator::EstimateSmoothness::operator()(), libMesh::WeightedPatchRecoveryErrorEstimator::EstimateError::operator()(), NavierSystem::postprocess(), libMesh::VTKIO::read(), libMesh::Nemesis_IO::read(), libMesh::GMVIO::read(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_connectivity(), libMesh::System::read_header(), libMesh::UCDIO::read_implementation(), libMesh::XdrIO::read_serialized_connectivity(), LargeDeformationElasticity::residual(), LaplaceYoung::residual(), LinearElasticityWithContact::residual_and_jacobian(), SolidSystem::save_initial_mesh(), libMesh::HPCoarsenTest::select_refinement(), libMesh::PetscPreconditioner< T >::set_hypre_ads_data(), libMesh::PetscPreconditioner< T >::set_hypre_ams_data(), libMesh::PetscPreconditioner< T >::set_petsc_aux_data(), setup(), NavierSystem::side_constraint(), libMesh::MeshTools::Modification::smooth(), MeshSpatialDimensionTest::test1D(), MeshSpatialDimensionTest::test2D(), CheckpointIOTest::testC0PolygonCheckpoint(), CheckpointIOTest::testC0PolyhedronCheckpoint(), BoundaryMeshSubdomainTest::testDefaultSubdomain(), InfFERadialTest::testInfQuants(), InfFERadialTest::testInfQuants_numericDeriv(), BoundaryMeshSubdomainTest::testPerBoundarySubdomain(), InfFERadialTest::testSides(), InfFERadialTest::testSingleOrder(), BoundaryMeshSubdomainTest::testSingleSubdomain(), MeshSmootherTest::testVariationalSmootherRegression(), libMesh::BoundaryVolumeSolutionTransfer::transfer(), libMesh::DTKSolutionTransfer::transfer(), libMesh::MeshTools::volume(), libMesh::PostscriptIO::write(), libMesh::CheckpointIO::write(), libMesh::GMVIO::write_binary(), libMesh::TecplotIO::write_binary(), libMesh::GMVIO::write_discontinuous_gmv(), libMesh::UCDIO::write_implementation(), libMesh::UCDIO::write_nodal_data(), libMesh::EnsightIO::write_scalar_ascii(), libMesh::GnuPlotIO::write_solution(), and libMesh::EnsightIO::write_vector_ascii().

◆ move_nodes_and_elements()

virtual void libMesh::UnstructuredMesh::move_nodes_and_elements ( MeshBase && other_mesh )

pure virtualinherited

Move node and elements from other_mesh to this mesh.

Implemented in libMesh::ReplicatedMesh.

◆ n_active_elem()

dof_id_type libMesh::DistributedMesh::n_active_elem ( ) const

finaloverridevirtualinherited

Returns: The number of active elements in the mesh.

Implemented in terms of active_element_iterators.

Implements libMesh::MeshBase.

Definition at line 1779 of file distributed_mesh.C.

{
  parallel_object_only();
 
  // Get local active elements first
  dof_id_type active_elements =
    static_cast<dof_id_type>(std::distance (this->active_local_elements_begin(),
                                            this->active_local_elements_end()));
  this->comm().sum(active_elements);
 
  // Then add unpartitioned active elements, which should exist on
  // every processor
  active_elements +=
    static_cast<dof_id_type>(std::distance
                             (this->active_pid_elements_begin(DofObject::invalid_processor_id),
                              this->active_pid_elements_end(DofObject::invalid_processor_id)));
  return active_elements;
}

References libMesh::ParallelObject::comm(), libMesh::DofObject::invalid_processor_id, and libMesh::Parallel::Communicator::sum().

◆ n_active_elem_on_proc()

dof_id_type libMesh::MeshBase::n_active_elem_on_proc ( const processor_id_type proc ) const

inherited

Returns: The number of active elements on processor proc.

Definition at line 1243 of file mesh_base.C.

{
  libmesh_assert_less (proc_id, this->n_processors());
  return static_cast<dof_id_type>(std::distance (this->active_pid_elements_begin(proc_id),
                                                 this->active_pid_elements_end  (proc_id)));
}

References libMesh::ParallelObject::n_processors().

Referenced by libMesh::MeshBase::n_active_local_elem().

◆ n_active_local_elem()

dof_id_type libMesh::MeshBase::n_active_local_elem ( ) const

inlineinherited

Returns: The number of active elements on the local processor.

Definition at line 711 of file mesh_base.h.

712 { return this->n_active_elem_on_proc (this->processor_id()); }

libMesh::MeshBase::n_active_elem_on_proc

dof_id_type n_active_elem_on_proc(const processor_id_type proc) const

Definition mesh_base.C:1243

References libMesh::MeshBase::n_active_elem_on_proc(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::Partitioner::_find_global_index_by_pid_map(), libMesh::Partitioner::assign_partitioning(), libMesh::Partitioner::build_graph(), libMesh::VTKIO::cells_to_vtk(), and BoundaryInfoTest::testBoundaryOnChildrenElementsRefineCoarsen().

◆ n_active_sub_elem()

dof_id_type libMesh::MeshBase::n_active_sub_elem ( ) const

inherited

Same as n_sub_elem(), but only counts active elements.

Definition at line 1264 of file mesh_base.C.

{
  dof_id_type ne=0;
 
  for (const auto & elem : this->active_element_ptr_range())
    ne += elem->n_sub_elem();
 
  return ne;
}

Referenced by libMesh::TecplotIO::write_ascii(), libMesh::GMVIO::write_ascii_old_impl(), and libMesh::TecplotIO::write_binary().

◆ n_constraint_rows()

dof_id_type libMesh::MeshBase::n_constraint_rows ( ) const

inlineinherited

Returns how many total constraint rows we have.

This is cached data, so it can be called from individual ranks.

Definition at line 2691 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_synched_id_counts);
 
  return _n_constraint_rows;
}

References libMesh::MeshBase::_n_constraint_rows, libMesh::MeshBase::_preparation, libMesh::MeshBase::Preparation::has_synched_id_counts, and libMesh::libmesh_assert().

Referenced by libMesh::DofMap::create_dof_constraints(), and libMesh::DofMap::process_mesh_constraint_rows().

◆ n_elem()

virtual dof_id_type libMesh::DistributedMesh::n_elem ( ) const

inlinefinaloverridevirtualinherited

Returns: The number of elements in the mesh.

The standard n_elem() function may return a cached value on distributed meshes, and so can be called by any processor at any time.

Implements libMesh::MeshBase.

Definition at line 273 of file distributed_mesh.h.

273{ return _n_elem; }

References libMesh::DistributedMesh::_n_elem.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::renumber_nodes_and_elements(), AllRBBTest::test_circle(), AllRBBTest::test_sphere(), ExodusC0PolyhedronTest::test_write_and_read_hexagonal_prism(), and ExodusC0PolygonTest::test_write_and_read_pentagon().

◆ n_elem_integers()

unsigned int libMesh::MeshBase::n_elem_integers ( ) const

inlineinherited

Definition at line 1094 of file mesh_base.h.

1094{ return _elem_integer_names.size(); }

References libMesh::MeshBase::_elem_integer_names.

Referenced by libMesh::CheckpointIO::read_connectivity(), libMesh::XdrIO::write(), and libMesh::CheckpointIO::write().

◆ n_elem_on_proc()

dof_id_type libMesh::MeshBase::n_elem_on_proc ( const processor_id_type proc ) const

inherited

Returns: The number of elements on processor proc.

Definition at line 1230 of file mesh_base.C.

{
  // We're either counting a processor's elements or unpartitioned
  // elements
  libmesh_assert (proc_id < this->n_processors() ||
                  proc_id == DofObject::invalid_processor_id);
 
  return static_cast<dof_id_type>(std::distance (this->pid_elements_begin(proc_id),
                                                 this->pid_elements_end  (proc_id)));
}

References libMesh::DofObject::invalid_processor_id, libMesh::libmesh_assert(), and libMesh::ParallelObject::n_processors().

Referenced by libMesh::MeshBase::n_local_elem(), and libMesh::MeshBase::n_unpartitioned_elem().

◆ n_elemsets()

unsigned int libMesh::MeshBase::n_elemsets ( ) const

inherited

Returns the number of unique elemset ids which have been added via add_elemset_code(), which is the size of the _all_elemset_ids set.

Definition at line 487 of file mesh_base.C.

{
  return _all_elemset_ids.size();
}

References libMesh::MeshBase::_all_elemset_ids.

Referenced by libMesh::MeshBase::get_info(), libMesh::ExodusII_IO_Helper::initialize(), libMesh::ExodusII_IO::read(), and libMesh::ExodusII_IO_Helper::write_elemsets().

◆ n_local_elem()

dof_id_type libMesh::MeshBase::n_local_elem ( ) const

inlineinherited

Returns: The number of elements on the local processor.

Definition at line 694 of file mesh_base.h.

695 { return this->n_elem_on_proc (this->processor_id()); }

libMesh::MeshBase::n_elem_on_proc

dof_id_type n_elem_on_proc(const processor_id_type proc) const

Definition mesh_base.C:1230

References libMesh::MeshBase::n_elem_on_proc(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::DTKAdapter::DTKAdapter(), libMesh::MeshBase::get_info(), libMesh::DistributedMesh::parallel_n_elem(), and DofMapTest::testBadElemFECombo().

◆ n_local_nodes()

dof_id_type libMesh::MeshBase::n_local_nodes ( ) const

inlineinherited

Returns: The number of nodes on the local processor.

Definition at line 588 of file mesh_base.h.

589 { return this->n_nodes_on_proc (this->processor_id()); }

libMesh::MeshBase::n_nodes_on_proc

dof_id_type n_nodes_on_proc(const processor_id_type proc) const

Definition mesh_base.C:1217

References libMesh::MeshBase::n_nodes_on_proc(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::MeshBase::get_info(), libMesh::VTKIO::nodes_to_vtk(), and libMesh::DistributedMesh::parallel_n_nodes().

◆ n_local_subdomains()

subdomain_id_type libMesh::MeshBase::n_local_subdomains ( ) const

inherited

Returns: The number of subdomains in the local mesh. Subdomains correspond to separate subsets of the mesh which could correspond e.g. to different materials in a solid mechanics application, or regions where different physical processes are important. The subdomain mapping is independent from the parallel decomposition.

Definition at line 1205 of file mesh_base.C.

{
  std::set<subdomain_id_type> ids;
 
  this->subdomain_ids (ids, /* global = */ false);
 
  return cast_int<subdomain_id_type>(ids.size());
}

References libMesh::MeshBase::subdomain_ids().

Referenced by libMesh::MeshBase::get_info().

◆ n_node_integers()

unsigned int libMesh::MeshBase::n_node_integers ( ) const

inlineinherited

Definition at line 1216 of file mesh_base.h.

1216{ return _node_integer_names.size(); }

References libMesh::MeshBase::_node_integer_names.

Referenced by libMesh::CheckpointIO::read_nodes(), libMesh::XdrIO::write(), and libMesh::CheckpointIO::write().

◆ n_nodes()

virtual dof_id_type libMesh::DistributedMesh::n_nodes ( ) const

inlinefinaloverridevirtualinherited

Returns: The number of nodes in the mesh.

This function and others must be defined in derived classes since the MeshBase class has no specific storage for nodes or elements. The standard n_nodes() function may return a cached value on distributed meshes, and so can be called by any processor at any time.

Implements libMesh::MeshBase.

Definition at line 270 of file distributed_mesh.h.

270{ return _n_nodes; }

References libMesh::DistributedMesh::_n_nodes.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::renumber_nodes_and_elements(), AllRBBTest::test_circle(), and MixedOrderTest::testStitch().

◆ n_nodes_on_proc()

dof_id_type libMesh::MeshBase::n_nodes_on_proc ( const processor_id_type proc ) const

inherited

Returns: The number of nodes on processor proc.

Definition at line 1217 of file mesh_base.C.

{
  // We're either counting a processor's nodes or unpartitioned
  // nodes
  libmesh_assert (proc_id < this->n_processors() ||
                  proc_id == DofObject::invalid_processor_id);
 
  return static_cast<dof_id_type>(std::distance (this->pid_nodes_begin(proc_id),
                                                 this->pid_nodes_end  (proc_id)));
}

References libMesh::DofObject::invalid_processor_id, libMesh::libmesh_assert(), and libMesh::ParallelObject::n_processors().

Referenced by libMesh::MeshBase::n_local_nodes(), and libMesh::MeshBase::n_unpartitioned_nodes().

◆ n_partitions()

unsigned int libMesh::MeshBase::n_partitions ( ) const

inlineinherited

Returns: The number of partitions which have been defined via a call to either mesh.partition() or by building a Partitioner object and calling partition.

Note: The partitioner object is responsible for setting this value.

Definition at line 1530 of file mesh_base.h.

1531 { return _n_parts; }

References libMesh::MeshBase::_n_parts.

Referenced by libMesh::Partitioner::assign_partitioning(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::get_info(), libMesh::BoundaryInfo::sync(), CheckpointIOTest::testSplitter(), libMesh::NameBasedIO::write(), libMesh::GMVIO::write_ascii_new_impl(), and libMesh::GMVIO::write_ascii_old_impl().

◆ n_processors()

processor_id_type libMesh::ParallelObject::n_processors ( ) const

inlineinherited

Returns: The number of processors in the group.

Definition at line 103 of file parallel_object.h.

  {
    processor_id_type returnval =
      cast_int<processor_id_type>(_communicator.size());
    libmesh_assert(returnval); // We never have an empty comm
    return returnval;
  }

References libMesh::ParallelObject::_communicator, libMesh::libmesh_assert(), and libMesh::Parallel::Communicator::size().

◆ n_sub_elem()

dof_id_type libMesh::MeshBase::n_sub_elem ( ) const

inherited

Returns: The number of elements that will be written out in certain I/O formats.

For example, a 9-noded quadrilateral will be broken into 4 linear sub-elements for plotting purposes. Thus, for a mesh of 2 QUAD9 elements n_tecplot_elem() will return 8. Implemented in terms of element_iterators.

Definition at line 1252 of file mesh_base.C.

{
  dof_id_type ne=0;
 
  for (const auto & elem : this->element_ptr_range())
    ne += elem->n_sub_elem();
 
  return ne;
}

◆ n_subdomains()

subdomain_id_type libMesh::MeshBase::n_subdomains ( ) const

inherited

Returns: The number of subdomains in the global mesh. Subdomains correspond to separate subsets of the mesh which could correspond e.g. to different materials in a solid mechanics application, or regions where different physical processes are important. The subdomain mapping is independent from the parallel decomposition.

Definition at line 1191 of file mesh_base.C.

{
  // This requires an inspection on every processor
  parallel_object_only();
 
  std::set<subdomain_id_type> ids;
 
  this->subdomain_ids (ids);
 
  return cast_int<subdomain_id_type>(ids.size());
}

References libMesh::MeshBase::subdomain_ids().

Referenced by libMesh::MeshBase::get_info(), OverlappingCouplingFunctor::OverlappingCouplingFunctor(), MeshSubdomainIDTest::testUnpartitioned(), libMesh::XdrIO::write(), and libMesh::NameBasedIO::write_nodal_data().

◆ n_unpartitioned_elem()

dof_id_type libMesh::MeshBase::n_unpartitioned_elem ( ) const

inlineinherited

Returns: The number of elements owned by no processor.

Definition at line 700 of file mesh_base.h.

701 { return this->n_elem_on_proc (DofObject::invalid_processor_id); }

References libMesh::DofObject::invalid_processor_id, and libMesh::MeshBase::n_elem_on_proc().

Referenced by libMesh::MeshBase::complete_preparation(), libMesh::DistributedMesh::parallel_n_elem(), and libMesh::MeshBase::partition().

◆ n_unpartitioned_nodes()

dof_id_type libMesh::MeshBase::n_unpartitioned_nodes ( ) const

inlineinherited

Returns: The number of nodes owned by no processor.

Definition at line 594 of file mesh_base.h.

595 { return this->n_nodes_on_proc (DofObject::invalid_processor_id); }

References libMesh::DofObject::invalid_processor_id, and libMesh::MeshBase::n_nodes_on_proc().

Referenced by libMesh::MeshBase::complete_preparation(), and libMesh::DistributedMesh::parallel_n_nodes().

◆ next_unique_id()

unique_id_type libMesh::MeshBase::next_unique_id ( ) const

inlineinherited

Returns: The next unique id to be used.

Definition at line 607 of file mesh_base.h.

607{ return _next_unique_id; }

References libMesh::MeshBase::_next_unique_id.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::ExodusII_IO_Helper::set_dof_object_unique_id(), and libMesh::ExodusII_IO_Helper::write_elements().

◆ node_ptr() [1/2]

const Node * libMesh::DistributedMesh::node_ptr ( const dof_id_type i ) const

finaloverridevirtualinherited

Returns: A pointer to the \( i^{th} \) node, which should be present in this processor's subset of the mesh data structure.

Implements libMesh::MeshBase.

Definition at line 486 of file distributed_mesh.C.

{
  libmesh_assert(_nodes[i]);
  libmesh_assert_equal_to (_nodes[i]->id(), i);
 
  return _nodes[i];
}

References libMesh::DistributedMesh::_nodes, and libMesh::libmesh_assert().

Referenced by libMesh::DistributedMesh::fix_broken_node_and_element_numbering(), MeshPerElemTest< elem_type >::meshes_equal_enough(), DisjointNeighborTest::testDisjointNeighborConflictError(), and DisjointNeighborTest::testStitchCrossMesh().

◆ node_ptr() [2/2]

Node * libMesh::DistributedMesh::node_ptr ( const dof_id_type i )

finaloverridevirtualinherited

Returns: A writable pointer to the \( i^{th} \) node, which should be present in this processor's subset of the mesh data structure.

Implements libMesh::MeshBase.

Definition at line 497 of file distributed_mesh.C.

{
  libmesh_assert(_nodes[i]);
  libmesh_assert_equal_to (_nodes[i]->id(), i);
 
  return _nodes[i];
}

References libMesh::DistributedMesh::_nodes, and libMesh::libmesh_assert().

◆ node_ref() [1/2]

virtual Node & libMesh::MeshBase::node_ref ( const dof_id_type i )

inlinevirtualinherited

Returns: A reference to the \( i^{th} \) node, which should be present in this processor's subset of the mesh data structure.

Definition at line 751 of file mesh_base.h.

  {
    return *this->node_ptr(i);
  }

References libMesh::MeshBase::node_ptr().

◆ node_ref() [2/2]

virtual const Node & libMesh::MeshBase::node_ref ( const dof_id_type i ) const

inlinevirtualinherited

Returns: A constant reference (for reading only) to the \( i^{th} \) node, which should be present in this processor's subset of the mesh data structure.

Definition at line 742 of file mesh_base.h.

  {
    return *this->node_ptr(i);
  }

References libMesh::MeshBase::node_ptr().

Referenced by libMesh::SyncNodalPositions::act_on_data(), LinearElasticityWithContact::add_contact_edge_elements(), add_cube_convex_hull_to_mesh(), assemble_matrix_and_rhs(), libMesh::InfElemBuilder::build_inf_elem(), GhostDofConstraint::constrain(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshTools::correct_node_proc_ids(), libMesh::DTKAdapter::DTKAdapter(), fill_dirichlet_bc(), libMesh::MeshTools::Modification::interpolate_surface(), main(), libMesh::DistributedMesh::point(), libMesh::ReplicatedMesh::point(), libMesh::ExodusII_IO::read(), libMesh::XdrIO::read_serialized_nodes(), libMesh::DistributedMesh::renumber_nodes_and_elements(), LinearElasticityWithContact::residual_and_jacobian(), 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::LaplaceMeshSmoother::smooth(), libMesh::VariationalMeshSmoother::smooth(), libMesh::MeshTools::Modification::smooth(), libMesh::UnstructuredMesh::stitching_helper(), DofMapTest::testGhostConstraintSendList(), HDivGradTest::testGradByFiniteDifference(), MeshTriangulationTest::testPoly2TriHolesInterpRefined(), MeshSmootherTest::testVariationalSmoother(), MeshSmootherTest::testVariationalSmootherRegression(), libMesh::DTKAdapter::update_variable_values(), and libMesh::GmshIO::write_mesh().

◆ nodes_and_elements_equal()

bool libMesh::MeshBase::nodes_and_elements_equal ( const MeshBase & other_mesh ) const

protectedinherited

Tests for equality of all elements and nodes in the mesh.

Helper function for subclass_equals() in unstructured mesh subclasses.

Definition at line 2457 of file mesh_base.C.

{
  for (const auto & other_node : other_mesh.node_ptr_range())
    {
      const Node * node = this->query_node_ptr(other_node->id());
      if (!node)
        return false;
      if (*other_node != *node)
        return false;
    }
  for (const auto & node : this->node_ptr_range())
    if (!other_mesh.query_node_ptr(node->id()))
      return false;
 
  for (const auto & other_elem : other_mesh.element_ptr_range())
    {
      const Elem * elem = this->query_elem_ptr(other_elem->id());
      if (!elem)
        return false;
      if (!other_elem->topologically_equal(*elem))
        return false;
    }
  for (const auto & elem : this->element_ptr_range())
    if (!other_mesh.query_elem_ptr(elem->id()))
      return false;
 
  return true;
}

References libMesh::MeshBase::query_elem_ptr(), and libMesh::MeshBase::query_node_ptr().

◆ operator!=()

bool libMesh::MeshBase::operator!= ( const MeshBase & other_mesh ) const

inlineinherited

Definition at line 138 of file mesh_base.h.

  {
    return !(*this == other_mesh);
  }

◆ operator==()

bool libMesh::MeshBase::operator== ( const MeshBase & other_mesh ) const

inherited

This tests for exactly-equal data in all the senses that a mathematician would care about (element connectivity, nodal coordinates), but in the senses a programmer would care about it allows for non-equal equivalence in some ways (we accept different Elem/Node addresses in memory) but not others (we do not accept different subclass types, nor even different Elem/Node ids).

Though this method is non-virtual, its implementation calls the virtual function subclass_locally_equals() to test for equality of subclass-specific data as well.

Definition at line 274 of file mesh_base.C.

{
  LOG_SCOPE("operator==()", "MeshBase");
 
  bool is_equal = this->locally_equals(other_mesh);
  this->comm().min(is_equal);
  return is_equal;
}

References libMesh::ParallelObject::comm(), libMesh::MeshBase::locally_equals(), and libMesh::Parallel::Communicator::min().

◆ own_node()

void libMesh::DistributedMesh::own_node ( Node & n )

finaloverridevirtualinherited

Takes ownership of node n on this partition of a distributed mesh, by setting n.processor_id() to this->processor_id(), as well as changing n.id() and moving it in the mesh's internal container to give it a new authoritative id.

Reimplemented from libMesh::MeshBase.

Definition at line 869 of file distributed_mesh.C.

{
  // This had better be a node in our mesh
  libmesh_assert(_nodes[n.id()] == &n);
 
  _nodes[n.id()] = nullptr;
  _n_nodes--;
 
  n.set_id(DofObject::invalid_id);
  n.processor_id() = this->processor_id();
 
  this->add_node(&n);
}

References libMesh::DistributedMesh::_n_nodes, libMesh::DistributedMesh::_nodes, libMesh::DistributedMesh::add_node(), libMesh::DofObject::id(), libMesh::DofObject::invalid_id, libMesh::libmesh_assert(), libMesh::DofObject::processor_id(), libMesh::ParallelObject::processor_id(), and libMesh::DofObject::set_id().

◆ parallel_max_elem_id()

dof_id_type libMesh::DistributedMesh::parallel_max_elem_id ( ) const

inherited

Definition at line 372 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type max_local = 0;
 
  dofobject_container<Elem>::const_reverse_veclike_iterator
    rit = _elements.rbegin();
 
  const dofobject_container<Elem>::const_reverse_veclike_iterator
    rend = _elements.rend();
 
  // Look for the maximum element id.  Search backwards through
  // elements so we can break out early.  Beware of nullptr entries that
  // haven't yet been cleared from _elements.
  for (; rit != rend; ++rit)
    {
      const DofObject *d = *rit;
      if (d)
        {
          libmesh_assert(_elements[d->id()] == d);
          max_local = d->id() + 1;
          break;
        }
    }
 
  this->comm().max(max_local);
  return max_local;
}

References libMesh::DistributedMesh::_elements, libMesh::ParallelObject::comm(), libMesh::DofObject::id(), libMesh::libmesh_assert(), and libMesh::Parallel::Communicator::max().

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_flags(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_object_ids(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_p_levels(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ parallel_max_node_id()

dof_id_type libMesh::DistributedMesh::parallel_max_node_id ( ) const

inherited

Definition at line 446 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type max_local = 0;
 
  dofobject_container<Node>::const_reverse_veclike_iterator
    rit = _nodes.rbegin();
 
  const dofobject_container<Node>::const_reverse_veclike_iterator
    rend = _nodes.rend();
 
  // Look for the maximum node id.  Search backwards through
  // nodes so we can break out early.  Beware of nullptr entries that
  // haven't yet been cleared from _nodes
  for (; rit != rend; ++rit)
    {
      const DofObject *d = *rit;
      if (d)
        {
          libmesh_assert(_nodes[d->id()] == d);
          max_local = d->id() + 1;
          break;
        }
    }
 
  this->comm().max(max_local);
  return max_local;
}

References libMesh::DistributedMesh::_nodes, libMesh::ParallelObject::comm(), libMesh::DofObject::id(), libMesh::libmesh_assert(), and libMesh::Parallel::Communicator::max().

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::libmesh_assert_valid_parallel_object_ids(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ parallel_max_unique_id()

unique_id_type libMesh::DistributedMesh::parallel_max_unique_id ( ) const

overridevirtualinherited

Returns: A number greater than or equal to the maximum unique_id in the mesh.

Implements libMesh::MeshBase.

Definition at line 406 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  unique_id_type max_local = std::max(_next_unique_id,
                                      _next_unpartitioned_unique_id);
  this->comm().max(max_local);
  return max_local;
}

References libMesh::MeshBase::_next_unique_id, libMesh::DistributedMesh::_next_unpartitioned_unique_id, libMesh::ParallelObject::comm(), and libMesh::Parallel::Communicator::max().

Referenced by libMesh::DistributedMesh::set_next_unique_ids(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ parallel_n_elem()

dof_id_type libMesh::DistributedMesh::parallel_n_elem ( ) const

overridevirtualinherited

Returns: The number of elements in the mesh.

The parallel_n_elem() function computes a parallel-synchronized value on distributed meshes, and so must be called in parallel only.

Implements libMesh::MeshBase.

Definition at line 359 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type n_local = this->n_local_elem();
  this->comm().sum(n_local);
  n_local += this->n_unpartitioned_elem();
  return n_local;
}

References libMesh::ParallelObject::comm(), libMesh::MeshBase::n_local_elem(), libMesh::MeshBase::n_unpartitioned_elem(), and libMesh::Parallel::Communicator::sum().

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ parallel_n_nodes()

dof_id_type libMesh::DistributedMesh::parallel_n_nodes ( ) const

overridevirtualinherited

Returns: The number of nodes in the mesh.

This function and others must be overridden in derived classes since the MeshBase class has no specific storage for nodes or elements. The parallel_n_nodes() function computes a parallel-synchronized value on distributed meshes, and so must be called in parallel only.

Implements libMesh::MeshBase.

Definition at line 433 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  dof_id_type n_local = this->n_local_nodes();
  this->comm().sum(n_local);
  n_local += this->n_unpartitioned_nodes();
  return n_local;
}

References libMesh::ParallelObject::comm(), libMesh::MeshBase::n_local_nodes(), libMesh::MeshBase::n_unpartitioned_nodes(), and libMesh::Parallel::Communicator::sum().

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::renumber_nodes_and_elements(), DisjointNeighborTest::testStitchCrossMesh(), DisjointNeighborTest::testStitchingDiscontinuousBoundaries(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ partition() [1/2]

void libMesh::MeshBase::partition ( )

inlineinherited

Definition at line 1324 of file mesh_base.h.

1325 { this->partition(this->n_processors()); }

References libMesh::ParallelObject::n_processors(), and libMesh::MeshBase::partition().

Referenced by libMesh::MeshBase::complete_preparation(), and libMesh::MeshBase::partition().

◆ partition() [2/2]

void libMesh::MeshBase::partition ( const unsigned int n_parts )

virtualinherited

Call the default partitioner (currently metis_partition()).

Definition at line 1784 of file mesh_base.C.

{
  // If we get here and we have unpartitioned elements, we need that
  // fixed.
  if (this->n_unpartitioned_elem() > 0)
    {
      libmesh_assert (partitioner().get());
      libmesh_assert (this->is_serial());
      partitioner()->partition (*this, n_parts);
    }
  // A nullptr partitioner or a skip_partitioning(true) call or a
  // skip_noncritical_partitioning(true) call means don't repartition;
  // skip_noncritical_partitioning() checks all these.
  else if (!skip_noncritical_partitioning())
    {
      partitioner()->partition (*this, n_parts);
    }
  else
    {
      // Adaptive coarsening may have "orphaned" nodes on processors
      // whose elements no longer share them.  We need to check for
      // and possibly fix that.
      MeshTools::correct_node_proc_ids(*this);
 
      // Make sure locally cached partition count is correct
      this->recalculate_n_partitions();
 
      // Make sure any other locally cached data is correct
      this->update_post_partitioning();
    }
 
  _preparation.is_partitioned = true;
}

References libMesh::MeshBase::_preparation, libMesh::MeshTools::correct_node_proc_ids(), libMesh::MeshBase::Preparation::is_partitioned, libMesh::MeshBase::is_serial(), libMesh::libmesh_assert(), libMesh::MeshBase::n_unpartitioned_elem(), libMesh::MeshBase::partitioner(), libMesh::MeshBase::recalculate_n_partitions(), libMesh::MeshBase::skip_noncritical_partitioning(), and libMesh::MeshBase::update_post_partitioning().

Referenced by main(), libMesh::split_mesh(), ExtraIntegersTest::test_helper(), MappedSubdomainPartitionerTest::testMappedSubdomainPartitioner(), CheckpointIOTest::testMissingSplitError(), EquationSystemsTest::testRepartitionThenReinit(), and CheckpointIOTest::testSplitter().

◆ partitioner()

virtual std::unique_ptr< Partitioner > & libMesh::MeshBase::partitioner ( )

inlinevirtualinherited

A partitioner to use at each partitioning.

Definition at line 165 of file mesh_base.h.

165{ return _partitioner; }

References libMesh::MeshBase::_partitioner.

Referenced by main(), libMesh::MeshBase::partition(), libMesh::BoundaryInfo::sync(), MultiEvaluablePredTest::test(), MeshDeletionsTest::testDeleteElem(), DofMapTest::testGhostConstraintSendList(), and MappedSubdomainPartitionerTest::testMappedSubdomainPartitioner().

◆ point()

const Point & libMesh::DistributedMesh::point ( const dof_id_type i ) const

finaloverridevirtualinherited

Returns: A constant reference (for reading only) to the \( i^{th} \) point, which should be present in this processor's subset of the mesh data structure.

Implements libMesh::MeshBase.

Definition at line 479 of file distributed_mesh.C.

{
  return this->node_ref(i);
}

References libMesh::MeshBase::node_ref().

◆ post_dofobject_moves()

void libMesh::MeshBase::post_dofobject_moves ( MeshBase && other_mesh )

protectedinherited

Moves any superclass data (e.g.

GhostingFunctors that might rely on element and nodal data (which is managed by subclasses!) being already moved first.

Must be manually called in dofobject-managing subclass move operators.

Definition at line 2411 of file mesh_base.C.

{
  // Now that all the DofObject moving is done, we can move the GhostingFunctor objects
  // which include the _default_ghosting,_ghosting_functors and _shared_functors. We also need
  // to set the mesh object associated with these functors to the assignee mesh.
 
   // _default_ghosting
  _default_ghosting = std::move(other_mesh._default_ghosting);
  _default_ghosting->set_mesh(this);
 
  // _ghosting_functors
  _ghosting_functors = std::move(other_mesh._ghosting_functors);
 
  for (const auto gf : _ghosting_functors )
  {
    gf->set_mesh(this);
  }
 
  // _shared_functors
  _shared_functors = std::move(other_mesh._shared_functors);
 
  for (const auto & sf : _shared_functors )
  {
    (sf.second)->set_mesh(this);
  }
 
  // _constraint_rows
  _constraint_rows = std::move(other_mesh._constraint_rows);
  _n_constraint_rows = other_mesh._n_constraint_rows;
 
  if (other_mesh.partitioner())
    _partitioner = std::move(other_mesh.partitioner());
}

References libMesh::MeshBase::_constraint_rows, libMesh::MeshBase::_default_ghosting, libMesh::MeshBase::_ghosting_functors, libMesh::MeshBase::_n_constraint_rows, libMesh::MeshBase::_partitioner, and libMesh::MeshBase::_shared_functors.

Referenced by libMesh::ReplicatedMesh::operator=().

◆ preparation()

Preparation libMesh::MeshBase::preparation ( ) const

inlineinherited

Definition at line 213 of file mesh_base.h.

214 { return _preparation; }

References libMesh::MeshBase::_preparation.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::get_info(), libMesh::ReplicatedMesh::ReplicatedMesh(), libMesh::VariationalMeshSmoother::setup(), and DistributedMeshTest::testCopyConstructorUnsynchedIdCounts().

◆ prepare_for_use() [1/3]

void libMesh::MeshBase::prepare_for_use ( )

inherited

Definition at line 860 of file mesh_base.C.

{
  // Mark everything as unprepared, except for those things we've been
  // told we don't need to prepare, for backwards compatibility
  this->clear_point_locator();
  this->clear_stored_ranges();
  _preparation = false;
  _preparation.has_neighbor_ptrs = _skip_find_neighbors;
  _preparation.has_removed_remote_elements = !_allow_remote_element_removal;
 
  this->complete_preparation();
}

References libMesh::MeshBase::_allow_remote_element_removal, libMesh::MeshBase::_preparation, libMesh::MeshBase::_skip_find_neighbors, libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::clear_stored_ranges(), libMesh::MeshBase::complete_preparation(), libMesh::MeshBase::Preparation::has_neighbor_ptrs, and libMesh::MeshBase::Preparation::has_removed_remote_elements.

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::prepare_for_use(), libMesh::MeshBase::prepare_for_use(), libMesh::UnstructuredMesh::read(), and libMesh::UnstructuredMesh::stitching_helper().

◆ prepare_for_use() [2/3]

void libMesh::MeshBase::prepare_for_use ( const bool skip_renumber_nodes_and_elements )

inherited

Definition at line 843 of file mesh_base.C.

{
  libmesh_deprecated();
 
  // We only respect the users wish if they tell us to skip renumbering. If they tell us not to
  // skip renumbering but someone previously called allow_renumbering(false), then the latter takes
  // precedence
  if (skip_renumber_nodes_and_elements)
    this->allow_renumbering(false);
 
  this->prepare_for_use();
}

References libMesh::MeshBase::allow_renumbering(), and libMesh::MeshBase::prepare_for_use().

◆ prepare_for_use() [3/3]

void libMesh::MeshBase::prepare_for_use	(	const bool	skip_renumber_nodes_and_elements,
		const bool	skip_find_neighbors
	)

inherited

Prepare a newly created (or read) mesh for use.

This involves several steps: 1.) renumbering (if enabled) 2.) removing any orphaned nodes 3.) updating parallel id counts 4.) finding neighbor links 5.) caching summarized element data 6.) finding interior parent links 7.) clearing any old point locator 8.) calling reinit() on ghosting functors 9.) repartitioning (if enabled) 10.) removing any remote elements (if enabled) 11.) regenerating summarized boundary id sets

For backwards compatibility, prepare_for_use() performs all those steps, regardless of the official preparation() state of the mesh. In codes which have maintained a valid preparation() state via methods such as unset_has_synched_id_counts(), calling complete_preparation() will result in a fully-prepared mesh at less cost.

The argument to skip renumbering is now deprecated - to prevent a mesh from being renumbered, set allow_renumbering(false). The argument to skip finding neighbors is also deprecated. To prevent find_neighbors, set allow_find_neighbors(false)

If this is a distributed mesh, local copies of remote elements will be deleted here - to keep those elements replicated during preparation, set allow_remote_element_removal(false).

Definition at line 824 of file mesh_base.C.

{
  libmesh_deprecated();
 
  // We only respect the users wish if they tell us to skip renumbering. If they tell us not to
  // skip renumbering but someone previously called allow_renumbering(false), then the latter takes
  // precedence
  if (skip_renumber_nodes_and_elements)
    this->allow_renumbering(false);
 
  // We always accept the user's value for skip_find_neighbors, in contrast to skip_renumber
  const bool old_allow_find_neighbors = this->allow_find_neighbors();
  this->allow_find_neighbors(!skip_find_neighbors);
 
  this->prepare_for_use();
 
  this->allow_find_neighbors(old_allow_find_neighbors);
}

References libMesh::MeshBase::allow_find_neighbors(), libMesh::MeshBase::allow_renumbering(), and libMesh::MeshBase::prepare_for_use().

◆ print_constraint_rows()

void libMesh::MeshBase::print_constraint_rows	(	std::ostream &	os = `libMesh::out`,
		bool	print_nonlocal = `false`
	)		const

inherited

Prints (from processor 0) all mesh constraint rows.

If print_nonlocal is true, then each constraint is printed once for each processor that knows about it, which may be useful for DistributedMesh debugging.

Definition at line 2803 of file mesh_base.C.

{
  parallel_object_only();
 
  std::string local_constraints =
    this->get_local_constraints(print_nonlocal);
 
  if (this->processor_id())
    {
      this->comm().send(0, local_constraints);
    }
  else
    {
      os << "Processor 0:\n";
      os << local_constraints;
 
      for (auto p : IntRange<processor_id_type>(1, this->n_processors()))
        {
          this->comm().receive(p, local_constraints);
          os << "Processor " << p << ":\n";
          os << local_constraints;
        }
    }
}

References libMesh::ParallelObject::comm(), libMesh::MeshBase::get_local_constraints(), libMesh::ParallelObject::n_processors(), libMesh::ParallelObject::processor_id(), libMesh::Parallel::Communicator::receive(), and libMesh::Parallel::Communicator::send().

◆ print_info()

void libMesh::MeshBase::print_info	(	std::ostream &	os = `libMesh::out`,
		const unsigned int	verbosity = `0`,
		const bool	global = `true`
	)		const

inherited

Prints relevant information about the mesh.

Take note of the docstring for get_info() for more information pretaining to the verbosity and global parameters.

Definition at line 1770 of file mesh_base.C.

{
  os << this->get_info(verbosity, global)
     << std::endl;
}

References libMesh::MeshBase::get_info().

Referenced by assemble_and_solve(), libMesh::InfElemBuilder::build_inf_elem(), main(), main(), and setup().

◆ processor_id()

processor_id_type libMesh::ParallelObject::processor_id ( ) const

inlineinherited

Returns: The rank of this processor in the group.

Definition at line 114 of file parallel_object.h.

115 { return cast_int<processor_id_type>(_communicator.rank()); }

libMesh::Parallel::Communicator::rank

processor_id_type rank() const

References libMesh::ParallelObject::_communicator, and libMesh::Parallel::Communicator::rank().

◆ query_elem_ptr() [1/2]

const Elem * libMesh::DistributedMesh::query_elem_ptr ( const dof_id_type i ) const

finaloverridevirtualinherited

Returns: A pointer to the \( i^{th} \) element, or nullptr if no such element exists in this processor's mesh data structure.

Implements libMesh::MeshBase.

Definition at line 562 of file distributed_mesh.C.

{
  if (const auto it = _elements.find(i);
      it != _elements.end())
    {
      const Elem * e = *it;
      libmesh_assert (!e || e->id() == i);
      return e;
    }
 
  return nullptr;
}

References libMesh::DistributedMesh::_elements, libMesh::DofObject::id(), and libMesh::libmesh_assert().

Referenced by libMesh::DistributedMesh::subclass_locally_equals(), ExodusC0PolyhedronTest::test_write_and_read_hexagonal_prism(), and ExodusC0PolygonTest::test_write_and_read_pentagon().

◆ query_elem_ptr() [2/2]

Elem * libMesh::DistributedMesh::query_elem_ptr ( const dof_id_type i )

finaloverridevirtualinherited

Returns: A writable pointer to the \( i^{th} \) element, or nullptr if no such element exists in this processor's mesh data structure.

Implements libMesh::MeshBase.

Definition at line 578 of file distributed_mesh.C.

{
  if (auto it = _elements.find(i);
      it != _elements.end())
    {
      Elem * e = *it;
      libmesh_assert (!e || e->id() == i);
      return e;
    }
 
  return nullptr;
}

References libMesh::DistributedMesh::_elements, libMesh::DofObject::id(), and libMesh::libmesh_assert().

◆ query_node_ptr() [1/2]

const Node * libMesh::DistributedMesh::query_node_ptr ( const dof_id_type i ) const

finaloverridevirtualinherited

Returns: A pointer to the \( i^{th} \) node, or nullptr if no such node exists in this processor's mesh data structure.

Implements libMesh::MeshBase.

Definition at line 508 of file distributed_mesh.C.

{
  if (const auto it = _nodes.find(i);
      it != _nodes.end())
    {
      const Node * n = *it;
      libmesh_assert (!n || n->id() == i);
      return n;
    }
 
  return nullptr;
}

References libMesh::DistributedMesh::_nodes, libMesh::DofObject::id(), and libMesh::libmesh_assert().

Referenced by libMesh::DistributedMesh::add_point().

◆ query_node_ptr() [2/2]

Node * libMesh::DistributedMesh::query_node_ptr ( const dof_id_type i )

finaloverridevirtualinherited

Returns: A writable pointer to the \( i^{th} \) node, or nullptr if no such node exists in this processor's mesh data structure.

Implements libMesh::MeshBase.

Definition at line 524 of file distributed_mesh.C.

{
  if (auto it = _nodes.find(i);
      it != _nodes.end())
    {
      Node * n = *it;
      libmesh_assert (!n || n->id() == i);
      return n;
    }
 
  return nullptr;
}

References libMesh::DistributedMesh::_nodes, libMesh::DofObject::id(), and libMesh::libmesh_assert().

◆ read()

void libMesh::UnstructuredMesh::read	(	const std::string &	name,
		void *	mesh_data = `nullptr`,
		bool	skip_renumber_nodes_and_elements = `false`,
		bool	skip_find_neighbors = `false`,
		bool	skip_detect_interior_parents = `false`
	)

overridevirtualinherited

Reads the file specified by name.

Attempts to figure out the proper method by the file extension. This is now the only way to read a mesh. The UnstructuredMesh then initializes its data structures and is ready for use.

The skip_renumber_nodes_and_elements argument is now deprecated - to disallow renumbering, set MeshBase::allow_renumbering(false).

Set skip_find_neighbors=true to skip the find-neighbors operation during prepare_for_use. This operation isn't always necessary and it can be time-consuming, which is why we provide an option to skip it.

Implements libMesh::MeshBase.

Definition at line 1410 of file unstructured_mesh.C.

{
  // Set the skip_renumber_nodes_and_elements flag on all processors
  // if necessary.
  // This ensures that renumber_nodes_and_elements is *not* called
  // during prepare_for_use() for certain types of mesh files.
  // This is required in cases where there is an associated solution
  // file which expects a certain ordering of the nodes.
  if (Utility::ends_with(name, ".gmv"))
    this->allow_renumbering(false);
 
  NameBasedIO(*this).read(name);
 
  if (skip_renumber_nodes_and_elements)
    {
      // Use MeshBase::allow_renumbering() yourself instead.
      libmesh_deprecated();
      this->allow_renumbering(false);
    }
 
  // Done reading the mesh.  Now prepare it for use.
  const bool old_allow_find_neighbors = this->allow_find_neighbors();
  const bool old_allow_detect_interior_parents = this->allow_detect_interior_parents();
 
  this->allow_find_neighbors(!skip_find_neighbors);
  this->allow_detect_interior_parents(!skip_detect_interior_parents);
 
  this->prepare_for_use();
 
  this->allow_find_neighbors(old_allow_find_neighbors);
  this->allow_detect_interior_parents(old_allow_detect_interior_parents);
}

References libMesh::MeshBase::allow_detect_interior_parents(), libMesh::MeshBase::allow_find_neighbors(), libMesh::MeshBase::allow_renumbering(), libMesh::Utility::ends_with(), libMesh::MeshBase::prepare_for_use(), and libMesh::NameBasedIO::read().

Referenced by ExtraIntegersTest::checkpoint_helper(), main(), ExtraIntegersTest::test_helper(), MeshStitchTest::testNodeElemStitch(), SlitMeshRefinedSystemTest::testRestart(), and WriteElemsetData::testWriteImpl().

◆ recalculate_n_partitions()

unsigned int libMesh::MeshBase::recalculate_n_partitions ( )

inherited

In a few (very rare) cases, the user may have manually tagged the elements with specific processor IDs by hand, without using a partitioner.

In this case, the Mesh will not know that the total number of partitions, _n_parts, has changed, unless you call this function. This is an O(N active elements) calculation. The return value is the number of partitions, and _n_parts is also set by this function.

Definition at line 1828 of file mesh_base.C.

{
  // This requires an inspection on every processor
  parallel_object_only();
 
  unsigned int max_proc_id=0;
 
  for (const auto & elem : this->active_local_element_ptr_range())
    max_proc_id = std::max(max_proc_id, static_cast<unsigned int>(elem->processor_id()));
 
  // The number of partitions is one more than the max processor ID.
  _n_parts = max_proc_id+1;
 
  this->comm().max(_n_parts);
 
  return _n_parts;
}

References libMesh::MeshBase::_n_parts, libMesh::ParallelObject::comm(), and libMesh::Parallel::Communicator::max().

Referenced by libMesh::MeshBase::partition(), and libMesh::CheckpointIO::read().

◆ redistribute()

void libMesh::DistributedMesh::redistribute ( )

overridevirtualinherited

Redistribute elements between processors.

This gets called automatically by the Partitioner, and is a no-op in the case of a serialized mesh.

Reimplemented from libMesh::MeshBase.

Definition at line 1111 of file distributed_mesh.C.

{
  // If this is a truly parallel mesh, go through the redistribution/gather/delete remote steps
  if (!this->is_serial())
    {
      // Construct a MeshCommunication object to actually redistribute the nodes
      // and elements according to the partitioner, and then to re-gather the neighbors.
      MeshCommunication mc;
      mc.redistribute(*this);
 
      this->update_parallel_id_counts();
 
      // We communicate valid neighbor links for newly-redistributed
      // elements, but we may still have remote_elem links that should
      // be corrected but whose correction wasn't communicated.
      this->find_neighbors(/*reset_remote_elements*/ false,
                           /*reset_current_list*/ false /*non-default*/,
                           /*assert_valid*/ false,
                           /*check_non_remote*/ false /*non-default!*/);
 
      // Is this necessary?  If we are called from prepare_for_use(), this will be called
      // anyway... but users can always call partition directly, in which case we do need
      // to call delete_remote_elements()...
      //
      // Regardless of whether it's necessary, it isn't safe.  We
      // haven't communicated new node processor_ids yet, and we can't
      // delete nodes until we do.
      // this->delete_remote_elements();
    }
  else
    // The base class can handle non-distributed things, like
    // notifying any GhostingFunctors of changes
    MeshBase::redistribute();
}

References libMesh::UnstructuredMesh::find_neighbors(), libMesh::DistributedMesh::is_serial(), libMesh::MeshBase::redistribute(), libMesh::MeshCommunication::redistribute(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ reinit_ghosting_functors()

void libMesh::MeshBase::reinit_ghosting_functors ( )

inherited

Loops over ghosting functors and calls mesh_reinit()

Definition at line 1025 of file mesh_base.C.

{
  for (auto & gf : _ghosting_functors)
    {
      libmesh_assert(gf);
      gf->mesh_reinit();
    }
 
  _preparation.has_reinit_ghosting_functors = true;
}

References libMesh::MeshBase::_ghosting_functors, libMesh::MeshBase::_preparation, libMesh::MeshBase::Preparation::has_reinit_ghosting_functors, and libMesh::libmesh_assert().

Referenced by libMesh::MeshBase::complete_preparation().

◆ remove_disjoint_boundary_pair()

void libMesh::MeshBase::remove_disjoint_boundary_pair	(	const boundary_id_type	b1,
		const boundary_id_type	b2
	)

inherited

Definition at line 2321 of file mesh_base.C.

    {
      // Nothing to remove if not allocated or empty
      if (!_disjoint_neighbor_boundary_pairs || _disjoint_neighbor_boundary_pairs->empty())
        return;
 
      auto & pairs = *_disjoint_neighbor_boundary_pairs;
 
      // Helper to check and erase both directions
      auto erase_if_match = [](boundary_id_type key,
                              boundary_id_type pair,
                              PeriodicBoundaries & pb_map)
        {
          auto it = pb_map.find(key);
          if (it != pb_map.end())
            {
              const auto & pb = *(it->second);
              // Check both directions
              if ((pb.myboundary == key && pb.pairedboundary == pair) ||
                  (pb.pairedboundary == key && pb.myboundary == pair))
                pb_map.erase(it);
            }
        };
 
      erase_if_match(b1, b2, pairs);
      erase_if_match(b2, b1, pairs);
    }

References libMesh::MeshBase::_disjoint_neighbor_boundary_pairs.

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

◆ remove_ghosting_functor()

void libMesh::MeshBase::remove_ghosting_functor ( GhostingFunctor & ghosting_functor )

inherited

Removes a functor which was previously added to the set of ghosting functors.

Definition at line 1101 of file mesh_base.C.

{
  auto raw_it = std::find(_ghosting_functors.begin(),
                          _ghosting_functors.end(), &ghosting_functor);
 
  // The DofMap has a "to_mesh" parameter that tells it to avoid
  // registering a new functor with the mesh, but it doesn't keep
  // track of which functors weren't added, so we'll support "remove a
  // functor that isn't there" just like we did with set::erase
  // before.
  if (raw_it != _ghosting_functors.end())
    _ghosting_functors.erase(raw_it);
 
  // We shouldn't have had two copies of the same functor
  libmesh_assert(std::find(_ghosting_functors.begin(),
                           _ghosting_functors.end(),
                           &ghosting_functor) ==
                 _ghosting_functors.end());
 
  if (const auto it = _shared_functors.find(&ghosting_functor);
      it != _shared_functors.end())
    _shared_functors.erase(it);
}

References libMesh::MeshBase::_ghosting_functors, libMesh::MeshBase::_shared_functors, and libMesh::libmesh_assert().

Referenced by EquationSystemsTest::testDisableDefaultGhosting(), and libMesh::DofMap::~DofMap().

◆ remove_orphaned_nodes()

void libMesh::MeshBase::remove_orphaned_nodes ( )

inherited

Removes any orphaned nodes, nodes not connected to any elements.

Typically done automatically in a preparation step

Definition at line 801 of file mesh_base.C.

{
  LOG_SCOPE("remove_orphaned_nodes()", "MeshBase");
 
  // Will hold the set of nodes that are currently connected to elements
  std::unordered_set<Node *> connected_nodes;
 
  // Loop over the elements.  Find which nodes are connected to at
  // least one of them.
  for (const auto & element : this->element_ptr_range())
    for (auto & n : element->node_ref_range())
      connected_nodes.insert(&n);
 
  for (const auto & node : this->node_ptr_range())
    if (!connected_nodes.count(node))
      this->delete_node(node);
 
  _preparation.has_removed_orphaned_nodes = true;
}

References libMesh::MeshBase::_preparation, libMesh::MeshBase::delete_node(), and libMesh::MeshBase::Preparation::has_removed_orphaned_nodes.

Referenced by libMesh::MeshBase::complete_preparation().

◆ renumber_dof_objects()

template<typename T >

dof_id_type libMesh::DistributedMesh::renumber_dof_objects ( dofobject_container< T > & objects )

inherited

Renumber a parallel objects container.

Returns: The smallest globally unused id for that container.

Definition at line 1281 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  typedef typename dofobject_container<T>::veclike_iterator object_iterator;
 
  // In parallel we may not know what objects other processors have.
  // Start by figuring out how many
  dof_id_type unpartitioned_objects = 0;
 
  std::unordered_map<processor_id_type, dof_id_type>
    ghost_objects_from_proc;
 
  object_iterator it  = objects.begin();
  object_iterator end = objects.end();
 
  while (it != end)
    {
      T * obj = *it;
 
      // Remove any nullptr container entries while we're here.
      if (!obj)
        it = objects.erase(it);
      else
        {
          processor_id_type obj_procid = obj->processor_id();
          if (obj_procid == DofObject::invalid_processor_id)
            unpartitioned_objects++;
          else
            ghost_objects_from_proc[obj_procid]++;
 
          // Finally, increment the iterator
          ++it;
        }
    }
 
  std::vector<dof_id_type> objects_on_proc(this->n_processors(), 0);
  auto this_it = ghost_objects_from_proc.find(this->processor_id());
  this->comm().allgather
    ((this_it == ghost_objects_from_proc.end()) ?
     dof_id_type(0) : this_it->second, objects_on_proc);
 
#ifndef NDEBUG
  libmesh_assert(this->comm().verify(unpartitioned_objects));
  for (processor_id_type p=0, np=this->n_processors(); p != np; ++p)
    if (ghost_objects_from_proc.count(p))
      libmesh_assert_less_equal (ghost_objects_from_proc[p], objects_on_proc[p]);
    else
      libmesh_assert_less_equal (0, objects_on_proc[p]);
#endif
 
  // We'll renumber objects in blocks by processor id
  std::vector<dof_id_type> first_object_on_proc(this->n_processors());
  for (processor_id_type i=1, np=this->n_processors(); i != np; ++i)
    first_object_on_proc[i] = first_object_on_proc[i-1] +
      objects_on_proc[i-1];
  dof_id_type next_id = first_object_on_proc[this->processor_id()];
  dof_id_type first_free_id =
    first_object_on_proc[this->n_processors()-1] +
    objects_on_proc[this->n_processors()-1] +
    unpartitioned_objects;
 
  // First set new local object ids and build request sets
  // for non-local object ids
 
  // Request sets to send to each processor
  std::map<processor_id_type, std::vector<dof_id_type>>
    requested_ids;
 
  // We know how many objects live on each processor, so reserve() space for
  // each.
  auto ghost_end = ghost_objects_from_proc.end();
  for (auto p : make_range(this->n_processors()))
    if (p != this->processor_id())
      {
        if (const auto p_it = ghost_objects_from_proc.find(p);
            p_it != ghost_end)
          requested_ids[p].reserve(p_it->second);
      }
 
  end = objects.end();
  for (it = objects.begin(); it != end; ++it)
    {
      T * obj = *it;
      if (!obj)
        continue;
      if (obj->processor_id() == this->processor_id())
        obj->set_id(next_id++);
      else if (obj->processor_id() != DofObject::invalid_processor_id)
        requested_ids[obj->processor_id()].push_back(obj->id());
    }
 
  // Next set ghost object ids from other processors
 
  auto gather_functor =
    [
#ifndef NDEBUG
     this,
     &first_object_on_proc,
     &objects_on_proc,
#endif
     &objects]
    (processor_id_type, const std::vector<dof_id_type> & ids,
     std::vector<dof_id_type> & new_ids)
    {
      std::size_t ids_size = ids.size();
      new_ids.resize(ids_size);
 
      for (std::size_t i=0; i != ids_size; ++i)
        {
          T * obj = objects[ids[i]];
          libmesh_assert(obj);
          libmesh_assert_equal_to (obj->processor_id(), this->processor_id());
          new_ids[i] = obj->id();
 
          libmesh_assert_greater_equal (new_ids[i],
                                        first_object_on_proc[this->processor_id()]);
          libmesh_assert_less (new_ids[i],
                               first_object_on_proc[this->processor_id()] +
                               objects_on_proc[this->processor_id()]);
        }
    };
 
  auto action_functor =
    [
#ifndef NDEBUG
     &first_object_on_proc,
     &objects_on_proc,
#endif
     &objects]
    (processor_id_type libmesh_dbg_var(pid),
     const std::vector<dof_id_type> & ids,
     const std::vector<dof_id_type> & data)
    {
      // Copy the id changes we've now been informed of
      for (auto i : index_range(ids))
        {
          T * obj = objects[ids[i]];
          libmesh_assert (obj);
          libmesh_assert_equal_to (obj->processor_id(), pid);
          libmesh_assert_greater_equal (data[i],
                                        first_object_on_proc[pid]);
          libmesh_assert_less (data[i],
                               first_object_on_proc[pid] +
                               objects_on_proc[pid]);
          obj->set_id(data[i]);
        }
    };
 
  const dof_id_type * ex = nullptr;
  Parallel::pull_parallel_vector_data
    (this->comm(), requested_ids, gather_functor, action_functor, ex);
 
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  auto unique_gather_functor =
    [
#ifndef NDEBUG
     this,
#endif
     &objects]
    (processor_id_type, const std::vector<dof_id_type> & ids,
     std::vector<unique_id_type> & data)
    {
      std::size_t ids_size = ids.size();
      data.resize(ids_size);
 
      for (std::size_t i=0; i != ids_size; ++i)
        {
          T * obj = objects[ids[i]];
          libmesh_assert(obj);
          libmesh_assert_equal_to (obj->processor_id(), this->processor_id());
          data[i] = obj->valid_unique_id() ? obj->unique_id() : DofObject::invalid_unique_id;
        }
    };
 
  auto unique_action_functor =
    [&objects]
    (processor_id_type libmesh_dbg_var(pid),
     const std::vector<dof_id_type> & ids,
     const std::vector<unique_id_type> & data)
    {
      for (auto i : index_range(ids))
        {
          T * obj = objects[ids[i]];
          libmesh_assert (obj);
          libmesh_assert_equal_to (obj->processor_id(), pid);
          if (!obj->valid_unique_id() && data[i] != DofObject::invalid_unique_id)
            obj->set_unique_id(data[i]);
        }
    };
 
  const unique_id_type * unique_ex = nullptr;
  Parallel::pull_parallel_vector_data
    (this->comm(), requested_ids, unique_gather_functor,
     unique_action_functor, unique_ex);
#endif
 
  // Next set unpartitioned object ids
  next_id = 0;
  for (auto i : make_range(this->n_processors()))
    next_id += objects_on_proc[i];
  for (it = objects.begin(); it != end; ++it)
    {
      T * obj = *it;
      if (!obj)
        continue;
      if (obj->processor_id() == DofObject::invalid_processor_id)
        obj->set_id(next_id++);
    }
 
  // Finally shuffle around objects so that container indices
  // match ids
  it = objects.begin();
  end = objects.end();
  while (it != end)
    {
      T * obj = *it;
      if (obj) // don't try shuffling already-nullptr entries
        {
          T * next = objects[obj->id()];
          // If we have to move this object
          if (next != obj)
            {
              // nullptr out its original position for now
              // (our shuffling may put another object there shortly)
              *it = nullptr;
 
              // There may already be another object with this id that
              // needs to be moved itself
              while (next)
                {
                  // We shouldn't be trying to give two objects the
                  // same id
                  libmesh_assert_not_equal_to (next->id(), obj->id());
                  objects[obj->id()] = obj;
                  obj = next;
                  next = objects[obj->id()];
                }
              objects[obj->id()] = obj;
            }
        }
 
      // Remove any container entries that were left as nullptr.
      if (!obj)
        it = objects.erase(it);
      else
        ++it;
    }
 
  return first_free_id;
}

References libMesh::Parallel::Communicator::allgather(), libMesh::mapvector< Val, index_t >::begin(), libMesh::ParallelObject::comm(), libMesh::mapvector< Val, index_t >::end(), libMesh::mapvector< Val, index_t >::erase(), libMesh::index_range(), libMesh::DofObject::invalid_processor_id, libMesh::DofObject::invalid_unique_id, libMesh::libmesh_assert(), libMesh::make_range(), libMesh::ParallelObject::n_processors(), libMesh::DistributedMesh::pid, libMesh::ParallelObject::processor_id(), and TIMPI::pull_parallel_vector_data().

Referenced by libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ renumber_elem()

void libMesh::DistributedMesh::renumber_elem	(	dof_id_type	old_id,
		dof_id_type	new_id
	)

finaloverridevirtualinherited

Changes the id of element old_id, both by changing elem(old_id)->id() and by moving elem(old_id) in the mesh's internal container.

No element with the id new_id should already exist.

Implements libMesh::MeshBase.

Definition at line 823 of file distributed_mesh.C.

{
  // This could be a no-op
  if (old_id == new_id)
    return;
 
  Elem * el = _elements[old_id];
  libmesh_assert (el);
  libmesh_assert_equal_to (el->id(), old_id);
 
  el->set_id(new_id);
  libmesh_assert (!_elements[new_id]);
  _elements[new_id] = el;
  _elements.erase(old_id);
 
  // Should we delete any caches here?  Our point locator indexes by
  // element pointer and should be fine with an id change.  Our stored
  // ranges are no longer sorted, which is *probably* fine, but let's
  // just be safe.
  this->clear_stored_ranges();
}

References libMesh::DistributedMesh::_elements, libMesh::MeshBase::clear_stored_ranges(), libMesh::DofObject::id(), libMesh::libmesh_assert(), and libMesh::DofObject::set_id().

Referenced by MeshPerElemTest< elem_type >::meshes_equal_enough().

◆ renumber_node()

void libMesh::DistributedMesh::renumber_node	(	dof_id_type	old_id,
		dof_id_type	new_id
	)

finaloverridevirtualinherited

Changes the id of node old_id, both by changing node(old_id)->id() and by moving node(old_id) in the mesh's internal container.

No element with the id new_id should already exist.

Implements libMesh::MeshBase.

Definition at line 1023 of file distributed_mesh.C.

{
  // This could be a no-op
  if (old_id == new_id)
    return;
 
  Node * nd = _nodes[old_id];
  libmesh_assert (nd);
  libmesh_assert_equal_to (nd->id(), old_id);
 
  // If we have nodes shipped to this processor for NodeConstraints
  // use, then those nodes will exist in _nodes, but may not be
  // locatable via a TopologyMap due to the insufficiency of elements
  // connecting to them.  If local refinement then wants to create a
  // *new* node in the same location, it will initially get a temporary
  // id, and then make_node_ids_parallel_consistent() will try to move
  // it to the canonical id.  We need to account for this case to
  // avoid false positives and memory leaks.
#ifdef LIBMESH_ENABLE_NODE_CONSTRAINTS
  if (_nodes[new_id])
    {
      libmesh_assert_equal_to (*(Point *)_nodes[new_id],
                               *(Point *)_nodes[old_id]);
      _nodes.erase(new_id);
    }
#else
  // If we aren't shipping nodes for NodeConstraints, there should be
  // no reason for renumbering one node onto another.
  libmesh_assert (!_nodes[new_id]);
#endif
  _nodes[new_id] = nd;
  nd->set_id(new_id);
 
  _nodes.erase(old_id);
}

References libMesh::DistributedMesh::_nodes, libMesh::DofObject::id(), libMesh::libmesh_assert(), and libMesh::DofObject::set_id().

Referenced by MeshPerElemTest< elem_type >::meshes_equal_enough().

◆ renumber_nodes_and_elements()

void libMesh::DistributedMesh::renumber_nodes_and_elements ( )

overridevirtualinherited

Remove nullptr elements from arrays.

Implements libMesh::MeshBase.

Definition at line 1535 of file distributed_mesh.C.

{
  parallel_object_only();
 
#ifdef DEBUG
  // Make sure our ids and flags are consistent
  this->libmesh_assert_valid_parallel_ids();
  this->libmesh_assert_valid_parallel_flags();
  this->libmesh_assert_valid_parallel_p_levels();
#endif
 
  LOG_SCOPE("renumber_nodes_and_elements()", "DistributedMesh");
 
  // Nodes not connected to any elements, and nullptr node entries
  // in our container, should be deleted.  But wait!  If we've deleted coarse
  // local elements on some processor, other processors might have ghosted
  // nodes from it that are now no longer connected to any elements on it, but
  // that are connected to their own semilocal elements.  We'll have to
  // communicate to ascertain if that's the case.
  this->comm().max(_deleted_coarse_elements);
 
  // What used nodes do we see on our proc?
  std::set<dof_id_type> used_nodes;
 
  // What used node info should we send from our proc?  Could we take ownership
  // of each node if we needed to?
  std::map<processor_id_type, std::map<dof_id_type, bool>>
    used_nodes_on_proc;
 
  // flag the nodes we need
  for (auto & elem : this->element_ptr_range())
    for (const Node & node : elem->node_ref_range())
      {
        const dof_id_type n = node.id();
        used_nodes.insert(n);
        if (_deleted_coarse_elements)
          {
            const processor_id_type p = node.processor_id();
            if (p != this->processor_id())
              {
                auto & used_nodes_on_p = used_nodes_on_proc[p];
                if (elem->processor_id() == this->processor_id())
                  used_nodes_on_p[n] = true;
                else
                  if (!used_nodes_on_p.count(n))
                    used_nodes_on_p[n] = false;
              }
          }
      }
 
  if (_deleted_coarse_elements)
    {
      // "unsigned char" == "bool, but MPI::BOOL is iffy to use"
      typedef unsigned char boolish;
      std::map<processor_id_type, std::vector<std::pair<dof_id_type, boolish>>>
        used_nodes_on_proc_vecs;
      for (auto & [pid, nodemap] : used_nodes_on_proc)
        used_nodes_on_proc_vecs[pid].assign(nodemap.begin(), nodemap.end());
 
      std::map<dof_id_type,processor_id_type> repartitioned_node_pids;
      std::map<processor_id_type, std::set<dof_id_type>>
        repartitioned_node_sets_to_push;
 
      auto ids_action_functor =
        [&used_nodes, &repartitioned_node_pids,
         &repartitioned_node_sets_to_push]
        (processor_id_type pid,
         const std::vector<std::pair<dof_id_type, boolish>> & ids_and_bools)
        {
          for (auto [n, sender_could_become_owner] : ids_and_bools)
            {
              // If we don't see a use for our own node, but someone
              // else does, better figure out who should own it next.
              if (!used_nodes.count(n))
                {
                  if (auto it = repartitioned_node_pids.find(n);
                      sender_could_become_owner)
                    {
                      if (it != repartitioned_node_pids.end() &&
                          pid < it->second)
                        it->second = pid;
                      else
                        repartitioned_node_pids[n] = pid;
                    }
                  else
                    if (it == repartitioned_node_pids.end())
                      repartitioned_node_pids[n] =
                        DofObject::invalid_processor_id;
 
                  repartitioned_node_sets_to_push[pid].insert(n);
                }
            }
        };
 
      // We need two pushes instead of a pull here because we need to
      // know *all* the queries for a particular node before we can
      // respond to *any* of them.
      Parallel::push_parallel_vector_data
      (this->comm(), used_nodes_on_proc_vecs, ids_action_functor);
 
      // Repartition (what used to be) our own nodes first
      for (auto & [n, p] : repartitioned_node_pids)
        {
          Node & node = this->node_ref(n);
          libmesh_assert_equal_to(node.processor_id(), this->processor_id());
          libmesh_assert_not_equal_to_msg(p, DofObject::invalid_processor_id, "Node " << n << " is lost?");
          node.processor_id() = p;
        }
 
      // Then push to repartition others' ghosted copies.
 
      std::map<processor_id_type, std::vector<std::pair<dof_id_type,processor_id_type>>>
        repartitioned_node_vecs;
 
      for (auto & [p, nodeset] : repartitioned_node_sets_to_push)
        {
          auto & rn_vec = repartitioned_node_vecs[p];
          for (auto n : nodeset)
            rn_vec.emplace_back(n, repartitioned_node_pids[n]);
        }
 
      auto repartition_node_functor =
        [this]
        (processor_id_type libmesh_dbg_var(pid),
         const std::vector<std::pair<dof_id_type, processor_id_type>> & ids_and_pids)
        {
          for (auto [n, p] : ids_and_pids)
            {
              libmesh_assert_not_equal_to(p, DofObject::invalid_processor_id);
              Node & node = this->node_ref(n);
              libmesh_assert_equal_to(node.processor_id(), pid);
              node.processor_id() = p;
            }
        };
 
      Parallel::push_parallel_vector_data
      (this->comm(), repartitioned_node_vecs, repartition_node_functor);
    }
 
  _deleted_coarse_elements = false;
 
  // Nodes not connected to any local elements, and nullptr node entries
  // in our container, are deleted
  {
    node_iterator_imp  it = _nodes.begin();
    node_iterator_imp end = _nodes.end();
 
    while (it != end)
      {
        Node * nd = *it;
        if (!nd)
          it = _nodes.erase(it);
        else if (!used_nodes.count(nd->id()))
          {
            // remove any boundary information associated with
            // this node
            this->get_boundary_info().remove (nd);
            _constraint_rows.erase(nd);
 
            // delete the node
            delete nd;
 
            it = _nodes.erase(it);
          }
        else
          ++it;
      }
  }
 
  this->_preparation.has_removed_orphaned_nodes = true;
 
  if (_skip_renumber_nodes_and_elements)
    {
      this->update_parallel_id_counts();
      return;
    }
 
  // Finally renumber all the elements
  _n_elem = this->renumber_dof_objects (this->_elements);
 
  // and all the remaining nodes
  _n_nodes = this->renumber_dof_objects (this->_nodes);
 
  // And figure out what IDs we should use when adding new nodes and
  // new elements
  this->update_parallel_id_counts();
 
  // Make sure our caches are up to date and our
  // DofObjects are well packed
#ifdef DEBUG
  libmesh_assert_equal_to (this->n_nodes(), this->parallel_n_nodes());
  libmesh_assert_equal_to (this->n_elem(), this->parallel_n_elem());
  const dof_id_type pmax_node_id = this->parallel_max_node_id();
  const dof_id_type pmax_elem_id = this->parallel_max_elem_id();
  libmesh_assert_equal_to (this->max_node_id(), pmax_node_id);
  libmesh_assert_equal_to (this->max_elem_id(), pmax_elem_id);
  libmesh_assert_equal_to (this->n_nodes(), this->max_node_id());
  libmesh_assert_equal_to (this->n_elem(), this->max_elem_id());
 
  // Make sure our ids and flags are consistent
  this->libmesh_assert_valid_parallel_ids();
  this->libmesh_assert_valid_parallel_flags();
 
  // And make sure we've made our numbering monotonic
  MeshTools::libmesh_assert_valid_elem_ids(*this);
#endif
}

◆ reserve_elem()

virtual void libMesh::DistributedMesh::reserve_elem ( const dof_id_type ne )

inlinefinaloverridevirtualinherited

Reserves space for a known number of elements.

Note: This method may or may not do anything, depending on the actual Mesh implementation. If you know the number of elements you will add and call this method before repeatedly calling add_point() the implementation will be more efficient.

Implements libMesh::MeshBase.

Definition at line 276 of file distributed_mesh.h.

276{}

◆ reserve_nodes()

virtual void libMesh::DistributedMesh::reserve_nodes ( const dof_id_type nn )

inlinefinaloverridevirtualinherited

Reserves space for a known number of nodes.

Note: This method may or may not do anything, depending on the actual Mesh implementation. If you know the number of nodes you will add and call this method before repeatedly calling add_point() the implementation will be more efficient.

Implements libMesh::MeshBase.

Definition at line 272 of file distributed_mesh.h.

272{}

◆ set_constraint_rows()

constraint_rows_type & libMesh::MeshBase::set_constraint_rows ( )

inlineinherited

Definition at line 1947 of file mesh_base.h.

1948 { _preparation.has_cached_elem_data = false; return _constraint_rows; }

References libMesh::MeshBase::_constraint_rows, libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_cached_elem_data.

Referenced by libMesh::MeshTools::clear_spline_nodes(), libMesh::ExodusII_IO::read(), and libMesh::DynaIO::read_mesh().

◆ set_count_lower_dim_elems_in_point_locator()

void libMesh::MeshBase::set_count_lower_dim_elems_in_point_locator ( bool count_lower_dim_elems )

inherited

In the point locator, do we count lower dimensional elements when we refine point locator regions? This is relevant in tree-based point locators, for example.

Definition at line 1888 of file mesh_base.C.

{
  _count_lower_dim_elems_in_point_locator = count_lower_dim_elems;
}

References libMesh::MeshBase::_count_lower_dim_elems_in_point_locator.

◆ set_default_mapping_data()

void libMesh::MeshBase::set_default_mapping_data ( const unsigned char data )

inlineinherited

Set the default master space to physical space mapping basis functions to be used on newly added elements.

Definition at line 965 of file mesh_base.h.

  {
    _default_mapping_data = data;
  }

References libMesh::MeshBase::_default_mapping_data.

Referenced by libMesh::MeshTools::Modification::all_rbb(), libMesh::ExodusII_IO::read(), and libMesh::DynaIO::read_mesh().

◆ set_default_mapping_type()

void libMesh::MeshBase::set_default_mapping_type ( const ElemMappingType type )

inlineinherited

Set the default master space to physical space mapping basis functions to be used on newly added elements.

Definition at line 947 of file mesh_base.h.

  {
    _default_mapping_type = type;
  }

References libMesh::MeshBase::_default_mapping_type.

Referenced by libMesh::MeshTools::Modification::all_rbb(), libMesh::ExodusII_IO::read(), and libMesh::DynaIO::read_mesh().

◆ set_distributed()

virtual void libMesh::DistributedMesh::set_distributed ( )

inlinefinaloverridevirtualinherited

Asserts that not all elements and nodes of the mesh necessarily exist on the current processor.

Reimplemented from libMesh::MeshBase.

Definition at line 174 of file distributed_mesh.h.

175 { _is_serial = false;

176 _is_serial_on_proc_0 = false; }

References libMesh::DistributedMesh::_is_serial, and libMesh::DistributedMesh::_is_serial_on_proc_0.

◆ set_elem_dimensions()

void libMesh::MeshBase::set_elem_dimensions ( std::set< unsigned char > elem_dims )

inherited

Most of the time you should not need to call this, as the element dimensions will be set automatically by a call to cache_elem_data(), therefore only call this if you know what you're doing.

In some specialized situations, for example when adding a single Elem on all procs, it can be faster to skip calling cache_elem_data() and simply specify the element dimensions manually, which is why this setter exists.

Definition at line 444 of file mesh_base.C.

{
#ifdef DEBUG
  // In debug mode, we call cache_elem_data() and then make sure
  // the result actually agrees with what the user specified.
  parallel_object_only();
 
  this->cache_elem_data();
  libmesh_assert_msg(_elem_dims == elem_dims, \
                     "Specified element dimensions does not match true element dimensions!");
#endif
 
  _elem_dims = std::move(elem_dims);
}

References libMesh::MeshBase::_elem_dims, and libMesh::MeshBase::cache_elem_data().

◆ set_interior_mesh()

void libMesh::MeshBase::set_interior_mesh ( MeshBase & int_mesh )

inlineinherited

Sets the interior mesh.

For advanced use only.

Definition at line 2063 of file mesh_base.h.

2063{ _interior_mesh = &int_mesh; }

References libMesh::MeshBase::_interior_mesh.

Referenced by libMesh::BoundaryInfo::add_elements(), and libMesh::UnstructuredMesh::copy_nodes_and_elements().

◆ set_isnt_prepared()

void libMesh::MeshBase::set_isnt_prepared ( )

inlineinherited

Tells this we have done some operation where we should no longer consider ourself prepared.

This is a very coarse setting; it is generally more efficient to mark finer-grained settings instead.

This method name is now deprecated, in part to match the less awkward unset_has_ names of the more fine-grained methods, in part as a way to prompt older user codes to use the more fine-grained methods where they can, to speed up the complete_preparation() calls afterward.

Definition at line 228 of file mesh_base.h.

229 { libmesh_deprecated(); _preparation = false; }

References libMesh::MeshBase::_preparation.

◆ set_mesh_dimension()

void libMesh::MeshBase::set_mesh_dimension ( unsigned char d )

inlineinherited

Resets the logical dimension of the mesh.

If the mesh has elements of multiple dimensions, this should be set to the largest dimension. E.g. if the mesh has 1D and 2D elements, this should be set to 2. If the mesh has 2D and 3D elements, this should be set to 3.

Definition at line 423 of file mesh_base.h.

424 { _elem_dims.clear(); _elem_dims.insert(d); }

References libMesh::MeshBase::_elem_dims.

Referenced by libMesh::MeshTools::Generation::build_cube(), libMesh::MeshTools::Generation::build_delaunay_square(), DisjointNeighborTest::build_four_disjoint_elems(), DisjointNeighborTest::build_split_mesh_with_interface(), libMesh::TriangleWrapper::copy_tri_to_mesh(), libMesh::VTKIO::read(), libMesh::Nemesis_IO::read(), libMesh::GMVIO::read(), libMesh::STLIO::read(), libMesh::AbaqusIO::read(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_connectivity(), libMesh::CheckpointIO::read_header(), libMesh::UCDIO::read_implementation(), libMesh::GmshIO::read_mesh(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::MatlabIO::read_stream(), libMesh::OFFIO::read_stream(), InfFERadialTest::testRefinement(), libMesh::TriangleInterface::triangulate(), and libMesh::Poly2TriTriangulator::triangulate().

◆ set_n_partitions()

unsigned int & libMesh::MeshBase::set_n_partitions ( )

inlineprotectedinherited

Returns: A writable reference to the number of partitions.

Definition at line 2176 of file mesh_base.h.

2177 { return _n_parts; }

References libMesh::MeshBase::_n_parts.

Referenced by libMesh::Partitioner::partition(), libMesh::Partitioner::repartition(), and libMesh::BoundaryInfo::sync().

◆ set_next_ids()

void libMesh::DistributedMesh::set_next_ids ( )

privateinherited

Derives _next_free_local_node_id, _next_free_local_elem_id, _next_free_unpartitioned_node_id, and _next_free_unpartitioned_elem_id from the current _max_node_id and _max_elem_id, interleaving ids among processors so that each processor (and the unpartitioned pool) has its own reserved slot in every repeating group of n_processors()+1 ids.

Definition at line 268 of file distributed_mesh.C.

{
  _next_free_unpartitioned_elem_id =
    ((_max_elem_id-1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->n_processors();
  _next_free_local_elem_id =
    ((_max_elem_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->processor_id();
 
  _next_free_unpartitioned_node_id =
    ((_max_node_id-1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->n_processors();
  _next_free_local_node_id =
    ((_max_node_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->processor_id();
}

References libMesh::DistributedMesh::_max_elem_id, libMesh::DistributedMesh::_max_node_id, libMesh::DistributedMesh::_next_free_local_elem_id, libMesh::DistributedMesh::_next_free_local_node_id, libMesh::DistributedMesh::_next_free_unpartitioned_elem_id, libMesh::DistributedMesh::_next_free_unpartitioned_node_id, libMesh::ParallelObject::n_processors(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ set_next_unique_id()

void libMesh::DistributedMesh::set_next_unique_id ( unique_id_type id )

overridevirtualinherited

Sets the next available unique id to be used.

On a ReplicatedMesh, or when adding unpartitioned objects to a DistributedMesh, this must be kept in sync on all processors.

On a DistributedMesh, other unique_id values (larger than this one) may be chosen next, to allow unique_id assignment without communication.

Implements libMesh::MeshBase.

Definition at line 419 of file distributed_mesh.C.

{
  _next_unique_id = id;
  _next_unpartitioned_unique_id =
    ((_next_unique_id-1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->n_processors();
  _next_unique_id =
    ((_next_unique_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
    (this->n_processors() + 1) + this->processor_id();
}

References libMesh::MeshBase::_next_unique_id, libMesh::DistributedMesh::_next_unpartitioned_unique_id, libMesh::ParallelObject::n_processors(), and libMesh::ParallelObject::processor_id().

Referenced by MeshPerElemTest< elem_type >::meshes_equal_enough().

◆ set_next_unique_ids()

void libMesh::DistributedMesh::set_next_unique_ids ( unique_id_type parallel_max_unique_id )

privateinherited

Derives _next_unique_id and _next_unpartitioned_unique_id from parallel_max_unique_id, the largest unique id currently in use (or any other value guaranteed to be at least that large, such as a trusted next_unique_id()), using the same processor-interleaved id ranges as set_next_ids().

Definition at line 286 of file distributed_mesh.C.

{
  // Unique ids are laid out in repeating groups of (n_processors()+1)
  // consecutive integers ("alignment" here means a value's position, i.e.
  // its residue mod (n_processors()+1), within one of these groups). In
  // every group, the first n_processors() slots (residues 0..n_processors()-1)
  // are each permanently earmarked for one processor's locally-owned
  // objects, and the last slot (residue n_processors()) is permanently
  // earmarked for unpartitioned objects.
  //
  // parallel_max_unique_id carries no guarantee of landing on any
  // particular residue, so rather than simply offsetting it by
  // processor_id()/n_processors(), we have to explicitly round up to the
  // start of the next full, entirely-unused group before adding this
  // processor's (or the unpartitioned pool's) fixed offset into that group.
  //
  // (parallel_max_unique_id - 1) / (n_processors()+1) + 1 is the standard
  // integer idiom for ceil(parallel_max_unique_id / (n_processors()+1)):
  // the number of complete groups needed to reach at least past the
  // current max id. Multiplying back by (n_processors()+1) gives the first
  // id of the next group that is guaranteed to be entirely unused; adding
  // n_processors(), the unpartitioned pool's fixed offset within a group,
  // lands on that pool's reserved slot in that group.
  _next_unpartitioned_unique_id =
      ((parallel_max_unique_id - 1) / (this->n_processors() + 1) + 1) *
          (this->n_processors() + 1) +
      this->n_processors();
 
  // Same idiom, but shifted by (n_processors()-1) before dividing so that
  // the rounding accounts for processor_id() possibly being less than the
  // residue the raw max id already occupies within its group; this can
  // land this processor's slot in the same group as the unpartitioned
  // pool's above, or push it into the following group, depending on where
  // the max id and this processor's offset happen to fall.
  _next_unique_id =
      ((parallel_max_unique_id + this->n_processors() - 1) / (this->n_processors() + 1) + 1) *
          (this->n_processors() + 1) +
      this->processor_id();
}

References libMesh::MeshBase::_next_unique_id, libMesh::DistributedMesh::_next_unpartitioned_unique_id, libMesh::ParallelObject::n_processors(), libMesh::DistributedMesh::parallel_max_unique_id(), and libMesh::ParallelObject::processor_id().

Referenced by libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ set_point_locator_close_to_point_tol()

void libMesh::MeshBase::set_point_locator_close_to_point_tol ( Real val )

inherited

Set value used by PointLocatorBase::close_to_point_tol().

Defaults to 0.0. If nonzero, calls close_to_point_tol() whenever a new PointLocator is built for use by this Mesh. Since the Mesh controls the creation and destruction of the PointLocator, if there are any parameters we need to customize on it, the Mesh will need to know about them.

Definition at line 2355 of file mesh_base.C.

{
  _point_locator_close_to_point_tol = val;
  if (_point_locator)
    {
      if (val > 0.)
        _point_locator->set_close_to_point_tol(val);
      else
        _point_locator->unset_close_to_point_tol();
    }
}

References libMesh::MeshBase::_point_locator, and libMesh::MeshBase::_point_locator_close_to_point_tol.

◆ set_spatial_dimension()

void libMesh::MeshBase::set_spatial_dimension ( unsigned char d )

inherited

Sets the "spatial dimension" of the Mesh.

See the documentation for Mesh::spatial_dimension() for more information.

Definition at line 613 of file mesh_base.C.

{
  // The user can set the _spatial_dimension however they wish,
  // libMesh will only *increase* the spatial dimension, however,
  // never decrease it.
  _spatial_dimension = d;
}

References libMesh::MeshBase::_spatial_dimension.

Referenced by libMesh::MeshTools::Generation::build_cube(), MeshSpatialDimensionTest::test2D(), and InfFERadialTest::testRefinement().

◆ set_subdomain_name()

void libMesh::MeshBase::set_subdomain_name	(	subdomain_id_type	id,
		const std::string &	name,
		bool	synchronous = `false`
	)

inherited

Sets the name for the provided id.

Parameters

id	The subdomain id to set the name for
name	The subdomain name
synchronous	Whether this method is being called across all mesh ranks. If this is true, then we don't have to register this collective container as being out of sync

Definition at line 1929 of file mesh_base.C.

{
  if (synchronous)
    parallel_object_only();
  else
    this->unset_has_synched_subdomain_name_map();
  _block_id_to_name[id] =  name;
}

References libMesh::MeshBase::_block_id_to_name, and libMesh::MeshBase::unset_has_synched_subdomain_name_map().

Referenced by libMesh::AbaqusIO::assign_subdomain_ids(), libMesh::UNVIO::groups_in(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::GmshIO::read_mesh(), libMesh::UnstructuredMesh::stitching_helper(), ExodusC0PolyhedronTest::test_write_and_read_mixed_hex_tet_block_names_impl(), MeshStitchTest::testAmbiguousRemappingStitch(), and MeshStitchTest::testRemappingStitch().

◆ set_subdomain_name_map()

std::map< subdomain_id_type, std::string > & libMesh::MeshBase::set_subdomain_name_map ( )

inlineinherited

Returns: A writable reference to the whole subdomain name map

Definition at line 1928 of file mesh_base.h.

1929 { this->unset_has_synched_subdomain_name_map(); return _block_id_to_name; }

References libMesh::MeshBase::_block_id_to_name, and libMesh::MeshBase::unset_has_synched_subdomain_name_map().

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::CheckpointIO::read_header(), libMesh::XdrIO::read_serialized_subdomain_names(), libMesh::CheckpointIO::read_subdomain_names(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ size_elem_extra_integers()

void libMesh::MeshBase::size_elem_extra_integers ( )

protectedinherited

Size extra-integer arrays of all elements in the mesh.

Definition at line 2376 of file mesh_base.C.

{
  const std::size_t new_size = _elem_integer_names.size();
 
  Threads::parallel_for
    (this->element_stored_range(),
     [new_size, this](const ElemRange & range)
     {
       for (Elem * elem : range)
         elem->add_extra_integers(new_size, this->_elem_integer_default_values);
     });
}

References libMesh::MeshBase::_elem_integer_names, libMesh::MeshBase::element_stored_range(), and libMesh::Threads::parallel_for().

Referenced by libMesh::MeshBase::add_elem_data(), libMesh::MeshBase::add_elem_datum(), libMesh::MeshBase::add_elem_integer(), and libMesh::MeshBase::add_elem_integers().

◆ size_node_extra_integers()

void libMesh::MeshBase::size_node_extra_integers ( )

protectedinherited

Size extra-integer arrays of all nodes in the mesh.

Definition at line 2391 of file mesh_base.C.

{
  const std::size_t new_size = _node_integer_names.size();
  for (auto node : this->node_ptr_range())
    node->add_extra_integers(new_size, _node_integer_default_values);
}

References libMesh::MeshBase::_node_integer_default_values, and libMesh::MeshBase::_node_integer_names.

Referenced by libMesh::MeshBase::add_node_data(), libMesh::MeshBase::add_node_datum(), libMesh::MeshBase::add_node_integer(), and libMesh::MeshBase::add_node_integers().

◆ skip_noncritical_partitioning() [1/2]

bool libMesh::MeshBase::skip_noncritical_partitioning ( ) const

inlineinherited

Definition at line 1418 of file mesh_base.h.

1419 { return _skip_noncritical_partitioning || _skip_all_partitioning || !_partitioner.get(); }

References libMesh::MeshBase::_partitioner, libMesh::MeshBase::_skip_all_partitioning, and libMesh::MeshBase::_skip_noncritical_partitioning.

Referenced by libMesh::MeshBase::partition().

◆ skip_noncritical_partitioning() [2/2]

void libMesh::MeshBase::skip_noncritical_partitioning ( bool skip )

inlineinherited

If true is passed in then the elements on this mesh will no longer be (re)partitioned, and the nodes on this mesh will only be repartitioned if they are found "orphaned" via coarsening or other removal of the last element responsible for their node/element processor id consistency.

Note: It would probably be a bad idea to call this on a DistributedMesh before the first partitioning has happened... because no elements would get assigned to your processor pool.; Skipping partitioning can have adverse effects on your performance when using AMR... i.e. you could get large load imbalances. However you might still want to use this if the communication and computation of the rebalance and repartition is too high for your application.

It is also possible, for backwards-compatibility purposes, to skip noncritical partitioning by resetting the partitioner() pointer for this mesh.

Definition at line 1415 of file mesh_base.h.

1416 { _skip_noncritical_partitioning = skip; }

References libMesh::MeshBase::_skip_noncritical_partitioning.

Referenced by libMesh::MeshTools::correct_node_proc_ids(), MeshInputTest::testCopyElementSolutionImpl(), MeshInputTest::testCopyElementVectorImpl(), and MeshInputTest::testCopyNodalSolutionImpl().

◆ skip_partitioning() [1/2]

bool libMesh::MeshBase::skip_partitioning ( ) const

inlineinherited

Definition at line 1435 of file mesh_base.h.

1435{ return _skip_all_partitioning; }

References libMesh::MeshBase::_skip_all_partitioning.

Referenced by libMesh::MeshBase::complete_preparation(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::ReplicatedMesh::ReplicatedMesh().

◆ skip_partitioning() [2/2]

void libMesh::MeshBase::skip_partitioning ( bool skip )

inlineinherited

If true is passed in then nothing on this mesh will be (re)partitioned.

Note: The caveats for skip_noncritical_partitioning() still apply, and removing elements from a mesh with this setting enabled can leave node processor ids in an inconsistent state (not matching any attached element), causing failures in other library code. Do not use this setting along with element deletion or coarsening.

Definition at line 1433 of file mesh_base.h.

1433{ _skip_all_partitioning = skip; }

References libMesh::MeshBase::_skip_all_partitioning.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::CheckpointIO::read(), libMesh::ReplicatedMesh::ReplicatedMesh(), and CheckpointIOTest::testSplitter().

◆ spatial_dimension()

unsigned int libMesh::MeshBase::spatial_dimension ( ) const

inlineinherited

Returns: The "spatial dimension" of the mesh.

The spatial dimension is defined as:

1 - for an exactly x-aligned mesh of 1D elements 2 - for an exactly x-y planar mesh of 2D elements 3 - otherwise

No tolerance checks are performed to determine whether the Mesh is x-aligned or x-y planar, only strict equality with zero in the higher dimensions is checked. Also, x-z and y-z planar meshes are considered to have spatial dimension == 3.

The spatial dimension is updated during mesh preparation based on the dimensions of the various elements present in the Mesh, but is never automatically decreased.

For example, if the user calls set_spatial_dimension(2) and then later inserts 3D elements into the mesh, Mesh::spatial_dimension() will return 3 after the next call to prepare_for_use() or complete_preparation(). On the other hand, if the user calls set_spatial_dimension(3) and then inserts only x-aligned 1D elements into the Mesh, mesh.spatial_dimension() will remain 3.

Definition at line 2682 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_cached_elem_data);
 
  return cast_int<unsigned int>(_spatial_dimension);
}

References libMesh::MeshBase::_preparation, libMesh::MeshBase::_spatial_dimension, libMesh::MeshBase::Preparation::has_cached_elem_data, and libMesh::libmesh_assert().

Referenced by libMesh::EquationSystems::build_elemental_data_variable_names(), libMesh::EquationSystems::build_parallel_solution_vector(), libMesh::EquationSystems::build_variable_names(), libMesh::EquationSystems::find_variable_numbers_by_predicate(), libMesh::ExodusII_IO_Helper::initialize(), MeshSpatialDimensionTest::test1D(), and MeshSpatialDimensionTest::test2D().

◆ stitch_meshes()

std::size_t libMesh::UnstructuredMesh::stitch_meshes	(	const MeshBase &	other_mesh,
		boundary_id_type	this_mesh_boundary,
		boundary_id_type	other_mesh_boundary,
		Real	tol = `TOLERANCE`,
		bool	clear_stitched_boundary_ids = `false`,
		bool	verbose = `true`,
		bool	use_binary_search = `true`,
		bool	enforce_all_nodes_match_on_boundaries = `false`,
		bool	merge_boundary_nodes_all_or_nothing = `false`,
		bool	remap_subdomain_ids = `false`,
		bool	prepare_after_stitching = `true`
	)

inherited

Stitch other_mesh to this mesh so that this mesh is the union of the two meshes.

this_mesh_boundary and other_mesh_boundary are used to specify a dim-1 dimensional surface on which we seek to merge any "overlapping" nodes, where we use the parameter tol as a relative tolerance (relative to the smallest edge length on the surfaces being stitched) to determine whether or not nodes are overlapping. If clear_stitched_boundary_ids==true, this function clears boundary_info IDs in this mesh associated this_mesh_boundary and other_mesh_boundary. If use_binary_search is true, we use an optimized "sort then binary search" algorithm for finding matching nodes. Otherwise we use a N^2 algorithm (which can be more reliable at dealing with slightly misaligned meshes). If enforce_all_nodes_match_on_boundaries is true, we throw an error if the number of nodes on the specified boundaries don't match the number of nodes that were merged. This is a helpful error check in some cases. If this is true, it overrides the value of merge_boundary_nodes_all_or_nothing. If skip_find_neighbors is true, a faster stitching method is used, where the lists of neighbors for each elements are copied as well and patched, without calling the time-consuming find_neighbors() function. This option is now hard-coded to true. If merge_boundary_nodes_all_or_nothing is true, instead of throwing an error like enforce_all_nodes_match_on_boundaries, the meshes are combined anyway but coincident nodes are not merged into single nodes. This is useful in cases where you are not sure if the boundaries are fully conforming beforehand and you want to handle the non-conforming cases differently.

Note that the element IDs for elements in the stitched mesh corresponding to "this" mesh will be unchanged. The IDs for elements corresponding to other_mesh will be incremented by this->max_elem_id().

There is no simple a priori relationship between node IDs in "this" mesh and other_mesh and node IDs in the stitched mesh because the number of nodes (and hence the node IDs) in the stitched mesh depend on how many nodes are stitched.

If remap_subdomain_ids is true then we assume that some subdomain ids might have been autogenerated, so we remap them as necessary, treating subdomain names as the important thing for consistency; if we have missing names and cannot infer a consistent resolution to an id conflict then we exit with an error. If remap_subdomain_ids is false then we revert to the older libMesh behavior: leave all subdomain ids alone and woe unto you if you weren't keeping track of them.

If prepare_after_stitching is true then we prepare the newly stitched mesh for use immediately after stitching. If the mesh does not need to be completely prepared for use yet (e.g. because it will undergo further stitching etc. before repartitioning for load balancing is desired), this can be set to false to potentially improve performance.

Returns: the count of how many nodes were merged between the two meshes. This can be zero in the case of no matching nodes or if merge_boundary_nodes_all_or_nothing was active and relevant.

Definition at line 1917 of file unstructured_mesh.C.

{
  LOG_SCOPE("stitch_meshes()", "UnstructuredMesh");
  return stitching_helper(&other_mesh,
                          this_mesh_boundary_id,
                          other_mesh_boundary_id,
                          tol,
                          clear_stitched_boundary_ids,
                          verbose,
                          use_binary_search,
                          enforce_all_nodes_match_on_boundaries,
                          true,
                          merge_boundary_nodes_all_or_nothing,
                          remap_subdomain_ids,
                          prepare_after_stitching);
}

References libMesh::UnstructuredMesh::stitching_helper().

Referenced by main(), DisjointNeighborTest::testDisjointNeighborConflictError(), MeshStitchTest::testNodeElemStitch(), and DisjointNeighborTest::testStitchCrossMesh().

◆ stitch_surfaces()

std::size_t libMesh::UnstructuredMesh::stitch_surfaces	(	boundary_id_type	boundary_id_1,
		boundary_id_type	boundary_id_2,
		Real	tol = `TOLERANCE`,
		bool	clear_stitched_boundary_ids = `false`,
		bool	verbose = `true`,
		bool	use_binary_search = `true`,
		bool	enforce_all_nodes_match_on_boundaries = `false`,
		bool	merge_boundary_nodes_all_or_nothing = `false`,
		bool	prepare_after_stitching = `true`
	)

inherited

Similar to stitch_meshes, except that we stitch two adjacent surfaces within this mesh.

Definition at line 1946 of file unstructured_mesh.C.

{
  return stitching_helper(nullptr,
                          boundary_id_1,
                          boundary_id_2,
                          tol,
                          clear_stitched_boundary_ids,
                          verbose,
                          use_binary_search,
                          enforce_all_nodes_match_on_boundaries,
                          /* skip_find_neighbors = */ true,
                          merge_boundary_nodes_all_or_nothing,
                          /* remap_subdomain_ids = */ false,
                          prepare_after_stitching);
}

References libMesh::UnstructuredMesh::stitching_helper().

Referenced by DisjointNeighborTest::testStitchingDiscontinuousBoundaries().

◆ stitching_helper()

std::size_t libMesh::UnstructuredMesh::stitching_helper	(	const MeshBase *	other_mesh,
		boundary_id_type	boundary_id_1,
		boundary_id_type	boundary_id_2,
		Real	tol,
		bool	clear_stitched_boundary_ids,
		bool	verbose,
		bool	use_binary_search,
		bool	enforce_all_nodes_match_on_boundaries,
		bool	skip_find_neighbors,
		bool	merge_boundary_nodes_all_or_nothing,
		bool	remap_subdomain_ids,
		bool	prepare_after_stitching
	)

privateinherited

Helper function for stitch_meshes and stitch_surfaces that does the mesh stitching.

Definition at line 1973 of file unstructured_mesh.C.

{
#ifdef DEBUG
  // We rely on neighbor links here
  MeshTools::libmesh_assert_valid_neighbors(*this);
#endif
 
  bool is_valid_disjoint_pair_to_stitch = false;
 
#ifdef LIBMESH_ENABLE_PERIODIC
  auto * this_db  = this->get_disjoint_neighbor_boundary_pairs();
  auto * other_db = (other_mesh ? other_mesh->get_disjoint_neighbor_boundary_pairs() : nullptr);
  const bool have_disc_bdys =
    (this_db && !this_db->empty()) || (other_db && !other_db->empty());
 
  if (have_disc_bdys)
    {
      const boundary_id_type a = this_mesh_boundary_id;
      const boundary_id_type b = other_mesh_boundary_id;
 
      auto get_pb = [](const PeriodicBoundaries * db, boundary_id_type id)
        {
          return db ? db->boundary(id) : nullptr;
        };
 
      // this mesh
      const auto * pb_this_a = get_pb(this_db, a);
      const auto * pb_this_b = get_pb(this_db, b);
      const bool in_this =
        (pb_this_a && pb_this_a->pairedboundary == b) ||
        (pb_this_b && pb_this_b->pairedboundary == a);
 
      // other mesh
      const auto * pb_other_b = get_pb(other_db, b);
      const auto * pb_other_a = get_pb(other_db, a);
      const bool in_other =
        (pb_other_b && pb_other_b->pairedboundary == a) ||
        (pb_other_a && pb_other_a->pairedboundary == b);
 
      // Conflict conditions:
      // Case 1: On "this" mesh, a or b exist but are not paired,
      //         while the other mesh pairs them.
      if (!in_this && (pb_this_a || pb_this_b) && in_other)
        libmesh_error_msg("Disjoint neighbor boundary pairing mismatch: on 'this' mesh, "
                          "boundary (" << a << " or " << b
                          << ") exists but is not paired; on 'other' mesh the pair is present.");
 
      // Case 2: On "other" mesh, a or b exist but are not paired,
      //         while this mesh pairs them.
      if (!in_other && (pb_other_a || pb_other_b) && in_this)
        libmesh_error_msg("Disjoint neighbor boundary pairing mismatch: on 'other' mesh, "
                          "boundary (" << a << " or " << b
                          << ") exists but is not paired; on 'this' mesh the pair is present.");
 
      // Legal conditions: either side has a correct pairing
      if (in_this || in_other)
        is_valid_disjoint_pair_to_stitch = true;
    }
#endif // LIBMESH_ENABLE_PERIODIC
 
  // We can't even afford any unset neighbor links here.
  if (!this->is_prepared())
    this->find_neighbors();
 
  // FIXME: make distributed mesh support efficient.
  // Yes, we currently suck.
  MeshSerializer serialize(*this);
 
  // *Badly*.
  std::unique_ptr<MeshSerializer> serialize_other;
  if (other_mesh)
    serialize_other = std::make_unique<MeshSerializer>
      (*const_cast<MeshBase *>(other_mesh));
 
  std::map<dof_id_type, dof_id_type> node_to_node_map, other_to_this_node_map; // The second is the inverse map of the first
  std::map<dof_id_type, std::vector<dof_id_type>> node_to_elems_map;
 
  typedef dof_id_type                     key_type;
  typedef std::pair<const Elem *, unsigned char> val_type;
  typedef std::pair<key_type, val_type>   key_val_pair;
  typedef std::unordered_multimap<key_type, val_type> map_type;
  // Mapping between all side keys in this mesh and elements+side numbers relevant to the boundary in this mesh as well.
  map_type side_to_elem_map;
 
  // If there is only one mesh (i.e. other_mesh == nullptr), then loop over this mesh twice
  if (!other_mesh)
    {
      other_mesh = this;
    }
 
  if ((this_mesh_boundary_id  != BoundaryInfo::invalid_id) &&
      (other_mesh_boundary_id != BoundaryInfo::invalid_id))
    {
      LOG_SCOPE("stitch_meshes node merging", "UnstructuredMesh");
 
      // While finding nodes on the boundary, also find the minimum edge length
      // of all faces on both boundaries.  This will later be used in relative
      // distance checks when stitching nodes.
      Real h_min = std::numeric_limits<Real>::max();
      bool h_min_updated = false;
 
      // Loop below fills in these sets for the two meshes.
      std::set<dof_id_type> this_boundary_node_ids, other_boundary_node_ids;
 
      // Pull objects out of the loop to reduce heap operations
      std::unique_ptr<const Elem> side;
 
      {
        // Make temporary fixed-size arrays for loop
        boundary_id_type id_array[2]         = {this_mesh_boundary_id, other_mesh_boundary_id};
        std::set<dof_id_type> * set_array[2] = {&this_boundary_node_ids, &other_boundary_node_ids};
        const MeshBase * mesh_array[2] = {this, other_mesh};
 
        for (unsigned i=0; i<2; ++i)
          {
            // First we deal with node boundary IDs.  We only enter
            // this loop if we have at least one nodeset. Note that we
            // do not attempt to make an h_min determination here.
            // The h_min determination is done while looping over the
            // Elems and checking their sides and edges for boundary
            // information, below.
            if (mesh_array[i]->get_boundary_info().n_nodeset_conds() > 0)
              {
                // build_node_list() returns a vector of (node-id, bc-id) tuples
                for (const auto & t : mesh_array[i]->get_boundary_info().build_node_list())
                  {
                    boundary_id_type node_bc_id = std::get<1>(t);
                    if (node_bc_id == id_array[i])
                      {
                        dof_id_type this_node_id = std::get<0>(t);
                        set_array[i]->insert( this_node_id );
                      }
                  }
              }
 
            // Container to catch boundary IDs passed back from BoundaryInfo.
            std::vector<boundary_id_type> bc_ids;
 
            // Pointers to boundary NodeElems encountered while looping over the entire Mesh
            // and checking side and edge boundary ids. The Nodes associated with NodeElems
            // may be in a boundary nodeset, but not connected to any other Elems. In this
            // case, we also consider the "minimum node separation distance" amongst all
            // NodeElems when determining the relevant h_min value for this mesh.
            std::vector<const Elem *> boundary_node_elems;
 
            for (auto & el : mesh_array[i]->element_ptr_range())
              {
                // Now check whether elem has a face on the specified boundary
                for (auto side_id : el->side_index_range())
                  {
                    bool should_stitch_this_side =
                      (el->neighbor_ptr(side_id) == nullptr) ||
                      (is_valid_disjoint_pair_to_stitch &&
                      mesh_array[i]->get_boundary_info().has_boundary_id(el, side_id, id_array[i]));
 
                    if (should_stitch_this_side)
                      {
                        // Get *all* boundary IDs on this side, not just the first one!
                        mesh_array[i]->get_boundary_info().boundary_ids (el, side_id, bc_ids);
 
                        if (std::find(bc_ids.begin(), bc_ids.end(), id_array[i]) != bc_ids.end())
                          {
                            el->build_side_ptr(side, side_id);
                            for (auto & n : side->node_ref_range())
                              set_array[i]->insert(n.id());
 
                            h_min = std::min(h_min, side->hmin());
                            h_min_updated = true;
 
                            // This side is on the boundary, add its information to side_to_elem
                            if (skip_find_neighbors && (i==0))
                              {
                                key_type key = el->low_order_key(side_id);
                                val_type val;
                                val.first = el;
                                val.second = cast_int<unsigned char>(side_id);
 
                                key_val_pair kvp;
                                kvp.first = key;
                                kvp.second = val;
                                side_to_elem_map.insert (kvp);
                              }
                          }
 
                        // Also, check the edges on this side. We don't have to worry about
                        // updating neighbor info in this case since elements don't store
                        // neighbor info on edges.
                        for (auto edge_id : el->edge_index_range())
                          {
                            if (el->is_edge_on_side(edge_id, side_id))
                              {
                                // Get *all* boundary IDs on this edge, not just the first one!
                                mesh_array[i]->get_boundary_info().edge_boundary_ids (el, edge_id, bc_ids);
 
                                if (std::find(bc_ids.begin(), bc_ids.end(), id_array[i]) != bc_ids.end())
                                  {
                                    std::unique_ptr<const Elem> edge (el->build_edge_ptr(edge_id));
                                    for (auto & n : edge->node_ref_range())
                                      set_array[i]->insert( n.id() );
 
                                    h_min = std::min(h_min, edge->hmin());
                                    h_min_updated = true;
                                  }
                              }
                          } // end for (edge_id)
                      } // end if (should_stitch_this_side)
                  } // end for (side_id)
 
                // Alternatively, is this a boundary NodeElem? If so,
                // add it to a list of NodeElems that will later be
                // used to set h_min based on the minimum node
                // separation distance between all pairs of boundary
                // NodeElems.
                if (el->type() == NODEELEM)
                  {
                    mesh_array[i]->get_boundary_info().boundary_ids(el->node_ptr(0), bc_ids);
                    if (std::find(bc_ids.begin(), bc_ids.end(), id_array[i]) != bc_ids.end())
                      {
                        boundary_node_elems.push_back(el);
 
                        // Debugging:
                        // libMesh::out << "Elem " << el->id() << " is a NodeElem on boundary " << id_array[i] << std::endl;
                      }
                  } // end if (el->type() == NODEELEM)
              } // end for (el)
 
            // Compute the minimum node separation distance amongst
            // all boundary NodeElem pairs.
            {
              const auto N = boundary_node_elems.size();
              for (auto node_elem_i : make_range(N))
                for (auto node_elem_j : make_range(node_elem_i+1, N))
                  {
                    Real node_sep =
                      (boundary_node_elems[node_elem_i]->point(0) - boundary_node_elems[node_elem_j]->point(0)).norm();
 
                    // We only want to consider non-coincident
                    // boundary NodeElem pairs when determining the
                    // minimum node separation distance.
                    if (node_sep > 0.)
                      {
                        h_min = std::min(h_min, node_sep);
                        h_min_updated = true;
                      }
                  } // end for (node_elem_j)
            } // end minimum NodeElem separation scope
          } // end for (i)
      } // end scope
 
      if (verbose)
        {
          libMesh::out << "In UnstructuredMesh::stitch_meshes:\n"
                       << "This mesh has "  << this_boundary_node_ids.size()
                       << " nodes on boundary `"
                       << this->get_boundary_info().get_sideset_name(this_mesh_boundary_id)
                       << "' (" << this_mesh_boundary_id  << ").\n"
                       << "Other mesh has " << other_boundary_node_ids.size()
                       << " nodes on boundary `"
                       << other_mesh->get_boundary_info().get_sideset_name(other_mesh_boundary_id)
                       << "' (" << other_mesh_boundary_id  << ").\n";
 
          if (h_min_updated)
            {
              libMesh::out << "Minimum edge length on both surfaces is " << h_min << ".\n";
            }
          else
            {
              libMesh::out << "No minimum edge length determined on specified surfaces." << std::endl;
            }
        }
 
      // At this point, if h_min==0 it means that there were at least two coincident
      // nodes on the surfaces being stitched, and we don't currently support that case.
      // (It might be possible to support, but getting it exactly right would be tricky
      // and probably not worth the extra complications to the "normal" case.)
      libmesh_error_msg_if(h_min < std::numeric_limits<Real>::epsilon(),
                           "Coincident nodes detected on source and/or target "
                           "surface, stitching meshes is not possible.");
 
      // We require nanoflann for the "binary search" (really kd-tree)
      // option to work. If it's not available, turn that option off,
      // warn the user, and fall back on the N^2 search algorithm.
      if (use_binary_search)
        {
#ifndef LIBMESH_HAVE_NANOFLANN
          use_binary_search = false;
          libmesh_warning("The use_binary_search option in the "
                          "UnstructuredMesh stitching algorithms requires nanoflann "
                          "support. Falling back on N^2 search algorithm.");
#endif
        }
 
      if (!this_boundary_node_ids.empty())
      {
        if (use_binary_search)
        {
#ifdef LIBMESH_HAVE_NANOFLANN
          typedef nanoflann::KDTreeSingleIndexAdaptor<nanoflann::L2_Simple_Adaptor<Real, VectorOfNodesAdaptor>,
            VectorOfNodesAdaptor, 3, std::size_t> kd_tree_t;
 
          // Create the dataset needed to build the kd tree with nanoflann
          std::vector<std::pair<Point, dof_id_type>> this_mesh_nodes(this_boundary_node_ids.size());
 
          for (auto [it, ctr] = std::make_tuple(this_boundary_node_ids.begin(), 0u);
               it != this_boundary_node_ids.end(); ++it, ++ctr)
          {
            this_mesh_nodes[ctr].first = this->point(*it);
            this_mesh_nodes[ctr].second = *it;
          }
 
          VectorOfNodesAdaptor vec_nodes_adaptor(this_mesh_nodes);
 
          kd_tree_t this_kd_tree(3, vec_nodes_adaptor, 10);
          this_kd_tree.buildIndex();
 
          // Storage for nearest neighbor in the loop below
          std::size_t ret_index;
          Real ret_dist_sqr;
 
          // Loop over other mesh. For each node, find its nearest neighbor in this mesh, and fill in the maps.
          for (const auto & node_id : other_boundary_node_ids)
          {
            const auto & p = other_mesh->point(node_id);
            const Real query_pt[] = {p(0), p(1), p(2)};
            this_kd_tree.knnSearch(&query_pt[0], 1, &ret_index, &ret_dist_sqr);
 
            // TODO: here we should use the user's specified tolerance
            // and the previously determined value of h_min in the
            // distance comparison, not just TOLERANCE^2.
            if (ret_dist_sqr < TOLERANCE*TOLERANCE)
            {
              node_to_node_map[this_mesh_nodes[ret_index].second] = node_id;
              other_to_this_node_map[node_id] = this_mesh_nodes[ret_index].second;
            }
          }
 
          // If the two maps don't have the same size, it means one
          // node in this mesh is the nearest neighbor of several
          // nodes in other mesh. Since the stitching is ambiguous in
          // this case, we throw an error.
          libmesh_error_msg_if(node_to_node_map.size() != other_to_this_node_map.size(),
                               "Error: Found multiple matching nodes in stitch_meshes");
#endif
        }
        else // !use_binary_search
        {
          // In the unlikely event that two meshes composed entirely of
          // NodeElems are being stitched together, we will not have
          // selected a valid h_min value yet, and the distance
          // comparison below will be true for essentially any two
          // nodes. In this case we simply fall back on an absolute
          // distance check.
          if (!h_min_updated)
            {
              libmesh_warning("No valid h_min value was found, falling back on "
                              "absolute distance check in the N^2 search algorithm.");
              h_min = 1.;
            }
 
          // Otherwise, use a simple N^2 search to find the closest matching points. This can be helpful
          // in the case that we have tolerance issues which cause mismatch between the two surfaces
          // that are being stitched.
          for (const auto & this_node_id : this_boundary_node_ids)
          {
            Node & this_node = this->node_ref(this_node_id);
 
            bool found_matching_nodes = false;
 
            for (const auto & other_node_id : other_boundary_node_ids)
            {
              const Node & other_node = other_mesh->node_ref(other_node_id);
 
              Real node_distance = (this_node - other_node).norm();
 
              if (node_distance < tol*h_min)
              {
                // Make sure we didn't already find a matching node!
                libmesh_error_msg_if(found_matching_nodes,
                                     "Error: Found multiple matching nodes in stitch_meshes");
 
                node_to_node_map[this_node_id] = other_node_id;
                other_to_this_node_map[other_node_id] = this_node_id;
 
                found_matching_nodes = true;
              }
            }
          }
        }
      }
 
      // Build up the node_to_elems_map, using only one loop over other_mesh
      for (auto & el : other_mesh->element_ptr_range())
        {
          // For each node on the element, find the corresponding node
          // on "this" Mesh, 'this_node_id', if it exists, and push
          // the current element ID back onto node_to_elems_map[this_node_id].
          // For that we will use the reverse mapping we created at
          // the same time as the forward mapping.
          for (auto & n : el->node_ref_range())
            if (const auto it = other_to_this_node_map.find(/*other_node_id=*/n.id());
                it != other_to_this_node_map.end())
              node_to_elems_map[/*this_node_id=*/it->second].push_back( el->id() );
        }
 
      if (verbose)
        {
          libMesh::out << "In UnstructuredMesh::stitch_meshes:\n"
                       << "Found " << node_to_node_map.size()
                       << " matching nodes.\n"
                       << std::endl;
        }
 
      if (enforce_all_nodes_match_on_boundaries)
        {
          std::size_t n_matching_nodes = node_to_node_map.size();
          std::size_t this_mesh_n_nodes = this_boundary_node_ids.size();
          std::size_t other_mesh_n_nodes = other_boundary_node_ids.size();
          libmesh_error_msg_if((n_matching_nodes != this_mesh_n_nodes) || (n_matching_nodes != other_mesh_n_nodes),
                               "Error: We expected the number of nodes to match.");
        }
 
      if (merge_boundary_nodes_all_or_nothing)
        {
          std::size_t n_matching_nodes = node_to_node_map.size();
          std::size_t this_mesh_n_nodes = this_boundary_node_ids.size();
          std::size_t other_mesh_n_nodes = other_boundary_node_ids.size();
          if ((n_matching_nodes != this_mesh_n_nodes) || (n_matching_nodes != other_mesh_n_nodes))
            {
              if (verbose)
                {
                  libMesh::out << "Skipping node merging in "
                                  "UnstructuredMesh::stitch_meshes because not "
                                  "all boundary nodes were matched."
                               << std::endl;
                }
              node_to_node_map.clear();
              other_to_this_node_map.clear();
              node_to_elems_map.clear();
            }
        }
    }
  else
    {
      if (verbose)
        {
          libMesh::out << "Skip node merging in UnstructuredMesh::stitch_meshes:" << std::endl;
        }
    }
 
  dof_id_type node_delta = this->max_node_id();
  dof_id_type elem_delta = this->max_elem_id();
 
  unique_id_type unique_delta =
#ifdef LIBMESH_ENABLE_UNIQUE_ID
    this->parallel_max_unique_id();
#else
    0;
#endif
 
  // If other_mesh != nullptr, then we have to do a bunch of work
  // in order to copy it to this mesh
  if (this!=other_mesh)
    {
      LOG_SCOPE("stitch_meshes copying", "UnstructuredMesh");
 
#ifdef LIBMESH_ENABLE_PERIODIC
        // Copy disjoint neighbor boundary pairs (PeriodicBoundary objects)
        // from `other_mesh` to `this` mesh
        if (other_db && !other_db->empty())
          {
            for (const auto & [bdy_id, pb_ptr] : *other_db)
              {
                const auto & pb = *pb_ptr;
                const boundary_id_type a = pb.myboundary;
                const boundary_id_type b = pb.pairedboundary;
 
                if (this_db)
                  {
                    // Skip if identical pair already exists
                    if (const auto * existing_pb = this_db->boundary(a))
                      if ((existing_pb->myboundary == a && existing_pb->pairedboundary == b) ||
                          (existing_pb->myboundary == b && existing_pb->pairedboundary == a))
                        continue;
 
                    // If both boundary ids exist on this mesh but aren't paired here, refuse to create a new pair
                    const auto & bdy_ids = this->get_boundary_info().get_boundary_ids();
                    const bool a_exists = bdy_ids.count(a);
                    const bool b_exists = bdy_ids.count(b);
                    // If a and b already exist on `this`, we should be screaming and dying
                    // unless they already have PeriodicBoundary objects connecting them too
                    if (a_exists && b_exists && !this_db->boundary(a))
                      libmesh_error_msg("Conflict: boundaries " << a << " and " << b
                                        << " already exist on this mesh but are not paired.");
                  }
 
                this->add_disjoint_neighbor_boundary_pairs(a, b, pb.get_corresponding_pos(Point(0.0,0.0,0.0)));
              }
          }
#endif // LIBMESH_ENABLE_PERIODIC
 
 
      // Increment the node_to_node_map and node_to_elems_map
      // to account for id offsets
      for (auto & pr : node_to_node_map)
        pr.second += node_delta;
 
      for (auto & pr : node_to_elems_map)
        for (auto & entry : pr.second)
          entry += elem_delta;
 
      // We run into problems when the libMesh subdomain standard (the
      // id defines the subdomain; the name was an afterthought) and
      // the MOOSE standard (the name defines the subdomain; the id
      // might be autogenerated) clash.
      //
      // Subdomain ids with the same name in both meshes are surely
      // meant to represent the same subdomain.  We can just merge
      // them.
      //
      // Subdomain ids which don't have a name in either mesh are
      // almost surely meant to represent the same subdomain.  We'll
      // just merge them.
      //
      // Subdomain ids with different names in different meshes, or
      // names with different ids in different meshes, are trickier.
      // For backwards compatibility we default to the old "just copy
      // all the subdomain ids over" behavior, but if requested we'll
      // remap any ids that appear to be clear conflicts, and we'll
      // scream and die if we see any ids that are ambiguous due to
      // being named in one mesh but not the other.
      std::unordered_map<subdomain_id_type, subdomain_id_type> id_remapping;
      if (remap_subdomain_ids)
        {
          const auto & this_map = this->get_subdomain_name_map();
          const auto & other_map = other_mesh->get_subdomain_name_map();
          std::unordered_map<std::string, subdomain_id_type> other_map_reversed;
          for (auto & [sid, sname] : other_map)
            other_map_reversed.emplace(sname, sid);
 
          std::unordered_map<std::string, subdomain_id_type> this_map_reversed;
          for (auto & [sid, sname] : this_map)
            this_map_reversed.emplace(sname, sid);
 
          // We don't require either mesh to be prepared, but that
          // means we need to check for subdomains manually.
          auto get_subdomains = [](const MeshBase & mesh) {
            std::set<subdomain_id_type> all_subdomains;
            for (auto & el : mesh.element_ptr_range())
              all_subdomains.insert(el->subdomain_id());
            return all_subdomains;
          };
 
          const auto this_subdomains = get_subdomains(*this);
          const auto other_subdomains = get_subdomains(*other_mesh);
 
          for (auto & [sid, sname] : this_map)
            {
              // The same name with the same id means we're fine.  The
              // same name with another id means we remap their id to
              // ours
              if (const auto other_reverse_it = other_map_reversed.find(sname);
                  other_reverse_it != other_map_reversed.end() && other_reverse_it->second != sid)
                id_remapping[other_reverse_it->second] = sid;
 
              // The same id with a different name, we'll get to
              // later.  The same id without any name means we don't
              // know what the user wants.
              if (other_subdomains.count(sid) && !other_map.count(sid))
                libmesh_error_msg("Can't safely stitch with a mesh sharing subdomain id "
                                  << sid << " but not subdomain name " << sname);
            }
 
          subdomain_id_type next_free_id = 0;
          // We might try to stitch empty meshes ...
          if (!this_subdomains.empty())
            next_free_id = *this_subdomains.rbegin() + 1;
          if (!other_subdomains.empty())
            next_free_id =
              std::max(next_free_id,
                       cast_int<subdomain_id_type>
                         (*other_subdomains.rbegin() + 1));
 
          for (auto & [sid, sname] : other_map)
            {
              // At this point we've figured out any remapping
              // necessary for an sname that we share.  And we don't
              // need to remap any sid we don't share.
              if (!this_map_reversed.count(sname))
                {
                  // But if we don't have this sname and we do have this
                  // sid then we can't just merge into that.
                  if (this_subdomains.count(sid))
                    {
                      // If we have this sid with no name, we don't
                      // know what the user wants.
                      if (!this_map.count(sid))
                        libmesh_error_msg("Can't safely stitch with a mesh sharing subdomain id "
                                          << sid << " but under subdomain name " << sname);
 
                      // We have this sid under a different name, so
                      // we just need to give the other elements a new
                      // id.
 
                      // Users might have done crazy things with id
                      // choice so let's make sure they didn't get too
                      // crazy.
                      libmesh_error_msg_if ((!this_subdomains.empty() &&
                                             next_free_id < *this_subdomains.rbegin()) ||
                                            (!other_subdomains.empty() &&
                                             next_free_id < *other_subdomains.rbegin()),
                                            "Subdomain id overflow");
 
                      id_remapping[sid] = next_free_id++;
                      this->set_subdomain_name(next_free_id, sname);
                    }
                  // If we don't have this subdomain id, well, we're
                  // about to, so we should have its name too.
                  else
                    this->set_subdomain_name(sid, sname);
                }
            }
        }
 
      // Copy mesh data. If we skip the call to find_neighbors(), the lists
      // of neighbors will be copied verbatim from the other mesh
      this->copy_nodes_and_elements(*other_mesh, skip_find_neighbors,
                                    elem_delta, node_delta,
                                    unique_delta, &id_remapping);
 
      // Copy BoundaryInfo from other_mesh too.  We do this via the
      // list APIs rather than element-by-element for speed.
      BoundaryInfo & boundary = this->get_boundary_info();
      const BoundaryInfo & other_boundary = other_mesh->get_boundary_info();
 
      for (const auto & t : other_boundary.build_node_list())
        boundary.add_node(std::get<0>(t) + node_delta,
                          std::get<1>(t));
 
      for (const auto & t : other_boundary.build_side_list())
        boundary.add_side(std::get<0>(t) + elem_delta,
                          std::get<1>(t),
                          std::get<2>(t));
 
      for (const auto & t : other_boundary.build_edge_list())
        boundary.add_edge(std::get<0>(t) + elem_delta,
                          std::get<1>(t),
                          std::get<2>(t));
 
      for (const auto & t : other_boundary.build_shellface_list())
        boundary.add_shellface(std::get<0>(t) + elem_delta,
                               std::get<1>(t),
                               std::get<2>(t));
 
      const auto & other_ns_id_to_name = other_boundary.get_nodeset_name_map();
      auto & ns_id_to_name = boundary.set_nodeset_name_map();
      ns_id_to_name.insert(other_ns_id_to_name.begin(), other_ns_id_to_name.end());
 
      const auto & other_ss_id_to_name = other_boundary.get_sideset_name_map();
      auto & ss_id_to_name = boundary.set_sideset_name_map();
      ss_id_to_name.insert(other_ss_id_to_name.begin(), other_ss_id_to_name.end());
 
      const auto & other_es_id_to_name = other_boundary.get_edgeset_name_map();
      auto & es_id_to_name = boundary.set_edgeset_name_map();
      es_id_to_name.insert(other_es_id_to_name.begin(), other_es_id_to_name.end());
 
      // Merge other_mesh's elemset information with ours. Throw an
      // error if this and other_mesh have overlapping elemset codes
      // that refer to different elemset ids.
      std::vector<dof_id_type> this_elemset_codes = this->get_elemset_codes();
      MeshBase::elemset_type this_id_set_to_fill, other_id_set_to_fill;
      for (const auto & elemset_code : other_mesh->get_elemset_codes())
        {
          // Get the elemset ids for this elemset_code on other_mesh
          other_mesh->get_elemsets(elemset_code, other_id_set_to_fill);
 
          // Check that this elemset code does not already exist
          // in this mesh, or if it does, that it has the same elemset
          // ids associated with it.
          //
          // Note: get_elemset_codes() is guaranteed to return a
          // sorted vector, so we can binary search in it.
          auto it = Utility::binary_find(this_elemset_codes.begin(),
                                         this_elemset_codes.end(),
                                         elemset_code);
 
          if (it != this_elemset_codes.end())
            {
              // This mesh has the same elemset code. Does it refer to
              // the same elemset ids?
              this->get_elemsets(elemset_code, this_id_set_to_fill);
 
              // Throw an error if they don't match, otherwise we
              // don't need to do anything
              libmesh_error_msg_if(other_id_set_to_fill != this_id_set_to_fill,
                                   "Attempted to stitch together meshes with conflicting elemset codes.");
            }
          else
            {
              // Add other_mesh's elemset code to this mesh
              this->add_elemset_code(elemset_code, other_id_set_to_fill);
            }
        }
 
    } // end if (other_mesh)
 
  // Finally, we need to "merge" the overlapping nodes
  // We do this by iterating over node_to_elems_map and updating
  // the elements so that they "point" to the nodes that came
  // from this mesh, rather than from other_mesh.
  // Then we iterate over node_to_node_map and delete the
  // duplicate nodes that came from other_mesh.
 
  {
    LOG_SCOPE("stitch_meshes node updates", "UnstructuredMesh");
 
    // Container to catch boundary IDs passed back from BoundaryInfo.
    std::vector<boundary_id_type> bc_ids;
 
    for (const auto & [target_node_id, elem_vec] : node_to_elems_map)
      {
        dof_id_type other_node_id = node_to_node_map[target_node_id];
        Node & target_node = this->node_ref(target_node_id);
 
        std::size_t n_elems = elem_vec.size();
        for (std::size_t i=0; i<n_elems; i++)
          {
            dof_id_type elem_id = elem_vec[i];
            Elem * el = this->elem_ptr(elem_id);
 
            // find the local node index that we want to update
            unsigned int local_node_index = el->local_node(other_node_id);
            libmesh_assert_not_equal_to(local_node_index, libMesh::invalid_uint);
 
            // We also need to copy over the nodeset info here,
            // because the node will get deleted below
            this->get_boundary_info().boundary_ids(el->node_ptr(local_node_index), bc_ids);
            el->set_node(local_node_index, &target_node);
            this->get_boundary_info().add_node(&target_node, bc_ids);
          }
      }
  }
 
  {
    LOG_SCOPE("stitch_meshes node deletion", "UnstructuredMesh");
    for (const auto & [other_node_id, this_node_id] : node_to_node_map)
      {
        // In the case that this==other_mesh, the two nodes might be the same (e.g. if
        // we're stitching a "sliver"), hence we need to skip node deletion in that case.
        if ((this == other_mesh) && (this_node_id == other_node_id))
          continue;
 
        this->delete_node( this->node_ptr(this_node_id) );
      }
  }
 
  // If find_neighbors() wasn't called in prepare_for_use(), we need to
  // manually loop once more over all elements adjacent to the stitched boundary
  // and fix their lists of neighbors.
  // This is done according to the following steps:
  //   1. Loop over all copied elements adjacent to the boundary using node_to_elems_map (trying to avoid duplicates)
  //   2. Look at all their sides with a nullptr neighbor and update them using side_to_elem_map if necessary
  //   3. Update the corresponding side in side_to_elem_map as well
  if (skip_find_neighbors)
    {
      LOG_SCOPE("stitch_meshes neighbor fixes", "UnstructuredMesh");
 
      // Pull objects out of the loop to reduce heap operations
      std::unique_ptr<const Elem> my_side, their_side;
 
      std::set<dof_id_type> fixed_elems;
      for (const auto & pr : node_to_elems_map)
        {
          std::size_t n_elems = pr.second.size();
          for (std::size_t i=0; i<n_elems; i++)
            {
              dof_id_type elem_id = pr.second[i];
              if (!fixed_elems.count(elem_id))
                {
                  Elem * el = this->elem_ptr(elem_id);
                  fixed_elems.insert(elem_id);
                  for (auto s : el->side_index_range())
                    {
                      bool has_real_neighbor = (el->neighbor_ptr(s) != nullptr);
                      bool has_disdjoint_neighbor = is_valid_disjoint_pair_to_stitch &&
                      (this->get_boundary_info().has_boundary_id(el, s, this_mesh_boundary_id)
                      || this->get_boundary_info().has_boundary_id(el, s, other_mesh_boundary_id));
 
                      if (!has_real_neighbor || has_disdjoint_neighbor)
                        {
                          key_type key = el->low_order_key(s);
                          auto bounds = side_to_elem_map.equal_range(key);
 
                          if (bounds.first != bounds.second)
                            {
                              // Get the side for this element
                              el->side_ptr(my_side, s);
 
                              // Look at all the entries with an equivalent key
                              while (bounds.first != bounds.second)
                                {
                                  // Get the potential element
                                  Elem * neighbor = const_cast<Elem *>(bounds.first->second.first);
 
                                  // Get the side for the neighboring element
                                  const unsigned int ns = bounds.first->second.second;
                                  neighbor->side_ptr(their_side, ns);
                                  //libmesh_assert(my_side.get());
                                  //libmesh_assert(their_side.get());
 
                                  // If found a match with my side
                                  //
                                  // We need special tests here for 1D:
                                  // since parents and children have an equal
                                  // side (i.e. a node), we need to check
                                  // ns != ms, and we also check level() to
                                  // avoid setting our neighbor pointer to
                                  // any of our neighbor's descendants
                                  if ((*my_side == *their_side) &&
                                      (el->level() == neighbor->level()) &&
                                      ((el->dim() != 1) || (ns != s)))
                                    {
                                      // So share a side.  Is this a mixed pair
                                      // of subactive and active/ancestor
                                      // elements?
                                      // If not, then we're neighbors.
                                      // If so, then the subactive's neighbor is
 
                                      if (el->subactive() ==
                                          neighbor->subactive())
                                        {
                                          // an element is only subactive if it has
                                          // been coarsened but not deleted
                                          el->set_neighbor (s,neighbor);
                                          neighbor->set_neighbor(ns,el);
                                        }
                                      else if (el->subactive())
                                        {
                                          el->set_neighbor(s,neighbor);
                                        }
                                      else if (neighbor->subactive())
                                        {
                                          neighbor->set_neighbor(ns,el);
                                        }
                                      // It's OK to invalidate the
                                      // bounds.first iterator here,
                                      // as we are immediately going
                                      // to break out of this while
                                      // loop. bounds.first will
                                      // therefore not be used for
                                      // anything else.
                                      side_to_elem_map.erase (bounds.first);
                                      break;
                                    }
 
                                  ++bounds.first;
                                }
                            }
                        }
                    }
                }
            }
        }
    }
 
#ifdef LIBMESH_ENABLE_PERIODIC
  // Remove only the disjoint pair that was actually stitched.
  // Safe because `is_valid_disjoint_pair_to_stitch` is true
  // only if this exact (a,b) pair exists in the registry.
  // Other disjoint pairs remain untouched.
  if (is_valid_disjoint_pair_to_stitch)
    this->remove_disjoint_boundary_pair(this_mesh_boundary_id, other_mesh_boundary_id);
#endif
 
  if (prepare_after_stitching)
    {
      // We set our new neighbor pointers already
      const bool old_allow_find_neighbors = this->allow_find_neighbors();
      this->allow_find_neighbors(!skip_find_neighbors);
 
      // We haven't newly remoted any elements
      const bool old_allow_remote_element_removal = this->allow_remote_element_removal();
      this->allow_remote_element_removal(false);
 
      this->prepare_for_use();
 
      this->allow_find_neighbors(old_allow_find_neighbors);
      this->allow_remote_element_removal(old_allow_remote_element_removal);
    }
 
  // After the stitching, we may want to clear boundary IDs from element
  // faces that are now internal to the mesh
  if (clear_stitched_boundary_ids)
    {
      LOG_SCOPE("stitch_meshes clear bcids", "UnstructuredMesh");
 
      this->get_boundary_info().clear_stitched_boundary_side_ids(
          this_mesh_boundary_id, other_mesh_boundary_id, /*clear_nodeset_data=*/true);
    }
 
  // Return the number of nodes which were merged.
  return node_to_node_map.size();
}

Referenced by libMesh::UnstructuredMesh::stitch_meshes(), and libMesh::UnstructuredMesh::stitch_surfaces().

◆ sub_point_locator()

std::unique_ptr< PointLocatorBase > libMesh::MeshBase::sub_point_locator ( ) const

inherited

Returns: A pointer to a subordinate PointLocatorBase object for this mesh, constructing a master PointLocator first if necessary. This should not be used in threaded or non-parallel_only code unless the master has already been constructed.

Definition at line 1848 of file mesh_base.C.

{
  // If there's no master point locator, then we need one.
  if (_point_locator.get() == nullptr)
    {
      // PointLocator construction may not be safe within threads
      libmesh_assert(!Threads::in_threads);
 
      // And it may require parallel communication
      parallel_object_only();
 
#ifdef LIBMESH_ENABLE_NANOFLANN_POINTLOCATOR
      _point_locator = PointLocatorBase::build(NANOFLANN, *this);
#else
      _point_locator = PointLocatorBase::build(TREE_ELEMENTS, *this);
#endif
 
      if (_point_locator_close_to_point_tol > 0.)
        _point_locator->set_close_to_point_tol(_point_locator_close_to_point_tol);
    }
 
  // Otherwise there was a master point locator, and we can grab a
  // sub-locator easily.
  return
#ifdef LIBMESH_ENABLE_NANOFLANN_POINTLOCATOR
    PointLocatorBase::build(NANOFLANN, *this, _point_locator.get());
#else
    PointLocatorBase::build(TREE_ELEMENTS, *this, _point_locator.get());
#endif
}

References libMesh::MeshBase::_point_locator, libMesh::MeshBase::_point_locator_close_to_point_tol, libMesh::PointLocatorBase::build(), libMesh::Threads::in_threads, libMesh::libmesh_assert(), libMesh::NANOFLANN, and libMesh::TREE_ELEMENTS.

Referenced by WriteElemsetData::checkElemsetCodes(), libMesh::DofMap::create_dof_constraints(), libMesh::UnstructuredMesh::find_neighbors(), libMesh::MeshFunction::init(), libMesh::MeshTools::libmesh_assert_consistent_distributed_nodes(), main(), libMesh::DefaultCoupling::mesh_reinit(), libMesh::OverlapCoupling::mesh_reinit(), libMesh::PointNeighborCoupling::mesh_reinit(), MeshPerElemTest< elem_type >::meshes_equal_enough(), OverlappingCouplingFunctor::operator()(), MeshFunctionTest::test_bad_gradient_var_with_out_of_mesh_value(), MeshFunctionTest::test_bad_hessian_var_with_out_of_mesh_value(), PointLocatorTest::testLocator(), MeshInputTest::testMasterCenters(), PointLocatorTest::testPlanar(), SystemsTest::testProjectCube(), SystemsTest::testProjectLine(), and SystemsTest::testProjectSquare().

◆ subclass_locally_equals()

bool libMesh::DistributedMesh::subclass_locally_equals ( const MeshBase & other_mesh ) const

overridevirtualinherited

Shim to allow operator == (&) to behave like a virtual function without having to be one.

Implements libMesh::MeshBase.

Definition at line 98 of file distributed_mesh.C.

{
  const DistributedMesh * dist_mesh_ptr =
    dynamic_cast<const DistributedMesh *>(&other_mesh_base);
  if (!dist_mesh_ptr)
    return false;
  const DistributedMesh & other_mesh = *dist_mesh_ptr;
 
  if (_is_serial != other_mesh._is_serial ||
      _is_serial_on_proc_0 != other_mesh._is_serial_on_proc_0 ||
      _deleted_coarse_elements != other_mesh._deleted_coarse_elements ||
      _n_nodes != other_mesh._n_nodes ||
      _n_elem != other_mesh._n_elem ||
      _max_node_id != other_mesh._max_node_id ||
      _max_elem_id != other_mesh._max_elem_id ||
      // We expect these things to change in a prepare_for_use();
      // they're conceptually "mutable"...
/*
      _next_free_local_node_id != other_mesh._next_free_local_node_id ||
      _next_free_local_elem_id != other_mesh._next_free_local_elem_id ||
      _next_free_unpartitioned_node_id != other_mesh._next_free_unpartitioned_node_id ||
      _next_free_unpartitioned_elem_id != other_mesh._next_free_unpartitioned_elem_id ||
#ifdef LIBMESH_ENABLE_UNIQUE_ID
      _next_unpartitioned_unique_id != other_mesh._next_unpartitioned_unique_id ||
#endif
*/
      !this->nodes_and_elements_equal(other_mesh))
    return false;
 
  if (_extra_ghost_elems.size() !=
      other_mesh._extra_ghost_elems.size())
    return false;
  for (auto & elem : _extra_ghost_elems)
    {
      libmesh_assert(this->query_elem_ptr(elem->id()) == elem);
      const Elem * other_elem = other_mesh.query_elem_ptr(elem->id());
      if (!other_elem ||
          !other_mesh._extra_ghost_elems.count(const_cast<Elem *>(other_elem)))
        return false;
    }
 
  return true;
}

References libMesh::DistributedMesh::_deleted_coarse_elements, libMesh::DistributedMesh::_extra_ghost_elems, libMesh::DistributedMesh::_is_serial, libMesh::DistributedMesh::_is_serial_on_proc_0, libMesh::DistributedMesh::_max_elem_id, libMesh::DistributedMesh::_max_node_id, libMesh::DistributedMesh::_n_elem, libMesh::DistributedMesh::_n_nodes, libMesh::libmesh_assert(), and libMesh::DistributedMesh::query_elem_ptr().

◆ subdomain_ids()

void libMesh::MeshBase::subdomain_ids	(	std::set< subdomain_id_type > &	ids,
		const bool	global = `true`
	)		const

inherited

Constructs a list of all subdomain identifiers in the local mesh if global == false, and in the global mesh if global == true (default).

Subdomains correspond to separate subsets of the mesh which could correspond e.g. to different materials in a solid mechanics application, or regions where different physical processes are important. The subdomain mapping is independent from the parallel decomposition.

Unpartitioned elements are included in the set in the case that global == true. If global == false, the unpartitioned elements are not included because unpartitioned elements do not have a sense of locality.

Definition at line 1127 of file mesh_base.C.

{
  // This requires an inspection on every processor
  if (global)
    parallel_object_only();
 
  struct SBDInserter {
    std::set<subdomain_id_type> my_ids;
 
    SBDInserter () {}
    SBDInserter (SBDInserter &, Threads::split) {}
 
    void operator()(const ConstElemRange & range) {
      for (const Elem * elem : range)
        my_ids.insert(elem->subdomain_id());
    }
 
    void join(SBDInserter & other) {
      my_ids.merge(other.my_ids);
    }
  };
 
  SBDInserter inserter;
  Threads::parallel_reduce(this->active_local_element_stored_range(), inserter);
 
  ids.swap(inserter.my_ids);
 
  if (global)
    {
      // Only include the unpartitioned elements if the user requests the global IDs.
      // In the case of the local subdomain IDs, it doesn't make sense to include the
      // unpartitioned elements because said elements do not have a sense of locality.
      for (const auto & elem : this->active_unpartitioned_element_ptr_range())
        ids.insert(elem->subdomain_id());
 
      // Some subdomains may only live on other processors
      this->comm().set_union(ids);
    }
}

References libMesh::MeshBase::active_local_element_stored_range(), libMesh::ParallelObject::comm(), libMesh::Threads::parallel_reduce(), and libMesh::Parallel::Communicator::set_union().

Referenced by libMesh::MeshBase::copy_constraint_rows(), libMesh::ReplicatedMesh::get_disconnected_subdomains(), libMesh::MeshBase::n_local_subdomains(), libMesh::MeshBase::n_subdomains(), OverlappingCouplingFunctor::OverlappingCouplingFunctor(), libMesh::TecplotIO::TecplotIO(), MeshSubdomainIDTest::testMultiple(), and MeshSubdomainIDTest::testUnpartitioned().

◆ subdomain_name() [1/2]

std::string & libMesh::MeshBase::subdomain_name ( subdomain_id_type id )

inherited

Deprecated:

Returns: A writable reference for setting an optional name for a subdomain. This method is deprecated; use set_subdomain_name() instead.

Definition at line 1902 of file mesh_base.C.

{
  // Use set_subdomain_name() instead
  libmesh_deprecated();
 
  // We'd like to do this so our preparation isn't invalidated by a
  // write, but for all we know the user is just reading from a
  // non-const mesh!
  // this->unset_has_synched_subdomain_name_map();
 
  return _block_id_to_name[id];
}

References libMesh::MeshBase::_block_id_to_name.

Referenced by DMlibMeshSetSystem_libMesh(), MeshInputTest::testGmshBCIDOverlap(), libMesh::TecplotIO::write_binary(), and libMesh::ExodusII_IO_Helper::write_elements().

◆ subdomain_name() [2/2]

const std::string & libMesh::MeshBase::subdomain_name ( subdomain_id_type id ) const

inherited

Returns: A reference for getting an optional name for a subdomain.

Definition at line 1917 of file mesh_base.C.

{
  // An empty string to return when no matching subdomain name is found
  static const std::string empty;
 
  if (const auto iter = _block_id_to_name.find(id);
      iter == _block_id_to_name.end())
    return empty;
  else
    return iter->second;
}

References libMesh::MeshBase::_block_id_to_name.

◆ supported_nodal_order()

Order libMesh::MeshBase::supported_nodal_order ( ) const

inlineinherited

Returns: The smallest supported_nodal_order() of any element present in the mesh, which is thus the maximum supported nodal order on the mesh as a whole.

Definition at line 2666 of file mesh_base.h.

{
  libmesh_assert(_preparation.has_cached_elem_data);
  return _supported_nodal_order;
}

References libMesh::MeshBase::_preparation, libMesh::MeshBase::_supported_nodal_order, libMesh::MeshBase::Preparation::has_cached_elem_data, and libMesh::libmesh_assert().

◆ sync_subdomain_name_map()

void libMesh::MeshBase::sync_subdomain_name_map ( )

inherited

libMesh often expects all processors to know about names of all subdomain ids, but distributed mesh generators may only know about part of a mesh when creating names.

This method can synchronize the subdomain id to name map across processors, assuming no conflicts exist. It is called automatically during complete_preparation() unless the map is already known to be synchronized.

Definition at line 2081 of file mesh_base.C.

{
  // This requires every processor
  parallel_object_only();
 
  this->comm().set_union(_block_id_to_name);
 
  _preparation.has_synched_subdomain_name_map = true;
}

References libMesh::MeshBase::_block_id_to_name, libMesh::MeshBase::_preparation, libMesh::ParallelObject::comm(), libMesh::MeshBase::Preparation::has_synched_subdomain_name_map, and libMesh::Parallel::Communicator::set_union().

Referenced by libMesh::MeshBase::complete_preparation().

◆ unset_has_boundary_id_sets()

void libMesh::MeshBase::unset_has_boundary_id_sets ( )

inlineinherited

Tells this we have done some operation which may have invalidated our cached boundary id sets.

User code which removes elements, or which adds or removes boundary entries, should call this method.

Definition at line 340 of file mesh_base.h.

341 { _preparation.has_boundary_id_sets = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_boundary_id_sets.

Referenced by libMesh::BoundaryInfo::add_elements(), and MeshBaseTest::testMeshBaseVerifyRemovalPreparation().

◆ unset_has_cached_elem_data()

void libMesh::MeshBase::unset_has_cached_elem_data ( )

inlineinherited

Tells this we have done some operation (e.g.

adding elements with a new dimension or subdomain value) which may invalidate cached summaries of element data.

User code which adds new elements to this mesh must call this function.

Definition at line 281 of file mesh_base.h.

282 { _preparation.has_cached_elem_data = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_cached_elem_data.

Referenced by libMesh::BoundaryInfo::add_elements(), libMesh::MeshTools::Modification::change_subdomain_id(), libMesh::MeshTools::Modification::redistribute(), libMesh::MeshTools::Modification::rotate(), libMesh::MeshTools::Modification::scale(), MeshBaseTest::testMeshBaseVerifyHasCachedElemData(), and libMesh::MeshTools::Modification::translate().

◆ unset_has_interior_parent_ptrs()

void libMesh::MeshBase::unset_has_interior_parent_ptrs ( )

inlineinherited

Tells this we have done some operation (e.g.

refining elements with interior parents) which requires interior parent pointers to be found later.

Most user code will not need to call this method; any user code that manipulates interior parents or their boundary elements may be an exception.

Definition at line 293 of file mesh_base.h.

294 { _preparation.has_interior_parent_ptrs = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_interior_parent_ptrs.

◆ unset_has_neighbor_ptrs()

void libMesh::MeshBase::unset_has_neighbor_ptrs ( )

inlineinherited

Tells this we have done some operation (e.g.

adding elements without setting their neighbor pointers, or adding disjoint neighbor boundary pairs) which requires neighbor pointers to be determined later.

User code which adds new elements to this mesh must call this function or manually set neighbor pointer from and to those elements.

Definition at line 270 of file mesh_base.h.

271 { _preparation.has_neighbor_ptrs = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_neighbor_ptrs.

Referenced by libMesh::BoundaryInfo::add_elements(), and MeshBaseTest::testMeshBaseVerifyHasNeighborPtrs().

◆ unset_has_reinit_ghosting_functors()

void libMesh::MeshBase::unset_has_reinit_ghosting_functors ( )

inlineinherited

Tells this we have done some operation (e.g.

adding or removing elements) which may require a reinit() of custom ghosting functors.

User code which adds or removes elements should call this method. User code which moves nodes ... should probably call this method, in case ghosting functors depending on position exist?

Definition at line 330 of file mesh_base.h.

331 { _preparation.has_reinit_ghosting_functors = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_reinit_ghosting_functors.

Referenced by libMesh::BoundaryInfo::add_elements().

◆ unset_has_removed_orphaned_nodes()

void libMesh::MeshBase::unset_has_removed_orphaned_nodes ( )

inlineinherited

Tells this we have done some operation (e.g.

coarsening) which may have left orphaned nodes in need of removal.

Most user code should probably never need to use this; we can set it in MeshRefinement. User code which deletes elements without carefully deleting orphaned nodes should call this manually.

Definition at line 318 of file mesh_base.h.

319 { _preparation.has_removed_orphaned_nodes = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_removed_orphaned_nodes.

Referenced by MeshBaseTest::testMeshBaseVerifyRemovalPreparation().

◆ unset_has_removed_remote_elements()

void libMesh::MeshBase::unset_has_removed_remote_elements ( )

inlineinherited

Tells this we have done some operation (e.g.

repartitioning) which may have left elements as ghosted which on a distributed mesh should be remote.

User code should probably never need to use this; we can set it in Partitioner. Any user code which manually repartitions elements on distributed meshes may need to call this manually, in addition to manually communicating elements with newly-created ghosting requirements.

Definition at line 307 of file mesh_base.h.

308 { _preparation.has_removed_remote_elements = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_removed_remote_elements.

◆ unset_has_synched_id_counts()

void libMesh::MeshBase::unset_has_synched_id_counts ( )

inlineinherited

Tells this we have done some operation (e.g.

adding objects to a distributed mesh on one processor only) which can lose synchronization of id counts.

User code which does distributed additions of nodes or elements must call either this method or update_parallel_id_counts().

Definition at line 257 of file mesh_base.h.

258 { _preparation.has_synched_id_counts = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_synched_id_counts.

Referenced by DistributedMeshTest::testCopyConstructorUnsynchedIdCounts().

◆ unset_has_synched_subdomain_name_map()

void libMesh::MeshBase::unset_has_synched_subdomain_name_map ( )

inlineinherited

Tells this we have done some operation which may have left the subdomain id to name map inconsistent across processors.

User code which adds or changes subdomain names should call this method.

Definition at line 350 of file mesh_base.h.

351 { _preparation.has_synched_subdomain_name_map = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::has_synched_subdomain_name_map.

Referenced by libMesh::MeshBase::set_subdomain_name(), and libMesh::MeshBase::set_subdomain_name_map().

◆ unset_is_partitioned()

void libMesh::MeshBase::unset_is_partitioned ( )

inlineinherited

Tells this we have done some operation creating unpartitioned elements.

User code which adds elements to this mesh must either partition them too or call this method.

Definition at line 246 of file mesh_base.h.

247 { _preparation.is_partitioned = false; }

References libMesh::MeshBase::_preparation, and libMesh::MeshBase::Preparation::is_partitioned.

Referenced by MeshBaseTest::testMeshBaseVerifyRemovalPreparation().

◆ unset_is_prepared()

void libMesh::MeshBase::unset_is_prepared ( )

inherited

Tells this we have done some operation where we should no longer consider ourself prepared.

This is a very coarse setting; it is generally more efficient to mark finer-grained settings instead.

Definition at line 1071 of file mesh_base.C.

{
  _preparation = false;
  this->clear_point_locator();
  this->clear_stored_ranges();
}

References libMesh::MeshBase::_preparation, libMesh::MeshBase::clear_point_locator(), and libMesh::MeshBase::clear_stored_ranges().

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), and MeshTetTest::testTrisToTets().

◆ update_parallel_id_counts()

void libMesh::DistributedMesh::update_parallel_id_counts ( )

overridevirtualinherited

Updates parallel caches so that methods like n_elem() accurately reflect changes on other processors.

Implements libMesh::MeshBase.

Definition at line 331 of file distributed_mesh.C.

{
  // This function must be run on all processors at once
  parallel_object_only();
 
  _n_elem  = this->parallel_n_elem();
  _n_nodes = this->parallel_n_nodes();
  _max_node_id = this->parallel_max_node_id();
  _max_elem_id = this->parallel_max_elem_id();
 
  this->set_next_ids();
 
  // set_next_unique_ids() needs the true parallel max unique id (not just
  // this processor's possibly-stale cached _next_unique_id) since the whole
  // point of this function is to recompute counters that may have drifted
  // out of sync.
#ifdef LIBMESH_ENABLE_UNIQUE_ID
  this->set_next_unique_ids(this->parallel_max_unique_id());
#endif
 
  _n_constraint_rows = this->count_constraint_rows();
 
  this->_preparation.has_synched_id_counts = true;
}

Referenced by libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::redistribute(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::DistributedMesh::update_post_partitioning().

◆ update_post_partitioning()

void libMesh::DistributedMesh::update_post_partitioning ( )

overridevirtualinherited

Recalculate cached data after elements and nodes have been repartitioned.

Reimplemented from libMesh::MeshBase.

Definition at line 1148 of file distributed_mesh.C.

{
  // this->recalculate_n_partitions();
 
  // Let's do the base class cache clearing first, just in case our
  // later computations are ever changed to make use of a local
  // elements range cache
  this->MeshBase::update_post_partitioning();
 
  // Partitioning changes our numbers of unpartitioned objects
  this->update_parallel_id_counts();
}

References libMesh::DistributedMesh::update_parallel_id_counts(), and libMesh::MeshBase::update_post_partitioning().

◆ write() [1/2]

void libMesh::UnstructuredMesh::write ( const std::string & name ) const

overridevirtualinherited

Write the file specified by name.

Attempts to figure out the proper method by the file extension.

Implements libMesh::MeshBase.

Definition at line 1449 of file unstructured_mesh.C.

{
  LOG_SCOPE("write()", "Mesh");
 
  NameBasedIO(*this).write(name);
}

References libMesh::NameBasedIO::write().

Referenced by main().

◆ write() [2/2]

void libMesh::UnstructuredMesh::write	(	const std::string &	name,
		const std::vector< Number > &	values,
		const std::vector< std::string > &	variable_names
	)		const

inherited

Write to the file specified by name.

Attempts to figure out the proper method by the file extension. Also writes data.

Definition at line 1458 of file unstructured_mesh.C.

{
  LOG_SCOPE("write()", "Mesh");
 
  NameBasedIO(*this).write_nodal_data(name, v, vn);
}

References libMesh::NameBasedIO::write_nodal_data().

Member Data Documentation

◆ _all_elemset_ids

MeshBase::elemset_type libMesh::MeshBase::_all_elemset_ids

protectedinherited

Definition at line 2371 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_elemset_code(), libMesh::MeshBase::change_elemset_id(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::n_elemsets(), and libMesh::MeshBase::operator=().

◆ _allow_node_and_elem_unique_id_overlap

bool libMesh::MeshBase::_allow_node_and_elem_unique_id_overlap

protectedinherited

The Exodus reader (and potentially other readers in the future?) now supports setting Node and Elem unique_ids based on values from within the Exodus file itself, rather than generating them automatically in LibMesh.

In this case, the unique_ids will not necessarily be unique across the set of all DofObjects, although they should still be unique within the individual sets of Elems and Nodes. The reader can therefore set this Mesh flag (which defaults to false) to indicate we should be less strict when checking the "uniqueness" of unique_ids.

Definition at line 2313 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_node_and_elem_unique_id_overlap(), libMesh::MeshBase::allow_node_and_elem_unique_id_overlap(), libMesh::MeshBase::locally_equals(), and libMesh::MeshBase::operator=().

◆ _allow_remote_element_removal

bool libMesh::MeshBase::_allow_remote_element_removal

protectedinherited

If this is false then even on DistributedMesh remote elements will not be deleted during mesh preparation.

This is true by default.

Definition at line 2300 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_remote_element_removal(), libMesh::MeshBase::allow_remote_element_removal(), libMesh::MeshBase::complete_preparation(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::prepare_for_use().

◆ _block_id_to_name

std::map<subdomain_id_type, std::string> libMesh::MeshBase::_block_id_to_name

protectedinherited

This structure maintains the mapping of named blocks for file formats that support named blocks.

Currently this is only implemented for ExodusII

Definition at line 2320 of file mesh_base.h.

Referenced by libMesh::MeshBase::get_id_by_name(), libMesh::MeshBase::get_subdomain_name_map(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::MeshBase::set_subdomain_name(), libMesh::MeshBase::set_subdomain_name_map(), libMesh::MeshBase::subdomain_name(), libMesh::MeshBase::subdomain_name(), and libMesh::MeshBase::sync_subdomain_name_map().

◆ _communicator

const Parallel::Communicator& libMesh::ParallelObject::_communicator

protectedinherited

Definition at line 120 of file parallel_object.h.

Referenced by libMesh::EquationSystems::build_parallel_elemental_solution_vector(), libMesh::EquationSystems::build_parallel_solution_vector(), libMesh::StaticCondensation::close(), libMesh::ParallelObject::comm(), libMesh::CondensedEigenSystem::initialize_condensed_matrices(), libMesh::ParallelObject::n_processors(), libMesh::ParallelObject::operator=(), libMesh::ParallelObject::processor_id(), libMesh::BoundaryInfo::regenerate_id_sets(), libMesh::StaticCondensationDofMap::reinit(), and libMesh::BoundaryInfo::synchronize_global_id_set().

◆ _const_active_local_element_stored_range

std::unique_ptr<ConstElemRange> libMesh::MeshBase::_const_active_local_element_stored_range

mutableprotectedinherited

A cached ConstElemRange for threaded calculation on all local elements of this mesh.

This will not actually be built unless needed. Further, since we want our elem_stored_range() method to be const (yet do the dynamic allocating) this needs to be mutable.

Definition at line 2228 of file mesh_base.h.

Referenced by libMesh::MeshBase::active_local_element_stored_range(), libMesh::MeshBase::clear_stored_ranges(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::update_post_partitioning().

◆ _constraint_rows

constraint_rows_type libMesh::MeshBase::_constraint_rows

protectedinherited

Definition at line 2454 of file mesh_base.h.

◆ _count_lower_dim_elems_in_point_locator

bool libMesh::MeshBase::_count_lower_dim_elems_in_point_locator

protectedinherited

Do we count lower dimensional elements in point locator refinement? This is relevant in tree-based point locators, for example.

Definition at line 2243 of file mesh_base.h.

Referenced by libMesh::MeshBase::get_count_lower_dim_elems_in_point_locator(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::set_count_lower_dim_elems_in_point_locator().

◆ _default_ghosting

std::unique_ptr<GhostingFunctor> libMesh::MeshBase::_default_ghosting

protectedinherited

The default geometric GhostingFunctor, used to implement standard libMesh element ghosting behavior.

We use a base class pointer here to avoid dragging in more header dependencies.

Definition at line 2427 of file mesh_base.h.

Referenced by libMesh::MeshBase::default_ghosting(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::MeshBase(), and libMesh::MeshBase::post_dofobject_moves().

◆ _default_mapping_data

unsigned char libMesh::MeshBase::_default_mapping_data

protectedinherited

The default mapping data (unused with Lagrange, used for nodal weight lookup index with rational bases) to assign to newly added elements.

Definition at line 2202 of file mesh_base.h.

Referenced by libMesh::MeshBase::default_mapping_data(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::set_default_mapping_data().

◆ _default_mapping_type

ElemMappingType libMesh::MeshBase::_default_mapping_type

protectedinherited

The default mapping type (typically Lagrange) between master and physical space to assign to newly added elements.

Definition at line 2195 of file mesh_base.h.

Referenced by libMesh::MeshBase::default_mapping_type(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::set_default_mapping_type().

◆ _deleted_coarse_elements

bool libMesh::DistributedMesh::_deleted_coarse_elements

inherited

A boolean remembering whether we've recently deleted top-level elements or not.

If so, we'll need to be extra careful when deleting "unused" nodes they used to have, because those nodes might still be used by ghost elements.

Definition at line 441 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::delete_elem(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::DistributedMesh::subclass_locally_equals().

◆ _disjoint_neighbor_boundary_pairs

std::unique_ptr<PeriodicBoundaries> libMesh::MeshBase::_disjoint_neighbor_boundary_pairs

protectedinherited

The disjoint neighbor boundary id pairs.

Definition at line 2131 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_disjoint_neighbor_boundary_pairs(), libMesh::MeshBase::get_disjoint_neighbor_boundary_pairs(), libMesh::MeshBase::get_disjoint_neighbor_boundary_pairs(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::remove_disjoint_boundary_pair().

◆ _elem_default_orders

std::set<Order> libMesh::MeshBase::_elem_default_orders

protectedinherited

We cache the (default) order of the geometric elements present in the mesh.

E.g. if we have a mesh with TRI3 and TRI6 elements, this structure will contain FIRST and SECOND.

Definition at line 2334 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_data(), libMesh::MeshBase::clear(), libMesh::MeshBase::copy_cached_data(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::elem_default_orders(), libMesh::MeshBase::get_info(), libMesh::MeshBase::locally_equals(), and libMesh::MeshBase::operator=().

◆ _elem_dims

std::set<unsigned char> libMesh::MeshBase::_elem_dims

protectedinherited

We cache the dimension of the elements present in the mesh.

So, if we have a mesh with 1D and 2D elements, this structure will contain 1 and 2.

Definition at line 2327 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_data(), libMesh::MeshBase::clear(), libMesh::MeshBase::copy_cached_data(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::elem_dimensions(), libMesh::MeshBase::get_info(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::mesh_dimension(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::operator=(), libMesh::MeshBase::set_elem_dimensions(), and libMesh::MeshBase::set_mesh_dimension().

◆ _elem_integer_default_values

std::vector<dof_id_type> libMesh::MeshBase::_elem_integer_default_values

protectedinherited

The array of default initialization values for integer data associated with each element in the mesh.

Definition at line 2389 of file mesh_base.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), libMesh::MeshBase::add_elem_integer(), libMesh::MeshBase::add_elem_integers(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::merge_extra_integer_names(), and libMesh::MeshBase::operator=().

◆ _elem_integer_names

std::vector<std::string> libMesh::MeshBase::_elem_integer_names

protectedinherited

The array of names for integer data associated with each element in the mesh.

Definition at line 2383 of file mesh_base.h.

◆ _element_stored_range

std::unique_ptr<ElemRange> libMesh::MeshBase::_element_stored_range

mutableprotectedinherited

A cached ElemRange for threaded mutation of all semilocal elements of this mesh.

This will not actually be built unless needed. Further, since we want our elem_stored_range() method to be const (yet do the dynamic allocating) this needs to be mutable.

Definition at line 2217 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear_stored_ranges(), libMesh::MeshBase::element_stored_range(), and libMesh::MeshBase::operator=().

◆ _elements

dofobject_container<Elem> libMesh::DistributedMesh::_elements

inherited

The elements in the mesh.

Definition at line 424 of file distributed_mesh.h.

◆ _elemset_codes

std::map<dof_id_type, const MeshBase::elemset_type *> libMesh::MeshBase::_elemset_codes

protectedinherited

Map from "element set code" to list of set ids to which that element belongs (and vice-versa).

Remarks: 1.) The elemset code is a dof_id_type because (if used) it is stored as an extra_integer (named "elemset_code") on all elements, and extra_integers are of type dof_id_type. Elements which do not belong to any set should be assigned an elemset code of DofObject::invalid_id. 2.) Element sets can be thought of as a generalization of the concept of a subdomain. Subdomains have the following restrictions: a.) A given element can only belong to a single subdomain b.) When using Exodus file input/output, subdomains are (unfortunately) tied to the concept of exodus element blocks, which consist of a single geometric element type, somewhat limiting their generality. 3.) The user is responsible for filling in the values of this map in a consistent manner, unless the elemsets are read in from an Exodus file, in which case the elemset codes will be set up automatically. The codes can basically be chosen arbitrarily, with the one requirement that elements which belong to no sets should have a set code of DofObject::invalid_id. 4.) We also keep a list of all the elemset ids which have been added in order to support O(1) performance behavior in n_elemsets() calls.

Definition at line 2369 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_elemset_code(), libMesh::MeshBase::change_elemset_code(), libMesh::MeshBase::change_elemset_id(), libMesh::MeshBase::clear(), libMesh::MeshBase::get_elemset_codes(), libMesh::MeshBase::get_elemsets(), libMesh::MeshBase::get_info(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::MeshBase(), and libMesh::MeshBase::operator=().

◆ _elemset_codes_inverse_map

std::map<MeshBase::elemset_type, dof_id_type> libMesh::MeshBase::_elemset_codes_inverse_map

protectedinherited

Definition at line 2370 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_elemset_code(), libMesh::MeshBase::change_elemset_code(), libMesh::MeshBase::change_elemset_id(), libMesh::MeshBase::clear(), libMesh::MeshBase::get_elemset_code(), libMesh::MeshBase::MeshBase(), and libMesh::MeshBase::operator=().

◆ _extra_ghost_elems

std::set<Elem *> libMesh::DistributedMesh::_extra_ghost_elems

inherited

These are extra ghost elements that we want to make sure not to delete when we call delete_remote_elements()

Definition at line 468 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_extra_ghost_elem(), libMesh::DistributedMesh::clear_extra_ghost_elems(), libMesh::DistributedMesh::clear_extra_ghost_elems(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::extra_ghost_elems(), and libMesh::DistributedMesh::subclass_locally_equals().

◆ _ghosting_functors

std::vector<GhostingFunctor *> libMesh::MeshBase::_ghosting_functors

protectedinherited

The list of all GhostingFunctor objects to be used when distributing a DistributedMesh.

Basically unused by ReplicatedMesh for now, but belongs to MeshBase because the cost is trivial.

Definition at line 2436 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_ghosting_functor(), libMesh::MeshBase::ghosting_functors_begin(), libMesh::MeshBase::ghosting_functors_end(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::post_dofobject_moves(), libMesh::MeshBase::reinit_ghosting_functors(), and libMesh::MeshBase::remove_ghosting_functor().

◆ _interior_mesh

MeshBase* libMesh::MeshBase::_interior_mesh

protectedinherited

Defaulting to this, a pointer to the mesh used to generate boundary elements on this.

Definition at line 2264 of file mesh_base.h.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::interior_mesh(), libMesh::MeshBase::interior_mesh(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::set_interior_mesh().

◆ _is_serial

bool libMesh::DistributedMesh::_is_serial

inherited

A boolean remembering whether we're serialized or not.

Definition at line 429 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::is_serial(), libMesh::DistributedMesh::is_serial_on_zero(), libMesh::DistributedMesh::set_distributed(), and libMesh::DistributedMesh::subclass_locally_equals().

◆ _is_serial_on_proc_0

bool libMesh::DistributedMesh::_is_serial_on_proc_0

inherited

A boolean remembering whether we're serialized to proc 0 or not.

Definition at line 434 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::allgather(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::delete_remote_elements(), libMesh::DistributedMesh::gather_to_zero(), libMesh::DistributedMesh::is_serial_on_zero(), libMesh::DistributedMesh::set_distributed(), and libMesh::DistributedMesh::subclass_locally_equals().

◆ _max_elem_id

dof_id_type libMesh::DistributedMesh::_max_elem_id

inherited

Definition at line 446 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::clear_elems(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::max_elem_id(), libMesh::DistributedMesh::set_next_ids(), libMesh::DistributedMesh::subclass_locally_equals(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ _max_node_id

dof_id_type libMesh::DistributedMesh::_max_node_id

inherited

Definition at line 446 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::max_node_id(), libMesh::DistributedMesh::set_next_ids(), libMesh::DistributedMesh::subclass_locally_equals(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ _mesh_subdomains

std::set<subdomain_id_type> libMesh::MeshBase::_mesh_subdomains

protectedinherited

We cache the subdomain ids of the elements present in the mesh.

Definition at line 2345 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_data(), libMesh::MeshBase::copy_cached_data(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::get_mesh_subdomains(), libMesh::MeshBase::locally_equals(), and libMesh::MeshBase::operator=().

◆ _n_constraint_rows

dof_id_type libMesh::MeshBase::_n_constraint_rows

protectedinherited

Definition at line 2456 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::n_constraint_rows(), libMesh::MeshBase::operator=(), libMesh::MeshBase::post_dofobject_moves(), libMesh::DistributedMesh::update_parallel_id_counts(), and libMesh::ReplicatedMesh::update_parallel_id_counts().

◆ _n_elem

dof_id_type libMesh::DistributedMesh::_n_elem

inherited

Definition at line 446 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::clear_elems(), libMesh::DistributedMesh::delete_elem(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::insert_elem(), libMesh::DistributedMesh::n_elem(), libMesh::DistributedMesh::renumber_nodes_and_elements(), libMesh::DistributedMesh::subclass_locally_equals(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ _n_nodes

dof_id_type libMesh::DistributedMesh::_n_nodes

inherited

Cached data from the last renumber_nodes_and_elements call.

Definition at line 446 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::delete_node(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::n_nodes(), libMesh::DistributedMesh::own_node(), libMesh::DistributedMesh::renumber_nodes_and_elements(), libMesh::DistributedMesh::subclass_locally_equals(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ _n_parts

unsigned int libMesh::MeshBase::_n_parts

protectedinherited

The number of partitions the mesh has.

This is set by the partitioners, and may not be changed directly by the user.

Note: The number of partitions need not equal this->n_processors(), consider for example the case where you simply want to partition a mesh on one processor and view the result in GMV.

Definition at line 2189 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::n_partitions(), libMesh::MeshBase::operator=(), libMesh::MeshBase::recalculate_n_partitions(), and libMesh::MeshBase::set_n_partitions().

◆ _next_free_local_elem_id

dof_id_type libMesh::DistributedMesh::_next_free_local_elem_id

inherited

Definition at line 453 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::clear_elems(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::set_next_ids().

◆ _next_free_local_node_id

dof_id_type libMesh::DistributedMesh::_next_free_local_node_id

inherited

Guaranteed globally unused IDs for use when adding new nodes or elements.

Definition at line 452 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::set_next_ids().

◆ _next_free_unpartitioned_elem_id

dof_id_type libMesh::DistributedMesh::_next_free_unpartitioned_elem_id

inherited

Definition at line 455 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::clear_elems(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::set_next_ids().

◆ _next_free_unpartitioned_node_id

dof_id_type libMesh::DistributedMesh::_next_free_unpartitioned_node_id

inherited

Definition at line 454 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::clear(), libMesh::DistributedMesh::DistributedMesh(), and libMesh::DistributedMesh::set_next_ids().

◆ _next_unique_id

unique_id_type libMesh::MeshBase::_next_unique_id

protectedinherited

The next available unique id for assigning ids to DOF objects.

Definition at line 2257 of file mesh_base.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::ReplicatedMesh::add_elem(), libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_node(), libMesh::ReplicatedMesh::add_point(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::insert_elem(), libMesh::ReplicatedMesh::insert_elem(), libMesh::MeshBase::next_unique_id(), libMesh::MeshBase::operator=(), libMesh::DistributedMesh::parallel_max_unique_id(), libMesh::ReplicatedMesh::parallel_max_unique_id(), libMesh::ReplicatedMesh::ReplicatedMesh(), libMesh::ReplicatedMesh::ReplicatedMesh(), libMesh::DistributedMesh::set_next_unique_id(), libMesh::ReplicatedMesh::set_next_unique_id(), libMesh::DistributedMesh::set_next_unique_ids(), libMesh::ReplicatedMesh::subclass_locally_equals(), and libMesh::ReplicatedMesh::update_parallel_id_counts().

◆ _next_unpartitioned_unique_id

unique_id_type libMesh::DistributedMesh::_next_unpartitioned_unique_id

inherited

The next available unique id for assigning ids to unpartitioned DOF objects.

Definition at line 461 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::add_elem(), libMesh::DistributedMesh::add_node(), libMesh::DistributedMesh::DistributedMesh(), libMesh::DistributedMesh::insert_elem(), libMesh::DistributedMesh::parallel_max_unique_id(), libMesh::DistributedMesh::set_next_unique_id(), and libMesh::DistributedMesh::set_next_unique_ids().

◆ _node_integer_default_values

std::vector<dof_id_type> libMesh::MeshBase::_node_integer_default_values

protectedinherited

The array of default initialization values for integer data associated with each node in the mesh.

Definition at line 2401 of file mesh_base.h.

Referenced by libMesh::DistributedMesh::add_node(), libMesh::ReplicatedMesh::add_node(), libMesh::MeshBase::add_node_integer(), libMesh::MeshBase::add_node_integers(), libMesh::ReplicatedMesh::add_point(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::merge_extra_integer_names(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::size_node_extra_integers().

◆ _node_integer_names

std::vector<std::string> libMesh::MeshBase::_node_integer_names

protectedinherited

The array of names for integer data associated with each node in the mesh.

Definition at line 2395 of file mesh_base.h.

◆ _nodes

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid const DofMap& dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num DECLARE_NODE_ITERATORS (multi_evaluable_, std::vector<const DofMap *> dof_maps, dof_maps) protected dofobject_container<Node> libMesh::DistributedMesh::_nodes

inherited

Move node and elements from a DistributedMesh.

The vertices (spatial coordinates) of the mesh.

Definition at line 419 of file distributed_mesh.h.

◆ _partitioner

std::unique_ptr<Partitioner> libMesh::MeshBase::_partitioner

protectedinherited

A partitioner to use at each prepare_for_use().

This will be built in the constructor of each derived class, but can be replaced by the user through the partitioner() accessor.

Definition at line 2251 of file mesh_base.h.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::partitioner(), libMesh::MeshBase::post_dofobject_moves(), libMesh::ReplicatedMesh::ReplicatedMesh(), and libMesh::MeshBase::skip_noncritical_partitioning().

◆ _point_locator

std::unique_ptr<PointLocatorBase> libMesh::MeshBase::_point_locator

mutableprotectedinherited

A PointLocator class for this mesh.

This will not actually be built unless needed. Further, since we want our point_locator() method to be const (yet do the dynamic allocating) this needs to be mutable. Since the PointLocatorBase::build() member is used, and it operates on a constant reference to the mesh, this is OK.

Definition at line 2237 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::operator=(), libMesh::MeshBase::set_point_locator_close_to_point_tol(), and libMesh::MeshBase::sub_point_locator().

◆ _point_locator_close_to_point_tol

Real libMesh::MeshBase::_point_locator_close_to_point_tol

protectedinherited

If nonzero, we will call PointLocatorBase::set_close_to_point_tol() on any PointLocators that we create.

Definition at line 2467 of file mesh_base.h.

Referenced by libMesh::MeshBase::get_point_locator_close_to_point_tol(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::MeshBase::set_point_locator_close_to_point_tol(), and libMesh::MeshBase::sub_point_locator().

◆ _preparation

Preparation libMesh::MeshBase::_preparation

protectedinherited

Flags indicating in what ways this mesh has been prepared.

Definition at line 2207 of file mesh_base.h.

◆ _shared_functors

std::map<GhostingFunctor *, std::shared_ptr<GhostingFunctor> > libMesh::MeshBase::_shared_functors

protectedinherited

Hang on to references to any GhostingFunctor objects we were passed in shared_ptr form.

Definition at line 2442 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_ghosting_functor(), libMesh::MeshBase::post_dofobject_moves(), and libMesh::MeshBase::remove_ghosting_functor().

◆ _skip_all_partitioning

bool libMesh::MeshBase::_skip_all_partitioning

protectedinherited

If this is true then no partitioning should be done.

Definition at line 2275 of file mesh_base.h.

Referenced by libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::MeshBase::skip_noncritical_partitioning(), libMesh::MeshBase::skip_partitioning(), and libMesh::MeshBase::skip_partitioning().

◆ _skip_detect_interior_parents

bool libMesh::MeshBase::_skip_detect_interior_parents

protectedinherited

If this is true then we will skip detect_interior_parents in prepare_for_use.

Definition at line 2292 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_detect_interior_parents(), libMesh::MeshBase::allow_detect_interior_parents(), libMesh::MeshBase::complete_preparation(), libMesh::MeshBase::locally_equals(), and libMesh::MeshBase::operator=().

◆ _skip_find_neighbors

bool libMesh::MeshBase::_skip_find_neighbors

protectedinherited

If this is true then we will skip find_neighbors in prepare_for_use.

Definition at line 2287 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_find_neighbors(), libMesh::MeshBase::allow_find_neighbors(), libMesh::MeshBase::complete_preparation(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::prepare_for_use().

◆ _skip_noncritical_partitioning

bool libMesh::MeshBase::_skip_noncritical_partitioning

protectedinherited

If this is true then no partitioning should be done with the possible exception of orphaned nodes.

Definition at line 2270 of file mesh_base.h.

Referenced by libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::MeshBase::skip_noncritical_partitioning(), and libMesh::MeshBase::skip_noncritical_partitioning().

◆ _skip_renumber_nodes_and_elements

bool libMesh::MeshBase::_skip_renumber_nodes_and_elements

protectedinherited

If this is true then renumbering will be kept to a minimum.

This is set when prepare_for_use() is called.

Definition at line 2282 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_renumbering(), libMesh::MeshBase::allow_renumbering(), libMesh::MeshBase::complete_preparation(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::ReplicatedMesh::renumber_nodes_and_elements().

◆ _spatial_dimension

unsigned char libMesh::MeshBase::_spatial_dimension

protectedinherited

The "spatial dimension" of the Mesh.

See the documentation for Mesh::spatial_dimension() for more information.

Definition at line 2377 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_data(), libMesh::MeshBase::copy_cached_data(), libMesh::MeshBase::get_info(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), libMesh::MeshBase::set_spatial_dimension(), and libMesh::MeshBase::spatial_dimension().

◆ _supported_nodal_order

Order libMesh::MeshBase::_supported_nodal_order

protectedinherited

We cache the maximum nodal order supported by all the mesh's elements (the minimum supported_nodal_order() of any element)

Definition at line 2340 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_data(), libMesh::MeshBase::clear(), libMesh::MeshBase::copy_cached_data(), libMesh::MeshBase::copy_constraint_rows(), libMesh::MeshBase::get_info(), libMesh::MeshBase::locally_equals(), libMesh::MeshBase::operator=(), and libMesh::MeshBase::supported_nodal_order().

◆ boundary_info

std::unique_ptr<BoundaryInfo> libMesh::MeshBase::boundary_info

protectedinherited

This class holds the boundary information.

It can store nodes, edges, and faces with a corresponding id that facilitates setting boundary conditions.

Direct access to this class is now officially deprecated and will be removed in future libMesh versions. Use the get_boundary_info() accessor instead.

Definition at line 2143 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear(), libMesh::MeshBase::get_boundary_info(), libMesh::MeshBase::get_boundary_info(), libMesh::MeshBase::locally_equals(), and libMesh::MeshBase::operator=().

◆ ElemRange

const DofMap& dof_map LIBMESH_COMMA unsigned int Elem* libMesh::MeshBase::ElemRange

inherited

Definition at line 1898 of file mesh_base.h.

◆ level [1/2]

unsigned int libMesh::DistributedMesh::level

inherited

Definition at line 352 of file distributed_mesh.h.

◆ level [2/2]

processor_id_type pid unsigned int libMesh::DistributedMesh::level

inherited

Definition at line 379 of file distributed_mesh.h.

◆ pid [1/2]

processor_id_type libMesh::DistributedMesh::pid

inherited

Definition at line 377 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::renumber_dof_objects(), and libMesh::DistributedMesh::renumber_nodes_and_elements().

◆ pid [2/2]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type libMesh::DistributedMesh::pid

inherited

Definition at line 401 of file distributed_mesh.h.

◆ rflag

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char libMesh::DistributedMesh::rflag

inherited

Definition at line 391 of file distributed_mesh.h.

◆ ss [1/2]

unsigned int level ElemType type std::set<subdomain_id_type> libMesh::DistributedMesh::ss

inherited

Definition at line 357 of file distributed_mesh.h.

Referenced by libMesh::DistributedMesh::active_subdomain_set_elements_ptr_range(), and libMesh::DistributedMesh::active_subdomain_set_elements_ptr_range().

◆ ss [2/2]

processor_id_type pid unsigned int level std::set<subdomain_id_type> libMesh::DistributedMesh::ss

inherited

Definition at line 381 of file distributed_mesh.h.

◆ type

unsigned int level ElemType libMesh::DistributedMesh::type

inherited

Definition at line 354 of file distributed_mesh.h.

◆ var_num [1/2]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap& dof_map LIBMESH_COMMA unsigned int libMesh::DistributedMesh::var_num = libMesh::invalid_uint

inherited

Definition at line 387 of file distributed_mesh.h.

◆ var_num [2/2]

processor_id_type pid unsigned int level std::set< subdomain_id_type > ss const DofMap &dof_map LIBMESH_COMMA unsigned int dof_map LIBMESH_COMMA var_num unsigned char rflag processor_id_type pid const DofMap& dof_map LIBMESH_COMMA unsigned int libMesh::DistributedMesh::var_num = libMesh::invalid_uint

inherited

Definition at line 404 of file distributed_mesh.h.

The documentation for this class was generated from the following file:

include/mesh/parallel_mesh.h

Public Types

Public Member Functions

Public Attributes

Protected Types

Protected Member Functions

Protected Attributes

Private Types

Private Member Functions

Detailed Description

Member Typedef Documentation

◆ const_elem_filter_iter [1/2]

◆ const_elem_filter_iter [2/2]

◆ const_elem_iterator_imp

◆ const_node_filter_iter [1/2]

◆ const_node_filter_iter [2/2]

◆ const_node_iterator_imp

◆ ConstElemRange

◆ constraint_rows_mapped_type

◆ constraint_rows_type

◆ dofobject_container [1/2]

◆ dofobject_container [2/2]

◆ elem_filter_iter [1/2]

◆ elem_filter_iter [2/2]

◆ elem_iterator_imp

◆ elemset_type

◆ GhostingFunctorIterator

◆ node_filter_iter [1/2]

◆ node_filter_iter [2/2]

◆ node_iterator_imp

◆ Predicate

Constructor & Destructor Documentation

◆ ParallelMesh() [1/2]

◆ ParallelMesh() [2/2]

◆ ~ParallelMesh()

Member Function Documentation

◆ ABSTRACT_ELEM_ITERATORS() [1/15]

◆ ABSTRACT_ELEM_ITERATORS() [2/15]

◆ ABSTRACT_ELEM_ITERATORS() [3/15]

◆ ABSTRACT_ELEM_ITERATORS() [4/15]

◆ ABSTRACT_ELEM_ITERATORS() [5/15]

◆ ABSTRACT_ELEM_ITERATORS() [6/15]

◆ ABSTRACT_ELEM_ITERATORS() [7/15]

◆ ABSTRACT_ELEM_ITERATORS() [8/15]

◆ ABSTRACT_ELEM_ITERATORS() [9/15]

◆ ABSTRACT_ELEM_ITERATORS() [10/15]

◆ ABSTRACT_ELEM_ITERATORS() [11/15]

◆ ABSTRACT_ELEM_ITERATORS() [12/15]

◆ ABSTRACT_ELEM_ITERATORS() [13/15]

◆ ABSTRACT_ELEM_ITERATORS() [14/15]

◆ ABSTRACT_ELEM_ITERATORS() [15/15]

◆ active_local_element_stored_range()

◆ active_local_subdomain_elements_ptr_range() [1/2]

◆ active_local_subdomain_elements_ptr_range() [2/2]

◆ active_subdomain_elements_ptr_range() [1/2]

◆ active_subdomain_elements_ptr_range() [2/2]

◆ active_subdomain_set_elements_ptr_range() [1/2]

◆ active_subdomain_set_elements_ptr_range() [2/2]

◆ add_disjoint_neighbor_boundary_pairs()

◆ add_elem() [1/2]

◆ add_elem() [2/2]

◆ add_elem_data()

◆ add_elem_datum()

◆ add_elem_integer()

◆ add_elem_integers()

◆ add_elemset_code()

◆ add_extra_ghost_elem()

◆ add_ghosting_functor() [1/2]

◆ add_ghosting_functor() [2/2]

◆ add_node() [1/2]

◆ add_node() [2/2]

◆ add_node_data()

◆ add_node_datum()

◆ add_node_integer()

◆ add_node_integers()

◆ add_point()

◆ all_complete_order()

◆ all_complete_order_range()

◆ all_first_order()

◆ all_second_order()

◆ all_second_order_range()