OLD | NEW |
1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "components/sync/core_impl/change_reorder_buffer.h" | 5 #include "components/sync/syncable/change_reorder_buffer.h" |
6 | 6 |
7 #include <limits> | 7 #include <limits> |
8 #include <queue> | 8 #include <queue> |
9 #include <set> | 9 #include <set> |
10 #include <utility> // for pair<> | 10 #include <utility> // for pair<> |
11 | 11 |
12 #include "components/sync/core/base_node.h" | 12 #include "components/sync/syncable/base_node.h" |
13 #include "components/sync/core/base_transaction.h" | 13 #include "components/sync/syncable/base_transaction.h" |
14 #include "components/sync/syncable/entry.h" | 14 #include "components/sync/syncable/entry.h" |
15 #include "components/sync/syncable/syncable_base_transaction.h" | 15 #include "components/sync/syncable/syncable_base_transaction.h" |
16 | 16 |
17 using std::numeric_limits; | 17 using std::numeric_limits; |
18 using std::pair; | 18 using std::pair; |
19 using std::queue; | 19 using std::queue; |
20 using std::set; | 20 using std::set; |
21 | 21 |
22 namespace syncer { | 22 namespace syncer { |
23 | 23 |
(...skipping 188 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
212 CHECK(j->first == next); | 212 CHECK(j->first == next); |
213 to_visit.push(j->second); | 213 to_visit.push(j->second); |
214 } | 214 } |
215 } | 215 } |
216 | 216 |
217 *changes = ImmutableChangeRecordList(&changelist); | 217 *changes = ImmutableChangeRecordList(&changelist); |
218 return true; | 218 return true; |
219 } | 219 } |
220 | 220 |
221 } // namespace syncer | 221 } // namespace syncer |
OLD | NEW |