Skip to content
Snippets Groups Projects
Commit a803a713 authored by scott snyder's avatar scott snyder Committed by scott snyder
Browse files

SiSPSeededTrackFinder: Fix clang10 warnings.

Avoid spurious copies in range for.
parent 1a1c85e9
No related branches found
No related tags found
No related merge requests found
...@@ -174,7 +174,7 @@ StatusCode InDet::SiSPSeededTrackFinder::oldStrategy(const EventContext& ctx) co ...@@ -174,7 +174,7 @@ StatusCode InDet::SiSPSeededTrackFinder::oldStrategy(const EventContext& ctx) co
// Save good tracks in track collection // Save good tracks in track collection
// //
for (const std::pair<double, Trk::Track*> & qualityAndTrack: qualitySortedTrackCandidates) { for (const std::pair<const double, Trk::Track*> & qualityAndTrack: qualitySortedTrackCandidates) {
++counter[kNTracks]; ++counter[kNTracks];
if (m_trackSummaryTool.isEnabled()) { if (m_trackSummaryTool.isEnabled()) {
m_trackSummaryTool->computeAndReplaceTrackSummary(*(qualityAndTrack.second), m_trackSummaryTool->computeAndReplaceTrackSummary(*(qualityAndTrack.second),
...@@ -322,7 +322,7 @@ StatusCode InDet::SiSPSeededTrackFinder::newStrategy(const EventContext& ctx) co ...@@ -322,7 +322,7 @@ StatusCode InDet::SiSPSeededTrackFinder::newStrategy(const EventContext& ctx) co
filterSharedTracks(qualitySortedTrackCandidates); filterSharedTracks(qualitySortedTrackCandidates);
/// Save good tracks in track collection /// Save good tracks in track collection
for (const std::pair<double, Trk::Track*> & qualityAndTrack: qualitySortedTrackCandidates) { for (const std::pair<const double, Trk::Track*> & qualityAndTrack: qualitySortedTrackCandidates) {
++counter[kNTracks]; ++counter[kNTracks];
if (m_trackSummaryTool.isEnabled()) { if (m_trackSummaryTool.isEnabled()) {
/// Note that for run-3 the tool here is configured to not perform a hole search, /// Note that for run-3 the tool here is configured to not perform a hole search,
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment