1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
// Copyright 2024 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "chrome/browser/bookmarks/bookmark_parent_folder_children.h"
#include <memory>
#include "base/test/scoped_feature_list.h"
#include "chrome/browser/bookmarks/bookmark_merged_surface_service.h"
#include "chrome/browser/bookmarks/bookmark_test_helpers.h"
#include "chrome/browser/bookmarks/permanent_folder_ordering_tracker.h"
#include "components/bookmarks/browser/bookmark_model.h"
#include "components/bookmarks/browser/bookmark_node.h"
#include "components/bookmarks/test/test_bookmark_client.h"
#include "components/sync/base/features.h"
#include "testing/gmock/include/gmock/gmock.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace {
using bookmarks::BookmarkModel;
using bookmarks::BookmarkNode;
class BookmarkParentFolderChildrenTest : public testing::Test {
public:
BookmarkParentFolderChildrenTest() {
model_ = std::make_unique<BookmarkModel>(
std::make_unique<bookmarks::TestBookmarkClient>());
model_->LoadEmptyForTest();
merged_service_ = std::make_unique<BookmarkMergedSurfaceService>(
model_.get(), /*managed_service*/ nullptr);
merged_service_->LoadForTesting({});
}
BookmarkModel& bookmark_model() { return *model_.get(); }
void AddUrlBookmarks(const BookmarkNode* parent,
size_t index,
size_t number_of_bookmarks) {
for (size_t i = 0; i < number_of_bookmarks; i++) {
bookmark_model().AddURL(parent, index + i, u"Title",
GURL("https://example.com"));
}
}
private:
std::unique_ptr<BookmarkModel> model_;
std::unique_ptr<BookmarkMergedSurfaceService> merged_service_;
};
TEST_F(BookmarkParentFolderChildrenTest, FromNode) {
const BookmarkNode* folder_node = bookmark_model().AddFolder(
bookmark_model().bookmark_bar_node(), 0, u"folder");
BookmarkParentFolderChildren folder_node_children(folder_node);
EXPECT_EQ(folder_node_children.size(), 0u);
size_t kChildrenSize = 5u;
AddUrlBookmarks(folder_node, 0, /*number_of_bookmarks=*/kChildrenSize);
EXPECT_EQ(folder_node_children.size(), kChildrenSize);
ASSERT_EQ(folder_node->children().size(), folder_node_children.size());
for (size_t i = 0; i < folder_node_children.size(); i++) {
EXPECT_EQ(folder_node_children[i], folder_node->children()[i].get());
}
}
TEST_F(BookmarkParentFolderChildrenTest, FromPermanentFolderOrderingTracker) {
testing::NiceMock<MockPermanentFolderOrderingTrackerDelegate> delegate;
PermanentFolderOrderingTracker tracker(
&bookmark_model(), BookmarkNode::Type::BOOKMARK_BAR, &delegate);
EXPECT_CALL(delegate, TrackedOrderingChanged);
tracker.Init(/*in_order_node_ids=*/{});
BookmarkParentFolderChildren bookmark_bar_children(&tracker);
EXPECT_EQ(bookmark_bar_children.size(), 0u);
size_t kChildrenSize = 5u;
const BookmarkNode* bookmark_bar_node = bookmark_model().bookmark_bar_node();
AddUrlBookmarks(bookmark_bar_node, 0,
/*number_of_bookmarks=*/kChildrenSize);
EXPECT_EQ(bookmark_bar_children.size(), kChildrenSize);
ASSERT_EQ(bookmark_bar_children.size(), bookmark_bar_node->children().size());
for (size_t i = 0; i < bookmark_bar_children.size(); i++) {
EXPECT_EQ(bookmark_bar_children[i], bookmark_bar_node->children()[i].get());
}
}
TEST_F(BookmarkParentFolderChildrenTest, Iterator) {
const BookmarkNode* folder_node_1 = bookmark_model().AddFolder(
bookmark_model().bookmark_bar_node(), 0, u"folder");
const BookmarkNode* folder_node_2 = bookmark_model().AddFolder(
bookmark_model().bookmark_bar_node(), 1, u"folder");
BookmarkParentFolderChildren folder_node_1_children(folder_node_1);
EXPECT_EQ(folder_node_1_children.size(), 0u);
BookmarkParentFolderChildren folder_node_2_children(folder_node_2);
EXPECT_EQ(folder_node_2_children.size(), 0u);
size_t kFolderNode1ChildrenSize = 5u;
size_t kFolderNode2ChildrenSize = 3u;
AddUrlBookmarks(folder_node_1, 0,
/*number_of_bookmarks=*/kFolderNode1ChildrenSize);
AddUrlBookmarks(folder_node_2, 0,
/*number_of_bookmarks=*/kFolderNode2ChildrenSize);
EXPECT_EQ(folder_node_1_children.size(), kFolderNode1ChildrenSize);
ASSERT_EQ(folder_node_1->children().size(), folder_node_1_children.size());
EXPECT_EQ(folder_node_2_children.size(), kFolderNode2ChildrenSize);
ASSERT_EQ(folder_node_2->children().size(), folder_node_2_children.size());
size_t index = 0;
for (const BookmarkNode* node : folder_node_1_children) {
EXPECT_EQ(node, folder_node_1->children()[index++].get());
}
index = 0;
for (const BookmarkNode* node : folder_node_2_children) {
EXPECT_EQ(node, folder_node_2->children()[index++].get());
}
EXPECT_NE(folder_node_1_children.begin(), folder_node_1_children.end());
EXPECT_NE(folder_node_2_children.begin(), folder_node_2_children.end());
EXPECT_NE(folder_node_1_children.begin(), folder_node_2_children.end());
}
} // namespace
|
