This is the complete list of members for scl::kd_tree< K >, including all inherited members.

deletenode_recursive(Node *node)	scl::kd_tree< K >	inlineprivate
insert(const std::vector< item > &points)	scl::kd_tree< K >	inline
insert_async(const std::vector< item > &points, Spices::ThreadPool *threadPool)	scl::kd_tree< K >	inline
insert_recursive(Node *&node, std::shared_ptr< std::vector< item > > points, int depth)	scl::kd_tree< K >	inlineprivate
insert_recursive_async(Node &node, std::shared_ptr< std::vector< item > > points, Spices::ThreadPool threadPool, int depth)	scl::kd_tree< K >	inlineprivate
item typedef	scl::kd_tree< K >
kd_tree()	scl::kd_tree< K >	inline
m_Root	scl::kd_tree< K >	private
m_Size	scl::kd_tree< K >	private
nearest_neighbour_search(const item &point, const item &condition) const -> item	scl::kd_tree< K >	inline
print() const	scl::kd_tree< K >	inline
print_recursive(Node *node, int depth) const	scl::kd_tree< K >	inlineprivate
range_search(const item &point, const item &condition) const -> std::vector< item >	scl::kd_tree< K >	inline
range_search_recursive(Node *node, const item &point, const item &condition, std::vector< item > &rangePoints, int depth) const	scl::kd_tree< K >	inlineprivate
search(const item &point) const	scl::kd_tree< K >	inline
search_recursive(Node *node, const item &point, int depth) const	scl::kd_tree< K >	inlineprivate
size() const	scl::kd_tree< K >	inline
~kd_tree()	scl::kd_tree< K >	inlinevirtual