 |
Reference documentation for deal.II version 9.4.1
|
Loading...
Searching...
No Matches
|
Reference documentation for deal.II version 9.4.1
|
#include <deal.II/distributed/fully_distributed_tria.h>
Public Types | |
| using | cell_iterator = typename ::Triangulation< dim, spacedim >::cell_iterator |
| using | active_cell_iterator = typename ::Triangulation< dim, spacedim >::active_cell_iterator |
| using | CellStatus = typename ::Triangulation< dim, spacedim >::CellStatus |
| enum | MeshSmoothing { none = 0x0 , limit_level_difference_at_vertices = 0x1 , eliminate_unrefined_islands = 0x2 , patch_level_1 = 0x4 , coarsest_level_1 = 0x8 , allow_anisotropic_smoothing = 0x10 , eliminate_refined_inner_islands = 0x100 , eliminate_refined_boundary_islands = 0x200 , do_not_produce_unrefined_islands = 0x400 , smoothing_on_refinement , smoothing_on_coarsening , maximum_smoothing = 0xffff ^ allow_anisotropic_smoothing } |
| using | level_cell_iterator = cell_iterator |
| using | face_iterator = TriaIterator< TriaAccessor< dim - 1, dim, spacedim > > |
| using | active_face_iterator = TriaActiveIterator< TriaAccessor< dim - 1, dim, spacedim > > |
| using | vertex_iterator = TriaIterator<::TriaAccessor< 0, dim, spacedim > > |
| using | active_vertex_iterator = TriaActiveIterator<::TriaAccessor< 0, dim, spacedim > > |
| using | line_iterator = typename IteratorSelector::line_iterator |
| using | active_line_iterator = typename IteratorSelector::active_line_iterator |
| using | quad_iterator = typename IteratorSelector::quad_iterator |
| using | active_quad_iterator = typename IteratorSelector::active_quad_iterator |
| using | hex_iterator = typename IteratorSelector::hex_iterator |
| using | active_hex_iterator = typename IteratorSelector::active_hex_iterator |
Public Member Functions | |
| Triangulation (const MPI_Comm &mpi_communicator) | |
| virtual | ~Triangulation ()=default |
| void | create_triangulation (const TriangulationDescription::Description< dim, spacedim > &construction_data) override |
| virtual void | create_triangulation (const std::vector< Point< spacedim > > &vertices, const std::vector<::CellData< dim > > &cells, const SubCellData &subcelldata) override |
| void | copy_triangulation (const ::Triangulation< dim, spacedim > &other_tria) override |
| void | set_partitioner (const std::function< void(::Triangulation< dim, spacedim > &, const unsigned int)> &partitioner, const TriangulationDescription::Settings &settings) |
| void | set_partitioner (const RepartitioningPolicyTools::Base< dim, spacedim > &partitioner, const TriangulationDescription::Settings &settings) |
| void | repartition () |
| virtual void | execute_coarsening_and_refinement () override |
| virtual bool | prepare_coarsening_and_refinement () override |
| virtual std::size_t | memory_consumption () const override |
| virtual bool | is_multilevel_hierarchy_constructed () const override |
| virtual void | save (const std::string &filename) const override |
| virtual void | load (const std::string &filename) override |
| virtual void | load (const std::string &filename, const bool autopartition) override |
| virtual void | clear () override |
| virtual bool | has_hanging_nodes () const override |
| unsigned int | register_data_attach (const std::function< std::vector< char >(const cell_iterator &, const CellStatus)> &pack_callback, const bool returns_variable_size_data) |
| void | notify_ready_to_unpack (const unsigned int handle, const std::function< void(const cell_iterator &, const CellStatus, const boost::iterator_range< std::vector< char >::const_iterator > &)> &unpack_callback) |
| virtual MPI_Comm | get_communicator () const override |
| virtual void | copy_triangulation (const Triangulation< dim, spacedim > &other_tria) |
| unsigned int | n_locally_owned_active_cells () const |
| virtual types::global_cell_index | n_global_active_cells () const override |
| virtual unsigned int | n_global_levels () const override |
| types::subdomain_id | locally_owned_subdomain () const override |
| const std::set< types::subdomain_id > & | ghost_owners () const |
| const std::set< types::subdomain_id > & | level_ghost_owners () const |
| const std::weak_ptr< const Utilities::MPI::Partitioner > | global_active_cell_index_partitioner () const |
| const std::weak_ptr< const Utilities::MPI::Partitioner > | global_level_cell_index_partitioner (const unsigned int level) const |
| virtual std::vector< types::boundary_id > | get_boundary_ids () const override |
| virtual std::vector< types::manifold_id > | get_manifold_ids () const override |
| void | communicate_locally_moved_vertices (const std::vector< bool > &vertex_locally_moved) |
| virtual types::coarse_cell_id | n_global_coarse_cells () const override |
| virtual void | set_mesh_smoothing (const MeshSmoothing mesh_smoothing) |
| virtual const MeshSmoothing & | get_mesh_smoothing () const |
| void | set_manifold (const types::manifold_id number, const Manifold< dim, spacedim > &manifold_object) |
| void | reset_manifold (const types::manifold_id manifold_number) |
| void | reset_all_manifolds () |
| void | set_all_manifold_ids (const types::manifold_id number) |
| void | set_all_manifold_ids_on_boundary (const types::manifold_id number) |
| void | set_all_manifold_ids_on_boundary (const types::boundary_id b_id, const types::manifold_id number) |
| const Manifold< dim, spacedim > & | get_manifold (const types::manifold_id number) const |
| virtual void | create_triangulation (const std::vector< Point< spacedim > > &vertices, const std::vector< CellData< dim > > &cells, const SubCellData &subcelldata) |
| virtual void | create_triangulation_compatibility (const std::vector< Point< spacedim > > &vertices, const std::vector< CellData< dim > > &cells, const SubCellData &subcelldata) |
| void | flip_all_direction_flags () |
| unsigned int | n_quads () const |
| unsigned int | n_quads (const unsigned int) const |
| unsigned int | n_quads () const |
| unsigned int | n_quads (const unsigned int) const |
| unsigned int | n_quads () const |
| unsigned int | n_quads (const unsigned int) const |
| unsigned int | n_active_quads (const unsigned int) const |
| unsigned int | n_active_quads () const |
| unsigned int | n_active_quads (const unsigned int) const |
| unsigned int | n_active_quads () const |
| unsigned int | n_active_quads (const unsigned int) const |
| unsigned int | n_active_quads () const |
| unsigned int | n_hexs () const |
| unsigned int | n_hexs (const unsigned int level) const |
| unsigned int | n_active_hexs () const |
| unsigned int | n_active_hexs (const unsigned int level) const |
| unsigned int | max_adjacent_cells () const |
| unsigned int | max_adjacent_cells () const |
| unsigned int | max_adjacent_cells () const |
| unsigned int | n_raw_quads (const unsigned int) const |
| unsigned int | n_raw_quads (const unsigned int) const |
| unsigned int | n_raw_quads (const unsigned int) const |
| unsigned int | n_raw_quads (const unsigned int level) const |
| unsigned int | n_raw_quads (const unsigned int level) const |
| unsigned int | n_raw_quads (const unsigned int) const |
| unsigned int | n_raw_quads () const |
| unsigned int | n_raw_hexs (const unsigned int) const |
| unsigned int | n_raw_hexs (const unsigned int) const |
| unsigned int | n_raw_hexs (const unsigned int) const |
| unsigned int | n_raw_hexs (const unsigned int level) const |
Internal information about the number of objects | |
| template<class Archive > | |
| void | save (Archive &ar, const unsigned int version) const |
| template<class Archive > | |
| void | load (Archive &ar, const unsigned int version) |
| unsigned int | n_raw_lines () const |
| unsigned int | n_raw_lines (const unsigned int level) const |
| unsigned int | n_raw_quads () const |
| unsigned int | n_raw_quads (const unsigned int level) const |
| unsigned int | n_raw_hexs (const unsigned int level) const |
| unsigned int | n_raw_cells (const unsigned int level) const |
| unsigned int | n_raw_faces () const |
| virtual void | add_periodicity (const std::vector< GridTools::PeriodicFacePair< cell_iterator > > &) |
| const std::map< std::pair< cell_iterator, unsigned int >, std::pair< std::pair< cell_iterator, unsigned int >, std::bitset< 3 > > > & | get_periodic_face_map () const |
| const std::vector< ReferenceCell > & | get_reference_cells () const |
| bool | all_reference_cells_are_hyper_cube () const |
| bool | all_reference_cells_are_simplex () const |
| bool | is_mixed_mesh () const |
| template<class Archive > | |
| void | serialize (Archive &archive, const unsigned int version) |
Mesh refinement | |
| void | set_all_refine_flags () |
| void | refine_global (const unsigned int times=1) |
| void | coarsen_global (const unsigned int times=1) |
History of a triangulation | |
| void | save_refine_flags (std::ostream &out) const |
| void | save_refine_flags (std::vector< bool > &v) const |
| void | load_refine_flags (std::istream &in) |
| void | load_refine_flags (const std::vector< bool > &v) |
| void | save_coarsen_flags (std::ostream &out) const |
| void | save_coarsen_flags (std::vector< bool > &v) const |
| void | load_coarsen_flags (std::istream &out) |
| void | load_coarsen_flags (const std::vector< bool > &v) |
| bool | get_anisotropic_refinement_flag () const |
User data | |
| void | clear_user_flags () |
| void | save_user_flags (std::ostream &out) const |
| void | save_user_flags (std::vector< bool > &v) const |
| void | load_user_flags (std::istream &in) |
| void | load_user_flags (const std::vector< bool > &v) |
| void | clear_user_flags_line () |
| void | save_user_flags_line (std::ostream &out) const |
| void | save_user_flags_line (std::vector< bool > &v) const |
| void | load_user_flags_line (std::istream &in) |
| void | load_user_flags_line (const std::vector< bool > &v) |
| void | clear_user_flags_quad () |
| void | save_user_flags_quad (std::ostream &out) const |
| void | save_user_flags_quad (std::vector< bool > &v) const |
| void | load_user_flags_quad (std::istream &in) |
| void | load_user_flags_quad (const std::vector< bool > &v) |
| void | clear_user_flags_hex () |
| void | save_user_flags_hex (std::ostream &out) const |
| void | save_user_flags_hex (std::vector< bool > &v) const |
| void | load_user_flags_hex (std::istream &in) |
| void | load_user_flags_hex (const std::vector< bool > &v) |
| void | clear_user_data () |
| void | save_user_indices (std::vector< unsigned int > &v) const |
| void | load_user_indices (const std::vector< unsigned int > &v) |
| void | save_user_pointers (std::vector< void * > &v) const |
| void | load_user_pointers (const std::vector< void * > &v) |
| void | save_user_indices_line (std::vector< unsigned int > &v) const |
| void | load_user_indices_line (const std::vector< unsigned int > &v) |
| void | save_user_indices_quad (std::vector< unsigned int > &v) const |
| void | load_user_indices_quad (const std::vector< unsigned int > &v) |
| void | save_user_indices_hex (std::vector< unsigned int > &v) const |
| void | load_user_indices_hex (const std::vector< unsigned int > &v) |
| void | save_user_pointers_line (std::vector< void * > &v) const |
| void | load_user_pointers_line (const std::vector< void * > &v) |
| void | save_user_pointers_quad (std::vector< void * > &v) const |
| void | load_user_pointers_quad (const std::vector< void * > &v) |
| void | save_user_pointers_hex (std::vector< void * > &v) const |
| void | load_user_pointers_hex (const std::vector< void * > &v) |
Cell iterator functions | |
| cell_iterator | begin (const unsigned int level=0) const |
| active_cell_iterator | begin_active (const unsigned int level=0) const |
| cell_iterator | end () const |
| cell_iterator | end (const unsigned int level) const |
| active_cell_iterator | end_active (const unsigned int level) const |
| cell_iterator | last () const |
| active_cell_iterator | last_active () const |
| cell_iterator | create_cell_iterator (const CellId &cell_id) const |
Cell iterator functions returning ranges of iterators | |
| IteratorRange< cell_iterator > | cell_iterators () const |
| IteratorRange< active_cell_iterator > | active_cell_iterators () const |
| IteratorRange< cell_iterator > | cell_iterators_on_level (const unsigned int level) const |
| IteratorRange< active_cell_iterator > | active_cell_iterators_on_level (const unsigned int level) const |
Face iterator functions | |
| face_iterator | begin_face () const |
| active_face_iterator | begin_active_face () const |
| face_iterator | end_face () const |
| IteratorRange< active_face_iterator > | active_face_iterators () const |
Vertex iterator functions | |
| vertex_iterator | begin_vertex () const |
| active_vertex_iterator | begin_active_vertex () const |
| vertex_iterator | end_vertex () const |
Information about the triangulation | |
| unsigned int | n_lines () const |
| unsigned int | n_lines (const unsigned int level) const |
| unsigned int | n_active_lines () const |
| unsigned int | n_active_lines (const unsigned int level) const |
| unsigned int | n_quads () const |
| unsigned int | n_quads (const unsigned int level) const |
| unsigned int | n_active_quads () const |
| unsigned int | n_active_quads (const unsigned int level) const |
| unsigned int | n_hexs () const |
| unsigned int | n_hexs (const unsigned int level) const |
| unsigned int | n_active_hexs () const |
| unsigned int | n_active_hexs (const unsigned int level) const |
| unsigned int | n_cells () const |
| unsigned int | n_cells (const unsigned int level) const |
| unsigned int | n_active_cells () const |
| unsigned int | n_active_cells (const unsigned int level) const |
| unsigned int | n_faces () const |
| unsigned int | n_active_faces () const |
| unsigned int | n_levels () const |
| unsigned int | n_vertices () const |
| const std::vector< Point< spacedim > > & | get_vertices () const |
| unsigned int | n_used_vertices () const |
| bool | vertex_used (const unsigned int index) const |
| const std::vector< bool > & | get_used_vertices () const |
| unsigned int | max_adjacent_cells () const |
| Triangulation< dim, spacedim > & | get_triangulation () |
| const Triangulation< dim, spacedim > & | get_triangulation () const |
Public Attributes | |
Keeping up with what happens to a triangulation | |
| Signals | signals |
Static Public Attributes | |
| static constexpr unsigned int | dimension = dim |
| static constexpr unsigned int | space_dimension = spacedim |
Protected Types | |
| using | cell_relation_t = typename std::pair< cell_iterator, CellStatus > |
Protected Member Functions | |
| void | save_attached_data (const unsigned int global_first_cell, const unsigned int global_num_cells, const std::string &filename) const |
| void | load_attached_data (const unsigned int global_first_cell, const unsigned int global_num_cells, const unsigned int local_num_cells, const std::string &filename, const unsigned int n_attached_deserialize_fixed, const unsigned int n_attached_deserialize_variable) |
| void | update_reference_cells () override |
| void | reset_global_cell_indices () |
Protected Attributes | |
| std::vector< cell_relation_t > | local_cell_relations |
| CellAttachedData | cell_attached_data |
| DataTransfer | data_transfer |
| const MPI_Comm | mpi_communicator |
| types::subdomain_id | my_subdomain |
| types::subdomain_id | n_subdomains |
| NumberCache | number_cache |
Private Types | |
| using | IteratorSelector = ::internal::TriangulationImplementation::Iterators< dim, spacedim > |
Private Member Functions | |
| virtual unsigned int | coarse_cell_id_to_coarse_cell_index (const types::coarse_cell_id coarse_cell_id) const override |
| virtual types::coarse_cell_id | coarse_cell_index_to_coarse_cell_id (const unsigned int coarse_cell_index) const override |
| virtual void | update_cell_relations () override |
| virtual void | update_number_cache () override |
Line iterator functions for internal use | |
| raw_line_iterator | begin_raw_line (const unsigned int level=0) const |
| line_iterator | begin_line (const unsigned int level=0) const |
| active_line_iterator | begin_active_line (const unsigned int level=0) const |
| line_iterator | end_line () const |
Quad iterator functions for internal use | |
| raw_quad_iterator | begin_raw_quad (const unsigned int level=0) const |
| quad_iterator | begin_quad (const unsigned int level=0) const |
| active_quad_iterator | begin_active_quad (const unsigned int level=0) const |
| quad_iterator | end_quad () const |
Private Attributes | |
| TriangulationDescription::Settings | settings |
| std::function< void(::Triangulation< dim, spacedim > &, const unsigned int)> | partitioner |
| SmartPointer< const RepartitioningPolicyTools::Base< dim, spacedim > > | partitioner_distributed |
| std::vector< std::pair< types::coarse_cell_id, unsigned int > > | coarse_cell_id_to_coarse_cell_index_vector |
| std::vector< types::coarse_cell_id > | coarse_cell_index_to_coarse_cell_id_vector |
| bool | currently_processing_create_triangulation_for_internal_usage |
| bool | currently_processing_prepare_coarsening_and_refinement_for_internal_usage |
Subscriptor functionality | |
Classes derived from Subscriptor provide a facility to subscribe to this object. This is mostly used by the SmartPointer class. | |
| std::atomic< unsigned int > | counter |
| std::map< std::string, unsigned int > | counter_map |
| std::vector< std::atomic< bool > * > | validity_pointers |
| const std::type_info * | object_info |
| void | subscribe (std::atomic< bool > *const validity, const std::string &identifier="") const |
| void | unsubscribe (std::atomic< bool > *const validity, const std::string &identifier="") const |
| unsigned int | n_subscriptions () const |
| template<typename StreamType > | |
| void | list_subscribers (StreamType &stream) const |
| void | list_subscribers () const |
| void | check_no_subscribers () const noexcept |
| using | map_value_type = decltype(counter_map)::value_type |
| using | map_iterator = decltype(counter_map)::iterator |
| static ::ExceptionBase & | ExcInUse (int arg1, std::string arg2, std::string arg3) |
| static ::ExceptionBase & | ExcNoSubscriber (std::string arg1, std::string arg2) |
| static std::mutex | mutex |
Cell iterator functions for internal use | |
| raw_cell_iterator | begin_raw (const unsigned int level=0) const |
| raw_cell_iterator | end_raw (const unsigned int level) const |
| using | raw_cell_iterator = TriaRawIterator< CellAccessor< dim, spacedim > > |
| using | raw_face_iterator = TriaRawIterator< TriaAccessor< dim - 1, dim, spacedim > > |
| using | raw_vertex_iterator = TriaRawIterator<::TriaAccessor< 0, dim, spacedim > > |
| using | raw_line_iterator = typename IteratorSelector::raw_line_iterator |
| using | raw_quad_iterator = typename IteratorSelector::raw_quad_iterator |
| using | raw_hex_iterator = typename IteratorSelector::raw_hex_iterator |
A distributed triangulation with a distributed coarse grid.
The motivation for parallel::fullydistributed::Triangulation has its origins in the following observations about complex geometries and/or about given meshes created by an external mesh generator. We regard complex geometries as geometries that can be meshed only with a non-negligible number of coarse cells (>10,000):
To be able to construct a fully partitioned triangulation that distributes the coarse grid and gives flexibility regarding partitioning, the following ingredients are required:
The ingredients listed above are bundled in the struct TriangulationDescription::Description. The user has to fill this data structure - in a pre-processing step - before actually creating the triangulation. Predefined functions to create TriangulationDescription::Description can be found in the namespace TriangulationDescription::Utilities.
Once the TriangulationDescription::Description construction_data has been constructed, the triangulation tria can be created by calling tria.create_triangulation(construction_data);.
Definition at line 112 of file fully_distributed_tria.h.
| using parallel::fullydistributed::Triangulation< dim, spacedim >::cell_iterator = typename ::Triangulation<dim, spacedim>::cell_iterator |
Definition at line 116 of file fully_distributed_tria.h.
| using parallel::fullydistributed::Triangulation< dim, spacedim >::active_cell_iterator = typename ::Triangulation<dim, spacedim>::active_cell_iterator |
Definition at line 119 of file fully_distributed_tria.h.
| using parallel::fullydistributed::Triangulation< dim, spacedim >::CellStatus = typename ::Triangulation<dim, spacedim>::CellStatus |
Definition at line 122 of file fully_distributed_tria.h.
|
protectedinherited |
Auxiliary data structure for assigning a CellStatus to a deal.II cell iterator. For an extensive description of the former, see the documentation for the member function register_data_attach().
Definition at line 731 of file tria_base.h.
|
privateinherited |
|
inherited |
|
privateinherited |
Declare a number of iterator types for raw iterators, i.e., iterators that also iterate over holes in the list of cells left by cells that have been coarsened away in previous mesh refinement cycles.
Since users should never have to access these internal properties of how we store data, these iterator types are made private.
|
privateinherited |
|
privateinherited |
|
privateinherited |
|
privateinherited |
|
privateinherited |
|
inherited |
Declare some symbolic names for mesh smoothing algorithms. The meaning of these flags is documented in the Triangulation class.
| Enumerator | |
|---|---|
| none | No mesh smoothing at all, except that meshes have to remain one- irregular. |
| limit_level_difference_at_vertices | It can be shown, that degradation of approximation occurs if the triangulation contains vertices which are member of cells with levels differing by more than one. One such example is the following: 
It would seem that in two space dimensions, the maximum jump in levels between cells sharing a common vertex is two (as in the example above). However, this is not true if more than four cells meet at a vertex. It is not uncommon that a coarse (initial) mesh contains vertices at which six or even eight cells meet, when small features of the domain have to be resolved even on the coarsest mesh. In that case, the maximum difference in levels is three or four, respectively. The problem gets even worse in three space dimensions. Looking at an interpolation of the second derivative of the finite element solution (assuming bilinear finite elements), one sees that the numerical solution is almost totally wrong, compared with the true second derivative. Indeed, on regular meshes, there exist sharp estimations that the H2-error is only of order one, so we should not be surprised; however, the numerical solution may show a value for the second derivative which may be a factor of ten away from the true value. These problems are located on the small cell adjacent to the center vertex, where cells of non-subsequent levels meet, as well as on the upper and right neighbor of this cell (but with a less degree of deviation from the true value). If the smoothing indicator given to the constructor contains the bit for limit_level_difference_at_vertices, situations as the above one are eliminated by also marking the upper right cell for refinement. In case of anisotropic refinement, the level of a cell is not linked to the refinement of a cell as directly as in case of isotropic refinement. Furthermore, a cell can be strongly refined in one direction and not or at least much less refined in another. Therefore, it is very difficult to decide, which cases should be excluded from the refinement process. As a consequence, when using anisotropic refinement, the limit_level_difference_at_vertices flag must not be set. On the other hand, the implementation of multigrid methods in deal.II requires that this bit be set. |
| eliminate_unrefined_islands | Single cells which are not refined and are surrounded by cells which are refined usually also lead to a sharp decline in approximation properties locally. The reason is that the nodes on the faces between unrefined and refined cells are not real degrees of freedom but carry constraints. The patch without additional degrees of freedom is thus significantly larger then the unrefined cell itself. If in the parameter passed to the constructor the bit for eliminate_unrefined_islands is set, all cells which are not flagged for refinement but which are surrounded by more refined cells than unrefined cells are flagged for refinement. Cells which are not yet refined but flagged for that are accounted for the number of refined neighbors. Cells on the boundary are not accounted for at all. An unrefined island is, by this definition also a cell which (in 2D) is surrounded by three refined cells and one unrefined one, or one surrounded by two refined cells, one unrefined one and is at the boundary on one side. It is thus not a true island, as the name of the flag may indicate. However, no better name came to mind to the author by now. |
| patch_level_1 | A triangulation of patch level 1 consists of patches, i.e. of cells that are refined once. This flag ensures that a mesh of patch level 1 is still of patch level 1 after coarsening and refinement. It is, however, the user's responsibility to ensure that the mesh is of patch level 1 before calling Triangulation::execute_coarsening_and_refinement() the first time. The easiest way to achieve this is by calling global_refine(1) straight after creation of the triangulation. It follows that if at least one of the children of a cell is or will be refined than all children need to be refined. If the patch_level_1 flag is set, than the flags eliminate_unrefined_islands, eliminate_refined_inner_islands and eliminate_refined_boundary_islands will be ignored as they will be fulfilled automatically. |
| coarsest_level_1 | Each coarse grid cell is refined at least once, i.e., the triangulation might have active cells on level 1 but not on level 0. This flag ensures that a mesh which has coarsest_level_1 has still coarsest_level_1 after coarsening and refinement. It is, however, the user's responsibility to ensure that the mesh has coarsest_level_1 before calling execute_coarsening_and_refinement the first time. The easiest way to achieve this is by calling global_refine(1) straight after creation of the triangulation. It follows that active cells on level 1 may not be coarsened. The main use of this flag is to ensure that each cell has at least one neighbor in each coordinate direction (i.e. each cell has at least a left or right, and at least an upper or lower neighbor in 2d). This is a necessary precondition for some algorithms that compute finite differences between cells. The DerivativeApproximation class is one of these algorithms that require that a triangulation is coarsest_level_1 unless all cells already have at least one neighbor in each coordinate direction on the coarsest level. |
| allow_anisotropic_smoothing | This flag is not included in However, in many cases it is sufficient to refine the coarser of the two original cells in an anisotropic way to avoid the case of multiple hanging vertices on a single edge. Doing only the minimal anisotropic refinement can save cells and degrees of freedom. By specifying this flag, the library can produce these anisotropic refinements. The flag is not included by default since it may lead to anisotropically refined meshes even though no cell has ever been refined anisotropically explicitly by a user command. This surprising fact may lead to programs that do the wrong thing since they are not written for the additional cases that can happen with anisotropic meshes, see the discussion in the introduction to step-30. |
| eliminate_refined_inner_islands | This algorithm seeks for isolated cells which are refined or flagged for refinement. This definition is unlike that for eliminate_unrefined_islands, which would mean that an island is defined as a cell which is refined but more of its neighbors are not refined than are refined. For example, in 2D, a cell's refinement would be reverted if at most one of its neighbors is also refined (or refined but flagged for coarsening). The reason for the change in definition of an island is, that this option would be a bit dangerous, since if you consider a chain of refined cells (e.g. along a kink in the solution), the cells at the two ends would be coarsened, after which the next outermost cells would need to be coarsened. Therefore, only one loop of flagging cells like this could be done to avoid eating up the whole chain of refined cells (‘chain reaction’...). This algorithm also takes into account cells which are not actually refined but are flagged for refinement. If necessary, it takes away the refinement flag. Actually there are two versions of this flag, eliminate_refined_inner_islands and eliminate_refined_boundary_islands. The first eliminates islands defined by the definition above which are in the interior of the domain, while the second eliminates only those islands if the cell is at the boundary. The reason for this split of flags is that one often wants to eliminate such islands in the interior while those at the boundary may well be wanted, for example if one refines the mesh according to a criterion associated with a boundary integral or if one has rough boundary data. |
| eliminate_refined_boundary_islands | The result of this flag is very similar to eliminate_refined_inner_islands. See the documentation there. |
| do_not_produce_unrefined_islands | This flag prevents the occurrence of unrefined islands. In more detail: It prohibits the coarsening of a cell if 'most of the neighbors' will be refined after the step. |
| smoothing_on_refinement | This flag sums up all smoothing algorithms which may be performed upon refinement by flagging some more cells for refinement. |
| smoothing_on_coarsening | This flag sums up all smoothing algorithms which may be performed upon coarsening by flagging some more cells for coarsening. |
| maximum_smoothing | This flag includes all the above ones (therefore combines all smoothing algorithms implemented), with the exception of anisotropic smoothing. |
|
explicit |
Constructor.
| mpi_communicator | The MPI communicator to be used for the triangulation. |
Definition at line 47 of file fully_distributed_tria.cc.
|
virtualdefault |
Destructor.
Reimplemented from Triangulation< dim, spacedim >.
|
overridevirtual |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 64 of file fully_distributed_tria.cc.
|
overridevirtual |
Definition at line 221 of file fully_distributed_tria.cc.
|
overridevirtual |
Implementation of the same function as in the base class.
| other_tria | The triangulation to be copied. It can be a serial Triangulation or a parallel::distributed::Triangulation. Both can have been refined already. |
Reimplemented from parallel::TriangulationBase< dim, spacedim >.
Definition at line 250 of file fully_distributed_tria.cc.
| void Triangulation< dim, spacedim >::set_partitioner | ( | const std::function< void(::Triangulation< dim, spacedim > &, const unsigned int)> & | partitioner, |
| const TriangulationDescription::Settings & | settings | ||
| ) |
Register a partitioner, which is used within the method copy_triangulation.
| partitioner | A partitioning function, which takes as input argument a reference to the triangulation to be partitioned and the number of partitions to be created. The function needs to set subdomain ids for each active cell of the given triangulation, with values between zero (inclusive) and the second argument to the function (exclusive). |
| settings | See the description of the Settings enumerator. |
Definition at line 299 of file fully_distributed_tria.cc.
| void Triangulation< dim, spacedim >::set_partitioner | ( | const RepartitioningPolicyTools::Base< dim, spacedim > & | partitioner, |
| const TriangulationDescription::Settings & | settings | ||
| ) |
Register a partitioner, which is used within the method repartition().
Definition at line 312 of file fully_distributed_tria.cc.
| void Triangulation< dim, spacedim >::repartition |
Execute repartitioning and use the partitioner attached by the method set_partitioner();
Definition at line 324 of file fully_distributed_tria.cc.
|
overridevirtual |
Coarsen and refine the mesh according to refinement and coarsening flags set.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 352 of file fully_distributed_tria.cc.
|
overridevirtual |
Override the implementation of prepare_coarsening_and_refinement from the base class.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 361 of file fully_distributed_tria.cc.
|
overridevirtual |
Return the local memory consumption in bytes.
Reimplemented from parallel::TriangulationBase< dim, spacedim >.
Definition at line 375 of file fully_distributed_tria.cc.
|
overridevirtual |
Return if multilevel hierarchy is supported and has been constructed.
Implements parallel::TriangulationBase< dim, spacedim >.
Definition at line 391 of file fully_distributed_tria.cc.
|
overridevirtual |
Save the triangulation into the given file. This file needs to be reachable from all nodes in the computation on a shared network file system. See the SolutionTransfer class on how to store solution vectors into this file. Additional cell-based data can be saved using register_data_attach().
Implements parallel::DistributedTriangulationBase< dim, spacedim >.
Definition at line 453 of file fully_distributed_tria.cc.
|
overridevirtual |
Load the triangulation saved with save() back in. The mesh must be empty before calling this function.
You need to load with the same number of MPI processes that you saved with, hence autopartition is disabled.
Cell-based data that was saved with register_data_attach() can be read in with notify_ready_to_unpack() after calling load().
Implements parallel::DistributedTriangulationBase< dim, spacedim >.
Definition at line 594 of file fully_distributed_tria.cc.
|
overridevirtual |
Load the triangulation saved with save() back in. The mesh must be empty before calling this function.
You need to load with the same number of MPI processes that you saved with, hence autopartition is disabled.
Cell-based data that was saved with register_data_attach() can be read in with notify_ready_to_unpack() after calling load().
Implements parallel::DistributedTriangulationBase< dim, spacedim >.
Definition at line 739 of file fully_distributed_tria.cc.
|
overrideprivatevirtual |
Translate the unique id of a coarse cell to its index. See the glossary entry on coarse cell IDs for more information.
| coarse_cell_id | Unique id of the coarse cell. |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 402 of file fully_distributed_tria.cc.
|
overrideprivatevirtual |
Translate the index of coarse cell to its unique id. See the glossary entry on coarse cell IDs for more information.
| coarse_cell_index | Index of the coarse cell. |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 421 of file fully_distributed_tria.cc.
|
overrideprivatevirtual |
Go through all active cells that are locally owned and record how they will change in the private member vector local_cell_relations.
As no adaptive mesh refinement is supported at the moment for this class, all cells will be flagged with the CellStatus CELL_PERSIST. These relations will currently only be used for serialization.
The stored vector will have a size equal to the number of locally owned active cells and will be ordered by the occurrence of those cells.
Implements parallel::DistributedTriangulationBase< dim, spacedim >.
Definition at line 437 of file fully_distributed_tria.cc.
|
overrideprivatevirtual |
Update the number_cache variable after mesh creation or refinement.
Reimplemented from parallel::TriangulationBase< dim, spacedim >.
Definition at line 750 of file fully_distributed_tria.cc.
|
overridevirtualinherited |
Reset this triangulation into a virgin state by deleting all data.
Note that this operation is only allowed if no subscriptions to this object exist any more, such as DoFHandler objects using it.
Reimplemented from Triangulation< dim, spacedim >.
Reimplemented in parallel::distributed::Triangulation< dim, spacedim >.
Definition at line 655 of file tria_base.cc.
|
overridevirtualinherited |
Return true if the triangulation has hanging nodes.
In the context of parallel distributed triangulations, every processor stores only that part of the triangulation it owns locally. However, it also stores coarser levels, and to guarantee the 2:1 relationship between cells, this may mean that there are hanging nodes between cells that are not locally owned or ghost cells (i.e., between ghost cells and artificial cells, or between artificial and artificial cells; see the glossary). One is not typically interested in this case, so the function returns whether there are hanging nodes between any two cells of the "global" mesh, i.e., the union of locally owned cells on all processors.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 704 of file tria_base.cc.
|
inherited |
Write the data of this object to a stream for the purpose of serialization using the BOOST serialization library.
|
inherited |
Read the data of this object from a stream for the purpose of serialization using the BOOST serialization library. Throw away the previous content.
|
inherited |
Register a function that can be used to attach data of fixed size to cells. This is useful for two purposes: (i) Upon refinement and coarsening of a triangulation (e.g. in parallel::distributed::Triangulation::execute_coarsening_and_refinement()), one needs to be able to store one or more data vectors per cell that characterizes the solution values on the cell so that this data can then be transferred to the new owning processor of the cell (or its parent/children) when the mesh is re-partitioned; (ii) when serializing a computation to a file, it is necessary to attach data to cells so that it can be saved (e.g. in parallel::distributed::Triangulation::save()) along with the cell's other information and, if necessary, later be reloaded from disk with a different subdivision of cells among the processors.
The way this function works is that it allows any number of interest parties to register their intent to attach data to cells. One example of classes that do this is parallel::distributed::SolutionTransfer where each parallel::distributed::SolutionTransfer object that works on the current Triangulation object then needs to register its intent. Each of these parties registers a callback function (the first argument here, pack_callback) that will be called whenever the triangulation's execute_coarsening_and_refinement() or save() functions are called.
The current function then returns an integer handle that corresponds to the number of data set that the callback provided here will attach. While this number could be given a precise meaning, this is not important: You will never actually have to do anything with this number except return it to the notify_ready_to_unpack() function. In other words, each interested party (i.e., the caller of the current function) needs to store their respective returned handle for later use when unpacking data in the callback provided to notify_ready_to_unpack().
Whenever pack_callback is then called by execute_coarsening_and_refinement() or load() on a given cell, it receives a number of arguments. In particular, the first argument passed to the callback indicates the cell for which it is supposed to attach data. This is always an active cell.
The second, CellStatus, argument provided to the callback function will tell you if the given cell will be coarsened, refined, or will persist as is. (This status may be different than the refinement or coarsening flags set on that cell, to accommodate things such as the "one hanging node per edge" rule.). These flags need to be read in context with the p4est quadrant they belong to, as their relations are gathered in local_cell_relations.
Specifically, the values for this argument mean the following:
CELL_PERSIST: The cell won't be refined/coarsened, but might be moved to a different processor. If this is the case, the callback will want to pack up the data on this cell into an array and store it at the provided address for later unpacking wherever this cell may land.CELL_REFINE: This cell will be refined into 4 or 8 cells (in 2d and 3d, respectively). However, because these children don't exist yet, you cannot access them at the time when the callback is called. Thus, in local_cell_relations, the corresponding p4est quadrants of the children cells are linked to the deal.II cell which is going to be refined. To be specific, only the very first child is marked with CELL_REFINE, whereas the others will be marked with CELL_INVALID, which indicates that these cells will be ignored by default during the packing or unpacking process. This ensures that data is only transferred once onto or from the parent cell. If the callback is called with CELL_REFINE, the callback will want to pack up the data on this cell into an array and store it at the provided address for later unpacking in a way so that it can then be transferred to the children of the cell that will then be available. In other words, if the data the callback will want to pack up corresponds to a finite element field, then the prolongation from parent to (new) children will have to happen during unpacking.CELL_COARSEN: The children of this cell will be coarsened into the given cell. These children still exist, so if this is the value given to the callback as second argument, the callback will want to transfer data from the children to the current parent cell and pack it up so that it can later be unpacked again on a cell that then no longer has any children (and may also be located on a different processor). In other words, if the data the callback will want to pack up corresponds to a finite element field, then it will need to do the restriction from children to parent at this point.CELL_INVALID: See CELL_REFINE.CELL_PERSIST.The callback function is expected to return a memory chunk of the format std::vector<char>, representing the packed data on a certain cell.
The second parameter returns_variable_size_data indicates whether the returned size of the memory region from the callback function varies by cell (=true) or stays constant on each one throughout the whole domain (=false).
Definition at line 768 of file tria_base.cc.
|
inherited |
This function is the opposite of register_data_attach(). It is called after the execute_coarsening_and_refinement() or save()/load() functions are done when classes and functions that have previously attached data to a triangulation for either transfer to other processors, across mesh refinement, or serialization of data to a file are ready to receive that data back. The important part about this process is that the triangulation cannot do this right away from the end of execute_coarsening_and_refinement() or load() via a previously attached callback function (as the register_data_attach() function does) because the classes that eventually want the data back may need to do some setup between the point in time where the mesh has been recreated and when the data can actually be received. An example is the parallel::distributed::SolutionTransfer class that can really only receive the data once not only the mesh is completely available again on the current processor, but only after a DoFHandler has been reinitialized and distributed degrees of freedom. In other words, there is typically a significant amount of set up that needs to happen in user space before the classes that can receive data attached to cell are ready to actually do so. When they are, they use the current function to tell the triangulation object that now is the time when they are ready by calling the current function.
The supplied callback function is then called for each newly locally owned cell. The first argument to the callback is an iterator that designates the cell; the second argument indicates the status of the cell in question; and the third argument localizes a memory area by two iterators that contains the data that was previously saved from the callback provided to register_data_attach().
The CellStatus will indicate if the cell was refined, coarsened, or persisted unchanged. The cell_iterator argument to the callback will then either be an active, locally owned cell (if the cell was not refined), or the immediate parent if it was refined during execute_coarsening_and_refinement(). Therefore, contrary to during register_data_attach(), you can now access the children if the status is CELL_REFINE but no longer for callbacks with status CELL_COARSEN.
The first argument to this function, handle, corresponds to the return value of register_data_attach(). (The precise meaning of what the numeric value of this handle is supposed to represent is neither important, nor should you try to use it for anything other than transmit information between a call to register_data_attach() to the corresponding call to notify_ready_to_unpack().)
Definition at line 798 of file tria_base.cc.
|
protectedinherited |
Save additional cell-attached data into the given file. The first arguments are used to determine the offsets where to write buffers to.
Called by save.
Definition at line 667 of file tria_base.cc.
|
protectedinherited |
Load additional cell-attached data from the given file, if any was saved. The first arguments are used to determine the offsets where to read buffers from.
Called by load.
Definition at line 731 of file tria_base.cc.
|
overridevirtualinherited |
Return MPI communicator used by this triangulation.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 144 of file tria_base.cc.
|
virtualinherited |
Copy other_tria to this triangulation. This operation is not cheap, so you should be careful with using this. We do not implement this function as a copy constructor, since it makes it easier to maintain collections of triangulations if you can assign them values later on.
Keep in mind that this function also copies the pointer to the boundary descriptor previously set by the set_manifold function. You must therefore also guarantee that the Manifold objects describing the boundary have a lifetime at least as long as the copied triangulation.
This triangulation must be empty beforehand.
The function is made virtual since some derived classes might want to disable or extend the functionality of this function.
Reimplemented in PersistentTriangulation< dim, spacedim >.
|
inherited |
Return the number of active cells in the triangulation that are locally owned, i.e. that have a subdomain_id equal to locally_owned_subdomain(). Note that there may be more active cells in the triangulation stored on the present processor, such as for example ghost cells, or cells further away from the locally owned block of cells but that are needed to ensure that the triangulation that stores this processor's set of active cells still remains balanced with respect to the 2:1 size ratio of adjacent cells.
As a consequence of the remark above, the result of this function is always smaller or equal to the result of the function with the same name in the Triangulation base class, which includes the active ghost and artificial cells (see also GlossArtificialCell and GlossGhostCell).
Definition at line 123 of file tria_base.cc.
|
overridevirtualinherited |
Return the sum over all processors of the number of active cells owned by each processor. This equals the overall number of active cells in the triangulation.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 137 of file tria_base.cc.
|
overridevirtualinherited |
Return the global maximum level. This may be bigger than the number Triangulation::n_levels() (a function in this class's base class) returns if the current processor only stores cells in parts of the domain that are not very refined, but if other processors store cells in more deeply refined parts of the domain.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 130 of file tria_base.cc.
|
overridevirtualinherited |
Return the subdomain id of those cells that are owned by the current processor. All cells in the triangulation that do not have this subdomain id are either owned by another processor or have children that only exist on other processors.
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 325 of file tria_base.cc.
|
inherited |
Return a set of MPI ranks of the processors that have at least one ghost cell adjacent to the cells of the local processor. In other words, this is the set of subdomain_id() for all ghost cells.
The returned sets are symmetric, that is if i is contained in the list of processor j, then j will also be contained in the list of processor i.
Definition at line 334 of file tria_base.cc.
|
inherited |
Return a set of MPI ranks of the processors that have at least one level ghost cell adjacent to our cells used in geometric multigrid. In other words, this is the set of level_subdomain_id() for all level ghost cells.
The returned sets are symmetric, that is if i is contained in the list of processor j, then j will also be contained in the list of processor i.
Definition at line 343 of file tria_base.cc.
|
inherited |
Return partitioner for the global indices of the cells on the active level of the triangulation.
Definition at line 608 of file tria_base.cc.
|
inherited |
Return partitioner for the global indices of the cells on the given level of the triangulation.
Definition at line 617 of file tria_base.cc.
|
overridevirtualinherited |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 352 of file tria_base.cc.
|
overridevirtualinherited |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 363 of file tria_base.cc.
|
inherited |
When vertices have been moved locally, for example using code like
then this function can be used to update the location of vertices between MPI processes.
All the vertices that have been moved and might be in the ghost layer of a process have to be reported in the vertex_locally_moved argument. This ensures that that part of the information that has to be send between processes is actually sent. Additionally, it is quite important that vertices on the boundary between processes are reported on exactly one process (e.g. the one with the highest id). Otherwise we could expect undesirable results if multiple processes move a vertex differently. A typical strategy is to let processor \(i\) move those vertices that are adjacent to cells whose owners include processor \(i\) but no other processor \(j\) with \(j<i\); in other words, for vertices at the boundary of a subdomain, the processor with the lowest subdomain id "owns" a vertex.
vertex_locally_moved argument may not contain vertices that aren't at least on ghost cells.| vertex_locally_moved | A bitmap indicating which vertices have been moved. The size of this array must be equal to Triangulation::n_vertices() and must be a subset of those vertices flagged by GridTools::get_locally_owned_vertices(). |
Definition at line 558 of file tria_base.cc.
|
overridevirtualinherited |
Return the total number of coarse cells. If the coarse mesh is replicated on each process, this simply returns n_cells(0).
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 630 of file tria_base.cc.
|
overrideprotectedvirtualinherited |
Reimplemented from Triangulation< dim, spacedim >.
Definition at line 297 of file tria_base.cc.
|
protectedinherited |
Reset global active cell indices and global level cell indices.
Definition at line 374 of file tria_base.cc.
|
virtualinherited |
Set the mesh smoothing to mesh_smoothing. This overrides the MeshSmoothing given to the constructor. It is allowed to call this function only if the triangulation is empty.
|
virtualinherited |
Return the mesh smoothing requirements that are obeyed.
|
virtualinherited |
Create a triangulation from a list of vertices and a list of cells, each of the latter being a list of 1<<dim vertex indices. The triangulation must be empty upon calling this function and the cell list should be useful (connected domain, etc.). The result of calling this function is a coarse mesh.
Material data for the cells is given within the cells array, while boundary information is given in the subcelldata field.
The numbering of vertices within the cells array is subject to some constraints; see the general class documentation for this.
For conditions when this function can generate a valid triangulation, see the documentation of this class, and the GridIn and GridReordering class.
If the check_for_distorted_cells flag was specified upon creation of this object, at the very end of its operation, the current function walks over all cells and verifies that none of the cells is deformed (see the entry on distorted cells in the glossary), where we call a cell deformed if the determinant of the Jacobian of the mapping from reference cell to real cell is negative at least at one of the vertices (this computation is done using the GeometryInfo::jacobian_determinants_at_vertices function). If there are deformed cells, this function throws an exception of kind DistortedCellList. Since this happens after all data structures have been set up, you can catch and ignore this exception if you know what you do – for example, it may be that the determinant is zero (indicating that you have collapsed edges in a cell) but that this is ok because you didn't intend to integrate on this cell anyway. On the other hand, deformed cells are often a sign of a mesh that is too coarse to resolve the geometry of the domain, and in this case ignoring the exception is probably unwise.
Reimplemented in parallel::shared::Triangulation< dim, spacedim >, parallel::distributed::Triangulation< dim, spacedim >, and PersistentTriangulation< dim, spacedim >.
|
virtualinherited |
For backward compatibility, only. This function takes the cell data in the ordering as requested by deal.II versions up to 5.2, converts it to the new (lexicographic) ordering and calls create_triangulation().
Reimplemented in PersistentTriangulation< dim, spacedim >.
|
inherited |
Revert or flip the direction_flags of a dim<spacedim triangulation, see GlossDirectionFlag.
This function throws an exception if dim equals spacedim.
|
inherited |
Flag all active cells for refinement. This will refine all cells of all levels which are not already refined (i.e. only cells are refined which do not yet have children). The cells are only flagged, not refined, thus you have the chance to save the refinement flags.
|
inherited |
Refine all cells times times. In other words, in each one of the times iterations, loop over all cells and refine each cell uniformly into \(2^\text{dim}\) children. In practice, this function repeats the following operations times times: call set_all_refine_flags() followed by execute_coarsening_and_refinement(). The end result is that the number of cells increases by a factor of \((2^\text{dim})^\text{times}=2^{\text{dim} \times \text{times}}\).
The execute_coarsening_and_refinement() function called in this loop may throw an exception if it creates cells that are distorted (see its documentation for an explanation). This exception will be propagated through this function if that happens, and you may not get the actual number of refinement steps in that case.
times > 1) . See the section on signals in the general documentation of this class.
|
inherited |
Coarsen all cells the given number of times.
In each of one of the times iterations, all cells will be marked for coarsening. If an active cell is already on the coarsest level, it will be ignored.
times > 1) . See the section on signals in the general documentation of this class.
|
inherited |
Save the addresses of the cells which are flagged for refinement to out. For usage, read the general documentation for this class.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file.
|
inherited |
Read the information stored by save_refine_flags.
|
inherited |
Read the information stored by save_refine_flags.
|
inherited |
Analogue to save_refine_flags.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file.
|
inherited |
Analogue to load_refine_flags.
|
inherited |
Analogue to load_refine_flags.
|
inherited |
Return whether this triangulation has ever undergone anisotropic (as opposed to only isotropic) refinement.
|
inherited |
Clear all user flags. See also GlossUserFlags.
|
inherited |
Save all user flags. See the general documentation for this class and the documentation for the save_refine_flags for more details. See also GlossUserFlags.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file. The output vector is resized if necessary. See also GlossUserFlags.
|
inherited |
Read the information stored by save_user_flags. See also GlossUserFlags.
|
inherited |
Read the information stored by save_user_flags. See also GlossUserFlags.
|
inherited |
Clear all user flags on lines. See also GlossUserFlags.
|
inherited |
Save the user flags on lines. See also GlossUserFlags.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file. The output vector is resized if necessary. See also GlossUserFlags.
|
inherited |
Load the user flags located on lines. See also GlossUserFlags.
|
inherited |
Load the user flags located on lines. See also GlossUserFlags.
|
inherited |
Clear all user flags on quads. See also GlossUserFlags.
|
inherited |
Save the user flags on quads. See also GlossUserFlags.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file. The output vector is resized if necessary. See also GlossUserFlags.
|
inherited |
Load the user flags located on quads. See also GlossUserFlags.
|
inherited |
Load the user flags located on quads. See also GlossUserFlags.
|
inherited |
Clear all user flags on quads. See also GlossUserFlags.
|
inherited |
Save the user flags on hexs. See also GlossUserFlags.
|
inherited |
Same as above, but store the flags to a bitvector rather than to a file. The output vector is resized if necessary. See also GlossUserFlags.
|
inherited |
Load the user flags located on hexs. See also GlossUserFlags.
|
inherited |
Load the user flags located on hexs. See also GlossUserFlags.
|
inherited |
Clear all user pointers and indices and allow the use of both for next access. See also GlossUserData.
|
inherited |
Save all user indices. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Read the information stored by save_user_indices(). See also GlossUserData.
|
inherited |
Save all user pointers. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Read the information stored by save_user_pointers(). See also GlossUserData.
|
inherited |
Save the user indices on lines. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user indices located on lines. See also GlossUserData.
|
inherited |
Save the user indices on quads. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user indices located on quads. See also GlossUserData.
|
inherited |
Save the user indices on hexes. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user indices located on hexs. See also GlossUserData.
|
inherited |
Save the user indices on lines. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user pointers located on lines. See also GlossUserData.
|
inherited |
Save the user pointers on quads. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user pointers located on quads. See also GlossUserData.
|
inherited |
Save the user pointers on hexes. The output vector is resized if necessary. See also GlossUserData.
|
inherited |
Load the user pointers located on hexs. See also GlossUserData.
|
inherited |
Iterator to the first used cell on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
inherited |
Iterator to the first active cell on level level. If the given level does not contain any active cells (i.e., all cells on this level are further refined, then this function returns end_active(level) so that loops of the kind
have zero iterations, as may be expected if there are no active cells on this level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
inherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states.
|
inherited |
Return an iterator which is the first iterator not on level. If level is the last level, then this returns end().
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
inherited |
Return an active iterator which is the first active iterator not on the given level. If level is the last level, then this returns end().
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
inherited |
Return an iterator pointing to the last used cell.
|
inherited |
Return an iterator pointing to the last active cell.
|
inherited |
Return an iterator to a cell of this Triangulation object constructed from an independent CellId object.
If the given argument corresponds to a valid cell in this triangulation, this operation will always succeed for sequential triangulations where the current processor stores all cells that are part of the triangulation. On the other hand, if this is a parallel triangulation, then the current processor may not actually know about this cell. In this case, this operation will succeed for locally relevant cells, but may not for artificial cells that are less refined on the current processor.
|
inherited |
Iterator to the first used face.
|
inherited |
Iterator to the first active face.
|
inherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states.
|
inherited |
Iterator to the first used vertex. This function can only be used if dim is not one.
|
inherited |
Iterator to the first active vertex. Because all vertices are active, begin_vertex() and begin_active_vertex() return the same vertex. This function can only be used if dim is not one.
|
inherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states. This function can only be used if dim is not one.
|
inherited |
In the following, most functions are provided in two versions, with and without an argument describing the level. The versions with this argument are only applicable for objects describing the cells of the present triangulation. For example: in 2D n_lines(level) cannot be called, only n_lines(), as lines are faces in 2D and therefore have no level. Return the total number of used lines, active or not.
|
inherited |
Return the total number of used lines, active or not on level level.
|
inherited |
Return the total number of active lines.
|
inherited |
Return the total number of active lines, on level level.
|
inherited |
Return the total number of used quads, active or not.
|
inherited |
Return the total number of used quads, active or not on level level.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Return the total number of active quads, active or not.
|
inherited |
Return the total number of active quads, active or not on level level.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Return the total number of used hexahedra, active or not.
|
inherited |
Return the total number of used hexahedra, active or not on level level.
|
inherited |
|
inherited |
|
inherited |
Return the total number of active hexahedra, active or not.
|
inherited |
Return the total number of active hexahedra, active or not on level level.
|
inherited |
|
inherited |
|
inherited |
Return the total number of used cells, active or not. Maps to n_lines() in one space dimension and so on.
|
inherited |
Return the total number of used cells, active or not, on level level. Maps to n_lines(level) in one space dimension and so on.
|
inherited |
Return the total number of active cells. Maps to n_active_lines() in one space dimension and so on.
|
inherited |
Return the total number of active cells on level level. Maps to n_active_lines(level) in one space dimension and so on.
|
inherited |
|
inherited |
Return the total number of active faces. In 2D, the result equals n_active_lines(), in 3D it equals n_active_quads(), while in 1D it equals the number of used vertices.
|
inherited |
Return the number of levels in this triangulation.
|
inherited |
Return the total number of vertices. Some of them may not be used, which usually happens upon coarsening of a triangulation when some vertices are discarded, but we do not want to renumber the remaining ones, leading to holes in the numbers of used vertices. You can get the number of used vertices using n_used_vertices function.
|
inherited |
Return a constant reference to all the vertices present in this triangulation. Note that not necessarily all vertices in this array are actually used; for example, if you coarsen a mesh, then some vertices are deleted, but their positions in this array are unchanged as the indices of vertices are only allocated once. You can find out about which vertices are actually used by the function get_used_vertices().
|
inherited |
Return the number of vertices that are presently in use, i.e. belong to at least one used element.
|
inherited |
Return true if the vertex with this index is used.
|
inherited |
Return a constant reference to the array of bools indicating whether an entry in the vertex array is used or not.
|
inherited |
Return the maximum number of cells meeting at a common vertex. Since this number is an invariant under refinement, only the cells on the coarsest level are considered. The operation is thus reasonably fast. The invariance is only true for sufficiently many cells in the coarsest triangulation (e.g. for a single cell one would be returned), so a minimum of four is returned in two dimensions, 8 in three dimensions, etc, which is how many cells meet if the triangulation is refined.
In one space dimension, two is returned.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Return a reference to the current object.
This doesn't seem to be very useful but allows to write code that can access the underlying triangulation for anything that satisfies the MeshType concept (which may not only be a triangulation, but also a DoFHandler, for example).
|
inherited |
Return a reference to the current object. This is the const-version of the previous function.
|
inherited |
Total number of lines, used or unused.
|
inherited |
Number of lines, used or unused, on the given level.
|
inherited |
Total number of quads, used or unused.
|
inherited |
Number of quads, used or unused, on the given level.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Number of hexs, used or unused, on the given level.
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
Number of cells, used or unused, on the given level.
|
inherited |
Return the total number of faces, used or not. In 2d, the result equals n_raw_lines(), in 3d it equals n_raw_quads(), while in 1D it equals the number of vertices.
|
virtualinherited |
Declare the (coarse) face pairs given in the argument of this function as periodic. This way it is possible to obtain neighbors across periodic boundaries.
The vector can be filled by the function GridTools::collect_periodic_faces.
For more information on periodic boundary conditions see GridTools::collect_periodic_faces, DoFTools::make_periodicity_constraints and step-45.
|
inherited |
Return the periodic_face_map.
|
inherited |
Return vector filled with the used reference-cell types of this triangulation.
|
inherited |
Indicate if the triangulation only consists of hypercube-like cells, i.e., lines, quadrilaterals, or hexahedra.
|
inherited |
Indicate if the triangulation only consists of simplex-like cells, i.e., lines, triangles, or tetrahedra.
|
inherited |
Indicate if the triangulation consists of different cell types (mix of simplices, hypercubes, ...) or different face types, as in the case of pyramids or wedges..
|
inherited |
Write and read the data of this object from a stream for the purpose of serialization. using the BOOST serialization library.
|
staticprotectedinherited |
Write a bool vector to the given stream, writing a pre- and a postfix magic number. The vector is written in an almost binary format, i.e. the bool flags are packed but the data is written as ASCII text.
The flags are stored in a binary format: for each true, a 1 bit is stored, a 0 bit otherwise. The bits are stored as unsigned char, thus avoiding endianness. They are written to out in plain text, thus amounting to 3.6 bits in the output per bits in the input on the average. Other information (magic numbers and number of elements of the input vector) is stored as plain text as well. The format should therefore be interplatform compatible.
|
staticprotectedinherited |
Re-read a vector of bools previously written by write_bool_vector and compare with the magic numbers.
|
protectedinherited |
Recreate information about periodic neighbors from periodic_face_pairs_level_0.
|
privateinherited |
Iterator to the first cell, used or not, on level level. If a level has no cells, a past-the-end iterator is returned.
|
privateinherited |
Return a raw iterator which is the first iterator not on level. If level is the last level, then this returns end().
|
privateinherited |
Iterator to the first line, used or not, on level level. If a level has no lines, a past-the-end iterator is returned. If lines are no cells, i.e. for dim>1 no level argument must be given. The same applies for all the other functions above, of course.
|
privateinherited |
Iterator to the first used line on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator to the first active line on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states.
|
privateinherited |
Iterator to the first quad, used or not, on the given level. If a level has no quads, a past-the-end iterator is returned. If quads are no cells, i.e. for \(dim>2\) no level argument must be given.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator to the first used quad on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator to the first active quad on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states.
|
privateinherited |
Iterator to the first hex, used or not, on level level. If a level has no hexes, a past-the-end iterator is returned.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator to the first used hex on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator to the first active hex on level level.
level argument needs to correspond to a level of the triangulation, i.e., should be less than the value returned by n_levels(). On the other hand, for parallel computations using a parallel::distributed::Triangulation object, it is often convenient to write loops over the cells of all levels of the global mesh, even if the local portion of the triangulation does not actually have cells at one of the higher levels. In those cases, the level argument is accepted if it is less than what the n_global_levels() function returns. If the given level is between the values returned by n_levels() and n_global_levels(), then no cells exist in the local portion of the triangulation at this level, and the function simply returns what end() would return.
|
privateinherited |
Iterator past the end; this iterator serves for comparisons of iterators with past-the-end or before-the-beginning states.
|
privateinherited |
The (public) function clear() will only work when the triangulation is not subscribed to by other users. The clear_despite_subscriptions() function now allows the triangulation being cleared even when there are subscriptions.
Make sure, you know what you do, when calling this function, as its use is reasonable in very rare cases, only. For example, when the subscriptions were for the initially empty Triangulation and the Triangulation object wants to release its memory before throwing an assertion due to input errors (e.g. in the create_triangulation() function).
|
privateinherited |
Reset triangulation policy.
|
privateinherited |
For all cells, set the active cell indices so that active cells know the how many-th active cell they are, and all other cells have an invalid value. This function is called after mesh creation, refinement, and serialization.
|
privateinherited |
Reset cache for the cells' vertex indices.
|
privateinherited |
Refine all cells on all levels which were previously flagged for refinement.
Note, that this function uses the line->user_flags for dim=2,3 and the quad->user_flags for dim=3.
The function returns a list of cells that have produced children that satisfy the criteria of distorted cells if the check_for_distorted_cells flag was specified upon creation of this object, at
|
privateinherited |
Coarsen all cells which were flagged for coarsening, or rather: delete all children of those cells of which all child cells are flagged for coarsening and several other constraints hold (see the general doc of this class).
|
privateinherited |
Make sure that either all or none of the children of a cell are tagged for coarsening.
|
private |
store the Settings.
Definition at line 302 of file fully_distributed_tria.h.
|
private |
Partitioner used in copy_triangulation().
Definition at line 309 of file fully_distributed_tria.h.
|
private |
Partitioner used during repartition().
Definition at line 315 of file fully_distributed_tria.h.
|
private |
Sorted list of pairs of coarse-cell ids and their indices.
Definition at line 321 of file fully_distributed_tria.h.
|
private |
List of the coarse-cell id for each coarse cell (stored at cell->index()).
Definition at line 328 of file fully_distributed_tria.h.
|
private |
Boolean indicating that the function create_triangulation() was called for internal usage.
Definition at line 334 of file fully_distributed_tria.h.
|
private |
Boolean indicating that the function prepare_coarsening_and_refinement() was called for internal usage.
Definition at line 341 of file fully_distributed_tria.h.
|
protectedinherited |
Vector of pairs, each containing a deal.II cell iterator and its respective CellStatus. To update its contents, use the update_cell_relations() member function.
Definition at line 738 of file tria_base.h.
|
protectedinherited |
Definition at line 771 of file tria_base.h.
|
protectedinherited |
Definition at line 926 of file tria_base.h.
|
protectedinherited |
MPI communicator to be used for the triangulation. We create a unique communicator for this class, which is a duplicate of the one passed to the constructor.
Definition at line 302 of file tria_base.h.
|
protectedinherited |
The subdomain id to be used for the current processor. This is the MPI rank.
Definition at line 308 of file tria_base.h.
|
protectedinherited |
The total number of subdomains (or the size of the MPI communicator).
Definition at line 313 of file tria_base.h.
|
protectedinherited |
Definition at line 371 of file tria_base.h.
|
staticconstexprinherited |
|
staticconstexprinherited |
|
mutableinherited |
|
protectedinherited |
|
protectedinherited |
|
privateinherited |
|
privateinherited |
If add_periodicity() is called, this variable stores the given periodic face pairs on level 0 for later access during the identification of ghost cells for the multigrid hierarchy and for setting up the periodic_face_map.
|
privateinherited |
If add_periodicity() is called, this variable stores the active periodic face pairs.
|
privateinherited |
|
privateinherited |
|
privateinherited |
|
privateinherited |
|
privateinherited |
Collection of manifold objects. We store only objects, which are not of type FlatManifold.
|
privateinherited |
|
privateinherited |
|
privateinherited |
A map that relates the number of a boundary vertex to the boundary indicator. This field is only used in 1d. We have this field because we store boundary indicator information with faces in 2d and higher where we have space in the structures that store data for faces, but in 1d there is no such space for faces.
The field is declared as a pointer for a rather mundane reason: all other fields of this class that can be modified by the TriaAccessor hierarchy are pointers, and so these accessor classes store a const pointer to the triangulation. We could no longer do so for TriaAccessor<0,1,spacedim> if this field (that can be modified by TriaAccessor::set_boundary_id) were not a pointer.
|
privateinherited |
A map that relates the number of a boundary vertex to the manifold indicator. This field is only used in 1d. We have this field because we store manifold indicator information with faces in 2d and higher where we have space in the structures that store data for faces, but in 1d there is no such space for faces.
The field is declared as a pointer for a rather mundane reason: all other fields of this class that can be modified by the TriaAccessor hierarchy are pointers, and so these accessor classes store a const pointer to the triangulation. We could no longer do so for TriaAccessor<0,1,spacedim> if this field (that can be modified by TriaAccessor::set_manifold_id) were not a pointer.
1.9.5