Rename IndexOfChild to GetIndexOf. Part 1

This is part of a serie of patches to make the TreeNode more closer to style
used in the Views Tree API (see views/view.h for reference).

BUG=None
TEST=None

Review URL: http://codereview.chromium.org/6623037

git-svn-id: svn://svn.chromium.org/chrome/trunk/src@77295 0039d316-1c4b-4281-b951-d872f2087c98

2 files changed, 4 insertions, 4 deletions

diff --git a/chrome/browser/extensions/extension_bookmark_helpers.cc b/chrome/browser/extensions/extension_bookmark_helpers.cc
index a48a12c..6829cc4 100644
--- a/chrome/browser/extensions/extension_bookmark_helpers.cc
+++ b/chrome/browser/extensions/extension_bookmark_helpers.cc
@@ -1,4 +1,4 @@
-// Copyright (c) 2010 The Chromium Authors. All rights reserved.
+// 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.
 
@@ -23,7 +23,7 @@ DictionaryValue* GetNodeDictionary(const BookmarkNode* node,
   const BookmarkNode* parent = node->GetParent();
   if (parent) {
     dict->SetString(keys::kParentIdKey, base::Int64ToString(parent->id()));
-    dict->SetInteger(keys::kIndexKey, parent->IndexOfChild(node));
+    dict->SetInteger(keys::kIndexKey, parent->GetIndexOf(node));
   }
 
   if (!node->is_folder()) {
@@ -101,7 +101,7 @@ bool RemoveNode(BookmarkModel* model,
   }
 
   const BookmarkNode* parent = node->GetParent();
-  int index = parent->IndexOfChild(node);
+  int index = parent->GetIndexOf(node);
   model->Remove(parent, index);
   return true;
 }
diff --git a/chrome/browser/extensions/extension_bookmark_manager_api.cc b/chrome/browser/extensions/extension_bookmark_manager_api.cc
index 31c0c51..bdb960d 100644
--- a/chrome/browser/extensions/extension_bookmark_manager_api.cc
+++ b/chrome/browser/extensions/extension_bookmark_manager_api.cc
@@ -245,7 +245,7 @@ bool PasteBookmarkManagerFunction::RunImpl() {
   int highest_index = -1;  // -1 means insert at end of list.
   for (size_t node = 0; node < nodes.size(); ++node) {
     // + 1 so that we insert after the selection.
-    int this_node_index = parent_node->IndexOfChild(nodes[node]) + 1;
+    int this_node_index = parent_node->GetIndexOf(nodes[node]) + 1;
     if (this_node_index > highest_index)
       highest_index = this_node_index;
   }