From cdb6b5f36cf19efbb0eeb711e47c75313c30bdd7 Mon Sep 17 00:00:00 2001
From: Mikhail Lozhnikov <lozhnikovma@gmail.com>
Date: Thu, 7 Jul 2016 23:05:59 +0300
Subject: [PATCH] Add const modifiers.

---
 .../tree/rectangle_tree/minimal_coverage_sweep_impl.hpp   | 8 ++++----
 .../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 5c899097a3..66ceec53ad 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 b1b3f0f880..f320ac43d5 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;
       });