OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 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/scheduler/child/task_queue_selector.h" | 5 #include "components/scheduler/child/task_queue_selector.h" |
6 | 6 |
7 #include "base/bind.h" | 7 #include "base/bind.h" |
8 #include "base/memory/scoped_ptr.h" | 8 #include "base/memory/scoped_ptr.h" |
9 #include "base/memory/scoped_vector.h" | |
10 #include "base/pending_task.h" | 9 #include "base/pending_task.h" |
11 #include "components/scheduler/child/task_queue_impl.h" | 10 #include "components/scheduler/child/task_queue_impl.h" |
12 #include "components/scheduler/child/task_queue_sets.h" | 11 #include "components/scheduler/child/task_queue_sets.h" |
13 #include "testing/gmock/include/gmock/gmock.h" | 12 #include "testing/gmock/include/gmock/gmock.h" |
14 #include "testing/gtest/include/gtest/gtest.h" | 13 #include "testing/gtest/include/gtest/gtest.h" |
15 | 14 |
16 using testing::_; | 15 using testing::_; |
17 | 16 |
18 namespace scheduler { | 17 namespace scheduler { |
19 namespace internal { | 18 namespace internal { |
(...skipping 255 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
275 size_t queue_order[] = {0, 1}; | 274 size_t queue_order[] = {0, 1}; |
276 PushTasks(tasks, queue_order); | 275 PushTasks(tasks, queue_order); |
277 | 276 |
278 EXPECT_FALSE(selector_.EnabledWorkQueuesEmpty()); | 277 EXPECT_FALSE(selector_.EnabledWorkQueuesEmpty()); |
279 PopTasks(); | 278 PopTasks(); |
280 EXPECT_TRUE(selector_.EnabledWorkQueuesEmpty()); | 279 EXPECT_TRUE(selector_.EnabledWorkQueuesEmpty()); |
281 } | 280 } |
282 | 281 |
283 } // namespace internal | 282 } // namespace internal |
284 } // namespace scheduler | 283 } // namespace scheduler |
OLD | NEW |