search_recursive()

template<uint32_t K>

bool scl::kd_tree< K >::search_recursive ( Node * node, const item & point, int depth ) const

inlineprivate

Recursive function to search for a point in the kd_tree.

Parameters

[in]	node	recursive node.
[in]	point	Searched point in k d.
[in]	depth	recursive depth.

Returns

Returns true if found.

Base case: If node is null, the point is not found.

If the current node matches the point, return true.

Calculate current dimension (cd).

Compare point with current node and decide to go left or right.

Definition at line 421 of file KDTree.h.

    {
        if (node == nullptr)
        {
            return false;
        }
 
        if (node->m_Point == point)
        {
            return true;
        }
 
        int cd = depth % K;
 
        if (point[cd] < node->m_Point[cd])
        {
            return search_recursive(node->m_Left, point, depth + 1);
        }
        else
        {
            return search_recursive(node->m_Right, point, depth + 1);
        }
    }

References scl::kd_tree< K >::search_recursive().

Referenced by scl::kd_tree< K >::search(), and scl::kd_tree< K >::search_recursive().