Home
last modified time | relevance | path

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

12345678910>>...57

/external/v8/test/mjsunit/
Dregexp-lookahead.js35 function testRE(re, input, expected_result) { argument
36 var testName = re + ".test(" + stringEscape(input) +")";
38 assertTrue(re.test(input), testName);
40 assertFalse(re.test(input), testName);
44 function execRE(re, input, expected_result) { argument
45 var testName = re + ".exec('" + stringEscape(input) +"')";
46 assertEquals(expected_result, re.exec(input), testName);
51 var re = /^(?=a)/; variable
52 testRE(re, "a", true);
53 testRE(re, "b", false);
[all …]
Dregexp.js39 var re = new RegExp(s); variable
40 assertEquals(s.match(re).length, 1);
41 assertEquals(s.match(re)[0], String.fromCharCode(0));
45 re = /^./gm; // any non-newline character at the beginning of a line
46 var result = s.match(re);
55 re = /.$/gm; // any non-newline character at the end of a line
56 result = s.match(re);
65 re = /^[^]/gm; // *any* character at the beginning of a line
66 result = s.match(re);
76 re = /[^]$/gm; // *any* character at the end of a line
[all …]
/external/regex-re2/re2/
Dsimplify.cc21 Regexp* re = Parse(src, flags, status); in SimplifyRegexp() local
22 if (re == NULL) in SimplifyRegexp()
24 Regexp* sre = re->Simplify(); in SimplifyRegexp()
25 re->Decref(); in SimplifyRegexp()
106 virtual Regexp* PreVisit(Regexp* re, Regexp* parent_arg, bool* stop);
107 virtual Regexp* PostVisit(Regexp* re,
111 virtual Regexp* Copy(Regexp* re);
112 virtual Regexp* ShortVisit(Regexp* re, Regexp* parent_arg);
125 static Regexp* SimplifyRepeat(Regexp* re, int min, int max,
131 static Regexp* SimplifyCharClass(Regexp* re);
[all …]
Dparse.cc60 bool PushRegexp(Regexp* re);
180 for (Regexp* re = stacktop_; re != NULL; re = next) { in ~ParseState() local
181 next = re->down_; in ~ParseState()
182 re->down_ = NULL; in ~ParseState()
183 if (re->op() == kLeftParen) in ~ParseState()
184 delete re->name_; in ~ParseState()
185 re->Decref(); in ~ParseState()
192 Regexp* Regexp::ParseState::FinishRegexp(Regexp* re) { in FinishRegexp() argument
193 if (re == NULL) in FinishRegexp()
195 re->down_ = NULL; in FinishRegexp()
[all …]
Dwalker-inl.h36 virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
47 virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
62 virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
67 T Walk(Regexp* re, T top_arg);
77 T WalkExponential(Regexp* re, T top_arg, int max_visits);
93 T WalkInternal(Regexp* re, T top_arg, bool use_copy);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re, in PreVisit() argument
104 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re, in PostVisit() argument
118 WalkState<T>(Regexp* re, T parent) in WalkState()
119 : re(re), in WalkState()
[all …]
Dregexp.cc132 Regexp* re = stack; in Destroy() local
133 stack = re->down_; in Destroy()
134 if (re->ref_ != 0) in Destroy()
135 LOG(DFATAL) << "Bad reference count " << re->ref_; in Destroy()
136 if (re->nsub_ > 0) { in Destroy()
137 Regexp** subs = re->sub(); in Destroy()
138 for (int i = 0; i < re->nsub_; i++) { in Destroy()
151 if (re->nsub_ > 1) in Destroy()
153 re->nsub_ = 0; in Destroy()
155 delete re; in Destroy()
[all …]
Dmimics_pcre.cc32 static bool CanBeEmptyString(Regexp *re);
40 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg, bool* child_args,
43 bool ShortVisit(Regexp* re, bool a) { in ShortVisit() argument
53 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg, in PostVisit() argument
61 switch (re->op()) { in PostVisit()
66 if (CanBeEmptyString(re->sub()[0])) in PostVisit()
70 if (re->max() == -1 && CanBeEmptyString(re->sub()[0])) in PostVisit()
76 if (re->rune() == '\v') in PostVisit()
83 if (re->parse_flags() & Regexp::WasDollar) in PostVisit()
117 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
[all …]
Dtostring.cc35 virtual int PreVisit(Regexp* re, int parent_arg, bool* stop);
36 virtual int PostVisit(Regexp* re, int parent_arg, int pre_arg,
38 virtual int ShortVisit(Regexp* re, int parent_arg) { in ShortVisit() argument
61 int ToStringWalker::PreVisit(Regexp* re, int parent_arg, bool* stop) { in PreVisit() argument
65 switch (re->op()) { in PreVisit()
97 if (re->name()) { in PreVisit()
99 t_->append(*re->name()); in PreVisit()
139 int ToStringWalker::PostVisit(Regexp* re, int parent_arg, int pre_arg, in PostVisit() argument
142 switch (re->op()) { in PostVisit()
157 AppendLiteral(t_, re->rune(), re->parse_flags() & Regexp::FoldCase); in PostVisit()
[all …]
Dset.cc38 re2::Regexp* re = Regexp::Parse(pattern, pf, &status); in Add() local
39 if (re == NULL) { in Add()
50 if (re->op() == kRegexpConcat) { in Add()
51 int nsub = re->nsub(); in Add()
54 sub[i] = re->sub()[i]->Incref(); in Add()
56 re->Decref(); in Add()
57 re = re2::Regexp::Concat(sub, nsub + 1, pf); in Add()
61 sub[0] = re; in Add()
63 re = re2::Regexp::Concat(sub, 2, pf); in Add()
65 re_.push_back(re); in Add()
[all …]
/external/icu4c/test/cintltst/
Dreapits.c52 re = uregex_openC(pattern, flags, NULL, &status); \
56 uregex_setText(re, srcString, -1, &status); \
63 uregex_close(re); \
200 URegularExpression *re; in TestRegexCAPI() local
208 re = uregex_open(pat, -1, 0, 0, &status); in TestRegexCAPI()
213 uregex_close(re); in TestRegexCAPI()
217 re = uregex_open(pat, -1, in TestRegexCAPI()
221 uregex_close(re); in TestRegexCAPI()
225 re = uregex_open(pat, -1, 0x40000000, 0, &status); in TestRegexCAPI()
227 uregex_close(re); in TestRegexCAPI()
[all …]
/external/opencv/cxcore/src/
D_cxcore.h102 float re, im; member
105 CvComplex32f( float _re, float _im=0 ) : re(_re), im(_im) {} in re() function
114 double re, im; member
117 CvComplex64f( double _re, double _im=0 ) : re(_re), im(_im) {} in re() function
124 inline CvComplex32f::CvComplex32f( const CvComplex64f& v ) : re((float)v.re), im((float)v.im) {} in CvComplex32f()
125 inline CvComplex64f::CvComplex64f( const CvComplex32f& v ) : re(v.re), im(v.im) {} in CvComplex64f()
129 return CvComplex32f( a.re + b.re, a.im + b.im );
134 a.re += b.re;
141 return CvComplex32f( a.re - b.re, a.im - b.im );
146 a.re -= b.re;
[all …]
Dcxdxt.cpp357 w.re = w1.re = icvDxtTab[m][0]; in icvDFTInit()
364 w.re = w1.re = sqrt(1. - w1.im*w1.im); in icvDFTInit()
372 wave[0].re = 1.; in icvDFTInit()
377 wave[n].re = -1.; in icvDFTInit()
384 wave[n0-i].re = w.re; in icvDFTInit()
387 t = w.re*w1.re - w.im*w1.im; in icvDFTInit()
388 w.im = w.re*w1.im + w.im*w1.re; in icvDFTInit()
389 w.re = t; in icvDFTInit()
397 wave[0].re = 1.f; in icvDFTInit()
402 wave[n].re = -1.f; in icvDFTInit()
[all …]
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/RegExp/
Dproperties-001.js31 function AddRegExpCases( re, s, g, i, m, l ) { argument
33 AddTestCase( re + ".test == RegExp.prototype.test",
35 re.test == RegExp.prototype.test );
37 AddTestCase( re + ".toString == RegExp.prototype.toString",
39 re.toString == RegExp.prototype.toString );
41 AddTestCase( re + ".contructor == RegExp.prototype.constructor",
43 re.constructor == RegExp.prototype.constructor );
45 AddTestCase( re + ".compile == RegExp.prototype.compile",
47 re.compile == RegExp.prototype.compile );
49 AddTestCase( re + ".exec == RegExp.prototype.exec",
[all …]
Dproperties-002.js78 function AddRegExpCases( re, s, g, i, m, l ){ argument
80 AddTestCase( re + ".test == RegExp.prototype.test",
82 re.test == RegExp.prototype.test );
84 AddTestCase( re + ".toString == RegExp.prototype.toString",
86 re.toString == RegExp.prototype.toString );
88 AddTestCase( re + ".contructor == RegExp.prototype.constructor",
90 re.constructor == RegExp.prototype.constructor );
92 AddTestCase( re + ".compile == RegExp.prototype.compile",
94 re.compile == RegExp.prototype.compile );
96 AddTestCase( re + ".exec == RegExp.prototype.exec",
[all …]
/external/regex-re2/re2/testing/
Ddump.cc57 static void DumpRegexpAppending(Regexp* re, string* s) { in DumpRegexpAppending() argument
58 if (re->op() < 0 || re->op() >= arraysize(kOpcodeNames)) { in DumpRegexpAppending()
59 StringAppendF(s, "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 …]
Dregexp_benchmark.cc24 Regexp* re = Regexp::Parse("(\\d+)-(\\d+)-(\\d+)", Regexp::LikePerl, NULL); in Test() local
25 CHECK(re); in Test()
26 Prog* prog = re->CompileToProg(0); in Test()
37 re->Decref(); in Test()
46 Regexp* re = Regexp::Parse(regexp, Regexp::LikePerl, NULL); in MemoryUsage() local
47 CHECK(re); in MemoryUsage()
53 Prog* prog = re->CompileToProg(0); in MemoryUsage()
63 re->Decref(); in MemoryUsage()
69 PCRE re(regexp, PCRE::UTF8); in MemoryUsage() local
71 PCRE::FullMatch(text, re); in MemoryUsage()
[all …]
/external/v8/test/mjsunit/regress/
Dregress-52801.js39 var re = /a/g; variable
45 re.test(str);
46 assertEquals(5, re.lastIndex);
48 re.lastIndex = 0;
49 re.test(str);
50 assertEquals(5, re.lastIndex); // Fails if caching.
52 re.lastIndex = 0;
53 re.test(str);
54 assertEquals(5, re.lastIndex); // Fails if caching.
58 re = /a/g;
[all …]
Dregress-219.js39 function assertFlags(re, global, multiline, ignoreCase) { argument
40 var name = re + " flag: ";
41 (global ? assertTrue : assertFalse)(re.global, name + "g");
42 (multiline ? assertTrue : assertFalse)(re.multiline, name + "m");
43 (ignoreCase ? assertTrue : assertFalse)(re.ignoreCase, name + "i");
46 var re = /a/; variable
47 assertFlags(re, false, false, false)
49 re = /a/gim;
50 assertFlags(re, true, true, true)
52 re = RegExp("a","");
[all …]
/external/icu4c/data/curr/
Dsn.txt16 "Diramu re United Arab Emirates",
24 "Dora re Australia",
28 "Dhinari re Bhahareni",
32 "Furenki re Bhurundi",
36 "Pura re Botswana",
40 "Dora re Kanada",
44 "Furenki re Kongo",
48 "Furenki re Swisi",
56 "Dhora re Escudo",
60 "Furenki re Jibhuti",
[all …]
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
Djavascripttokenizer.py23 import re
65 NUMBER = re.compile(r"""
67 """ % (HEX_LITERAL, DECIMAL_LITERAL), re.VERBOSE)
74 SINGLE_QUOTE = re.compile(r"'")
75 SINGLE_QUOTE_TEXT = re.compile(r"([^'\\]|\\(.|$))+")
76 DOUBLE_QUOTE = re.compile(r'"')
77 DOUBLE_QUOTE_TEXT = re.compile(r'([^"\\]|\\(.|$))+')
79 START_SINGLE_LINE_COMMENT = re.compile(r'//')
80 END_OF_LINE_SINGLE_LINE_COMMENT = re.compile(r'//$')
82 START_DOC_COMMENT = re.compile(r'/\*\*')
[all …]
/external/chromium-trace/trace-viewer/third_party/web_dev_style/web_dev_style/
Dcss_checker.py23 re = self.input_api.re
35 return re.sub(re.compile(r'@\w+.*?{(.*{.*?})+.*?}', re.DOTALL), '\\1', s)
38 return re.sub(re.compile(r'/\*.*?\*/', re.DOTALL), '', s)
42 return re.sub(re.compile(grit_reg, re.DOTALL), '', s)
53 for rule in re.finditer(r'{(.*?)}', contents, re.DOTALL):
62 return re.search(r'(?:^|\S){|{\s*\S+\s*$', line)
67 m = re.search(r'\.(-?[_a-zA-Z0-9-]+).*[,{]\s*$', line)
74 return (line.find('}') >= 0 and re.search(r'[^ }]', line) and
75 not re.match(frame_reg, line))
78 return re.search(r'(?<!data):(?!//)\S[^;]+;\s*', line)
[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)
87 comment = re.sub(r'\\[^\s]+\s+', r'', comment)
[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/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/String/
Dmatch-003.js52 re = /([\d]{5})([-\ ]?[\d]{4})?$/g;
57 AddGlobalRegExpCases( re,
58 "re = " + re,
62 re.lastIndex = 0;
65 re,
66 "re = " + re + "; re.lastIndex = 0 ",
71 re.lastIndex = s.length;
74 re,
75 "re = " + re + "; re.lastIndex = " + s.length,
79 re.lastIndex = s.lastIndexOf("0");
[all …]
/external/v8/tools/
Djsmin.py47 import re
109 if re.match("[\"'/]", matched_text):
111 m = re.match(r"var ", matched_text)
114 var_names = re.split(r",", var_names)
116 m = re.match(r"(function\b[^(]*)\((.*)\)\{$", matched_text)
120 args = re.split(r",", args)
183 if re.match(r"'.*'$", entire_match):
185 if re.match(r'".*"$', entire_match):
187 if re.match(r"/.+/$", entire_match):
204 for line in re.split(r"\n", text):
[all …]

12345678910>>...57