[Sync] Move //sync to //components/sync.

components/sync/core/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_
+#ifndef COMPONENTS_SYNC_CORE_ATTACHMENTS_TASK_QUEUE_H_
+#define COMPONENTS_SYNC_CORE_ATTACHMENTS_TASK_QUEUE_H_
 
 #include <stddef.h>
 
 #include <deque>
 #include <memory>
 #include <set>
 #include <utility>
 
 #include "base/bind.h"
 #include "base/callback.h"
@@ skipping 232 matching lines @@
   DCHECK_EQ(1U, num_erased);
 }
 
 template <typename T>
 void TaskQueue<T>::ScheduleDispatch() {
   DCHECK(CalledOnValidThread());
   if (backoff_timer_->IsRunning() || !ShouldDispatch()) {
     return;
   }
 
-  backoff_timer_->Start(
-      FROM_HERE, backoff_entry_->GetTimeUntilRelease(), dispatch_closure_);
+  backoff_timer_->Start(FROM_HERE, backoff_entry_->GetTimeUntilRelease(),
+                        dispatch_closure_);
 }
 
 template <typename T>
 void TaskQueue<T>::Dispatch() {
   DCHECK(CalledOnValidThread());
   if (!ShouldDispatch()) {
     return;
   }
 
   DCHECK(!queue_.empty());
   const T& task = queue_.front();
   ++num_in_progress_;
   DCHECK_LE(num_in_progress_, kMaxConcurrentTasks);
   base::ThreadTaskRunnerHandle::Get()->PostTask(
       FROM_HERE, base::Bind(process_callback_, task));
   queue_.pop_front();
 }
 
 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_
+#endif  // COMPONENTS_SYNC_CORE_ATTACHMENTS_TASK_QUEUE_H_