#include "Tree/ball_algorithm.h"
Functions | |
void | dual_swap (double *darr, int *iarr, int i1, int i2) |
t_nheap * | nheap_init (int n_pts, int n_nbrs) |
void | nheap_load (t_nheap *heap, t_btree *b, const double **x) |
double | nheap_largest (t_nheap *h, int row) |
int | nheap_push (t_nheap *h, int row, double val, int i_val) |
void | simultaneous_sort (double *dist, int *idx, int size) |
void | nheap_sort (t_nheap *h) |
void dual_swap | ( | double * | darr, |
int * | iarr, | ||
int | i1, | ||
int | i2 | ||
) |
t_nheap* nheap_init | ( | int | n_pts, |
int | n_nbrs | ||
) |
double nheap_largest | ( | t_nheap * | h, |
int | row | ||
) |
int nheap_push | ( | t_nheap * | h, |
int | row, | ||
double | val, | ||
int | i_val | ||
) |
void nheap_sort | ( | t_nheap * | h | ) |
void simultaneous_sort | ( | double * | dist, |
int * | idx, | ||
int | size | ||
) |