Lines Matching refs:bookmark
45 // Bookmark comparer for map of bookmark nodes.
67 // Provides the following abstraction: given a parent bookmark node, find best
71 // Creates an instance with the given parent bookmark node.
97 // Create a bookmark node from the given sync node.
116 // Helper class to build an index of bookmark nodes by their IDs.
122 // Adds the given bookmark node and all its descendants to the ID index.
126 // Finds the bookmark node with the given ID.
263 bool BookmarkModelAssociator::NodesMatch(const BookmarkNode* bookmark,
265 if (bookmark->GetTitle() != WideToUTF16Hack(sync_node->GetTitle()))
267 if (bookmark->is_folder() != sync_node->GetIsFolder())
269 if (bookmark->is_url()) {
270 if (bookmark->GetURL() != sync_node->GetURL())
275 // its favicon shouldn't result in a bookmark mismatch.
319 // matching bookmark node under the corresponding bookmark parent node.
320 // If no matching node is found, create a new bookmark node in the same
324 // * When all children sync nodes are done, add the extra children bookmark
335 // To prime our association, we associate the top-level nodes, Bookmark Bar
390 // Set the favicon for bookmark node from sync node or vice versa.
397 // Create a new bookmark node for the sync node.
410 // corresponding children in the parent bookmark node and they are all in
412 // So the children starting from index in the parent bookmark node are the
456 "Could not lookup bookmark node for ID persistence.");
490 // Build a bookmark node ID index since we are going to repeatedly search for
491 // bookmark nodes by their IDs.
503 // with the total number of nodes in the bookmark model.
522 // Don't try to call NodesMatch on permanent nodes like bookmark bar and
544 // It's possible that the number of nodes in the bookmark model is not the
