OLD | NEW |
1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 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 <map> | 5 #include <map> |
6 #include <string> | 6 #include <string> |
7 | 7 |
8 #include "base/memory/scoped_ptr.h" | 8 #include "base/memory/scoped_ptr.h" |
9 #include "base/memory/scoped_temp_dir.h" | |
10 #include "base/message_loop.h" | 9 #include "base/message_loop.h" |
| 10 #include "base/scoped_temp_dir.h" |
11 #include "base/stl_util-inl.h" | 11 #include "base/stl_util-inl.h" |
12 #include "base/task.h" | 12 #include "base/task.h" |
13 #include "chrome/browser/sessions/session_service.h" | 13 #include "chrome/browser/sessions/session_service.h" |
14 #include "chrome/browser/sessions/session_service_factory.h" | 14 #include "chrome/browser/sessions/session_service_factory.h" |
15 #include "chrome/browser/sessions/session_service_test_helper.h" | 15 #include "chrome/browser/sessions/session_service_test_helper.h" |
16 #include "chrome/browser/sync/abstract_profile_sync_service_test.h" | 16 #include "chrome/browser/sync/abstract_profile_sync_service_test.h" |
17 #include "chrome/browser/sync/engine/syncapi.h" | 17 #include "chrome/browser/sync/engine/syncapi.h" |
18 #include "chrome/browser/sync/glue/session_change_processor.h" | 18 #include "chrome/browser/sync/glue/session_change_processor.h" |
19 #include "chrome/browser/sync/glue/session_data_type_controller.h" | 19 #include "chrome/browser/sync/glue/session_data_type_controller.h" |
20 #include "chrome/browser/sync/glue/session_model_associator.h" | 20 #include "chrome/browser/sync/glue/session_model_associator.h" |
(...skipping 419 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
440 ASSERT_FALSE(model_associator_->tab_pool_.full()); | 440 ASSERT_FALSE(model_associator_->tab_pool_.full()); |
441 for (size_t i = 0; i < num_ids; ++i) { | 441 for (size_t i = 0; i < num_ids; ++i) { |
442 model_associator_->tab_pool_.FreeTabNode(node_ids[i]); | 442 model_associator_->tab_pool_.FreeTabNode(node_ids[i]); |
443 } | 443 } |
444 ASSERT_EQ(num_ids, model_associator_->tab_pool_.capacity()); | 444 ASSERT_EQ(num_ids, model_associator_->tab_pool_.capacity()); |
445 ASSERT_FALSE(model_associator_->tab_pool_.empty()); | 445 ASSERT_FALSE(model_associator_->tab_pool_.empty()); |
446 ASSERT_TRUE(model_associator_->tab_pool_.full()); | 446 ASSERT_TRUE(model_associator_->tab_pool_.full()); |
447 } | 447 } |
448 | 448 |
449 } // namespace browser_sync | 449 } // namespace browser_sync |
OLD | NEW |