[mlpack-git] master, mlpack-1.0.x: Oops, this needed to be divided by 2. (f74af58)

[gitdub at big.cc.gt.atl.ga.us]

Repository : https://github.com/mlpack/mlpack

On branches: master,mlpack-1.0.x
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

>---------------------------------------------------------------

commit f74af589fe512963725d44aeef7bc23447be9503
Author: Ryan Curtin <ryan at ratml.org>
Date:   Thu Jul 10 14:46:35 2014 +0000

    Oops, this needed to be divided by 2.


>---------------------------------------------------------------

f74af589fe512963725d44aeef7bc23447be9503
 src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp | 2 +-
 src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp            | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp b/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp
index dc82eab..35db29a 100644
--- a/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp
+++ b/src/mlpack/core/tree/binary_space_tree/binary_space_tree_impl.hpp
@@ -470,7 +470,7 @@ template<typename BoundType,
 inline double BinarySpaceTree<BoundType, StatisticType, MatType, SplitType>::
     MinimumBoundDistance() const
 {
-  return bound.MinWidth();
+  return bound.MinWidth() / 2.0;
 }
 
 /**
diff --git a/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp b/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
index af00aab..89a80fe 100644
--- a/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/rectangle_tree.hpp
@@ -268,7 +268,7 @@ class RectangleTree
   //! Return the minimum distance from the center to any edge of the bound.
   //! Currently, this returns 0, which doesn't break algorithms, but it isn't
   //! necessarily correct, either.
-  double MinimumBoundDistance() const { return bound.MinWidth(); }
+  double MinimumBoundDistance() const { return bound.MinWidth() / 2.0; }
 
   //! Return the distance from the center of this node to the center of the
   //! parent node.