70 void updatePatch(std::vector<dof_id_type> & secondary_nodes);
boundary_id_type BoundaryID
MooseMesh wraps a libMesh::Mesh object and enhances its capabilities by caching additional data and s...
Data structure used to hold nearest node info.
const Node * _nearest_node
Finds the nearest node to each node in boundary1 to each node in boundary2 and the other way around.
const Moose::PatchUpdateType _patch_update_strategy
static const unsigned int _patch_size
const Node * nearestNode(dof_id_type node_id)
Valid to call this after findNodes() has been called to get a pointer to the nearest node.
std::map< dof_id_type, std::vector< dof_id_type > > _neighbor_nodes
Real _max_patch_percentage
std::unique_ptr< NodeIdRange > _secondary_node_range
std::vector< dof_id_type > & secondaryNodes()
Returns the list of secondary nodes this Locator is tracking.
NodeIdRange & secondaryNodeRange()
Returns the NodeIdRange of secondary nodes to be used for calling threaded functions operating on the...
std::vector< dof_id_type > _new_ghosted_elems
void updatePatch(std::vector< dof_id_type > &secondary_nodes)
Reconstructs the KDtree, updates the patch for the nodes in secondary_nodes, and updates the closest ...
Real distance(dof_id_type node_id)
Valid to call this after findNodes() has been called to get the distance to the nearest node.
std::vector< dof_id_type > _secondary_nodes
void reinit()
Completely redo the search from scratch.
std::map< dof_id_type, NearestNodeInfo > _nearest_node_info
void findNodes()
This is the main method that is going to start the search.
void updateGhostedElems()
Updates the ghosted elements at the start of the time step for iteration patch update strategy.
Interface for objects interacting with the PerfGraph.
A class for creating restricted objects.
Generic class for solving transient nonlinear problems.
PatchUpdateType
Type of patch update strategy for modeling node-face constraints or contact.