Home
last modified time | relevance | path

Searched refs:re (Results 1 – 25 of 4898) sorted by relevance

12345678910>>...196

/external/python/cpython2/Lib/test/
Dtest_re.py8 import re
9 from re import Scanner
29 x = re.compile('ab+c')
34 self.assertEqual(re.search('x*', 'axx').span(0), (0, 0))
35 self.assertEqual(re.search('x*', 'axx').span(), (0, 0))
36 self.assertEqual(re.search('x+', 'axx').span(0), (1, 3))
37 self.assertEqual(re.search('x+', 'axx').span(), (1, 3))
38 self.assertIsNone(re.search('x', 'aaa'))
39 self.assertEqual(re.match('a*', 'xxx').span(0), (0, 0))
40 self.assertEqual(re.match('a*', 'xxx').span(), (0, 0))
[all …]
/external/python/cpython3/Lib/test/
Dtest_re.py4 import re
9 from re import Scanner
39 with self.assertRaises(re.error) as cm:
40 re.compile(pattern)
48 with self.assertRaises(re.error) as cm:
49 re.sub(pattern, repl, string)
59 it = re.finditer(b'a', b)
69 x = re.compile('ab+c')
74 self.assertEqual(re.search('x*', 'axx').span(0), (0, 0))
75 self.assertEqual(re.search('x*', 'axx').span(), (0, 0))
[all …]
/external/adhd/cras/src/server/
Drate_estimator.c35 void rate_estimator_destroy(struct rate_estimator *re) in rate_estimator_destroy() argument
37 if (re) in rate_estimator_destroy()
38 free(re); in rate_estimator_destroy()
45 struct rate_estimator *re; in rate_estimator_create() local
47 re = (struct rate_estimator *)calloc(1, sizeof(*re)); in rate_estimator_create()
48 if (re == NULL) in rate_estimator_create()
51 re->window_size = *window_size; in rate_estimator_create()
52 re->estimated_rate = rate; in rate_estimator_create()
53 re->smooth_factor = smooth_factor; in rate_estimator_create()
55 return re; in rate_estimator_create()
[all …]
/external/icu/icu4c/source/test/cintltst/
Dreapits.c56 re = uregex_openC(pattern, flags, NULL, &status); \
60 uregex_setText(re, srcString, -1, &status); \
67 uregex_close(re); \
206 URegularExpression *re; in TestRegexCAPI() local
214 re = uregex_open(pat, -1, 0, 0, &status); in TestRegexCAPI()
219 uregex_close(re); in TestRegexCAPI()
223 re = uregex_open(pat, -1, in TestRegexCAPI()
227 uregex_close(re); in TestRegexCAPI()
231 re = uregex_open(pat, -1, 0x40000000, 0, &status); in TestRegexCAPI()
233 uregex_close(re); in TestRegexCAPI()
[all …]
/external/adhd/cras/src/tests/
Drate_estimator_unittest.cc17 struct rate_estimator *re; in TEST() local
24 re = rate_estimator_create(10000, &window, 0.0f); in TEST()
27 rc = rate_estimator_check(re, level, &t); in TEST()
32 rate_estimator_add_frames(re, 5 + tmp); in TEST()
37 rc = rate_estimator_check(re, level, &t); in TEST()
39 EXPECT_GT(10000, rate_estimator_get_rate(re)); in TEST()
40 EXPECT_LT(9999, rate_estimator_get_rate(re)); in TEST()
42 rate_estimator_destroy(re); in TEST()
46 struct rate_estimator *re; in TEST() local
57 re = rate_estimator_create(7470, &window, 0.0f); in TEST()
[all …]
/external/libcxx/test/std/re/re.regex/re.regex.construct/
Ddeduct.pass.cpp42 std::basic_regex re(s1.begin(), s1.end()); in main() local
44 static_assert(std::is_same_v<decltype(re), std::basic_regex<char>>, ""); in main()
45 assert(re.flags() == std::regex_constants::ECMAScript); in main()
46 assert(re.mark_count() == 0); in main()
51 std::basic_regex re(s1.begin(), s1.end(), std::regex_constants::basic); in main() local
53 static_assert(std::is_same_v<decltype(re), std::basic_regex<wchar_t>>, ""); in main()
54 assert(re.flags() == std::regex_constants::basic); in main()
55 assert(re.mark_count() == 1); in main()
61 std::basic_regex re("(a([bc]))"s); in main() local
62 static_assert(std::is_same_v<decltype(re), std::basic_regex<char>>, ""); in main()
[all …]
/external/smali/smalidea/src/main/antlr/
DsmalideaParser.g92 public void recover(IntStream input, RecognitionException re) {
113 // we want to return the token we're actually matching
204 catch [RecognitionException re] {
205 recover(input, re);
206 reportError(marker, re, false);
213 catch [RecognitionException re] {
214 recover(input, re);
215 reportError(marker, re, false);
222 catch [RecognitionException re] {
223 recover(input, re);
[all …]
/external/pcre/dist2/src/
Dpcre2_pattern_info.c67 const pcre2_real_code *re = (pcre2_real_code *)code; in pcre2_pattern_info() local
110 if (re == NULL) return PCRE2_ERROR_NULL; in pcre2_pattern_info()
115 if (re->magic_number != MAGIC_NUMBER) return PCRE2_ERROR_BADMAGIC; in pcre2_pattern_info()
119 if ((re->flags & (PCRE2_CODE_UNIT_WIDTH/8)) == 0) return PCRE2_ERROR_BADMODE; in pcre2_pattern_info()
124 *((uint32_t *)where) = re->overall_options; in pcre2_pattern_info()
128 *((uint32_t *)where) = re->compile_options; in pcre2_pattern_info()
132 *((uint32_t *)where) = re->top_backref; in pcre2_pattern_info()
136 *((uint32_t *)where) = re->bsr_convention; in pcre2_pattern_info()
140 *((uint32_t *)where) = re->top_bracket; in pcre2_pattern_info()
144 *((uint32_t *)where) = re->limit_depth; in pcre2_pattern_info()
[all …]
Dpcre2_study.c57 #define SET_BIT(c) re->start_bitmap[(c)/8] |= (1 << ((c)&7))
101 find_minlength(const pcre2_real_code *re, PCRE2_SPTR code, in find_minlength() argument
112 BOOL dupcapused = (re->flags & PCRE2_DUPCAPUSED) != 0; in find_minlength()
178 d = find_minlength(re, cc, startcode, utf, recurses, countptr, in find_minlength()
199 prev_cap_d = find_minlength(re, cc, startcode, utf, recurses, countptr, in find_minlength()
461 if ((re->overall_options & PCRE2_MATCH_UNSET_BACKREF) == 0) in find_minlength()
465 (PCRE2_UCHAR *)((uint8_t *)re + sizeof(pcre2_real_code)) + in find_minlength()
466 GET2(cc, 1) * re->name_entry_size; in find_minlength()
503 dd = find_minlength(re, cs, startcode, utf, &this_recurse, in find_minlength()
516 slot += re->name_entry_size; in find_minlength()
[all …]
/external/icu/icu4c/source/data/curr/
Dsn.txt7 "Diramu re United Arab Emirates",
15 "Dora re Australia",
19 "Dhinari re Bhahareni",
23 "Furenki re Bhurundi",
27 "Pura re Botswana",
31 "Dora re Kanada",
35 "Furenki re Kongo",
39 "Furenki re Swisi",
47 "Dhora re Escudo",
51 "Furenki re Jibhuti",
[all …]
/external/clang/docs/tools/
Ddump_ast_matchers.py7 import re
36 text = re.sub(r'&', '&amp;', text)
37 text = re.sub(r'<', '&lt;', text)
38 text = re.sub(r'>', '&gt;', text)
53 text = re.sub(
69 m = re.search(r'Usable as: Any Matcher[\s\n]*$', comment, re.S)
73 m = re.match(r'^(.*)Matcher<([^>]+)>\s*,?[\s\n]*$', comment, re.S)
75 if re.search(r'Usable as:\s*$', comment):
85 comment = re.sub(r'^\\[^\s]+\n', r'', comment, flags=re.M)
89 comment = re.sub(r'\\see', r'See also:', comment)
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/utils/UpdateTestChecks/
Dasm.py1 import re
16 ASM_FUNCTION_X86_RE = re.compile(
20 flags=(re.M | re.S))
22 ASM_FUNCTION_ARM_RE = re.compile(
27 flags=(re.M | re.S))
29 ASM_FUNCTION_AARCH64_RE = re.compile(
35 flags=(re.M | re.S))
37 ASM_FUNCTION_AMDGPU_RE = re.compile(
42 flags=(re.M | re.S))
44 ASM_FUNCTION_MIPS_RE = re.compile(
[all …]
/external/python/cpython2/Demo/classes/
DComplex.py88 return obj.re
98 def __init__(self, re=0, im=0): argument
101 if IsComplex(re):
102 _re = re.re
103 _im = re.im
105 _re = re
108 _im = _im + im.re
121 return hash(self.re)
122 return hash((self.re, self.im))
126 return 'Complex(%r)' % (self.re,)
[all …]
/external/llvm/test/MC/MachO/
Dx86_32-optimal_nop.s21 # nopl (%[re]ax)
31 # nopl 0(%[re]ax)
40 # nopl 0(%[re]ax,%[re]ax,1)
48 # nopw 0(%[re]ax,%[re]ax,1)
55 # nopl 0L(%[re]ax)
69 # nopl 0L(%[re]ax,%[re]ax,1)
82 # nopw 0L(%[re]ax,%[re]ax,1)
95 # nopw %cs:0L(%[re]ax,%[re]ax,1)
106 # nopw %cs:0L(%[re]ax,%[re]ax,1)
116 # nopw 0(%[re]ax,%[re]ax,1)
[all …]
/external/swiftshader/third_party/LLVM/test/MC/MachO/
Dx86_32-optimal_nop.s21 # nopl (%[re]ax)
31 # nopl 0(%[re]ax)
40 # nopl 0(%[re]ax,%[re]ax,1)
48 # nopw 0(%[re]ax,%[re]ax,1)
55 # nopl 0L(%[re]ax)
69 # nopl 0L(%[re]ax,%[re]ax,1)
82 # nopw 0L(%[re]ax,%[re]ax,1)
95 # nopw %cs:0L(%[re]ax,%[re]ax,1)
106 # nopw %cs:0L(%[re]ax,%[re]ax,1)
116 # nopw 0(%[re]ax,%[re]ax,1)
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/MC/MachO/
Dx86_32-optimal_nop.s21 # nopl (%[re]ax)
31 # nopl 0(%[re]ax)
40 # nopl 0(%[re]ax,%[re]ax,1)
48 # nopw 0(%[re]ax,%[re]ax,1)
55 # nopl 0L(%[re]ax)
69 # nopl 0L(%[re]ax,%[re]ax,1)
82 # nopw 0L(%[re]ax,%[re]ax,1)
95 # nopw %cs:0L(%[re]ax,%[re]ax,1)
106 # nopw %cs:0L(%[re]ax,%[re]ax,1)
116 # nopw 0(%[re]ax,%[re]ax,1)
[all …]
/external/python/httplib2/doc/html/_static/
Dsearchtools.js86 var re;
96 re = /^(.+?)(ss|i)es$/;
99 if (re.test(w))
100 w = w.replace(re,"$1$2");
105 re = /^(.+?)eed$/;
107 if (re.test(w)) {
108 var fp = re.exec(w);
109 re = new RegExp(mgr0);
110 if (re.test(fp[1])) {
111 re = /.$/;
[all …]
/external/u-boot/scripts/
Dcheckstack.pl36 my (@stack, $re, $dre, $x, $xs, $funcre);
49 $re = qr/^.*stp.*sp,\#-([0-9]{1,8})\]\!/o;
52 $re = qr/.*sub.*sp, sp, #(([0-9]{2}|[3-9])[0-9]{2})/o;
57 $re = qr/^.*[as][du][db] \$(0x$x{1,8}),\%(e|r)sp$/o;
61 $re = qr/.*adds.*r12=-(([0-9]{2}|[3-9])[0-9]{2}),r12/o;
65 $re = qr/.*(?:linkw %fp,|addaw )#-([0-9]{1,4})(?:,%sp)?$/o;
68 $re = qr/.*ADD.*A0StP,A0StP,\#(0x$x{1,8})/o;
72 $re = qr/.*daddiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o;
75 $re = qr/.*addiu.*sp,sp,-(([0-9]{2}|[3-9])[0-9]{2})/o;
77 $re = qr/.*ldo ($x{1,8})\(sp\),sp/o;
[all …]
/external/selinux/python/sepolicy/sepolicy/
Dgenerate.py25 import re
343 if not re.match(r"^[a-zA-Z0-9-_]+$", name):
520 return re.sub("TEMPLATETYPE", self.name, executable.te_uid_rules)
526 return re.sub("TEMPLATETYPE", self.name, executable.te_syslog_rules)
532 return re.sub("TEMPLATETYPE", self.name, executable.te_resolve_rules)
538 return re.sub("TEMPLATETYPE", self.name, executable.te_kerberos_rules)
544 return re.sub("TEMPLATETYPE", self.name, executable.te_manage_krb5_rcache_rules)
551 newte = re.sub("TEMPLATETYPE", self.name, executable.te_pam_rules)
557 newte = re.sub("TEMPLATETYPE", self.name, executable.te_audit_rules)
563 newte = re.sub("TEMPLATETYPE", self.name, executable.te_etc_rules)
[all …]
/external/libxaac/decoder/
Dixheaacd_mps_hybrid_filt.c71 in_re = (WORD32)(input[n + i].re); in ixheaacd_mps_hyb_filt_type1()
102 output[q][i].re = (WORD32)(acc_re >> shift); in ixheaacd_mps_hyb_filt_type1()
130 in_re = (WORD32)(input[n + i].re); in ixheaacd_mps_hyb_filt_type2()
159 output[q][i].re = (WORD32)(acc_re >> shift); in ixheaacd_mps_hyb_filt_type2()
191 handle->lf_buffer[k][n].re = handle->lf_buffer[k][n + num_samples].re; in ixheaacd_mps_qmf_hybrid_analysis()
198 handle->lf_buffer[k][n + lf_samples_shift].re = (WORD32)(in_qmf[n][k].re); in ixheaacd_mps_qmf_hybrid_analysis()
205 handle->hf_buffer[k][n].re = handle->hf_buffer[k][n + num_samples].re; in ixheaacd_mps_qmf_hybrid_analysis()
212 handle->hf_buffer[k][n + hf_samples_shift].re = in ixheaacd_mps_qmf_hybrid_analysis()
213 (in_qmf[n][k + lf_qmf_bands].re); in ixheaacd_mps_qmf_hybrid_analysis()
225 hyb[n][k].re = (FLOAT32)scratch[k + 6][n].re; in ixheaacd_mps_qmf_hybrid_analysis()
[all …]
/external/v8/tools/
Djsmin.py47 import re
105 return re.sub(r"\$\{([\w$%]+)\}",
115 if re.match("[\"'/]", matched_text):
117 m = re.match(r"var ", matched_text)
120 var_names = re.split(r",", var_names)
122 m = re.match(r"(function\b[^(]*)\((.*)\)\{$", matched_text)
126 args = re.split(r",", args)
192 if re.match(r"'.*'$", entire_match):
194 if re.match(r'".*"$', entire_match):
196 if re.match(r"`.*`$", entire_match):
[all …]
/external/libcxx/test/std/re/re.alg/re.alg.match/
Dlookahead_capture.pass.cpp31 std::regex re("^(?=(.))a$"); in main() local
32 assert(re.mark_count() == 1); in main()
36 assert(std::regex_match(s, m, re)); in main()
43 std::regex re("^(a)(?=(.))(b)$"); in main() local
44 assert(re.mark_count() == 3); in main()
48 assert(std::regex_match(s, m, re)); in main()
57 std::regex re("^(.)(?=(.)(?=.(.)))(...)$"); in main() local
58 assert(re.mark_count() == 4); in main()
62 assert(std::regex_match(s, m, re)); in main()
72 std::regex re("^(a)(?!([^b]))(.c)$"); in main() local
[all …]
/external/freetype/src/tools/docmaker/
Dsources.py32 import fileinput, re, string
54 self.start = re.compile( start, re.VERBOSE )
55 self.column = re.compile( column, re.VERBOSE )
56 self.end = re.compile( end, re.VERBOSE )
130 re_markup_tag1 = re.compile( r'''\s*<((?:\w|-)*)>''' ) # <xxxx> format
131 re_markup_tag2 = re.compile( r'''\s*@((?:\w|-)*):''' ) # @xxxx: format
153 re_crossref = re.compile( r"""
158 """, re.VERBOSE )
168 re_italic = re.compile( r"_((?:\w|-)(?:\w|'|-)*)_(.*)" ) # _italic_
169 re_bold = re.compile( r"\*((?:\w|-)(?:\w|'|-)*)\*(.*)" ) # *bold*
[all …]
/external/antlr/runtime/ObjC/Framework/examples/simplecTreeParser/
DSimpleCTP.java100 catch (RecognitionException re) { in program()
101 reportError(re); in program()
102 recover(input,re); in program()
192 catch (RecognitionException re) { in declaration()
193 reportError(re); in declaration()
194 recover(input,re); in declaration()
229 catch (RecognitionException re) { in variable()
230 reportError(re); in variable()
231 recover(input,re); in variable()
252 catch (RecognitionException re) { in declarator()
[all …]
/external/libcxx/test/std/re/re.const/re.matchflag/
Dmatch_not_bol.pass.cpp26 std::regex re("^foo"); in main() local
27 assert( std::regex_match(target, re)); in main()
28 assert(!std::regex_match(target, re, std::regex_constants::match_not_bol)); in main()
33 std::regex re("foo"); in main() local
34 assert( std::regex_match(target, re)); in main()
35 assert( std::regex_match(target, re, std::regex_constants::match_not_bol)); in main()
40 std::regex re("^foo"); in main() local
41 assert( std::regex_search(target, re)); in main()
42 assert(!std::regex_search(target, re, std::regex_constants::match_not_bol)); in main()
47 std::regex re("foo"); in main() local
[all …]

12345678910>>...196