diff --git a/src/guidance/segregated_intersection_classification.cpp b/src/guidance/segregated_intersection_classification.cpp index d8aaadafd..496da4eeb 100644 --- a/src/guidance/segregated_intersection_classification.cpp +++ b/src/guidance/segregated_intersection_classification.cpp @@ -226,7 +226,7 @@ std::unordered_set<EdgeID> findSegregatedNodes(const extractor::NodeBasedGraphFa auto const collect_edge_info_fn = [&](auto const &edges1, NodeID node2) { std::vector<EdgeInfo> info; - for (auto const &e : edges1) + for (auto e : edges1) { NodeID const target = graph.GetTarget(e); if (target == node2) diff --git a/src/util/timezones.cpp b/src/util/timezones.cpp index 6034c1204..264176a68 100644 --- a/src/util/timezones.cpp +++ b/src/util/timezones.cpp @@ -154,7 +154,7 @@ boost::optional<struct tm> Timezoner::operator()(const point_t &point) const { std::vector<rtree_t::value_type> result; rtree.query(boost::geometry::index::intersects(point), std::back_inserter(result)); - for (const auto v : result) + for (const auto &v : result) { const auto index = v.second; if (boost::geometry::within(point, local_times[index].first))