| /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/autofill/ |
| form_field_unittest.cc | 12 TEST(FormFieldTest, Match) {
15 // Empty strings match.
16 EXPECT_TRUE(FormField::Match(&field, string16(), true));
20 EXPECT_TRUE(FormField::Match(&field, string16(), true));
24 EXPECT_TRUE(FormField::Match(&field, ASCIIToUTF16("^$"), true));
26 // Strictly empty pattern does not match non-empty string.
28 EXPECT_FALSE(FormField::Match(&field, ASCIIToUTF16("^$"), true));
30 // Non-empty pattern doesn't match empty string.
32 EXPECT_FALSE(FormField::Match(&field, ASCIIToUTF16("a"), true));
36 EXPECT_TRUE(FormField::Match(&field, ASCIIToUTF16("^head"), true))
[all...] |
| /external/chromium_org/components/autofill/core/browser/ |
| form_field_unittest.cc | 14 TEST(FormFieldTest, Match) {
17 // Empty strings match.
18 EXPECT_TRUE(FormField::Match(&field, base::string16(),
23 EXPECT_TRUE(FormField::Match(&field, base::string16(),
28 EXPECT_TRUE(FormField::Match(&field, ASCIIToUTF16("^$"),
31 // Strictly empty pattern does not match non-empty string.
33 EXPECT_FALSE(FormField::Match(&field, ASCIIToUTF16("^$"),
36 // Non-empty pattern doesn't match empty string.
38 EXPECT_FALSE(FormField::Match(&field, ASCIIToUTF16("a"),
43 EXPECT_TRUE(FormField::Match(&field, ASCIIToUTF16("^head")
[all...] |
| /external/chromium_org/chrome/browser/browsing_data/ |
| browsing_data_helper_unittest.cc | 50 bool Match(const GURL& origin,
115 EXPECT_FALSE(Match(kOrigin1, kUnprotected, mock_policy.get()));
116 EXPECT_TRUE(Match(kOrigin2, kUnprotected, mock_policy.get()));
117 EXPECT_FALSE(Match(kOriginExt, kUnprotected, mock_policy.get()));
118 EXPECT_FALSE(Match(kOriginDevTools, kUnprotected, mock_policy.get()));
120 EXPECT_TRUE(Match(kOrigin1, kProtected, mock_policy.get()));
121 EXPECT_FALSE(Match(kOrigin2, kProtected, mock_policy.get()));
122 EXPECT_FALSE(Match(kOriginExt, kProtected, mock_policy.get()));
123 EXPECT_FALSE(Match(kOriginDevTools, kProtected, mock_policy.get()));
125 EXPECT_FALSE(Match(kOrigin1, kExtension, mock_policy.get()))
[all...] |
| /external/chromium_org/v8/src/ |
| interpreter-irregexp.h | 39 static RegExpImpl::IrregexpResult Match(Isolate* isolate,
|
| /external/clang/unittests/Tooling/ |
| CommentHandlerTest.cpp | 108 void Match(const char *Message, unsigned Line, unsigned Col) {
140 Verifier.Match("/* comment */", 1, 26);
152 Verifier.Match("// comment 1", 1, 13);
153 Verifier.Match("// comment 2", 3, 3);
164 Verifier.Match("// visible comment", 4, 1);
186 Verifier.Match("// visible_1", 1, 21);
187 Verifier.Match("// visible_2", 2, 21);
188 Verifier.Match("// visible_6", 6, 21);
189 Verifier.Match("// visible_7", 7, 21);
190 Verifier.Match("// visible_8", 8, 21)
[all...] |
| TestVisitor.h | 103 /// \brief Expect 'Match' *not* to occur at the given 'Line' and 'Column'.
106 void DisallowMatch(Twine Match, unsigned Line, unsigned Column) {
107 DisallowedMatches.push_back(MatchCandidate(Match, Line, Column));
110 /// \brief Expect 'Match' to occur at the given 'Line' and 'Column'.
114 void ExpectMatch(Twine Match, unsigned Line, unsigned Column) {
115 ExpectedMatches.push_back(ExpectedMatch(Match, Line, Column));
128 /// \brief Checks an actual match against expected and disallowed matches.
132 void Match(StringRef Name, SourceLocation Location) {
179 MatchCandidate const &Match) {
180 return Stream << Match.ExpectedNam
[all...] |
| RecursiveASTVisitorTest.cpp | 19 Match(TypeLocation.getType().getAsString(), TypeLocation.getBeginLoc());
27 Match(Reference->getNameInfo().getAsString(), Reference->getLocation());
35 Match(Variable->getNameAsString(), Variable->getLocStart());
44 Match(Call->getMethodDecl()->getQualifiedNameAsString(),
59 Match(OS.str(), Decl->getLocation());
70 Match(getOperatorSpelling(CE->getOperator()), CE->getExprLoc());
79 Match("", Parens->getExprLoc());
88 Match("", Lambda->getIntroducerRange().getBegin());
117 Match(Stream.str(), ArgLoc.getLocation());
128 Match("true", BE->getLocation())
[all...] |
| /external/v8/src/ |
| interpreter-irregexp.h | 39 static RegExpImpl::IrregexpResult Match(Isolate* isolate,
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| set_test.cc | 25 CHECK_EQ(s.Match("foobar", &v), true);
31 CHECK_EQ(s.Match("fooba", &v), true);
36 CHECK_EQ(s.Match("oobar", &v), true);
51 CHECK_EQ(s.Match("foobar", &v), true);
57 CHECK_EQ(s.Match("obarfoobaroo", &v), true);
63 CHECK_EQ(s.Match("fooba", &v), true);
68 CHECK_EQ(s.Match("oobar", &v), false);
79 CHECK_EQ(s.Match("foo", &v), true);
94 CHECK_EQ(s.Match("foobar", &v), false);
97 CHECK_EQ(s.Match("fooba", &v), false)
[all...] |
| /external/chromium_org/tools/heapcheck/ |
| suppressions.py | 74 def Match(self, report):
84 if self._re.match('\n'.join(report) + '\n'):
144 """Tests the Suppression.Match() capabilities."""
149 assert not empty.Match([])
150 assert not empty.Match(['foo', 'bar'])
152 assert asterisk.Match(['foobar', 'foobaz'])
153 assert not asterisk.Match(['foobaz', 'foobar'])
155 assert ellipsis.Match(['foo', 'bar'])
156 assert ellipsis.Match(['bar', 'baz', 'foo'])
157 assert not ellipsis.Match(['bar', 'baz', 'bah']
[all...] |
| /external/regex-re2/re2/testing/ |
| set_test.cc | 25 CHECK_EQ(s.Match("foobar", &v), true);
31 CHECK_EQ(s.Match("fooba", &v), true);
36 CHECK_EQ(s.Match("oobar", &v), true);
51 CHECK_EQ(s.Match("foobar", &v), true);
57 CHECK_EQ(s.Match("obarfoobaroo", &v), true);
63 CHECK_EQ(s.Match("fooba", &v), true);
68 CHECK_EQ(s.Match("oobar", &v), false);
79 CHECK_EQ(s.Match("foo", &v), true);
94 CHECK_EQ(s.Match("foobar", &v), false);
97 CHECK_EQ(s.Match("fooba", &v), false)
[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_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/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/history/ |
| 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_org/chrome/browser/media_galleries/fileapi/ |
| media_path_filter.h | 25 bool Match(const base::FilePath& path);
|
| /external/chromium_org/extensions/common/matcher/ |
| regex_set_matcher_unittest.cc | 28 matcher.Match("http://abracadabra.com", &result1);
34 matcher.Match("https://abfffffffffffffffffffffffffffffff.fi/cf", &result2);
40 matcher.Match("http://nothing.com/", &result3);
54 matcher.Match("http://aaa.net/", &result1);
58 matcher.Match("http://aaa.net/quaaACK", &result2);
|
| /external/chromium_org/third_party/libphonenumber/src/phonenumbers/ |
| regexp_adapter.h | 48 // phonenumberutil.cc. Consume(), Match() and Replace() methods must be
55 // matched, false otherwise, advances position in the match.
57 // anchor_at_start - if true, match would be successful only if it appears at
59 // matched_string1 - the first string extracted from the match. Can be NULL.
60 // matched_string2 - the second string extracted from the match. Can be NULL.
61 // matched_string3 - the third string extracted from the match. Can be NULL.
68 // Helper methods calling the Consume method that assume the match must start
92 // Helper method calling the Consume method that assumes the match can start
102 // full_match - if true, match would be successful only if it matches the
104 // matched_string - the string extracted from the match. Can be NULL
[all...] |
| /external/clang/utils/TableGen/ |
| ClangCommentHTMLTagsEmitter.cpp | 50 StringMatcher::StringPair Match(Spelling, "return true;");
52 MatchesEndTagOptional.push_back(Match);
54 MatchesEndTagForbidden.push_back(Match);
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_suppressions.cc | 105 if (g_ctx->Match(frame->func, stype, &s) ||
106 g_ctx->Match(frame->file, stype, &s) ||
107 g_ctx->Match(frame->module, stype, &s)) {
126 if (g_ctx->Match(loc->name, stype, &s) ||
127 g_ctx->Match(loc->file, stype, &s) ||
128 g_ctx->Match(loc->module, stype, &s)) {
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_index.h | 58 struct Match;
59 typedef std::vector<Match> Matches;
71 // Extracts BookmarkNodes from |match| and retrieves typed counts for each
76 const Match& match,
99 // Iterates over |matches| updating each Match's nodes to contain the
100 // intersection of the Match's current nodes and the nodes at |index_i|.
101 // If the intersection is empty, the Match is removed.
108 // Match's nodes and the nodes at |index_i|. If the intersection between the
109 // two is non-empty, a new match is added to |result|
[all...] |
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_index.h | 56 struct Match;
57 typedef std::vector<Match> Matches;
69 // Extracts BookmarkNodes from |match| and retrieves typed counts for each
74 const Match& match,
97 // Iterates over |matches| updating each Match's nodes to contain the
98 // intersection of the Match's current nodes and the nodes at |index_i|.
99 // If the intersection is empty, the Match is removed.
106 // Match's nodes and the nodes at |index_i|. If the intersection between the
107 // two is non-empty, a new match is added to |result|
[all...] |
| /external/chromium_org/third_party/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/chromium_org/third_party/skia/src/pathops/ |
| SkDQuadImplicit.h | 16 bool match(const SkDQuadImplicit& two) const;
17 static bool Match(const SkDQuad& quad1, const SkDQuad& quad2);
|
