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

1 2 3 4 5 6 7

  /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/google-benchmark/cmake/
gnu_posix_regex.cpp 5 regex_t re; local
6 int ec = regcomp(&re, "^[a-z]+[0-9]+$", REG_EXTENDED | REG_NOSUB);
10 return regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;
std_regex.cpp 5 std::regex re; local
6 re = std::regex("^[a-z]+[0-9]+$",
8 return std::regex_search(str, re) ? 0 : -1;
posix_regex.cpp 5 regex_t re; local
6 int ec = regcomp(&re, "^[a-z]+[0-9]+$", REG_EXTENDED | REG_NOSUB);
10 int ret = regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;
11 regfree(&re);
  /external/libcxx/utils/google-benchmark/cmake/
gnu_posix_regex.cpp 5 regex_t re; local
6 int ec = regcomp(&re, "^[a-z]+[0-9]+$", REG_EXTENDED | REG_NOSUB);
10 return regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;
std_regex.cpp 5 std::regex re; local
6 re = std::regex("^[a-z]+[0-9]+$",
8 return std::regex_search(str, re) ? 0 : -1;
posix_regex.cpp 5 regex_t re; local
6 int ec = regcomp(&re, "^[a-z]+[0-9]+$", REG_EXTENDED | REG_NOSUB);
10 int ret = regexec(&re, str.c_str(), 0, nullptr, 0) ? -1 : 0;
11 regfree(&re);
  /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, nullptr, 0));
27 ASSERT_EQ(REG_NOMATCH, regexec(&re, "foo", 0, nullptr, 0));
30 regerror(REG_NOMATCH, &re, buf, sizeof(buf));
37 regfree(&re);
41 regex_t re; local
43 ASSERT_EQ(0, regcomp(&re, "b", 0));
44 ASSERT_EQ(0, regexec(&re, "abc", 1, matches, 0));
47 regfree(&re);
51 regex_t re; local
    [all...]
  /external/clang/test/SemaCXX/
