| /external/markdown/markdown/extensions/ |
| def_list.py | 22 import markdown, re namespace
29 RE = re.compile(r'(^|\n)[ ]{0,3}:[ ]{1,3}(.*?)(\n|$)')
32 return bool(self.RE.search(block))
36 m = self.RE.search(block)
|
| /external/clang/lib/ARCMigrate/ |
| PlistReporter.cpp | 114 RI = D.range_begin(), RE = D.range_end(); RI != RE; ++RI) {
179 StoredDiagnostic::range_iterator RI = D.range_begin(), RE = D.range_end();
181 if (RI != RE) {
184 for (; RI != RE; ++RI)
|
| /external/markdown/markdown/ |
| preprocessors.py | 10 import re namespace
194 RE = re.compile(r'^(\ ?\ ?\ ?)\[([^\]]*)\]:\s*([^ ]*)(.*)$', re.DOTALL)
199 m = self.RE.match(line)
|
| blockprocessors.py | 15 import re namespace
116 INDENT_RE = re.compile(r'^(([ ]{%s})+)'% markdown.TAB_LENGTH)
167 # We're in a tightlist - so we already are at correct parent.
170 # We're in a looselist - so we need to find parent.
180 # No more child levels. If we're short of indent_level,
219 RE = re.compile(r'(^|\n)[ ]{0,3}>[ ]?(.*)')
222 return bool(self.RE.search(block))
226 m = self.RE.search(block)
246 m = self.RE.match(line
[all...] |
| /external/llvm/tools/macho-dump/ |
| macho-dump.cpp | 98 InMemoryStruct<macho::RelocationEntry> RE;
99 Obj.ReadRelocationEntry(RelocationTableOffset, i, RE);
100 if (!RE) {
106 outs() << " (('word-0', " << format("0x%x", RE->Word0) << "),\n";
107 outs() << " ('word-1', " << format("0x%x", RE->Word1) << ")),\n";
|
| /external/llvm/lib/ExecutionEngine/RuntimeDyld/ |
| RuntimeDyldMachO.cpp | 149 // FIXME: For the time being, we're only loading text segments.
156 // Index of all the names, in this section or not. Used when we're
216 InMemoryStruct<macho::RelocationEntry> RE;
217 Obj->ReadRelocationEntry(Sect->RelocationTableOffset, j, RE);
218 if (RE->Word0 & macho::RF_Scattered)
223 uint32_t Offset = RE->Word0;
240 bool isExtern = (RE->Word1 >> 27) & 1;
253 uint32_t SourceNum = RE->Word1 & 0xffffff; // 24-bit value
262 RE->Word1,
266 << format("0x%x", RE->Word1) << ")\n")
[all...] |
| /external/protobuf/gtest/src/ |
| gtest-port.cc | 109 // Implements RE. Currently only needed for death tests.
111 RE::~RE() {
117 // Returns true iff regular expression re matches the entire str.
118 bool RE::FullMatch(const char* str, const RE& re) {
119 if (!re.is_valid_) return false;
122 return regexec(&re.full_regex_, str, 1, &match, 0) == 0;
125 // Returns true iff regular expression re matches a substring of st
[all...] |
| /external/chromium/sdch/open-vcdiff/src/gtest/ |
| gtest-port.cc | 50 // Implements RE. Currently only needed for death tests.
52 RE::~RE() {
57 // Returns true iff str contains regular expression re.
58 bool RE::PartialMatch(const char* str, const RE& re) {
59 if (!re.is_valid_) return false;
62 return regexec(&re.regex_, str, 1, &match, 0) == 0;
65 // Initializes an RE from its string representation
[all...] |
| /external/chromium/testing/gtest/src/ |
| gtest-port.cc | 113 // Implements RE. Currently only needed for death tests.
115 RE::~RE() {
127 // Returns true iff regular expression re matches the entire str.
128 bool RE::FullMatch(const char* str, const RE& re) {
129 if (!re.is_valid_) return false;
132 return regexec(&re.full_regex_, str, 1, &match, 0) == 0;
135 // Returns true iff regular expression re matches a substring of st
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| PlistDiagnostics.cpp | 255 RE = P.ranges_end();
257 if (RI != RE) {
261 for (; RI != RE; ++RI)
376 RE=I->ranges_end(); RI!=RE; ++RI) {
|
| CFRefCount.cpp | 707 RetainSummary* getPersistentSummary(RetEffect RE,
710 return getPersistentSummary(getArgEffects(), RE, ReceiverEff, DefaultEff);
[all...] |
| /external/llvm/utils/unittest/googletest/ |
| gtest-port.cc | 111 // Implements RE. Currently only needed for death tests.
113 RE::~RE() {
125 // Returns true iff regular expression re matches the entire str.
126 bool RE::FullMatch(const char* str, const RE& re) {
127 if (!re.is_valid_) return false;
130 return regexec(&re.full_regex_, str, 1, &match, 0) == 0;
133 // Returns true iff regular expression re matches a substring of st
[all...] |
| /external/pcre/ |
| pcrecpp.h | 36 // C++ interface to the pcre regular-expression library. RE supports
64 // pcrecpp::RE re("h.*o");
65 // re.FullMatch("hello");
68 // pcrecpp::RE re("e");
69 // !re.FullMatch("hello");
71 // Example: creating a temporary RE object:
72 // pcrecpp::RE("h.*o").FullMatch("hello");
77 // You can, as in the different examples above, store the RE objec
[all...] |
| pcrecpp.cc | 58 Arg RE::no_arg((void*)NULL);
62 // RE class. This works on GCC >= 3, at least. It definitely works
82 void RE::Init(const string& pat, const RE_Options* options) {
99 void RE::Cleanup() {
106 RE::~RE() {
111 pcre* RE::Compile(Anchor anchor) {
130 pcre* re; local
132 re = pcre_compile(pattern_.c_str(), pcre_options,
135 // Tack a '\z' at the end of RE. Parenthesize it first so tha
509 pcre* re = (anchor == ANCHOR_BOTH) ? re_full_ : re_partial_; local
[all...] |
| /external/chromium/sdch/open-vcdiff/src/gtest/internal/ |
| gtest-port.h | 96 // RE - a simple regular expression class using the POSIX
331 // Defines RE. Currently only needed for death tests.
335 class RE {
337 // Constructs an RE from a string.
339 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT
343 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT
346 RE(const char* regex) { Init(regex); } // NOLINT
347 ~RE();
352 // Returns true iff str contains regular expression re.
357 static bool PartialMatch(const ::std::string& str, const RE& re)
[all...] |
| /external/gtest/src/ |
| gtest-port.cc | 78 // Implements RE. Currently only needed for death tests.
80 RE::~RE() {
86 // Returns true iff regular expression re matches the entire str.
87 bool RE::FullMatch(const char* str, const RE& re) {
88 if (!re.is_valid_) return false;
91 return regexec(&re.full_regex_, str, 1, &match, 0) == 0;
94 // Returns true iff regular expression re matches a substring of st
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 86 // If R is out of bounds, we're done after this in any case.
88 // If L is also out of bounds, we're done immediately.
175 /// Unifies two instructions, given that they're known not to have
198 BasicBlock::iterator RI = R->begin(), RE = R->end();
203 assert(LI != LE && RI != RE);
466 RI = R->arg_begin(), RE = R->arg_end();
467 LI != LE && RI != RE; ++LI, ++RI)
490 BasicBlock::iterator RE = RStart->getParent()->end();
513 for (BasicBlock::iterator RI = RStart; RI != RE; ++RI) {
564 assert(LI != LE && RI != RE);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| CodeGenPrepare.cpp | 551 // From here on out we're working with named functions.
663 BasicBlock::InstListType::reverse_iterator RE = InstList.rend();
664 do { ++RI; } while (RI != RE && isa<DbgInfoIntrinsic>(&*RI));
665 if (RI == RE)
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprAgg.cpp | 199 // If Dest is ignored, then we're evaluating an aggregate expression
442 const ObjCPropertyRefExpr *RE = LHS.getPropertyRefExpr();
443 QualType ArgType = RE->getSetterArgType();
740 // using the filler expression. We can skip this if the we're
783 // Leave the loop if we're done.
850 // We're done once we hit the flexible array member.
858 // We're done if we reach the end of the explicit initializers, we
[all...] |
| /external/gtest/include/gtest/internal/ |
| gtest-port.h | 119 // RE - a simple regular expression class using the POSIX
524 // Defines RE.
528 class RE {
530 // Constructs an RE from a string.
532 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT
536 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT
539 RE(const char* regex) { Init(regex); } // NOLINT
540 ~RE();
545 // FullMatch(str, re) returns true iff regular expression re matche
[all...] |
| /external/protobuf/gtest/include/gtest/internal/ |
| gtest-port.h | 128 // RE - a simple regular expression class using the POSIX
618 // Defines RE.
622 class RE {
624 // Constructs an RE from a string.
626 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT
630 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT
633 RE(const char* regex) { Init(regex); } // NOLINT
634 ~RE();
639 // FullMatch(str, re) returns true iff regular expression re matche
[all...] |
| /external/chromium/testing/gtest/include/gtest/internal/ |
| gtest-port.h | 147 // RE - a simple regular expression class using the POSIX
789 // Defines RE.
793 class GTEST_API_ RE {
797 RE(const RE& other) { Init(other.pattern()); }
799 // Constructs an RE from a string.
800 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT
804 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT
808 RE(const char* regex) { Init(regex); } // NOLINT
809 ~RE();
[all...] |
| /external/libphonenumber/java/test/com/android/i18n/phonenumbers/ |
| PhoneNumberUtilTest.java | 47 // Set up some test numbers to re-use.
122 static final String RE = "RE";
[all...] |
| /external/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-port.h | 138 // RE - a simple regular expression class using the POSIX
659 // Defines RE.
663 class GTEST_API_ RE {
667 RE(const RE& other) { Init(other.pattern()); }
669 // Constructs an RE from a string.
670 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT
673 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT
676 RE(const char* regex) { Init(regex); } // NOLINT
677 ~RE();
[all...] |
| /external/llvm/lib/Target/ARM/AsmParser/ |
| ARMAsmParser.cpp | [all...] |
