HomeSort by relevance Sort by last modified time
    Searched refs:match (Results 1176 - 1200 of 3045) sorted by null

<<41424344454647484950>>

  /external/kernel-headers/original/linux/
transport_class.h 49 .match = mtch, \
  /external/llvm/lib/Transforms/Utils/
SpecialCaseList.cpp 47 bool match(StringRef Query) const { function in struct:llvm::SpecialCaseList::Entry
48 return Strings.count(Query) || (RegEx && RegEx->match(Query));
205 if (II->getValue().match(Query)) {
222 return II->getValue().match(Query);
  /external/markdown/markdown/extensions/
abbr.py 51 m = ABBR_REF_RE.match(line)
63 Given a string, returns an regex pattern to match that string.
67 Note: we force each char as a literal match (in brackets) as we don't
  /external/nist-sip/java/gov/nist/javax/sip/header/
Event.java 128 * @param matchTarget -- event header to match against.
130 public boolean match(Event matchTarget) { method in class:Event
  /external/nist-sip/java/gov/nist/javax/sip/parser/
RequestLineParser.java 67 lexer.match('\n');
UserAgentParser.java 107 this.lexer.match(TokenTypes.SLASH);
  /external/nist-sip/java/gov/nist/javax/sip/parser/ims/
PChargingVectorParser.java 81 this.lexer.match(';');
  /external/oprofile/libpp/
locate_images.cpp 75 extra_images::matcher match(name);
76 return find(match);
81 extra_images::find(extra_images::matcher const & match) const
89 if (match(cit->first))
191 // multiple match error.
locate_images.h 45 /// default functor allowing trivial match
52 * return a vector of all directories that match the functor
54 std::vector<std::string> const find(matcher const & match) const;
56 /// return a vector of all directories that match the given name
  /external/oprofile/libutil++/
path_filter.cpp 22 bool path_filter::match(string const & str) const function in class:path_filter
  /external/oprofile/libutil++/tests/
path_filter_tests.cpp 20 if (filter.match(str) != result) { \
73 // dirname("foo") == "." so all relative path input match a "."
string_filter_tests.cpp 20 if (filter.match(str) != result) { \
  /external/protobuf/python/
ez_setup.py 260 match = re.search("\nmd5_data = {\n([^}]+)}", src)
261 if not match:
265 src = src[:match.start(1)] + repl + src[match.end(1):]
  /external/regex-re2/re2/
bitstate.cc 53 bool longest_; // whether search wants leftmost-longest match
54 bool endmatch_; // whether match must end at text.end()
201 // One opcode is byte range; the other leads to match.
203 // out1 is the match
209 // out is the match - non-greedy
259 // VLOG(0) << "Found match.";
260 // We found a match. If the caller doesn't care
261 // where the match is, no point going further.
265 // Record best match so far.
276 // If going for first match, we're done
    [all...]
prog.h 52 kInstAltMatch, // Alt: out_ is [00-FF] and back, out1_ is match; or vice versa.
56 kInstMatch, // found a match!
58 kInstFail, // never match; occasionally unavoidable
113 // Does this inst (an kInstByteRange) match c?
154 // Match ID to identify this match (for re2::Set).
175 kUnanchored, // match anywhere
176 kAnchored, // match only starting at beginning of text
179 // Kind of match to look for (for anchor != kFullMatch)
182 // match but still makes its submatch choices the wa
    [all...]
  /external/regex-re2/re2/testing/
backtrack.cc 58 // Explores from instruction ip at string position p looking for a match.
67 bool longest_; // whether search wants leftmost-longest match
140 if (Visit(prog_->start(), p)) // Match must be leftmost; done.
146 // Explores from instruction ip at string position p looking for a match.
150 // either it didn't match or it did but we're hoping for a better match.
160 // have to explore in hope of finishing a match. Use impossible byte -1.
207 // We found a match. If it's the best so far, record the
212 if (submatch_[0].data() == NULL || // First match so far ...
213 (longest_ && p > submatch_[0].end())) { // ... or better match
    [all...]
  /external/smack/src/org/jivesoftware/smack/
ChatManager.java 198 * JID map first, the try to match on the base JID if no match is
205 Chat match = jidChats.get(userJID); local
207 if (match == null) {
208 match = baseJidChats.get(StringUtils.parseBareAddress(userJID));
210 return match;
  /external/wpa_supplicant_8/wpa_supplicant/utils/
log2pcap.py 41 m = frame_re.match(line)
  /packages/apps/Dialer/src/com/android/dialer/dialpad/
SmartDialNameMatcher.java 42 // The maximum length of the initial we will match - typically set to 1 to minimize false
66 * Constructs empty highlight mask. Bit 0 at a position means there is no match, Bit 1 means
67 * there is a match and should be highlighted in the TextView.
78 * Replaces the 0-bit at a position with 1-bit, indicating that there is a match.
80 * @param matchPos Match Positions to mask as 1.
122 * @return {@literal null} if the number and the query don't match, a valid
165 * @return {@literal null} if the number and the query don't match, a valid
178 * @return {@literal null} if the number and the query don't match, a valid
190 * @param offset - The position in the number to start the match against (used to ignore
192 * @return {@literal null} if the number and the query don't match, a vali
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/data/
ClusterSource.java 61 int matchType = mMatcher.match(path);
SnailSource.java 42 switch (mMatcher.match(path)) {
  /packages/providers/ContactsProvider/tests/src/com/android/providers/contacts/util/
TypedUriMatcherImplTest.java 92 assertEquals(expectedType, mTypedUriMatcherImpl.match(Uri.parse(uri)));
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter/
x_tables.h 22 struct xt_match *match; member in struct:xt_entry_match::__anon37641::__anon37643
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter/
x_tables.h 22 struct xt_match *match; member in struct:xt_entry_match::__anon39232::__anon39234
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter/
x_tables.h 22 struct xt_match *match; member in struct:xt_entry_match::__anon40746::__anon40748

Completed in 1280 milliseconds

<<41424344454647484950>>