[mlpack-git] master: Don't specify the exact type; that's superfluous. (dde839e)

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

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

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/bece04ae4d1616f2085fb7261ad1f2ec11c6565e...dde839eaf3d49261add6b660e6fefcb22e9a163a

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

commit dde839eaf3d49261add6b660e6fefcb22e9a163a
Author: Ryan Curtin <ryan at ratml.org>
Date:   Fri May 8 11:53:08 2015 -0400

    Don't specify the exact type; that's superfluous.


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

dde839eaf3d49261add6b660e6fefcb22e9a163a
 .../tree/binary_space_tree/binary_space_tree_impl.hpp    | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 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 6cdc9c6..61f43da 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
@@ -550,10 +550,10 @@ void BinarySpaceTree<BoundType, StatisticType, MatType, SplitType>::SplitNode(
 
   // Now that we know the split column, we will recursively split the children
   // by calling their constructors (which perform this splitting process).
-  left = new BinarySpaceTree<BoundType, StatisticType, MatType>(data, begin,
-      splitCol - begin, splitter, this, maxLeafSize);
-  right = new BinarySpaceTree<BoundType, StatisticType, MatType>(data, splitCol,
-      begin + count - splitCol, splitter, this, maxLeafSize);
+  left = new BinarySpaceTree(data, begin, splitCol - begin, splitter, this,
+      maxLeafSize);
+  right = new BinarySpaceTree(data, splitCol, begin + count - splitCol,
+      splitter, this, maxLeafSize);
 
   // Calculate parent distances for those two nodes.
   arma::vec centroid, leftCentroid, rightCentroid;
@@ -608,10 +608,10 @@ void BinarySpaceTree<BoundType, StatisticType, MatType, SplitType>::SplitNode(
 
   // Now that we know the split column, we will recursively split the children
   // by calling their constructors (which perform this splitting process).
-  left = new BinarySpaceTree<BoundType, StatisticType, MatType>(data, begin,
-      splitCol - begin, oldFromNew, splitter, this, maxLeafSize);
-  right = new BinarySpaceTree<BoundType, StatisticType, MatType>(data, splitCol,
-      begin + count - splitCol, oldFromNew, splitter, this, maxLeafSize);
+  left = new BinarySpaceTree(data, begin, splitCol - begin, oldFromNew,
+      splitter, this, maxLeafSize);
+  right = new BinarySpaceTree(data, splitCol, begin + count - splitCol,
+      oldFromNew, splitter, this, maxLeafSize);
 
   // Calculate parent distances for those two nodes.
   arma::vec centroid, leftCentroid, rightCentroid;