Go to the source code of this file.
Functions/Subroutines | |
| subroutine | find_root_neighbor (tree_neighbor, tree, iD) |
| find neighors of level-one root blocks More... | |
| subroutine | find_neighbor (my_neighbor, my_neighbor_type, tree, iD, pole) |
| find neighors of all blocks More... | |
| subroutine | asign_tree_neighbor (tree) |
| asign tree node neighor More... | |
Function/Subroutine Documentation
◆ asign_tree_neighbor()
| subroutine asign_tree_neighbor | ( | type(tree_node_ptr) | tree | ) |
asign tree node neighor
Definition at line 115 of file amr_neighbors.t.
Here is the call graph for this function:
◆ find_neighbor()
| subroutine find_neighbor | ( | type(tree_node_ptr) | my_neighbor, |
| integer, intent(out) | my_neighbor_type, | ||
| type(tree_node_ptr) | tree, | ||
| integer, intent(in) | i, | ||
| integer, intent(in) | D, | ||
| logical, dimension(ndim), intent(out) | pole | ||
| ) |
find neighors of all blocks
Definition at line 42 of file amr_neighbors.t.
Here is the call graph for this function:
◆ find_root_neighbor()
| subroutine find_root_neighbor | ( | type(tree_node_ptr) | tree_neighbor, |
| type(tree_node_ptr) | tree, | ||
| integer, intent(in) | i, | ||
| integer, intent(in) | D | ||
| ) |
find neighors of level-one root blocks
Definition at line 2 of file amr_neighbors.t.
