#include "kkutils.h"
#include "closest.h"
#include <stdlib.h>

Include dependency graph for closest.c:

Data Structures
struct	Pair

struct	PairStack

struct	PairHeap

Macros
#define	LT(p, q) ((p).dist < (q).dist)

#define	EQ(p, q) ((p).dist == (q).dist)

#define	push(s, x)

#define	pop(s, x) ((s->top==0) ? FALSE : (s->top--, x = s->data[s->top], TRUE))

#define	read_top(h, x) ((s->top==0) ? FALSE : (x = s->data[s->top-1], TRUE))

#define	sub(h, i) (h->data[i])

#define	left(i) (2*(i))

#define	right(i) (2*(i)+1)

#define	parent(i) ((i)/2)

#define	insideHeap(h, i) ((i)<h->heapSize)

#define	greaterPriority(h, i, j) (LT(h->data[i],h->data[j]) \|\| ((EQ(h->data[i],h->data[j])) && (rand()%2)))

#define	exchange(h, i, j)

#define	assign(h, i, j) {h->data[i]=h->data[j]}

Functions
void	closest_pairs2graph (double place, int n, int num_pairs, vtx_data *graph)

Macro Definition Documentation

#define assign	(	h,
		i,
		j
	)	{h->data[i]=h->data[j]}

Definition at line 98 of file closest.c.

#define EQ	(	p,
		q
	)	((p).dist == (q).dist)

Definition at line 34 of file closest.c.

#define exchange	(	h,
		i,
		j
	)

Value:

{Pair temp; \
        temp=h->data[i]; \
        h->data[i]=h->data[j]; \
        h->data[j]=temp; \
}

Definition at line 93 of file closest.c.

Referenced by build_ranks().

#define greaterPriority	(	h,
		i,
		j
	)	(LT(h->data[i],h->data[j]) \|\| ((EQ(h->data[i],h->data[j])) && (rand()%2)))

Definition at line 90 of file closest.c.

#define insideHeap	(	h,
		i
	)	((i)<h->heapSize)

Definition at line 89 of file closest.c.

#define left ( i ) (2*(i))

Definition at line 86 of file closest.c.

#define LT	(	p,
		q
	)	((p).dist < (q).dist)

Definition at line 33 of file closest.c.

#define parent ( i ) ((i)/2)

Definition at line 88 of file closest.c.

Referenced by createBlocktree(), lookup_widget(), and push_obj_state().

#define pop	(	s,
		x
	)	((s->top==0) ? FALSE : (s->top--, x = s->data[s->top], TRUE))

Definition at line 71 of file closest.c.

#define push	(	s,
		x
	)

Value:

{ \
	if (s->top>=s->max_size) { \
                s->max_size *= 2; \
                s->data = (Pair*) realloc(s->data, s->max_size*sizeof(Pair)); \
        } \
        s->data[s->top++] = x; \
}