| /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
|
| /external/chromium/chrome/browser/history/ |
| text_database.cc | 29 // url URL of the page so searches will match the URL.
61 TextDatabase::Match::Match() {}
63 TextDatabase::Match::~Match() {}
248 // First get all rows that match. Selecing on time (which has an index) allows
250 // generally be only one match per time).
304 std::vector<Match>* results,
312 "WHERE pages MATCH ? AND time >= ? AND time < ? "
344 Match& match = results->at(results->size() - 1) local
[all...] |
| text_database.h | 30 struct Match {
31 Match();
32 ~Match();
34 // URL of the match.
49 // Snippet of the match we generated from the body.
137 std::vector<Match>* results,
|
| /external/chromium/webkit/glue/ |
| regular_expression_unittest.cc | 17 struct Match {
25 const Match* matches,
30 EXPECT_EQ(matches[i].matchPosition, regex.match(
47 EXPECT_EQ(0, regex.match("the quick brown fox"));
48 EXPECT_EQ(1, regex.match(" the quick brown fox"));
49 EXPECT_EQ(3, regex.match("foothe quick brown foxbar"));
51 EXPECT_EQ(-1, regex.match("The quick brown FOX"));
52 EXPECT_EQ(-1, regex.match("the quick brown fo"));
66 const Match matches[] = {
88 const Match matches[] =
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| AddrModeMatcher.h | 81 /// Match - Find the maximal addressing mode that a load/store of V can fold,
84 static ExtAddrMode Match(Value *V, Type *AccessTy,
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 24 /** A match is a potential pairing of two segments with a given {@link ConstraintType}. */
25 class Match {
35 /** the type of constraint this is a match for */
38 /** whether this {@link Match} results in a cycle */
41 /** The associated {@link GuidelineHander} which performed the match */
45 * Create a new match.
47 * @param handler the handler which performed the match
50 * @param type the type of constraint this is a match for
53 public Match(GuidelineHandler handler, Segment edge, Segment with,
64 * Returns the XML constraint attribute value for this match
[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...] |
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_index.cc | 19 // Used when finding the set of bookmarks that match a query. Each match
22 struct BookmarkIndex::Match {
27 // when we match only one term, and is filled in when we get more than one
45 BookmarkIndex::Match::nodes_begin() const {
49 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const {
93 // We use a QueryParser to fill in match positions for us. It's not the most
127 const Match& match,
130 for (NodeSet::const_iterator i = match.nodes_begin()
171 Match match; local
183 Match match; local
206 Match* match = &((*matches)[i]); local
225 const Match& match = current_matches[i]; local
[all...] |
| /external/chromium/chrome/browser/renderer_host/ |
| gtk_key_bindings_handler.cc | 28 bool GtkKeyBindingsHandler::Match(const NativeWebKeyboardEvent& wke,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.cpp | 95 bool Match = true;
102 Match = false;
104 Match = false;
113 Match = false;
132 MatchReg &= Match;
697 "#operands for dag node doesn't match .td file!");
[all...] |
| /external/v8/src/ |
| serialize.h | 79 static bool Match(void* key1, void* key2) { return key1 == key2; }
|
| 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.
628 bool IrregexpInterpreter::Match(Isolate* isolate,
|
| regexp-macro-assembler.cc | 104 NativeRegExpMacroAssembler::Result NativeRegExpMacroAssembler::Match(
|
| scopes.cc | 69 static bool Match(void* key1, void* key2) {
81 VariableMap::VariableMap() : HashMap(Match, &LocalsMapAllocator, 8) {}
[all...] |
| d8.cc | 99 bool CounterMap::Match(void* key1, void* key2) {
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| messagequeue.h | 128 inline bool Match(MessageHandler* handler, uint32 id) const {
|
| /external/chromium/chrome/browser/autofill/ |
| form_field.cc | 83 UBool match = matcher.find(0, status); local
85 return !!match;
125 bool FormField::Match(AutofillField* field,
208 if (Match(field, pattern, match_label_only)) {
269 // then we will match an element only if it is in the standard.
|
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 95 // Returns true on match.
96 virtual bool Match(const std::string &S) = 0;
121 virtual bool Match(const std::string &S) {
141 virtual bool Match(const std::string &S) {
142 return Regex.match(S);
433 if (D.Match(RightText))
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZISelDAGToDAG.cpp | 198 bool Match = (is12Bit ?
201 if (Match) {
387 // Check, whether we can match stuff using 20-bit displacements
479 // Check, whether we can match stuff using 20-bit displacements
|
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 1 //===- FileCheck.cpp - Check that File's Contents match what is expected --===//
59 /// FixedStr - If non-empty, this pattern is a fixed string match with the
84 /// Match - Match the pattern string against the input buffer Buffer. This
85 /// returns the position that is matched or npos if there is no match. If
86 /// there is a match, the size of the matched string is returned in MatchLen.
89 /// variables and is updated if this match defines new values.
90 size_t Match(StringRef Buffer, size_t &MatchLen,
93 /// PrintFailureInfo - Print additional information about a failure to match
104 /// should correspond to a perfect match
[all...] |
| /external/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| atom.c | 270 * Match() - See if a hash table entry is matches a string.
274 static int Match(HashTable *htable, StringTable *stable, const char *s, int hashloc)
284 } // Match
413 if (Match(&atable->htable, &atable->stable, s, hashloc))
421 if (Match(&atable->htable, &atable->stable, s, hashloc)) {
|
| /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/chromium/chrome/browser/ |
| enumerate_modules_model_win.cc | 300 ModuleEnumerator::ModuleStatus ModuleEnumerator::Match(
318 // We have a name match against the blacklist (and possibly location match
338 // At this point, the names match and there is no version specified
339 // or the versions also match.
346 // If signatures match (or both are empty), then we have a winner.
350 // If descriptions match (or both are empty) and the locations match, then
351 // we also have a confirmed match.
619 // Match this module against the blacklist
[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/webkit/Source/WebCore/css/ |
| CSSSelector.h | 89 /* how the attribute value has to match.... Default is Exact */
90 enum Match {
272 mutable unsigned m_match : 4; // enum Match
|
