shark::KDTree< InputT > Member List

This is the complete list of members for shark::KDTree< InputT >, including all inherited members.

BinaryTree(std::size_t size)	shark::BinaryTree< InputT >	inline
BinaryTree(BinaryTree *parent, std::size_t *list, std::size_t size)	shark::BinaryTree< InputT >	inlineprotected
buildTree(TreeConstruction tc, Range &points)	shark::KDTree< InputT >	inlineprotected
calculateCuttingDimension(Range const &points) const	shark::KDTree< InputT >	inlineprotected
distanceFromPlane(value_type const &point) const	shark::BinaryTree< InputT >	inline
funct(InputT const &reference) const	shark::KDTree< InputT >	inlineprotectedvirtual
hasChildren() const	shark::BinaryTree< InputT >	inline
index(std::size_t point) const	shark::BinaryTree< InputT >	inline
isLeaf() const	shark::BinaryTree< InputT >	inline
isLeft(value_type const &point) const	shark::BinaryTree< InputT >	inline
isRight(value_type const &point) const	shark::BinaryTree< InputT >	inline
KDTree(Data< InputT > const &dataset, TreeConstruction tc=TreeConstruction())	shark::KDTree< InputT >	inline
KDTree(KDTree *parent, std::size_t *list, std::size_t size)	shark::KDTree< InputT >	inlineprotected
kernel() const	shark::BinaryTree< InputT >	inlinevirtual
left()	shark::BinaryTree< InputT >	inline
left() const	shark::BinaryTree< InputT >	inline
lower(std::size_t dim) const	shark::KDTree< InputT >	inline
m_cutDim	shark::KDTree< InputT >	protected
m_nodes	shark::BinaryTree< InputT >	protected
m_size	shark::BinaryTree< InputT >	protected
m_threshold	shark::BinaryTree< InputT >	protected
mep_parent	shark::BinaryTree< InputT >	protected
mp_indexList	shark::BinaryTree< InputT >	protected
mp_left	shark::BinaryTree< InputT >	protected
mp_right	shark::BinaryTree< InputT >	protected
nodes() const	shark::BinaryTree< InputT >	inline
parent()	shark::BinaryTree< InputT >	inline
parent() const	shark::BinaryTree< InputT >	inline
right()	shark::BinaryTree< InputT >	inline
right() const	shark::BinaryTree< InputT >	inline
size() const	shark::BinaryTree< InputT >	inline
splitList(Range1 &values, Range2 &points)	shark::BinaryTree< InputT >	inlineprotected
squaredDistanceLowerBound(InputT const &reference) const	shark::KDTree< InputT >	inlinevirtual
threshold() const	shark::BinaryTree< InputT >	inline
upper(std::size_t dim) const	shark::KDTree< InputT >	inline
~BinaryTree()	shark::BinaryTree< InputT >	inlinevirtual