Class xlifepp::KdTree#

template<class T> class KdTree#

definition of a Kd-tree

Public Functions

inline KdTree()#: default constructor

KdTree(const std::vector<T>&)#: basic constructor

inline ~KdTree()#: destructor

void build(const std::vector<const T*>&)#: build a balanced tree from objects (the tree is cleared before)

void clear()#: clear KdTree

number_t depth() const#: return the depth of the tree

inline dimen_t dim() const#: returns dimension

void insert(const std::vector<T>&)#: insert objects set given by vector

void insert(const T&)#: insert object

template<typename iterator> void insert(iterator, iterator)#: insert objects set given by an iterator range

inline bool isVoid() const#: true if a void tree

void print(std::ostream &out) const#: print utility

template<typename R> void printBoxes(const std::string &file, const Box<R> &rb)#: print utility

template<typename R> void printBoxes(std::ostream &os, const Box<R> &rb)#: print utility

const T *searchNearest(const T&) const#: search the nearest Object in the KdTree of a given Object

Friends

template<class S> friend std::ostream &operator<<(std::ostream &os, const KdTree<S> &node)#: print operator