[mlpack-git] master: Syntax details. (c23f0b5)

[gitdub at mlpack.org]

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

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

commit c23f0b571e4edde0c31a7ecaab22010415a92019
Author: MarcosPividori <marcos.pividori at gmail.com>
Date:   Wed Jul 13 10:32:23 2016 -0300

    Syntax details.


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

c23f0b571e4edde0c31a7ecaab22010415a92019
 src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp | 9 +++------
 src/mlpack/core/tree/spill_tree/traits.hpp          | 2 +-
 2 files changed, 4 insertions(+), 7 deletions(-)

diff --git a/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp b/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp
index 50f7be9..4bee000 100644
--- a/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp
+++ b/src/mlpack/core/tree/spill_tree/spill_tree_impl.hpp
@@ -9,9 +9,6 @@
 // In case it wasn't included already for some reason.
 #include "spill_tree.hpp"
 
-#include <mlpack/core/util/cli.hpp>
-#include <mlpack/core/util/log.hpp>
-
 namespace mlpack {
 namespace tree {
 
@@ -39,7 +36,7 @@ SpillTree(
 {
   std::vector<size_t> points;
   points.reserve(dataset->n_cols);
-  for(size_t i=0; i < dataset->n_cols; i++)
+  for (size_t i = 0; i < dataset->n_cols; i++)
     points.push_back(i);
 
   // Do the actual splitting of this node.
@@ -73,7 +70,7 @@ SpillTree(
 {
   std::vector<size_t> points;
   points.reserve(dataset->n_cols);
-  for(size_t i=0; i < dataset->n_cols; i++)
+  for (size_t i = 0; i < dataset->n_cols; i++)
     points.push_back(i);
 
   // Do the actual splitting of this node.
@@ -454,7 +451,7 @@ void SpillTree<MetricType, StatisticType, MatType, BoundType, SplitType>::
 {
   // We need to expand the bounds of this node properly, ignoring overlapping
   // points (they will be included in the bound of the other node).
-  for(size_t i = 0; i < overlapIndex; i++)
+  for (size_t i = 0; i < overlapIndex; i++)
     bound |= dataset->cols(points[i], points[i]);
 
   // Calculate the furthest descendant distance.
diff --git a/src/mlpack/core/tree/spill_tree/traits.hpp b/src/mlpack/core/tree/spill_tree/traits.hpp
index 6d863f4..36f67ab 100644
--- a/src/mlpack/core/tree/spill_tree/traits.hpp
+++ b/src/mlpack/core/tree/spill_tree/traits.hpp
@@ -26,7 +26,7 @@ template<typename MetricType,
          template<typename SplitBoundType, typename SplitMatType>
              class SplitType>
 class TreeTraits<SpillTree<MetricType, StatisticType, MatType, BoundType,
-                                 SplitType>>
+    SplitType>>
 {
  public:
   /**