Replace unique_ptr.reset/release with std::move under src/extensions

extensions/browser/updater/request_queue_impl.h

 // Copyright (c) 2012 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.
 
 #ifndef EXTENSIONS_BROWSER_UPDATER_REQUEST_QUEUE_IMPL_H_
 #define EXTENSIONS_BROWSER_UPDATER_REQUEST_QUEUE_IMPL_H_
 
 #include <stddef.h>
 
 #include <algorithm>
@@ skipping 94 matching lines @@
   // pop_heap swaps the first and last elements of pending_requests_, and after
   // that assures that the rest of pending_requests_ (excluding the
   // now last/formerly first element) forms a proper heap. After pop_heap
   // [begin, end-1) is a valid heap, and *(end - 1) contains the element that
   // used to be at the top of the heap. Since no elements are actually
   // removed from the container it is safe to read the entry being removed after
   // pop_heap is called (but before pop_back is called).
   std::pop_heap(
       pending_requests_.begin(), pending_requests_.end(), CompareRequests);
 
-  active_backoff_entry_.reset(pending_requests_.back().backoff_entry.release());
-  active_request_.reset(pending_requests_.back().request.release());
+  active_backoff_entry_ = std::move(pending_requests_.back().backoff_entry);
+  active_request_ = std::move(pending_requests_.back().request);
 
   pending_requests_.pop_back();
 
   start_request_callback_.Run();
 }
 
 template <typename T>
 void RequestQueue<T>::RetryRequest(const base::TimeDelta& min_backoff_delay) {
   active_backoff_entry_->InformOfRequest(false);
   if (active_backoff_entry_->GetTimeUntilRelease() < min_backoff_delay) {
@@ skipping 21 matching lines @@
 
 // static
 template <typename T>
 bool RequestQueue<T>::CompareRequests(const Request& a, const Request& b) {
   return a.backoff_entry->GetReleaseTime() > b.backoff_entry->GetReleaseTime();
 }
 
 }  // namespace extensions
 
 #endif  // EXTENSIONS_BROWSER_UPDATER_REQUEST_QUEUE_IMPL_H_