massspec/kdtree.h

#ifndef _KD_TREE_H_
#define _KD_TREE_H_

enum {KDREE_LOWER, KDTREE_UPPER};

typedef int ElementType;

typedef ElementType ItemType[3];

struct KdNode;
typedef struct KdNode* Position;
typedef struct KdNode* KdTree;

struct KdNode
{
        ItemType Data;
        KdTree   Left;
        KdTree   Right;
};

KdTree  Insert( ItemType Item, KdTree T );
void    PrintRange(ItemType* array_to_be_filled, int max_size, int* size_of_array, ItemType Low, ItemType High, KdTree T );

struct KdItem2f
{
        float x[2];
        void* pointer;
};

typedef struct KdItem2f KdItem2f;

struct KdNode2f
{
        struct KdItem2f   data;
        struct KdNode2f*    left;
        struct KdNode2f*    right;
};


typedef struct KdNode2f KdNode2f;

typedef struct KdNode2f* KdTree2f;

void (*KdTree2f_setElement) (const void* array, int index, const void* data);

static KdTree2f KdTree2f_recursiveInsert(KdTree2f T,  KdItem2f* item, int level);
KdTree2f                KdTree2f_insert                 (KdTree2f T,  KdItem2f* item);

void KdTree2f_getArrayInRange(KdTree2f T, void* array_to_be_filled, int max_size, 
                                                                         int* size_of_array, KdItem2f* low, KdItem2f* high);

void KdTree2f_countElementsInRange(KdTree2f T, int* size_of_array, 
                                                                   KdItem2f* low, KdItem2f* high);
#endif

---