/external/mesa3d/src/mesa/main/ |
H A D | APIspec.py | 107 def match(self, func, conversions={}): member in class:API 109 match = None 112 matched, conv = f.match(func, conversions) 114 match = f 116 # exact match 119 return (match, need_conv) 274 def match(self, other, conversions={}): member in class:Function 275 """Return true if the functions match, probably with a conversion."""
|
/external/nist-sip/java/gov/nist/javax/sip/address/ |
H A D | NetObject.java | 154 * object. Allows for partial match of two protocl Objects. 155 *@param other the match pattern to test against. The match object 160 *@return true if match succeeds false otherwise. 163 public boolean match(Object other) { method in class:NetObject 245 ((GenericObject) hisObj).getMatcher().match( 251 && !((GenericObject) myObj).match(hisObj)) 255 && !((GenericObjectList) myObj).match(hisObj))
|
/external/openfst/src/lib/ |
H A D | flags.cc | 114 bool match = file == src; local 115 if ((match && !in_src) || (!match && in_src))
|
H A D | fst.cc | 115 bool match = true; local 120 match = false; 123 return match;
|
/external/oprofile/libutil/ |
H A D | op_file.c | 126 * filter match, so for simplicity, we perform this match for all recursion 127 * types and logically OR the match result with the value of the passed 136 int match; local 145 match = 1; 147 match = 0; 149 switch (recursion | match) { 177 * match to the filter; if so, add it to
|
/external/regex-re2/re2/testing/ |
H A D | backtrack.cc | 58 // Explores from instruction ip at string position p looking for a match. 67 bool longest_; // whether search wants leftmost-longest match 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 229 StringPiece* match, 225 UnsafeSearchBacktrack(const StringPiece& text, const StringPiece& context, Anchor anchor, MatchKind kind, StringPiece* match, int nmatch) argument [all...] |
H A D | dfa_test.cc | 189 // which is not a match for 0[01]{n}$. Adding one more 0 is a match. 191 string match = no_match + "0"; local 209 matched = prog->SearchDFA(match, NULL, 233 // Helper thread: searches for match, which should match, 237 SearchThread(Prog* prog, const StringPiece& match, argument 239 : prog_(prog), match_(match), no_match_(no_match) {} 270 string match = no_match + "0"; local 277 SearchThread* t = new SearchThread(prog, match, no_matc 312 bool match; member in struct:re2::ReverseTest [all...] |
/external/regex-re2/util/ |
H A D | benchmark.cc | 135 static int match(const char* name, int argc, const char** argv) { function 147 if(match(b->name, argc, argv))
|
/external/skia/src/animator/ |
H A D | SkDisplayEvent.cpp | 60 bool SkDisplayEvent::contains(SkDisplayable* match) { argument 62 if (fChildren[index] == match || fChildren[index]->contains(match)) 68 SkDisplayable* SkDisplayEvent::contains(const SkString& match) { argument 71 if (child->contains(match))
|
H A D | SkDisplayList.cpp | 53 int SkDisplayList::findGroup(SkDrawable* match, SkTDDrawableArray** list, argument 58 return SearchForMatch(match, list, parent, found, grandList); 71 int SkDisplayList::SearchForMatch(SkDrawable* match, SkTDDrawableArray** list, argument 76 if (draw == match) 80 if (apply->scope == match) 82 if (apply->scope->isGroup() && SearchGroupForMatch(apply->scope, match, list, parent, found, grandList, index)) 87 if (scope == match) 93 if (draw->isGroup() && SearchGroupForMatch(draw, match, list, parent, found, grandList, index)) 100 bool SkDisplayList::SearchGroupForMatch(SkDrawable* draw, SkDrawable* match, SkTDDrawableArray** list, argument 103 if (group->getOriginal() == match) [all...] |
H A D | SkDisplayType.cpp | 529 SkDisplayTypes SkDisplayType::Find(SkAnimateMaker* maker, const SkMemberInfo* match) { argument 533 if (info == match) 554 const SkMemberInfo* match = GetMembers(maker, result, NULL); local 555 if (match == inherited) 562 SkDisplayTypes SkDisplayType::GetType(SkAnimateMaker* maker, const char match[], size_t len ) { argument 563 int index = SkStrSearch(&gTypeNames[0].fName, kTypeNamesSize, match, 569 SkDisplayTypes result = (*extraPtr)->getType(match, len);
|
/external/skia/src/core/ |
H A D | SkRecordPattern.h | 8 // First, some matchers. These match a single command in the SkRecord, 108 SK_ALWAYS_INLINE unsigned match(SkRecord* record, unsigned i) { function in class:SkRecords::Cons 110 return i == 0 ? 0 : fTail.match(record, i); 117 *end = this->match(record, *begin); 125 // Once either match or search has succeeded, access the stored data of the first, second, 133 // If head isn't a Star, try to match at i once. 144 // If head is a Star, walk i until it doesn't match. 166 unsigned match(SkRecord*, unsigned i) { return i; } function in struct:SkRecords::Nil
|
/external/skia/tests/ |
H A D | PackBitsTest.cpp | 40 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src, local 42 REPORTER_ASSERT(reporter, match); 57 bool match = memcmp(src, src2, size * sizeof(uint16_t)) == 0; local 58 REPORTER_ASSERT(reporter, match); 93 bool match = gTests[i].fCount == srcCount && local 96 REPORTER_ASSERT(reporter, match); 111 bool match = memcmp(src, src2, size * sizeof(uint8_t)) == 0; local 112 REPORTER_ASSERT(reporter, match); 121 bool match = memcmp(src, src2 + skip, write) == 0; local 122 REPORTER_ASSERT(reporter, match); [all...] |
/external/valgrind/main/tests/ |
H A D | s390x_features.c | 20 // cpu model, if specified, does not match the machine 203 unsigned long long match; local 210 match = (facilities & FAC_BIT(1)) && (facilities & FAC_BIT(2)); 212 match = facilities & FAC_BIT(0); 214 match = facilities & FAC_BIT(7); 216 match = (facilities & FAC_BIT(18)) && (facilities & FAC_BIT(19)); 218 match = facilities & FAC_BIT(21); 220 match = facilities & FAC_BIT(25); 222 match = facilities & FAC_BIT(34); 224 match [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3baserecognizer.h | 105 /// match is not found and the default implementation will also 119 void * (*match) (struct ANTLR3_BASE_RECOGNIZER_struct * recognizer, member in struct:ANTLR3_BASE_RECOGNIZER_struct 155 * To get out of recovery mode, the parser must successfully match 162 * 5. next match() will reset errorRecovery mode 175 /// an error and next valid token match 184 * be from a mismatched token that the (*match)() could not recover from.
|
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
H A D | BaseRecognizer.pm | 64 sub match { subroutine 65 Readonly my $usage => 'void match(IntStream input, int ttype, BitSet follow)'; 199 return 'required (...)+ loop did not match anything at input '
|
/external/arduino/hardware/arduino/cores/arduino/ |
H A D | WString.cpp | 247 String String::replace( const String& match, const String& replace ) argument 253 while ( (loc = temp.indexOf( match )) != -1 ) 257 temp = temp.substring( loc + match._length );
|
/external/chromium_org/athena/main/ |
H A D | url_search_provider.cc | 94 AutocompleteMatch* match, 156 const AutocompleteMatch& match) 158 match_(match) { 155 UrlSearchResult(content::BrowserContext* browser_context, const AutocompleteMatch& match) argument
|
/external/chromium_org/chrome/browser/autocomplete/ |
H A D | bookmark_provider.cc | 96 // will match against 'define' but not against 'indefinite'. 99 // exact match. 'def' will match against 'define' but 'de' will not match. 102 // - Terms enclosed in quotes comprises a phrase that must match exactly. 104 // exact order to match. 118 // match is discarded. 119 AutocompleteMatch match(BookmarkMatchToACMatch(input, fixed_up_input, *i)); 120 if (match.relevance > 0) 121 matches_.push_back(match); 148 operator ()(const query_parser::Snippet::MatchPosition& match) argument [all...] |
H A D | bookmark_provider_unittest.cc | 152 const AutocompleteMatch& match) { 157 i = match.description_class.begin(); 158 i != match.description_class.end(); ++i) { 160 // We have found the start of a match. 165 // We have found the end of a match. 171 // Record the final position if the last match goes to the end of the 174 positions.push_back(TestBookmarkPosition(start, match.description.size())); 197 // match. The count of the actual subarrays in each instance of |query_data| 199 // match position. The third index represents the |start| and |end| of the 200 // expected match' 151 PositionsFromAutocompleteMatch( const AutocompleteMatch& match) argument 454 const AutocompleteMatch& match = matches[0]; local [all...] |
H A D | shortcuts_backend.cc | 52 // Normally shortcuts have the same match type as the original match they were 53 // created from, but for certain match types, we should modify the shortcut's 123 const AutocompleteMatch& match) { 130 if (match.destination_url == it->second.match_core.destination_url) { 132 it->second.id, text, MatchToMatchCore(match, profile_), now, 138 base::GenerateGUID(), text, MatchToMatchCore(match, profile_), now, 1)); 146 ShortcutsBackend::MatchToMatchCore(const AutocompleteMatch& match, argument 148 const AutocompleteMatch::Type match_type = GetTypeForShortcut(match.type); 152 AutocompleteMatch::IsSpecializedSearchType(match 122 AddOrUpdateShortcut(const base::string16& text, const AutocompleteMatch& match) argument [all...] |
H A D | shortcuts_backend_unittest.cc | 87 AutocompleteMatch match(NULL, 0, 0, type); 88 match.destination_url = GURL(url); 89 match.contents = base::ASCIIToUTF16("test"); 90 match.contents_class = 92 match.description_class = 94 match.search_terms_args.reset( 95 new TemplateURLRef::SearchTermsArgs(match.contents)); 96 return ShortcutsBackend::MatchToMatchCore(match, &profile_); 174 // Verifies that creating MatchCores strips classifications and sanitizes match 222 AutocompleteMatch match; local [all...] |
H A D | shortcuts_provider.cc | 44 bool operator()(const AutocompleteMatch& match) const { 45 return match.destination_url == url_; 95 void ShortcutsProvider::DeleteMatch(const AutocompleteMatch& match) { argument 96 // Copy the URL since deleting from |matches_| will invalidate |match|. 97 GURL url(match.destination_url); 100 // When a user deletes a match, he probably means for the URL to disappear out 110 // NOTE: |match| is now dead! 112 // Delete the match from the history DB. This will eventually result in a 137 // completely match the search term. 190 AutocompleteMatch match; local [all...] |
/external/chromium_org/chrome/browser/browsing_data/ |
H A D | browsing_data_cookie_helper_unittest.cc | 99 std::vector<CookieExpectation>::iterator match = std::find_if( local 101 if (match != cookie_expectations_.end()) 102 match->matched_ = true; 447 // with |cookie_pair1|. The cookie-name of |cookie_pair3| must match the 451 // must match the cookie-name of |cookie_pair1| in order to add a host-only
|
/external/chromium_org/chrome/browser/extensions/api/omnibox/ |
H A D | omnibox_api.cc | 366 AutocompleteMatch* match) { 378 ACMatchClassifications& description_styles = match->contents_class; 395 match->contents.assign(description); 362 ApplyDefaultSuggestionForExtensionKeyword( Profile* profile, const TemplateURL* keyword, const base::string16& remaining_input, AutocompleteMatch* match) argument
|