ui/base/models: Use operator '->' for accessing std::vector elements in TreeNode class.

ui/base/models/tree_node_model.h

 // 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.
 
 #ifndef UI_BASE_MODELS_TREE_NODE_MODEL_H_
 #define UI_BASE_MODELS_TREE_NODE_MODEL_H_
 #pragma once
 
 #include <algorithm>
 #include <vector>
@@ skipping 53 matching lines @@
 template <class NodeType>
 class TreeNode : public TreeModelNode {
  public:
   TreeNode() : parent_(NULL) {}
 
   explicit TreeNode(const string16& title)
       : title_(title), parent_(NULL) {}
 
   virtual ~TreeNode() {}
 
-  // Adds |node| as a child of this one, at |index|.
+  // Adds |node| as a child of this node, at |index|.
   virtual void Add(NodeType* node, int index) {
     DCHECK(node);
     DCHECK_GE(index, 0);
     DCHECK_LE(index, child_count());
-    // If the node has a parent, remove it from its parent.
+    // If |node| has a parent, remove it from its parent.
     NodeType* parent = node->parent_;
     if (parent)
       parent->Remove(node);
     node->parent_ = static_cast<NodeType*>(this);
     children_->insert(children_->begin() + index, node);
   }
 
   // Removes |node| from this node and returns it. It's up to the caller to
   // delete it.
   virtual NodeType* Remove(NodeType* node) {
     typename std::vector<NodeType*>::iterator i =
         std::find(children_->begin(), children_->end(), node);
-    DCHECK(i != children_.end());
+    DCHECK(i != children_->end());
     node->parent_ = NULL;
     children_->erase(i);
     return node;
   }
 
   // Removes all the children from this node. This does NOT delete the nodes.
   void RemoveAll() {
     for (size_t i = 0; i < children_->size(); ++i)
       children_[i]->parent_ = NULL;
     children_->clear();
   }
 
   // Returns the parent node, or NULL if this is the root node.
   const NodeType* parent() const { return parent_; }
   NodeType* parent() { return parent_; }
 
   // Returns true if this is the root node.
   bool is_root() const { return parent_ == NULL; }
 
   // Returns the number of children.
   int child_count() const { return static_cast<int>(children_->size()); }
 
   // Returns true if this node has no children.
-  bool empty() const { return children_.empty(); }
+  bool empty() const { return children_->empty(); }
 
   // Returns the number of all nodes in the subtree rooted at this node,
   // including this node.
   int GetTotalNodeCount() const {
     int count = 1;  // Start with one to include the node itself.
     for (size_t i = 0; i < children_->size(); ++i)
       count += children_[i]->GetTotalNodeCount();
     return count;
   }
 
@@ skipping 162 matching lines @@
 
   // The root.
   scoped_ptr<NodeType> root_;
 
   DISALLOW_COPY_AND_ASSIGN(TreeNodeModel);
 };
 
 }  // namespace ui
 
 #endif  // UI_BASE_MODELS_TREE_NODE_MODEL_H_