ck-ldb/tm_bucket.h File Reference

Go to the source code of this file.

Data Structures
struct	coord
struct	bucket_t
struct	_bucket_list_t
Typedefs
typedef _bucket_list_t *	bucket_list_t
Functions
void	bucket_grouping (double **tab, tree_t *tab_node, tree_t *new_tab_node, int arity, int N, int M, long int k)
int	try_add_edge (double **tab, tree_t *tab_node, tree_t *parent, int arity, int i, int j, int N, int *nb_groups)

---

Typedef Documentation

typedef _bucket_list_t* bucket_list_t

Definition at line 29 of file tm_bucket.h.

---

Function Documentation

void bucket_grouping	(	double **	tab,
		tree_t *	tab_node,
		tree_t *	new_tab_node,
		int	arity,
		int	N,
		int	M,
		long int	k
	)

Definition at line 452 of file tm_bucket.C.

References _bucket_list_t::bucket_indice, _bucket_list_t::cur_bucket, display_pivots(), free_bucket_list(), PUP::l, next_bucket_elem(), partial_sort(), try_add_edge(), update_val(), and _tree_t::val.

Referenced by group_nodes().

Here is the call graph for this function:

Here is the caller graph for this function:

int try_add_edge	(	double **	tab,
		tree_t *	tab_node,
		tree_t *	parent,
		int	arity,
		int	i,
		int	j,
		int	N,
		int *	nb_groups
	)

Definition at line 398 of file tm_bucket.C.

References add_edge_3(), assert, _tree_t::child, and _tree_t::parent.

Referenced by bucket_grouping(), and super_fast_grouping().

Here is the call graph for this function:

Here is the caller graph for this function: