neighbors_heap.cpp File Reference

#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)
t_nheap *	nheap_free (t_nheap *heap)
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)

Function Documentation

dual_swap()

void dual_swap	(	double *	darr,
		int *	iarr,
		int	i1,
		int	i2
	)

nheap_free()

t_nheap* nheap_free

(

t_nheap *

heap

)

nheap_init()

t_nheap* nheap_init	(	int	n_pts,
		int	n_nbrs
	)

nheap_largest()

double nheap_largest	(	t_nheap *	h,
		int	row
	)

nheap_load()

void nheap_load	(	t_nheap *	heap,
		t_btree *	b,
		const double **	x
	)

nheap_push()

int nheap_push	(	t_nheap *	h,
		int	row,
		double	val,
		int	i_val
	)

nheap_sort()

void nheap_sort

(

t_nheap *

h

)

simultaneous_sort()

void simultaneous_sort	(	double *	dist,
		int *	idx,
		int	size
	)