[mlpack-git] [mlpack/mlpack] Spill trees (#747)
notifications at github.com
Mon Aug 8 16:57:48 EDT 2016
> + }
> + std::vector<size_t> leftPoints, rightPoints;
> + // Split the node.
> + overlappingNode = SplitPoints(tau, rho, points, leftPoints, rightPoints);
> + // We don't need the information in points, so lets clean it.
> + std::vector<size_t>().swap(points);
> + // Now we will recursively split the children by calling their constructors
> + // (which perform this splitting process).
> + left = new SpillTree(this, leftPoints, tau, maxLeafSize, rho);
> + right = new SpillTree(this, rightPoints, tau, maxLeafSize, rho);
> + // Update count number, to represent the number of descendant points.
> + count = left->NumDescendants() + right->NumDescendants();
@rcurtin Thanks for your comments.
Why do you think this can cause problems?
This implementation is different to the implementation of `BinarySpaceTrees`. I don't provide methods such as: `Begin()` and `Count()`.
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the mlpack-git