| /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_org/chrome/browser/media_galleries/fileapi/ |
| media_path_filter.cc | 88 bool MediaPathFilter::Match(const base::FilePath& path) {
|
| /external/chromium_org/chrome/browser/browsing_data/ |
| browsing_data_helper_unittest.cc | 50 bool Match(const GURL& origin,
113 EXPECT_FALSE(Match(kOrigin1, kUnprotected, mock_policy.get()));
114 EXPECT_TRUE(Match(kOrigin2, kUnprotected, mock_policy.get()));
115 EXPECT_FALSE(Match(kOriginExt, kUnprotected, mock_policy.get()));
116 EXPECT_FALSE(Match(kOriginDevTools, kUnprotected, mock_policy.get()));
118 EXPECT_TRUE(Match(kOrigin1, kProtected, mock_policy.get()));
119 EXPECT_FALSE(Match(kOrigin2, kProtected, mock_policy.get()));
120 EXPECT_FALSE(Match(kOriginExt, kProtected, mock_policy.get()));
121 EXPECT_FALSE(Match(kOriginDevTools, kProtected, mock_policy.get()));
123 EXPECT_FALSE(Match(kOrigin1, kExtension, mock_policy.get()))
[all...] |
| /external/chromium_org/components/autofill/core/browser/ |
| form_field.cc | 70 const AutofillField** match) {
71 return ParseFieldSpecifics(scanner, pattern, MATCH_DEFAULT, match);
78 const AutofillField** match) {
87 return MatchAndAdvance(scanner, pattern, match_type, match);
92 const AutofillField** match) {
96 match);
114 const AutofillField** match) {
116 if (FormField::Match(field, pattern, match_type)) {
117 if (match)
118 *match = field
[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...] |
| /external/chromium_org/third_party/re2/re2/ |
| set.cc | 47 // Concatenate with match index and push on vector.
94 bool RE2::Set::Match(const StringPiece& text, vector<int>* v) const {
96 LOG(DFATAL) << "RE2::Set::Match without Compile";
104 LOG(DFATAL) << "RE2::Set::Match: DFA ran out of cache space";
109 LOG(DFATAL) << "RE2::Set::Match: match but unknown regexp set";
|
| /external/regex-re2/re2/ |
| set.cc | 47 // Concatenate with match index and push on vector.
94 bool RE2::Set::Match(const StringPiece& text, vector<int>* v) const {
96 LOG(DFATAL) << "RE2::Set::Match without Compile";
104 LOG(DFATAL) << "RE2::Set::Match: DFA ran out of cache space";
109 LOG(DFATAL) << "RE2::Set::Match: match but unknown regexp set";
|
| /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/chromium_org/components/url_matcher/ |
| regex_set_matcher.cc | 38 bool RegexSetMatcher::Match(const std::string& text,
49 // match case-sensitively.
70 substring_matcher_->Match(text, &atoms_set);
|
| /external/chromium_org/third_party/libphonenumber/src/phonenumbers/ |
| regexp_adapter_re2.cc | 121 virtual bool Match(const string& input_string,
|
| /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...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| Lexer.cs | 39 * uses simplified match() and error recovery mechanisms in the interest
109 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
137 // match() routine has already called recover()
208 public virtual void Match(string s) {
230 public virtual void Match(int c) {
294 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay(e.Character);
331 * Lexers can normally match any char in it's vocabulary after matching
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| Lexer.cs | 40 * uses simplified match() and error recovery mechanisms in the interest
127 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
166 // Match() routine has already called recover()
250 public virtual void Match( string s )
277 public virtual void Match( int c )
356 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay( e.Character );
403 * Lexers can normally match any char in it's vocabulary after matching
|
| /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_org/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_org/third_party/skia/src/pathops/ |
| SkDQuadImplicit.cpp | 92 * OPTIMIZATION -- since comparison short-circuits on no match,
96 bool SkDQuadImplicit::match(const SkDQuadImplicit& p2) const { function in class:SkDQuadImplicit
113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) {
116 return i1.match(i2);
|
| /external/chromium_org/tools/valgrind/ |
| suppressions.py | 113 regex: The actual regex used to match against scraped reports.
128 def Match(self, suppression_from_report):
132 We match our suppressions against generated suppressions
146 return self.regex.match('\n'.join(lines) + '\n') is not None
220 # * Memcheck:Unaddressable should also match Addr* reports,
221 # * Memcheck:Uninitialized should also match Cond and Value reports,
225 # * Memcheck:Addr[1248] suppressions should match Unaddressable reports,
226 # * Memcheck:Cond and Memcheck:Value[1248] should match Uninitialized.
321 elif re.match("^fun:.*|^obj:.*|^\.\.\.$", line):
391 instr: The instruction to match
[all...] |
| /external/chromium_org/v8/src/ |
| interface.cc | 35 static bool Match(void* key1, void* key2) {
93 *map = new ZoneHashMap(Match, ZoneHashMap::kDefaultHashMapCapacity,
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_suppressions.cc | 68 bool SuppressionContext::Match(const char *str, SuppressionType type,
92 // Context must not mutate once Match has been called.
|
| /external/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/skia/src/pathops/ |
| SkDQuadImplicit.cpp | 92 * OPTIMIZATION -- since comparison short-circuits on no match,
96 bool SkDQuadImplicit::match(const SkDQuadImplicit& p2) const { function in class:SkDQuadImplicit
113 bool SkDQuadImplicit::Match(const SkDQuad& quad1, const SkDQuad& quad2) {
116 return i1.match(i2);
|
| /external/v8/src/ |
| interface.cc | 35 static bool Match(void* key1, void* key2) {
88 if (*map == NULL) *map = new ZoneHashMap(Match, 8);
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/ |
| SlimLexer.cs | 128 /** <summary>Return a token from this source; i.e., match a token on the char stream.</summary> */
170 // match() routine has already called recover()
266 public void Match( string s )
293 public void Match( int c )
373 msg = "required (...)+ loop did not match anything at character " + GetCharErrorDisplay( e.Character );
420 * Lexers can normally match any char in it's vocabulary after matching
|
