summaryrefslogtreecommitdiffstats
path: root/chrome/test/model_test_utils.cc
diff options
context:
space:
mode:
authortfarina@chromium.org <tfarina@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98>2011-03-10 02:38:12 +0000
committertfarina@chromium.org <tfarina@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98>2011-03-10 02:38:12 +0000
commit9c1a75a98415e74b4aa835786ae86825a11d2385 (patch)
tree612ccad3919bdf0458d7a616dec98f25d21a703b /chrome/test/model_test_utils.cc
parent1738fde08f5ee274dac199c1a98da9b0be5230d0 (diff)
downloadchromium_src-9c1a75a98415e74b4aa835786ae86825a11d2385.zip
chromium_src-9c1a75a98415e74b4aa835786ae86825a11d2385.tar.gz
chromium_src-9c1a75a98415e74b4aa835786ae86825a11d2385.tar.bz2
Rename TreeNode::GetChildCount to TreeNode::child_count. Part 3.
This is part of a serie of patches to make the TreeNode API more closer to style used in the Views Tree API (see views/view.h for reference). BUG=None TEST=existing unit_tests. Review URL: http://codereview.chromium.org/6639015 git-svn-id: svn://svn.chromium.org/chrome/trunk/src@77592 0039d316-1c4b-4281-b951-d872f2087c98
Diffstat (limited to 'chrome/test/model_test_utils.cc')
-rw-r--r--chrome/test/model_test_utils.cc6
1 files changed, 3 insertions, 3 deletions
diff --git a/chrome/test/model_test_utils.cc b/chrome/test/model_test_utils.cc
index 27a1d79..0f8be71 100644
--- a/chrome/test/model_test_utils.cc
+++ b/chrome/test/model_test_utils.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.
@@ -13,7 +13,7 @@ namespace model_test_utils {
std::string ModelStringFromNode(const BookmarkNode* node) {
// Since the children of the node are not available as a vector,
// we'll just have to do it the hard way.
- int child_count = node->GetChildCount();
+ int child_count = node->child_count();
std::string child_string;
for (int i = 0; i < child_count; ++i) {
const BookmarkNode* child = node->GetChild(i);
@@ -34,7 +34,7 @@ std::string::size_type AddNodesFromString(BookmarkModel& model,
const std::string& model_string,
std::string::size_type start_pos) {
DCHECK(node);
- int index = node->GetChildCount();
+ int index = node->child_count();
static const std::string folder_tell(":[");
std::string::size_type end_pos = model_string.find(' ', start_pos);
while (end_pos != std::string::npos) {