| /external/nist-sip/java/gov/nist/core/ |
| Match.java | 28 /** Match template for pattern matching.
38 public interface Match {
39 /** Return true if a match occurs for searchString.
40 * This is used for pattern matching in the find and replace and match
45 public boolean match(String searchString); method in interface:Match
|
| GenericObject.java | 82 protected Match matchExpression; // Pattern matcher.
93 /** Set the pattern matcher. To match on the
94 * field of a sip message, set the match expression in the match template
95 * and invoke the match function. This useful because
100 * an incoming message, first parse it, and then construct a match template,
102 * match. The rules for matching are: A null object matches wild card -
103 * that is a match template of null matches any parsed SIP object.
104 * To match with any subfield, set the match template on a template objec
493 public boolean match(Object other) { method in class:GenericObject
[all...] |
| /external/v8/src/ |
| interpreter-irregexp.h | 39 static bool Match(Handle<ByteArray> code,
|
| d8.h | 78 CounterMap(): hash_map_(Match) { }
109 static bool Match(void* key1, void* key2);
|
| regexp-macro-assembler.h | 76 // check for a match with c.
82 // Check the current character for a match with a literal string. If we
83 // fail to match then goto the on_failure label. If check_eos is set then
98 // Check the current character for a match with a literal character. If we
99 // fail to match then goto the on_failure label. End of input always
107 // constant and then check for a match with c.
186 static Result Match(Handle<Code> regexp,
|
| regexp-macro-assembler.cc | 103 NativeRegExpMacroAssembler::Result NativeRegExpMacroAssembler::Match(
|
| serialize.h | 79 static bool Match(void* key1, void* key2) { return key1 == key2; }
|
| scopes.cc | 64 static bool Match(void* key1, void* key2) {
76 VariableMap::VariableMap() : HashMap(Match, &LocalsMapAllocator, 8) {}
[all...] |
| interpreter-irregexp.cc | 217 return false; // No match on backtrack stack overflow.
224 return false; // No match on backtrack stack overflow.
231 return false; // No match on backtrack stack overflow.
618 bool IrregexpInterpreter::Match(Handle<ByteArray> code_array,
|
| d8.cc | 97 bool CounterMap::Match(void* key1, void* key2) {
|
| serialize.cc | 447 : encodings_(Match) {
[all...] |
| string.js | 104 // Match ES3 and Safari
171 %_Log('regexp', 'regexp-match,%0S,%1r', [subject, regexp]);
262 var m = NUMBER_OF_CAPTURES(matchInfo) >> 1; // Includes the match.
278 } else if (peek == 38) { // $& - match
384 // There's at least one match. If the regexp is global, we have to loop
397 var match = SubString(subject, startOfMatch, previous);
399 result.add(replace.call(null, match, startOfMatch, subject));
405 // Continue with the next match.
417 // string length, there is no match
423 // Tack on the final right substring after the last match, if necessary
[all...] |
| /external/chromium/sdch/open-vcdiff/src/ |
| blockhash.h | 50 // Using (for example) kBlockSize = 4 guarantees that no match smaller
59 // match length that is guaranteed to be found in FindBestMatch(),
76 // This class is used to store the best match found by FindBestMatch()
78 class Match {
80 Match() : size_(0), source_offset_(-1), target_offset_(-1) { }
97 // The size of the best (longest) match passed to ReplaceIfBetterMatch().
100 // The source offset of the match, including the starting_offset_
101 // of the BlockHash for which the match was found.
104 // The target offset of the match. An offset of 0 corresponds to the
110 Match(const Match&); // NOLIN
[all...] |
| vcdiffengine.cc | 64 // This helper function tries to find an appropriate match within
66 // If target_hash is not NULL, this function will also look for a match
69 // If a match is found, this function will generate an ADD instruction
70 // for all unencoded data that precedes the match,
71 // and a COPY instruction for the match itself; then it returns
74 // If no appropriate match is found, the function returns 0.
87 // When FindBestMatch() comes up with a match for a candidate block,
89 // and target offset of the match.
90 BlockHash::Match best_match;
92 // First look for a match in the dictionary
[all...] |
| blockhash.cc | 240 // depending on whether an exact match was found.
281 // when the hash values of the two blocks match, it is very likely that either
282 // the blocks are identical, or else the first byte does not match.
338 // made up of spaces, there will be one match for each block in the
346 // that match the corresponding bytes to the left of target_match_start.
367 // that match the corresponding bytes starting at target_match_end.
395 Match* best_match) const {
410 // Extend match start towards beginning of unencoded data
422 // Extend match end towards end of unencoded data
432 // Update in/out parameter if the best match found was bette
[all...] |
| blockhash_test.cc | 109 // This makes testing simpler, because finding a kBlockSize-byte match
239 BlockHash::Match best_match_;
449 // The number of bytes that match between the original "we hear is fearsome"
460 // The number of bytes that match between the original "we hear is fearsome"
475 // The number of bytes that match between the original "fearsome"
487 // The number of bytes that match between the original "we hear is fearsome"
532 // for two blocks whose hash values match, and the two most important
533 // cases are: (1) the blocks are identical, or (2) none of their bytes match.
[all...] |
| /frameworks/base/media/libstagefright/matroska/ |
| mkvparser.hpp | 30 bool Match(IMkvReader*, long long&, unsigned long, long long&);
31 bool Match(IMkvReader*, long long&, unsigned long, char*&);
32 bool Match(IMkvReader*, long long&, unsigned long,unsigned char*&,
34 bool Match(IMkvReader*, long long&, unsigned long, double&);
35 bool Match(IMkvReader*, long long&, unsigned long, short&);
|
| mkvparser.cpp | 341 bool mkvparser::Match(
387 bool mkvparser::Match(
448 bool mkvparser::Match(
456 if (!Match(pReader, pos, id, str))
476 bool mkvparser::Match(
535 bool mkvparser::Match(
585 bool mkvparser::Match(
750 if (Match(pReader, pos, 0x0286, m_version))
752 else if (Match(pReader, pos, 0x02F7, m_readVersion))
754 else if (Match(pReader, pos, 0x02F2, m_maxIdLength))
[all...] |
| /cts/tests/tests/content/src/android/content/cts/ |
| IntentFilterTest.java | 189 IntentFilter filter = new Match(null, new String[] { "category1" }, null, null, null, null);
199 filter = new Match(null, new String[] { "category1", "category2" }, null, null, null, null);
217 method = "match",
223 method = "match",
229 IntentFilter filter = new Match(null, null, new String[] { "which1/what1" }, null, null,
242 filter = new Match(null, null, new String[] { "which1/what1", "which2/what2" }, null, null,
257 filter = new Match(null, null, new String[] { "which1/*" }, null, null, null);
271 filter = new Match(null, null, new String[] { "*/*" }, null, null, null);
348 IntentFilter filter = new Match(null, null, null, new String[] { "scheme1" }, null, null);
355 filter = new Match(null, null, null, new String[] { "scheme1", "scheme2" }, null, null)
[all...] |
| /external/bluetooth/glib/tests/ |
| regex-test.c | 106 g_print ("failed \t(pattern: \"%s\", compile: %d, match %d)\n",
181 gboolean match; local
185 match = g_regex_match_simple (pattern, string, compile_opts, match_opts);
186 if (match != expected)
188 g_print ("failed \t(unexpected %s)\n", match ? "match" : "mismatch");
193 verbose ("passed (%s)\n", match ? "match" : "nomatch");
217 gboolean match; local
223 match = g_regex_match_full (regex, string, string_len
274 Match *match = data; local
304 Match *match; local
323 Match *match = g_new0 (Match, 1); local
351 Match *match = l_match->data; local
1318 Match *match; local
1425 Match *match; local
[all...] |
| /external/webkit/WebCore/css/ |
| CSSSelector.h | 76 /* how the attribute value has to match.... Default is Exact */
77 enum Match {
224 mutable unsigned m_match : 4; // enum Match
|
| CSSGrammar.y | 247 %type <integer> match
1010 | '[' maybe_space attr_name match maybe_space ident_or_string maybe_space ']' {
1013 $$->m_match = (CSSSelector::Match)$4;
1024 | '[' maybe_space namespace_selector attr_name match maybe_space ident_or_string maybe_space ']' {
1030 $$->m_match = (CSSSelector::Match)$5;
1035 match: label
[all...] |
| /external/v8/src/x64/ |
| regexp-macro-assembler-x64.h | 102 static Result Match(Handle<Code> regexp,
210 // Byte size of chars in the string to match (decided by the Mode argument)
|
| /external/v8/test/cctest/ |
| test-regexp.cc | 396 const int kMaxCaptures = 1 << 16; // Must match RegExpParser::kMaxCaptures.
[all...] |
| /prebuilt/common/osgi/ |
| osgi.jar | |
