| /external/pdfium/testing/resources/ |
| D | many_rectangles.in | 26 1.000000 1.000000 8.000000 8.000000 re B*
28 11.000000 1.000000 8.000000 8.000000 re B*
30 21.000000 1.000000 8.000000 8.000000 re B*
32 31.000000 1.000000 8.000000 8.000000 re B*
34 41.000000 1.000000 8.000000 8.000000 re B*
36 51.000000 1.000000 8.000000 8.000000 re B*
38 61.000000 1.000000 8.000000 8.000000 re B*
40 71.000000 1.000000 8.000000 8.000000 re B*
42 81.000000 1.000000 8.000000 8.000000 re B*
44 91.000000 1.000000 8.000000 8.000000 re B*
[all …]
|
| /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 | 4 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/tests/ |
| D | rate_estimator_unittest.cc | 14 struct rate_estimator* re; in TEST() local
18 re = rate_estimator_create(10000, &window, 0.0f); in TEST()
21 rc = rate_estimator_check(re, level, &t); in TEST()
26 rate_estimator_add_frames(re, 5 + tmp); in TEST()
31 rc = rate_estimator_check(re, level, &t); in TEST()
33 EXPECT_GT(10000, rate_estimator_get_rate(re)); in TEST()
34 EXPECT_LT(9999, rate_estimator_get_rate(re)); in TEST()
36 rate_estimator_destroy(re); in TEST()
40 struct rate_estimator* re; in TEST() local
48 re = rate_estimator_create(7470, &window, 0.0f); in TEST()
[all …]
|
| /external/llvm-project/libcxx/test/std/re/re.regex/re.regex.construct/ |
| D | deduct.pass.cpp | 41 std::basic_regex re(s1.begin(), s1.end()); in main() local
43 static_assert(std::is_same_v<decltype(re), std::basic_regex<char>>, ""); in main()
44 assert(re.flags() == std::regex_constants::ECMAScript); in main()
45 assert(re.mark_count() == 0); in main()
50 std::basic_regex re(s1.begin(), s1.end(), std::regex_constants::basic); in main() local
52 static_assert(std::is_same_v<decltype(re), std::basic_regex<wchar_t>>, ""); in main()
53 assert(re.flags() == std::regex_constants::basic); in main()
54 assert(re.mark_count() == 1); in main()
60 std::basic_regex re("(a([bc]))"s); in main() local
61 static_assert(std::is_same_v<decltype(re), std::basic_regex<char>>, ""); in main()
[all …]
|
| /external/libcxx/test/std/re/re.regex/re.regex.construct/ |
| D | deduct.pass.cpp | 42 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/icu/icu4c/source/test/cintltst/ |
| D | reapits.c | 62 re = uregex_openC(pattern, flags, NULL, &status); \
67 uregex_setText(re, srcString, -1, &status); \
75 uregex_close(re); \
214 URegularExpression *re; in TestRegexCAPI() local
222 re = uregex_open(pat, -1, 0, 0, &status); in TestRegexCAPI()
227 uregex_close(re); in TestRegexCAPI()
231 re = uregex_open(pat, -1, in TestRegexCAPI()
235 uregex_close(re); in TestRegexCAPI()
239 re = uregex_open(pat, -1, 0x40000000, 0, &status); in TestRegexCAPI()
241 uregex_close(re); in TestRegexCAPI()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/ |
| D | simplify.cc | 25 Regexp* re = Parse(src, flags, status); in SimplifyRegexp() local
26 if (re == NULL) in SimplifyRegexp()
28 Regexp* sre = re->Simplify(); in SimplifyRegexp()
29 re->Decref(); in SimplifyRegexp()
111 virtual Regexp* PostVisit(Regexp* re, Regexp* parent_arg, Regexp* pre_arg,
113 virtual Regexp* Copy(Regexp* re);
114 virtual Regexp* ShortVisit(Regexp* re, Regexp* parent_arg);
141 virtual Regexp* PreVisit(Regexp* re, Regexp* parent_arg, bool* stop);
142 virtual Regexp* PostVisit(Regexp* re, Regexp* parent_arg, Regexp* pre_arg,
144 virtual Regexp* Copy(Regexp* re);
[all …]
|
| D | parse.cc | 87 bool PushRegexp(Regexp* re);
208 for (Regexp* re = stacktop_; re != NULL; re = next) { in ~ParseState() local
209 next = re->down_; in ~ParseState()
210 re->down_ = NULL; in ~ParseState()
211 if (re->op() == kLeftParen) in ~ParseState()
212 delete re->name_; in ~ParseState()
213 re->Decref(); in ~ParseState()
220 Regexp* Regexp::ParseState::FinishRegexp(Regexp* re) { in FinishRegexp() argument
221 if (re == NULL) in FinishRegexp()
223 re->down_ = NULL; in FinishRegexp()
[all …]
|
| D | walker-inl.h | 39 virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
50 virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
65 virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
70 T Walk(Regexp* re, T top_arg);
80 T WalkExponential(Regexp* re, T top_arg, int max_visits);
96 T WalkInternal(Regexp* re, T top_arg, bool use_copy);
102 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re, in PreVisit() argument
108 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re, in PostVisit() argument
122 WalkState<T>(Regexp* re, T parent) in WalkState()
123 : re(re), in WalkState()
[all …]
|
| /external/libchrome/libchrome_tools/uprev/ |
| D | filters.py | 7 import re
12 re.compile(rb'base/((?!(allocator|third_party)/).*$)'),
13 re.compile(
16 re.compile(rb'base/third_party/(dynamic_annotation|icu|nspr|valgrind)'),
17 re.compile(rb'build/(android/(gyp/util|pylib/([^/]*$|constants))|[^/]*\.(h|py)$)'),
18 re.compile(rb'mojo/'),
19 re.compile(rb'dbus/'),
20 re.compile(rb'ipc/.*(\.cc|\.h|\.mojom)$'),
21 re.compile(rb'ui/gfx/(gfx_export.h|geometry|range)'),
22 re.compile(rb'testing/[^/]*\.(cc|h)$'),
[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
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 …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/ |
| D | dump.cc | 57 static void DumpRegexpAppending(Regexp* re, std::string* s) { in DumpRegexpAppending() argument
58 if (re->op() < 0 || re->op() >= arraysize(kOpcodeNames)) { in DumpRegexpAppending()
59 *s += StringPrintf("op%d", re->op()); in DumpRegexpAppending()
61 switch (re->op()) { in DumpRegexpAppending()
68 if (re->parse_flags() & Regexp::NonGreedy) in DumpRegexpAppending()
72 s->append(kOpcodeNames[re->op()]); in DumpRegexpAppending()
73 if (re->op() == kRegexpLiteral && (re->parse_flags() & Regexp::FoldCase)) { in DumpRegexpAppending()
74 Rune r = re->rune(); in DumpRegexpAppending()
78 if (re->op() == kRegexpLiteralString && (re->parse_flags() & Regexp::FoldCase)) { in DumpRegexpAppending()
79 for (int i = 0; i < re->nrunes(); i++) { in DumpRegexpAppending()
[all …]
|
| D | regexp_benchmark.cc | 35 Regexp* re = Regexp::Parse("(\\d+)-(\\d+)-(\\d+)", Regexp::LikePerl, NULL); in Test() local
36 CHECK(re); in Test()
37 Prog* prog = re->CompileToProg(0); in Test()
49 re->Decref(); in Test()
58 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in MemoryUsage() local
59 CHECK(re); in MemoryUsage()
66 Prog* prog = re->CompileToProg(0); in MemoryUsage()
79 re->Decref(); in MemoryUsage()
85 PCRE re(regexp, PCRE::UTF8); in MemoryUsage() local
88 PCRE::FullMatch(text, re); in MemoryUsage()
[all …]
|
| /external/llvm-project/llvm/utils/UpdateTestChecks/ |
| D | asm.py | 2 import re
17 ASM_FUNCTION_X86_RE = re.compile(
21 flags=(re.M | re.S))
23 ASM_FUNCTION_ARM_RE = re.compile(
28 flags=(re.M | re.S))
30 ASM_FUNCTION_AARCH64_RE = re.compile(
36 flags=(re.M | re.S))
38 ASM_FUNCTION_AMDGPU_RE = re.compile(
43 flags=(re.M | re.S))
45 ASM_FUNCTION_HEXAGON_RE = re.compile(
[all …]
|
| /external/icu/icu4c/source/data/curr/ |
| D | sn.txt | 8 "Diramu re United Arab Emirates",
16 "Dora re Australia",
20 "Dhinari re Bhahareni",
24 "Furenki re Bhurundi",
28 "Pura re Botswana",
32 "Dora re Kanada",
36 "Furenki re Kongo",
40 "Furenki re Swisi",
48 "Dhora re Escudo",
52 "Furenki re Jibhuti",
[all …]
|
| /external/rust/crates/regex/tests/ |
| D | api.rs | 3 let re = regex!(""); in empty_regex_empty_match() localVariable
4 assert_eq!(vec![(0, 0)], findall!(re, "")); in empty_regex_empty_match()
9 let re = regex!(""); in empty_regex_nonempty_match() localVariable
10 assert_eq!(vec![(0, 0), (1, 1), (2, 2), (3, 3)], findall!(re, "abc")); in empty_regex_nonempty_match()
15 let re = regex!(r"[0-9]*"); in one_zero_length_match() localVariable
16 assert_eq!(vec![(0, 0), (1, 2), (3, 4)], findall!(re, "a1b2")); in one_zero_length_match()
21 let re = regex!(r"[0-9]*"); in many_zero_length_match() localVariable
24 findall!(re, "a1bbb2") in many_zero_length_match()
30 let re = regex!(r"[0-9]?"); in many_sequential_zero_length_match() localVariable
33 findall!(re, "a12b3c") in many_sequential_zero_length_match()
[all …]
|
| /external/llvm-project/clang/docs/tools/ |
| D | dump_ast_matchers.py | 7 import re
39 text = re.sub(r'&', '&', text)
40 text = re.sub(r'<', '<', text)
41 text = re.sub(r'>', '>', text)
56 text = re.sub(
72 m = re.search(r'Usable as: Any Matcher[\s\n]*$', comment, re.S)
76 m = re.match(r'^(.*)Matcher<([^>]+)>\s*,?[\s\n]*$', comment, re.S)
78 if re.search(r'Usable as:\s*$', comment):
88 comment = re.sub(r'^\\[^\s]+\n', r'', comment, flags=re.M)
92 comment = re.sub(r'\\see', r'See also:', comment)
[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-project/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/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/webrtc/modules/audio_processing/aec3/ |
| D | fft_data_unittest.cc | 26 for (size_t k = 0; k < x.re.size(); ++k) { in TEST()
27 x.re[k] = k + 1; in TEST()
64 x.re.fill(1.f); in TEST()
67 EXPECT_EQ(x.re, y.re); in TEST()
80 x_ref.re.fill(0.f); in TEST()
83 x.re.fill(1.f); in TEST()
87 EXPECT_EQ(x_ref.re, x.re); in TEST()
95 for (size_t k = 0; k < x.re.size(); ++k) { in TEST()
96 x.re[k] = k + 1; in TEST()
107 EXPECT_EQ(x.re[0] * x.re[0], spectrum[0]); in TEST()
[all …]
|
| /external/adhd/cras/src/server/rust/src/ |
| D | rate_estimator_bindings.rs | 29 Ok(re) => Box::into_raw(Box::new(re)), in rate_estimator_create()
39 pub unsafe extern "C" fn rate_estimator_destroy(re: *mut RateEstimator) { in rate_estimator_destroy()
40 if re.is_null() { in rate_estimator_destroy()
44 drop(Box::from_raw(re)); in rate_estimator_destroy()
52 pub unsafe extern "C" fn rate_estimator_add_frames(re: *mut RateEstimator, frames: libc::c_int) { in rate_estimator_add_frames()
53 if re.is_null() { in rate_estimator_add_frames()
57 (*re).add_frames(frames) in rate_estimator_add_frames()
67 re: *mut RateEstimator, in rate_estimator_check()
71 if re.is_null() || now.is_null() { in rate_estimator_check()
83 (*re).update_estimated_rate(level, now) as i32 in rate_estimator_check()
[all …]
|