[mlpack-git] master, mlpack-1.0.x: Don't use the SquaredEuclideanDistance. (b272f36)

[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 b272f363c35220fb6a460635388d2ee0c3cf045e
Author: Ryan Curtin <ryan at ratml.org>
Date:   Tue Mar 25 14:02:42 2014 +0000

    Don't use the SquaredEuclideanDistance.


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

b272f363c35220fb6a460635388d2ee0c3cf045e
 doc/tutorials/range_search/range_search.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/tutorials/range_search/range_search.txt b/doc/tutorials/range_search/range_search.txt
index a3e238c..927cc99 100644
--- a/doc/tutorials/range_search/range_search.txt
+++ b/doc/tutorials/range_search/range_search.txt
@@ -321,7 +321,7 @@ very extensible, having the following template arguments:
 
 @code
 template<
-  typename MetricType = mlpack::metric::SquaredEuclideanDistance,
+  typename MetricType = mlpack::metric::EuclideanDistance,
   typename TreeType = mlpack::tree::BinarySpaceTree<bound::HRectBound<2>,
                                                     tree::EmptyStatistic>
 >
@@ -365,7 +365,7 @@ use a ball bound instead of a rectangular bound:
 @code
 // Construct a RangeSearch object with ball bounds.
 RangeSearch<
-  metric::SquaredEuclideanDistance,
+  metric::EuclideanDistance,
   tree::BinarySpaceTree<bound::BallBound<2>,
                         EmptyStatistic>
 > rangeSearch(dataset);