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
|
// Copyright (c) 2010 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.
#ifndef CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_
#define CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_
#include <map>
#include <set>
#include <vector>
#include "base/basictypes.h"
#include "base/string16.h"
class BookmarkNode;
class Profile;
class QueryNode;
class QueryParser;
namespace bookmark_utils {
struct TitleMatch;
}
namespace history {
class URLDatabase;
}
// BookmarkIndex maintains an index of the titles of bookmarks for quick
// look up. BookmarkIndex is owned and maintained by BookmarkModel, you
// shouldn't need to interact directly with BookmarkIndex.
//
// BookmarkIndex maintains the index (index_) as a map of sets. The map (type
// Index) maps from a lower case string to the set (type NodeSet) of
// BookmarkNodes that contain that string in their title.
class BookmarkIndex {
public:
explicit BookmarkIndex(Profile* profile);
~BookmarkIndex();
// Invoked when a bookmark has been added to the model.
void Add(const BookmarkNode* node);
// Invoked when a bookmark has been removed from the model.
void Remove(const BookmarkNode* node);
// Returns up to |max_count| of bookmarks containing the text |query|.
void GetBookmarksWithTitlesMatching(
const string16& query,
size_t max_count,
std::vector<bookmark_utils::TitleMatch>* results);
private:
typedef std::set<const BookmarkNode*> NodeSet;
typedef std::map<string16, NodeSet> Index;
struct Match;
typedef std::vector<Match> Matches;
// Pairs BookmarkNodes and the number of times the nodes' URLs were typed.
// Used to sort Matches in decreasing order of typed count.
typedef std::pair<const BookmarkNode*, int> NodeTypedCountPair;
typedef std::vector<NodeTypedCountPair> NodeTypedCountPairs;
// Extracts |matches.nodes| into NodeTypedCountPairs, sorts the pairs in
// decreasing order of typed count, and then de-dupes the matches.
void SortMatches(const Matches& matches,
NodeTypedCountPairs* node_typed_counts) const;
// Extracts BookmarkNodes from |match| and retrieves typed counts for each
// node from the in-memory database. Inserts pairs containing the node and
// typed count into the vector |node_typed_counts|. |node_typed_counts| is
// sorted in decreasing order of typed count.
void ExtractBookmarkNodePairs(history::URLDatabase* url_db,
const Match& match,
NodeTypedCountPairs* node_typed_counts) const;
// Sort function for NodeTypedCountPairs. We sort in decreasing order of typed
// count so that the best matches will always be added to the results.
static bool NodeTypedCountPairSortFunc(const NodeTypedCountPair& a,
const NodeTypedCountPair& b) {
return a.second > b.second;
}
// Add |node| to |results| if the node matches the query.
void AddMatchToResults(const BookmarkNode* node,
QueryParser* parser,
const std::vector<QueryNode*>& query_nodes,
std::vector<bookmark_utils::TitleMatch>* results);
// Populates |matches| for the specified term. If |first_term| is true, this
// is the first term in the query. Returns true if there is at least one node
// matching the term.
bool GetBookmarksWithTitleMatchingTerm(const string16& term,
bool first_term,
Matches* matches);
// Iterates over |matches| updating each Match's nodes to contain the
// intersection of the Match's current nodes and the nodes at |index_i|.
// If the intersection is empty, the Match is removed.
//
// This is invoked from GetBookmarksWithTitleMatchingTerm.
void CombineMatchesInPlace(const Index::const_iterator& index_i,
Matches* matches);
// Iterates over |current_matches| calculating the intersection between the
// Match's nodes and the nodes at |index_i|. If the intersection between the
// two is non-empty, a new match is added to |result|.
//
// This differs from CombineMatchesInPlace in that if the intersection is
// non-empty the result is added to result, not combined in place. This
// variant is used for prefix matching.
//
// This is invoked from GetBookmarksWithTitleMatchingTerm.
void CombineMatches(const Index::const_iterator& index_i,
const Matches& current_matches,
Matches* result);
// Returns the set of query words from |query|.
std::vector<string16> ExtractQueryWords(const string16& query);
// Adds |node| to |index_|.
void RegisterNode(const string16& term, const BookmarkNode* node);
// Removes |node| from |index_|.
void UnregisterNode(const string16& term, const BookmarkNode* node);
Index index_;
Profile* profile_;
DISALLOW_COPY_AND_ASSIGN(BookmarkIndex);
};
#endif // CHROME_BROWSER_BOOKMARKS_BOOKMARK_INDEX_H_
|
