HomeSort by relevance Sort by last modified time
    Searched defs:match (Results 276 - 300 of 2151) sorted by null

<<11121314151617181920>>

  /tools/loganalysis/src/com/android/loganalysis/parser/
DmesgParser.java 167 Matcher match = null; local
168 if ((match = matches(START_SERVICE, line)) != null) {
170 serviceItem.setServiceName(match.group(SERVICENAME));
172 match.group(TIMESTAMP)) * 1000));
173 getServiceInfoItems().put(match.group(SERVICENAME), serviceItem);
175 } else if ((match = matches(EXIT_SERVICE, line)) != null) {
176 if (getServiceInfoItems().containsKey(match.group(SERVICENAME))) {
178 match.group(SERVICENAME));
180 match.group(TIMESTAMP)) * 1000));
198 Matcher match = null local
227 Matcher match = null; local
    [all...]
  /bionic/libc/kernel/uapi/linux/netfilter/
xt_policy.h 55 struct xt_policy_spec match; member in struct:xt_policy_elem
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/
re.py 26 regular expressions; they simply match themselves. You can
35 Greedy means that it will match as many repetitions as possible.
44 "|" A|B, creates an RE that will match either A or B.
53 (?!...) Matches if ... doesn't match next.
61 resulting RE will match the second character.
72 With LOCALE, it will match the set [0-9_] plus characters defined
78 match Match a regular expression pattern to the beginning of a string.
84 finditer Return an iterator yielding a match object for each match.
138 def match(pattern, string, flags=0): function
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/
fixer_base.py 40 keep_line_order = False # For the bottom matcher: match with the
65 self.{pattern,PATTERN} in .match().
80 def match(self, node): member in class:BaseFix
81 """Returns match for a given parse tree node.
90 return self.pattern.match(node, results) and results
97 results: a dict mapping symbolic names to part of the match.
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/
re.py 26 regular expressions; they simply match themselves. You can
35 Greedy means that it will match as many repetitions as possible.
44 "|" A|B, creates an RE that will match either A or B.
53 (?!...) Matches if ... doesn't match next.
61 resulting RE will match the second character.
72 With LOCALE, it will match the set [0-9_] plus characters defined
78 match Match a regular expression pattern to the beginning of a string.
84 finditer Return an iterator yielding a match object for each match.
134 def match(pattern, string, flags=0): function
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/rexpr/
rexpr.c 14 * first-search is performed on the NFA (graph) to check for a match of 's'.
38 * * means match 0 or more times (can be on expression or atom)
39 * + means match 1 or more times (can be on expression or atom)
48 * match 1 or more lower-case letters (e.g. variable)
51 * match a hex number with 0x on front (e.g. 0xA1FF)
54 * match a floating point number (e.g. 3.14e21)
136 result = match(nfa.left, s);
149 static int match(NodePtr automaton,char *s) function
151 static int match(automaton, s)
158 if ( automaton == accept && *s == '\0' ) return 1; /* match */
    [all...]
  /external/ImageMagick/MagickCore/
token.c 339 match;
492 match=MagickTrue;
495 (match != MagickFalse))
499 match=(GetUTFCode(pattern) == GetUTFCode(p)) ? MagickTrue :
506 match=MagickFalse;
511 if (match != MagickFalse)
577 match=(GetUTFCode(expression) == 0) && (GetUTFCode(pattern) == 0) ?
579 return(match);
333 match; local
  /external/aac/libDRCdec/src/
drcDec_tools.cpp 170 int c, n, g, match, idx; local
183 match = 0;
190 match = 1;
195 if (match == 0) {
215 match = 0;
222 match = 1;
227 if (match == 0) {
242 match = 0;
246 match = 1;
251 if (match == 0)
    [all...]
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/
BaseRecognizer.js 92 /** Match current input symbol against ttype. Attempt
103 * @param {org.antlr.runtime.IntStream} input input stream to match against.
104 * @param {Number} ttype input type to match.
109 match: function(input, ttype, follow) {
126 * Match any token.
127 * @param {org.antlr.runtime.IntStream} input input stream to match against.
137 * @param {org.antlr.runtime.IntStream} input input stream to match against.
148 * @param {org.antlr.runtime.IntStream} input input stream to match against.
187 * @param {org.antlr.runtime.IntStream} input input stream to match against.
188 * @param {Number} ttype input type to match
90 }, method in class:org.antlr.runtime.BaseRecognizer
    [all...]
  /external/apache-http/src/org/apache/http/auth/
AuthScope.java 196 * Tests if the authentication scopes match.
198 * @return the match factor. Negative value signifies no match.
199 * Non-negative signifies a match. The greater the returned value
200 * the closer the match.
202 public int match(final AuthScope that) { method in class:AuthScope
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cert/
AttributeCertificateHolder.java 283 public boolean match(Object obj) method in class:AttributeCertificateHolder
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/x509/
AttributeCertificateHolder.java 328 public boolean match(Certificate cert) method in class:AttributeCertificateHolder
411 public boolean match(Object obj) method in class:AttributeCertificateHolder
418 return match((Certificate)obj);
  /external/clang/include/clang/ASTMatchers/
ASTMatchFinder.h 11 // over the AST and invokes a given callback on every match.
14 // subtree match on the AST. Next, a callback that is executed every time the
19 // the match or construct changes that can be applied to the code.
59 /// that will trigger the callbacks specified via addMatcher(...) when a match
71 /// \brief Contains all information for a given match.
73 /// Every time a match is found, the MatchFinder will invoke the registered
74 /// MatchCallback with a MatchResult containing information about the match.
78 /// \brief Contains the nodes bound on the current match.
90 /// \brief Called when the Match registered for it was successfully found
96 /// \brief Called on every match by the \c MatchFinder
183 template <typename T> void match(const T &Node, ASTContext &Context) { function in class:clang::ast_matchers::MatchFinder
281 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, function in namespace:clang::ast_matchers
292 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) { function in namespace:clang::ast_matchers
298 match(MatcherT Matcher, ASTContext &Context) { function in namespace:clang::ast_matchers
    [all...]
  /external/e2fsprogs/lib/ext2fs/
tst_badblocks.c 124 int i, match, ok; local
127 match = ext2fs_badblocks_list_test(bb, vec[i]);
128 if (match == vec[i+1])
135 match ? "present" : "absent",
142 int i, match; local
148 match = ext2fs_badblocks_list_test(bb, vec[i]);
150 match ? "present" : "absent");
151 if (!match) {
158 match = ext2fs_badblocks_list_test(bb, vec[i]);
162 if (match) {
    [all...]
  /external/eigen/Eigen/src/Core/
Ref.h 29 template<typename Derived> struct match { struct in struct:Eigen::internal::traits
150 * In the const case, if the input expression does not match the above requirement, then it is evaluated into a temporary before being passed to the function.
197 typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0);
207 typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0)
209 EIGEN_STATIC_ASSERT(bool(Traits::template match<Derived>::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH);
214 typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0)
222 EIGEN_STATIC_ASSERT(bool(Traits::template match<Derived>::MatchAtCompileTime), STORAGE_LAYOUT_DOES_NOT_MATCH);
243 typename internal::enable_if<bool(Traits::template match<Derived>::ScalarTypeMatch),Derived>::type* = 0)
248 construct(expr.derived(), typename Traits::template match<Derived>::type());
257 construct(other.derived(), typename Traits::template match<OtherRef>::type())
    [all...]
  /external/eigen/bench/tensors/
benchmark_main.cc 103 // see if any of our benchmarks match.
110 int match = regexec(&re, name_, 0, NULL, 0); local
112 if (match != REG_NOMATCH) {
  /external/elfutils/tests/
funcscopes.c 113 bool match; local
115 match = fnmatch (*argv, name, 0) == 0;
116 while (!match && *++argv);
117 if (!match)
  /external/icu/android_icu4j/src/main/java/android/icu/text/
CharsetRecog_mbcs.java 17 * Match is determined mostly by the input data adhering to the
38 * Test the match of this charset with the input text data
45 * bits 0-7: the match confidence, ranging from 0-100
47 * bits 8-15: The match reason, an enum-like value.
49 int match(CharsetDetector det, int [] commonChars) { method in class:CharsetRecog_mbcs
103 // No match if there are too many characters that don't fit the encoding scheme.
227 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_sjis
228 int confidence = match(det, commonChars);
296 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_big5
297 int confidence = match(det, commonChars)
411 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_euc.CharsetRecog_euc_jp
449 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_euc.CharsetRecog_euc_kr
550 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_gb_18030
    [all...]
  /external/icu/icu4c/source/i18n/
rbt_rule.cpp 219 * set, or otherwise can match multiple keys, the index value is -1.
224 // match any key.
239 * then it will match any key.
243 // If there is neither then we match any key; return true.
332 * Attempt a match and replacement at the given position. Return
333 * the degree of match between this rule and the given text. The
334 * degree of match may be mismatch, a partial match, or a full
335 * match. A mismatch means at least one character of the text
336 * does not match the context or key. A partial match means som
389 UMatchDegree match; local
    [all...]
  /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/
IntDiffer.java 24 * @param matchCount The number of items that have to be the same to count as a match
60 * Checks for initial & final match.
87 int match = find(a, aCount-EQUALSIZE, aCount, b, maxSame, bCount); local
88 if (match != -1) {
90 bTop = match;
93 match = find(b, bCount-EQUALSIZE, bCount, a, maxSame, aCount);
94 if (match != -1) {
96 aTop = match;
118 return i; // we have a match!
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
CharsetRecog_mbcs.java 16 * Match is determined mostly by the input data adhering to the
37 * Test the match of this charset with the input text data
44 * bits 0-7: the match confidence, ranging from 0-100
46 * bits 8-15: The match reason, an enum-like value.
48 int match(CharsetDetector det, int [] commonChars) { method in class:CharsetRecog_mbcs
102 // No match if there are too many characters that don't fit the encoding scheme.
226 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_sjis
227 int confidence = match(det, commonChars);
295 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_big5
296 int confidence = match(det, commonChars)
410 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_euc.CharsetRecog_euc_jp
448 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_euc.CharsetRecog_euc_kr
549 CharsetMatch match(CharsetDetector det) { method in class:CharsetRecog_mbcs.CharsetRecog_gb_18030
    [all...]
  /external/iptables/extensions/
libip6t_icmp6.c 85 "icmpv6 match options:\n"
86 "[!] --icmpv6-type typename match icmpv6 type\n"
101 unsigned int match = limit; local
107 if (match != limit)
112 icmpv6_codes[match].name,
114 match = i;
118 if (match != limit) {
119 *type = icmpv6_codes[match].type;
120 code[0] = icmpv6_codes[match].code_min;
121 code[1] = icmpv6_codes[match].code_max
    [all...]
libip6t_mh.c 66 "mh match options:\n"
67 "[!] --mh-type type[:type] match mh type\n");
82 unsigned int match = limit; local
88 if (match == limit || len == namelen)
89 match = i;
93 if (match != limit) {
94 return mh_names[match].type;
175 static void mh_print(const void *ip, const struct xt_entry_match *match,
178 const struct ip6t_mh *mhinfo = (struct ip6t_mh *)match->data;
189 static void mh_save(const void *ip, const struct xt_entry_match *match)
    [all...]
libipt_icmp.c 105 "icmp match options:\n"
106 "[!] --icmp-type typename match icmp type\n"
121 unsigned int match = limit; local
127 if (match != limit)
132 icmp_codes[match].name,
134 match = i;
138 if (match != limit) {
139 *type = icmp_codes[match].type;
140 code[0] = icmp_codes[match].code_min;
141 code[1] = icmp_codes[match].code_max
    [all...]
  /external/iptables/include/linux/netfilter/
xt_policy.h 48 struct xt_policy_spec match; member in struct:xt_policy_elem

Completed in 1359 milliseconds

<<11121314151617181920>>