insert_async()

template<uint32_t K>

void scl::kd_tree< K >::insert_async ( const std::vector< item > & points, Spices::ThreadPool * threadPool )

inline

Insert a point into the kd_tree async. Start at the root, comparing the new point’s first dimension with the root’s first dimension. If the new 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. When a leaf is reached, create a new node and insert the new point.

Parameters

[in]	points	Inserted points in k d.
[in]	threadPool	ThreadPool.

Todo

Only block this task.

Definition at line 608 of file KDTree.h.

    {
        std::future<bool> rval = threadPool->SubmitPoolTask([&]() {
            insert_recursive_async(m_Root, std::make_shared<std::vector<item>>(points), threadPool, 0);
            return true;
        });
        rval.get();
 
        threadPool->Wait();
    }