Searched defs:match_positions (Results 1 - 13 of 13) sorted by relevance

/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_utils.h141 Snippet::MatchPositions match_positions; member in struct:bookmark_utils::TitleMatch
/external/chromium_org/chrome/browser/bookmarks/
H A Dbookmark_title_match.h28 MatchPositions match_positions; member in struct:BookmarkTitleMatch
/external/chromium/chrome/browser/history/
H A Dquery_parser_unittest.cc119 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 Dsnippet_unittest.cc103 // 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 Dquery_parser.cc80 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 Dsnippet.cc25 // 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 Dtext_database.cc358 Snippet::MatchPositions match_positions; local
360 &match_positions);
364 match.snippet.ComputeSnippet(match_positions, body);
/external/chromium_org/chrome/browser/history/
H A Dquery_parser_unittest.cc121 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);
H A Dsnippet_unittest.cc103 // 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 Dsnippet.cc25 // 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 Dquery_parser.cc91 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(
371 Snippet::MatchPositions* match_positions) {
392 match_positions
369 DoesQueryMatch(const base::string16& text, const std::vector<QueryNode*>& query_nodes, Snippet::MatchPositions* match_positions) argument
[all...]
/external/chromium_org/third_party/harfbuzz-ng/src/
H A Dhb-ot-layout-gsub-table.hh633 unsigned int match_positions[MAX_CONTEXT_LENGTH]; local
640 match_positions,
647 match_positions,
H A Dhb-ot-layout-gsubgpos-private.hh717 unsigned int match_positions[MAX_CONTEXT_LENGTH],
757 match_positions[0] = buffer->idx;
762 match_positions[i] = skippy_iter.idx;
797 unsigned int match_positions[MAX_CONTEXT_LENGTH], /* Including the first glyph */
856 while (buffer->idx < match_positions[i])
955 unsigned int match_positions[MAX_CONTEXT_LENGTH], /* Including the first glyph */
974 match_positions[j] += delta;
983 buffer->move_to (match_positions[idx]);
998 end = MAX ((int) match_positions[idx] + 1, int (end) + delta);
1015 memmove (match_positions
711 match_input(hb_apply_context_t *c, unsigned int count, const USHORT input[], match_func_t match_func, const void *match_data, unsigned int *end_offset, unsigned int match_positions[MAX_CONTEXT_LENGTH], bool *p_is_mark_ligature = NULL, unsigned int *p_total_component_count = NULL) argument
795 ligate_input(hb_apply_context_t *c, unsigned int count, unsigned int match_positions[MAX_CONTEXT_LENGTH], unsigned int match_length, hb_codepoint_t lig_glyph, bool is_mark_ligature, unsigned int total_component_count) argument
953 apply_lookup(hb_apply_context_t *c, unsigned int count, unsigned int match_positions[MAX_CONTEXT_LENGTH], unsigned int lookupCount, const LookupRecord lookupRecord[], unsigned int match_length) argument
1103 unsigned int match_positions[MAX_CONTEXT_LENGTH]; local
1634 unsigned int match_positions[MAX_CONTEXT_LENGTH]; local
[all...]

Completed in 1729 milliseconds