OLD | NEW |
1 // Copyright 2016 The Chromium Authors. All rights reserved. | 1 // Copyright 2016 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 "base/task_scheduler/scheduler_worker_stack.h" | 5 #include "base/task_scheduler/scheduler_worker_stack.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 #include "base/memory/ptr_util.h" | 8 #include "base/memory/ptr_util.h" |
9 #include "base/memory/ref_counted.h" | 9 #include "base/memory/ref_counted.h" |
10 #include "base/task_scheduler/scheduler_worker.h" | 10 #include "base/task_scheduler/scheduler_worker.h" |
(...skipping 230 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
241 | 241 |
242 stack.Push(worker_a_.get()); | 242 stack.Push(worker_a_.get()); |
243 EXPECT_EQ(1U, stack.Size()); | 243 EXPECT_EQ(1U, stack.Size()); |
244 EXPECT_FALSE(stack.IsEmpty()); | 244 EXPECT_FALSE(stack.IsEmpty()); |
245 } | 245 } |
246 | 246 |
247 // Verify that Push() DCHECKs when a value is inserted twice. | 247 // Verify that Push() DCHECKs when a value is inserted twice. |
248 TEST_F(TaskSchedulerWorkerStackTest, PushTwice) { | 248 TEST_F(TaskSchedulerWorkerStackTest, PushTwice) { |
249 SchedulerWorkerStack stack; | 249 SchedulerWorkerStack stack; |
250 stack.Push(worker_a_.get()); | 250 stack.Push(worker_a_.get()); |
251 EXPECT_DCHECK_DEATH({ stack.Push(worker_a_.get()); }, ""); | 251 EXPECT_DCHECK_DEATH({ stack.Push(worker_a_.get()); }); |
252 } | 252 } |
253 | 253 |
254 } // namespace internal | 254 } // namespace internal |
255 } // namespace base | 255 } // namespace base |
OLD | NEW |