Go to the source code of this file.
Modules | |
| module | mod_space_filling_curve |
Functions/Subroutines | |
| subroutine | mod_space_filling_curve::level1_morton_order |
| build Morton space filling curve for level 1 grid | |
| integer(kind=8) function | mod_space_filling_curve::mortonencode (igd, ndim) |
| subroutine | mod_space_filling_curve::amr_morton_order |
| Construct Morton-order as a global recursive lexicographic ordering. | |
| recursive subroutine | get_morton_number (tree) |
| subroutine | mod_space_filling_curve::get_morton_range |
| Set the Morton range for each processor. | |
| subroutine | mod_space_filling_curve::get_morton_range_active |
| subroutine | mod_space_filling_curve::get_morton_range_costed |
| Cost-weighted SFC partition. Reduces the per-rank block_cost array into a global Morton-indexed cost, EWMA-blends with the persistent costlist, and partitions the Morton order so each rank's cumulative cost is balanced. Falls back to equal-block-count if all costs are zero (cold start before the first measured step). | |
Function/Subroutine Documentation
◆ get_morton_number()
| recursive subroutine amr_morton_order::get_morton_number | ( | type(tree_node_ptr) | tree | ) |
