|
Neko 0.9.1
A portable framework for high-order spectral element flow simulations
|
Node type for the Axis Aligned Bounding Box (aabb) Tree. More...

Public Member Functions | |
| procedure, pass, public | init (this) |
| Initializes the AABB node. | |
| procedure, pass, public | get_aabb (this) |
| Returns the Axis Aligned Bounding Box (aabb) of the node. | |
| procedure, pass, public | get_object_index (this) |
| Returns the object index of the node. | |
| procedure, pass, public | get_parent_index (this) |
| Returns the parent index of the node. | |
| procedure, pass, public | get_left_index (this) |
| Returns the left index of the node. | |
| procedure, pass, public | get_right_index (this) |
| Returns the right index of the node. | |
| procedure, pass, public | min_distance (this, p) |
| Get the minimum possible distance from the aabb to a point. | |
| procedure, pass, public | is_leaf (this) |
| Returns true if the node is a leaf node. | |
| procedure, pass, public | is_valid (this) |
| Returns true if the node is a valid node. | |
| generic | operator (this, other) |
| Returns true if the node is less than the other node. | |
| generic | operator (this, other) |
| Returns true if the node is greater than the other node. | |
| procedure, pass(this) | less (this, other) |
| Returns true if the node is less than the other node. | |
| procedure, pass(this) | greater (this, other) |
| Returns true if the node is greater than the other node. | |
Public Attributes | |
| type(aabb_t), public | aabb |
| integer | object_index = -1 |
| integer | parent_node_index = AABB_NULL_NODE |
| integer | left_node_index = AABB_NULL_NODE |
| integer | right_node_index = AABB_NULL_NODE |
| integer | next_node_index = AABB_NULL_NODE |
Definition at line 85 of file aabb_tree.f90.
Definition at line 102 of file aabb_tree.f90.
| procedure, pass, public aabb_tree::aabb_node_t::get_left_index | ( | class(aabb_node_t), intent(in) | this | ) |
Definition at line 107 of file aabb_tree.f90.
| procedure, pass, public aabb_tree::aabb_node_t::get_object_index | ( | class(aabb_node_t), intent(in) | this | ) |
Definition at line 103 of file aabb_tree.f90.
| procedure, pass, public aabb_tree::aabb_node_t::get_parent_index | ( | class(aabb_node_t), intent(in) | this | ) |
Definition at line 105 of file aabb_tree.f90.
| procedure, pass, public aabb_tree::aabb_node_t::get_right_index | ( | class(aabb_node_t), intent(in) | this | ) |
Definition at line 109 of file aabb_tree.f90.
| procedure, pass(this) aabb_tree::aabb_node_t::greater | ( | class(aabb_node_t), intent(in) | this, |
| class(aabb_node_t), intent(in) | other | ||
| ) |
Definition at line 124 of file aabb_tree.f90.
Definition at line 99 of file aabb_tree.f90.
Definition at line 116 of file aabb_tree.f90.
Definition at line 117 of file aabb_tree.f90.
| procedure, pass(this) aabb_tree::aabb_node_t::less | ( | class(aabb_node_t), intent(in) | this, |
| class(aabb_node_t), intent(in) | other | ||
| ) |
Definition at line 123 of file aabb_tree.f90.
| procedure, pass, public aabb_tree::aabb_node_t::min_distance | ( | class(aabb_node_t), intent(in) | this, |
| real(kind=dp), dimension(3), intent(in) | p | ||
| ) |
Definition at line 113 of file aabb_tree.f90.
| generic aabb_tree::aabb_node_t::operator | ( | class(aabb_node_t), intent(in) | this, |
| class(aabb_node_t), intent(in) | other | ||
| ) |
Definition at line 120 of file aabb_tree.f90.
| generic aabb_tree::aabb_node_t::operator | ( | class(aabb_node_t), intent(in) | this, |
| class(aabb_node_t), intent(in) | other | ||
| ) |
Definition at line 121 of file aabb_tree.f90.
Definition at line 87 of file aabb_tree.f90.
| integer aabb_tree::aabb_node_t::left_node_index = AABB_NULL_NODE |
Definition at line 92 of file aabb_tree.f90.
| integer aabb_tree::aabb_node_t::next_node_index = AABB_NULL_NODE |
Definition at line 96 of file aabb_tree.f90.
| integer aabb_tree::aabb_node_t::object_index = -1 |
Definition at line 88 of file aabb_tree.f90.
| integer aabb_tree::aabb_node_t::parent_node_index = AABB_NULL_NODE |
Definition at line 91 of file aabb_tree.f90.
| integer aabb_tree::aabb_node_t::right_node_index = AABB_NULL_NODE |
Definition at line 93 of file aabb_tree.f90.