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

ui/gfx/geometry/r_tree_base.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 "ui/gfx/geometry/r_tree_base.h"
 
 #include <algorithm>
 
 #include "base/logging.h"
 
@@ skipping 445 matching lines @@
   children_.insert(children_.end(),
                    sorted_children.begin(),
                    sorted_children.begin() + split_index);
   sibling->children_.insert(sibling->children_.end(),
                             sorted_children.begin() + split_index,
                             sorted_children.end());
 
   for (size_t i = 0; i < sibling->children_.size(); ++i)
     sibling->children_[i]->set_parent(sibling.get());
 
-  return sibling.PassAs<NodeBase>();
+  return sibling.Pass();
 }
 
 RTreeBase::Node* RTreeBase::Node::LeastOverlapIncrease(
     const Rect& node_rect,
     const Rects& expanded_rects) {
   NodeBase* best_node = children_.front();
   int least_overlap_increase =
       OverlapIncreaseToAdd(node_rect, children_[0], expanded_rects[0]);
   for (size_t i = 1; i < children_.size(); ++i) {
     int overlap_increase =
@@ skipping 172 matching lines @@
     root_.reset(
         static_cast<Node*>(root_->RemoveAndReturnLastChild().release()));
   }
 }
 
 void RTreeBase::ResetRoot() {
   root_.reset(new Node());
 }
 
 }  // namespace gfx