Class xlifepp::KdNode# template<class T>class KdNode# Inheritence diagram for xlifepp::KdNode: digraph { graph [bgcolor="#00000000"] node [shape=rectangle style=filled fillcolor="#FFFFFF" font=Helvetica padding=2] edge [color="#1414CE"] "2" [label="xlifepp::KdNode< xlifepp::Point >" tooltip="xlifepp::KdNode< xlifepp::Point >"] "1" [label="xlifepp::KdNode< T >" tooltip="xlifepp::KdNode< T >" fillcolor="#BFBFBF"] "2" -> "1" [dir=forward tooltip="template-instance"] } Collaboration diagram for xlifepp::KdNode: digraph { graph [bgcolor="#00000000"] node [shape=rectangle style=filled fillcolor="#FFFFFF" font=Helvetica padding=2] edge [color="#1414CE"] "2" [label="xlifepp::KdNode< T >" tooltip="xlifepp::KdNode< T >"] "1" [label="xlifepp::KdNode< T >" tooltip="xlifepp::KdNode< T >" fillcolor="#BFBFBF"] "2" -> "2" [dir=forward tooltip="usage"] "1" -> "2" [dir=forward tooltip="usage"] } node of a KdTree Public Functions inline KdNode()# default constructor inline KdNode(const T *O, int s, KdNode *p)# basic constructor ~KdNode()# destructor number_t &depth(number_t&) const# return node depth void insert(const T*)# node insertion inline bool isVoid() const# true if a void node inline const T *objectp() const# return object pointer linked to node void print(std::ostream&, std::string&) const# print utility void printBoxes(std::ostream &os, Box<SvType> b) const# print utility void searchNearest(const T*, const T*&, SvType&)# search in tree from current node Friends template<class S>friend std::ostream &operator<<(std::ostream &os, const KdNode<S> &node)# print operator
