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"
11 PendingTask::PendingTask(const tracked_objects::Location
& posted_from
,
12 const base::Closure
& task
)
13 : base::TrackingInfo(posted_from
, TimeTicks()),
15 posted_from(posted_from
),
20 PendingTask::PendingTask(const tracked_objects::Location
& posted_from
,
21 const base::Closure
& task
,
22 TimeTicks delayed_run_time
,
24 : base::TrackingInfo(posted_from
, delayed_run_time
),
26 posted_from(posted_from
),
31 PendingTask::~PendingTask() {
34 bool PendingTask::operator<(const PendingTask
& other
) const {
35 // Since the top of a priority queue is defined as the "greatest" element, we
36 // need to invert the comparison here. We want the smaller time to be at the
39 if (delayed_run_time
< other
.delayed_run_time
)
42 if (delayed_run_time
> other
.delayed_run_time
)
45 // If the times happen to match, then we use the sequence number to decide.
46 // Compare the difference to support integer roll-over.
47 return (sequence_num
- other
.sequence_num
) > 0;
50 void TaskQueue::Swap(TaskQueue
* queue
) {
51 c
.swap(queue
->c
); // Calls std::deque::swap.