Convert Pass()→std::move() in sync/

sync/internal_api/public/attachments/task_queue.h

 // 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.
 
 #ifndef SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_
 #define SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_
 
 #include <deque>
 #include <set>
+#include <utility>
 
 #include "base/bind.h"
 #include "base/callback.h"
 #include "base/macros.h"
 #include "base/memory/weak_ptr.h"
 #include "base/message_loop/message_loop.h"
 #include "base/threading/non_thread_safe.h"
 #include "base/time/time.h"
 #include "base/timer/timer.h"
 #include "net/base/backoff_entry.h"
@@ skipping 206 matching lines @@
 void TaskQueue<T>::ResetBackoff() {
   backoff_timer_->Stop();
   backoff_entry_->Reset();
   ScheduleDispatch();
 }
 
 template <typename T>
 void TaskQueue<T>::SetTimerForTest(scoped_ptr<base::Timer> timer) {
   DCHECK(CalledOnValidThread());
   DCHECK(timer.get());
-  backoff_timer_ = timer.Pass();
+  backoff_timer_ = std::move(timer);
 }
 
 template <typename T>
 void TaskQueue<T>::FinishTask(const T& task) {
   DCHECK(CalledOnValidThread());
   DCHECK_GE(num_in_progress_, 1);
   --num_in_progress_;
   const size_t num_erased = tasks_.erase(task);
   DCHECK_EQ(1U, num_erased);
 }
@@ skipping 26 matching lines @@
 }
 
 template <typename T>
 bool TaskQueue<T>::ShouldDispatch() {
   return num_in_progress_ < kMaxConcurrentTasks && !queue_.empty();
 }
 
 }  // namespace syncer
 
 #endif  // SYNC_INTERNAL_API_PUBLIC_ATTACHMENTS_TASK_QUEUE_H_