| /external/chromium_org/chrome/browser/ |
| chrome_process_finder_win.cc | 122 base::string16 terms; local
123 base::win::MetroLaunchType launch = base::win::GetMetroLaunchParams(&terms);
127 std::string query = EscapeQueryParamValue(UTF16ToUTF8(terms), true);
|
| /external/chromium_org/chrome/browser/first_run/ |
| first_run_internal_win.cc | 126 std::string terms = l10n_util::GetStringUTF8(IDS_TERMS_HTML); local
127 return (!terms.empty() &&
129 file_util::WriteFile(*eula_path, terms.data(), terms.size()) != -1);
|
| /external/chromium_org/chrome/renderer/safe_browsing/ |
| phishing_term_feature_extractor_unittest.cc | 33 base::hash_set<std::string> terms; local
34 terms.insert("one");
35 terms.insert("one one");
36 terms.insert("two");
37 terms.insert("multi word test");
38 terms.insert("capitalization");
39 terms.insert("space");
40 terms.insert("separator");
41 terms.insert("punctuation");
43 terms.insert("\xe4\xbd\xa0\xe5\xa5\xbd")
[all...] |
| /packages/apps/UnifiedEmail/src/com/android/emailcommon/utility/ |
| TextUtilities.java | 507 * Given a string of HTML text and a query containing any number of search terms, returns
508 * an HTML string in which those search terms are highlighted (intended for use in a WebView)
511 * @param query the search terms
512 * @return HTML text with the search terms highlighted
525 * Given a string of plain text and a query containing any number of search terms, returns
526 * a CharSequence in which those search terms are highlighted (intended for use in a TextView)
529 * @param query the search terms
530 * @return a CharSequence with the search terms highlighted
556 * Generate a version of the incoming text in which all search terms in a query are highlighted.
561 * @param query the query, which can contain multiple terms separated by whitespac
574 ArrayList<SearchTerm> terms = new ArrayList<SearchTerm>(); local
[all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| 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 = ExtractQueryWords(node->GetTitle())
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/search_engines/ |
| 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.
|
| 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());
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_index.cc | 21 // represents a set of terms (as an interator into the Index) matching the
22 // query as well as the set of nodes that contain those terms in their titles.
24 // List of terms matching the query.
25 std::list<Index::const_iterator> terms; member in struct:BookmarkIndex::Match
27 // The set of nodes matching the terms. As an optimization this is empty
30 // the set of matching nodes is terms.front()->second.
33 // it handles the necessary switching between nodes and terms.front().
47 return nodes.empty() ? terms.front()->second.begin() : nodes.begin();
51 return nodes.empty() ? terms.front()->second.end() : nodes.end();
64 std::vector<base::string16> terms = ExtractQueryWords(node->GetTitle())
82 std::vector<base::string16> terms = ExtractQueryWords(query); local
250 std::vector<base::string16> terms; local
256 parser.ParseQueryWords(base::i18n::ToLower(query), &terms); local
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| expr.h | 73 int numterms; /**< Number of terms in the expression. */
75 /** Terms of the expression. Structure may be extended to include more
76 * terms, as some operations may allow more than two operand terms
79 yasm_expr__item terms[2]; member in struct:yasm_expr
332 /** Reorder terms of e into canonical order. Only reorders if reordering
335 * Multiple terms of a single type are kept in the same order as in
345 * \param except term index not to copy; -1 to copy all terms
360 /** Transform symrec-symrec terms in expression into #YASM_EXPR_SUBST items.
|
| section.c | 850 /* span terms in absolute portion of value */
851 yasm_span_term *terms; member in struct:yasm_span
898 span->terms = NULL;
934 span->terms = yasm_xrealloc(span->terms,
937 span->terms[subst].precbc = precbc;
938 span->terms[subst].precbc2 = precbc2;
939 span->terms[subst].span = span;
940 span->terms[subst].subst = subst;
945 span->terms[subst].cur_val = 0
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| SemanticContext.java | 609 SemanticContext[] terms = factorOr(a, b); local
610 SemanticContext commonTerms = terms[0];
611 a = terms[1];
612 b = terms[2];
646 SemanticContext[] terms = factorAnd(a, b); local
647 SemanticContext commonTerms = terms[0];
648 a = terms[1];
649 b = terms[2];
|
| /external/chromium/chrome/browser/first_run/ |
| 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/chromium/chrome/browser/history/ |
| 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...] |
| /external/chromium_org/chrome/browser/search_engines/ |
| template_url_unittest.cc | 84 const base::string16 terms; member in struct:SearchTermsCase
104 TemplateURLRef::SearchTermsArgs(value.terms)));
321 const base::string16 terms; member in struct:SearchTermsCase
339 TemplateURLRef::SearchTermsArgs(value.terms), search_terms_data, NULL));
451 // Tests replacing search terms in various encodings and making sure the
696 // Multiple terms should result in empty values.
838 const base::string16 terms(ASCIIToUTF16(terms_str));
[all...] |
| /external/chromium_org/chrome/browser/metrics/ |
| metrics_log.cc | 871 std::vector<base::string16> terms; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
| lp_bld_tgsi_soa.c | 1421 LLVMValueRef terms[TGSI_NUM_CHANNELS]; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| fulltext.c | 1377 Hash terms; \/* maps term string -> PosList *\/ local
1429 Hash terms; local
[all...] |
| fts1.c | 952 short int nPhrase; /* How many following terms are part of the same phrase */
970 * of terms (with an implied AND operator) or phrases in double-quotes,
992 int nTerms; /* Number of terms in the query */
993 QueryTerm *pTerms; /* Array of terms. Space obtained from malloc() */
3154 fts1Hash terms; \/* maps term string -> PosList *\/ local
[all...] |
| /external/libvpx/libvpx/examples/includes/PHP-Markdown-Extra-1.2.3/ |
| markdown.php | 2488 $terms = explode("\\n", trim($matches[1])); variable
[all...] |
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_tgsi_soa.c | 1421 LLVMValueRef terms[TGSI_NUM_CHANNELS]; local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.apache.lucene_1.9.1.v20100518-1140.jar | |
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2.c | 68 ** structures called segments which map terms to doclists. The
135 ** Segment leaf nodes store terms and doclists, ordered by term. Leaf
147 ** (further terms are delta-encoded)
169 ** assumption is that large doclists represent terms which are more
179 ** Segment interior nodes store blockids for subtree nodes and terms
193 ** (further terms are delta-encoded)
203 ** An interior node encodes n terms separating n+1 subtrees. The
205 ** is encoded. The subtree at iBlockid will contain all terms less
206 ** than the first term encoded (or all terms if no term is encoded).
207 ** Otherwise, for terms greater than or equal to pTerm[i] but les
6830 fts2Hash terms; local
[all...] |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /prebuilts/misc/common/antlr/ |
| antlr-3.4-complete.jar | |
