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 namespace base { |
| 8 namespace internal { |
| 9 |
| 10 SequenceSortKey::SequenceSortKey(TaskPriority priority, |
| 11 TimeTicks next_task_sequenced_time) |
| 12 : priority_(priority), |
| 13 next_task_sequenced_time_(next_task_sequenced_time) {} |
| 14 |
| 15 bool SequenceSortKey::operator<(const SequenceSortKey& other) const { |
| 16 // This SequenceSortKey is considered less important than |other| if it has a |
| 17 // lower priority or if it has the same priority but its next task was posted |
| 18 // later than |other|'s. |
| 19 const int priority_diff = |
| 20 static_cast<TaskPriorityUnderlyingType>(priority_) - |
| 21 static_cast<TaskPriorityUnderlyingType>(other.priority_); |
| 22 return priority_diff == 0 |
| 23 ? next_task_sequenced_time_ > other.next_task_sequenced_time_ |
| 24 : priority_diff < 0; |
| 25 } |
| 26 |
| 27 bool SequenceSortKey::operator==(const SequenceSortKey& other) const { |
| 28 return priority_ == other.priority_ && |
| 29 next_task_sequenced_time_ == other.next_task_sequenced_time_; |
| 30 } |
| 31 |
| 32 } // namespace internal |
| 33 } // namespace base |
OLD | NEW |