views: Use ViewVector typedef instead of std::vector<View*> in view.*

views/view.cc

 // Copyright (c) 2011 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 "views/view.h"
 
 #include <algorithm>
 
 #include "base/logging.h"
 #include "base/memory/scoped_ptr.h"
@@ skipping 548 matching lines @@
 }
 
 int View::GetGroup() const {
   return group_;
 }
 
 bool View::IsGroupFocusTraversable() const {
   return true;
 }
 
-void View::GetViewsWithGroup(int group_id, std::vector<View*>* out) {
+void View::GetViewsWithGroup(int group_id, ViewVector* out) {
   if (group_ == group_id)
     out->push_back(this);
 
   for (int i = 0, count = child_count(); i < count; ++i)
     GetChildViewAt(i)->GetViewsWithGroup(group_id, out);
 }
 
 View* View::GetSelectedViewForGroup(int group_id) {
-  std::vector<View*> views;
+  ViewVector views;
   GetWidget()->GetRootView()->GetViewsWithGroup(group_id, &views);
   return views.empty() ? NULL : views[0];
 }
 
 // Coordinate conversion -------------------------------------------------------
 
 // static
 void View::ConvertPointToView(const View* src,
                               const View* dst,
                               gfx::Point* point) {
@@ skipping 867 matching lines @@
     Layout();
   }
 
   if (NeedsNotificationWhenVisibleBoundsChange()) {
     OnVisibleBoundsChanged();
   }
 
   // Notify interested Views that visible bounds within the root view may have
   // changed.
   if (descendants_to_notify_.get()) {
-    for (std::vector<View*>::iterator i = descendants_to_notify_->begin();
+    for (ViewVector::iterator i = descendants_to_notify_->begin();
          i != descendants_to_notify_->end(); ++i) {
       (*i)->OnVisibleBoundsChanged();
     }
   }
 }
 
 // static
 void View::RegisterChildrenForVisibleBoundsNotification(View* view) {
   if (view->NeedsNotificationWhenVisibleBoundsChange())
     view->RegisterForVisibleBoundsNotification();
@@ skipping 260 matching lines @@
 
   if (child_count == 0) {
     v->next_focusable_view_ = NULL;
     v->previous_focusable_view_ = NULL;
   } else {
     if (index == child_count) {
       // We are inserting at the end, but the end of the child list may not be
       // the last focusable element. Let's try to find an element with no next
       // focusable element to link to.
       View* last_focusable_view = NULL;
-      for (std::vector<View*>::iterator iter = children_.begin();
+      for (ViewVector::iterator iter = children_.begin();
            iter != children_.end(); ++iter) {
           if (!(*iter)->next_focusable_view_) {
             last_focusable_view = *iter;
             break;
           }
       }
       if (last_focusable_view == NULL) {
         // Hum... there is a cycle in the focus list. Let's just insert ourself
         // after the last child.
         View* prev = children_[index - 1];
@@ skipping 112 matching lines @@
     result.append(GetChildViewAt(i)->PrintViewGraph(false));
 
   if (first)
     result.append("}\n");
 
   return result;
 }
 #endif
 
 }  // namespace views