HomeSort by relevance Sort by last modified time
    Searched refs:match (Results 301 - 325 of 2257) sorted by null

<<11121314151617181920>>

  /external/nist-sip/java/gov/nist/javax/sip/parser/ims/
PUserDatabaseParser.java 77 this.lexer.match(TokenTypes.P_USER_DATABASE);
79 this.lexer.match(':');
96 this.lexer.match(LESS_THAN);
PathParser.java 78 this.lexer.match(TokenTypes.PATH);
80 this.lexer.match(':');
89 this.lexer.match(',');
ServiceRouteParser.java 78 this.lexer.match(TokenTypes.SERVICE_ROUTE);
80 this.lexer.match(':');
88 this.lexer.match(',');
SecurityAgreeParser.java 99 lexer.match(TokenTypes.ID);
111 this.lexer.match(';');
135 this.lexer.match(',');
138 lexer.match(TokenTypes.ID);
146 this.lexer.match(';');
  /external/oprofile/libregex/
op_regex.cpp 4 * libc regex, providing regular expression match and replace facility.
46 bool op_regexec(regex_t const & regex, string const & str, regmatch_t * match,
49 return regexec(&regex, str.c_str(), nmatch, match, 0) != REG_NOMATCH;
192 regmatch_t match[max_match]; local
194 op_regexec(regexp.regexp, str, match, max_match) && iter < limit;
197 do_replace(str, regexp.replace, match);
205 regular_expression_replace::get_match(regmatch_t const * match, char idx) const
212 return match[sub_expr];
216 (string & str, string const & replace, regmatch_t const * match) const
229 regmatch_t const & matched = get_match(match,
    [all...]
  /external/chromium_org/chrome/browser/autocomplete/
shortcuts_backend_unittest.cc 87 AutocompleteMatch match(NULL, 0, 0, type);
88 match.destination_url = GURL(url);
89 match.contents = base::ASCIIToUTF16("test");
90 match.contents_class =
92 match.description_class =
94 match.search_terms_args.reset(
95 new TemplateURLRef::SearchTermsArgs(match.contents));
96 return ShortcutsBackend::MatchToMatchCore(match, &profile_);
174 // Verifies that creating MatchCores strips classifications and sanitizes match
222 AutocompleteMatch match; local
    [all...]
zero_suggest_provider.cc 67 // The maximum relevance of the top match from this provider.
153 // url match relevance.
160 void ZeroSuggestProvider::DeleteMatch(const AutocompleteMatch& match) {
162 // Remove the deleted match from the cache, so it is not shown to the user
167 BaseSearchProvider::DeleteMatch(match);
286 AutocompleteMatch match(this, navigation.relevance(), false,
288 match.destination_url = navigation.url();
293 match.contents = net::FormatUrl(navigation.url(), languages,
295 match.fill_into_edit +=
297 match.contents, ChromeAutocompleteSchemeClassifier(profile_))
408 AutocompleteMatch match; local
    [all...]
  /external/chromium_org/components/omnibox/
keyword_provider.cc 195 // A verbatim match is allowed to be the default match.
276 // Any exact match is going to be the highest quality match, and thus at the
283 // Only create an exact match if |remaining_input| is empty or if
287 // then SearchProvider creates the exact (a.k.a. verbatim) match.
294 // When creating an exact match (either for the keyword itself, no
296 // input), allow the match to be the default match.
387 AutocompleteMatch match(this, relevance, false
    [all...]
autocomplete_result.cc 33 // Returns the relevance score of |match| demoted appropriately by
35 int GetDemotedRelevance(const AutocompleteMatch& match);
52 const AutocompleteMatch& match) {
54 demotions_.find(match.type);
56 match.relevance : (match.relevance * demotion_it->second);
61 // Compute demoted relevance scores for each match.
100 // Returns true if |match| is allowed to the default match taking into account
104 const AutocompleteMatch& match,
459 AutocompleteMatch match = *i; local
    [all...]
  /external/opencv/cvaux/src/
cvbgfg_gaussmix.cpp 77 Return -1 if no match was found; otherwise the index in match[] is returned
82 static int icvMatchTest( double* src_pixel, int nChannels, int* match,
84 /*static int icvMatchTest2( double* src_pixel, int nChannels, int* match,
95 int* match,
99 int* match,
102 static void icvUpdatePartialWindow( double* src_pixel, int nChannels, int* match,
105 int* match,
112 static void icvBackgroundTest( const int nChannels, int n, int i, int j, int *match, CvGaussBGModel* bg_model );
127 //If there is no match the last gaussian in the list is replaced by the new gaussia
283 int match[CV_BGFG_MOG_MAX_NGAUSSIANS]; local
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/template/
group-file-parser.rb 258 match( T__10, TOKENS_FOLLOWING_T__10_IN_group_name_128 )
276 mod = match( CONSTANT, TOKENS_FOLLOWING_CONSTANT_IN_group_name_144 )
277 match( T__11, TOKENS_FOLLOWING_T__11_IN_group_name_146 )
286 name = match( CONSTANT, TOKENS_FOLLOWING_CONSTANT_IN_group_name_169 )
300 match( T__12, TOKENS_FOLLOWING_T__12_IN_group_name_177 )
337 name = match( ID, TOKENS_FOLLOWING_ID_IN_member_199 )
356 match( T__13, TOKENS_FOLLOWING_T__13_IN_member_210 )
369 aliased = match( ID, TOKENS_FOLLOWING_ID_IN_member_220 )
376 __TEMPLATE3__ = match( TEMPLATE, TOKENS_FOLLOWING_TEMPLATE_IN_member_230 )
383 __STRING4__ = match( STRING, TOKENS_FOLLOWING_STRING_IN_member_242
    [all...]
  /external/chromium_org/components/bookmarks/browser/
bookmark_index.cc 65 // Used when finding the set of bookmarks that match a query. Each match
68 struct BookmarkIndex::Match {
73 // when we match only one term, and is filled in when we get more than one
91 BookmarkIndex::Match::nodes_begin() const {
95 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const {
153 // We use a QueryParser to fill in match positions for us. It's not the most
208 // ["thi"] will match the bookmark titled [Thinking], but since
209 // ["thi"] is quoted we don't want to do a prefix match.
229 BookmarkMatch match; local
262 Match match; local
274 Match match; local
297 Match* match = &((*matches)[i]); local
316 const Match& match = current_matches[i]; local
    [all...]
  /external/chromium_org/courgette/
disassembler_elf_32_x86.cc 76 // so we check, and just don't do it if we don't match up.
82 bool match = true; local
95 match = false;
99 while (match && (reloc_iter != abs32_locations_.end())) {
102 match = false;
107 if (match) {
  /external/chromium_org/tools/grit/grit/format/
android_xml.py 145 match = _NAME_PATTERN.match(mangled_name)
146 if not match:
148 name = match.group('name').lower()
149 product = match.group('product')
  /external/chromium_org/tools/valgrind/
gdb_helper.py 16 match = GDB_LINE_RE.match(output_line)
17 if match:
18 return match.groups()[1], match.groups()[0]
  /external/iproute2/include/
iptables.h 31 struct iptables_match *match; member in struct:iptables_rule_match
41 /* Revision of match (0 by default). */
46 /* Size of match data. */
49 /* Size of match data relevent for userspace comparison purposes */
55 /* Initialize the match. */
63 struct ipt_entry_match **match);
68 /* Prints out the match iff non-NULL: put space at end */
70 const struct ipt_entry_match *match, int numeric);
72 /* Saves the match info in parsable form to stdout. */
74 const struct ipt_entry_match *match);
    [all...]
  /external/chromium_org/net/cert/
x509_cert_types_mac.cc 168 bool match(const std::string& str, const std::string& against) { function in namespace:net::__anon13730
174 bool match(const std::vector<std::string>& rdn1, function in namespace:net::__anon13730
176 // "Two relative distinguished names RDN1 and RDN2 match if they have the
184 if (match(rdn1[i1], rdn2[i2]))
282 return match(common_name, against.common_name) &&
283 match(locality_name, against.locality_name) &&
284 match(state_or_province_name, against.state_or_province_name) &&
285 match(country_name, against.country_name) &&
286 match(street_addresses, against.street_addresses) &&
287 match(organization_names, against.organization_names) &
    [all...]
  /external/chromium_org/third_party/skia/experimental/Intersection/
CubicParameterizationCode.cpp 194 static void match(const char* str, size_t len, coeffs& co, const char pattern[]) { function
257 match(str, len, c[xxx_coeff], "x^3"); // 1 factor
258 match(str, len, c[xxy_coeff], "x^2 y"); // 1 factor
259 match(str, len, c[xyy_coeff], "x y^2"); // 1 factor
260 match(str, len, c[yyy_coeff], "y^3"); // 1 factor
261 match(str, len, c[xx_coeff], "x^2"); // 7 factors
262 match(str, len, c[xy_coeff], "x y"); // 8 factors
263 match(str, len, c[yy_coeff], "y^2"); // 7 factors
264 match(str, len, c[x_coeff], "x"); // 21 factors
265 match(str, len, c[y_coeff], "y"); // 21 factor
    [all...]
  /external/chromium_org/v8/test/mjsunit/
regexp-global.js 31 str = str.replace(/(\w)?X/g, function(match, capture) {
32 assertTrue(match.indexOf(capture) >= 0 ||
40 str = str.replace(/\b/g, function(match, capture) {
47 str = str.replace(/(?=(\w+))\b/g, function(match, capture) {
55 function(match, c1, c2, c3) {
68 function(match, num_legs, likeability) {
73 return match.length - 10;
83 function(match, capture) {
84 assertTrue(match.indexOf(capture) >= 0 ||
92 str = str.replace(/\b/g, function(match, capture)
    [all...]
  /external/iptables/extensions/
libxt_bpf.c 29 "bpf match options:\n"
95 static void bpf_print_code(const void *ip, const struct xt_entry_match *match)
97 const struct xt_bpf_info *info = (void *) match->data;
112 static void bpf_save(const void *ip, const struct xt_entry_match *match)
114 const struct xt_bpf_info *info = (void *) match->data;
117 bpf_print_code(ip, match);
128 static void bpf_print(const void *ip, const struct xt_entry_match *match,
131 printf("match bpf ");
132 return bpf_print_code(ip, match);
  /external/chromium_org/third_party/WebKit/Source/core/html/track/vtt/
VTTScannerTest.cpp 62 EXPECT_TRUE(scanner.match('f'));
63 EXPECT_FALSE(scanner.match('o'));
66 EXPECT_FALSE(scanner.match('f'));
67 EXPECT_TRUE(scanner.match('o'));
73 EXPECT_FALSE(scanner.match('e'));
91 // Exercises match(c) and scan(c).
130 EXPECT_TRUE(scanner.match('b'));
133 EXPECT_TRUE(scanner.match('A'));
162 EXPECT_TRUE(scanner.match('B'));
165 EXPECT_TRUE(scanner.match('a'))
    [all...]
  /external/iproute2/examples/diffserv/
Edge31-ca-u32 54 match ip tos 0x88 0xfc \
63 match ip tos 0x88 0xfc \
71 match ip tos 0x88 0xfc \
83 match ip tos 0x90 0xfc \
91 match ip tos 0x90 0xfc \
102 match ip tos 0x98 0xfc \
114 match ip src 0/0\
Edge32-cb-u32 56 match ip src 10.2.0.0/24 $meter1 \
59 match ip src 10.2.0.0/24 $meter1a \
67 match ip src 10.2.0.0/24 $meter2 \
70 match ip src 10.2.0.0/24 $meter2a \
77 match ip src 10.2.0.0/24 $meter3 \
80 match ip src 10.2.0.0/24 $meter3a \
88 match ip src 0/0 $meter5 \
  /external/chromium_org/chrome/browser/android/omnibox/
autocomplete_controller_android.cc 177 // populating the verbatim match.
242 const AutocompleteMatch& match = result.match_at(selected_index); local
243 if (match.SupportsDeletion())
244 autocomplete_controller_->DeleteMatch(match);
258 AutocompleteMatch match(
262 &match); local
263 return ConvertUTF8ToJavaString(env, match.destination_url.spec());
342 // If the default match should be prefetched, do that.
436 const AutocompleteMatch& match) {
438 ConvertUTF16ToJavaString(env, match.contents)
    [all...]
  /external/llvm/utils/vim/
llvm.vim 12 syn case match
20 syn match llvmType /\<i\d\+\>/
65 syn match llvmNoName /[%@]\d\+\>/
66 syn match llvmNumber /-\?\<\d\+\>/
67 syn match llvmFloat /-\?\<\d\+\.\d*\(e[+-]\d\+\)\?\>/
68 syn match llvmFloat /\<0x\x\+\>/
71 syn match llvmComment /;.*$/
73 syn match llvmLabel /[-a-zA-Z$._][-a-zA-Z$._0-9]*:/
74 syn match llvmIdentifier /[%@][-a-zA-Z$._][-a-zA-Z$._0-9]*/
77 syn match llvmSpecialComment /;\s*RUN:.*$
    [all...]

Completed in 1223 milliseconds

<<11121314151617181920>>