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

[lozhnikov]

> @@ -0,0 +1,118 @@
> +/**
> + * @file minimal_coverage_sweep.hpp
> + * @author Mikhail Lozhnikov
> + *
> + * Definition of the MinimalCoverageSweep class, a class that finds a partition
> + * of a node along an axis.
> + */
> +#ifndef MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_COVERAGE_SWEEP_HPP
> +#define MLPACK_CORE_TREE_RECTANGLE_TREE_MINIMAL_COVERAGE_SWEEP_HPP
> +
> +namespace mlpack {
> +namespace tree {
> +
> +constexpr double fillFactor = 0.5;

I think `fillFactor` is not needed 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/0f16e54611c229e39757aeb675b42c5a17bdde80#r68850684
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://mailman.cc.gatech.edu/pipermail/mlpack-git/attachments/20160628/2f19cf16/attachment.html>