[mlpack-svn] r17182 - mlpack/trunk/src/mlpack/core/tree/rectangle_tree

[fastlab-svn at coffeetalk-1.cc.gatech.edu]

Author: rcurtin
Date: Mon Sep 15 11:26:03 2014
New Revision: 17182

Log:
Fix even more warnings that I've introduced.


Modified:
   mlpack/trunk/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp

Modified: mlpack/trunk/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp
==============================================================================
--- mlpack/trunk/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp	(original)
+++ mlpack/trunk/src/mlpack/core/tree/rectangle_tree/r_tree_split_impl.hpp	Mon Sep 15 11:26:03 2014
@@ -360,12 +360,12 @@
   {
     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 @@
   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 @@
   {
     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 @@
     }
     else
     {
-      for (int i = 0; i < end; i++)
+      for (size_t i = 0; i < end; i++)
       {
         InsertNodeIntoTree(treeTwo, oldTree->Children()[i]);
         numAssignTreeTwo++;