[mlpack-git] master: Add const modifiers. (cdb6b5f)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/6147ed01bab6eadcd6a5e796e259a6afacae4662...e0fd69006b17a845f066ea4de1e205fc0922739d

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

commit cdb6b5f36cf19efbb0eeb711e47c75313c30bdd7
Author: Mikhail Lozhnikov <lozhnikovma at gmail.com>
Date:   Thu Jul 7 23:05:59 2016 +0300

    Add const modifiers.


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

cdb6b5f36cf19efbb0eeb711e47c75313c30bdd7
 .../core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp      | 8 ++++----
 .../core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp | 4 ++--
 2 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp b/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp
index 5c89909..66ceec5 100644
--- a/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp
@@ -32,8 +32,8 @@ SweepNonLeafNode(const size_t axis,
   }
   // Sort high bounds of children.
   std::sort(sorted.begin(), sorted.end(),
-      [] (std::pair<ElemType, size_t>& s1,
-          std::pair<ElemType, size_t>& s2)
+      [] (const std::pair<ElemType, size_t>& s1,
+          const std::pair<ElemType, size_t>& s2)
       {
         return s1.first < s2.first;
       });
@@ -99,8 +99,8 @@ SweepLeafNode(const size_t axis,
 
   // Sort high bounds of children.
   std::sort(sorted.begin(), sorted.end(),
-      [] (std::pair<ElemType, size_t>& s1,
-          std::pair<ElemType, size_t>& s2)
+      [] (const std::pair<ElemType, size_t>& s1,
+          const std::pair<ElemType, size_t>& s2)
       {
         return s1.first < s2.first;
       });
diff --git a/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp b/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp
index b1b3f0f..f320ac4 100644
--- a/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp
@@ -32,8 +32,8 @@ size_t MinimalSplitsNumberSweep<SplitPolicy>::SweepNonLeafNode(
 
   // Sort candidates in order to check balancing.
   std::sort(sorted.begin(), sorted.end(),
-      [] (std::pair<ElemType, size_t>& s1,
-          std::pair<ElemType, size_t>& s2)
+      [] (const std::pair<ElemType, size_t>& s1,
+          const std::pair<ElemType, size_t>& s2)
       {
         return s1.first < s2.first;
       });