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 #include <stdint.h> |
8 | 9 |
9 #include <algorithm> | 10 #include <algorithm> |
10 #include <vector> | 11 #include <vector> |
11 | 12 |
12 #include "mojo/public/cpp/utility/lib/thread_local.h" | 13 #include "mojo/public/cpp/utility/lib/thread_local.h" |
13 #include "mojo/public/cpp/utility/run_loop_handler.h" | 14 #include "mojo/public/cpp/utility/run_loop_handler.h" |
14 | 15 |
15 namespace mojo { | 16 namespace mojo { |
16 namespace { | 17 namespace { |
17 | 18 |
(...skipping 240 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 | 259 // 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 | 260 // want the soonest eligible task to be at the head of the queue, so |
260 // run_times further in the future are considered lesser. | 261 // run_times further in the future are considered lesser. |
261 return run_time > other.run_time; | 262 return run_time > other.run_time; |
262 } | 263 } |
263 | 264 |
264 return sequence_number > other.sequence_number; | 265 return sequence_number > other.sequence_number; |
265 } | 266 } |
266 | 267 |
267 } // namespace mojo | 268 } // namespace mojo |
OLD | NEW |