Home
last modified time | relevance | path

Searched refs:match (Results 476 - 500 of 4040) sorted by relevance

1...<<11121314151617181920>>...162

/third_party/node/test/parallel/
H A Dtest-snapshot-dns-lookup-localhost-promise.js22 assert.match(stdout, /address: "\d+\.\d+\.\d+\.\d+"/);
23 assert.match(stdout, /family: 4/);
H A Dtest-snapshot-dns-lookup-localhost.js22 assert.match(stdout, /address: "\d+\.\d+\.\d+\.\d+"/);
23 assert.match(stdout, /family: 4/);
/third_party/libphonenumber/java/libphonenumber/src/com/google/i18n/phonenumbers/internal/
H A DRegexBasedMatcher.java26 * proto message to match numbers.
41 // We don't want to consider it a prefix match when matching non-empty input against an empty in matchNationalNumber()
46 return match(number, regexCache.getPatternForRegex(nationalNumberPattern), allowPrefixMatch); in matchNationalNumber()
49 private static boolean match(CharSequence number, Pattern pattern, boolean allowPrefixMatch) { in match() method in RegexBasedMatcher
/third_party/python/Tools/scripts/
H A Dfind-uname.py36 for match in matches:
37 print("%s (%d)" % match)
/build/hb/services/
H A Dhpm.py88 match = re.match(pattern, line)
89 if match:
90 latest_hpm_version = match.group(1).strip()
/test/testfwk/xdevice/plugins/ohos/src/ohos/parser/
H A Doh_kernel_parser.py95 matcher = re.match(pattern, line)
107 matcher = re.match(pattern, line)
122 matcher = re.match(pattern, line)
153 matcher = re.match(pattern, line)
H A Djsunit_parser_lite.py78 (year, re.match(self.pattern, message).group().strip())
80 (year, re.match(self.pattern,
89 _, status_end_index = re.match(pattern, filter_message).span()
156 if re.match(r".*\[suite start\].*", message):
157 _, index = re.match(r".*\[suite start\]", message).span()
/third_party/PyYAML/lib/yaml/
H A Dreader.py139 match = self.NON_PRINTABLE.search(data)
140 if match:
141 character = match.group()
142 position = self.index+(len(self.buffer)-self.pointer)+match.start()
/third_party/jerryscript/tools/
H A Dgen-magic-strings.py122 if_match = re.match('^ *# *if(.*)', line)
123 elif_match = re.match('^ *# *elif(.*)', line)
124 else_match = re.match('^ *# *else', line)
125 endif_match = re.match('^ *# *endif', line)
H A Dsrcmerger.py114 match = SourceMerger._RE_INCLUDE.match(line)
115 if not match:
120 if match.group(1) == '<':
125 name = match.group(2)
/third_party/node/lib/internal/dns/
H A Dutils.js112 const match = RegExpPrototypeExec(IPv6RE, serv);
115 if (match) {
116 ipVersion = isIP(match[1]);
121 return ArrayPrototypePush(newSet, [ipVersion, match[1], port]);
/third_party/node/lib/
H A Dtls.js178 // Empty strings, null, undefined, etc. never match.
211 // containing IDNA A-labels (Punycode) so match those verbatim.
243 // This MUST match the JSON specification (ECMA-404 / RFC8259) exactly.
258 const match = RegExpPrototypeExec(
260 if (!match) {
263 currentToken += JSONParse(match[0]);
264 offset = nextQuote + match[0].length;
/third_party/node/deps/npm/node_modules/spdx-correct/
H A Dindex.js216 var match = /^(.*)-\d+\.\d+$/.exec(id)
217 return match
218 ? [match[0], match[1]]
/third_party/skia/third_party/externals/angle2/src/tests/restricted_traces/
H A Dretrace_restricted_traces.py56 match = re.match(r'.+_context\d_frame(\d+)\.cpp', file)
57 if match:
58 frame = int(match.group(1))
/third_party/toybox/toys/pending/
H A Dmdev.c114 // Regex to match this device in make_device()
118 regex_t match; in make_device() local
123 xregcomp(&match, regex, REG_EXTENDED); in make_device()
124 result=regexec(&match, device_name, 1, &off, 0); in make_device()
125 regfree(&match); in make_device()
/third_party/ffmpeg/libavformat/
H A Davformat.c426 int match = 1; /* Stores if the specifier matches so far. */ in match_stream_specifier() local
431 return match; in match_stream_specifier()
450 match = 0; in match_stream_specifier()
452 match = 0; in match_stream_specifier()
463 if (match) { in match_stream_specifier()
480 match = 0; in match_stream_specifier()
489 return match && (stream_id == st->id); in match_stream_specifier()
495 if (match) { in match_stream_specifier()
514 return match && ret; in match_stream_specifier()
536 return match in match_stream_specifier()
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationIterator.java167 // When a partial match fails, we back out skipped and partial-matching input characters.
169 // We save the trie state before we attempt to match a character,
509 int defaultCE32 = d.getCE32FromContexts(index); // Default if no suffix match. in appendCEsFromCE32()
670 ce32 = d.getCE32FromContexts(index); // Default if no prefix match. in getCE32FromPrefix()
679 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()
680 if(match.hasValue()) { in getCE32FromPrefix()
683 if(!match.hasNext()) { break; } in getCE32FromPrefix()
714 // Number of code points read since the last match (initially only c). in nextCE32FromContraction()
716 // Normally we only need a contiguous match, in nextCE32FromContraction()
721 BytesTrie.Result match in nextCE32FromContraction()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationIterator.java169 // When a partial match fails, we back out skipped and partial-matching input characters.
171 // We save the trie state before we attempt to match a character,
511 int defaultCE32 = d.getCE32FromContexts(index); // Default if no suffix match. in appendCEsFromCE32()
672 ce32 = d.getCE32FromContexts(index); // Default if no prefix match. in getCE32FromPrefix()
681 BytesTrie.Result match = prefixes.nextForCodePoint(c); in getCE32FromPrefix()
682 if(match.hasValue()) { in getCE32FromPrefix()
685 if(!match.hasNext()) { break; } in getCE32FromPrefix()
716 // Number of code points read since the last match (initially only c). in nextCE32FromContraction()
718 // Normally we only need a contiguous match, in nextCE32FromContraction()
723 BytesTrie.Result match in nextCE32FromContraction()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dcollationiterator.cpp140 // When a partial match fails, we back out skipped and partial-matching input characters.
142 // We save the trie state before we attempt to match a character,
307 uint32_t defaultCE32 = CollationData::readCE32(p); // Default if no suffix match. in appendCEsFromCE32()
451 ce32 = CollationData::readCE32(p); // Default if no prefix match. in getCE32FromPrefix()
460 UStringTrieResult match = prefixes.nextForCodePoint(c); in getCE32FromPrefix() local
461 if(USTRINGTRIE_HAS_VALUE(match)) { in getCE32FromPrefix()
464 if(!USTRINGTRIE_HAS_NEXT(match)) { break; } in getCE32FromPrefix()
498 // Number of code points read since the last match (initially only c). in nextCE32FromContraction()
500 // Normally we only need a contiguous match, in nextCE32FromContraction()
505 UStringTrieResult match in nextCE32FromContraction() local
630 UStringTrieResult match; nextCE32FromDiscontiguousContraction() local
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationiterator.cpp140 // When a partial match fails, we back out skipped and partial-matching input characters.
142 // We save the trie state before we attempt to match a character,
307 uint32_t defaultCE32 = CollationData::readCE32(p); // Default if no suffix match. in appendCEsFromCE32()
451 ce32 = CollationData::readCE32(p); // Default if no prefix match. in getCE32FromPrefix()
460 UStringTrieResult match = prefixes.nextForCodePoint(c); in getCE32FromPrefix() local
461 if(USTRINGTRIE_HAS_VALUE(match)) { in getCE32FromPrefix()
464 if(!USTRINGTRIE_HAS_NEXT(match)) { break; } in getCE32FromPrefix()
498 // Number of code points read since the last match (initially only c). in nextCE32FromContraction()
500 // Normally we only need a contiguous match, in nextCE32FromContraction()
505 UStringTrieResult match in nextCE32FromContraction() local
630 UStringTrieResult match; nextCE32FromDiscontiguousContraction() local
[all...]
/third_party/libwebsockets/lib/roles/cgi/
H A Dcgi-server.c672 wsi->http.cgi->match[n] = 0; in lws_cgi_write_split_stdout_headers()
700 wsi->http.cgi->match[1], wsi->hdr_state); in lws_cgi_write_split_stdout_headers()
711 if (!significant_hdr[n][wsi->http.cgi->match[n]] && in lws_cgi_write_split_stdout_headers()
732 if (significant_hdr[n][wsi->http.cgi->match[n]]) { in lws_cgi_write_split_stdout_headers()
734 significant_hdr[n][wsi->http.cgi->match[n]]) in lws_cgi_write_split_stdout_headers()
735 wsi->http.cgi->match[n]++; in lws_cgi_write_split_stdout_headers()
737 wsi->http.cgi->match[n] = 0; in lws_cgi_write_split_stdout_headers()
752 [wsi->http.cgi->match[ in lws_cgi_write_split_stdout_headers()
761 wsi->http.cgi->match[SIGNIFICANT_HDR_LOCATION]]) { in lws_cgi_write_split_stdout_headers()
785 wsi->http.cgi->match[ in lws_cgi_write_split_stdout_headers()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationiterator.cpp140 // When a partial match fails, we back out skipped and partial-matching input characters.
142 // We save the trie state before we attempt to match a character,
307 uint32_t defaultCE32 = CollationData::readCE32(p); // Default if no suffix match. in appendCEsFromCE32()
451 ce32 = CollationData::readCE32(p); // Default if no prefix match. in getCE32FromPrefix()
460 UStringTrieResult match = prefixes.nextForCodePoint(c); in getCE32FromPrefix() local
461 if(USTRINGTRIE_HAS_VALUE(match)) { in getCE32FromPrefix()
464 if(!USTRINGTRIE_HAS_NEXT(match)) { break; } in getCE32FromPrefix()
498 // Number of code points read since the last match (initially only c). in nextCE32FromContraction()
500 // Normally we only need a contiguous match, in nextCE32FromContraction()
505 UStringTrieResult match in nextCE32FromContraction() local
630 UStringTrieResult match; nextCE32FromDiscontiguousContraction() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp230 "The vector size must match the number of matrix elements"); in getMatrix()
234 // information. If there is a mis-match, embed the result in a flat in getMatrix()
300 /// instructions must match the instructions that can be lowered by this pass.
343 if (match(Inst, m_Intrinsic<Intrinsic::matrix_multiply>( in propagateShapeForward()
347 } else if (match(Inst, m_Intrinsic<Intrinsic::matrix_transpose>( in propagateShapeForward()
351 } else if (match(Inst, m_Intrinsic<Intrinsic::matrix_columnwise_store>( in propagateShapeForward()
355 } else if (match(Inst, in propagateShapeForward()
359 } else if (match(Inst, m_Store(m_Value(MatrixA), m_Value()))) { in propagateShapeForward()
415 if (match(V, m_Intrinsic<Intrinsic::matrix_multiply>( in propagateShapeBackward()
424 } else if (match( in propagateShapeBackward()
[all...]
/third_party/python/Lib/lib2to3/tests/
H A Dtest_pytree.py375 self.assertFalse(pl.match(root, results=r))
377 self.assertFalse(pl.match(n1, results=r))
379 self.assertFalse(pl.match(n2, results=r))
381 self.assertTrue(pl.match(l1, results=r))
384 self.assertFalse(pl.match(l2, results=r))
388 self.assertFalse(pn.match(root, results=r))
390 self.assertFalse(pn.match(n1, results=r))
392 self.assertTrue(pn.match(n2, results=r))
395 self.assertFalse(pn.match(l1, results=r))
397 self.assertFalse(pn.match(l
[all...]
/third_party/astc-encoder/Test/
H A Dastc_test_result_plot.py57 match = filePat.match(name)
58 if match:
61 encoder = match.group(1)
62 quality = match.group(2)

Completed in 17 milliseconds

1...<<11121314151617181920>>...162