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

components/sync/core_impl/change_reorder_buffer.cc

 // Copyright 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.
 
-#include "sync/internal_api/change_reorder_buffer.h"
+#include "components/sync/core_impl/change_reorder_buffer.h"
 
 #include <stdint.h>
 
 #include <limits>
 #include <queue>
 #include <set>
 #include <utility>  // for pair<>
 
 #include "base/macros.h"
-#include "sync/internal_api/public/base_node.h"
-#include "sync/internal_api/public/base_transaction.h"
-#include "sync/syncable/entry.h"
-#include "sync/syncable/syncable_base_transaction.h"
+#include "components/sync/core/base_node.h"
+#include "components/sync/core/base_transaction.h"
+#include "components/sync/syncable/entry.h"
+#include "components/sync/syncable/syncable_base_transaction.h"
 
 using std::numeric_limits;
 using std::pair;
 using std::queue;
 using std::set;
 
 namespace syncer {
 
 // Traversal provides a way to collect a set of nodes from the syncable
 // directory structure and then traverse them, along with any intermediate
 // nodes, in a top-down fashion, starting from a single common ancestor.  A
 // Traversal starts out empty and is grown by means of the ExpandToInclude
 // method.  Once constructed, the top(), begin_children(), and end_children()
 // methods can be used to explore the nodes in root-to-leaf order.
 class ChangeReorderBuffer::Traversal {
  public:
   typedef pair<int64_t, int64_t> ParentChildLink;
   typedef set<ParentChildLink> LinkSet;
 
-  Traversal() : top_(kInvalidId) { }
+  Traversal() : top_(kInvalidId) {}
 
   // Expand the traversal so that it includes the node indicated by
   // |child_handle|.
   void ExpandToInclude(syncable::BaseTransaction* trans, int64_t child_handle) {
     // If |top_| is invalid, this is the first insertion -- easy.
     if (top_ == kInvalidId) {
       top_ = child_handle;
       return;
     }
 
@@ skipping 67 matching lines @@
   // (parent, child) ordering of values enables efficient lookup of children
   // given the parent handle, which is used for top-down traversal.  |links_|
   // is expected to be connected -- every node that appears as a parent in a
   // link must either appear as a child of another link, or else be the
   // topmost node, |top_|.
   LinkSet links_;
 
   DISALLOW_COPY_AND_ASSIGN(Traversal);
 };
 
-ChangeReorderBuffer::ChangeReorderBuffer() {
-}
+ChangeReorderBuffer::ChangeReorderBuffer() {}
 
-ChangeReorderBuffer::~ChangeReorderBuffer() {
-}
+ChangeReorderBuffer::~ChangeReorderBuffer() {}
 
 void ChangeReorderBuffer::PushAddedItem(int64_t id) {
   operations_[id] = ChangeRecord::ACTION_ADD;
 }
 
 void ChangeReorderBuffer::PushDeletedItem(int64_t id) {
   operations_[id] = ChangeRecord::ACTION_DELETE;
 }
 
 void ChangeReorderBuffer::PushUpdatedItem(int64_t id) {
@@ skipping 76 matching lines @@
       CHECK(j->first == next);
       to_visit.push(j->second);
     }
   }
 
   *changes = ImmutableChangeRecordList(&changelist);
   return true;
 }
 
 }  // namespace syncer