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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
// Copyright (c) 2012 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.
#include "chrome/browser/extensions/api/bookmarks/bookmark_api_helpers.h"
#include <math.h> // For floor()
#include <vector>
#include "base/strings/string_number_conversions.h"
#include "base/strings/utf_string_conversions.h"
#include "chrome/browser/extensions/api/bookmarks/bookmark_api_constants.h"
#include "chrome/common/extensions/api/bookmarks.h"
#include "components/bookmarks/browser/bookmark_model.h"
#include "components/bookmarks/browser/bookmark_utils.h"
#include "components/bookmarks/managed/managed_bookmark_service.h"
using bookmarks::BookmarkModel;
using bookmarks::BookmarkNode;
namespace extensions {
namespace keys = bookmark_api_constants;
using api::bookmarks::BookmarkTreeNode;
namespace bookmark_api_helpers {
namespace {
void AddNodeHelper(bookmarks::ManagedBookmarkService* managed,
const BookmarkNode* node,
std::vector<BookmarkTreeNode>* nodes,
bool recurse,
bool only_folders) {
if (node->IsVisible())
nodes->push_back(GetBookmarkTreeNode(managed, node, recurse, only_folders));
}
} // namespace
BookmarkTreeNode GetBookmarkTreeNode(bookmarks::ManagedBookmarkService* managed,
const BookmarkNode* node,
bool recurse,
bool only_folders) {
BookmarkTreeNode bookmark_tree_node;
PopulateBookmarkTreeNode(managed, node, recurse, only_folders,
&bookmark_tree_node);
return bookmark_tree_node;
}
void PopulateBookmarkTreeNode(
bookmarks::ManagedBookmarkService* managed,
const bookmarks::BookmarkNode* node,
bool recurse,
bool only_folders,
api::bookmarks::BookmarkTreeNode* out_bookmark_tree_node) {
DCHECK(out_bookmark_tree_node);
out_bookmark_tree_node->id = base::Int64ToString(node->id());
const BookmarkNode* parent = node->parent();
if (parent) {
out_bookmark_tree_node->parent_id.reset(
new std::string(base::Int64ToString(parent->id())));
out_bookmark_tree_node->index.reset(new int(parent->GetIndexOf(node)));
}
if (!node->is_folder()) {
out_bookmark_tree_node->url.reset(new std::string(node->url().spec()));
} else {
// Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds.
base::Time t = node->date_folder_modified();
if (!t.is_null()) {
out_bookmark_tree_node->date_group_modified.reset(
new double(floor(t.ToDoubleT() * 1000)));
}
}
out_bookmark_tree_node->title = base::UTF16ToUTF8(node->GetTitle());
if (!node->date_added().is_null()) {
// Javascript Date wants milliseconds since the epoch, ToDoubleT is seconds.
out_bookmark_tree_node->date_added.reset(
new double(floor(node->date_added().ToDoubleT() * 1000)));
}
if (bookmarks::IsDescendantOf(node, managed->managed_node()) ||
bookmarks::IsDescendantOf(node, managed->supervised_node())) {
out_bookmark_tree_node->unmodifiable =
api::bookmarks::BOOKMARK_TREE_NODE_UNMODIFIABLE_MANAGED;
}
if (recurse && node->is_folder()) {
std::vector<BookmarkTreeNode> children;
for (int i = 0; i < node->child_count(); ++i) {
const BookmarkNode* child = node->GetChild(i);
if (child->IsVisible() && (!only_folders || child->is_folder())) {
children.push_back(
GetBookmarkTreeNode(managed, child, true, only_folders));
}
}
out_bookmark_tree_node->children.reset(
new std::vector<BookmarkTreeNode>(std::move(children)));
}
}
void AddNode(bookmarks::ManagedBookmarkService* managed,
const BookmarkNode* node,
std::vector<BookmarkTreeNode>* nodes,
bool recurse) {
return AddNodeHelper(managed, node, nodes, recurse, false);
}
void AddNodeFoldersOnly(bookmarks::ManagedBookmarkService* managed,
const BookmarkNode* node,
std::vector<BookmarkTreeNode>* nodes,
bool recurse) {
return AddNodeHelper(managed, node, nodes, recurse, true);
}
bool RemoveNode(BookmarkModel* model,
bookmarks::ManagedBookmarkService* managed,
int64_t id,
bool recursive,
std::string* error) {
const BookmarkNode* node = bookmarks::GetBookmarkNodeByID(model, id);
if (!node) {
*error = keys::kNoNodeError;
return false;
}
if (model->is_permanent_node(node)) {
*error = keys::kModifySpecialError;
return false;
}
if (bookmarks::IsDescendantOf(node, managed->managed_node()) ||
bookmarks::IsDescendantOf(node, managed->supervised_node())) {
*error = keys::kModifyManagedError;
return false;
}
if (node->is_folder() && !node->empty() && !recursive) {
*error = keys::kFolderNotEmptyError;
return false;
}
model->Remove(node);
return true;
}
void GetMetaInfo(const BookmarkNode& node,
base::DictionaryValue* id_to_meta_info_map) {
if (!node.IsVisible())
return;
const BookmarkNode::MetaInfoMap* meta_info = node.GetMetaInfoMap();
base::DictionaryValue* value = new base::DictionaryValue();
if (meta_info) {
BookmarkNode::MetaInfoMap::const_iterator itr;
for (itr = meta_info->begin(); itr != meta_info->end(); ++itr) {
value->SetStringWithoutPathExpansion(itr->first, itr->second);
}
}
id_to_meta_info_map->Set(base::Int64ToString(node.id()), value);
if (node.is_folder()) {
for (int i = 0; i < node.child_count(); ++i) {
GetMetaInfo(*(node.GetChild(i)), id_to_meta_info_map);
}
}
}
} // namespace bookmark_api_helpers
} // namespace extensions
|
