1 // Copyright (c) 2011 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.
5 #include "base/pending_task.h"
7 #include "base/tracked_objects.h"
12 // This a temporary fix for compiling on VS2012. http://crbug.com/154744
13 PendingTask::PendingTask() : sequence_num(-1), nestable(false) {
17 PendingTask::PendingTask(const tracked_objects::Location
& posted_from
,
18 const base::Closure
& task
)
19 : base::TrackingInfo(posted_from
, TimeTicks()),
21 posted_from(posted_from
),
26 PendingTask::PendingTask(const tracked_objects::Location
& posted_from
,
27 const base::Closure
& task
,
28 TimeTicks delayed_run_time
,
30 : base::TrackingInfo(posted_from
, delayed_run_time
),
32 posted_from(posted_from
),
37 PendingTask::~PendingTask() {
40 bool PendingTask::operator<(const PendingTask
& other
) const {
41 // Since the top of a priority queue is defined as the "greatest" element, we
42 // need to invert the comparison here. We want the smaller time to be at the
45 if (delayed_run_time
< other
.delayed_run_time
)
48 if (delayed_run_time
> other
.delayed_run_time
)
51 // If the times happen to match, then we use the sequence number to decide.
52 // Compare the difference to support integer roll-over.
53 return (sequence_num
- other
.sequence_num
) > 0;
56 void TaskQueue::Swap(TaskQueue
* queue
) {
57 c
.swap(queue
->c
); // Calls std::deque::swap.