| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/RegExp/ |
| constructor-001.js | 27 var re = new RegExp();
32 re.__proto__
39 re.getClassProperty() );
44 re.source );
49 re.global );
54 re.ignoreCase );
59 re.multiline );
64 re.lastIndex );
|
| function-001.js | 27 var re = new RegExp();
32 re.__proto__
39 re.getClassProperty() );
44 re.source );
49 re.global );
54 re.ignoreCase );
59 re.multiline );
64 re.lastIndex );
|
| properties-001.js | 31 function AddRegExpCases( re, s, g, i, m, l ) {
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...] |
| properties-002.js | 78 function AddRegExpCases( re, s, g, i, m, l ){
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...] |
| /bionic/tests/ |
| regex_test.cpp | 24 regex_t re; local
25 ASSERT_EQ(0, regcomp(&re, "ab*c", 0));
26 ASSERT_EQ(0, regexec(&re, "abbbc", 0, NULL, 0));
27 ASSERT_EQ(REG_NOMATCH, regexec(&re, "foo", 0, NULL, 0));
30 regerror(REG_NOMATCH, &re, buf, sizeof(buf));
37 regfree(&re);
|
| /libcore/luni/src/test/java/libcore/java/lang/ |
| OldRuntimeExceptionTest.java | 27 RuntimeException re = new RuntimeException(message, npe); local
28 assertEquals(message, re.getMessage());
29 assertEquals(npe, re.getCause());
31 re = new RuntimeException(null, npe);
32 assertNull(re.getMessage());
34 re = new RuntimeException(message, null);
35 assertNull(re.getCause());
40 RuntimeException re = new RuntimeException(npe); local
41 assertEquals(npe, re.getCause());
43 re = new RuntimeException((Throwable) null)
[all...] |
| /external/regex-re2/re2/testing/ |
| dump.cc | 57 static void DumpRegexpAppending(Regexp* re, string* s) {
58 if (re->op() < 0 || re->op() >= arraysize(kOpcodeNames)) {
59 StringAppendF(s, "op%d", re->op());
61 switch (re->op()) {
68 if (re->parse_flags() & Regexp::NonGreedy)
72 s->append(kOpcodeNames[re->op()]);
73 if (re->op() == kRegexpLiteral && (re->parse_flags() & Regexp::FoldCase)) {
74 Rune r = re->rune()
[all...] |
| null_walker.cc | 16 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
19 bool ShortVisit(Regexp* re, bool a) {
29 // Called after visiting re's children. child_args contains the return
33 bool NullWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
38 // Returns whether re can match an empty string.
|
| mimics_pcre_test.cc | 66 Regexp* re = Regexp::Parse(t.regexp, flags, NULL); local
67 CHECK(re) << " " << t.regexp;
68 CHECK_EQ(t.should_match, re->MimicsPCRE())
71 re->Decref();
|
| /external/protobuf/vsprojects/ |
| convert2008to2005.sh | 11 sed -i -re 's/Format Version 10.00/Format Version 9.00/g;
17 sed -i -re 's/Version="9.00"/Version="8.00"/g;' $file
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/String/ |
| match-003.js | 52 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
[all...] |
| /external/v8/test/mjsunit/ |
| regexp.js | 39 var re = new RegExp(s);
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 lin
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| bug-regex16.c | 14 struct re_pattern_buffer re; local
19 memset (&re, 0, sizeof (re));
20 s = re_compile_pattern ("[[.invalid_collating_symbol.]]", 30, &re);
26 s = re_compile_pattern ("[[=invalid_equivalence_class=]]", 31, &re);
32 s = re_compile_pattern ("[[:invalid_character_class:]]", 29, &re);
|
| bug-regex21.c | 33 regex_t re; local
43 if (regcomp (&re, "X-.+:.+Y=\".*\\.(A|B|C|D|E|F|G|H|I",
50 regfree (&re);
|
| /external/regex-re2/re2/ |
| mimics_pcre.cc | 31 // Returns whether re might match an empty string.
32 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) {
50 // Called after visiting each of re's children and accumulating
53 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
61 switch (re->op()) {
66 if (CanBeEmptyString(re->sub()[0]))
70 if (re->max() == -1 && CanBeEmptyString(re->sub()[0])
[all...] |
| simplify.cc | 5 // Rewrite POSIX and other features in re
21 Regexp* re = Parse(src, flags, status); local
22 if (re == NULL)
24 Regexp* sre = re->Simplify();
25 re->Decref();
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);
122 // Simplifies the expression re{min,max} in terms of *, +, and ?
299 Regexp* re = new Regexp(kRegexpConcat, parse_flags); local
[all...] |
| set.cc | 38 re2::Regexp* re = Regexp::Parse(pattern, pf, &status); local
39 if (re == NULL) {
50 if (re->op() == kRegexpConcat) {
51 int nsub = re->nsub();
54 sub[i] = re->sub()[i]->Incref();
56 re->Decref();
57 re = re2::Regexp::Concat(sub, nsub + 1, pf);
61 sub[0] = re;
63 re = re2::Regexp::Concat(sub, 2, pf);
65 re_.push_back(re);
78 re2::Regexp* re = re2::Regexp::Alternate(const_cast<re2::Regexp**>(&re_[0]), local
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| regress-24712.js | 33 var re = /([\S]+([ \t]+[\S]+)*)[ \t]*=[ \t]*[\S]+/;
34 var result = re.exec("Course_Creator = Test");
|
| /external/opencv/cxcore/src/ |
| _cxcore.h | 102 float re, im; member in struct:CvComplex32f
105 CvComplex32f( float _re, float _im=0 ) : re(_re), im(_im) {}
107 //CvComplex32f( const CvComplex32f& v ) : re(v.re), im(v.im) {}
108 //CvComplex32f& operator = (const CvComplex32f& v ) { re = v.re; im = v.im; return *this; }
114 double re, im; member in struct:CvComplex64f
117 CvComplex64f( double _re, double _im=0 ) : re(_re), im(_im) {}
119 //CvComplex64f( const CvComplex64f& v ) : re(v.re), im(v.im) {
[all...] |
| /external/chromium-trace/trace-viewer/third_party/web_dev_style/web_dev_style/ |
| css_checker.py | 10 we're checking against here.
23 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
[all...] |
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| javascripttokenizer.py | 23 import re namespace
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/icu4c/test/cintltst/ |
| reapits.c | 47 * 're" is the compiled, ready-to-go regular expression.
52 re = uregex_openC(pattern, flags, NULL, &status); \
56 uregex_setText(re, srcString, -1, &status); \
63 uregex_close(re); \
200 URegularExpression *re; local
208 re = uregex_open(pat, -1, 0, 0, &status);
213 uregex_close(re);
217 re = uregex_open(pat, -1,
221 uregex_close(re);
225 re = uregex_open(pat, -1, 0x40000000, 0, &status)
1402 URegularExpression *re; local
2209 URegularExpression *re; local
2248 URegularExpression *re; local
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t060leftrecursion.py | 2 import re namespace
23 # def recover(self, input, re):
44 # build_ast = re.search(r'output\s*=\s*AST', grammar)
|
| /external/clang/docs/tools/ |
| dump_ast_matchers.py | 7 import re namespace
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)
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/regexp/ |
| RegExp_lastIndex.js | 42 // re=/x./g; re.lastIndex=4; re.exec('xyabcdxa');
43 re=/x./g;
44 re.lastIndex=4;
45 testcases[count++] = new TestCase ( SECTION, "re=/x./g; re.lastIndex=4; re.exec('xyabcdxa')",
46 '["xa"]', String(re.exec('xyabcdxa')));
48 // re.lastInde
[all...] |
