Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 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 | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "base/task_scheduler/sequence_sort_key.h" | |
| 6 | |
| 7 #include "base/task_scheduler/task_traits.h" | |
| 8 #include "base/time/time.h" | |
| 9 #include "testing/gtest/include/gtest/gtest.h" | |
| 10 | |
| 11 namespace base { | |
| 12 namespace internal { | |
| 13 | |
| 14 TEST(TaskSchedulerSequenceSortKeyTest, OperatorLessThan) { | |
| 15 const SequenceSortKey key_a(TaskPriority::USER_BLOCKING, | |
| 16 TimeTicks::FromInternalValue(1000)); | |
| 17 const SequenceSortKey key_b(TaskPriority::USER_BLOCKING, | |
| 18 TimeTicks::FromInternalValue(2000)); | |
| 19 const SequenceSortKey key_c(TaskPriority::USER_VISIBLE, | |
| 20 TimeTicks::FromInternalValue(1000)); | |
| 21 const SequenceSortKey key_d(TaskPriority::USER_VISIBLE, | |
| 22 TimeTicks::FromInternalValue(2000)); | |
| 23 const SequenceSortKey key_e(TaskPriority::BACKGROUND, | |
| 24 TimeTicks::FromInternalValue(1000)); | |
| 25 const SequenceSortKey key_f(TaskPriority::BACKGROUND, | |
| 26 TimeTicks::FromInternalValue(2000)); | |
| 27 | |
| 28 EXPECT_FALSE(key_a < key_a); | |
| 29 EXPECT_LT(key_b, key_a); | |
| 30 EXPECT_LT(key_c, key_a); | |
| 31 EXPECT_LT(key_d, key_a); | |
| 32 EXPECT_LT(key_e, key_a); | |
| 33 EXPECT_LT(key_f, key_a); | |
| 34 | |
| 35 EXPECT_FALSE(key_a < key_b); | |
| 36 EXPECT_FALSE(key_b < key_b); | |
| 37 EXPECT_LT(key_c, key_b); | |
| 38 EXPECT_LT(key_d, key_b); | |
| 39 EXPECT_LT(key_e, key_b); | |
| 40 EXPECT_LT(key_f, key_b); | |
| 41 | |
| 42 EXPECT_FALSE(key_a < key_c); | |
| 43 EXPECT_FALSE(key_b < key_c); | |
| 44 EXPECT_FALSE(key_c < key_c); | |
| 45 EXPECT_LT(key_d, key_c); | |
| 46 EXPECT_LT(key_e, key_c); | |
| 47 EXPECT_LT(key_f, key_c); | |
| 48 | |
| 49 EXPECT_FALSE(key_a < key_d); | |
| 50 EXPECT_FALSE(key_b < key_d); | |
| 51 EXPECT_FALSE(key_c < key_d); | |
| 52 EXPECT_FALSE(key_d < key_d); | |
| 53 EXPECT_LT(key_e, key_d); | |
| 54 EXPECT_LT(key_f, key_d); | |
| 55 | |
| 56 EXPECT_FALSE(key_a < key_e); | |
| 57 EXPECT_FALSE(key_b < key_e); | |
| 58 EXPECT_FALSE(key_c < key_e); | |
| 59 EXPECT_FALSE(key_d < key_e); | |
| 60 EXPECT_FALSE(key_e < key_e); | |
| 61 EXPECT_LT(key_f, key_e); | |
| 62 | |
| 63 EXPECT_FALSE(key_a < key_f); | |
| 64 EXPECT_FALSE(key_b < key_f); | |
| 65 EXPECT_FALSE(key_c < key_f); | |
| 66 EXPECT_FALSE(key_d < key_f); | |
| 67 EXPECT_FALSE(key_e < key_f); | |
| 68 EXPECT_FALSE(key_f < key_f); | |
| 69 } | |
| 70 | |
| 71 TEST(TaskSchedulerSequenceSortKeyTest, OperatorEquals) { | |
| 72 const SequenceSortKey key_a(TaskPriority::USER_BLOCKING, | |
| 73 TimeTicks::FromInternalValue(1000)); | |
| 74 const SequenceSortKey key_b(TaskPriority::USER_BLOCKING, | |
| 75 TimeTicks::FromInternalValue(1000)); | |
| 76 const SequenceSortKey key_c(TaskPriority::USER_VISIBLE, | |
| 77 TimeTicks::FromInternalValue(1000)); | |
| 78 const SequenceSortKey key_d(TaskPriority::USER_BLOCKING, | |
| 79 TimeTicks::FromInternalValue(2000)); | |
| 80 const SequenceSortKey key_e(TaskPriority::USER_VISIBLE, | |
| 81 TimeTicks::FromInternalValue(2000)); | |
| 82 | |
| 83 EXPECT_EQ(key_a, key_b); | |
| 84 EXPECT_FALSE(key_a == key_c); | |
| 85 EXPECT_FALSE(key_a == key_d); | |
| 86 EXPECT_FALSE(key_a == key_e); | |
|
gab
2016/02/19 16:50:47
EXPECT_NE instead of EXPECT_FALSE
fdoray
2016/02/19 22:28:30
As we discussed, I'm testing the operator here.
| |
| 87 } | |
| 88 | |
| 89 } // namespace internal | |
| 90 } // namespace base | |
| OLD | NEW |