Mesh data structure replicated on all processors. More...

#include <replicated_mesh.h>

Inheritance diagram for libMesh::ReplicatedMesh:

[legend]

Public Types
typedef Predicates::multi_predicate	Predicate

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

	ReplicatedMesh (const UnstructuredMesh &other_mesh)

	ReplicatedMesh (const ReplicatedMesh &other_mesh)

	ReplicatedMesh (ReplicatedMesh &&)=default

ReplicatedMesh &	operator= (const ReplicatedMesh &)=delete

ReplicatedMesh &	operator= (ReplicatedMesh &&)=delete

virtual std::unique_ptr< MeshBase >	clone () const override

virtual	~ReplicatedMesh ()

virtual void	clear () override

virtual void	renumber_nodes_and_elements () override

virtual dof_id_type	n_nodes () const override

virtual dof_id_type	parallel_n_nodes () const override

virtual dof_id_type	max_node_id () const override

virtual void	reserve_nodes (const dof_id_type nn) override

virtual dof_id_type	n_elem () const override

virtual dof_id_type	parallel_n_elem () const override

virtual dof_id_type	n_active_elem () const override

virtual dof_id_type	max_elem_id () const override

virtual unique_id_type	parallel_max_unique_id () const override

virtual void	reserve_elem (const dof_id_type ne) override

virtual void	update_parallel_id_counts () override

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

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

virtual Node *	node_ptr (const dof_id_type i) override

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

virtual Node *	query_node_ptr (const dof_id_type i) override

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

virtual Elem *	elem_ptr (const dof_id_type i) override

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

virtual Elem *	query_elem_ptr (const dof_id_type i) override

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

virtual Node *	add_node (Node *n) override

virtual Node *	insert_node (Node *n) override

virtual void	delete_node (Node *n) override

virtual void	renumber_node (dof_id_type old_id, dof_id_type new_id) override

virtual Elem *	add_elem (Elem *e) override

virtual Elem *	insert_elem (Elem *e) override

virtual void	delete_elem (Elem *e) override

virtual void	renumber_elem (dof_id_type old_id, dof_id_type new_id) override

virtual void	fix_broken_node_and_element_numbering () override

void	stitch_meshes (const ReplicatedMesh &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)

void	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)

virtual element_iterator	elements_begin () override

virtual element_iterator	elements_end () override

virtual const_element_iterator	elements_begin () const override

virtual const_element_iterator	elements_end () const override

virtual SimpleRange< element_iterator >	element_ptr_range () override

virtual SimpleRange< const_element_iterator >	element_ptr_range () const override

virtual element_iterator	active_elements_begin () override

virtual element_iterator	active_elements_end () override

virtual const_element_iterator	active_elements_begin () const override

virtual const_element_iterator	active_elements_end () const override

virtual SimpleRange< element_iterator >	active_element_ptr_range () override

virtual SimpleRange< const_element_iterator >	active_element_ptr_range () const override

virtual element_iterator	ancestor_elements_begin () override

virtual element_iterator	ancestor_elements_end () override

virtual const_element_iterator	ancestor_elements_begin () const override

virtual const_element_iterator	ancestor_elements_end () const override

virtual element_iterator	subactive_elements_begin () override

virtual element_iterator	subactive_elements_end () override

virtual const_element_iterator	subactive_elements_begin () const override

virtual const_element_iterator	subactive_elements_end () const override

virtual element_iterator	not_active_elements_begin () override

virtual element_iterator	not_active_elements_end () override

virtual const_element_iterator	not_active_elements_begin () const override

virtual const_element_iterator	not_active_elements_end () const override

virtual element_iterator	not_ancestor_elements_begin () override

virtual element_iterator	not_ancestor_elements_end () override

virtual const_element_iterator	not_ancestor_elements_begin () const override

virtual const_element_iterator	not_ancestor_elements_end () const override

virtual element_iterator	not_subactive_elements_begin () override

virtual element_iterator	not_subactive_elements_end () override

virtual const_element_iterator	not_subactive_elements_begin () const override

virtual const_element_iterator	not_subactive_elements_end () const override

virtual element_iterator	local_elements_begin () override

virtual element_iterator	local_elements_end () override

virtual const_element_iterator	local_elements_begin () const override

virtual const_element_iterator	local_elements_end () const override

virtual element_iterator	semilocal_elements_begin () override

virtual element_iterator	semilocal_elements_end () override

virtual const_element_iterator	semilocal_elements_begin () const override

virtual const_element_iterator	semilocal_elements_end () const override

virtual element_iterator	active_semilocal_elements_begin () override

virtual element_iterator	active_semilocal_elements_end () override

virtual const_element_iterator	active_semilocal_elements_begin () const override

virtual const_element_iterator	active_semilocal_elements_end () const override

virtual element_iterator	facelocal_elements_begin () override

virtual element_iterator	facelocal_elements_end () override

virtual const_element_iterator	facelocal_elements_begin () const override

virtual const_element_iterator	facelocal_elements_end () const override

virtual element_iterator	not_local_elements_begin () override

virtual element_iterator	not_local_elements_end () override

virtual const_element_iterator	not_local_elements_begin () const override

virtual const_element_iterator	not_local_elements_end () const override

virtual element_iterator	active_local_elements_begin () override

virtual element_iterator	active_local_elements_end () override

virtual const_element_iterator	active_local_elements_begin () const override

virtual const_element_iterator	active_local_elements_end () const override

virtual SimpleRange< element_iterator >	active_local_element_ptr_range () override

virtual SimpleRange< const_element_iterator >	active_local_element_ptr_range () const override

virtual element_iterator	active_not_local_elements_begin () override

virtual element_iterator	active_not_local_elements_end () override

virtual const_element_iterator	active_not_local_elements_begin () const override

virtual const_element_iterator	active_not_local_elements_end () const override

virtual element_iterator	level_elements_begin (unsigned int level) override

virtual element_iterator	level_elements_end (unsigned int level) override

virtual const_element_iterator	level_elements_begin (unsigned int level) const override

virtual const_element_iterator	level_elements_end (unsigned int level) const override

virtual element_iterator	not_level_elements_begin (unsigned int level) override

virtual element_iterator	not_level_elements_end (unsigned int level) override

virtual const_element_iterator	not_level_elements_begin (unsigned int level) const override

virtual const_element_iterator	not_level_elements_end (unsigned int level) const override

virtual element_iterator	local_level_elements_begin (unsigned int level) override

virtual element_iterator	local_level_elements_end (unsigned int level) override

virtual const_element_iterator	local_level_elements_begin (unsigned int level) const override

virtual const_element_iterator	local_level_elements_end (unsigned int level) const override

virtual element_iterator	local_not_level_elements_begin (unsigned int level) override

virtual element_iterator	local_not_level_elements_end (unsigned int level) override

virtual const_element_iterator	local_not_level_elements_begin (unsigned int level) const override

virtual const_element_iterator	local_not_level_elements_end (unsigned int level) const override

virtual element_iterator	pid_elements_begin (processor_id_type proc_id) override

virtual element_iterator	pid_elements_end (processor_id_type proc_id) override

virtual const_element_iterator	pid_elements_begin (processor_id_type proc_id) const override

virtual const_element_iterator	pid_elements_end (processor_id_type proc_id) const override

virtual element_iterator	type_elements_begin (ElemType type) override

virtual element_iterator	type_elements_end (ElemType type) override

virtual const_element_iterator	type_elements_begin (ElemType type) const override

virtual const_element_iterator	type_elements_end (ElemType type) const override

virtual element_iterator	active_type_elements_begin (ElemType type) override

virtual element_iterator	active_type_elements_end (ElemType type) override

virtual const_element_iterator	active_type_elements_begin (ElemType type) const override

virtual const_element_iterator	active_type_elements_end (ElemType type) const override

virtual element_iterator	active_pid_elements_begin (processor_id_type proc_id) override

virtual element_iterator	active_pid_elements_end (processor_id_type proc_id) override

virtual const_element_iterator	active_pid_elements_begin (processor_id_type proc_id) const override

virtual const_element_iterator	active_pid_elements_end (processor_id_type proc_id) const override

virtual element_iterator	unpartitioned_elements_begin () override

virtual element_iterator	unpartitioned_elements_end () override

virtual const_element_iterator	unpartitioned_elements_begin () const override

virtual const_element_iterator	unpartitioned_elements_end () const override

virtual element_iterator	active_unpartitioned_elements_begin () override

virtual element_iterator	active_unpartitioned_elements_end () override

virtual const_element_iterator	active_unpartitioned_elements_begin () const override

virtual const_element_iterator	active_unpartitioned_elements_end () const override

virtual element_iterator	active_local_subdomain_elements_begin (subdomain_id_type subdomain_id) override

virtual element_iterator	active_local_subdomain_elements_end (subdomain_id_type subdomain_id) override

virtual const_element_iterator	active_local_subdomain_elements_begin (subdomain_id_type subdomain_id) const override

virtual const_element_iterator	active_local_subdomain_elements_end (subdomain_id_type subdomain_id) const override

virtual element_iterator	active_subdomain_elements_begin (subdomain_id_type subdomain_id) override

virtual element_iterator	active_subdomain_elements_end (subdomain_id_type subdomain_id) override

virtual const_element_iterator	active_subdomain_elements_begin (subdomain_id_type subdomain_id) const override

virtual const_element_iterator	active_subdomain_elements_end (subdomain_id_type subdomain_id) const override

virtual element_iterator	active_subdomain_set_elements_begin (std::set< subdomain_id_type > ss) override

virtual element_iterator	active_subdomain_set_elements_end (std::set< subdomain_id_type > ss) override

virtual const_element_iterator	active_subdomain_set_elements_begin (std::set< subdomain_id_type > ss) const override

virtual const_element_iterator	active_subdomain_set_elements_end (std::set< subdomain_id_type > ss) const override

virtual element_iterator	ghost_elements_begin () override

virtual element_iterator	ghost_elements_end () override

virtual const_element_iterator	ghost_elements_begin () const override

virtual const_element_iterator	ghost_elements_end () const override

virtual element_iterator	evaluable_elements_begin (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) override

virtual element_iterator	evaluable_elements_end (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) override

virtual const_element_iterator	evaluable_elements_begin (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) const override

virtual const_element_iterator	evaluable_elements_end (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) const override

virtual element_iterator	flagged_elements_begin (unsigned char rflag) override

virtual element_iterator	flagged_elements_end (unsigned char rflag) override

virtual const_element_iterator	flagged_elements_begin (unsigned char rflag) const override

virtual const_element_iterator	flagged_elements_end (unsigned char rflag) const override

virtual element_iterator	flagged_pid_elements_begin (unsigned char rflag, processor_id_type pid) override

virtual element_iterator	flagged_pid_elements_end (unsigned char rflag, processor_id_type pid) override

virtual const_element_iterator	flagged_pid_elements_begin (unsigned char rflag, processor_id_type pid) const override

virtual const_element_iterator	flagged_pid_elements_end (unsigned char rflag, processor_id_type pid) const override

virtual node_iterator	nodes_begin () override

virtual node_iterator	nodes_end () override

virtual const_node_iterator	nodes_begin () const override

virtual const_node_iterator	nodes_end () const override

virtual SimpleRange< node_iterator >	node_ptr_range () override

virtual SimpleRange< const_node_iterator >	node_ptr_range () const override

virtual node_iterator	active_nodes_begin () override

virtual node_iterator	active_nodes_end () override

virtual const_node_iterator	active_nodes_begin () const override

virtual const_node_iterator	active_nodes_end () const override

virtual node_iterator	local_nodes_begin () override

virtual node_iterator	local_nodes_end () override

virtual const_node_iterator	local_nodes_begin () const override

virtual const_node_iterator	local_nodes_end () const override

virtual SimpleRange< node_iterator >	local_node_ptr_range () override

virtual SimpleRange< const_node_iterator >	local_node_ptr_range () const override

virtual node_iterator	pid_nodes_begin (processor_id_type proc_id) override

virtual node_iterator	pid_nodes_end (processor_id_type proc_id) override

virtual const_node_iterator	pid_nodes_begin (processor_id_type proc_id) const override

virtual const_node_iterator	pid_nodes_end (processor_id_type proc_id) const override

virtual node_iterator	bid_nodes_begin (boundary_id_type bndry_id) override

virtual node_iterator	bid_nodes_end (boundary_id_type bndry_id) override

virtual const_node_iterator	bid_nodes_begin (boundary_id_type bndry_id) const override

virtual const_node_iterator	bid_nodes_end (boundary_id_type bndry_id) const override

virtual node_iterator	bnd_nodes_begin () override

virtual node_iterator	bnd_nodes_end () override

virtual const_node_iterator	bnd_nodes_begin () const override

virtual const_node_iterator	bnd_nodes_end () const override

virtual node_iterator	evaluable_nodes_begin (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) override

virtual node_iterator	evaluable_nodes_end (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) override

virtual const_node_iterator	evaluable_nodes_begin (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) const override

virtual const_node_iterator	evaluable_nodes_end (const DofMap &dof_map, unsigned int var_num=libMesh::invalid_uint) const override

virtual void	read (const std::string &name, void *mesh_data=nullptr, bool skip_renumber_nodes_and_elements=false, bool skip_find_neighbors=false) override

virtual void	write (const std::string &name) override

void	write (const std::string &name, const std::vector< Number > &values, const std::vector< std::string > &variable_names)

virtual void	all_first_order () override

virtual void	all_second_order (const bool full_ordered=true) override

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

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

virtual void	copy_nodes_and_elements (const UnstructuredMesh &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)

virtual void	find_neighbors (const bool reset_remote_elements=false, const bool reset_current_list=true) override

virtual bool	contract () override

virtual std::unique_ptr< Partitioner > &	partitioner ()

const BoundaryInfo &	get_boundary_info () const

BoundaryInfo &	get_boundary_info ()

bool	is_prepared () const

virtual bool	is_serial () const

virtual bool	is_serial_on_zero () const

virtual void	set_distributed ()

virtual bool	is_replicated () const

virtual void	allgather ()

virtual void	gather_to_zero ()

virtual void	delete_remote_elements ()

unsigned int	mesh_dimension () const

void	set_mesh_dimension (unsigned char d)

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

unsigned int	spatial_dimension () const

void	set_spatial_dimension (unsigned char d)

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 ()

void	set_next_unique_id (unique_id_type id)

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

virtual const Node &	node_ref (const dof_id_type i) const

virtual Node &	node_ref (const dof_id_type i)

virtual const Node &	node (const dof_id_type i) const

virtual Node &	node (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)

virtual const Elem *	elem (const dof_id_type i) const

virtual Elem *	elem (const dof_id_type i)

virtual const Elem *	query_elem (const dof_id_type i) const

virtual Elem *	query_elem (const dof_id_type i)

virtual void	own_node (Node &)

void	prepare_for_use (const bool skip_renumber_nodes_and_elements=false, const bool skip_find_neighbors=false)

virtual void	partition (const unsigned int n_parts)

void	partition ()

virtual void	redistribute ()

virtual void	update_post_partitioning ()

void	allow_renumbering (bool allow)

bool	allow_renumbering () const

void	allow_remote_element_removal (bool allow)

bool	allow_remote_element_removal () const

void	skip_partitioning (bool skip)

bool	skip_partitioning () const

void	add_ghosting_functor (GhostingFunctor &ghosting_functor)

void	remove_ghosting_functor (GhostingFunctor &ghosting_functor)

std::set< GhostingFunctor * >::const_iterator	ghosting_functors_begin () const

std::set< GhostingFunctor * >::const_iterator	ghosting_functors_end () const

GhostingFunctor &	default_ghosting ()

void	subdomain_ids (std::set< subdomain_id_type > &ids) const

subdomain_id_type	n_subdomains () const

unsigned int	n_partitions () const

std::string	get_info () const

void	print_info (std::ostream &os=libMesh::out) const

unsigned int	recalculate_n_partitions ()

const PointLocatorBase &	point_locator () const

std::unique_ptr< PointLocatorBase >	sub_point_locator () const

void	clear_point_locator ()

void	set_count_lower_dim_elems_in_point_locator (bool count_lower_dim_elems)

bool	get_count_lower_dim_elems_in_point_locator () const

virtual void	libmesh_assert_valid_parallel_ids () const

std::string &	subdomain_name (subdomain_id_type id)

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

subdomain_id_type	get_id_by_name (const std::string &name) const

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

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

void	cache_elem_dims ()

void	detect_interior_parents ()

const Parallel::Communicator &	comm () const

processor_id_type	n_processors () const

processor_id_type	processor_id () const

Public Attributes
std::unique_ptr< BoundaryInfo >	boundary_info

Protected Member Functions
unsigned int &	set_n_partitions ()

Protected Attributes
std::vector< Node * >	_nodes

std::vector< Elem * >	_elements

unsigned int	_n_parts

bool	_is_prepared

std::unique_ptr< PointLocatorBase >	_point_locator

bool	_count_lower_dim_elems_in_point_locator

std::unique_ptr< Partitioner >	_partitioner

unique_id_type	_next_unique_id

bool	_skip_partitioning

bool	_skip_renumber_nodes_and_elements

bool	_allow_remote_element_removal

std::map< subdomain_id_type, std::string >	_block_id_to_name

std::set< unsigned char >	_elem_dims

unsigned char	_spatial_dimension

std::unique_ptr< GhostingFunctor >	_default_ghosting

std::set< GhostingFunctor * >	_ghosting_functors

const Parallel::Communicator &	_communicator

Private Types
typedef std::vector< Elem * >::iterator	elem_iterator_imp

typedef std::vector< Elem * >::const_iterator	const_elem_iterator_imp

typedef std::vector< Node * >::iterator	node_iterator_imp

typedef std::vector< Node * >::const_iterator	const_node_iterator_imp

Private Member Functions
void	stitching_helper (const ReplicatedMesh *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)

Detailed Description

Mesh data structure replicated on all processors.

