/external/python/cpython2/Lib/test/ |
D | test_re.py | 8 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/ |
D | test_re.py | 5 import re 12 from re import Scanner 42 with self.assertRaises(re.error) as cm: 43 re.compile(pattern) 51 with self.assertRaises(re.error) as cm: 52 re.sub(pattern, repl, string) 62 it = re.finditer(b'a', b) 72 x = re.compile('ab+c') 77 self.assertEqual(re.search('x*', 'axx').span(0), (0, 0)) 78 self.assertEqual(re.search('x*', 'axx').span(), (0, 0)) [all …]
|
/external/adhd/cras/src/server/ |
D | rate_estimator.c | 35 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/ |
D | reapits.c | 56 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/ |
D | rate_estimator_unittest.cc | 17 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/smali/smalidea/src/main/antlr/ |
D | smalideaParser.g | 92 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/ |
D | pcre2_pattern_info.c | 67 const pcre2_real_code *re = (pcre2_real_code *)code; in pcre2_pattern_info() local 107 if (re == NULL) return PCRE2_ERROR_NULL; in pcre2_pattern_info() 112 if (re->magic_number != MAGIC_NUMBER) return PCRE2_ERROR_BADMAGIC; in pcre2_pattern_info() 116 if ((re->flags & (PCRE2_CODE_UNIT_WIDTH/8)) == 0) return PCRE2_ERROR_BADMODE; in pcre2_pattern_info() 121 *((uint32_t *)where) = re->overall_options; in pcre2_pattern_info() 125 *((uint32_t *)where) = re->compile_options; in pcre2_pattern_info() 129 *((uint32_t *)where) = re->top_backref; in pcre2_pattern_info() 133 *((uint32_t *)where) = re->bsr_convention; in pcre2_pattern_info() 137 *((uint32_t *)where) = re->top_bracket; in pcre2_pattern_info() 141 *((uint32_t *)where) = ((re->flags & PCRE2_FIRSTSET) != 0)? 1 : in pcre2_pattern_info() [all …]
|
D | pcre2_study.c | 55 #define SET_BIT(c) re->start_bitmap[(c)/8] |= (1 << ((c)&7)) 92 find_minlength(const pcre2_real_code *re, PCRE2_SPTR code, in find_minlength() argument 102 BOOL dupcapused = (re->flags & PCRE2_DUPCAPUSED) != 0; in find_minlength() 169 d = find_minlength(re, cc, startcode, utf, recurses, countptr); in find_minlength() 189 prev_cap_d = find_minlength(re, cc, startcode, utf, recurses, countptr); in find_minlength() 450 if ((re->overall_options & PCRE2_MATCH_UNSET_BACKREF) == 0) in find_minlength() 454 (PCRE2_UCHAR *)((uint8_t *)re + sizeof(pcre2_real_code)) + in find_minlength() 455 GET2(cc, 1) * re->name_entry_size; in find_minlength() 487 dd = find_minlength(re, cs, startcode, utf, &this_recurse, countptr); in find_minlength() 491 slot += re->name_entry_size; in find_minlength() [all …]
|
/external/icu/icu4c/source/data/curr/ |
D | sn.txt | 7 "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/ |
D | dump_ast_matchers.py | 7 import re 36 text = re.sub(r'&', '&', text) 37 text = re.sub(r'<', '<', text) 38 text = re.sub(r'>', '>', 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/python/cpython2/Demo/classes/ |
D | Complex.py | 88 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/ |
D | x86_32-optimal_nop.s | 21 # 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/ |
D | x86_32-optimal_nop.s | 21 # 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/selinux/python/sepolicy/sepolicy/ |
D | generate.py | 27 import re 346 if not re.match(r"^[a-zA-Z0-9-_]+$", name): 523 return re.sub("TEMPLATETYPE", self.name, executable.te_uid_rules) 529 return re.sub("TEMPLATETYPE", self.name, executable.te_syslog_rules) 535 return re.sub("TEMPLATETYPE", self.name, executable.te_resolve_rules) 541 return re.sub("TEMPLATETYPE", self.name, executable.te_kerberos_rules) 547 return re.sub("TEMPLATETYPE", self.name, executable.te_manage_krb5_rcache_rules) 554 newte = re.sub("TEMPLATETYPE", self.name, executable.te_pam_rules) 560 newte = re.sub("TEMPLATETYPE", self.name, executable.te_audit_rules) 566 newte = re.sub("TEMPLATETYPE", self.name, executable.te_etc_rules) [all …]
|
/external/libxaac/decoder/ |
D | ixheaacd_mps_hybrid_filt.c | 71 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/ |
D | jsmin.py | 47 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/ |
D | lookahead_capture.pass.cpp | 31 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/ |
D | sources.py | 32 import fileinput, re, sys, os, 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/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
D | SimpleCTP.java | 100 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/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
D | SimpleCTP.java | 100 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/ |
D | match_not_eol.pass.cpp | 26 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_eol)); 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_eol)); 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_eol)); in main() 47 std::regex re("foo"); in main() local [all …]
|
D | match_not_bol.pass.cpp | 26 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 …]
|
/external/smali/smali/src/main/java/org/jf/smali/ |
D | smaliTreeWalker.java | 535 catch (RecognitionException re) { in header() 536 reportError(re); in header() 537 recover(input,re); in header() 578 catch (RecognitionException re) { in class_spec() 579 reportError(re); in class_spec() 580 recover(input,re); in class_spec() 614 catch (RecognitionException re) { in super_spec() 615 reportError(re); in super_spec() 616 recover(input,re); in super_spec() 650 catch (RecognitionException re) { in implements_spec() [all …]
|
/external/aac/libSACenc/src/ |
D | sacenc_vectorfunctions.cpp | 131 maxVal |= fAbs(x[i].v.re); in sumUpCplxPow2() 147 FIXP_DBL re, im, sum; in sumUpCplxPow2() local 149 re = im = sum = FL2FXCONST_DBL(0.0); in sumUpCplxPow2() 153 re += fPow2Div2(x[i].v.re << cs); in sumUpCplxPow2() 159 re += fPow2Div2(x[i].v.re) >> cs; in sumUpCplxPow2() 164 sum = (re >> 1) + (im >> 1); in sumUpCplxPow2() 180 maxVal |= fAbs(x[i][j].v.re); in sumUpCplxPow2Dim2() 197 FIXP_DBL re, im, sum; in sumUpCplxPow2Dim2() local 199 re = im = sum = FL2FXCONST_DBL(0.0); in sumUpCplxPow2Dim2() 204 re += fPow2Div2(x[i][j].v.re << cs); in sumUpCplxPow2Dim2() [all …]
|
/external/mesa3d/src/gallium/drivers/swr/rasterizer/jitter/scripts/ |
D | gen_llvm_types.py | 24 import os, sys, re 145 match = re.match(r"(\s*)struct(\s*)(\w+)", line) 150 is_fwd_decl = re.search(r";", line) 173 is_llvm_typedef = re.search(r"@llvm_typedef", line) 181 is_llvm_struct = re.search(r"@llvm_struct", line) 190 is_llvm_enum = re.search(r"@llvm_enum", line) 199 is_llvm_pfn = re.search(r"@llvm_pfn", line) 208 is_const = re.search(r"\s+const\s+", line) 217 is_pointer_pointer = re.search("\*\*", line) 226 is_pointer = re.search("\*", line) [all …]
|