[mlpack-git] master: Simple syntax detail. (ac5f836)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/0f4b25acd6aaa14294c044874ba6cc0751712baa...0a19d07bd39e6223991976474bc79671ba8aa0f0

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

commit ac5f836691b619c679b23c9fe37eecc0c7b00038
Author: MarcosPividori <marcos.pividori at gmail.com>
Date:   Tue Aug 16 20:25:23 2016 -0300

    Simple syntax detail.


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

ac5f836691b619c679b23c9fe37eecc0c7b00038
 src/mlpack/tests/aknn_test.cpp | 8 ++++----
 src/mlpack/tests/knn_test.cpp  | 8 ++++----
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/mlpack/tests/aknn_test.cpp b/src/mlpack/tests/aknn_test.cpp
index 62b0f44..baf396b 100644
--- a/src/mlpack/tests/aknn_test.cpp
+++ b/src/mlpack/tests/aknn_test.cpp
@@ -260,16 +260,16 @@ BOOST_AUTO_TEST_CASE(SingleSpillTreeTest)
   arma::mat distancesExact;
   exact.Search(dataset, k, neighborsExact, distancesExact);
 
-  double max_dist = 0;
+  double maxDist = 0;
   for (size_t i = 0; i < neighborsExact.n_cols; ++i)
-    if (distancesExact(k - 1, i) > max_dist)
-      max_dist = distancesExact(k - 1, i);
+    if (distancesExact(k - 1, i) > maxDist)
+      maxDist = distancesExact(k - 1, i);
 
   // If we are sure that tau is a valid upper bound of the kth nearest neighbor
   // of the query points, then we can be sure that we will satisfy the
   // requirements on the relative error.
   SPTree<EuclideanDistance, NeighborSearchStat<NearestNeighborSort>, arma::mat>
-      referenceTree(dataset, max_dist * 1.01 /* tau parameter */);
+      referenceTree(dataset, maxDist * 1.01 /* tau parameter */);
 
   NeighborSearch<NearestNeighborSort, EuclideanDistance, arma::mat, SPTree>
       spTreeSearch(&referenceTree, true, 0.05);
diff --git a/src/mlpack/tests/knn_test.cpp b/src/mlpack/tests/knn_test.cpp
index ca25cd4..6cf85c0 100644
--- a/src/mlpack/tests/knn_test.cpp
+++ b/src/mlpack/tests/knn_test.cpp
@@ -905,16 +905,16 @@ BOOST_AUTO_TEST_CASE(HybridSpillSearchTest)
   arma::mat distancesNaive;
   naive.Search(dataset, k, neighborsNaive, distancesNaive);
 
-  double max_dist = 0;
+  double maxDist = 0;
   for (size_t i = 0; i < neighborsNaive.n_cols; ++i)
-    if (distancesNaive(k - 1, i) > max_dist)
-      max_dist = distancesNaive(k - 1, i);
+    if (distancesNaive(k - 1, i) > maxDist)
+      maxDist = distancesNaive(k - 1, i);
 
   // If we are sure that tau is a valid strict upper bound of the kth nearest
   // neighbor of the query points, then we can be sure that we will get an exact
   // solution.
   SpillSearch<> spTreeSearch(dataset, false, true,
-      max_dist * 1.01 /* tau parameter */);
+      maxDist * 1.01 /* tau parameter */);
 
   for (size_t mode = 0; mode < 2; mode++)
   {