The ReplicatedMesh class is derived from the MeshBase class, and is used to store identical copies of a full mesh data structure on each processor.

Most methods for this class are found in MeshBase, and most implementation details are found in UnstructuredMesh.

Author: Roy Stogner

Date: 2007

Definition at line 46 of file replicated_mesh.h.

Member Typedef Documentation

◆ const_elem_iterator_imp

typedef std::vector<Elem *>::const_iterator libMesh::ReplicatedMesh::const_elem_iterator_imp

private

Definition at line 497 of file replicated_mesh.h.

◆ const_node_iterator_imp

typedef std::vector<Node *>::const_iterator libMesh::ReplicatedMesh::const_node_iterator_imp

private

Definition at line 504 of file replicated_mesh.h.

◆ elem_iterator_imp

typedef std::vector<Elem *>::iterator libMesh::ReplicatedMesh::elem_iterator_imp

private

Typedefs for the container implementation. In this case, it's just a std::vector<Elem *>.

Definition at line 496 of file replicated_mesh.h.

◆ node_iterator_imp

typedef std::vector<Node *>::iterator libMesh::ReplicatedMesh::node_iterator_imp

private

Typedefs for the container implementation. In this case, it's just a std::vector<Node *>.

Definition at line 503 of file replicated_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 931 of file mesh_base.h.

Constructor & Destructor Documentation

◆ ReplicatedMesh() [1/4]

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

explicit

Constructor. Takes dim, the dimension of the mesh. The mesh dimension can be changed (and may automatically be changed by mesh generation/loading) later.

Definition at line 119 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, and libMesh::MeshBase::_partitioner.

                                                  :
   UnstructuredMesh (comm_in,d)
 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   // In serial we just need to reset the next unique id to zero
   // here in the constructor.
   _next_unique_id = 0;
 #endif
   _partitioner = libmesh_make_unique<MetisPartitioner>();
 }

◆ ReplicatedMesh() [2/4]

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

Copy-constructor. This should be able to take a serial or parallel mesh.

Definition at line 153 of file replicated_mesh.C.

References libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::MeshBase::get_boundary_info().

                                                                    :
   UnstructuredMesh (other_mesh)
 {
   this->copy_nodes_and_elements(other_mesh);
   this->get_boundary_info() = other_mesh.get_boundary_info();
 }

◆ ReplicatedMesh() [3/4]

libMesh::ReplicatedMesh::ReplicatedMesh ( const ReplicatedMesh & other_mesh )

Copy-constructor, possibly specialized for a serial mesh.

Definition at line 142 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::MeshBase::get_boundary_info().

                                                                  :
   UnstructuredMesh (other_mesh)
 {
   this->copy_nodes_and_elements(other_mesh);
   this->get_boundary_info() = other_mesh.get_boundary_info();
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   this->_next_unique_id = other_mesh._next_unique_id;
 #endif
 }

◆ ReplicatedMesh() [4/4]

libMesh::ReplicatedMesh::ReplicatedMesh ( ReplicatedMesh && )

default

Move-constructor.

◆ ~ReplicatedMesh()

libMesh::ReplicatedMesh::~ReplicatedMesh ( )

virtual

Destructor.

Definition at line 133 of file replicated_mesh.C.

References clear().

 {
   this->clear();  // Free nodes and elements
 }

Member Function Documentation

◆ active_element_ptr_range() [1/2]

virtual SimpleRange<element_iterator> libMesh::ReplicatedMesh::active_element_ptr_range ( )

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 246 of file replicated_mesh.h.

References active_elements_begin(), and active_elements_end().

246 { return {active_elements_begin(), active_elements_end()}; }

libMesh::ReplicatedMesh::active_elements_end

virtual element_iterator active_elements_end() override

libMesh::ReplicatedMesh::active_elements_begin

virtual element_iterator active_elements_begin() override

◆ active_element_ptr_range() [2/2]

virtual SimpleRange<const_element_iterator> libMesh::ReplicatedMesh::active_element_ptr_range ( ) const

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 247 of file replicated_mesh.h.

References active_elements_begin(), and active_elements_end().

247 { return {active_elements_begin(), active_elements_end()}; }

libMesh::ReplicatedMesh::active_elements_end

virtual element_iterator active_elements_end() override

libMesh::ReplicatedMesh::active_elements_begin

virtual element_iterator active_elements_begin() override

◆ active_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_elements_begin ( )

overridevirtual

Active, local, and negation forms of the element iterators described above. An "active" element is an element without children (i.e. has not been refined). A "local" element is one whose processor_id() matches the current processor.

Implements libMesh::MeshBase.

Referenced by active_element_ptr_range(), n_active_elem(), and stitching_helper().

◆ active_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by active_element_ptr_range(), and n_active_elem().

◆ active_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_element_ptr_range() [1/2]

virtual SimpleRange<element_iterator> libMesh::ReplicatedMesh::active_local_element_ptr_range ( )

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 303 of file replicated_mesh.h.

References active_local_elements_begin(), and active_local_elements_end().

303 { return {active_local_elements_begin(), active_local_elements_end()}; }

libMesh::ReplicatedMesh::active_local_elements_begin

virtual element_iterator active_local_elements_begin() override

libMesh::ReplicatedMesh::active_local_elements_end

virtual element_iterator active_local_elements_end() override

◆ active_local_element_ptr_range() [2/2]

virtual SimpleRange<const_element_iterator> libMesh::ReplicatedMesh::active_local_element_ptr_range ( ) const

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 304 of file replicated_mesh.h.

References active_local_elements_begin(), and active_local_elements_end().

304 { return {active_local_elements_begin(), active_local_elements_end()}; }

libMesh::ReplicatedMesh::active_local_elements_begin

virtual element_iterator active_local_elements_begin() override

libMesh::ReplicatedMesh::active_local_elements_end

virtual element_iterator active_local_elements_end() override

◆ active_local_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_local_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by active_local_element_ptr_range().

◆ active_local_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_local_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_local_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by active_local_element_ptr_range().

