Searched defs:re (Results 226 - 250 of 1081) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/test/
H A Drunner.py25 import re namespace
32 _test_description = re.compile("(\w+) \(([\w.]+)\)")
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/w3c/
H A Dtest_parser.py31 import re namespace
134 return bool(self.test_doc.find(src=re.compile('[\'\"/]?/resources/testharness')))
143 elements_with_src_attributes = doc.findAll(src=re.compile('.*'))
144 elements_with_href_attributes = doc.findAll(href=re.compile('.*'))
146 url_pattern = re.compile('url\(.*\)')
149 url = re.search(url_pattern, url)
150 url = re.sub('url\([\'\"]?', '', url.group(0))
151 url = re.sub('[\'\"]?\)', '', url)
/external/chromium_org/third_party/binutils/
H A Ddownload.py14 import re namespace
42 gyp_host_arch = re.search(
/external/chromium_org/third_party/closure_compiler/
H A Dprocessor.py8 import re namespace
85 match = re.search(self._INCLUDE_REG, current_line[2])
93 self._lines[i] = line[:2] + (re.sub(self._IF_TAGS_REG, "", line[2]),)
/external/chromium_org/third_party/closure_linter/closure_linter/common/
H A Dfiletestcase.py26 import re namespace
40 _EXPECTED_RE = re.compile(r'\s*//\s*(?:(?P<line>[+-]?[0-9]+):)?'
H A Dsimplefileflags.py24 import re namespace
149 ignore_dirs_regexs.append(re.compile(r'(^|[\\/])%s[\\/]' % ignore))
/external/chromium_org/third_party/icu/source/tools/
H A Dicu-svnprops-check.py27 import re namespace
100 if re.match("\s*(#.*)?$", propline): # Match comment and blank lines
102 if re.match("\s*\[auto-props\]", propline): # Match the [auto-props] line.
104 if not re.match("\s*[^\s]+\s*=", propline): # minimal syntax check for <file-type> =
120 string_proplist = re.split("(?<!;);(?!;)", string_proplist)
221 if re.match(file_pattern, f):
/external/chromium_org/third_party/markdown/extensions/
H A Dadmonition.py45 rST suggests the following `types`, but you're free to use whatever you want:
80 import re namespace
99 RE = re.compile(r'(?:^|\n)!!!\ ?([\w\-]+)(?:\ "(.*?)")?')
H A Dfenced_code.py113 import re namespace
116 FENCED_BLOCK_RE = re.compile( \
118 re.MULTILINE|re.DOTALL
H A Dmeta.py78 import re namespace
81 META_RE = re.compile(r'^[ ]{0,3}(?P<key>[A-Za-z0-9_-]+):\s*(?P<value>.*)')
82 META_MORE_RE = re.compile(r'^[ ]{4,}(?P<value>.*)')
H A Dsane_lists.py57 import re namespace
62 CHILD_RE = re.compile(r'^[ ]{0,3}((\d+\.))[ ]+(.*)')
68 CHILD_RE = re.compile(r'^[ ]{0,3}(([*+-]))[ ]+(.*)')
H A Dwikilinks.py116 import re namespace
120 clean_label = re.sub(r'([ ]+_)|(_[ ]+)|([ ]+)', '_', label)
/external/chromium_org/third_party/markdown/
H A Dpostprocessors.py47 import re namespace
110 m = re.match(r'^\<\/?([^ >]+)', html)
130 RE = re.compile('%s(\d+)%s' % (util.STX, util.ETX))
/external/chromium_org/third_party/mesa/src/scons/
H A Dllvm.py32 import re namespace
76 llvm_version_re = re.compile(r'^#define PACKAGE_VERSION "([^"]*)"')
159 # automatically link agains LIBCMT. When we're doing a
/external/chromium_org/third_party/re2/re2/
H A Dmimics_pcre.cc31 // 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) { argument
50 // Called after visiting each of re's children and accumulating
53 bool PCREWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg, argument
61 switch (re->op()) {
66 if (CanBeEmptyString(re->sub()[0]))
70 if (re->max() == -1 && CanBeEmptyString(re
120 ShortVisit(Regexp* re, bool a) argument
134 PostVisit(Regexp* re, bool parent_arg, bool pre_arg, bool* child_args, int nchild_args) argument
180 CanBeEmptyString(Regexp* re) argument
[all...]
H A Dunicode.py8 import re namespace
114 match = re.match("<(.*), (First|Last)>", s)
135 processing the file. When done with the file, the reader re-raises
/external/chromium_org/third_party/re2/re2/testing/
H A Dcompile_test.cc108 Regexp* re = Regexp::Parse(t.regexp, Regexp::PerlX|Regexp::Latin1, NULL); local
109 if (re == NULL) {
114 Prog* prog = re->CompileToProg(0);
117 re->Decref();
121 CHECK(re->CompileToProg(1) == NULL);
130 re->Decref();
159 Regexp* re = Regexp::Parse(".", Regexp::PerlX, NULL); local
160 EXPECT_TRUE(re != NULL);
161 Prog* prog = re->CompileToProg(0);
168 re
[all...]
H A Ddump.cc57 static void DumpRegexpAppending(Regexp* re, string* s) { argument
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
[all...]
H A Dnull_walker.cc16 bool PostVisit(Regexp* re, bool parent_arg, bool pre_arg,
19 bool ShortVisit(Regexp* re, bool a) { argument
29 // Called after visiting re's children. child_args contains the return
33 bool NullWalker::PostVisit(Regexp* re, bool parent_arg, bool pre_arg, argument
38 // Returns whether re can match an empty string.
H A Drequired_prefix_test.cc46 Regexp* re = Regexp::Parse(t.regexp, flags, NULL); local
47 CHECK(re) << " " << t.regexp;
51 CHECK_EQ(t.return_value, re->RequiredPrefix(&p, &f, &s))
52 << " " << t.regexp << " " << (j==0 ? "latin1" : "utf") << " " << re->Dump();
62 re->Decref();
/external/chromium_org/third_party/skia/experimental/benchtools/
H A Dgreenify.py23 import re namespace
33 EXCEPTION_RE_COMPILED = re.compile(EXCEPTION_RE)
/external/chromium_org/third_party/skia/gm/
H A Dcopy_config.py30 import re namespace
36 IMAGE_FILENAME_RE = re.compile(gm_json.IMAGE_FILENAME_PATTERN)
79 regex = re.compile(self._args.builder_name_pattern)
H A Drename_config.py30 import re namespace
36 IMAGE_FILENAME_RE = re.compile(gm_json.IMAGE_FILENAME_PATTERN)
79 regex = re.compile(self._args.builder_name_pattern)
/external/chromium_org/third_party/skia/platform_tools/android/bin/
H A Dadb_list_devices.py11 import re namespace
43 match = re.search(search_str, output)
/external/chromium_org/third_party/skia/tools/
H A Dbuildbot_globals.py14 import re namespace

Completed in 495 milliseconds

1234567891011>>