[mlpack-git] [mlpack/mlpack] Vantage point tree (#708)

[lozhnikov]

> +    {
> +      for (size_t i = 0; i < queryNode.NumDescendants(); ++i)
> +        rule.BaseCase(queryNode.Descendant(i), referenceNode.Point(0));
> +      numBaseCases += queryNode.NumDescendants();
> +    }
> +    // We have to recurse down both query and reference nodes.  Because the
> +    // query descent order does not matter, we will go to the left query child
> +    // first.  Before recursing, we have to set the traversal information
> +    // correctly.
> +
> +    double leftScore;
> +    typename RuleType::TraversalInfoType leftInfo;
> +    double rightScore;
> +    typename RuleType::TraversalInfoType rightInfo;
> +
> +    if (queryNode.IsFirstPointCentroid())

Use the single tree traverser if the query node contains a point.

---
You are receiving this because you are subscribed to this thread.
Reply to this email directly or view it on GitHub:
https://github.com/mlpack/mlpack/pull/708/files/300882ac96e7a663e3e303ca0c45c14c6fafe1a6#r71837406
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160722/e1473e1f/attachment-0001.html>