apaam/mlpack
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Add const modifiers.

Browse Source
This commit is contained in:
Mikhail Lozhnikov
2016-07-07 23:05:59 +03:00
parent e75a0879a1
commit cdb6b5f36c
2 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/mlpack/core/tree/rectangle_tree/minimal_coverage_sweep_impl.hpp
+4 -4
View File
@@ -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;
});
src/mlpack/core/tree/rectangle_tree/minimal_splits_number_sweep_impl.hpp
+2 -2
View File
@@ -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;
});