/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 | 112 RI = D.range_begin(), RE = D.range_end(); RI != RE; ++RI) { 177 StoredDiagnostic::range_iterator RI = D.range_begin(), RE = D.range_end(); 179 if (RI != RE) { 182 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/libphonenumber/java/test/com/android/i18n/phonenumbers/ |
RegionCode.java | 43 static final String RE = "RE";
|
/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/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 | 228 RE = P.ranges_end(); 230 if (RI != RE) { 234 for (; RI != RE; ++RI) 378 RE= piece->ranges_end(); RI != RE; ++RI) {
|
/external/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/llvm/utils/unittest/googletest/ |
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/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/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 470 RI = R->arg_begin(), RE = R->arg_end(); 471 LI != LE && RI != RE; ++LI, ++RI) 494 BasicBlock::iterator RE = RStart->getParent()->end(); 517 for (BasicBlock::iterator RI = RStart; RI != RE; ++RI) { 568 assert(LI != LE && RI != RE); 584 assert(RI != RE); 594 assert(RI != RE); [all...] |
/external/llvm/lib/Transforms/Scalar/ |
CodeGenPrepare.cpp | 591 // From here on out we're working with named functions. 687 BasicBlock::InstListType::reverse_iterator RE = InstList.rend(); 688 do { ++RI; } while (RI != RE && isa<DbgInfoIntrinsic>(&*RI)); 689 if (RI == RE) [all...] |
/external/llvm/lib/Object/ |
MachOObjectFile.cpp | 712 InMemoryStruct<macho::RelocationEntry> RE; 713 getRelocation(Rel, RE); 717 (RE->Word0 & macho::RF_Scattered); 720 RelAddr = RE->Word0 & 0xFFFFFF; 722 RelAddr = RE->Word0; 729 InMemoryStruct<macho::RelocationEntry> RE; 730 getRelocation(Rel, RE); 734 (RE->Word0 & macho::RF_Scattered); 736 Res = RE->Word0 & 0xFFFFFF; 738 Res = RE->Word0 [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...] |
/libcore/luni/src/test/java/libcore/java/util/ |
EnumSetTest.java | 105 HF, TA, W, RE, OS, IR, PT, AU, HG, TL, PB, BI, PO, AT, RN, FR, RA, AC, TH, PA, U, NP, PU,
|
/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/gtest/include/gtest/internal/ |
gtest-port.h | 150 // RE - a simple regular expression class using the POSIX 823 // Defines RE. 827 class GTEST_API_ RE { 831 RE(const RE& other) { Init(other.pattern()); } 833 // Constructs an RE from a string. 834 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT 838 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT 842 RE(const char* regex) { Init(regex); } // NOLINT 843 ~RE(); [all...] |
/external/llvm/utils/unittest/googletest/include/gtest/internal/ |
gtest-port.h | 151 // RE - a simple regular expression class using the POSIX 810 // Defines RE. 814 class GTEST_API_ RE { 818 RE(const RE& other) { Init(other.pattern()); } 820 // Constructs an RE from a string. 821 RE(const ::std::string& regex) { Init(regex.c_str()); } // NOLINT 825 RE(const ::string& regex) { Init(regex.c_str()); } // NOLINT 829 RE(const char* regex) { Init(regex); } // NOLINT 830 ~RE(); [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
RetainCountChecker.cpp | [all...] |
/frameworks/compile/mclinker/utils/gtest/include/ |
gtest.h | 245 // RE - a simple regular expression class using the POSIX [all...] |
/prebuilt/common/netbeans-visual/ |
org-openide-util.jar | |