components: Change auto to not deduce raw pointers.

components/domain_reliability/scheduler.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "components/domain_reliability/scheduler.h"
 
 #include <stdint.h>
 #include <algorithm>
 #include <utility>
 
@@ skipping 166 matching lines @@
     std::unique_ptr<base::DictionaryValue> last(new base::DictionaryValue());
     last->SetInteger("start_time", (now - last_upload_start_time_).InSeconds());
     last->SetInteger("end_time", (now - last_upload_end_time_).InSeconds());
     last->SetInteger("collector_index",
         static_cast<int>(last_upload_collector_index_));
     last->SetBoolean("success", last_upload_success_);
     data->Set("last_upload", std::move(last));
   }
 
   std::unique_ptr<base::ListValue> collectors_value(new base::ListValue());
-  for (const auto& collector : collectors_) {
+  for (const auto* collector : collectors_) {
     std::unique_ptr<base::DictionaryValue> value(new base::DictionaryValue());
     value->SetInteger("failures", collector->failure_count());
     value->SetInteger("next_upload",
         (collector->GetReleaseTime() - now).InSeconds());
     // Using release instead of Pass because Pass can't implicitly upcast.
     collectors_value->Append(std::move(value));
   }
   data->Set("collectors", std::move(collectors_value));
 
   return std::move(data);
@@ skipping 63 matching lines @@
       min_index = i;
     }
   }
 
   DCHECK_NE(kInvalidCollectorIndex, min_index);
   *upload_time_out = min_time;
   *collector_index_out = min_index;
 }
 
 }  // namespace domain_reliability