kdtree2.f90 File Reference

Go to the source code of this file.

Data Types
type	kdtree2_priority_queue_module::kdtree2_result
type	kdtree2_priority_queue_module::pq
type	kdtree2_module::interval
type	kdtree2_module::tree_node
type	kdtree2_module::kdtree2

Modules
module	kdtree2_precision_module
module	kdtree2_priority_queue_module
module	kdtree2_module

Functions/Subroutines
type(pq) function, public	kdtree2_priority_queue_module::pq_create (results_in)
subroutine, public	kdtree2_priority_queue_module::pq_max (a, e)
real(kdkind) function, public	kdtree2_priority_queue_module::pq_maxpri (a)
subroutine, public	kdtree2_priority_queue_module::pq_extract_max (a, e)
real(kdkind) function, public	kdtree2_priority_queue_module::pq_insert (a, dis, idx)
real(kdkind) function, public	kdtree2_priority_queue_module::pq_replace_max (a, dis, idx)
subroutine, public	kdtree2_priority_queue_module::pq_delete (a, i)
type(kdtree2) function, pointer, public	kdtree2_module::kdtree2_create (input_data, dim, sort, rearrange)
subroutine, public	kdtree2_module::kdtree2_destroy (tp)
subroutine, public	kdtree2_module::kdtree2_n_nearest (tp, qv, nn, results)
subroutine, public	kdtree2_module::kdtree2_n_nearest_around_point (tp, idxin, correltime, nn, results)
subroutine, public	kdtree2_module::kdtree2_r_nearest (tp, qv, r2, nfound, nalloc, results)
subroutine, public	kdtree2_module::kdtree2_r_nearest_around_point (tp, idxin, correltime, r2, nfound, nalloc, results)
integer function, public	kdtree2_module::kdtree2_r_count (tp, qv, r2)
integer function, public	kdtree2_module::kdtree2_r_count_around_point (tp, idxin, correltime, r2)
subroutine, public	kdtree2_module::kdtree2_n_nearest_brute_force (tp, qv, nn, results)
subroutine, public	kdtree2_module::kdtree2_r_nearest_brute_force (tp, qv, r2, nfound, results)
subroutine, public	kdtree2_module::kdtree2_sort_results (nfound, results)

Variables
integer, parameter, public	kdtree2_precision_module::kdkind = dp
integer, parameter	kdtree2_module::bucket_size = 12