| /external/chromium/chrome/browser/history/ |
| snippet.cc | 25 // Combines all pairs after offset in match_positions that are contained
28 Snippet::MatchPositions* match_positions) {
29 DCHECK(offset < match_positions->size());
30 Snippet::MatchPosition& pair((*match_positions)[offset]);
32 while (offset < match_positions->size() &&
33 pair.second >= (*match_positions)[offset].first) {
34 pair.second = std::max(pair.second, (*match_positions)[offset].second);
35 match_positions->erase(match_positions->begin() + offset);
39 // Makes sure there is a pair in match_positions that contains the specifie
[all...] |
| snippet.h | 31 // column_num to match_positions. The pairs are ordered based on first,
38 MatchPositions* match_positions);
44 Snippet::MatchPositions* match_positions);
|
| snippet_unittest.cc | 103 // Manually construct match_positions of the document.
104 Snippet::MatchPositions match_positions; local
105 match_positions.clear();
111 match_positions.push_back(std::make_pair(ofs, ofs + qw->size()));
115 // Sort match_positions in order of increasing offset.
116 std::sort(match_positions.begin(), match_positions.end(), ComparePair1st);
120 snippet.ComputeSnippet(match_positions, document);
|
| query_parser.h | 48 // the node matches at least one word, an entry is added to match_positions
51 Snippet::MatchPositions* match_positions) const = 0;
92 // the text is added to |match_positions|.
95 Snippet::MatchPositions* match_positions);
|
| query_parser_unittest.cc | 119 Snippet::MatchPositions match_positions; local
123 &match_positions));
126 ASSERT_TRUE(match_positions.size() >= 1);
127 EXPECT_EQ(data[i].m1_start, match_positions[0].first);
128 EXPECT_EQ(data[i].m1_end, match_positions[0].second);
132 ASSERT_TRUE(match_positions.size() == 1 + offset);
133 EXPECT_EQ(data[i].m2_start, match_positions[offset].first);
134 EXPECT_EQ(data[i].m2_end, match_positions[offset].second);
|
| query_parser.cc | 80 Snippet::MatchPositions* match_positions) const;
91 Snippet::MatchPositions* match_positions) const {
95 match_positions->push_back(
149 Snippet::MatchPositions* match_positions) const {
210 Snippet::MatchPositions* match_positions) const;
220 Snippet::MatchPositions* match_positions) const {
234 match_positions->push_back(
294 Snippet::MatchPositions* match_positions) {
315 match_positions->clear();
318 match_positions->swap(matches)
[all...] |
| text_database.cc | 358 Snippet::MatchPositions match_positions; local
360 &match_positions);
364 match.snippet.ComputeSnippet(match_positions, body);
|
| /external/chromium_org/chrome/browser/history/ |
| snippet.cc | 25 // Combines all pairs after offset in match_positions that are contained
28 Snippet::MatchPositions* match_positions) {
29 DCHECK(offset < match_positions->size());
30 Snippet::MatchPosition& pair((*match_positions)[offset]);
32 while (offset < match_positions->size() &&
33 pair.second >= (*match_positions)[offset].first) {
34 pair.second = std::max(pair.second, (*match_positions)[offset].second);
35 match_positions->erase(match_positions->begin() + offset);
39 // Makes sure there is a pair in match_positions that contains the specifie
[all...] |
| snippet.h | 30 // column_num to match_positions. The pairs are ordered based on first,
37 MatchPositions* match_positions);
43 Snippet::MatchPositions* match_positions);
|
| snippet_unittest.cc | 103 // Manually construct match_positions of the document.
104 Snippet::MatchPositions match_positions; local
105 match_positions.clear();
111 match_positions.push_back(std::make_pair(ofs, ofs + qw->size()));
115 // Sort match_positions in order of increasing offset.
116 std::sort(match_positions.begin(), match_positions.end(), ComparePair1st);
120 snippet.ComputeSnippet(match_positions, document);
|
| query_parser_unittest.cc | 121 Snippet::MatchPositions match_positions; local
125 &match_positions));
128 ASSERT_TRUE(match_positions.size() >= 1);
129 EXPECT_EQ(data[i].m1_start, match_positions[0].first);
130 EXPECT_EQ(data[i].m1_end, match_positions[0].second);
134 ASSERT_TRUE(match_positions.size() == 1 + offset);
135 EXPECT_EQ(data[i].m2_start, match_positions[offset].first);
136 EXPECT_EQ(data[i].m2_end, match_positions[offset].second);
|
| query_parser.h | 44 // entry is added to |match_positions| for all matching words giving the
47 Snippet::MatchPositions* match_positions) const = 0;
88 // the text is added to |match_positions|.
91 Snippet::MatchPositions* match_positions);
|
| query_parser.cc | 91 Snippet::MatchPositions* match_positions) const OVERRIDE;
130 Snippet::MatchPositions* match_positions) const {
135 match_positions->push_back(
177 Snippet::MatchPositions* match_positions) const OVERRIDE;
230 Snippet::MatchPositions* match_positions) const {
266 Snippet::MatchPositions* match_positions) const OVERRIDE;
313 Snippet::MatchPositions* match_positions) const {
318 match_positions->push_back(
370 Snippet::MatchPositions* match_positions) {
391 match_positions->clear()
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_title_match.h | 28 MatchPositions match_positions; member in struct:BookmarkTitleMatch
|
| bookmark_index_unittest.cc | 95 ASSERT_EQ(expected_positions.size(), match.match_positions.size());
97 EXPECT_EQ(expected_positions[i].first, match.match_positions[i].first);
98 EXPECT_EQ(expected_positions[i].second, match.match_positions[i].second);
230 EXPECT_TRUE(matches[0].match_positions.empty());
|
| bookmark_index.cc | 160 &(title_match.match_positions))) {
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_index_unittest.cc | 92 ASSERT_EQ(expected_positions.size(), match.match_positions.size());
94 EXPECT_EQ(expected_positions[i].first, match.match_positions[i].first);
95 EXPECT_EQ(expected_positions[i].second, match.match_positions[i].second);
219 EXPECT_TRUE(matches[0].match_positions.empty());
|
| bookmark_utils.h | 141 Snippet::MatchPositions match_positions; member in struct:bookmark_utils::TitleMatch
|
| bookmark_index.cc | 152 &(title_match.match_positions))) {
|
| /external/chromium_org/chrome/browser/autocomplete/ |
| bookmark_provider.cc | 180 ClassificationsFromMatch(title_match.match_positions,
232 for_each(title_match.match_positions.begin(),
233 title_match.match_positions.end(), ScoringFunctor(title.size()));
|
| /external/chromium/chrome/browser/autocomplete/ |
| history_contents_provider.cc | 284 history::URLResult url_result(match.node->GetURL(), match.match_positions);
|
