/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_suppressions.h | 42 bool Match(const char* str, SuppressionType type, Suppression **s);
|
/external/regex-re2/re2/ |
set.h | 26 // it in the result of Match, or -1 if the regexp cannot be parsed. 38 // Match returns true if text matches any of the regexps in the set. 40 bool Match(const StringPiece& text, vector<int>* v) const;
|
/external/skia/src/pathops/ |
SkDQuadImplicit.h | 16 bool match(const SkDQuadImplicit& two) const; 17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
|
/external/chromium_org/components/autofill/core/browser/ |
form_field.h | 49 // By default match label and name for input/text types. 57 // success and fills |match| with a pointer to the field. 60 const AutofillField** match); 63 // as specified in the |match_type| bit field (see |MatchType|). If |match| 65 // A |true| result is returned in the case of a successful match, false 70 const AutofillField** match); 73 // on success and fills |match| with a pointer to the field. 75 const AutofillField** match); 89 FRIEND_TEST_ALL_PREFIXES(FormFieldTest, Match); 97 // Returns |true| if a match is found according to |match_type|, and |false [all...] |
/external/clang/utils/TableGen/ |
ClangCommentHTMLNamedCharacterReferenceEmitter.cpp | 70 StringMatcher::StringPair Match(Spelling, CLiteral.str()); 71 NameToUTF8.push_back(Match);
|
/external/openssh/regress/ |
addrmatch.sh | 4 tid="address match" 24 Match Address 192.168.0.0/16,!192.168.30.0/24,10.0.0.0/8,host.example.com 26 Match Address 1.1.1.1,::1,!::3,2000::/16 31 run_trial user 192.168.30.1 somehost no "deny, negative match" 32 run_trial user 19.0.0.1 somehost no "deny, no match" 40 run_trial user ::4 somehost no "deny, IP6 no match"
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
Match.java | 26 /** A match is a potential pairing of two segments with a given {@link ConstraintType}. */ 27 class Match { 37 /** the type of constraint this is a match for */ 40 /** whether this {@link Match} results in a cycle */ 43 /** The associated {@link GuidelineHander} which performed the match */ 47 * Create a new match. 49 * @param handler the handler which performed the match 52 * @param type the type of constraint this is a match for 55 public Match(GuidelineHandler handler, Segment edge, Segment with, 66 * Returns the XML constraint attribute value for this match [all...] |
GuidelineHandler.java | 147 * they only match other center edges. 153 * since they only match other center edges. 160 * which means that you can't have one match 5 pixels to the left and one match 5 164 * The best vertical match will be found in {@link #mCurrentTopMatch} or 167 protected List<Match> mHorizontalSuggestions; 172 * The best vertical match will be found in {@link #mCurrentLeftMatch} or 175 protected List<Match> mVerticalSuggestions; 178 * The current match on the left edge, or null if no match or if the left edge is no 262 Match match = matches.get(0); local 481 Match match = new Match(this, edge, draggedEdge, type, delta); local [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
DebugTreeGrammar.cs | 297 Match(input,17,Follow._17_in_stat98); 299 Match(input, TokenTypes.Down, null); 301 ID2=(CommonTree)Match(input,ID,Follow._ID_in_stat100); 309 Match(input, TokenTypes.Up, null); 322 Match(input,FUNC,Follow._FUNC_in_stat128); 324 Match(input, TokenTypes.Down, null); 391 Match(input, TokenTypes.Up, null); 520 Match(input,16,Follow._16_in_expr172); 522 Match(input, TokenTypes.Down, null); 536 Match(input, TokenTypes.Up, null); [all...] |
ProfileTreeGrammar.cs | 302 Match(input,17,Follow._17_in_stat98); 304 Match(input, TokenTypes.Down, null); 306 ID2=(CommonTree)Match(input,ID,Follow._ID_in_stat100); 314 Match(input, TokenTypes.Up, null); 327 Match(input,FUNC,Follow._FUNC_in_stat128); 329 Match(input, TokenTypes.Down, null); 396 Match(input, TokenTypes.Up, null); 525 Match(input,16,Follow._16_in_expr172); 527 Match(input, TokenTypes.Down, null); 541 Match(input, TokenTypes.Up, null); [all...] |
DebugGrammarLexer.cs | 60 Match('-'); 83 Match('%'); 106 Match('('); 129 Match(')'); 152 Match('*'); 175 Match('/'); 198 Match('+'); 221 Match('='); 375 Match('\r'); 382 Match('\n'); [all...] |
ProfileGrammarLexer.cs | 60 Match('-'); 83 Match('%'); 106 Match('('); 129 Match(')'); 152 Match('*'); 175 Match('/'); 198 Match('+'); 221 Match('='); 375 Match('\r'); 382 Match('\n'); [all...] |
/external/chromium_org/extensions/common/matcher/ |
substring_set_matcher_unittest.cc | 29 matcher.Match(test_string, &matches); 60 matcher.Match(test_string, &matches); 111 // Test non-match 140 matcher.Match("abd", &matches); 150 matcher.Match("abd", &matches); 165 matcher.Match("abd", &matches);
|
regex_set_matcher.h | 41 // Appends the IDs of regular expressions in our set that match the |text| 43 bool Match(const std::string& text, 54 // match the |text|.
|
/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_org/chrome/browser/bookmarks/ |
bookmark_index.cc | 20 // Used when finding the set of bookmarks that match a query. Each match 23 struct BookmarkIndex::Match { 28 // when we match only one term, and is filled in when we get more than one 46 BookmarkIndex::Match::nodes_begin() const { 50 BookmarkIndex::NodeSet::const_iterator BookmarkIndex::Match::nodes_end() const { 95 // We use a QueryParser to fill in match positions for us. It's not the most 135 const Match& match, 138 for (NodeSet::const_iterator i = match.nodes_begin() 179 Match match; local 191 Match match; local 214 Match* match = &((*matches)[i]); local 233 const Match& match = current_matches[i]; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/css/ |
SelectorChecker.h | 44 enum Match { SelectorMatches, SelectorFailsLocally, SelectorFailsAllSiblings, SelectorFailsCompletely }; 89 Match match(const SelectorCheckingContext&, PseudoId&, const SiblingTraversalStrategy&) const; 92 Match matchForShadowDistributed(const Element*, const SiblingTraversalStrategy&, PseudoId&, SelectorCheckingContext& nextContext) const;
|
/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/chromium_org/third_party/WebKit/Tools/Scripts/webkitruby/PrettyPatch/ |
diff.rb | 3 Match = Struct.new(:start_in_old, :start_in_new, :size) 4 class Match 39 # an empty match at the end forces the loop below to handle the unmatched tails 41 matches << Match.new(@old_words.length, @new_words.length, 0) 43 matches.each_with_index do |match, i| 44 match_starts_at_current_position_in_old = (position_in_old == match.start_in_old) 45 match_starts_at_current_position_in_new = (position_in_new == match.start_in_new) 63 position_in_old, match.start_in_old, 64 position_in_new, match.start_in_new) 67 if match.size != [all...] |
/packages/apps/Camera/jni/feature_stab/db_vlvm/ |
db_feature_matching.h | 44 /*Best match score*/ 46 /*Best match candidate*/ 71 /*Best match score*/ 73 /*Best match candidate*/ 119 * Match two sets of features. 140 void Match(const float * const *l_img,const float * const *r_img, 209 * Match two sets of features. 232 virtual void Match(const unsigned char * const *l_img,const unsigned char * const *r_img,
|
/packages/apps/Camera2/jni/feature_stab/db_vlvm/ |
db_feature_matching.h | 44 /*Best match score*/ 46 /*Best match candidate*/ 71 /*Best match score*/ 73 /*Best match candidate*/ 119 * Match two sets of features. 140 void Match(const float * const *l_img,const float * const *r_img, 209 * Match two sets of features. 232 virtual void Match(const unsigned char * const *l_img,const unsigned char * const *r_img,
|
/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
db_feature_matching.h | 44 /*Best match score*/ 46 /*Best match candidate*/ 71 /*Best match score*/ 73 /*Best match candidate*/ 119 * Match two sets of features. 140 void Match(const float * const *l_img,const float * const *r_img, 209 * Match two sets of features. 232 virtual void Match(const unsigned char * const *l_img,const unsigned char * const *r_img,
|
/art/tools/ |
cpplint.py | 302 # match those on a word boundary. 341 # Match start of assembly blocks 409 def Match(pattern, s): 411 # The regexp compilation caching is inlined in both Match and Search for 416 return _regexp_compile_cache[pattern].match(s) 712 if Match(r'T(EST|est)', self.current_function): [all...] |
/external/libvpx/libvpx/tools/ |
cpplint.py | 301 # match those on a word boundary. 340 # Match start of assembly blocks 408 def Match(pattern, s): 410 # The regexp compilation caching is inlined in both Match and Search for 415 return _regexp_compile_cache[pattern].match(s) 707 if Match(r'T(EST|est)', self.current_function): [all...] |
/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...] |