Appearance
fossil_aabb_tree_object
Source: src/lib/fossil_aabb_tree_object.f90
Dependencies
Contents
- ofsm
- aabb_tree_object
- set_refinement_levels
- set_tree_kind
- set_use_index
- aabb_tree_finalize
- compute_vertices_nearby
- destroy
- distance_tree_with_region
- distribute_facets
- distribute_facets_tree
- initialize
- build_bvh_sah
- build_node
- compute_node_bboxes
- write_node_bbox
- write_leaf
- expand_bbox
- save_geometry_tecplot_ascii
- translate
- aabb_tree_assign_aabb_tree
- enumerate_children
- distance_node
- distance_node_with_region
- intersect_ray_all_tree
- intersect_ray_all_node
- intersect_ray_first_tree
- intersect_ray_first_node
- intersect_ray_any_tree
- intersect_ray_any_node
- sort_hits_by_t
- next_location_code
- auto_refinement_levels
- get_refinement_levels
- get_tree_kind
- get_nodes_number
- node_at
- get_is_initialized
- get_use_index
- distance
- distance_tree
- has_children
- surface_area
- surface_area_arr
- loop_node
- ray_intersections_number
- ray_intersections_number_node
- first_child_node
- first_node
- last_node
- level
- local_id
- location_code
- global_id
- nodes_number
- nodes_number_at_level
- parent_at_level
- parent_node
- siblings
- str_location_code
Variables
| Name | Type | Attributes | Description |
|---|---|---|---|
TREE_RATIO | integer(kind=I4P) | parameter | |
AABB_USE_INDEX | logical | parameter | |
AABB_USE_BRUTE_FORCE | logical | parameter | |
AABB_TREE_OCTREE | integer(kind=I4P) | parameter | |
AABB_TREE_SAH_BVH | integer(kind=I4P) | parameter | |
AABB_AUTO_REFINEMENT | integer(kind=I4P) | parameter | |
AUTO_TARGET_FACETS_PER_LEAF | integer(kind=I4P) | parameter | |
AUTO_MIN_LEVELS | integer(kind=I4P) | parameter | |
AUTO_MAX_LEVELS | integer(kind=I4P) | parameter | |
octree_fsm | type(ofsm) |
Derived Types
ofsm
Components
| Name | Type | Attributes | Description |
|---|---|---|---|
octant | integer(kind=I4P) | ||
direction | integer(kind=I4P) |
aabb_tree_object
+----+----+ /| /| /| / | 7 | 8 | / +--------+ / /|/ /|/ /| / / | 5 | 6 | / / /+----+----+ / / // / // / / +----+----+/ / / /| / /| / /| / / / |/ //|/ //|/ / / +--------+ / / /|// /|// /| / / / |/ / |/ / |/ / / /+----+----+ / / // / // / / +----+----+/ / / y(j) z(k) | / | / | / / ^ ^ |/ 3/|/ 4/|/ / | / +----*----+ / | / | / | / | / | / |/ 1 |/ 2 |/ |/ +----+----+ +------->x(i)
Components
| Name | Type | Attributes | Description |
|---|---|---|---|
tree_kind | integer(kind=I4P) | ||
refinement_levels | integer(kind=I4P) | ||
nodes_number | integer(kind=I4P) | ||
node | type(aabb_node_object) | allocatable | |
is_initialized | logical | ||
use_index | logical |
Type-Bound Procedures
| Name | Attributes | Description |
|---|---|---|
get_refinement_levels | pass(self) | |
get_tree_kind | pass(self) | |
get_nodes_number | pass(self) | |
node_at | pass(self) | |
get_is_initialized | pass(self) | |
get_use_index | pass(self) | |
set_refinement_levels | pass(self) | |
set_tree_kind | pass(self) | |
set_use_index | pass(self) | |
compute_vertices_nearby | pass(self) | |
destroy | pass(self) | |
distance | pass(self) | |
distance_tree | pass(self) | |
distance_tree_with_region | pass(self) | |
distribute_facets | pass(self) | |
distribute_facets_tree | pass(self) | |
has_children | pass(self) | |
initialize | pass(self) | |
loop_node | pass(self) | |
ray_intersections_number | pass(self) | |
intersect_ray_all_tree | pass(self) | |
intersect_ray_first_tree | pass(self) | |
intersect_ray_any_tree | pass(self) | |
save_geometry_tecplot_ascii | pass(self) | |
translate | pass(self) | |
assignment(=) | ||
aabb_tree_assign_aabb_tree | pass(lhs) | |
build_bvh_sah | pass(self) | |
enumerate_children | pass(self) | |
distance_node | pass(self) | |
distance_node_with_region | pass(self) | |
ray_intersections_number_node | pass(self) | |
intersect_ray_all_node | pass(self) | |
intersect_ray_first_node | pass(self) | |
intersect_ray_any_node | pass(self) |
Subroutines
set_refinement_levels
Attributes: elemental
fortran
subroutine set_refinement_levels(self, refinement_levels)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
refinement_levels | integer(kind=I4P) | in |
Call graph
set_tree_kind
Attributes: elemental
fortran
subroutine set_tree_kind(self, tree_kind)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
tree_kind | integer(kind=I4P) | in |
Call graph
set_use_index
Attributes: elemental
fortran
subroutine set_use_index(self, use_index)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
use_index | logical | in |
aabb_tree_finalize
fortran
subroutine aabb_tree_finalize(self)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | type(aabb_tree_object) | inout |
compute_vertices_nearby
Attributes: pure
fortran
subroutine compute_vertices_nearby(self, facet, tolerance_to_be_nearby)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | inout | ||
tolerance_to_be_nearby | real(kind=R8P) | in |
Call graph
destroy
Attributes: elemental
fortran
subroutine destroy(self)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout |
Call graph
distance_tree_with_region
fortran
subroutine distance_tree_with_region(self, facet, point, distance, closest_facet, closest_region)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
point | type(vector_R8P) | in | ||
distance | real(kind=R8P) | out | ||
closest_facet | integer(kind=I4P) | out | ||
closest_region | integer(kind=I4P) | out |
Call graph
distribute_facets
Attributes: pure
fortran
subroutine distribute_facets(self, facet, is_exclusive, do_update_extents)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
facet | type(facet_object) | in | ||
is_exclusive | logical | in | optional | |
do_update_extents | logical | in | optional |
Call graph
distribute_facets_tree
Attributes: pure
fortran
subroutine distribute_facets_tree(self, facet)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
facet | type(facet_object) | in |
Call graph
initialize
Attributes: pure
fortran
subroutine initialize(self, refinement_levels, tree_kind, facet, largest_edge_len, bmin, bmax, do_facets_distribute, is_exclusive, do_update_extents)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
refinement_levels | integer(kind=I4P) | in | optional | |
tree_kind | integer(kind=I4P) | in | optional | |
facet | type(facet_object) | in | optional | |
largest_edge_len | real(kind=R8P) | in | optional | |
bmin | type(vector_R8P) | in | optional | |
bmax | type(vector_R8P) | in | optional | |
do_facets_distribute | logical | in | optional | |
is_exclusive | logical | in | optional | |
do_update_extents | logical | in | optional |
Call graph
build_bvh_sah
Attributes: pure
fortran
subroutine build_bvh_sah(self, facet)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
facet | type(facet_object) | in |
Call graph
build_node
Attributes: pure, recursive
fortran
subroutine build_node(nodes, idx, lo, hi, facet, this_node, next_idx, n_max)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
nodes | type(aabb_node_object) | inout | ||
idx | integer(kind=I4P) | inout | ||
lo | integer(kind=I4P) | in | ||
hi | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
this_node | integer(kind=I4P) | in | ||
next_idx | integer(kind=I4P) | inout | ||
n_max | integer(kind=I4P) | in |
Call graph
compute_node_bboxes
Attributes: pure
fortran
subroutine compute_node_bboxes(facet, idx, lo, hi, node_bmin, node_bmax, centroid_bmin, centroid_bmax)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
facet | type(facet_object) | in | ||
idx | integer(kind=I4P) | in | ||
lo | integer(kind=I4P) | in | ||
hi | integer(kind=I4P) | in | ||
node_bmin | type(vector_R8P) | out | ||
node_bmax | type(vector_R8P) | out | ||
centroid_bmin | type(vector_R8P) | out | ||
centroid_bmax | type(vector_R8P) | out |
Call graph
write_node_bbox
Attributes: pure
fortran
subroutine write_node_bbox(node, bmin, bmax)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | type(aabb_node_object) | inout | ||
bmin | type(vector_R8P) | in | ||
bmax | type(vector_R8P) | in |
Call graph
write_leaf
Attributes: pure
fortran
subroutine write_leaf(node, ids, n)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | type(aabb_node_object) | inout | ||
ids | integer(kind=I4P) | in | ||
n | integer(kind=I4P) | in |
Call graph
expand_bbox
Attributes: pure
fortran
subroutine expand_bbox(bmin, bmax, addmin, addmax)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
bmin | real(kind=R8P) | inout | ||
bmax | real(kind=R8P) | inout | ||
addmin | type(vector_R8P) | in | ||
addmax | type(vector_R8P) | in |
Call graph
save_geometry_tecplot_ascii
fortran
subroutine save_geometry_tecplot_ascii(self, file_name)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
file_name | character(len=*) | in |
Call graph
translate
Attributes: elemental
fortran
subroutine translate(self, delta)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | inout | ||
delta | type(vector_R8P) | in |
Call graph
aabb_tree_assign_aabb_tree
Attributes: pure
fortran
subroutine aabb_tree_assign_aabb_tree(lhs, rhs)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
lhs | class(aabb_tree_object) | inout | ||
rhs | type(aabb_tree_object) | in |
Call graph
enumerate_children
Attributes: pure
fortran
subroutine enumerate_children(self, n, out_idx, nchild)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
out_idx | integer(kind=I4P) | out | ||
nchild | integer(kind=I4P) | out |
Call graph
distance_node
Attributes: recursive
fortran
subroutine distance_node(self, n, facet, point, best)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
point | type(vector_R8P) | in | ||
best | real(kind=R8P) | inout |
Call graph
distance_node_with_region
Attributes: recursive
fortran
subroutine distance_node_with_region(self, n, facet, point, best, best_facet, best_region)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
point | type(vector_R8P) | in | ||
best | real(kind=R8P) | inout | ||
best_facet | integer(kind=I4P) | inout | ||
best_region | integer(kind=I4P) | inout |
Call graph
intersect_ray_all_tree
fortran
subroutine intersect_ray_all_tree(self, facet, ray_origin, ray_direction, hits)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
hits | type(ray_hit_t) | out | allocatable |
Call graph
intersect_ray_all_node
Attributes: recursive
fortran
subroutine intersect_ray_all_node(self, n, facet, ray_origin, ray_direction, tmp, n_hits, n_overflow)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
tmp | type(ray_hit_t) | inout | allocatable | |
n_hits | integer(kind=I4P) | inout | ||
n_overflow | integer(kind=I4P) | inout |
Call graph
intersect_ray_first_tree
fortran
subroutine intersect_ray_first_tree(self, facet, ray_origin, ray_direction, hit, has_hit)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
hit | type(ray_hit_t) | out | ||
has_hit | logical | out |
Call graph
intersect_ray_first_node
Attributes: recursive
fortran
subroutine intersect_ray_first_node(self, n, facet, ray_origin, ray_direction, hit, has_hit, t_best)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
hit | type(ray_hit_t) | inout | ||
has_hit | logical | inout | ||
t_best | real(kind=R8P) | inout |
Call graph
intersect_ray_any_tree
fortran
subroutine intersect_ray_any_tree(self, facet, ray_origin, ray_direction, max_t, found)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
max_t | real(kind=R8P) | in | ||
found | logical | out |
Call graph
intersect_ray_any_node
Attributes: recursive
fortran
subroutine intersect_ray_any_node(self, n, facet, ray_origin, ray_direction, max_t, found)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in | ||
max_t | real(kind=R8P) | in | ||
found | logical | inout |
Call graph
sort_hits_by_t
Attributes: pure
fortran
subroutine sort_hits_by_t(hits)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
hits | type(ray_hit_t) | inout |
Call graph
next_location_code
Attributes: pure
fortran
subroutine next_location_code(location_code, direction, next_code, next_direction)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
location_code | integer(kind=I4P) | in | ||
direction | integer(kind=I4P) | in | ||
next_code | integer(kind=I4P) | out | allocatable | |
next_direction | integer(kind=I4P) | out |
Functions
auto_refinement_levels
Attributes: pure
Returns: integer(kind=I4P)
fortran
function auto_refinement_levels(facets_number) result(levels)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
facets_number | integer(kind=I4P) | in |
Call graph
get_refinement_levels
Attributes: pure
Returns: integer(kind=I4P)
fortran
function get_refinement_levels(self) result(n)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in |
Call graph
get_tree_kind
Attributes: pure
Returns: integer(kind=I4P)
fortran
function get_tree_kind(self) result(kind)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in |
Call graph
get_nodes_number
Attributes: pure
Returns: integer(kind=I4P)
fortran
function get_nodes_number(self) result(n)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in |
Call graph
node_at
Returns: type(aabb_node_object)
fortran
function node_at(self, i) result(p)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | target | |
i | integer(kind=I4P) | in |
Call graph
get_is_initialized
Attributes: pure
Returns: logical
fortran
function get_is_initialized(self) result(yes)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in |
Call graph
get_use_index
Attributes: pure
Returns: logical
fortran
function get_use_index(self) result(yes)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in |
Call graph
distance
Attributes: pure
Returns: real(kind=R8P)
fortran
function distance(self, facet, point)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
point | type(vector_R8P) | in |
Call graph
distance_tree
Returns: real(kind=R8P)
fortran
function distance_tree(self, facet, point) result(distance)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
point | type(vector_R8P) | in |
Call graph
has_children
Attributes: pure
Returns: logical
fortran
function has_children(self, node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
node | integer(kind=I4P) | in |
Call graph
surface_area
Attributes: pure
Returns: real(kind=R8P)
fortran
function surface_area(bmin, bmax) result(sa)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
bmin | type(vector_R8P) | in | ||
bmax | type(vector_R8P) | in |
Call graph
surface_area_arr
Attributes: pure
Returns: real(kind=R8P)
fortran
function surface_area_arr(bmin, bmax) result(sa)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
bmin | real(kind=R8P) | in | ||
bmax | real(kind=R8P) | in |
Call graph
loop_node
Returns: logical
fortran
function loop_node(self, facet, aabb_facet, b, l) result(again)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | optional | |
aabb_facet | type(facet_object) | out | allocatable, optional | |
b | integer(kind=I4P) | out | optional | |
l | integer(kind=I4P) | out | optional |
Call graph
ray_intersections_number
Returns: integer(kind=I4P)
fortran
function ray_intersections_number(self, facet, ray_origin, ray_direction) result(intersections_number)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in |
Call graph
ray_intersections_number_node
Attributes: recursive
Returns: integer(kind=I4P)
fortran
function ray_intersections_number_node(self, n, facet, ray_origin, ray_direction) result(intersections_number)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
self | class(aabb_tree_object) | in | ||
n | integer(kind=I4P) | in | ||
facet | type(facet_object) | in | ||
ray_origin | type(vector_R8P) | in | ||
ray_direction | type(vector_R8P) | in |
Call graph
first_child_node
Attributes: pure
Returns: integer(kind=I4P)
fortran
function first_child_node(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
Call graph
first_node
Attributes: pure
Returns: integer(kind=I4P)
fortran
function first_node(level)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
level | integer(kind=I4P) | in |
Call graph
last_node
Attributes: pure
Returns: integer(kind=I4P)
fortran
function last_node(level)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
level | integer(kind=I4P) | in |
Call graph
level
Attributes: pure
Returns: integer(kind=I4P)
fortran
function level(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
local_id
Attributes: pure
Returns: integer(kind=I4P)
fortran
function local_id(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
Call graph
location_code
Attributes: pure
Returns: integer(kind=I4P)
fortran
function location_code(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
Call graph
global_id
Attributes: pure
Returns: integer(kind=I4P)
fortran
function global_id(location_code) result(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
location_code | integer(kind=I4P) | in |
Call graph
nodes_number
Attributes: pure
Returns: integer(kind=I4P)
fortran
function nodes_number(refinement_levels)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
refinement_levels | integer(kind=I4P) | in |
Call graph
nodes_number_at_level
Attributes: pure
Returns: integer(kind=I4P)
fortran
function nodes_number_at_level(level) result(nodes_number)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
level | integer(kind=I4P) | in |
Call graph
parent_at_level
Attributes: pure
Returns: integer(kind=I4P)
fortran
function parent_at_level(node, parent_level) result(parent)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in | ||
parent_level | integer(kind=I4P) | in |
parent_node
Attributes: pure
Returns: integer(kind=I4P)
fortran
function parent_node(node)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
Call graph
siblings
Attributes: pure
Returns: integer(kind=I4P)
fortran
function siblings(node) result(sbs)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
node | integer(kind=I4P) | in |
Call graph
str_location_code
Attributes: pure
Returns: character(len=:)
fortran
function str_location_code(code)Arguments
| Name | Type | Intent | Attributes | Description |
|---|---|---|---|---|
code | integer(kind=I4P) | in |
Call graph