ref-init-ambiguous.cpp 22 const E2 & re(C c) { function
  /external/pcre/dist2/src/
pcre2_pattern_info.c 67 const pcre2_real_code *re = (pcre2_real_code *)code; local
110 if (re == NULL) return PCRE2_ERROR_NULL;
115 if (re->magic_number != MAGIC_NUMBER) return PCRE2_ERROR_BADMAGIC;
119 if ((re->flags & (PCRE2_CODE_UNIT_WIDTH/8)) == 0) return PCRE2_ERROR_BADMODE;
124 *((uint32_t *)where) = re->overall_options;
128 *((uint32_t *)where) = re->compile_options;
132 *((uint32_t *)where) = re->top_backref;
136 *((uint32_t *)where) = re->bsr_convention;
140 *((uint32_t *)where) = re->top_bracket;
144 *((uint32_t *)where) = re->limit_depth
271 pcre2_real_code *re = (pcre2_real_code *)code; local
    [all...]
pcre2_serialize.c 80 const pcre2_real_code *re; local
99 re = (const pcre2_real_code *)(codes[i]);
100 if (re->magic_number != MAGIC_NUMBER) return PCRE2_ERROR_BADMAGIC;
102 tables = re->tables;
103 else if (tables != re->tables)
105 total_size += re->blocksize;
129 re = (const pcre2_real_code *)(codes[i]);
130 (void)memcpy(dst_bytes, (char *)re, re->blocksize);
132 /* Certain fields in the compiled code block are re-set during
    [all...]
pcre2demo.c 71 pcre2_code *re; local
137 re = pcre2_compile(
147 if (re == NULL)
167 match_data = pcre2_match_data_create_from_pattern(re, NULL);
170 re, /* the compiled pattern */
191 pcre2_code_free(re); /* data and the compiled pattern. */
225 pcre2_code_free(re);
251 re, /* the compiled pattern */
264 re, /* the compiled pattern */
269 re, /* the compiled pattern *
    [all...]
  /cts/suite/audio_quality/lib/src/
SimpleScriptExec.cpp 47 LOGV("re match %s", match.string());
48 regex_t re; local
53 if (regcomp(&re, match.string(), cflags) != 0) {
58 if (regexec(&re, str.string(), nmatch, pmatch, 0) == 0) {
62 regfree(&re);
  /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/
TestModule.java 38 ReadElf re = ReadElf.read(mConfigExe); local
39 re.getDynamicSymbol("");
40 mDynSymArr = re.getDynSymArr();
  /development/ide/emacs/
android-compile.el 43 (defvar android-compile-ignore-re
45 "RE to match line to suppress during a compilation.
129 (while (search-forward-regexp android-compile-ignore-re end t)
152 ;; Add-hook do not re-add if already present. The compile
  /external/adhd/cras/src/server/
rate_estimator.c 35 void rate_estimator_destroy(struct rate_estimator *re)
37 if (re)
38 free(re);
45 struct rate_estimator *re; local
47 re = (struct rate_estimator *)calloc(1, sizeof(*re));
48 if (re == NULL)
51 re->window_size = *window_size;
52 re->estimated_rate = rate;
53 re->smooth_factor = smooth_factor
    [all...]
  /external/adhd/cras/src/tests/
rate_estimator_unittest.cc 17 struct rate_estimator *re; local
24 re = rate_estimator_create(10000, &window, 0.0f);
27 rc = rate_estimator_check(re, level, &t);
32 rate_estimator_add_frames(re, 5 + tmp);
37 rc = rate_estimator_check(re, level, &t);
39 EXPECT_GT(10000, rate_estimator_get_rate(re));
40 EXPECT_LT(9999, rate_estimator_get_rate(re));
42 rate_estimator_destroy(re);
46 struct rate_estimator *re; local
57 re = rate_estimator_create(7470, &window, 0.0f)
78 struct rate_estimator *re; local
109 struct rate_estimator *re; local
138 struct rate_estimator *re; local
165 struct rate_estimator *re; local
    [all...]
  /external/boringssl/src/crypto/perlasm/
x86_64-xlate.pl 105 sub re {
186 sub re {
228 sub re {
332 sub re {
374 sub re {
441 sub re {
461 if ($nasm && $self->{opcode}->mnemonic()=~m/^j(?![re]cxz)/) {
634 sub re {
714 sub re {
721 $ret = cfi_directive->re($line) and return $ret
104 sub re { subroutine
185 sub re { subroutine
227 sub re { subroutine
331 sub re { subroutine
373 sub re { subroutine
440 sub re { subroutine
633 sub re { subroutine
713 sub re { subroutine
    [all...]
  /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/http/
RouteExceptionTest.java 28 RouteException re = new RouteException(firstException); local
29 assertSame(firstException, re.getLastConnectException());
36 RouteException re = new RouteException(firstException); local
37 re.addConnectException(secondException);
38 re.addConnectException(thirdException);
40 IOException connectionIOException = re.getLastConnectException();
  /external/pcre/pcrecpp/
pcre_scanner_unittest.cc 69 const char *re = "(\\w+) = (\\d+);"; local
78 s.Consume(re, &var, &number);
87 s.Consume(re, &var, &number);
95 s.Consume(re, &var, &number);
  /external/tensorflow/tensorflow/core/kernels/
spectrogram.cc 148 const double re = fft_input_output_[2 * i]; local
151 spectrogram_slice[i] = re * re + im * im;
  /external/libopus/celt/arm/
celt_mdct_ne10.c 75 /* Temp pointers to make it really clear to the compiler what we're doing */
120 kiss_fft_scalar re, im, yr, yi; local
123 re = *yp++;
125 yr = S_MUL(re,t0) - S_MUL(im,t1);
126 yi = S_MUL(im,t0) + S_MUL(re,t1);
137 /* Temp pointers to make it really clear to the compiler what we're doing */
142 /* Temp pointers to make it really clear to the compiler what we're doing */
184 /* Temp pointers to make it really clear to the compiler what we're doing */
213 kiss_fft_scalar re, im, yr, yi; local
215 re = yp0[0]
    [all...]
  /external/libopus/celt/tests/
test_unit_dft.c 58 double re = cos(phase); local
65 re /= nfft;
69 ansr += in[k].r * re - in[k].i * im;
70 ansi += in[k].r * im + in[k].i * re;
test_unit_mdct.c 56 double re = cos(phase); local
58 re /= nfft/4;
60 ansr += in[k] * re;
86 double re = cos(phase); local
88 /*re *= 2;*/
90 ansr += in[k] * re;
  /external/pdfium/fxbarcode/oned/
BC_OnedEAN8Writer.cpp 162 FX_RECT re = matr.TransformRect(rect).GetOuterRect(); local
163 device->FillRect(&re, m_backgroundColor);
169 re = matr1.TransformRect(rect1).GetOuterRect();
170 device->FillRect(&re, m_backgroundColor);

Completed in 2411 milliseconds

1 2 3 4 5 6 7