Index: components/sync/syncable/parent_child_index.cc |
diff --git a/sync/syncable/parent_child_index.cc b/components/sync/syncable/parent_child_index.cc |
similarity index 95% |
rename from sync/syncable/parent_child_index.cc |
rename to components/sync/syncable/parent_child_index.cc |
index 6d1be8b5c940b439ecf0bfcbfe09af6be9a0a8b5..2090867b0220d63e65fcd890cbced39e39b352a7 100644 |
--- a/sync/syncable/parent_child_index.cc |
+++ b/components/sync/syncable/parent_child_index.cc |
@@ -2,13 +2,13 @@ |
// 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 { |
@@ -94,8 +94,8 @@ bool ParentChildIndex::Insert(EntryKernel* entry) { |
// 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. |
@@ -136,7 +136,7 @@ void ParentChildIndex::Remove(EntryKernel* e) { |
} |
} |
-bool ParentChildIndex::Contains(EntryKernel *e) const { |
+bool ParentChildIndex::Contains(EntryKernel* e) const { |
const OrderedChildSetRef siblings = GetChildSet(e); |
return siblings && siblings->count(e) > 0; |
} |