|
| type(pq) function, public | kdtree2_priority_queue_module::pq_create (results_in) |
| |
| subroutine, public | kdtree2_priority_queue_module::pq_max (a, e) |
| |
| real(kind=realtype) function, public | kdtree2_priority_queue_module::pq_maxpri (a) |
| |
| subroutine, public | kdtree2_priority_queue_module::pq_extract_max (a, e) |
| |
| real(kind=realtype) function, public | kdtree2_priority_queue_module::pq_insert (a, dis, idx) |
| |
| real(kind=realtype) 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) |
| |
| integer(kind=inttype) function | kdtree2_module::select_on_coordinate_value (v, ind, c, alpha, li, ui) |
| |
| subroutine, public | kdtree2_module::kdtree2destroy (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(kind=inttype) function, public | kdtree2_module::kdtree2_r_count (tp, qv, r2) |
| |
| integer(kind=inttype) 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) |
| |