◆ active_local_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_local_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_subdomain_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_local_subdomain_elements_begin ( subdomain_id_type subdomain_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_subdomain_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_local_subdomain_elements_begin ( subdomain_id_type subdomain_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_subdomain_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_local_subdomain_elements_end ( subdomain_id_type subdomain_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_local_subdomain_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_local_subdomain_elements_end ( subdomain_id_type subdomain_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::active_nodes_begin ( )

overridevirtual

Iterate over only the active nodes in the Mesh.

Implements libMesh::MeshBase.

◆ active_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::active_nodes_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::active_nodes_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::active_nodes_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_not_local_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_not_local_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_not_local_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_not_local_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_not_local_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_not_local_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_not_local_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_not_local_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_pid_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_pid_elements_begin ( processor_id_type proc_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_pid_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_pid_elements_begin ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_pid_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_pid_elements_end ( processor_id_type proc_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_pid_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_pid_elements_end ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_semilocal_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_semilocal_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_semilocal_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_semilocal_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_semilocal_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_semilocal_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_semilocal_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_semilocal_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_subdomain_elements_begin ( subdomain_id_type subdomain_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_subdomain_elements_begin ( subdomain_id_type subdomain_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_subdomain_elements_end ( subdomain_id_type subdomain_id )

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_subdomain_elements_end ( subdomain_id_type subdomain_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_set_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_subdomain_set_elements_begin ( std::set< subdomain_id_type > ss )

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_set_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_subdomain_set_elements_begin ( std::set< subdomain_id_type > ss ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_set_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_subdomain_set_elements_end ( std::set< subdomain_id_type > ss )

overridevirtual

Implements libMesh::MeshBase.

◆ active_subdomain_set_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_subdomain_set_elements_end ( std::set< subdomain_id_type > ss ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_type_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_type_elements_begin ( ElemType type )

overridevirtual

Implements libMesh::MeshBase.

◆ active_type_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_type_elements_begin ( ElemType type ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_type_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_type_elements_end ( ElemType type )

overridevirtual

Implements libMesh::MeshBase.

◆ active_type_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_type_elements_end ( ElemType type ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_unpartitioned_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_unpartitioned_elements_begin ( )

overridevirtual

Iterate over active unpartitioned elements in the Mesh.

Implements libMesh::MeshBase.

◆ active_unpartitioned_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_unpartitioned_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ active_unpartitioned_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::active_unpartitioned_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ active_unpartitioned_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::active_unpartitioned_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ add_elem()

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

overridevirtual

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::prepare_for_use() after elements are added to and/or deleted from the mesh.

Implements libMesh::MeshBase.

Definition at line 269 of file replicated_mesh.C.

References _elements, libMesh::MeshBase::_next_unique_id, libMesh::DofObject::id(), libMesh::DofObject::set_id(), libMesh::DofObject::set_unique_id(), libMesh::DofObject::valid_id(), and libMesh::DofObject::valid_unique_id().

 {
   libmesh_assert(e);
 
   // We no longer merely append elements with ReplicatedMesh
 
   // If the user requests a valid id that doesn't correspond to an
   // existing element, let's give them that id, resizing the elements
   // container if necessary.
   if (!e->valid_id())
     e->set_id (cast_int<dof_id_type>(_elements.size()));
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   if (!e->valid_unique_id())
     e->set_unique_id() = _next_unique_id++;
 #endif
 
   const dof_id_type id = e->id();
 
   if (id < _elements.size())
     {
       // Overwriting existing elements is still probably a mistake.
       libmesh_assert(!_elements[id]);
     }
   else
     {
       _elements.resize(id+1, nullptr);
     }
 
   _elements[id] = e;
 
   return e;
 }

◆ add_ghosting_functor()

void libMesh::MeshBase::add_ghosting_functor ( 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 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 823 of file mesh_base.h.

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::DofMap::add_algebraic_ghosting_functor(), and libMesh::DofMap::add_coupling_functor().

824 { _ghosting_functors.insert(&ghosting_functor); }

libMesh::MeshBase::_ghosting_functors

std::set< GhostingFunctor * > _ghosting_functors

Definition: mesh_base.h:1475

◆ add_node()

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

overridevirtual

Add Node n to the end of the vertex array.

Implements libMesh::MeshBase.

Definition at line 439 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, _nodes, libMesh::DofObject::id(), libMesh::DofObject::set_id(), libMesh::DofObject::set_unique_id(), libMesh::DofObject::valid_id(), and libMesh::DofObject::valid_unique_id().

 {
   libmesh_assert(n);
   // We only append points with ReplicatedMesh
   libmesh_assert(!n->valid_id() || n->id() == _nodes.size());
 
   n->set_id (cast_int<dof_id_type>(_nodes.size()));
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   if (!n->valid_unique_id())
     n->set_unique_id() = _next_unique_id++;
 #endif
 
   _nodes.push_back(n);
 
   return n;
 }

◆ add_point()

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

overridevirtual

functions for adding /deleting nodes elements.

Implements libMesh::MeshBase.

Definition at line 386 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, _nodes, libMesh::Node::build(), libMesh::DofObject::invalid_id, libMesh::DofObject::processor_id(), libMesh::DofObject::set_unique_id(), and libMesh::DofObject::valid_unique_id().

 {
   //   // We only append points with ReplicatedMesh
   //   libmesh_assert(id == DofObject::invalid_id || id == _nodes.size());
   //   Node *n = Node::build(p, _nodes.size()).release();
   //   n->processor_id() = proc_id;
   //   _nodes.push_back (n);
 
   Node * n = nullptr;
 
   // If the user requests a valid id, either
   // provide the existing node or resize the container
   // to fit the new node.
   if (id != DofObject::invalid_id)
     if (id < _nodes.size())
       n = _nodes[id];
     else
       _nodes.resize(id+1);
   else
     _nodes.push_back (static_cast<Node *>(nullptr));
 
   // if the node already exists, then assign new (x,y,z) values
   if (n)
     *n = p;
   // otherwise build a new node, put it in the right spot, and return
   // a valid pointer.
   else
     {
       n = Node::build(p, (id == DofObject::invalid_id) ?
                       cast_int<dof_id_type>(_nodes.size()-1) : id).release();
       n->processor_id() = proc_id;
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
       if (!n->valid_unique_id())
         n->set_unique_id() = _next_unique_id++;
 #endif
 
       if (id == DofObject::invalid_id)
         _nodes.back() = n;
       else
         _nodes[id] = n;
     }
 
   // better not pass back a nullptr.
   libmesh_assert (n);
 
   return n;
 }

◆ 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 832 of file unstructured_mesh.C.

 {
   /*
    * when the mesh is not prepared,
    * at least renumber the nodes and
    * elements, so that the node ids
    * are correct
    */
   if (!this->_is_prepared)
     this->renumber_nodes_and_elements ();
 
   START_LOG("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.
        */
       Elem * lo_elem = Elem::build
         (Elem::first_order_equivalent_type
          (so_elem->type()), so_elem->parent()).release();
 
       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);
             child->set_parent(lo_elem);
             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, 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; v < so_elem->n_vertices(); 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);
 
       /*
        * 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
       lo_elem->processor_id() = so_elem->processor_id();
       lo_elem->subdomain_id() = so_elem->subdomain_id();
       this->insert_elem(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();
 
   STOP_LOG("all_first_order()", "Mesh");
 
   // 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();
 }

◆ all_second_order()

void libMesh::UnstructuredMesh::all_second_order ( 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.

Loop over the low-ordered elements in the elements vector. First make sure they _are indeed low-order, and then replace them with an equivalent second-order element. Don't forget to delete the low-order element, or else it will leak!

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

Also, prepare_for_use() will reconstruct most of our neighbor links, but if we have any remote_elem links in a distributed mesh, they need to be preserved. We do that in the same loop here.

Implements libMesh::MeshBase.

Definition at line 969 of file unstructured_mesh.C.

 {
   // This function must be run on all processors at once
   parallel_object_only();
 
   /*
    * when the mesh is not prepared,
    * at least renumber the nodes and
    * elements, so that the node ids
    * are correct
    */
   if (!this->_is_prepared)
     this->renumber_nodes_and_elements ();
 
   /*
    * If the mesh is empty
    * then we have nothing to do
    */
   if (!this->n_elem())
     return;
 
   /*
    * If the mesh is already second order
    * then we have nothing to do.
    * We have to test for this in a round-about way to avoid
    * a bug on distributed parallel meshes with more processors
    * than elements.
    */
   bool already_second_order = false;
   if (this->elements_begin() != this->elements_end() &&
       (*(this->elements_begin()))->default_order() != FIRST)
     already_second_order = true;
   this->comm().max(already_second_order);
   if (already_second_order)
     return;
 
   START_LOG("all_second_order()", "Mesh");
 
   /*
    * this map helps in identifying second order
    * nodes.  Namely, a second-order node:
    * - edge node
    * - face node
    * - bubble node
    * is uniquely defined through a set of adjacent
    * vertices.  This set of adjacent vertices is
    * used to identify already added higher-order
    * nodes.  We are safe to use node id's since we
    * make sure that these are correctly numbered.
    */
   std::map<std::vector<dof_id_type>, Node *> adj_vertices_to_so_nodes;
 
   /*
    * for speed-up of the \p add_point() method, we
    * can reserve memory.  Guess the number of additional
    * nodes for different dimensions
    */
   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
        */
       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)
        */
       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
        */
       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());
     }
 
 
 
   /*
    * form a vector that will hold the node id's of
    * the vertices that are adjacent to the son-th
    * second-order node.  Pull this outside of the
    * loop so that silly compilers don't repeatedly
    * create and destroy the vector.
    */
   std::vector<dof_id_type> adjacent_vertices_ids;
 
   element_iterator
     it = elements_begin(),
     endit = elements_end();
 
   for (; it != endit; ++it)
     {
       // the linear-order element
       Elem * lo_elem = *it;
 
       libmesh_assert(lo_elem);
 
       // make sure it is linear order
       if (lo_elem->default_order() != FIRST)
         libmesh_error_msg("ERROR: This is not a linear element: type=" << lo_elem->type());
 
       // this does _not_ work for refined elements
       libmesh_assert_equal_to (lo_elem->level (), 0);
 
       /*
        * build the second-order equivalent, add to
        * the new_elements list.  Note that this here
        * is the only point where \p full_ordered
        * is necessary.  The remaining code works well
        * for either type of second-order equivalent, e.g.
        * Hex20 or Hex27, as equivalents for Hex8
        */
       Elem * so_elem =
         Elem::build (Elem::second_order_equivalent_type(lo_elem->type(),
                                                         full_ordered) ).release();
 
       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; v < lo_elem->n_vertices(); v++)
         so_elem->set_node(v) = lo_elem->node_ptr(v);
 
       /*
        * Now handle the additional mid-side nodes.  This
        * is simply handled through a map that remembers
        * the already-added nodes.  This map maps the global
        * ids of the vertices (that uniquely define this
        * higher-order node) to the new node.
        * Notation: son = second-order node
        */
       const unsigned int son_begin = so_elem->n_vertices();
       const unsigned int son_end   = so_elem->n_nodes();
 
 
       for (unsigned int son=son_begin; son<son_end; son++)
         {
           const unsigned int n_adjacent_vertices =
             so_elem->n_second_order_adjacent_vertices(son);
 
           adjacent_vertices_ids.resize(n_adjacent_vertices);
 
           for (unsigned int v=0; v<n_adjacent_vertices; v++)
             adjacent_vertices_ids[v] =
               so_elem->node_id( so_elem->second_order_adjacent_vertex(son,v) );
 
           /*
            * \p adjacent_vertices_ids is now in order of the current
            * side.  sort it, so that comparisons  with the
            * \p adjacent_vertices_ids created through other elements'
            * sides can match
            */
           std::sort(adjacent_vertices_ids.begin(),
                     adjacent_vertices_ids.end());
 
 
           // does this set of vertices already have a mid-node added?
           auto pos = adj_vertices_to_so_nodes.equal_range (adjacent_vertices_ids);
 
           // no, not added yet
           if (pos.first == pos.second)
             {
               /*
                * for this set of vertices, there is no
                * second_order node yet.  Add it.
                *
                * compute the location of the new node as
                * the average over the adjacent vertices.
                */
               Point new_location = this->point(adjacent_vertices_ids[0]);
               for (unsigned int v=1; v<n_adjacent_vertices; v++)
                 new_location += this->point(adjacent_vertices_ids[v]);
 
               new_location /= static_cast<Real>(n_adjacent_vertices);
 
               /* Add the new point to the mesh.
                * If we are on a serialized mesh, then we're doing this
                * all in sync, and the node processor_id will be
                * consistent between processors.
                * If we are on a distributed mesh, we can fix
                * inconsistent processor ids later, but only if every
                * processor gives new nodes a *locally* consistent
                * processor id, so we'll give the new node the
                * processor id of an adjacent element for now and then
                * we'll update that later if appropriate.
                */
               Node * so_node = this->add_point
                 (new_location, DofObject::invalid_id,
                  lo_elem->processor_id());
 
               /*
                * insert the new node with its defining vertex
                * set into the map, and relocate pos to this
                * new entry, so that the so_elem can use
                * \p pos for inserting the node
                */
               adj_vertices_to_so_nodes.insert(pos.first,
                                               std::make_pair(adjacent_vertices_ids,
                                                              so_node));
 
               so_elem->set_node(son) = so_node;
             }
           // yes, already added.
           else
             {
               Node * so_node = pos.first->second;
               libmesh_assert(so_node);
 
               so_elem->set_node(son) = so_node;
 
               // We need to ensure that the processor who should own a
               // node *knows* they own the node.  And because
               // Node::choose_processor_id() may depend on Node id,
               // which may not yet be authoritative, we still have to
               // use a dumb-but-id-independent partitioning heuristic.
               processor_id_type chosen_pid =
                 std::min (so_node->processor_id(),
                           lo_elem->processor_id());
 
               // Plus, if we just discovered that we own this node,
               // then on a distributed mesh we need to make sure to
               // give it a valid id, not just a placeholder id!
               if (!this->is_replicated() &&
                   so_node->processor_id() != this->processor_id() &&
                   chosen_pid == this->processor_id())
                 this->own_node(*so_node);
 
               so_node->processor_id() = chosen_pid;
             }
         }
 
       /*
        * find_neighbors relies on remote_elem neighbor links being
        * properly maintained.
        */
       for (auto s : lo_elem->side_index_range())
         {
           if (lo_elem->neighbor_ptr(s) == remote_elem)
             so_elem->set_neighbor(s, const_cast<RemoteElem*>(remote_elem));
         }
 
       this->get_boundary_info().copy_boundary_ids
         (this->get_boundary_info(), lo_elem, so_elem);
 
       /*
        * The new second-order element is ready.
        * Inserting it into the mesh will replace and delete
        * the first-order element.
        */
       so_elem->set_id(lo_elem->id());
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
       so_elem->set_unique_id() = lo_elem->unique_id();
 #endif
       so_elem->processor_id() = lo_elem->processor_id();
       so_elem->subdomain_id() = lo_elem->subdomain_id();
       this->insert_elem(so_elem);
     }
 
   // we can clear the map
   adj_vertices_to_so_nodes.clear();
 
 
   STOP_LOG("all_second_order()", "Mesh");
 
   // On a DistributedMesh our ghost node processor ids may be bad,
   // the ids of nodes touching remote elements may be inconsistent,
   // unique_ids of newly added non-local nodes remain unset, and our
   // partitioning of new nodes may not be well balanced.
   //
   // make_nodes_parallel_consistent() will fix all this.
   if (!this->is_serial())
     MeshCommunication().make_nodes_parallel_consistent (*this);
 
   // renumber nodes, elements etc
   this->prepare_for_use(/*skip_renumber =*/ false);
 }

◆ allgather()

virtual void libMesh::MeshBase::allgather ( )

inlinevirtualinherited

Gathers all elements and nodes of the mesh onto every processor

Reimplemented in libMesh::DistributedMesh.

Definition at line 183 of file mesh_base.h.

Referenced by libMesh::EquationSystems::allgather(), and libMesh::MeshSerializer::MeshSerializer().

183 {}

◆ allow_remote_element_removal() [1/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 791 of file mesh_base.h.

References libMesh::MeshBase::_allow_remote_element_removal.

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

791 { _allow_remote_element_removal = allow; }

libMesh::MeshBase::_allow_remote_element_removal

bool _allow_remote_element_removal

Definition: mesh_base.h:1439

◆ allow_remote_element_removal() [2/2]

bool libMesh::MeshBase::allow_remote_element_removal ( ) const

inlineinherited

Definition at line 792 of file mesh_base.h.

References libMesh::MeshBase::_allow_remote_element_removal.

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

792 { return _allow_remote_element_removal; }

libMesh::MeshBase::_allow_remote_element_removal

bool _allow_remote_element_removal

Definition: mesh_base.h:1439

◆ allow_renumbering() [1/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 782 of file mesh_base.h.

References libMesh::MeshBase::_skip_renumber_nodes_and_elements.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::NameBasedIO::read(), and libMesh::GMVIO::read().

782 { _skip_renumber_nodes_and_elements = !allow; }

libMesh::MeshBase::_skip_renumber_nodes_and_elements

bool _skip_renumber_nodes_and_elements

Definition: mesh_base.h:1431

◆ allow_renumbering() [2/2]

bool libMesh::MeshBase::allow_renumbering ( ) const

inlineinherited

Definition at line 783 of file mesh_base.h.

References libMesh::MeshBase::_skip_renumber_nodes_and_elements.

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

783 { return !_skip_renumber_nodes_and_elements; }

libMesh::MeshBase::_skip_renumber_nodes_and_elements

bool _skip_renumber_nodes_and_elements

Definition: mesh_base.h:1431

◆ ancestor_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::ancestor_elements_begin ( )

overridevirtual

Iterate over elements for which elem->ancestor() is true.

Implements libMesh::MeshBase.

◆ ancestor_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::ancestor_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ ancestor_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::ancestor_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ ancestor_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::ancestor_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ bid_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::bid_nodes_begin ( boundary_id_type bndry_id )

overridevirtual

Iterate over nodes for which BoundaryInfo::has_boundary_id(node, bndry_id) is true.

Implements libMesh::MeshBase.

◆ bid_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::bid_nodes_begin ( boundary_id_type bndry_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ bid_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::bid_nodes_end ( boundary_id_type bndry_id )

overridevirtual

Implements libMesh::MeshBase.

◆ bid_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::bid_nodes_end ( boundary_id_type bndry_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ bnd_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::bnd_nodes_begin ( )

overridevirtual

Iterate over nodes for which BoundaryInfo::n_boundary_ids(node) > 0.

Implements libMesh::MeshBase.

◆ bnd_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::bnd_nodes_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ bnd_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::bnd_nodes_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ bnd_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::bnd_nodes_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ cache_elem_dims()

void libMesh::MeshBase::cache_elem_dims ( )

inherited

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 574 of file mesh_base.C.

References libMesh::MeshBase::_elem_dims, libMesh::MeshBase::_spatial_dimension, libMesh::MeshBase::active_element_ptr_range(), libMesh::ParallelObject::comm(), libMesh::Elem::dim(), libMesh::MeshBase::elem(), libMesh::MeshBase::mesh_dimension(), libMesh::MeshBase::node(), libMesh::MeshBase::node_ptr_range(), and libMesh::Parallel::Communicator::set_union().

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

 {
   // This requires an inspection on every processor
   parallel_object_only();
 
   // Need to clear _elem_dims first in case all elements of a
   // particular dimension have been deleted.
   _elem_dims.clear();
 
   for (const auto & elem : this->active_element_ptr_range())
     _elem_dims.insert(cast_int<unsigned char>(elem->dim()));
 
   // Some different dimension elements may only live on other processors
   this->comm().set_union(_elem_dims);
 
   // 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 < 3)
     {
       for (const auto & node : this->node_ptr_range())
         {
 #if LIBMESH_DIM > 1
           // Note: the exact floating point comparison is intentional,
           // we don't want to get tripped up by tolerances.
           if ((*node)(1) != 0.)
             {
               _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
             }
 #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
         }
     }
 }

◆ clear()

void libMesh::ReplicatedMesh::clear ( )

overridevirtual

Clear all internal data.

Reimplemented from libMesh::MeshBase.

Definition at line 556 of file replicated_mesh.C.

References _elements, _nodes, libMesh::MeshBase::clear(), libMesh::MeshBase::elem(), and libMesh::MeshBase::node().

Referenced by ~ReplicatedMesh().

 {
   // Call parent clear function
   MeshBase::clear();
 
   // Clear our elements and nodes
   // There is no need to remove the elements from
   // the BoundaryInfo data structure since we
   // already cleared it.
   for (auto & elem : _elements)
     delete elem;
 
   _elements.clear();
 
   // clear the nodes data structure
   // There is no need to remove the nodes from
   // the BoundaryInfo data structure since we
   // already cleared it.
   for (auto & node : _nodes)
     delete node;
 
   _nodes.clear();
 }

◆ clear_point_locator()

void libMesh::MeshBase::clear_point_locator ( )

inherited

Releases the current PointLocator object.

Definition at line 517 of file mesh_base.C.

References libMesh::MeshBase::_point_locator.

Referenced by libMesh::MeshBase::clear(), libMesh::UnstructuredMesh::contract(), libMesh::MeshCommunication::delete_remote_elements(), and libMesh::MeshBase::prepare_for_use().

 {
   _point_locator.reset(nullptr);
 }

◆ clone()

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

inlineoverridevirtual

Virtual copy-constructor, creates a copy of this mesh

Implements libMesh::MeshBase.

Reimplemented in libMesh::SerialMesh.

Definition at line 85 of file replicated_mesh.h.

86 { return libmesh_make_unique<ReplicatedMesh>(*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 89 of file parallel_object.h.

References libMesh::ParallelObject::_communicator.

90 { return _communicator; }

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition: parallel_object.h:107

◆ 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 769 of file unstructured_mesh.C.

References libMesh::Elem::active(), libMesh::Elem::ancestor(), libMesh::as_range(), libMesh::MeshBase::clear_point_locator(), libMesh::Elem::contract(), libMesh::MeshBase::delete_elem(), libMesh::MeshBase::elem(), libMesh::MeshBase::element_ptr_range(), libMesh::MeshBase::ghosting_functors_begin(), libMesh::MeshBase::ghosting_functors_end(), libMesh::Elem::parent(), libMesh::MeshBase::renumber_nodes_and_elements(), and libMesh::Elem::subactive().

 {
   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;
 }

◆ copy_nodes_and_elements()

void libMesh::UnstructuredMesh::copy_nodes_and_elements	(	const UnstructuredMesh &	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`
	)

virtualinherited

Deep copy of another unstructured mesh class (used by subclass copy constructors)

Definition at line 61 of file unstructured_mesh.C.

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

 {
   LOG_SCOPE("copy_nodes_and_elements()", "UnstructuredMesh");
 
   // If we are partitioned into fewer parts than the incoming mesh,
   // then we need to "wrap" the other Mesh's processor ids to fit
   // within our range. This can happen, for example, while stitching
   // ReplicatedMeshes with small numbers of elements in parallel...
   bool wrap_proc_ids = (_n_parts < other_mesh._n_parts);
 
   // We're assuming our subclass data needs no copy
   libmesh_assert_equal_to (_is_prepared, other_mesh._is_prepared);
 
   // 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.
 #ifdef DEBUG
   MeshTools::libmesh_assert_valid_amr_elem_ids(other_mesh);
   MeshTools::libmesh_assert_valid_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() % _n_parts : oldn->processor_id());
 
         // Add new nodes in old node Point locations
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
         Node * newn =
 #endif
           this->add_point(*oldn,
                           oldn->id() + node_id_offset,
                           added_pid);
 
 #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;
 
     // 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;
         std::unique_ptr<Elem> ap = Elem::build(old->type(), newparent);
         Elem * el = ap.release();
 
         el->subdomain_id() = old->subdomain_id();
 
         for (auto s : old->side_index_range())
           if (old->neighbor_ptr(s) == remote_elem)
             el->set_neighbor(s, const_cast<RemoteElem *>(remote_elem));
 
 #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, 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() % _n_parts : old->processor_id());
 
         // Give it the same element and unique ids
         el->set_id(old->id() + element_id_offset);
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
         el->set_unique_id() =
           old->unique_id() + unique_id_offset;
 #endif
 
         //Hold onto it
         if (!skip_find_neighbors)
           {
             this->add_elem(el);
           }
         else
           {
             Elem * new_el = this->add_elem(el);
             old_elems_to_new_elems[old] = new_el;
           }
 
         // Add the link between the original element and this copy to the map
         if (skip_find_neighbors)
           old_elems_to_new_elems[old] = el;
       }
 
     // Loop (again) over the elements to fill in the neighbors
     if (skip_find_neighbors)
       {
         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);
               }
           }
       }
   }
 
   //Finally prepare the new Mesh for use.  Keep the same numbering and
   //partitioning for now.
   this->allow_renumbering(false);
   this->allow_remote_element_removal(false);
   this->skip_partitioning(true);
 
   this->prepare_for_use(false, skip_find_neighbors);
 
   //But in the long term, use the same renumbering and partitioning
   //policies as our source mesh.
   this->allow_renumbering(other_mesh.allow_renumbering());
   this->allow_remote_element_removal(other_mesh.allow_remote_element_removal());
   this->skip_partitioning(other_mesh.skip_partitioning());
 }

◆ 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 655 of file unstructured_mesh.C.

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

 {
 
   // 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));
 }

◆ 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 690 of file unstructured_mesh.C.

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

 {
   // 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;
 
   for (const auto & old_elem : as_range(it, it_end))
     {
       // Add an equivalent element type to the new_mesh.
       // Copy ids for this element.
       Elem * new_elem = Elem::build(old_elem->type()).release();
       new_elem->set_id() = old_elem->id();
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
       new_elem->set_unique_id() = old_elem->unique_id();
 #endif
       new_elem->subdomain_id() = old_elem->subdomain_id();
       new_elem->processor_id() = old_elem->processor_id();
 
       new_mesh.add_elem (new_elem);
 
       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))
             {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
               Node * newn =
 #endif
                 new_mesh.add_point (old_elem->point(n),
                                     this_node_id,
                                     old_elem->node_ptr(n)->processor_id());
 
 #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(/*skip_renumber =*/false);
 }

◆ default_ghosting()

GhostingFunctor& libMesh::MeshBase::default_ghosting ( )

inlineinherited

Default ghosting functor

Definition at line 847 of file mesh_base.h.

References libMesh::MeshBase::_default_ghosting.

847 { return *_default_ghosting; }

libMesh::MeshBase::_default_ghosting

std::unique_ptr< GhostingFunctor > _default_ghosting

Definition: mesh_base.h:1466

◆ delete_elem()

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

overridevirtual

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::prepare_for_use() 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 329 of file replicated_mesh.C.

References _elements, libMesh::MeshBase::get_boundary_info(), libMesh::DofObject::id(), and libMesh::BoundaryInfo::remove().

Referenced by insert_elem().

 {
   libmesh_assert(e);
 
   // Initialize an iterator to eventually point to the element we want to delete
   std::vector<Elem *>::iterator pos = _elements.end();
 
   // In many cases, e->id() gives us a clue as to where e
   // is located in the _elements vector.  Try that first
   // before trying the O(n_elem) search.
   libmesh_assert_less (e->id(), _elements.size());
 
   if (_elements[e->id()] == e)
     {
       // We found it!
       pos = _elements.begin();
       std::advance(pos, e->id());
     }
 
   else
     {
       // This search is O(n_elem)
       pos = std::find (_elements.begin(),
                        _elements.end(),
                        e);
     }
 
   // Huh? Element not in the vector?
   libmesh_assert (pos != _elements.end());
 
   // Remove the element from the BoundaryInfo object
   this->get_boundary_info().remove(e);
 
   // delete the element
   delete e;
 
   // explicitly zero the pointer
   *pos = nullptr;
 }

◆ delete_node()

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

overridevirtual

Removes the Node n from the mesh.

Implements libMesh::MeshBase.

Definition at line 502 of file replicated_mesh.C.

References _nodes, libMesh::MeshBase::get_boundary_info(), libMesh::DofObject::id(), and libMesh::BoundaryInfo::remove().

Referenced by stitching_helper().

 {
   libmesh_assert(n);
   libmesh_assert_less (n->id(), _nodes.size());
 
   // Initialize an iterator to eventually point to the element we want
   // to delete
   std::vector<Node *>::iterator pos;
 
   // In many cases, e->id() gives us a clue as to where e
   // is located in the _elements vector.  Try that first
   // before trying the O(n_elem) search.
   if (_nodes[n->id()] == n)
     {
       pos = _nodes.begin();
       std::advance(pos, n->id());
     }
   else
     {
       pos = std::find (_nodes.begin(),
                        _nodes.end(),
                        n);
     }
 
   // Huh? Node not in the vector?
   libmesh_assert (pos != _nodes.end());
 
   // Delete the node from the BoundaryInfo object
   this->get_boundary_info().remove(n);
 
   // delete the node
   delete n;
 
   // explicitly zero the pointer
   *pos = nullptr;
 }

◆ delete_remote_elements()

virtual void libMesh::MeshBase::delete_remote_elements ( )

inlinevirtualinherited

When supported, 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 in libMesh::DistributedMesh.

Definition at line 196 of file mesh_base.h.

Referenced by libMesh::MeshTools::Generation::build_extrusion(), libMesh::UnstructuredMesh::create_submesh(), libMesh::MeshBase::prepare_for_use(), libMesh::Nemesis_IO::read(), libMesh::BoundaryInfo::sync(), and libMesh::MeshSerializer::~MeshSerializer().

196 {}

◆ 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 633 of file mesh_base.C.

References libMesh::MeshBase::active_element_ptr_range(), libMesh::Elem::dim(), libMesh::MeshBase::elem(), libMesh::MeshBase::elem_dimensions(), libMesh::MeshBase::elem_ptr(), libMesh::MeshBase::elem_ref(), libMesh::MeshBase::element_ptr_range(), libMesh::DofObject::id(), libMesh::MeshBase::max_elem_id(), libMesh::Elem::n_vertices(), and libMesh::Elem::node_id().

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

 {
   // This requires an inspection on every processor
   parallel_object_only();
 
   // Check if the mesh contains mixed dimensions. If so, then set interior parents, otherwise return.
   if (this->elem_dimensions().size() == 1)
     return;
 
   //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->active_element_ptr_range())
     {
       // Populating the node_to_elem map, same as MeshTools::build_nodes_to_elem_map
       for (unsigned int n=0; n<elem->n_vertices(); n++)
         {
           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 an 3D element or an element that already has an interior parent
       if (element->dim()>=LIBMESH_DIM || element->interior_parent())
         continue;
 
       // Start by generating a SET of elements that are dim+1 to the current
       // element at each vertex of the current element, thus ignoring interior nodes.
       // If one of the SET of elements is empty, then we will not have an interior parent
       // since an interior parent must be connected to all vertices of the current element
       std::vector<std::set<dof_id_type>> neighbors( element->n_vertices() );
 
       bool found_interior_parents = false;
 
       for (dof_id_type n=0; n < element->n_vertices(); n++)
         {
           std::vector<dof_id_type> & element_ids = node_to_elem[element->node_id(n)];
           for (const auto & eid : element_ids)
             if (this->elem_ref(eid).dim() == element->dim()+1)
               neighbors[n].insert(eid);
 
           if (neighbors[n].size()>0)
             {
               found_interior_parents = true;
             }
           else
             {
               // We have found an empty set, no reason to continue
               // Ensure we set this flag to false before the break since it could have
               // been set to true for previous vertex
               found_interior_parents = false;
               break;
             }
         }
 
       // If we have successfully generated a set of elements for each vertex, we will compare
       // the set for vertex 0 will the sets for the vertices until we find a id that exists in
       // all sets.  If found, this is our an interior parent id.  The interior parent id found
       // will be the lowest element id if there is potential for multiple interior parents.
       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 (dof_id_type n=1; n < element->n_vertices(); n++)
                 {
                   if (neighbors[n].find(interior_parent_id)!=neighbors[n].end())
                     {
                       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;
                 }
             }
         }
     }
 }

◆ elem() [1/2]

virtual const Elem* libMesh::MeshBase::elem ( const dof_id_type i ) const

inlinevirtualinherited

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

Deprecated:: Use the less confusingly-named elem_ptr() instead.

Definition at line 537 of file mesh_base.h.

References libMesh::MeshBase::elem_ptr().

Referenced by libMesh::MeshBase::cache_elem_dims(), clear(), libMesh::DistributedMesh::clear(), libMesh::UnstructuredMesh::contract(), libMesh::MeshBase::detect_interior_parents(), libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::n_active_sub_elem(), libMesh::MeshBase::n_sub_elem(), libMesh::MeshBase::recalculate_n_partitions(), libMesh::DistributedMesh::renumber_nodes_and_elements(), and libMesh::MeshBase::subdomain_ids().

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

◆ elem() [2/2]

virtual Elem* libMesh::MeshBase::elem ( const dof_id_type i )

inlinevirtualinherited

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

Deprecated:: Use the less confusingly-named elem_ptr() instead.

Definition at line 552 of file mesh_base.h.

References libMesh::MeshBase::elem_ptr().

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

◆ 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 220 of file mesh_base.h.

References libMesh::MeshBase::_elem_dims.

Referenced by libMesh::ExactSolution::_compute_error(), libMesh::System::calculate_norm(), libMesh::MeshBase::detect_interior_parents(), and libMesh::TreeNode< N >::insert().

221 { return _elem_dims; }

libMesh::MeshBase::_elem_dims

std::set< unsigned char > _elem_dims

Definition: mesh_base.h:1453

◆ elem_ptr() [1/2]

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

overridevirtual

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 219 of file replicated_mesh.C.

References _elements, and n_elem().

Referenced by stitching_helper().

 {
   libmesh_assert_less (i, this->n_elem());
   libmesh_assert(_elements[i]);
   libmesh_assert_equal_to (_elements[i]->id(), i); // This will change soon
 
   return _elements[i];
 }

◆ elem_ptr() [2/2]

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

overridevirtual

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 231 of file replicated_mesh.C.

References _elements, and n_elem().

 {
   libmesh_assert_less (i, this->n_elem());
   libmesh_assert(_elements[i]);
   libmesh_assert_equal_to (_elements[i]->id(), i); // This will change soon
 
   return _elements[i];
 }

◆ elem_ref() [1/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 504 of file mesh_base.h.

References libMesh::MeshBase::elem_ptr().

Referenced by 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::Nemesis_IO_Helper::compute_num_global_sidesets(), libMesh::MeshBase::detect_interior_parents(), libMesh::SyncRefinementFlags::gather_data(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_remote_elem(), libMesh::MeshRefinement::uniformly_coarsen(), libMesh::FroIO::write(), libMesh::Nemesis_IO_Helper::write_elements(), libMesh::ExodusII_IO_Helper::write_elements(), libMesh::GmshIO::write_mesh(), and libMesh::ExodusII_IO_Helper::write_sidesets().

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

◆ elem_ref() [2/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 513 of file mesh_base.h.

References libMesh::MeshBase::elem_ptr().

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

◆ element_ptr_range() [1/2]

virtual SimpleRange<element_iterator> libMesh::ReplicatedMesh::element_ptr_range ( )

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 239 of file replicated_mesh.h.

References elements_begin(), and elements_end().

Referenced by stitching_helper().

239 { return {elements_begin(), elements_end()}; }

libMesh::ReplicatedMesh::elements_begin

virtual element_iterator elements_begin() override

libMesh::ReplicatedMesh::elements_end

virtual element_iterator elements_end() override

◆ element_ptr_range() [2/2]

virtual SimpleRange<const_element_iterator> libMesh::ReplicatedMesh::element_ptr_range ( ) const

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 240 of file replicated_mesh.h.

References elements_begin(), and elements_end().

240 { return {elements_begin(), elements_end()}; }

libMesh::ReplicatedMesh::elements_begin

virtual element_iterator elements_begin() override

libMesh::ReplicatedMesh::elements_end

virtual element_iterator elements_end() override

◆ elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::elements_begin ( )

overridevirtual

Elem iterator accessor functions.

Implements libMesh::MeshBase.

Referenced by element_ptr_range().

◆ elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by element_ptr_range().

◆ elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::evaluable_elements_begin	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)

overridevirtual

Iterate over elements in the Mesh where the solution (as distributed by the given DofMap) can be evaluated, for the given variable var_num, or for all variables by default.

Implements libMesh::MeshBase.

◆ evaluable_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::evaluable_elements_begin	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::evaluable_elements_end	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::evaluable_elements_end	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::evaluable_nodes_begin	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)

overridevirtual

Iterate over nodes in the Mesh where the solution (as distributed by the given DofMap) can be evaluated, for the given variable var_num, or for all variables by default.

Implements libMesh::MeshBase.

◆ evaluable_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::evaluable_nodes_begin	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::evaluable_nodes_end	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)

overridevirtual

Implements libMesh::MeshBase.

◆ evaluable_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::evaluable_nodes_end	(	const DofMap &	dof_map,
		unsigned int	var_num = `libMesh::invalid_uint`
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ facelocal_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::facelocal_elements_begin ( )

overridevirtual

Iterate over elements which are on or have a neighbor on the current processor.

Implements libMesh::MeshBase.

◆ facelocal_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::facelocal_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ facelocal_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::facelocal_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ facelocal_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::facelocal_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ find_neighbors()

void libMesh::UnstructuredMesh::find_neighbors	(	const bool	reset_remote_elements = `false`,
		const bool	reset_current_list = `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 240 of file unstructured_mesh.C.

References libMesh::Elem::active(), libMesh::Elem::ancestor(), libMesh::as_range(), libMesh::Elem::centroid(), libMesh::Elem::child_ptr(), libMesh::Elem::child_ref_range(), libMesh::MeshBase::element_ptr_range(), libMesh::err, libMesh::Elem::has_children(), 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::MeshBase::level_elements_begin(), libMesh::MeshBase::level_elements_end(), libMesh::MeshTools::libmesh_assert_valid_amr_interior_parents(), libMesh::MeshTools::libmesh_assert_valid_neighbors(), libMesh::Elem::n_children(), libMesh::MeshTools::n_levels(), libMesh::Elem::neighbor_ptr(), libMesh::Elem::neighbor_ptr_range(), libMesh::Elem::parent(), libMesh::ParallelObject::processor_id(), libMesh::DofObject::processor_id(), libMesh::Real, libMesh::remote_elem, libMesh::Elem::set_interior_parent(), libMesh::Elem::set_neighbor(), libMesh::Elem::side_ptr(), libMesh::Elem::subactive(), libMesh::TOLERANCE, libMesh::Elem::which_child_am_i(), and libMesh::NameBasedIO::write().

Referenced by libMesh::TriangleWrapper::copy_tri_to_mesh(), and libMesh::DistributedMesh::redistribute().

 {
   // 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)
     for (const auto & e : this->element_ptr_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 unsigned int                    key_type;
     typedef std::pair<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;
 
     // 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 (element->neighbor_ptr(ms) == nullptr ||
                 element->neighbor_ptr(ms) == remote_elem)
               {
                 // Get the key for the side of this element
                 const unsigned int key = element->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
                         //
                         // 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) &&
                             (element->level() == neighbor->level()) &&
                             ((element->dim() != 1) || (ns != ms)))
                           {
                             // 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
                 key_val_pair kvp;
 
                 kvp.first         = key;
                 kvp.second.first  = element;
                 kvp.second.second = cast_int<unsigned char>(ms);
                 side_to_elem_map.insert (kvp);
               }
           }
       }
   }
 
 #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->centroid()
                                      << ", Bad neighbor center = " << neigh->centroid() << 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
   MeshTools::libmesh_assert_valid_neighbors(*this,
                                             !reset_remote_elements);
   MeshTools::libmesh_assert_valid_amr_interior_parents(*this);
 #endif
 }

◆ fix_broken_node_and_element_numbering()

void libMesh::ReplicatedMesh::fix_broken_node_and_element_numbering ( )

overridevirtual

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 761 of file replicated_mesh.C.

References _elements, and _nodes.

 {
   // Nodes first
   for (std::size_t n=0; n<this->_nodes.size(); n++)
     if (this->_nodes[n] != nullptr)
       this->_nodes[n]->set_id() = cast_int<dof_id_type>(n);
 
   // Elements next
   for (std::size_t e=0; e<this->_elements.size(); e++)
     if (this->_elements[e] != nullptr)
       this->_elements[e]->set_id() = cast_int<dof_id_type>(e);
 }

◆ flagged_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::flagged_elements_begin ( unsigned char rflag )

overridevirtual

Iterate over all elements with a specified refinement flag.

Implements libMesh::MeshBase.

◆ flagged_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::flagged_elements_begin ( unsigned char rflag ) const

overridevirtual

Implements libMesh::MeshBase.

◆ flagged_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::flagged_elements_end ( unsigned char rflag )

overridevirtual

Implements libMesh::MeshBase.

◆ flagged_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::flagged_elements_end ( unsigned char rflag ) const

overridevirtual

Implements libMesh::MeshBase.

◆ flagged_pid_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::flagged_pid_elements_begin	(	unsigned char	rflag,
		processor_id_type	pid
	)

overridevirtual

Iterate over all elements with a specified refinement flag on a specified processor.

Implements libMesh::MeshBase.

◆ flagged_pid_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::flagged_pid_elements_begin	(	unsigned char	rflag,
		processor_id_type	pid
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ flagged_pid_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::flagged_pid_elements_end	(	unsigned char	rflag,
		processor_id_type	pid
	)

overridevirtual

Implements libMesh::MeshBase.

◆ flagged_pid_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::flagged_pid_elements_end	(	unsigned char	rflag,
		processor_id_type	pid
	)		const

overridevirtual

Implements libMesh::MeshBase.

◆ gather_to_zero()

virtual void libMesh::MeshBase::gather_to_zero ( )

inlinevirtualinherited

Gathers all elements and nodes of the mesh onto processor zero

Reimplemented in libMesh::DistributedMesh.

Definition at line 189 of file mesh_base.h.

Referenced by libMesh::MeshSerializer::MeshSerializer().

189 {}

◆ get_boundary_info() [1/2]

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

inlineinherited

The information about boundary ids on the mesh

Definition at line 131 of file mesh_base.h.

References libMesh::MeshBase::boundary_info.

Referenced by libMesh::MeshRefinement::_coarsen_elements(), libMesh::MeshTools::Subdivision::add_boundary_ghosts(), libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshTools::Subdivision::all_subdivision(), libMesh::MeshTools::Modification::all_tri(), libMesh::AbaqusIO::assign_boundary_node_ids(), libMesh::AbaqusIO::assign_sideset_ids(), libMesh::MeshTools::Generation::build_delaunay_square(), libMesh::MeshTools::Generation::build_extrusion(), libMesh::MeshTools::Modification::change_boundary_id(), libMesh::DofMap::check_dirichlet_bcid_consistency(), libMesh::Nemesis_IO_Helper::compute_num_global_nodesets(), libMesh::Nemesis_IO_Helper::compute_num_global_sidesets(), libMesh::FEGenericBase< FEOutputType< T >::type >::compute_periodic_constraints(), libMesh::UnstructuredMesh::create_submesh(), libMesh::TetGenMeshInterface::delete_2D_hull_elements(), delete_elem(), libMesh::DistributedMesh::delete_elem(), delete_node(), libMesh::DistributedMesh::delete_node(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshTools::Modification::flatten(), libMesh::UNVIO::groups_in(), libMesh::ExodusII_IO_Helper::initialize(), libMesh::MeshTools::libmesh_assert_valid_boundary_ids(), libMesh::Parallel::Packing< T >::pack(), libMesh::Parallel::Packing< T >::packable_size(), libMesh::TetGenMeshInterface::pointset_convexhull(), libMesh::Nemesis_IO::prepare_to_write_nodal_data(), libMesh::AbaqusIO::read(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::CheckpointIO::read_bcs(), libMesh::CheckpointIO::read_header(), libMesh::GmshIO::read_mesh(), libMesh::CheckpointIO::read_nodesets(), libMesh::XdrIO::read_serialized_bcs_helper(), libMesh::XdrIO::read_serialized_nodesets(), renumber_nodes_and_elements(), libMesh::DistributedMesh::renumber_nodes_and_elements(), ReplicatedMesh(), stitching_helper(), libMesh::BoundaryInfo::sync(), libMesh::Parallel::Packing< T >::unpack(), libMesh::FroIO::write(), libMesh::Nemesis_IO::write(), libMesh::ExodusII_IO::write(), libMesh::XdrIO::write(), libMesh::CheckpointIO::write(), libMesh::GmshIO::write_mesh(), libMesh::ExodusII_IO::write_nodal_data_common(), libMesh::ExodusII_IO_Helper::write_nodesets(), libMesh::XdrIO::write_serialized_bcs_helper(), libMesh::XdrIO::write_serialized_nodesets(), and libMesh::ExodusII_IO_Helper::write_sidesets().

131 { return *boundary_info; }

libMesh::MeshBase::boundary_info

std::unique_ptr< BoundaryInfo > boundary_info

Definition: mesh_base.h:1363

◆ get_boundary_info() [2/2]

BoundaryInfo& libMesh::MeshBase::get_boundary_info ( )

inlineinherited

Writable information about boundary ids on the mesh

Definition at line 136 of file mesh_base.h.

References libMesh::MeshBase::boundary_info.

136 { return *boundary_info; }

libMesh::MeshBase::boundary_info

std::unique_ptr< BoundaryInfo > boundary_info

Definition: mesh_base.h:1363

◆ 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 531 of file mesh_base.C.

References libMesh::MeshBase::_count_lower_dim_elems_in_point_locator.

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

 {
   return _count_lower_dim_elems_in_point_locator;
 }

◆ get_id_by_name()

subdomain_id_type libMesh::MeshBase::get_id_by_name ( const std::string & name ) const

inherited

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

Definition at line 558 of file mesh_base.C.

References libMesh::MeshBase::_block_id_to_name, libMesh::Elem::invalid_subdomain_id, and libMesh::Quality::name().

 {
   // Linear search over the map values.
   std::map<subdomain_id_type, std::string>::const_iterator
     iter = _block_id_to_name.begin(),
     end_iter = _block_id_to_name.end();
 
   for ( ; iter != end_iter; ++iter)
     if (iter->second == name)
       return iter->first;
 
   // 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;
 }

◆ get_info()

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

inherited

Returns: A string containing relevant information about the mesh.

Definition at line 378 of file mesh_base.C.

References libMesh::MeshBase::_elem_dims, libMesh::MeshBase::n_active_elem(), libMesh::MeshBase::n_elem(), libMesh::MeshBase::n_local_elem(), libMesh::MeshBase::n_local_nodes(), libMesh::MeshBase::n_nodes(), libMesh::MeshBase::n_partitions(), libMesh::ParallelObject::n_processors(), libMesh::MeshBase::n_subdomains(), libMesh::n_threads(), libMesh::ParallelObject::processor_id(), and libMesh::MeshBase::spatial_dimension().

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

 {
   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 << "}\n";
     }
 
   oss << "  spatial_dimension()=" << this->spatial_dimension() << '\n'
       << "  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
       << "    n_active_elem()="   << this->n_active_elem()     << '\n'
 #endif
       << "  n_subdomains()="      << static_cast<std::size_t>(this->n_subdomains()) << '\n'
       << "  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';
 
   return oss.str();
 }

◆ get_subdomain_name_map()

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

inlineinherited

Definition at line 1337 of file mesh_base.h.

References libMesh::MeshBase::_block_id_to_name.

Referenced by libMesh::XdrIO::write_serialized_subdomain_names(), and libMesh::CheckpointIO::write_subdomain_names().

1338 { return _block_id_to_name; }

libMesh::MeshBase::_block_id_to_name

std::map< subdomain_id_type, std::string > _block_id_to_name

Definition: mesh_base.h:1446

◆ ghost_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::ghost_elements_begin ( )

overridevirtual

Iterate over "ghost" elements in the Mesh. A ghost element is one which is not local, but is semilocal.

Implements libMesh::MeshBase.

◆ ghost_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::ghost_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ ghost_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::ghost_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ ghost_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::ghost_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ ghosting_functors_begin()

std::set<GhostingFunctor *>::const_iterator libMesh::MeshBase::ghosting_functors_begin ( ) const

inlineinherited

Beginning of range of ghosting functors

Definition at line 835 of file mesh_base.h.

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::UnstructuredMesh::contract(), libMesh::MeshCommunication::delete_remote_elements(), and libMesh::query_ghosting_functors().

836 { return _ghosting_functors.begin(); }

libMesh::MeshBase::_ghosting_functors

std::set< GhostingFunctor * > _ghosting_functors

Definition: mesh_base.h:1475

◆ ghosting_functors_end()

std::set<GhostingFunctor *>::const_iterator libMesh::MeshBase::ghosting_functors_end ( ) const

inlineinherited

End of range of ghosting functors

Definition at line 841 of file mesh_base.h.

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::UnstructuredMesh::contract(), libMesh::MeshCommunication::delete_remote_elements(), and libMesh::query_ghosting_functors().

842 { return _ghosting_functors.end(); }

libMesh::MeshBase::_ghosting_functors

std::set< GhostingFunctor * > _ghosting_functors

Definition: mesh_base.h:1475

◆ insert_elem()

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

overridevirtual

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

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

Implements libMesh::MeshBase.

Definition at line 305 of file replicated_mesh.C.

References _elements, libMesh::MeshBase::_next_unique_id, delete_elem(), libMesh::DofObject::id(), libMesh::DofObject::set_unique_id(), and libMesh::DofObject::valid_unique_id().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   if (!e->valid_unique_id())
     e->set_unique_id() = _next_unique_id++;
 #endif
 
   dof_id_type eid = e->id();
   libmesh_assert_less (eid, _elements.size());
   Elem * oldelem = _elements[eid];
 
   if (oldelem)
     {
       libmesh_assert_equal_to (oldelem->id(), eid);
       this->delete_elem(oldelem);
     }
 
   _elements[e->id()] = e;
 
   return e;
 }

◆ insert_node()

Node * libMesh::ReplicatedMesh::insert_node ( Node * n )

overridevirtual

Insert Node n into the Mesh at a location consistent with n->id(), allocating extra storage if necessary. Throws an error if: .) n==nullptr .) n->id() == DofObject::invalid_id .) A node already exists in position n->id().

This function differs from the ReplicatedMesh::add_node() function, which is only capable of appending nodes at the end of the nodes storage.

Implements libMesh::MeshBase.

Definition at line 459 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, _nodes, libMesh::DofObject::id(), libMesh::DofObject::invalid_id, libMesh::DofObject::set_unique_id(), and libMesh::DofObject::valid_unique_id().

 {
   if (!n)
     libmesh_error_msg("Error, attempting to insert nullptr node.");
 
   if (n->id() == DofObject::invalid_id)
     libmesh_error_msg("Error, cannot insert node with invalid id.");
 
   if (n->id() < _nodes.size())
     {
       // Don't allow inserting on top of an existing Node.
 
       // Doing so doesn't have to be *error*, in the case where a
       // redundant insert is done, but when that happens we ought to
       // always be able to make the code more efficient by avoiding
       // the redundant insert, so let's keep screaming "Error" here.
       if (_nodes[ n->id() ] != nullptr)
         libmesh_error_msg("Error, cannot insert node on top of existing node.");
     }
   else
     {
       // Allocate just enough space to store the new node.  This will
       // cause highly non-ideal memory allocation behavior if called
       // repeatedly...
       _nodes.resize(n->id() + 1);
     }
 
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   if (!n->valid_unique_id())
     n->set_unique_id() = _next_unique_id++;
 #endif
 
   // We have enough space and this spot isn't already occupied by
   // another node, so go ahead and add it.
   _nodes[ n->id() ] = n;
 
   // If we made it this far, we just inserted the node the user handed
   // us, so we can give it right back.
   return n;
 }

◆ is_prepared()

bool libMesh::MeshBase::is_prepared ( ) const

inlineinherited

Returns: true if the mesh has been prepared via a call to prepare_for_use, false otherwise.

Definition at line 147 of file mesh_base.h.

References libMesh::MeshBase::_is_prepared.

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

148 { return _is_prepared; }

libMesh::MeshBase::_is_prepared

bool _is_prepared

Definition: mesh_base.h:1389

◆ is_replicated()

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

inlinevirtualinherited

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

Reimplemented in libMesh::DistributedMesh.

Definition at line 176 of file mesh_base.h.

Referenced by libMesh::MeshRefinement::_refine_elements(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::CheckpointIO::read(), and libMesh::MeshRefinement::uniformly_coarsen().

177 { return true; }

◆ is_serial()

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

inlinevirtualinherited

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

Reimplemented in libMesh::DistributedMesh.

Definition at line 154 of file mesh_base.h.

Referenced by libMesh::MeshRefinement::_coarsen_elements(), libMesh::MeshRefinement::_smooth_flags(), libMesh::BoundaryInfo::add_elements(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshTools::Modification::all_tri(), libMesh::EquationSystems::allgather(), libMesh::DofMap::allgather_recursive_constraints(), libMesh::MeshTools::Generation::build_extrusion(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::BoundaryInfo::build_node_list_from_side_list(), libMesh::DofMap::create_dof_constraints(), libMesh::UnstructuredMesh::create_submesh(), libMesh::MeshCommunication::delete_remote_elements(), libMesh::LocationMap< T >::init(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshSerializer::MeshSerializer(), libMesh::BoundaryInfo::n_boundary_conds(), libMesh::BoundaryInfo::n_edge_conds(), libMesh::BoundaryInfo::n_nodeset_conds(), libMesh::BoundaryInfo::n_shellface_conds(), libMesh::MeshBase::partition(), libMesh::MeshBase::prepare_for_use(), libMesh::Nemesis_IO::read(), libMesh::DofMap::scatter_constraints(), libMesh::BoundaryInfo::sync(), libMesh::MeshTools::total_weight(), libMesh::CheckpointIO::write(), and libMesh::XdrIO::write_parallel().

155 { return true; }

◆ is_serial_on_zero()

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

inlinevirtualinherited

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

Reimplemented in libMesh::DistributedMesh.

Definition at line 161 of file mesh_base.h.

162 { return true; }

◆ level_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::level_elements_begin ( unsigned int level )

overridevirtual

Iterate over elements of a given level.

Implements libMesh::MeshBase.

◆ level_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::level_elements_begin ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ level_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::level_elements_end ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ level_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::level_elements_end ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ libmesh_assert_valid_parallel_ids()

virtual void libMesh::MeshBase::libmesh_assert_valid_parallel_ids ( ) const

inlinevirtualinherited

Verify id and processor_id consistency of our elements and nodes containers. Calls libmesh_assert() on each possible failure. Currently only implemented on DistributedMesh; a serial data structure is much harder to get out of sync.

Reimplemented in libMesh::DistributedMesh.

Definition at line 1007 of file mesh_base.h.

Referenced by libMesh::MeshRefinement::_refine_elements(), libMesh::InfElemBuilder::build_inf_elem(), and libMesh::MeshRefinement::refine_and_coarsen_elements().

1007 {}

◆ local_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ local_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ local_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_level_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_level_elements_begin ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ local_level_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_level_elements_begin ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_level_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_level_elements_end ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ local_level_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_level_elements_end ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_node_ptr_range() [1/2]

virtual SimpleRange<node_iterator> libMesh::ReplicatedMesh::local_node_ptr_range ( )

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 432 of file replicated_mesh.h.

References local_nodes_begin(), and local_nodes_end().

432 { return {local_nodes_begin(), local_nodes_end()}; }

libMesh::ReplicatedMesh::local_nodes_begin

virtual node_iterator local_nodes_begin() override

libMesh::ReplicatedMesh::local_nodes_end

virtual node_iterator local_nodes_end() override

◆ local_node_ptr_range() [2/2]

virtual SimpleRange<const_node_iterator> libMesh::ReplicatedMesh::local_node_ptr_range ( ) const

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 433 of file replicated_mesh.h.

References local_nodes_begin(), and local_nodes_end().

433 { return {local_nodes_begin(), local_nodes_end()}; }

libMesh::ReplicatedMesh::local_nodes_begin

virtual node_iterator local_nodes_begin() override

libMesh::ReplicatedMesh::local_nodes_end

virtual node_iterator local_nodes_end() override

◆ local_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::local_nodes_begin ( )

overridevirtual

Iterate over local nodes (nodes whose processor_id() matches the current processor).

Implements libMesh::MeshBase.

Referenced by local_node_ptr_range().

◆ local_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::local_nodes_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::local_nodes_end ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by local_node_ptr_range().

◆ local_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::local_nodes_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_not_level_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_not_level_elements_begin ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ local_not_level_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_not_level_elements_begin ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ local_not_level_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::local_not_level_elements_end ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ local_not_level_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::local_not_level_elements_end ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ max_elem_id()

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

inlineoverridevirtual

Returns: A number greater than or equal to the maximum element id in the mesh.

Implements libMesh::MeshBase.

Definition at line 123 of file replicated_mesh.h.

References _elements.

Referenced by stitching_helper().

124 { return cast_int<dof_id_type>(_elements.size()); }

libMesh::ReplicatedMesh::_elements

std::vector< Elem * > _elements

Definition: replicated_mesh.h:474

◆ max_node_id()

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

inlineoverridevirtual

Returns: A number greater than or equal to the maximum node id in the mesh.

Implements libMesh::MeshBase.

Definition at line 109 of file replicated_mesh.h.

References _nodes.

Referenced by stitching_helper().

110 { return cast_int<dof_id_type>(_nodes.size()); }

libMesh::ReplicatedMesh::_nodes

std::vector< Node * > _nodes

Definition: replicated_mesh.h:469

◆ 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. If we ever support multi-dimensional meshes (e.g. hexes and quads in the same mesh) then this will return the largest such dimension.

Definition at line 126 of file mesh_base.C.

References libMesh::MeshBase::_elem_dims.

Referenced by libMesh::HPCoarsenTest::add_projection(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshTools::Modification::all_tri(), libMesh::EquationSystems::build_discontinuous_solution_vector(), libMesh::EquationSystems::build_parallel_solution_vector(), libMesh::EquationSystems::build_variable_names(), libMesh::MeshBase::cache_elem_dims(), libMesh::DofMap::create_dof_constraints(), libMesh::MeshTools::Modification::distort(), libMesh::MeshRefinement::flag_elements_by_elem_fraction(), libMesh::MeshRefinement::flag_elements_by_nelem_target(), libMesh::LaplaceMeshSmoother::init(), libMesh::PointLocatorTree::init(), libMesh::ExodusII_IO_Helper::initialize(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::GMVIO::read(), libMesh::VTKIO::read(), libMesh::System::read_header(), libMesh::UCDIO::read_implementation(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::MeshTools::Modification::smooth(), libMesh::PostscriptIO::write(), libMesh::CheckpointIO::write(), libMesh::TecplotIO::write_binary(), libMesh::GMVIO::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().

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

◆ n_active_elem()

dof_id_type libMesh::ReplicatedMesh::n_active_elem ( ) const

overridevirtual

Returns: The number of active elements in the mesh.

Implemented in terms of active_element_iterators.

Implements libMesh::MeshBase.

Definition at line 1371 of file replicated_mesh.C.

References active_elements_begin(), and active_elements_end().

 {
   return static_cast<dof_id_type>(std::distance (this->active_elements_begin(),
                                                  this->active_elements_end()));
 }

◆ 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 345 of file mesh_base.C.

References libMesh::MeshBase::active_pid_elements_begin(), libMesh::MeshBase::active_pid_elements_end(), and libMesh::ParallelObject::n_processors().

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

 {
   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)));
 }

◆ 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 403 of file mesh_base.h.

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

Referenced by libMesh::VTKIO::cells_to_vtk().

404 { 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:345

libMesh::ParallelObject::processor_id

processor_id_type processor_id() const

Definition: parallel_object.h:101

◆ 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 366 of file mesh_base.C.

References libMesh::MeshBase::active_element_ptr_range(), libMesh::MeshBase::elem(), and libMesh::Elem::n_sub_elem().

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

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

◆ n_elem()

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

inlineoverridevirtual

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 115 of file replicated_mesh.h.

References _elements.

Referenced by elem_ptr(), and query_elem_ptr().

116 { return cast_int<dof_id_type>(_elements.size()); }

libMesh::ReplicatedMesh::_elements

std::vector< Elem * > _elements

Definition: replicated_mesh.h:474

◆ 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 332 of file mesh_base.C.

References libMesh::DofObject::invalid_processor_id, libMesh::ParallelObject::n_processors(), libMesh::MeshBase::pid_elements_begin(), and libMesh::MeshBase::pid_elements_end().

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

 {
   // 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)));
 }

◆ 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 386 of file mesh_base.h.

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

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

387 { 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:332

libMesh::ParallelObject::processor_id

processor_id_type processor_id() const

Definition: parallel_object.h:101

◆ 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 286 of file mesh_base.h.

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().

287 { 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:319

libMesh::ParallelObject::processor_id

processor_id_type processor_id() const

Definition: parallel_object.h:101

◆ n_nodes()

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

inlineoverridevirtual

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 103 of file replicated_mesh.h.

References _nodes.

Referenced by node_ptr(), and query_node_ptr().

104 { return cast_int<dof_id_type>(_nodes.size()); }

libMesh::ReplicatedMesh::_nodes

std::vector< Node * > _nodes

Definition: replicated_mesh.h:469

◆ 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 319 of file mesh_base.C.

References libMesh::DofObject::invalid_processor_id, libMesh::ParallelObject::n_processors(), libMesh::MeshBase::pid_nodes_begin(), and libMesh::MeshBase::pid_nodes_end().

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

 {
   // 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)));
 }

◆ 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 875 of file mesh_base.h.

References libMesh::MeshBase::_n_parts.

Referenced by libMesh::MeshBase::get_info(), libMesh::BoundaryInfo::sync(), libMesh::NameBasedIO::write(), libMesh::GMVIO::write_ascii_new_impl(), and libMesh::GMVIO::write_ascii_old_impl().

876 { return _n_parts; }

libMesh::MeshBase::_n_parts

unsigned int _n_parts

Definition: mesh_base.h:1384

◆ n_processors()

processor_id_type libMesh::ParallelObject::n_processors ( ) const

inlineinherited

Returns: The number of processors in the group.

Definition at line 95 of file parallel_object.h.

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

96 { return cast_int<processor_id_type>(_communicator.size()); }

libMesh::Parallel::Communicator::size

processor_id_type size() const

Definition: communicator.h:175

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition: parallel_object.h:107

◆ 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 354 of file mesh_base.C.

References libMesh::MeshBase::elem(), libMesh::MeshBase::element_ptr_range(), and libMesh::Elem::n_sub_elem().

 {
   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 304 of file mesh_base.C.

References libMesh::MeshBase::subdomain_ids().

Referenced by libMesh::MeshBase::get_info(), libMesh::XdrIO::write(), and libMesh::NameBasedIO::write_nodal_data().

 {
   // 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());
 }

◆ 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 392 of file mesh_base.h.

References libMesh::DofObject::invalid_processor_id, and libMesh::MeshBase::n_elem_on_proc().

Referenced by libMesh::DistributedMesh::parallel_n_elem(), and libMesh::MeshBase::partition().

393 { return this->n_elem_on_proc (DofObject::invalid_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:332

libMesh::DofObject::invalid_processor_id

static const processor_id_type invalid_processor_id

Definition: dof_object.h:358

◆ 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 292 of file mesh_base.h.

References libMesh::DofObject::invalid_processor_id, and libMesh::MeshBase::n_nodes_on_proc().

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

293 { return this->n_nodes_on_proc (DofObject::invalid_processor_id); }

libMesh::DofObject::invalid_processor_id

static const processor_id_type invalid_processor_id

Definition: dof_object.h:358

libMesh::MeshBase::n_nodes_on_proc

dof_id_type n_nodes_on_proc(const processor_id_type proc) const

Definition: mesh_base.C:319

◆ next_unique_id()

unique_id_type libMesh::MeshBase::next_unique_id ( )

inlineinherited

Returns: The next unique id to be used.

Definition at line 305 of file mesh_base.h.

References libMesh::MeshBase::_next_unique_id.

305 { return _next_unique_id; }

libMesh::MeshBase::_next_unique_id

unique_id_type _next_unique_id

Definition: mesh_base.h:1418

◆ node() [1/2]

virtual const Node& libMesh::MeshBase::node ( 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.

Deprecated:: Use the less confusingly-named node_ref() instead.

Definition at line 454 of file mesh_base.h.

References libMesh::MeshBase::node_ptr().

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::MeshBase::cache_elem_dims(), clear(), libMesh::DistributedMesh::clear(), and renumber_nodes_and_elements().

   {
     libmesh_deprecated();
     return *this->node_ptr(i);
   }

◆ node() [2/2]

virtual Node& libMesh::MeshBase::node ( 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.

Deprecated:: Use the less confusingly-named node_ref() instead.

Definition at line 468 of file mesh_base.h.

References libMesh::MeshBase::node_ptr().

   {
     libmesh_deprecated();
     return *this->node_ptr(i);
   }

◆ node_ptr() [1/2]

const Node * libMesh::ReplicatedMesh::node_ptr ( const dof_id_type i ) const

overridevirtual

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 169 of file replicated_mesh.C.

References _nodes, and n_nodes().

Referenced by stitching_helper().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
   libmesh_assert_equal_to (_nodes[i]->id(), i); // This will change soon
 
   return _nodes[i];
 }

◆ node_ptr() [2/2]

Node * libMesh::ReplicatedMesh::node_ptr ( const dof_id_type i )

overridevirtual

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 181 of file replicated_mesh.C.

References _nodes, and n_nodes().

 {
   libmesh_assert_less (i, this->n_nodes());
   libmesh_assert(_nodes[i]);
   libmesh_assert_equal_to (_nodes[i]->id(), i); // This will change soon
 
   return _nodes[i];
 }

◆ node_ptr_range() [1/2]

virtual SimpleRange<node_iterator> libMesh::ReplicatedMesh::node_ptr_range ( )

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 420 of file replicated_mesh.h.

References nodes_begin(), and nodes_end().

420 { return {nodes_begin(), nodes_end()}; }

libMesh::ReplicatedMesh::nodes_end

virtual node_iterator nodes_end() override

libMesh::ReplicatedMesh::nodes_begin

virtual node_iterator nodes_begin() override

◆ node_ptr_range() [2/2]

virtual SimpleRange<const_node_iterator> libMesh::ReplicatedMesh::node_ptr_range ( ) const

inlineoverridevirtual

Implements libMesh::MeshBase.

Definition at line 421 of file replicated_mesh.h.

References nodes_begin(), and nodes_end().

421 { return {nodes_begin(), nodes_end()}; }

libMesh::ReplicatedMesh::nodes_end

virtual node_iterator nodes_end() override

libMesh::ReplicatedMesh::nodes_begin

virtual node_iterator nodes_begin() override

◆ node_ref() [1/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 434 of file mesh_base.h.

References libMesh::MeshBase::node_ptr().

Referenced by libMesh::SyncNodalPositions::act_on_data(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::MeshTools::correct_node_proc_ids(), point(), libMesh::DistributedMesh::point(), libMesh::XdrIO::read_serialized_nodes(), libMesh::LaplaceMeshSmoother::smooth(), libMesh::MeshTools::Modification::smooth(), stitching_helper(), and libMesh::GmshIO::write_mesh().

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

◆ node_ref() [2/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 442 of file mesh_base.h.

References libMesh::MeshBase::node_ptr().

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

◆ nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::nodes_begin ( )

overridevirtual

Node iterator accessor functions.

Implements libMesh::MeshBase.

Referenced by node_ptr_range().

◆ nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::nodes_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::nodes_end ( )

overridevirtual

Implements libMesh::MeshBase.

Referenced by node_ptr_range().

◆ nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::nodes_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_active_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_active_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_active_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_active_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_active_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_active_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_active_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_active_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_ancestor_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_ancestor_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_ancestor_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_ancestor_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_ancestor_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_ancestor_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_ancestor_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_ancestor_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_level_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_level_elements_begin ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ not_level_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_level_elements_begin ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_level_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_level_elements_end ( unsigned int level )

overridevirtual

Implements libMesh::MeshBase.

◆ not_level_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_level_elements_end ( unsigned int level ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_local_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_local_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_local_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_local_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_local_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_local_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_local_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_local_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_subactive_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_subactive_elements_begin ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_subactive_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_subactive_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ not_subactive_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::not_subactive_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ not_subactive_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::not_subactive_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ operator=() [1/2]

ReplicatedMesh& libMesh::ReplicatedMesh::operator= ( const ReplicatedMesh & )

delete

Copy and move assignment are not allowed.

◆ operator=() [2/2]

ReplicatedMesh& libMesh::ReplicatedMesh::operator= ( ReplicatedMesh && )

delete

◆ own_node()

virtual void libMesh::MeshBase::own_node ( Node & )

inlinevirtualinherited

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 in libMesh::DistributedMesh.

Definition at line 639 of file mesh_base.h.

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

639 {}

◆ parallel_max_unique_id()

unique_id_type libMesh::ReplicatedMesh::parallel_max_unique_id ( ) const

overridevirtual

Returns: A number greater than or equal to the maximum unique_id in the mesh.

Implements libMesh::MeshBase.

Definition at line 592 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, libMesh::ParallelObject::comm(), and libMesh::Parallel::Communicator::max().

Referenced by stitching_helper(), and update_parallel_id_counts().

 {
   // This function must be run on all processors at once
   parallel_object_only();
 
   unique_id_type max_local = _next_unique_id;
   this->comm().max(max_local);
   return max_local;
 }

◆ parallel_n_elem()

virtual dof_id_type libMesh::ReplicatedMesh::parallel_n_elem ( ) const

inlineoverridevirtual

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 118 of file replicated_mesh.h.

References _elements.

119 { return cast_int<dof_id_type>(_elements.size()); }

libMesh::ReplicatedMesh::_elements

std::vector< Elem * > _elements

Definition: replicated_mesh.h:474

◆ parallel_n_nodes()

virtual dof_id_type libMesh::ReplicatedMesh::parallel_n_nodes ( ) const

inlineoverridevirtual

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 106 of file replicated_mesh.h.

References _nodes.

107 { return cast_int<dof_id_type>(_nodes.size()); }

libMesh::ReplicatedMesh::_nodes

std::vector< Node * > _nodes

Definition: replicated_mesh.h:469

◆ partition() [1/2]

void libMesh::MeshBase::partition ( const unsigned int n_parts )

virtualinherited

Call the default partitioner (currently metis_partition()).

Definition at line 426 of file mesh_base.C.

References libMesh::MeshTools::correct_node_proc_ids(), libMesh::MeshBase::is_serial(), libMesh::MeshBase::n_unpartitioned_elem(), libMesh::MeshBase::partitioner(), libMesh::MeshBase::recalculate_n_partitions(), libMesh::MeshBase::skip_partitioning(), and libMesh::MeshBase::update_post_partitioning().

Referenced by libMesh::split_mesh().

 {
   // 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 means don't repartition; skip_partitioning()
   // checks on this.
   // Non-serial meshes may not be ready for repartitioning here.
   else if (!skip_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();
     }
 }

◆ partition() [2/2]

void libMesh::MeshBase::partition ( )

inlineinherited

Definition at line 749 of file mesh_base.h.

References libMesh::ParallelObject::n_processors().

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

750 { this->partition(this->n_processors()); }

libMesh::MeshBase::partition

void partition()

Definition: mesh_base.h:749

libMesh::ParallelObject::n_processors

processor_id_type n_processors() const

Definition: parallel_object.h:95

◆ partitioner()

virtual std::unique_ptr<Partitioner>& libMesh::MeshBase::partitioner ( )

inlinevirtualinherited

A partitioner to use at each prepare_for_use()

Definition at line 126 of file mesh_base.h.

References libMesh::MeshBase::_partitioner.

Referenced by libMesh::MeshBase::partition(), and libMesh::BoundaryInfo::sync().

126 { return _partitioner; }

libMesh::MeshBase::_partitioner

std::unique_ptr< Partitioner > _partitioner

Definition: mesh_base.h:1412

◆ pid_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::pid_elements_begin ( processor_id_type proc_id )

overridevirtual

Iterate over all elements with a specified processor id.

Implements libMesh::MeshBase.

◆ pid_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::pid_elements_begin ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ pid_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::pid_elements_end ( processor_id_type proc_id )

overridevirtual

Implements libMesh::MeshBase.

◆ pid_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::pid_elements_end ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ pid_nodes_begin() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::pid_nodes_begin ( processor_id_type proc_id )

overridevirtual

Iterate over nodes with processor_id() == proc_id

Implements libMesh::MeshBase.

◆ pid_nodes_begin() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::pid_nodes_begin ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ pid_nodes_end() [1/2]

virtual node_iterator libMesh::ReplicatedMesh::pid_nodes_end ( processor_id_type proc_id )

overridevirtual

Implements libMesh::MeshBase.

◆ pid_nodes_end() [2/2]

virtual const_node_iterator libMesh::ReplicatedMesh::pid_nodes_end ( processor_id_type proc_id ) const

overridevirtual

Implements libMesh::MeshBase.

◆ point()

const Point & libMesh::ReplicatedMesh::point ( const dof_id_type i ) const

overridevirtual

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 161 of file replicated_mesh.C.

References libMesh::MeshBase::node_ref().

Referenced by stitching_helper().

 {
   return this->node_ref(i);
 }

◆ point_locator()

const PointLocatorBase & libMesh::MeshBase::point_locator ( ) const

inherited

Returns: A pointer to a PointLocatorBase object for this mesh, constructing a master PointLocator first if necessary.

Deprecated:: This should never be used in threaded or non-parallel_only code.

Definition at line 479 of file mesh_base.C.

References libMesh::MeshBase::_point_locator, libMesh::PointLocatorBase::build(), libMesh::Threads::in_threads, and libMesh::TREE_ELEMENTS.

 {
   libmesh_deprecated();
 
   if (_point_locator.get() == nullptr)
     {
       // PointLocator construction may not be safe within threads
       libmesh_assert(!Threads::in_threads);
 
       _point_locator = PointLocatorBase::build(TREE_ELEMENTS, *this);
     }
 
   return *_point_locator;
 }

◆ prepare_for_use()

void libMesh::MeshBase::prepare_for_use	(	const bool	skip_renumber_nodes_and_elements = `false`,
		const bool	skip_find_neighbors = `false`
	)

inherited

Prepare a newly created (or read) mesh for use. This involves 4 steps: 1.) call find_neighbors() 2.) call partition() 3.) call renumber_nodes_and_elements() 4.) call cache_elem_dims()

The argument to skip renumbering is now deprecated - to prevent a mesh from being renumbered, set allow_renumbering(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 152 of file mesh_base.C.

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshTools::Subdivision::all_subdivision(), libMesh::MeshTools::Modification::all_tri(), libMesh::MeshTools::Generation::build_extrusion(), libMesh::InfElemBuilder::build_inf_elem(), libMesh::MeshRefinement::coarsen_elements(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::UnstructuredMesh::create_submesh(), libMesh::MeshTools::Modification::flatten(), libMesh::MeshTools::Subdivision::prepare_subdivision_mesh(), libMesh::GMVIO::read(), libMesh::UnstructuredMesh::read(), libMesh::MeshRefinement::refine_and_coarsen_elements(), libMesh::MeshRefinement::refine_elements(), stitching_helper(), libMesh::BoundaryInfo::sync(), libMesh::TriangleInterface::triangulate(), libMesh::MeshRefinement::uniformly_coarsen(), and libMesh::MeshRefinement::uniformly_refine().

 {
   LOG_SCOPE("prepare_for_use()", "MeshBase");
 
   parallel_object_only();
 
   libmesh_assert(this->comm().verify(this->is_serial()));
 
   // 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_dims() 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.
   //
   // We may currently change that by passing
   // skip_renumber_nodes_and_elements==true to this function, but we
   // should use the allow_renumbering() accessor instead.
   //
   // 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.
 
   if (skip_renumber_nodes_and_elements)
     {
       libmesh_deprecated();
       this->allow_renumbering(false);
     }
 
   // Mesh modification operations might not leave us with consistent
   // id counts, but our partitioner might need that consistency.
   if (!_skip_renumber_nodes_and_elements)
     this->renumber_nodes_and_elements();
   else
     this->update_parallel_id_counts();
 
   // Let all the elements find their neighbors
   if (!skip_find_neighbors)
     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.
   this->cache_elem_dims();
 
   // Search the mesh for elements that have a neighboring element
   // of dim+1 and set that element as the interior parent
   this->detect_interior_parents();
 
   // 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
 
   // Reset our PointLocator.  Any old locator is invalidated any time
   // the elements in the underlying elements in the mesh have changed,
   // so we clear it here.
   this->clear_point_locator();
 
   // Allow our GhostingFunctor objects to reinit if necessary.
   // Do this before partitioning and redistributing, and before
   // deleting remote elements.
   for (auto & gf : _ghosting_functors)
     {
       libmesh_assert(gf);
       gf->mesh_reinit();
     }
 
   // Partition the mesh.
   this->partition();
 
   // If we're using DistributedMesh, we'll probably want it
   // parallelized.
   if (this->_allow_remote_element_removal)
     this->delete_remote_elements();
 
   if (!_skip_renumber_nodes_and_elements)
     this->renumber_nodes_and_elements();
 
   // The mesh is now prepared for use.
   _is_prepared = true;
 
 #if defined(DEBUG) && defined(LIBMESH_ENABLE_UNIQUE_ID)
   MeshTools::libmesh_assert_valid_boundary_ids(*this);
   MeshTools::libmesh_assert_valid_unique_ids(*this);
 #endif
 }

◆ print_info()

void libMesh::MeshBase::print_info ( std::ostream & os = libMesh::out ) const

inherited

Prints relevant information about the mesh.

Definition at line 412 of file mesh_base.C.

References libMesh::MeshBase::get_info().

Referenced by libMesh::InfElemBuilder::build_inf_elem(), and libMesh::operator<<().

 {
   os << this->get_info()
      << std::endl;
 }

◆ processor_id()

processor_id_type libMesh::ParallelObject::processor_id ( ) const

inlineinherited

Returns: The rank of this processor in the group.

Definition at line 101 of file parallel_object.h.

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

102 { return cast_int<processor_id_type>(_communicator.rank()); }

libMesh::ParallelObject::_communicator

const Parallel::Communicator & _communicator

Definition: parallel_object.h:107

libMesh::Parallel::Communicator::rank

processor_id_type rank() const

Definition: communicator.h:173

◆ query_elem() [1/2]

virtual const Elem* libMesh::MeshBase::query_elem ( const dof_id_type i ) const

inlinevirtualinherited

Returns: A pointer to the $i^{th}$ element, or nullptr if no such element exists in this processor's mesh data structure.

Deprecated:: Use the less confusingly-named query_elem_ptr() instead.

Definition at line 578 of file mesh_base.h.

References libMesh::MeshBase::query_elem_ptr().

   {
     libmesh_deprecated();
     return this->query_elem_ptr(i);
   }

◆ query_elem() [2/2]

virtual Elem* libMesh::MeshBase::query_elem ( const dof_id_type i )

inlinevirtualinherited

Returns: A writable pointer to the $i^{th}$ element, or nullptr if no such element exists in this processor's mesh data structure.

Deprecated:: Use the less confusingly-named query_elem_ptr() instead.

Definition at line 592 of file mesh_base.h.

References libMesh::MeshBase::query_elem_ptr().

   {
     libmesh_deprecated();
     return this->query_elem_ptr(i);
   }

◆ query_elem_ptr() [1/2]

const Elem * libMesh::ReplicatedMesh::query_elem_ptr ( const dof_id_type i ) const

overridevirtual

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 243 of file replicated_mesh.C.

References _elements, and n_elem().

 {
   if (i >= this->n_elem())
     return nullptr;
   libmesh_assert (_elements[i] == nullptr ||
                   _elements[i]->id() == i); // This will change soon
 
   return _elements[i];
 }

◆ query_elem_ptr() [2/2]

Elem * libMesh::ReplicatedMesh::query_elem_ptr ( const dof_id_type i )

overridevirtual

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 256 of file replicated_mesh.C.

References _elements, and n_elem().

 {
   if (i >= this->n_elem())
     return nullptr;
   libmesh_assert (_elements[i] == nullptr ||
                   _elements[i]->id() == i); // This will change soon
 
   return _elements[i];
 }

◆ query_node_ptr() [1/2]

const Node * libMesh::ReplicatedMesh::query_node_ptr ( const dof_id_type i ) const

overridevirtual

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 193 of file replicated_mesh.C.

References _nodes, and n_nodes().

 {
   if (i >= this->n_nodes())
     return nullptr;
   libmesh_assert (_nodes[i] == nullptr ||
                   _nodes[i]->id() == i); // This will change soon
 
   return _nodes[i];
 }

◆ query_node_ptr() [2/2]

Node * libMesh::ReplicatedMesh::query_node_ptr ( const dof_id_type i )

overridevirtual

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 206 of file replicated_mesh.C.

References _nodes, and n_nodes().

 {
   if (i >= this->n_nodes())
     return nullptr;
   libmesh_assert (_nodes[i] == nullptr ||
                   _nodes[i]->id() == i); // This will change soon
 
   return _nodes[i];
 }

◆ 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`
	)

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 603 of file unstructured_mesh.C.

References libMesh::MeshBase::allow_renumbering(), libMesh::Quality::name(), libMesh::MeshBase::prepare_for_use(), and libMesh::NameBasedIO::read().

 {
   // 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 (name.rfind(".gmv") + 4 == name.size())
     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.
   this->prepare_for_use(/*skip_renumber (deprecated)*/ false,
                         skip_find_neighbors);
 }

◆ 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 458 of file mesh_base.C.

References libMesh::MeshBase::_n_parts, libMesh::MeshBase::active_local_element_ptr_range(), libMesh::ParallelObject::comm(), libMesh::MeshBase::elem(), std::max(), libMesh::Parallel::Communicator::max(), and libMesh::DofObject::processor_id().

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

 {
   // 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;
 }

◆ redistribute()

virtual void libMesh::MeshBase::redistribute ( )

inlinevirtualinherited

Redistribute elements between processors. This gets called automatically by the Partitioner, and is a no-op in the case of a ReplicatedMesh or serialized DistributedMesh

Reimplemented in libMesh::DistributedMesh.

Definition at line 757 of file mesh_base.h.

757 {}

◆ 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 281 of file mesh_base.C.

References libMesh::MeshBase::_ghosting_functors.

Referenced by libMesh::DofMap::clear(), libMesh::DofMap::remove_algebraic_ghosting_functor(), libMesh::DofMap::remove_coupling_functor(), and libMesh::DofMap::~DofMap().

 {
   _ghosting_functors.erase(&ghosting_functor);
 }

◆ renumber_elem()

void libMesh::ReplicatedMesh::renumber_elem	(	dof_id_type	old_id,
		dof_id_type	new_id
	)

overridevirtual

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 371 of file replicated_mesh.C.

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

 {
   // This doesn't get used in serial yet
   Elem * el = _elements[old_id];
   libmesh_assert (el);
 
   el->set_id(new_id);
   libmesh_assert (!_elements[new_id]);
   _elements[new_id] = el;
   _elements[old_id] = nullptr;
 }

◆ renumber_node()

void libMesh::ReplicatedMesh::renumber_node	(	dof_id_type	old_id,
		dof_id_type	new_id
	)

overridevirtual

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 541 of file replicated_mesh.C.

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

 {
   // This doesn't get used in serial yet
   Node * nd = _nodes[old_id];
   libmesh_assert (nd);
 
   nd->set_id(new_id);
   libmesh_assert (!_nodes[new_id]);
   _nodes[new_id] = nd;
   _nodes[old_id] = nullptr;
 }

◆ renumber_nodes_and_elements()

void libMesh::ReplicatedMesh::renumber_nodes_and_elements ( )

overridevirtual

Remove nullptr elements from arrays

Implements libMesh::MeshBase.

Definition at line 605 of file replicated_mesh.C.

References _elements, _nodes, libMesh::MeshBase::_skip_renumber_nodes_and_elements, libMesh::as_range(), end, libMesh::MeshBase::get_boundary_info(), libMesh::MeshBase::node(), libMesh::Elem::node_ref_range(), libMesh::BoundaryInfo::remove(), libMesh::DofObject::set_id(), swap(), and update_parallel_id_counts().

 {
   LOG_SCOPE("renumber_nodes_and_elem()", "Mesh");
 
   // node and element id counters
   dof_id_type next_free_elem = 0;
   dof_id_type next_free_node = 0;
 
   // Will hold the set of nodes that are currently connected to elements
   std::unordered_set<Node *> connected_nodes;
 
   // Loop over the elements.  Note that there may
   // be nullptrs in the _elements vector from the coarsening
   // process.  Pack the elements in to a contiguous array
   // and then trim any excess.
   {
     std::vector<Elem *>::iterator in        = _elements.begin();
     std::vector<Elem *>::iterator out_iter  = _elements.begin();
     const std::vector<Elem *>::iterator end = _elements.end();
 
     for (; in != end; ++in)
       if (*in != nullptr)
         {
           Elem * el = *in;
 
           *out_iter = *in;
           ++out_iter;
 
           // Increment the element counter
           el->set_id (next_free_elem++);
 
           if (_skip_renumber_nodes_and_elements)
             {
               // Add this elements nodes to the connected list
               for (auto & n : el->node_ref_range())
                 connected_nodes.insert(&n);
             }
           else  // We DO want node renumbering
             {
               // Loop over this element's nodes.  Number them,
               // if they have not been numbered already.  Also,
               // position them in the _nodes vector so that they
               // are packed contiguously from the beginning.
               for (auto & n : el->node_ref_range())
                 if (n.id() == next_free_node)    // don't need to process
                   next_free_node++;                      // [(src == dst) below]
 
                 else if (n.id() > next_free_node) // need to process
                   {
                     // The source and destination indices
                     // for this node
                     const dof_id_type src_idx = n.id();
                     const dof_id_type dst_idx = next_free_node++;
 
                     // ensure we want to swap a valid nodes
                     libmesh_assert(_nodes[src_idx]);
 
                     // Swap the source and destination nodes
                     std::swap(_nodes[src_idx],
                               _nodes[dst_idx] );
 
                     // Set proper indices where that makes sense
                     if (_nodes[src_idx] != nullptr)
                       _nodes[src_idx]->set_id (src_idx);
                     _nodes[dst_idx]->set_id (dst_idx);
                   }
             }
         }
 
     // Erase any additional storage. These elements have been
     // copied into nullptr voids by the procedure above, and are
     // thus repeated and unnecessary.
     _elements.erase (out_iter, end);
   }
 
 
   if (_skip_renumber_nodes_and_elements)
     {
       // Loop over the nodes.  Note that there may
       // be nullptrs in the _nodes vector from the coarsening
       // process.  Pack the nodes in to a contiguous array
       // and then trim any excess.
 
       std::vector<Node *>::iterator in        = _nodes.begin();
       std::vector<Node *>::iterator out_iter  = _nodes.begin();
       const std::vector<Node *>::iterator end = _nodes.end();
 
       for (; in != end; ++in)
         if (*in != nullptr)
           {
             // This is a reference so that if we change the pointer it will change in the vector
             Node * & nd = *in;
 
             // If this node is still connected to an elem, put it in the list
             if (connected_nodes.find(nd) != connected_nodes.end())
               {
                 *out_iter = nd;
                 ++out_iter;
 
                 // Increment the node counter
                 nd->set_id (next_free_node++);
               }
             else // This node is orphaned, delete it!
               {
                 this->get_boundary_info().remove (nd);
 
                 // delete the node
                 delete nd;
                 nd = nullptr;
               }
           }
 
       // Erase any additional storage.  Whatever was
       _nodes.erase (out_iter, end);
     }
   else // We really DO want node renumbering
     {
       // Any nodes in the vector >= _nodes[next_free_node]
       // are not connected to any elements and may be deleted
       // if desired.
 
       // Now, delete the unused nodes
       {
         std::vector<Node *>::iterator nd        = _nodes.begin();
         const std::vector<Node *>::iterator end = _nodes.end();
 
         std::advance (nd, next_free_node);
 
         for (auto & node : as_range(nd, end))
           {
             // Mesh modification code might have already deleted some
             // nodes
             if (node == nullptr)
               continue;
 
             // remove any boundary information associated with
             // this node
             this->get_boundary_info().remove (node);
 
             // delete the node
             delete node;
             node = nullptr;
           }
 
         _nodes.erase (nd, end);
       }
     }
 
   libmesh_assert_equal_to (next_free_elem, _elements.size());
   libmesh_assert_equal_to (next_free_node, _nodes.size());
 
   this->update_parallel_id_counts();
 }

◆ reserve_elem()

virtual void libMesh::ReplicatedMesh::reserve_elem ( const dof_id_type ne )

inlineoverridevirtual

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 130 of file replicated_mesh.h.

References _elements.

131 { _elements.reserve (ne); }

libMesh::ReplicatedMesh::_elements

std::vector< Elem * > _elements

Definition: replicated_mesh.h:474

◆ reserve_nodes()

virtual void libMesh::ReplicatedMesh::reserve_nodes ( const dof_id_type nn )

inlineoverridevirtual

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 112 of file replicated_mesh.h.

References _nodes.

113 { _nodes.reserve (nn); }

libMesh::ReplicatedMesh::_nodes

std::vector< Node * > _nodes

Definition: replicated_mesh.h:469

◆ semilocal_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::semilocal_elements_begin ( )

overridevirtual

Iterate over elements for which elem->is_semilocal() is true for the current processor.

Implements libMesh::MeshBase.

◆ semilocal_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::semilocal_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ semilocal_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::semilocal_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ semilocal_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::semilocal_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ 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 524 of file mesh_base.C.

References libMesh::MeshBase::_count_lower_dim_elems_in_point_locator.

 {
   _count_lower_dim_elems_in_point_locator = count_lower_dim_elems;
 }

◆ set_distributed()

virtual void libMesh::MeshBase::set_distributed ( )

inlinevirtualinherited

Asserts that not all elements and nodes of the mesh necessarily exist on the current processor. Only valid to call on classes which can be created in a distributed form.

Reimplemented in libMesh::DistributedMesh.

Definition at line 169 of file mesh_base.h.

Referenced by libMesh::CheckpointIO::read().

170 { libmesh_error(); }

◆ 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 213 of file mesh_base.h.

References libMesh::MeshBase::_elem_dims.

Referenced by libMesh::MeshTools::Generation::build_delaunay_square(), libMesh::TriangleWrapper::copy_tri_to_mesh(), libMesh::AbaqusIO::read(), libMesh::Nemesis_IO::read(), libMesh::ExodusII_IO::read(), libMesh::GMVIO::read(), libMesh::VTKIO::read(), libMesh::CheckpointIO::read_connectivity(), libMesh::CheckpointIO::read_header(), libMesh::UCDIO::read_implementation(), libMesh::GmshIO::read_mesh(), libMesh::XdrIO::read_serialized_connectivity(), libMesh::OFFIO::read_stream(), libMesh::MatlabIO::read_stream(), and libMesh::TriangleInterface::triangulate().

214 { _elem_dims.clear(); _elem_dims.insert(d); }

libMesh::MeshBase::_elem_dims

std::set< unsigned char > _elem_dims

Definition: mesh_base.h:1453

◆ set_n_partitions()

unsigned int& libMesh::MeshBase::set_n_partitions ( )

inlineprotectedinherited

Returns: A writable reference to the number of partitions.

Definition at line 1371 of file mesh_base.h.

References libMesh::MeshBase::_n_parts.

Referenced by libMesh::BoundaryInfo::sync().

1372 { return _n_parts; }

libMesh::MeshBase::_n_parts

unsigned int _n_parts

Definition: mesh_base.h:1384

◆ set_next_unique_id()

void libMesh::MeshBase::set_next_unique_id ( unique_id_type id )

inlineinherited

Sets the next unique id to be used.

Definition at line 310 of file mesh_base.h.

References libMesh::MeshBase::_next_unique_id.

310 { _next_unique_id = id; }

libMesh::MeshBase::_next_unique_id

unique_id_type _next_unique_id

Definition: mesh_base.h:1418

◆ 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 142 of file mesh_base.C.

References libMesh::MeshBase::_spatial_dimension.

 {
   // The user can set the _spatial_dimension however they wish,
   // libMesh will only *increase* the spatial dimension, however,
   // never decrease it.
   _spatial_dimension = d;
 }

◆ 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 1335 of file mesh_base.h.

References libMesh::MeshBase::_block_id_to_name.

Referenced by libMesh::CheckpointIO::read_header(), libMesh::XdrIO::read_serialized_subdomain_names(), and libMesh::CheckpointIO::read_subdomain_names().

1336 { return _block_id_to_name; }

libMesh::MeshBase::_block_id_to_name

std::map< subdomain_id_type, std::string > _block_id_to_name

Definition: mesh_base.h:1446

◆ skip_partitioning() [1/2]

void libMesh::MeshBase::skip_partitioning ( bool skip )

inlineinherited

If true is passed in then this mesh will no longer be (re)partitioned. 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.

Note: Turning on skip_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 partitioning by resetting the partitioner() pointer for this mesh.

Definition at line 811 of file mesh_base.h.

References libMesh::MeshBase::_skip_partitioning.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::MeshTools::correct_node_proc_ids().

811 { _skip_partitioning = skip; }

libMesh::MeshBase::_skip_partitioning

bool _skip_partitioning

Definition: mesh_base.h:1424

◆ skip_partitioning() [2/2]

bool libMesh::MeshBase::skip_partitioning ( ) const

inlineinherited

Definition at line 812 of file mesh_base.h.

References libMesh::MeshBase::_partitioner, and libMesh::MeshBase::_skip_partitioning.

Referenced by libMesh::UnstructuredMesh::copy_nodes_and_elements(), and libMesh::MeshBase::partition().

812 { return _skip_partitioning || !_partitioner.get(); }

libMesh::MeshBase::_skip_partitioning

bool _skip_partitioning

Definition: mesh_base.h:1424

libMesh::MeshBase::_partitioner

std::unique_ptr< Partitioner > _partitioner

Definition: mesh_base.h:1412

◆ spatial_dimension()

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

inherited

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 prepare_for_use() based on the dimensions of the various elements present in the Mesh, but is never automatically decreased by this function.

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(). 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 135 of file mesh_base.C.

References libMesh::MeshBase::_spatial_dimension.

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

 {
   return cast_int<unsigned int>(_spatial_dimension);
 }

◆ stitch_meshes()

void libMesh::ReplicatedMesh::stitch_meshes	(	const ReplicatedMesh &	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`
	)

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 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.

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.

Definition at line 775 of file replicated_mesh.C.

References stitching_helper().

 {
   LOG_SCOPE("stitch_meshes()", "ReplicatedMesh");
   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);
 }

◆ stitch_surfaces()

void libMesh::ReplicatedMesh::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`
	)

Similar to stitch_meshes, except that we stitch two adjacent surfaces within this mesh.

Definition at line 796 of file replicated_mesh.C.

References stitching_helper().

 {
   stitching_helper(nullptr,
                    boundary_id_1,
                    boundary_id_2,
                    tol,
                    clear_stitched_boundary_ids,
                    verbose,
                    use_binary_search,
                    enforce_all_nodes_match_on_boundaries,
                    true);
 }

◆ stitching_helper()

void libMesh::ReplicatedMesh::stitching_helper	(	const ReplicatedMesh *	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
	)

private

Helper function for stitch_meshes and stitch_surfaces that does the mesh stitching.

Definition at line 815 of file replicated_mesh.C.

Referenced by stitch_meshes(), and stitch_surfaces().

 {
   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<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", "ReplicatedMesh");
 
       // 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<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 ReplicatedMesh * 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.
             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 );
 
                         // We need to set h_min to some value. It's too expensive to
                         // search for the element that actually contains this node,
                         // since that would require a PointLocator. As a result, we
                         // just use the first element in the mesh to give us hmin.
                         const Elem * first_active_elem = *mesh_array[i]->active_elements_begin();
                         h_min = first_active_elem->hmin();
                         h_min_updated = true;
                       }
                   }
               }
 
             // Container to catch boundary IDs passed back from BoundaryInfo.
             std::vector<boundary_id_type> bc_ids;
 
             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())
                   if (el->neighbor_ptr(side_id) == nullptr)
                     {
                       // 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->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<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;
                                 }
                             }
                         }
                     }
               }
           }
       }
 
       if (verbose)
         {
           libMesh::out << "In ReplicatedMesh::stitch_meshes:\n"
                        << "This mesh has "  << this_boundary_node_ids.size()
                        << " nodes on boundary " << this_mesh_boundary_id  << ".\n"
                        << "Other mesh has " << other_boundary_node_ids.size()
                        << " nodes on boundary " << 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 elements on specified surfaces." << std::endl;
             }
         }
 
 
       if (use_binary_search)
         {
           // Store points from both stitched faces in sorted vectors for faster
           // searching later.
           typedef std::vector<std::pair<Point, dof_id_type>> PointVector;
           PointVector
             this_sorted_bndry_nodes(this_boundary_node_ids.size()),
             other_sorted_bndry_nodes(other_boundary_node_ids.size());
 
           // Comparison object that will be used later. So far, I've had reasonable success
           // with TOLERANCE...
           FuzzyPointCompare mein_comp(TOLERANCE);
 
           // Create and sort the vectors we will use to do the geometric searching
           {
             std::set<dof_id_type> * set_array[2] = {&this_boundary_node_ids, &other_boundary_node_ids};
             const ReplicatedMesh * mesh_array[2] = {this, other_mesh};
             PointVector * vec_array[2]           = {&this_sorted_bndry_nodes, &other_sorted_bndry_nodes};
 
             for (unsigned i=0; i<2; ++i)
               {
                 std::set<dof_id_type>::iterator
                   set_it     = set_array[i]->begin(),
                   set_it_end = set_array[i]->end();
 
                 // Fill up the vector with the contents of the set...
                 for (unsigned ctr=0; set_it != set_it_end; ++set_it, ++ctr)
                   {
                     (*vec_array[i])[ctr] = std::make_pair(mesh_array[i]->point(*set_it), // The geometric point
                                                           *set_it);                      // Its ID
                   }
 
                 // Sort the vectors based on the FuzzyPointCompare struct op()
                 std::sort(vec_array[i]->begin(), vec_array[i]->end(), mein_comp);
               }
           }
 
           // Build up the node_to_node_map and node_to_elems_map using the sorted vectors of Points.
           for (std::size_t i=0; i<this_sorted_bndry_nodes.size(); ++i)
             {
               // Current point we're working on
               Point this_point = this_sorted_bndry_nodes[i].first;
 
               // FuzzyPointCompare does a fuzzy equality comparison internally to handle
               // slight differences between the list of nodes on each mesh.
               PointVector::iterator other_iter = Utility::binary_find(other_sorted_bndry_nodes.begin(),
                                                                       other_sorted_bndry_nodes.end(),
                                                                       this_point,
                                                                       mein_comp);
 
               // Not every node on this_sorted_bndry_nodes will necessarily be stitched, so
               // if its pair is not found on other_mesh, just continue.
               if (other_iter != other_sorted_bndry_nodes.end())
                 {
                   // Check that the points do indeed match - should not be necessary unless something
                   // is wrong with binary_find.  To be on the safe side, we'll check.
                   {
                     // Grab the other point from the iterator
                     Point other_point = other_iter->first;
 
                     if (!this_point.absolute_fuzzy_equals(other_point, tol*h_min))
                       libmesh_error_msg("Error: mismatched points: " << this_point << " and " << other_point);
                   }
 
 
                   // Associate these two nodes in both the node_to_node_map and the other_to_this_node_map
                   dof_id_type
                     this_node_id = this_sorted_bndry_nodes[i].second,
                     other_node_id = other_iter->second;
                   node_to_node_map[this_node_id] = other_node_id;
                   other_to_this_node_map[other_node_id] = this_node_id;
                 }
 
             }
         }
       else
         {
           // 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!
                       if (found_matching_nodes)
                         libmesh_error_msg("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())
             {
               dof_id_type other_node_id = n.id();
               std::map<dof_id_type, dof_id_type>::iterator it =
                 other_to_this_node_map.find(other_node_id);
 
               if (it != other_to_this_node_map.end())
                 {
                   dof_id_type this_node_id = it->second;
                   node_to_elems_map[this_node_id].push_back( el->id() );
                 }
             }
         }
 
       if (verbose)
         {
           libMesh::out << "In ReplicatedMesh::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();
           if ((n_matching_nodes != this_mesh_n_nodes) || (n_matching_nodes != other_mesh_n_nodes))
             libmesh_error_msg("Error: We expected the number of nodes to match.");
         }
     }
   else
     {
       if (verbose)
         {
           libMesh::out << "Skip node merging in ReplicatedMesh::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", "ReplicatedMesh");
 
       // 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;
 
       // 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);
 
       // 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));
 
     } // 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", "ReplicatedMesh");
 
     // Container to catch boundary IDs passed back from BoundaryInfo.
     std::vector<boundary_id_type> bc_ids;
 
     for (const auto & pr : node_to_elems_map)
       {
         dof_id_type target_node_id = pr.first;
         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 = pr.second.size();
         for (std::size_t i=0; i<n_elems; i++)
           {
             dof_id_type elem_id = pr.second[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", "ReplicatedMesh");
     for (const auto & pr : 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) && (pr.second == pr.first))
           continue;
 
         dof_id_type this_node_id = pr.second;
         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", "ReplicatedMesh");
 
       // Pull objects out of the loop to reduce heap operations
       std::unique_ptr<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.find(elem_id) == fixed_elems.end())
                 {
                   Elem * el = this->elem_ptr(elem_id);
                   fixed_elems.insert(elem_id);
                   for (auto s : el->side_index_range())
                     {
                       if (el->neighbor_ptr(s) == nullptr)
                         {
                           key_type key = el->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 = 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;
                                 }
                             }
                         }
                     }
                 }
             }
         }
     }
 
   this->prepare_for_use( /*skip_renumber_nodes_and_elements= */ false, skip_find_neighbors);
 
   // 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", "ReplicatedMesh");
 
       // Container to catch boundary IDs passed back from BoundaryInfo.
       std::vector<boundary_id_type> bc_ids;
 
       for (auto & el : element_ptr_range())
         for (auto side_id : el->side_index_range())
           if (el->neighbor_ptr(side_id) != nullptr)
             {
               // Completely remove the side from the boundary_info object if it has either
               // this_mesh_boundary_id or other_mesh_boundary_id.
               this->get_boundary_info().boundary_ids (el, side_id, bc_ids);
 
               if (std::find(bc_ids.begin(), bc_ids.end(), this_mesh_boundary_id) != bc_ids.end() ||
                   std::find(bc_ids.begin(), bc_ids.end(), other_mesh_boundary_id) != bc_ids.end())
                 this->get_boundary_info().remove_side(el, side_id);
             }
 
       // Removing stitched-away boundary ids might have removed an id
       // *entirely*, so we need to recompute boundary id sets to check
       // for that.
       this->get_boundary_info().regenerate_id_sets();
     }
 }

◆ 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 496 of file mesh_base.C.

References libMesh::MeshBase::_point_locator, libMesh::PointLocatorBase::build(), libMesh::Threads::in_threads, and libMesh::TREE_ELEMENTS.

Referenced by libMesh::DofMap::create_dof_constraints(), libMesh::MeshFunction::init(), libMesh::MeshTools::libmesh_assert_consistent_distributed_nodes(), libMesh::MeshRefinement::make_coarsening_compatible(), libMesh::MeshRefinement::make_refinement_compatible(), libMesh::DefaultCoupling::mesh_reinit(), libMesh::PointNeighborCoupling::mesh_reinit(), and libMesh::MeshRefinement::test_level_one().

 {
   // 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();
 
       _point_locator = PointLocatorBase::build(TREE_ELEMENTS, *this);
     }
 
   // Otherwise there was a master point locator, and we can grab a
   // sub-locator easily.
   return PointLocatorBase::build(TREE_ELEMENTS, *this, _point_locator.get());
 }

◆ subactive_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::subactive_elements_begin ( )

overridevirtual

Iterate over elements for which elem->subactive() is true.

Implements libMesh::MeshBase.

◆ subactive_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::subactive_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ subactive_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::subactive_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ subactive_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::subactive_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ subdomain_ids()

void libMesh::MeshBase::subdomain_ids ( std::set< subdomain_id_type > & ids ) const

inherited

Constructs a list of all subdomain identifiers 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 288 of file mesh_base.C.

References libMesh::MeshBase::active_local_element_ptr_range(), libMesh::ParallelObject::comm(), libMesh::MeshBase::elem(), libMesh::Parallel::Communicator::set_union(), and libMesh::Elem::subdomain_id().

Referenced by libMesh::MeshBase::n_subdomains(), and libMesh::TecplotIO::TecplotIO().

 {
   // This requires an inspection on every processor
   parallel_object_only();
 
   ids.clear();
 
   for (const auto & elem : this->active_local_element_ptr_range())
     ids.insert(elem->subdomain_id());
 
   // Some subdomains may only live on other processors
   this->comm().set_union(ids);
 }

◆ subdomain_name() [1/2]

std::string & libMesh::MeshBase::subdomain_name ( subdomain_id_type id )

inherited

Returns: A writable reference for getting/setting an optional name for a subdomain.

Definition at line 538 of file mesh_base.C.

References libMesh::MeshBase::_block_id_to_name.

Referenced by libMesh::AbaqusIO::assign_subdomain_ids(), DMlibMeshSetSystem_libMesh(), libMesh::UNVIO::groups_in(), libMesh::ExodusII_IO::read(), libMesh::GmshIO::read_mesh(), libMesh::TecplotIO::write_binary(), and libMesh::ExodusII_IO_Helper::write_elements().

 {
   return _block_id_to_name[id];
 }

◆ subdomain_name() [2/2]

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

inherited

Definition at line 543 of file mesh_base.C.

References libMesh::MeshBase::_block_id_to_name.

 {
   // An empty string to return when no matching subdomain name is found
   static const std::string empty;
 
   std::map<subdomain_id_type, std::string>::const_iterator iter = _block_id_to_name.find(id);
   if (iter == _block_id_to_name.end())
     return empty;
   else
     return iter->second;
 }

◆ type_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::type_elements_begin ( ElemType type )

overridevirtual

Iterate over all elements with a specified geometric type.

Implements libMesh::MeshBase.

◆ type_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::type_elements_begin ( ElemType type ) const

overridevirtual

Implements libMesh::MeshBase.

◆ type_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::type_elements_end ( ElemType type )

overridevirtual

Implements libMesh::MeshBase.

◆ type_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::type_elements_end ( ElemType type ) const

overridevirtual

Implements libMesh::MeshBase.

◆ unpartitioned_elements_begin() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::unpartitioned_elements_begin ( )

overridevirtual

Iterate over unpartitioned elements in the Mesh.

Implements libMesh::MeshBase.

◆ unpartitioned_elements_begin() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::unpartitioned_elements_begin ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ unpartitioned_elements_end() [1/2]

virtual element_iterator libMesh::ReplicatedMesh::unpartitioned_elements_end ( )

overridevirtual

Implements libMesh::MeshBase.

◆ unpartitioned_elements_end() [2/2]

virtual const_element_iterator libMesh::ReplicatedMesh::unpartitioned_elements_end ( ) const

overridevirtual

Implements libMesh::MeshBase.

◆ update_parallel_id_counts()

void libMesh::ReplicatedMesh::update_parallel_id_counts ( )

overridevirtual

Updates parallel caches so that methods like n_elem() accurately reflect changes on other processors

Implements libMesh::MeshBase.

Definition at line 582 of file replicated_mesh.C.

References libMesh::MeshBase::_next_unique_id, and parallel_max_unique_id().

Referenced by renumber_nodes_and_elements().

 {
 #ifdef LIBMESH_ENABLE_UNIQUE_ID
   _next_unique_id = this->parallel_max_unique_id();
 #endif
 }

◆ update_post_partitioning()

virtual void libMesh::MeshBase::update_post_partitioning ( )

inlinevirtualinherited

Recalculate any cached data after elements and nodes have been repartitioned.

Reimplemented in libMesh::DistributedMesh.

Definition at line 763 of file mesh_base.h.

Referenced by libMesh::MeshBase::partition(), and libMesh::Nemesis_IO::read().

763 {}

◆ write() [1/2]

void libMesh::UnstructuredMesh::write ( const std::string & name )

overridevirtualinherited

Write the file specified by name. Attempts to figure out the proper method by the file extension.

Implements libMesh::MeshBase.

Definition at line 633 of file unstructured_mesh.C.

References libMesh::Quality::name(), and libMesh::NameBasedIO::write().

 {
   LOG_SCOPE("write()", "Mesh");
 
   NameBasedIO(*this).write(name);
 }

◆ write() [2/2]

void libMesh::UnstructuredMesh::write	(	const std::string &	name,
		const std::vector< Number > &	values,
		const std::vector< std::string > &	variable_names
	)

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 642 of file unstructured_mesh.C.

References libMesh::Quality::name(), and libMesh::NameBasedIO::write_nodal_data().

 {
   LOG_SCOPE("write()", "Mesh");
 
   NameBasedIO(*this).write_nodal_data(name, v, vn);
 }

Member Data Documentation

◆ _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 1439 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_remote_element_removal(), 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 1446 of file mesh_base.h.

Referenced by libMesh::MeshBase::get_id_by_name(), libMesh::MeshBase::get_subdomain_name_map(), libMesh::MeshBase::set_subdomain_name_map(), and libMesh::MeshBase::subdomain_name().

◆ _communicator

const Parallel::Communicator& libMesh::ParallelObject::_communicator

protectedinherited

Definition at line 107 of file parallel_object.h.

Referenced by libMesh::EquationSystems::build_parallel_elemental_solution_vector(), libMesh::EquationSystems::build_parallel_solution_vector(), libMesh::ParallelObject::comm(), libMesh::ParallelObject::n_processors(), libMesh::ParallelObject::operator=(), and libMesh::ParallelObject::processor_id().

◆ _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 1404 of file mesh_base.h.

Referenced by libMesh::MeshBase::get_count_lower_dim_elems_in_point_locator(), 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 1466 of file mesh_base.h.

Referenced by libMesh::MeshBase::default_ghosting(), and libMesh::MeshBase::MeshBase().

◆ _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 1453 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_dims(), libMesh::MeshBase::clear(), libMesh::MeshBase::elem_dimensions(), libMesh::MeshBase::get_info(), libMesh::MeshBase::mesh_dimension(), libMesh::MeshBase::MeshBase(), and libMesh::MeshBase::set_mesh_dimension().

◆ _elements

std::vector<Elem *> libMesh::ReplicatedMesh::_elements

protected

The elements in the mesh.

Definition at line 474 of file replicated_mesh.h.

Referenced by add_elem(), clear(), delete_elem(), elem_ptr(), fix_broken_node_and_element_numbering(), insert_elem(), max_elem_id(), n_elem(), parallel_n_elem(), query_elem_ptr(), renumber_elem(), renumber_nodes_and_elements(), and reserve_elem().

◆ _ghosting_functors

std::set<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 1475 of file mesh_base.h.

Referenced by libMesh::MeshBase::add_ghosting_functor(), libMesh::MeshBase::ghosting_functors_begin(), libMesh::MeshBase::ghosting_functors_end(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::prepare_for_use(), and libMesh::MeshBase::remove_ghosting_functor().

◆ _is_prepared

bool libMesh::MeshBase::_is_prepared

protectedinherited

Flag indicating if the mesh has been prepared for use.

Definition at line 1389 of file mesh_base.h.

Referenced by libMesh::UnstructuredMesh::all_first_order(), libMesh::UnstructuredMesh::all_second_order(), libMesh::MeshBase::clear(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::is_prepared(), and libMesh::MeshBase::prepare_for_use().

◆ _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 1384 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear(), libMesh::UnstructuredMesh::copy_nodes_and_elements(), libMesh::MeshBase::n_partitions(), libMesh::MeshBase::recalculate_n_partitions(), and libMesh::MeshBase::set_n_partitions().

◆ _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 1418 of file mesh_base.h.

Referenced by add_elem(), libMesh::DistributedMesh::add_elem(), add_node(), libMesh::DistributedMesh::add_node(), add_point(), libMesh::DistributedMesh::DistributedMesh(), insert_elem(), libMesh::DistributedMesh::insert_elem(), insert_node(), libMesh::MeshBase::next_unique_id(), parallel_max_unique_id(), libMesh::DistributedMesh::parallel_max_unique_id(), ReplicatedMesh(), libMesh::MeshBase::set_next_unique_id(), update_parallel_id_counts(), and libMesh::DistributedMesh::update_parallel_id_counts().

◆ _nodes

std::vector<Node *> libMesh::ReplicatedMesh::_nodes

protected

The vertices (spatial coordinates) of the mesh.

Definition at line 469 of file replicated_mesh.h.

Referenced by add_node(), add_point(), clear(), delete_node(), fix_broken_node_and_element_numbering(), insert_node(), max_node_id(), n_nodes(), node_ptr(), parallel_n_nodes(), query_node_ptr(), renumber_node(), renumber_nodes_and_elements(), and reserve_nodes().

◆ _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 1412 of file mesh_base.h.

Referenced by libMesh::DistributedMesh::DistributedMesh(), libMesh::MeshBase::MeshBase(), libMesh::MeshBase::partitioner(), ReplicatedMesh(), and libMesh::MeshBase::skip_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 1398 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear_point_locator(), libMesh::MeshBase::point_locator(), and libMesh::MeshBase::sub_point_locator().

◆ _skip_partitioning

bool libMesh::MeshBase::_skip_partitioning

protectedinherited

If this is true then no partitioning should be done.

Definition at line 1424 of file mesh_base.h.

Referenced by libMesh::MeshBase::skip_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 1431 of file mesh_base.h.

Referenced by libMesh::MeshBase::allow_renumbering(), libMesh::MeshBase::prepare_for_use(), renumber_nodes_and_elements(), and libMesh::DistributedMesh::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 1459 of file mesh_base.h.

Referenced by libMesh::MeshBase::cache_elem_dims(), libMesh::MeshBase::set_spatial_dimension(), and libMesh::MeshBase::spatial_dimension().

◆ boundary_info

std::unique_ptr<BoundaryInfo> libMesh::MeshBase::boundary_info

inherited

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 will be removed in future libMesh versions. Use the get_boundary_info() accessor instead.

Definition at line 1363 of file mesh_base.h.

Referenced by libMesh::MeshBase::clear(), and libMesh::MeshBase::get_boundary_info().

The documentation for this class was generated from the following files:

Public Types

Public Member Functions

Public Attributes

Protected Member Functions

Protected Attributes

Private Types

Private Member Functions

Detailed Description

Member Typedef Documentation

◆ const_elem_iterator_imp

◆ const_node_iterator_imp

◆ elem_iterator_imp

◆ node_iterator_imp

◆ Predicate

Constructor & Destructor Documentation

◆ ReplicatedMesh() [1/4]

◆ ReplicatedMesh() [2/4]

◆ ReplicatedMesh() [3/4]

◆ ReplicatedMesh() [4/4]

◆ ~ReplicatedMesh()

Member Function Documentation

◆ active_element_ptr_range() [1/2]

◆ active_element_ptr_range() [2/2]

◆ active_elements_begin() [1/2]

◆ active_elements_begin() [2/2]

◆ active_elements_end() [1/2]

◆ active_elements_end() [2/2]

◆ active_local_element_ptr_range() [1/2]

◆ active_local_element_ptr_range() [2/2]

◆ active_local_elements_begin() [1/2]

◆ active_local_elements_begin() [2/2]

◆ active_local_elements_end() [1/2]

◆ active_local_elements_end() [2/2]

◆ active_local_subdomain_elements_begin() [1/2]

◆ active_local_subdomain_elements_begin() [2/2]

◆ active_local_subdomain_elements_end() [1/2]

◆ active_local_subdomain_elements_end() [2/2]

◆ active_nodes_begin() [1/2]

◆ active_nodes_begin() [2/2]

◆ active_nodes_end() [1/2]

◆ active_nodes_end() [2/2]

◆ active_not_local_elements_begin() [1/2]

◆ active_not_local_elements_begin() [2/2]

◆ active_not_local_elements_end() [1/2]

◆ active_not_local_elements_end() [2/2]

◆ active_pid_elements_begin() [1/2]

◆ active_pid_elements_begin() [2/2]

◆ active_pid_elements_end() [1/2]

◆ active_pid_elements_end() [2/2]

◆ active_semilocal_elements_begin() [1/2]

◆ active_semilocal_elements_begin() [2/2]

◆ active_semilocal_elements_end() [1/2]

◆ active_semilocal_elements_end() [2/2]

◆ active_subdomain_elements_begin() [1/2]

◆ active_subdomain_elements_begin() [2/2]

◆ active_subdomain_elements_end() [1/2]

◆ active_subdomain_elements_end() [2/2]

◆ active_subdomain_set_elements_begin() [1/2]

◆ active_subdomain_set_elements_begin() [2/2]

◆ active_subdomain_set_elements_end() [1/2]

◆ active_subdomain_set_elements_end() [2/2]

◆ active_type_elements_begin() [1/2]

◆ active_type_elements_begin() [2/2]

◆ active_type_elements_end() [1/2]

◆ active_type_elements_end() [2/2]

◆ active_unpartitioned_elements_begin() [1/2]

◆ active_unpartitioned_elements_begin() [2/2]

◆ active_unpartitioned_elements_end() [1/2]

◆ active_unpartitioned_elements_end() [2/2]

◆ add_elem()

◆ add_ghosting_functor()

◆ add_node()

◆ add_point()

◆ all_first_order()

◆ all_second_order()

◆ allgather()

◆ allow_remote_element_removal() [1/2]

◆ allow_remote_element_removal() [2/2]

◆ allow_renumbering() [1/2]

◆ allow_renumbering() [2/2]