Sorted list of intersections.
More...
|
procedure | clear (intersection_list) |
| Reset intersection list.
|
|
procedure | push (intersection_list, intersection) |
| Add an intersection to the list.
|
|
|
type(t_intersection), dimension(:), allocatable | intersection |
| List of intersections.
|
|
integer | n_intersections = 0 |
| Number of intersection.
|
|
Intersections are sorted by distance.
◆ clear()
procedure mod_ray_tracing::t_intersection_list::clear |
( |
class(t_intersection_list), intent(inout) | intersection_list | ) |
|
Do not deallocate the list, just reset the number of intersections to zero.
- Parameters
-
[in,out] | intersection_list | List of intersections. |
◆ push()
If the distance of the intersection to push is greater than the last item of the list, no insertion is required, this implies better performances.
Whenever it is possible, prefer to insert the intersections in a sorted order.
- Parameters
-
[in,out] | intersection_list | List of intersections. |
[in] | intersection | Intersection. |
The documentation for this type was generated from the following file:
- src/lib/geometry/computational_geometry/ray_tracing/ray_tracing.f90