| 
| 
constexpr Option  | operator| (Option a, Option b) | 
|   | Combine two refinement options into one, both flags will be set for the resulting option. 
  | 
|   | 
| 
constexpr bool  | option_parent_facet (Option a) | 
|   | Check if parent_facet flag is set. 
  | 
|   | 
| 
constexpr bool  | option_parent_cell (Option a) | 
|   | Check if parent_cell flag is set. 
  | 
|   | 
| template<std::floating_point T>  | 
| std::tuple< mesh::Mesh< T >, std::optional< std::vector< std::int32_t > >, std::optional< std::vector< std::int8_t > > >  | refine (const mesh::Mesh< T > &mesh, std::optional< std::span< const std::int32_t > > edges, const mesh::CellPartitionFunction &partitioner=mesh::create_cell_partitioner(mesh::GhostMode::none), Option option=Option::none) | 
|   | Refine a mesh with markers.  
  | 
|   | 
| void  | update_logical_edgefunction (MPI_Comm comm, const std::vector< std::vector< std::int32_t > > &marked_for_update, std::span< std::int8_t > marked_edges, const common::IndexMap &map) | 
|   | Communicate edge markers between processes that share edges.  
  | 
|   | 
| template<std::floating_point T>  | 
| std::tuple< std::map< std::int32_t, std::int64_t >, std::vector< T >, std::array< std::size_t, 2 > >  | create_new_vertices (MPI_Comm comm, const graph::AdjacencyList< int > &shared_edges, const mesh::Mesh< T > &mesh, std::span< const std::int8_t > marked_edges) | 
|   | Add new vertex for each marked edge, and create new_vertex_coordinates and global_edge->new_vertex map.  
  | 
|   | 
| std::vector< std::int64_t >  | adjust_indices (const common::IndexMap &map, std::int32_t n) | 
|   | Given an index map, add "n" extra indices at the end of local range.  
  | 
|   | 
| std::array< std::vector< std::int32_t >, 2 >  | transfer_facet_meshtag (const mesh::MeshTags< std::int32_t > &tags0, const mesh::Topology &topology1, std::span< const std::int32_t > cell, std::span< const std::int8_t > facet) | 
|   | Transfer facet MeshTags from coarse mesh to refined mesh.  
  | 
|   | 
| std::array< std::vector< std::int32_t >, 2 >  | transfer_cell_meshtag (const mesh::MeshTags< std::int32_t > &tags0, const mesh::Topology &topology1, std::span< const std::int32_t > parent_cell) | 
|   | Transfer cell MeshTags from coarse mesh to refined mesh.  
  | 
|   | 
Mesh refinement algorithms. 
Methods for refining meshes uniformly, or with markers, using edge bisection. 
 
template<std::floating_point T> 
      
 
Refine a mesh with markers. 
The refined mesh can be optionally re-partitioned across processes. Passing nullptr for partitioner, refined cells will be on the same process as the parent cell.
Parent-child relationships can be optionally computed. Parent-child relationships can be used to create MeshTags on the refined mesh from MeshTags on the parent mesh.
- Warning
 - Using the default partitioner for a refined mesh, the refined mesh will not include ghosts cells (cells connected by facet to an owned cell) even if the parent mesh is ghosted.
 
- 
Passing 
nullptr for partitioner, the refined mesh will not have ghosts cells even if the parent mesh is ghosted. The possibility to not re-partition the refined mesh and include ghost cells in the refined mesh will be added in a future release. 
- Parameters
 - 
  
    | [in] | mesh | Input mesh to be refined.  | 
    | [in] | edges | Indices of the edges that should be split in the refinement. If not provided (std::nullopt), uniform refinement is performed.  | 
    | [in] | partitioner | Partitioner to be used to distribute the refined mesh. If not callable, refined cells will be on the same process as the parent cell.  | 
    | [in] | option | Control the computation of parent facets, parent cells. If an option is not selected, an empty list is returned.  | 
  
   
- Returns
 - New mesh, and optional parent cell indices and parent facet indices.