| OLD | NEW |
| 1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 "mojo/public/cpp/utility/run_loop.h" | 5 #include "mojo/public/cpp/utility/run_loop.h" |
| 6 | 6 |
| 7 #include <assert.h> | 7 #include <assert.h> |
| 8 | 8 |
| 9 #include <algorithm> | 9 #include <algorithm> |
| 10 #include <vector> | 10 #include <vector> |
| (...skipping 247 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 258 // std::priority_queue<> puts the least element at the end of the queue. We | 258 // std::priority_queue<> puts the least element at the end of the queue. We |
| 259 // want the soonest eligible task to be at the head of the queue, so | 259 // want the soonest eligible task to be at the head of the queue, so |
| 260 // run_times further in the future are considered lesser. | 260 // run_times further in the future are considered lesser. |
| 261 return run_time > other.run_time; | 261 return run_time > other.run_time; |
| 262 } | 262 } |
| 263 | 263 |
| 264 return sequence_number > other.sequence_number; | 264 return sequence_number > other.sequence_number; |
| 265 } | 265 } |
| 266 | 266 |
| 267 } // namespace mojo | 267 } // namespace mojo |
| OLD | NEW |