[mlpack-git] [mlpack/mlpack] R+ and R++ trees implementation (#699)

[Ryan Curtin]

> + * @tparam SplitPolicy The class that provides rules for inserting children of
> + *    a node that is being split into two new subtrees.
> + */
> +template<typename SplitPolicy>
> +class MinimalCoverageSweep
> +{
> + private:
> +  /**
> +   * Class to allow for faster sorting.
> +   */
> +  template<typename ElemType>
> +  struct SortStruct
> +  {
> +    ElemType d;
> +    int n;
> +  };

I think that `SortStruct` is used a few other places, but does it give us any advantage over `std::pair<ElemType, int>`?  It's possible that `SortStruct` is faster, but I am not sure of that.  Have you played with that at all?

---
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/699/files/e165d759f9ae612b9965f70fbbf8abdb19dc8d07#r69015500
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160629/0b3a0285/attachment-0001.html>