type_kdtree Module Reference

Data Types
type	kdtree_type

Functions/Subroutines
subroutine	kdtree_create (kdtree, mpl, n, lon, lat, mask, sort, rearrange)
subroutine	kdtree_dealloc (kdtree)
subroutine	kdtree_find_nearest_neighbors (kdtree, lon, lat, nn, nn_index, nn_dist)
subroutine	kdtree_count_nearest_neighbors (kdtree, lon, lat, sr, nn)

Function/Subroutine Documentation

kdtree_count_nearest_neighbors()

subroutine type_kdtree::kdtree_count_nearest_neighbors ( class(kdtree_type), intent(in)  kdtree, real(kind_real), intent(in)  lon, real(kind_real), intent(in)  lat, real(kind_real), intent(in)  sr, integer, intent(out)  nn  )

private

Definition at line 199 of file type_kdtree.F90.

Here is the call graph for this function:

kdtree_create()

subroutine type_kdtree::kdtree_create ( class(kdtree_type), intent(inout)  kdtree, type(mpl_type), intent(in)  mpl, integer, intent(in)  n, real(kind_real), dimension(n), intent(in)  lon, real(kind_real), dimension(n), intent(in)  lat, logical, dimension(n), intent(in), optional  mask, logical, intent(in), optional  sort, logical, intent(in), optional  rearrange  )

private

Definition at line 42 of file type_kdtree.F90.

Here is the call graph for this function:

kdtree_dealloc()

subroutine type_kdtree::kdtree_dealloc ( class(kdtree_type), intent(inout)  kdtree )

private

Definition at line 115 of file type_kdtree.F90.

Here is the call graph for this function:

kdtree_find_nearest_neighbors()

subroutine type_kdtree::kdtree_find_nearest_neighbors ( class(kdtree_type), intent(in)  kdtree, real(kind_real), intent(in)  lon, real(kind_real), intent(in)  lat, integer, intent(in)  nn, integer, dimension(nn), intent(out)  nn_index, real(kind_real), dimension(nn), intent(out)  nn_dist  )

private

Definition at line 136 of file type_kdtree.F90.

Here is the call graph for this function: