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

components/sync/syncable/parent_child_index.cc

 // 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.
 
-#include "sync/syncable/parent_child_index.h"
+#include "components/sync/syncable/parent_child_index.h"
 
 #include <memory>
 
 #include "base/stl_util.h"
-#include "sync/syncable/entry_kernel.h"
-#include "sync/syncable/syncable_id.h"
+#include "components/sync/syncable/entry_kernel.h"
+#include "components/sync/syncable/syncable_id.h"
 
 namespace syncer {
 namespace syncable {
 
 bool ChildComparator::operator()(const EntryKernel* a,
                                  const EntryKernel* b) const {
   const UniquePosition& a_pos = a->ref(UNIQUE_POSITION);
   const UniquePosition& b_pos = b->ref(UNIQUE_POSITION);
 
   if (a_pos.IsValid() && b_pos.IsValid()) {
@@ skipping 65 matching lines @@
       syncer::IsRealDataType(model_type) &&
       !TypeSupportsHierarchy(model_type)) {
     const Id& type_root_id = entry->ref(ID);
 
     // If the entry exists in the map it must already have the same
     // model type specific child set. It's possible another type root exists
     // in parent_children_map_, but that's okay as the new type root will
     // point to the same OrderedChildSet. As such, we just blindly store the
     // new type root ID and associate it to the (possibly existing) child set.
     model_type_root_ids_[model_type] = type_root_id;
-    parent_children_map_.insert(std::make_pair(
-        type_root_id, GetOrCreateModelTypeChildSet(model_type)));
+    parent_children_map_.insert(
+        std::make_pair(type_root_id, GetOrCreateModelTypeChildSet(model_type)));
   }
 
   // Finally, insert the entry in the child set.
   return siblings->insert(entry).second;
 }
 
 // Like the other containers used to help support the syncable::Directory, this
 // one does not own any EntryKernels.  This function removes references to the
 // given EntryKernel but does not delete it.
 void ParentChildIndex::Remove(EntryKernel* e) {
@@ skipping 20 matching lines @@
 
   // Erase the entry from the child set.
   siblings->erase(j);
   // If the set is now empty and isn't shareable with |type_root_child_sets_|,
   // erase it from the map.
   if (siblings->empty() && should_erase) {
     parent_children_map_.erase(sibling_iterator);
   }
 }
 
-bool ParentChildIndex::Contains(EntryKernel *e) const {
+bool ParentChildIndex::Contains(EntryKernel* e) const {
   const OrderedChildSetRef siblings = GetChildSet(e);
   return siblings && siblings->count(e) > 0;
 }
 
 const OrderedChildSet* ParentChildIndex::GetChildren(const Id& id) const {
   DCHECK(!id.IsNull());
 
   ParentChildrenMap::const_iterator parent = parent_children_map_.find(id);
   if (parent == parent_children_map_.end()) {
     return nullptr;
@@ skipping 57 matching lines @@
         OrderedChildSetRef(new OrderedChildSet());
   return type_root_child_sets_[model_type];
 }
 
 const Id& ParentChildIndex::GetModelTypeRootId(ModelType model_type) const {
   return model_type_root_ids_[model_type];
 }
 
 }  // namespace syncable
 }  // namespace syncer