TaskScheduler: Add delayed run time to the constructor of Task.

base/task_scheduler/priority_queue_unittest.cc

 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "base/task_scheduler/priority_queue.h"
 
 #include <memory>
 
 #include "base/macros.h"
 #include "base/memory/ptr_util.h"
@@ skipping 54 matching lines @@
   do {                                                    \
     SCOPED_TRACE("");                                     \
     ExpectSequenceAndSortKeyEq(expected, actual);         \
   } while (false)
 
 }  // namespace
 
 TEST(TaskSchedulerPriorityQueueTest, PushPopPeek) {
   // Create test sequences.
   scoped_refptr<Sequence> sequence_a(new Sequence);
-  sequence_a->PushTask(WrapUnique(
-      new Task(FROM_HERE, Closure(),
-               TaskTraits().WithPriority(TaskPriority::USER_VISIBLE))));
+  sequence_a->PushTask(WrapUnique(new Task(
+      FROM_HERE, Closure(),
+      TaskTraits().WithPriority(TaskPriority::USER_VISIBLE), TimeTicks())));
   SequenceSortKey sort_key_a = sequence_a->GetSortKey();
 
   scoped_refptr<Sequence> sequence_b(new Sequence);
-  sequence_b->PushTask(WrapUnique(
-      new Task(FROM_HERE, Closure(),
-               TaskTraits().WithPriority(TaskPriority::USER_BLOCKING))));
+  sequence_b->PushTask(WrapUnique(new Task(
+      FROM_HERE, Closure(),
+      TaskTraits().WithPriority(TaskPriority::USER_BLOCKING), TimeTicks())));
   SequenceSortKey sort_key_b = sequence_b->GetSortKey();
 
   scoped_refptr<Sequence> sequence_c(new Sequence);
-  sequence_c->PushTask(WrapUnique(
-      new Task(FROM_HERE, Closure(),
-               TaskTraits().WithPriority(TaskPriority::USER_BLOCKING))));
+  sequence_c->PushTask(WrapUnique(new Task(
+      FROM_HERE, Closure(),
+      TaskTraits().WithPriority(TaskPriority::USER_BLOCKING), TimeTicks())));
   SequenceSortKey sort_key_c = sequence_c->GetSortKey();
 
   scoped_refptr<Sequence> sequence_d(new Sequence);
-  sequence_d->PushTask(WrapUnique(
-      new Task(FROM_HERE, Closure(),
-               TaskTraits().WithPriority(TaskPriority::BACKGROUND))));
+  sequence_d->PushTask(WrapUnique(new Task(
+      FROM_HERE, Closure(), TaskTraits().WithPriority(TaskPriority::BACKGROUND),
+      TimeTicks())));
   SequenceSortKey sort_key_d = sequence_d->GetSortKey();
 
   // Create a PriorityQueue and a Transaction.
   PriorityQueue pq;
   auto transaction(pq.BeginTransaction());
   EXPECT_SEQUENCE_AND_SORT_KEY_EQ(PriorityQueue::SequenceAndSortKey(),
                                   transaction->Peek());
 
   // Push |sequence_a| in the PriorityQueue. It becomes the sequence with the
   // highest priority.
@@ skipping 113 matching lines @@
   EXPECT_TRUE(PriorityQueue::SequenceAndSortKey().is_null());
 
   const PriorityQueue::SequenceAndSortKey non_null_sequence_and_sort_key(
       make_scoped_refptr(new Sequence),
       SequenceSortKey(TaskPriority::USER_VISIBLE, TimeTicks()));
   EXPECT_FALSE(non_null_sequence_and_sort_key.is_null());
 }
 
 }  // namespace internal
 }  // namespace base