Use scoped_ptr::Pass instead of scoped_ptr::PassAs<T>.

chrome/browser/history/history_backend_unittest.cc

 // Copyright (c) 2012 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 "chrome/browser/history/history_backend.h"
 
 #include <algorithm>
 #include <set>
 #include <vector>
 
@@ skipping 418 matching lines @@
                             const URLRow* row2 = NULL,
                             const URLRow* row3 = NULL) {
     URLRows rows;
     rows.push_back(*row1);
     if (row2) rows.push_back(*row2);
     if (row3) rows.push_back(*row3);
 
     if (type == chrome::NOTIFICATION_HISTORY_URLS_MODIFIED) {
       scoped_ptr<URLsModifiedDetails> details(new URLsModifiedDetails());
       details->changed_urls.swap(rows);
-      BroadcastNotifications(type, details.PassAs<HistoryDetails>());
+      BroadcastNotifications(type, details.Pass());
     } else if (type == chrome::NOTIFICATION_HISTORY_URL_VISITED) {
       for (URLRows::const_iterator it = rows.begin(); it != rows.end(); ++it) {
         scoped_ptr<URLVisitedDetails> details(new URLVisitedDetails());
         details->row = *it;
-        BroadcastNotifications(type, details.PassAs<HistoryDetails>());
+        BroadcastNotifications(type, details.Pass());
       }
     } else if (type == chrome::NOTIFICATION_HISTORY_URLS_DELETED) {
       scoped_ptr<URLsDeletedDetails> details(new URLsDeletedDetails());
       details->rows = rows;
-      BroadcastNotifications(type, details.PassAs<HistoryDetails>());
+      BroadcastNotifications(type, details.Pass());
     } else {
       NOTREACHED();
     }
   }
 
  protected:
   size_t GetNumberOfMatchingSearchTerms(const int keyword_id,
                                         const base::string16& prefix) {
     std::vector<KeywordSearchTermVisit> matching_terms;
     mem_backend_->db()->GetMostRecentKeywordSearchTerms(
@@ skipping 2681 matching lines @@
   URLRow row1(CreateTestTypedURL());
   URLRow row2(CreateAnotherTestTypedURL());
   URLRow row3(CreateTestNonTypedURL());
   SimulateNotification(chrome::NOTIFICATION_HISTORY_URLS_MODIFIED,
                        &row1, &row2, &row3);
 
   // Now notify the in-memory database that all history has been deleted.
   scoped_ptr<URLsDeletedDetails> details(new URLsDeletedDetails());
   details->all_history = true;
   BroadcastNotifications(chrome::NOTIFICATION_HISTORY_URLS_DELETED,
-                         details.PassAs<HistoryDetails>());
+                         details.Pass());
 
   // Expect that everything goes away.
   EXPECT_EQ(0, mem_backend_->db()->GetRowForURL(row1.url(), NULL));
   EXPECT_EQ(0, mem_backend_->db()->GetRowForURL(row2.url(), NULL));
   EXPECT_EQ(0, mem_backend_->db()->GetRowForURL(row3.url(), NULL));
 }
 
 void InMemoryHistoryBackendTest::PopulateTestURLsAndSearchTerms(
     URLRow* row1,
     URLRow* row2,
@@ skipping 101 matching lines @@
   // Verify that the second term is no longer returned as result, and also check
   // at the low level that it is gone for good. The term corresponding to the
   // first URLRow should not be affected.
   EXPECT_EQ(1u, GetNumberOfMatchingSearchTerms(kTestKeywordId, term1));
   EXPECT_EQ(0u, GetNumberOfMatchingSearchTerms(kTestKeywordId, term2));
   EXPECT_TRUE(mem_backend_->db()->GetKeywordSearchTermRow(row1.id(), NULL));
   EXPECT_FALSE(mem_backend_->db()->GetKeywordSearchTermRow(row2.id(), NULL));
 }
 
 }  // namespace history