diff options
| author | tfarina@chromium.org <tfarina@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98> | 2011-03-10 02:38:12 +0000 |
|---|---|---|
| committer | tfarina@chromium.org <tfarina@chromium.org@0039d316-1c4b-4281-b951-d872f2087c98> | 2011-03-10 02:38:12 +0000 |
| commit | 9c1a75a98415e74b4aa835786ae86825a11d2385 (patch) | |
| tree | 612ccad3919bdf0458d7a616dec98f25d21a703b /chrome/browser/bookmarks/bookmark_model_test_utils.cc | |
| parent | 1738fde08f5ee274dac199c1a98da9b0be5230d0 (diff) | |
| download | chromium_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/browser/bookmarks/bookmark_model_test_utils.cc')
| -rw-r--r-- | chrome/browser/bookmarks/bookmark_model_test_utils.cc | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/chrome/browser/bookmarks/bookmark_model_test_utils.cc b/chrome/browser/bookmarks/bookmark_model_test_utils.cc index e5b2a70..a8503d7 100644 --- a/chrome/browser/bookmarks/bookmark_model_test_utils.cc +++ b/chrome/browser/bookmarks/bookmark_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. @@ -23,8 +23,8 @@ void BookmarkModelTestUtils::AssertNodesEqual(const BookmarkNode* expected, } else { EXPECT_TRUE(expected->date_group_modified() == actual->date_group_modified()); - ASSERT_EQ(expected->GetChildCount(), actual->GetChildCount()); - for (int i = 0; i < expected->GetChildCount(); ++i) + ASSERT_EQ(expected->child_count(), actual->child_count()); + for (int i = 0; i < expected->child_count(); ++i) AssertNodesEqual(expected->GetChild(i), actual->GetChild(i), check_ids); } } |