Adds ability to sort the children of a node in the bookmark model. I...

chrome/views/tree_node_model.h

 // Copyright (c) 2006-2008 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 CHROME_VIEWS_TREE_NODE_MODEL_H__
 #define CHROME_VIEWS_TREE_NODE_MODEL_H__
 
 #include <algorithm>
 #include <vector>
 
@@ skipping 74 matching lines @@
   // Removes the node by index. This does NOT delete the specified node, it is
   // up to the caller to delete it when done.
   virtual NodeType* Remove(int index) {
     DCHECK(index >= 0 && index < GetChildCount());
     NodeType* node = GetChild(index);
     node->parent_ = NULL;
     children_->erase(index + children_->begin());
     return node;
   }
 
-  // Returns the children.
-  std::vector<NodeType*> GetChildren() {
-    return children_->v;
-  }
-
   // Returns the number of children.
   int GetChildCount() {
     return static_cast<int>(children_->size());
   }
 
   // Returns a child by index.
   NodeType* GetChild(int index) {
     DCHECK(index >= 0 && index < GetChildCount());
     return children_[index];
   }
@@ skipping 29 matching lines @@
   // Returns true if this == ancestor, or one of this nodes parents is
   // ancestor.
   bool HasAncestor(NodeType* ancestor) const {
     if (ancestor == this)
       return true;
     if (!ancestor)
       return false;
     return parent_ ? parent_->HasAncestor(ancestor) : false;
   }
 
+ protected:
+  std::vector<NodeType*>& children() { return children_.get(); }
+
  private:
   // Title displayed in the tree.
   std::wstring title_;
 
   NodeType* parent_;
 
   // Children.
   ScopedVector<NodeType> children_;
 
   DISALLOW_COPY_AND_ASSIGN(TreeNode);
@@ skipping 108 matching lines @@
 
   // The observer.
   TreeModelObserver* observer_;
 
   DISALLOW_COPY_AND_ASSIGN(TreeNodeModel);
 };
 
 }  // namespace views
 
 #endif  // CHROME_VIEWS_TREE_NODE_MODEL_H__
-