Searched defs:match_positions (Results 1 - 6 of 6) sorted by relevance
/external/chromium/chrome/browser/bookmarks/ |
H A D | bookmark_utils.h | 141 Snippet::MatchPositions match_positions; member in struct:bookmark_utils::TitleMatch
|
/external/chromium/chrome/browser/history/ |
H A D | 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);
|
H A D | 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);
|
H A D | 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 292 DoesQueryMatch(const string16& text, const std::vector<QueryNode*>& query_nodes, Snippet::MatchPositions* match_positions) argument [all...] |
H A D | 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 tha 27 CoalescePositionsFrom(size_t offset, Snippet::MatchPositions* match_positions) argument 42 AddMatch(size_t start, size_t end, Snippet::MatchPositions* match_positions) argument 163 ExtractMatchPositions(const std::string& offsets_str, const std::string& column_num, MatchPositions* match_positions) argument 186 ConvertMatchPositionsToWide( const std::string& utf8_string, Snippet::MatchPositions* match_positions) argument 209 ComputeSnippet(const MatchPositions& match_positions, const std::string& document) argument [all...] |
H A D | text_database.cc | 358 Snippet::MatchPositions match_positions; local 360 &match_positions); 364 match.snippet.ComputeSnippet(match_positions, body);
|
Completed in 77 milliseconds