Provision to start base::SimpleTestTickClock at initial ticks

components/scheduler/base/task_queue_manager_unittest.cc

 // Copyright 2014 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 "components/scheduler/base/task_queue_manager.h"
 
 #include <stddef.h>
 #include <utility>
 
 #include "base/location.h"
@@ skipping 54 matching lines @@
         make_scoped_ptr(new TestTimeSource(now_src_.get())));
     manager_ = make_scoped_ptr(new TaskQueueManager(
         main_task_runner_, "test.scheduler", "test.scheduler",
         "test.scheduler.debug"));
 
     for (size_t i = 0; i < num_queues; i++)
       runners_.push_back(manager_->NewTaskQueue(TaskQueue::Spec("test_queue")));
   }
 
   void Initialize(size_t num_queues) {
-    now_src_.reset(new base::SimpleTestTickClock());
-    now_src_->Advance(base::TimeDelta::FromMicroseconds(1000));
+    now_src_.reset(new base::SimpleTestTickClock(
+        base::TimeTicks() + base::TimeDelta::FromMicroseconds(1000)));
     InitializeWithClock(num_queues,
                         make_scoped_ptr(new TestTimeSource(now_src_.get())));
   }
 
   void InitializeWithRealMessageLoop(size_t num_queues) {
-    now_src_.reset(new base::SimpleTestTickClock());
+    now_src_.reset(new base::SimpleTestTickClock(base::TimeTicks()));
     message_loop_.reset(new base::MessageLoop());
     manager_ = make_scoped_ptr(new TaskQueueManager(
         MessageLoopTaskRunner::Create(
             make_scoped_ptr(new TestTimeSource(now_src_.get()))),
         "test.scheduler", "test.scheduler", "test.scheduler.debug"));
 
     for (size_t i = 0; i < num_queues; i++)
       runners_.push_back(manager_->NewTaskQueue(TaskQueue::Spec("test_queue")));
   }
 
@@ skipping 1606 matching lines @@
   double ratio = static_cast<double>(linear_delayed_task.count()) /
                  static_cast<double>(quadratic_immediate_task.count());
 
   // This is by design, we want to enforce a strict ordering in task execution
   // where by delayed tasks can not skip ahead of non-delayed work.
   EXPECT_GT(ratio, 0.0);
   EXPECT_LT(ratio, 0.1);
 }
 
 }  // namespace scheduler