Rename TaskRunner::RunsTasksOnCurrentThread() in //components

components/history/core/browser/top_sites_impl.cc

 // Copyright (c) 2013 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/history/core/browser/top_sites_impl.h"
 
 #include <stdint.h>
 #include <algorithm>
 #include <set>
 #include <utility>
@@ skipping 33 matching lines @@
 namespace {
 
 void RunOrPostGetMostVisitedURLsCallback(
     base::TaskRunner* task_runner,
     bool include_forced_urls,
     const TopSitesImpl::GetMostVisitedURLsCallback& callback,
     const MostVisitedURLList& all_urls,
     const MostVisitedURLList& nonforced_urls) {
   const MostVisitedURLList& urls =
       include_forced_urls ? all_urls : nonforced_urls;
-  if (task_runner->RunsTasksOnCurrentThread())
+  if (task_runner->RunsTasksInCurrentSequence())
     callback.Run(urls);
   else
     task_runner->PostTask(FROM_HERE, base::Bind(callback, urls));
 }
 
 // Compares two MostVisitedURL having a non-null |last_forced_time|.
 bool ForcedURLComparator(const MostVisitedURL& first,
                          const MostVisitedURL& second) {
   DCHECK(!first.last_forced_time.is_null() &&
          !second.last_forced_time.is_null());
@@ skipping 853 matching lines @@
     for (std::set<size_t>::reverse_iterator i = indices_to_delete.rbegin();
          i != indices_to_delete.rend(); i++) {
       new_top_sites.erase(new_top_sites.begin() + *i);
     }
     SetTopSites(new_top_sites, CALL_LOCATION_FROM_OTHER_PLACES);
   }
   StartQueryForMostVisited();
 }
 
 }  // namespace history