summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDennis Nienhüser <nienhueser@kde.org>2016-09-06 18:09:17 (GMT)
committerDennis Nienhüser <nienhueser@kde.org>2016-09-06 18:11:10 (GMT)
commitc04efe5a74cc1d5e64562216d7d82adcec5e1add (patch)
treed298cc3647c0012c92136da2a99771e1f62f25e3
parent3eae87c251a65bce7a88e3b601ee776e17cdd903 (diff)
Pass const reference to lambda. Might fix build with GCC 4.8.
CCBUG: 368219
-rw-r--r--tools/vectorosm-tilecreator/BaseClipper.cpp8
1 files changed, 4 insertions, 4 deletions
diff --git a/tools/vectorosm-tilecreator/BaseClipper.cpp b/tools/vectorosm-tilecreator/BaseClipper.cpp
index a46fddf..4d29817 100644
--- a/tools/vectorosm-tilecreator/BaseClipper.cpp
+++ b/tools/vectorosm-tilecreator/BaseClipper.cpp
@@ -455,28 +455,28 @@ void BaseClipper::clipPolyObject ( const QPolygonF & polygon,
for(const auto& point : m_topEdge) {
intersectionsTop << QSharedPointer<LinkedPoint>(new LinkedPoint(point));
}
- std::sort(intersectionsTop.begin(), intersectionsTop.end(), [](QSharedPointer<LinkedPoint>& A, QSharedPointer<LinkedPoint>& B) {
+ std::sort(intersectionsTop.begin(), intersectionsTop.end(), [](const QSharedPointer<LinkedPoint>& A, const QSharedPointer<LinkedPoint>& B) {
return A->point().x() < B->point().x();
});
for(const auto& point : m_rightEdge) {
intersectionsRight << QSharedPointer<LinkedPoint>(new LinkedPoint(point));
}
- std::sort(intersectionsRight.begin(), intersectionsRight.end(), [](QSharedPointer<LinkedPoint>& A, QSharedPointer<LinkedPoint>& B) {
+ std::sort(intersectionsRight.begin(), intersectionsRight.end(), [](const QSharedPointer<LinkedPoint>& A, const QSharedPointer<LinkedPoint>& B) {
return A->point().y() < B->point().y();
});
for(const auto& point : m_bottomEdge) {
intersectionsBottom << QSharedPointer<LinkedPoint>(new LinkedPoint(point));
}
- std::sort(intersectionsBottom.begin(), intersectionsBottom.end(), [](QSharedPointer<LinkedPoint>& A, QSharedPointer<LinkedPoint>& B) {
+ std::sort(intersectionsBottom.begin(), intersectionsBottom.end(), [](const QSharedPointer<LinkedPoint>& A, const QSharedPointer<LinkedPoint>& B) {
return B->point().x() < A->point().x();
});
for(const auto& point : m_leftEdge) {
intersectionsLeft << QSharedPointer<LinkedPoint>(new LinkedPoint(point));
}
- std::sort(intersectionsLeft.begin(), intersectionsLeft.end(), [](QSharedPointer<LinkedPoint>& A, QSharedPointer<LinkedPoint>& B) {
+ std::sort(intersectionsLeft.begin(), intersectionsLeft.end(), [](const QSharedPointer<LinkedPoint>& A, const QSharedPointer<LinkedPoint>& B) {
return B->point().y() < A->point().y();
});