Rework tree APIs to reflect Google style and more const-correctness....

chrome/browser/ui/views/bookmark_editor_view_unittest.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 <string>
 
 #include "base/message_loop.h"
 #include "base/string_util.h"
 #include "base/utf_string_conversions.h"
 #include "chrome/browser/bookmarks/bookmark_model.h"
@@ skipping 68 matching lines @@
   void ApplyEdits(BookmarkEditorView::EditorNode* node) {
     editor_->ApplyEdits(node);
   }
 
   BookmarkEditorView::EditorNode* AddNewGroup(
       BookmarkEditorView::EditorNode* parent) {
     return editor_->AddNewGroup(parent);
   }
 
   bool URLTFHasParent() {
-    return editor_->url_tf_.GetParent();
+    return editor_->url_tf_.parent();
   }
 
  private:
   // Creates the following structure:
   // bookmark bar node
   //   a
   //   F1
   //    f1a
   //    F11
   //     f11a
@@ skipping 257 matching lines @@
   EXPECT_EQ(BookmarkNode::FOLDER, new_node->type());
   EXPECT_EQ(ASCIIToUTF16("new_F"), new_node->GetTitle());
   // The node should have one child.
   ASSERT_EQ(1, new_node->GetChildCount());
   const BookmarkNode* new_child = new_node->GetChild(0);
   // Make sure the child url/title match.
   EXPECT_EQ(BookmarkNode::URL, new_child->type());
   EXPECT_EQ(WideToUTF16Hack(details.urls[0].second), new_child->GetTitle());
   EXPECT_EQ(details.urls[0].first, new_child->GetURL());
 }