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/core_impl/change_reorder_buffer.h" |
6 | 6 |
7 #include <stdint.h> | |
8 | |
9 #include <limits> | 7 #include <limits> |
10 #include <queue> | 8 #include <queue> |
11 #include <set> | 9 #include <set> |
12 #include <utility> // for pair<> | 10 #include <utility> // for pair<> |
13 | 11 |
14 #include "base/macros.h" | |
15 #include "components/sync/core/base_node.h" | 12 #include "components/sync/core/base_node.h" |
16 #include "components/sync/core/base_transaction.h" | 13 #include "components/sync/core/base_transaction.h" |
17 #include "components/sync/syncable/entry.h" | 14 #include "components/sync/syncable/entry.h" |
18 #include "components/sync/syncable/syncable_base_transaction.h" | 15 #include "components/sync/syncable/syncable_base_transaction.h" |
19 | 16 |
20 using std::numeric_limits; | 17 using std::numeric_limits; |
21 using std::pair; | 18 using std::pair; |
22 using std::queue; | 19 using std::queue; |
23 using std::set; | 20 using std::set; |
24 | 21 |
(...skipping 190 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
215 CHECK(j->first == next); | 212 CHECK(j->first == next); |
216 to_visit.push(j->second); | 213 to_visit.push(j->second); |
217 } | 214 } |
218 } | 215 } |
219 | 216 |
220 *changes = ImmutableChangeRecordList(&changelist); | 217 *changes = ImmutableChangeRecordList(&changelist); |
221 return true; | 218 return true; |
222 } | 219 } |
223 | 220 |
224 } // namespace syncer | 221 } // namespace syncer |
OLD | NEW |