search()

template<uint32_t K>

bool scl::kd_tree< K >::search ( const item & point ) const

inline

Search for a point in the kd_tree. Start at the root, comparing the search point’s first dimension with the root’s first dimension. If the search point’s value is less than the root’s, go to the left child; otherwise, go to the right child. At the next level, compare the second dimension. Continue this process, cycling through dimensions. If an exact match is found, return true. If a leaf is reached without finding a match, return false.

Parameters

[in]

point

Searched point in k d.

Returns

Returns true if found.

Definition at line 623 of file KDTree.h.

    {
        return search_recursive(m_Root, point, 0);
    }

References scl::kd_tree< K >::m_Root, and scl::kd_tree< K >::search_recursive().