[mlpack] 09/149: Fix even more warnings that I've introduced.

[Barak A. Pearlmutter]

This is an automated email from the git hooks/post-receive script.

bap pushed a commit to branch svn-trunk
in repository mlpack.

commit cb19b475c6bae8aa11e028276fc61080581269b4
Author: rcurtin <rcurtin at 9d5b8971-822b-0410-80eb-d18c1038ef23>
Date:   Mon Sep 15 15:26:03 2014 +0000

    Fix even more warnings that I've introduced.
    
    
    git-svn-id: http://svn.cc.gatech.edu/fastlab/mlpack/trunk@17182 9d5b8971-822b-0410-80eb-d18c1038ef23
---
 .../core/tree/rectangle_tree/r_tree_split_impl.hpp       | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp b/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
index 417b5ff..5d8a4e0 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
@@ -360,12 +360,12 @@ void RTreeSplit<DescentType, StatisticType, MatType>::AssignPointDestNode(
   {
     if (numAssignedOne < numAssignedTwo)
     {
-      for (int i = 0; i < end; i++)
+      for (size_t i = 0; i < end; i++)
         treeOne->InsertPoint(oldTree->Points()[i]);
     }
     else
     {
-      for (int i = 0; i < end; i++)
+      for (size_t i = 0; i < end; i++)
         treeTwo->InsertPoint(oldTree->Points()[i]);
     }
   }
@@ -410,14 +410,14 @@ void RTreeSplit<DescentType, StatisticType, MatType>::AssignNodeDestNode(
   assert(treeOne->NumChildren() == 1);
   assert(treeTwo->NumChildren() == 1);
 
-  for (int i = 0; i < end; i++)
-    for (int j = i + 1; j < end; j++)
+  for (size_t i = 0; i < end; i++)
+    for (size_t j = i + 1; j < end; j++)
       assert(oldTree->Children()[i] != oldTree->Children()[j]);
 
-  for (int i = 0; i < end; i++)
+  for (size_t i = 0; i < end; i++)
     assert(oldTree->Children()[i] != treeOne->Children()[0]);
 
-  for (int i = 0; i < end; i++)
+  for (size_t i = 0; i < end; i++)
     assert(oldTree->Children()[i] != treeTwo->Children()[0]);
 
   size_t numAssignTreeOne = 1;
@@ -507,7 +507,7 @@ void RTreeSplit<DescentType, StatisticType, MatType>::AssignNodeDestNode(
   {
     if (numAssignTreeOne < numAssignTreeTwo)
     {
-      for (int i = 0; i < end; i++)
+      for (size_t i = 0; i < end; i++)
       {
         InsertNodeIntoTree(treeOne, oldTree->Children()[i]);
         numAssignTreeOne++;
@@ -515,7 +515,7 @@ void RTreeSplit<DescentType, StatisticType, MatType>::AssignNodeDestNode(
     }
     else
     {
-      for (int i = 0; i < end; i++)
+      for (size_t i = 0; i < end; i++)
       {
         InsertNodeIntoTree(treeTwo, oldTree->Children()[i]);
         numAssignTreeTwo++;

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/mlpack.git