| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "chrome/browser/sync/test/integration/bookmarks_helper.h" | 5 #include "chrome/browser/sync/test/integration/bookmarks_helper.h" |
| 6 | 6 |
| 7 #include <set> | 7 #include <set> |
| 8 #include <vector> | 8 #include <vector> |
| 9 | 9 |
| 10 #include "base/bind.h" | 10 #include "base/bind.h" |
| (...skipping 613 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 624 | 624 |
| 625 void Remove(int profile, const BookmarkNode* parent, int index) { | 625 void Remove(int profile, const BookmarkNode* parent, int index) { |
| 626 BookmarkModel* model = GetBookmarkModel(profile); | 626 BookmarkModel* model = GetBookmarkModel(profile); |
| 627 ASSERT_EQ(bookmarks::GetBookmarkNodeByID(model, parent->id()), parent) | 627 ASSERT_EQ(bookmarks::GetBookmarkNodeByID(model, parent->id()), parent) |
| 628 << "Node " << parent->GetTitle() << " does not belong to " | 628 << "Node " << parent->GetTitle() << " does not belong to " |
| 629 << "Profile " << profile; | 629 << "Profile " << profile; |
| 630 if (sync_datatype_helper::test()->use_verifier()) { | 630 if (sync_datatype_helper::test()->use_verifier()) { |
| 631 const BookmarkNode* v_parent = NULL; | 631 const BookmarkNode* v_parent = NULL; |
| 632 FindNodeInVerifier(model, parent, &v_parent); | 632 FindNodeInVerifier(model, parent, &v_parent); |
| 633 ASSERT_TRUE(NodesMatch(parent->GetChild(index), v_parent->GetChild(index))); | 633 ASSERT_TRUE(NodesMatch(parent->GetChild(index), v_parent->GetChild(index))); |
| 634 GetVerifierBookmarkModel()->Remove(v_parent, index); | 634 GetVerifierBookmarkModel()->Remove(v_parent->GetChild(index)); |
| 635 } | 635 } |
| 636 model->Remove(parent, index); | 636 model->Remove(parent->GetChild(index)); |
| 637 } | 637 } |
| 638 | 638 |
| 639 void RemoveAll(int profile) { | 639 void RemoveAll(int profile) { |
| 640 if (sync_datatype_helper::test()->use_verifier()) { | 640 if (sync_datatype_helper::test()->use_verifier()) { |
| 641 const BookmarkNode* root_node = GetVerifierBookmarkModel()->root_node(); | 641 const BookmarkNode* root_node = GetVerifierBookmarkModel()->root_node(); |
| 642 for (int i = 0; i < root_node->child_count(); ++i) { | 642 for (int i = 0; i < root_node->child_count(); ++i) { |
| 643 const BookmarkNode* permanent_node = root_node->GetChild(i); | 643 const BookmarkNode* permanent_node = root_node->GetChild(i); |
| 644 for (int j = permanent_node->child_count() - 1; j >= 0; --j) { | 644 for (int j = permanent_node->child_count() - 1; j >= 0; --j) { |
| 645 GetVerifierBookmarkModel()->Remove(permanent_node, j); | 645 GetVerifierBookmarkModel()->Remove(permanent_node->GetChild(j)); |
| 646 } | 646 } |
| 647 } | 647 } |
| 648 } | 648 } |
| 649 GetBookmarkModel(profile)->RemoveAllUserBookmarks(); | 649 GetBookmarkModel(profile)->RemoveAllUserBookmarks(); |
| 650 } | 650 } |
| 651 | 651 |
| 652 void SortChildren(int profile, const BookmarkNode* parent) { | 652 void SortChildren(int profile, const BookmarkNode* parent) { |
| 653 BookmarkModel* model = GetBookmarkModel(profile); | 653 BookmarkModel* model = GetBookmarkModel(profile); |
| 654 ASSERT_EQ(bookmarks::GetBookmarkNodeByID(model, parent->id()), parent) | 654 ASSERT_EQ(bookmarks::GetBookmarkNodeByID(model, parent->id()), parent) |
| 655 << "Node " << parent->GetTitle() << " does not belong to " | 655 << "Node " << parent->GetTitle() << " does not belong to " |
| (...skipping 200 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 856 | 856 |
| 857 std::string IndexedSubfolderName(int i) { | 857 std::string IndexedSubfolderName(int i) { |
| 858 return base::StringPrintf("Subfolder Name %d", i); | 858 return base::StringPrintf("Subfolder Name %d", i); |
| 859 } | 859 } |
| 860 | 860 |
| 861 std::string IndexedSubsubfolderName(int i) { | 861 std::string IndexedSubsubfolderName(int i) { |
| 862 return base::StringPrintf("Subsubfolder Name %d", i); | 862 return base::StringPrintf("Subsubfolder Name %d", i); |
| 863 } | 863 } |
| 864 | 864 |
| 865 } // namespace bookmarks_helper | 865 } // namespace bookmarks_helper |
| OLD | NEW |