HomeSort by relevance Sort by last modified time
    Searched refs:re (Results 1 - 25 of 1775) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/libxml2/python/tests/
regexp.py 7 re = libxml2.regexpCompile("a|b") variable
8 if re.regexpExec("a") != 1:
11 if re.regexpExec("b") != 1:
14 if re.regexpExec("ab") != 0:
17 if re.regexpExec("") != 0:
20 if re.regexpIsDeterminist() != 1:
23 del re
  /external/pcre/dist/
pcre_refcount.c 82 REAL_PCRE *re = (REAL_PCRE *)argument_re; local
83 if (re == NULL) return PCRE_ERROR_NULL;
84 if (re->magic_number != MAGIC_NUMBER) return PCRE_ERROR_BADMAGIC;
85 if ((re->flags & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
86 re->ref_count = (-adjust > re->ref_count)? 0 :
87 (adjust + re->ref_count > 65535)? 65535 :
88 re->ref_count + adjust;
89 return re->ref_count;
pcre_fullinfo.c 82 const REAL_PCRE *re = (const REAL_PCRE *)argument_re; local
85 if (re == NULL || where == NULL) return PCRE_ERROR_NULL;
95 if (re->magic_number != MAGIC_NUMBER)
96 return re->magic_number == REVERSED_MAGIC_NUMBER?
101 if ((re->flags & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
106 *((unsigned long int *)where) = re->options & PUBLIC_COMPILE_OPTIONS;
110 *((size_t *)where) = re->size;
130 *((int *)where) = re->top_bracket;
134 *((int *)where) = re->top_backref;
139 ((re->flags & PCRE_FIRSTSET) != 0)? (int)re->first_char
    [all...]
pcre_byte_order.c 109 REAL_PCRE *re = (REAL_PCRE *)argument_re; local
120 if (re == NULL) return PCRE_ERROR_NULL;
121 if (re->magic_number == MAGIC_NUMBER)
123 if ((re->flags & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
124 re->tables = tables;
128 if (re->magic_number != REVERSED_MAGIC_NUMBER) return PCRE_ERROR_BADMAGIC;
129 if ((swap_uint32(re->flags) & PCRE_MODE) == 0) return PCRE_ERROR_BADMODE;
131 re->magic_number = MAGIC_NUMBER;
132 re->size = swap_uint32(re->size)
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
sre.py 2 It will be removed in the future. sre was moved to re in version 2.5.
6 warnings.warn("The sre module is deprecated, please import re.", namespace
9 from re import *
10 from re import __all__
13 from re import _compile
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
sre.py 2 It will be removed in the future. sre was moved to re in version 2.5.
6 warnings.warn("The sre module is deprecated, please import re.", namespace
9 from re import *
10 from re import __all__
13 from re import _compile
  /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...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_re.py 3 import re namespace
4 from re import Scanner
12 # Misc tests from Tim Peters' re.doc
15 # what you're doing. Some of these tests were carefully modeled to
24 x = re.compile('ab+c')
29 self.assertEqual(re.search('x*', 'axx').span(0), (0, 0))
30 self.assertEqual(re.search('x*', 'axx').span(), (0, 0))
31 self.assertEqual(re.search('x+', 'axx').span(0), (1, 3))
32 self.assertEqual(re.search('x+', 'axx').span(), (1, 3))
33 self.assertEqual(re.search('x', 'aaa'), None
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_re.py 3 import re namespace
4 from re import Scanner
12 # Misc tests from Tim Peters' re.doc
15 # what you're doing. Some of these tests were carefully modeled to
24 x = re.compile('ab+c')
29 self.assertEqual(re.search('x*', 'axx').span(0), (0, 0))
30 self.assertEqual(re.search('x*', 'axx').span(), (0, 0))
31 self.assertEqual(re.search('x+', 'axx').span(0), (1, 3))
32 self.assertEqual(re.search('x+', 'axx').span(), (1, 3))
33 self.assertEqual(re.search('x', 'aaa'), None
    [all...]
  /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/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...]
  /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...]
  /external/libcxx/test/std/re/re.alg/re.alg.match/
basic.fail.cpp 32 std::regex re{"*"};
33 std::regex_match(std::string("abcde"), m, re);
lookahead_capture.pass.cpp 30 std::regex re("^(?=(.))a$");
31 assert(re.mark_count() == 1);
35 assert(std::regex_match(s, m, re));
42 std::regex re("^(a)(?=(.))(b)$");
43 assert(re.mark_count() == 3);
47 assert(std::regex_match(s, m, re));
56 std::regex re("^(.)(?=(.)(?=.(.)))(...)$");
57 assert(re.mark_count() == 4);
61 assert(std::regex_match(s, m, re));
71 std::regex re("^(a)(?!([^b]))(.c)$")
    [all...]
  /external/libcxx/test/std/re/re.alg/re.alg.search/
basic.fail.cpp 32 std::regex re{"*"};
33 std::regex_search(std::string("abcde"), m, re);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.match/
basic.fail.cpp 34 std::regex re{"*"};
35 std::regex_match(std::string("abcde"), m, re);
lookahead_capture.pass.cpp 30 std::regex re{"^(?=(.))a$"};
31 assert(re.mark_count() == 1);
35 assert(std::regex_match(s, m, re));
42 std::regex re{"^(a)(?=(.))(b)$"};
43 assert(re.mark_count() == 3);
47 assert(std::regex_match(s, m, re));
56 std::regex re{"^(.)(?=(.)(?=.(.)))(...)$"};
57 assert(re.mark_count() == 4);
61 assert(std::regex_match(s, m, re));
71 std::regex re{"^(a)(?!([^b]))(.c)$"}
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/re/re.alg/re.alg.search/
basic.fail.cpp 34 std::regex re{"*"};
35 std::regex_search(std::string("abcde"), m, re);
  /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/tracing/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/chromium-trace/trace-viewer/tracing/build/
css_presubmit_checker.py 5 import re namespace
27 return re.sub(re.compile(r'@\w+.*?{(.*{.*?})+.*?}', re.DOTALL), '\\1', s)
30 return re.sub(re.compile(r'/\*.*?\*/', re.DOTALL), '', s)
34 return re.sub(re.compile(grit_reg, re.DOTALL), '', s
    [all...]
  /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/http/
RouteExceptionTest.java 31 RouteException re = new RouteException(firstException); local
32 assertSame(firstException, re.getLastConnectException());
39 RouteException re = new RouteException(firstException); local
40 re.addConnectException(secondException);
41 re.addConnectException(thirdException);
43 IOException connectionIOException = re.getLastConnectException();

Completed in 2367 milliseconds

1 2 3 4 5 6 7 8 91011>>