| /external/chromium/chrome/browser/bookmarks/ |
| H A D | bookmark_index.cc | 20 // represents a set of terms (as an interator into the Index) matching the
21 // query as well as the set of nodes that contain those terms in their titles.
23 // List of terms matching the query.
24 std::list<Index::const_iterator> terms; member in struct:BookmarkIndex::Match
26 // The set of nodes matching the terms. As an optimization this is empty
29 // the set of matching nodes is terms.front()->second.
32 // it handles the necessary switching between nodes and terms.front().
46 return nodes.empty() ? terms.front()->second.begin() : nodes.begin();
50 return nodes.empty() ? terms.front()->second.end() : nodes.end();
62 std::vector<string16> terms
80 std::vector<string16> terms = ExtractQueryWords(query); local
241 std::vector<string16> terms; local
246 parser.ExtractQueryWords(l10n_util::ToLower(query), &terms); local
[all...] |
| /external/chromium/chrome/browser/history/ |
| H A D | in_memory_url_index_unittest.cc | 121 InMemoryURLIndex::String16Vector terms; local
122 terms.push_back(UTF8ToUTF16(term));
123 return terms;
128 InMemoryURLIndex::String16Vector terms; local
129 terms.push_back(UTF8ToUTF16(term_1));
130 terms.push_back(UTF8ToUTF16(term_2));
131 return terms;
188 InMemoryURLIndex::String16Vector terms; local
192 terms.push_back(ASCIIToUTF16("DrudgeReport"));
193 ScoredHistoryMatches matches = url_index_->HistoryItemsForTerms(terms);
248 InMemoryURLIndex::String16Vector terms; local
267 InMemoryURLIndex::String16Vector terms; local
403 InMemoryURLIndex::String16Vector terms; local
481 InMemoryURLIndex::String16Vector terms; local
506 InMemoryURLIndex::String16Vector terms; local
[all...] |
| H A D | in_memory_url_index.cc | 343 const String16Vector& terms) {
345 if (!terms.empty()) {
350 // Lowercase the terms.
353 for (String16Vector::const_iterator term_iter = terms.begin();
354 term_iter != terms.end(); ++term_iter)
405 // Break the terms down into individual terms (words), get the candidate
704 const String16Vector& terms) {
721 for (String16Vector::const_iterator iter = terms.begin(); iter != terms
342 HistoryItemsForTerms( const String16Vector& terms) argument
702 ScoredMatchForURL( const URLRow& row, const String16Vector& terms) argument
[all...] |
| /external/chromium/chrome/browser/search_engines/ |
| H A D | template_url_unittest.cc | 71 const string16 terms; member in struct:SearchTermsCase
90 GURL result = GURL(ref.ReplaceSearchTerms(t_url, value.terms,
181 const string16 terms; member in struct:SearchTermsCase
199 t_url, value.terms,
328 // Tests replacing search terms in various encodings and making sure the
425 // Multiple terms should result in empty values.
|
| H A D | template_url.cc | 24 // The TemplateURLRef has any number of terms that need to be replaced. Each of
25 // the terms is enclosed in braces. If the character preceeding the final
269 const string16& terms,
274 terms,
282 const string16& terms,
293 // Determine if the search terms are in the query or before. We're escaping
309 // If the search terms are in query - escape them respecting the encoding.
311 // Encode the search terms so that we know the encoding.
314 if (EscapeQueryParamValue(terms,
328 encoded_terms = EscapeQueryParamValueUTF8(terms, tru
267 ReplaceSearchTerms( const TemplateURL& host, const string16& terms, int accepted_suggestion, const string16& original_query_for_suggestion) const argument
280 ReplaceSearchTermsUsingTermsData( const TemplateURL& host, const string16& terms, int accepted_suggestion, const string16& original_query_for_suggestion, const SearchTermsData& search_terms_data) const argument
[all...] |
| H A D | template_url_model_unittest.cc | 773 TemplateURLModel::QueryTerms terms; local
775 TemplateURLModel::BuildQueryTerms(GURL(data[i].url), &terms));
782 ASSERT_EQ(keys.size(), terms.size());
785 terms.find(keys[j]);
786 ASSERT_TRUE(term_iterator != terms.end());
|
| /external/chromium/chrome/browser/first_run/ |
| H A D | first_run_win.cc | 155 base::StringPiece terms = local
157 if (terms.empty())
162 bool good = fwrite(terms.data(), terms.size(), 1, file) == 1;
|
| /external/webkit/Source/JavaScriptCore/yarr/ |
| H A D | YarrInterpreter.h | 319 Vector<ByteTerm> terms; member in class:JSC::Yarr::ByteDisjunction
|
| H A D | YarrPattern.cpp | 308 // Create BeginChar objects by appending each terms from a hotTerms vector to an existing BeginChar object.
778 Vector<PatternTerm>& terms = alternatives[i]->m_terms; local
779 if (terms.size()) {
780 PatternTerm& term = terms.last();
817 // This function collects the terms which are potentially matching the first number of depth characters in the result.
900 // If we haven't collected any terms we should abort the preparation of beginning character look-up optimization.
909 // We have just collected PatternCharacter terms, other terms are not allowed.
935 // If the pattern doesn't contain terms with fixed quantifiers then the beginning character look-up optimization is inefficient.
|
| /external/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| H A D | markdown.php | 2454 # Process definition terms.
2457 ( # definition terms = $1
2488 $terms = explode("\n", trim($matches[1])); variable
2490 foreach ($terms as $term) {
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.apache.lucene_1.9.1.v20100518-1140.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| /external/antlr/antlr-3.4/lib/ |
| H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |