| /external/chromium/third_party/libjingle/source/talk/session/phone/ |
| codec.cc | 35 bool AudioCodec::Matches(int payload, const std::string& nm) const {
40 bool AudioCodec::Matches(const AudioCodec& codec) const {
47 return Matches(codec.id, codec.name) &&
61 bool VideoCodec::Matches(int payload, const std::string& nm) const {
66 bool VideoCodec::Matches(const VideoCodec& codec) const {
68 return Matches(codec.id, codec.name);
|
| cryptoparams.h | 42 bool Matches(const CryptoParams& params) const {
|
| /external/clang/utils/TableGen/ |
| ClangCommentCommandInfoEmitter.cpp | 54 std::vector<StringMatcher::StringPair> Matches;
60 Matches.push_back(StringMatcher::StringPair(Name, Return));
65 StringMatcher("Name", Matches, OS).Emit();
|
| ClangCommentHTMLTagsEmitter.cpp | 24 std::vector<StringMatcher::StringPair> Matches;
29 Matches.push_back(StringMatcher::StringPair(Spelling, "return true;"));
35 StringMatcher("Name", Matches, OS).Emit();
|
| ClangAttrEmitter.cpp | [all...] |
| /external/llvm/include/llvm/TableGen/ |
| StringMatcher.h | 29 /// not exit this code fragment. If nothing matches, execution falls through.
36 const std::vector<StringPair> &Matches;
41 const std::vector<StringPair> &matches, raw_ostream &os)
42 : StrVariableName(strVariableName), Matches(matches), OS(os) {}
48 bool EmitStringMatcherForChar(const std::vector<const StringPair*> &Matches,
|
| /external/llvm/unittests/Support/ |
| RegexTest.cpp | 27 SmallVector<StringRef, 1> Matches;
29 EXPECT_TRUE(r2.match("aa216b", &Matches));
30 EXPECT_EQ(1u, Matches.size());
31 EXPECT_EQ("216", Matches[0].str());
34 EXPECT_TRUE(r3.match("9a:513b", &Matches));
35 EXPECT_EQ(3u, Matches.size());
36 EXPECT_EQ("9a:513", Matches[0].str());
37 EXPECT_EQ("a", Matches[1].str());
38 EXPECT_EQ("513", Matches[2].str());
40 EXPECT_TRUE(r3.match("9:513b", &Matches));
[all...] |
| /external/easymock/src/org/easymock/internal/matchers/ |
| Matches.java | 22 public class Matches implements IArgumentMatcher, Serializable {
28 public Matches(String regex) {
32 public boolean matches(Object actual) {
method in class:Matches
33 return (actual instanceof String) && ((String) actual).matches(regex);
37 buffer.append("matches(\"" + regex.replaceAll("\\\\", "\\\\\\\\")
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_index.h | 59 typedef std::vector<Match> Matches;
62 // Used to sort Matches in decreasing order of typed count.
66 // Extracts |matches.nodes| into NodeTypedCountPairs and sorts the pairs in
68 void SortMatches(const Matches& matches,
80 // count so that the best matches will always be added to the results.
86 // Add |node| to |results| if the node matches the query.
92 // Populates |matches| for the specified term. If |first_term| is true, this
97 Matches* matches);
[all...] |
| /external/chromium/chrome/browser/content_settings/ |
| content_settings_pattern.cc | 26 // - [*.]domain.tld (matches domain.tld and all sub-domains)
27 // - host (matches an exact hostname)
28 // - a.b.c.d (matches an exact IPv4 ip)
29 // - [a:b:c:d:e:f:g:h] (matches an exact IPv6 ip)
68 bool ContentSettingsPattern::Matches(const GURL& url) const {
|
| /external/chromium/net/proxy/ |
| proxy_config_service_common_unittest.cc | 18 // Helper to verify that |expected_proxy| matches |actual_proxy|. If it does
72 ::testing::AssertionResult ProxyRulesExpectation::Matches(
|
| proxy_bypass_rules.cc | 27 virtual bool Matches(const GURL& url) const {
63 virtual bool Matches(const GURL& url) const {
95 virtual bool Matches(const GURL& url) const {
169 bool ProxyBypassRules::Matches(const GURL& url) const {
171 if ((*it)->Matches(url))
|
| /external/llvm/lib/Support/ |
| Regex.cpp | 50 /// matches it contains.
55 bool Regex::match(StringRef String, SmallVectorImpl<StringRef> *Matches){
56 unsigned nmatch = Matches ? preg->re_nsub+1 : 0;
76 if (Matches) { // match position requested
77 Matches->clear();
82 Matches->push_back(StringRef());
86 Matches->push_back(StringRef(String.data()+pm[i].rm_so,
96 SmallVector<StringRef, 8> Matches;
102 if (!match(String, &Matches))
107 std::string Res(String.begin(), Matches[0].begin())
[all...] |
| /external/chromium/chrome/browser/history/ |
| query_parser.cc | 34 // Coalesces match positions in |matches| after index that intersect the match
37 Snippet::MatchPositions* matches) {
38 Snippet::MatchPosition& mp = (*matches)[index];
39 for (Snippet::MatchPositions::iterator i = matches->begin() + index + 1;
40 i != matches->end(); ) {
43 i = matches->erase(i);
50 // Sorts the match positions in |matches| by their first index, then coalesces
52 void CoalseAndSortMatchPositions(Snippet::MatchPositions* matches) {
53 std::sort(matches->begin(), matches->end(), &CompareMatchPosition)
[all...] |
| /external/chromium/net/base/ |
| x509_cert_types_mac.cc | 252 // byte-for-byte by a Matches() call.
300 bool CertPrincipal::Matches(const CertPrincipal& against) const {
|
| /external/clang/unittests/Tooling/ |
| TestVisitor.h | 94 /// \brief A RecursiveASTVisitor to check that certain matches are (or are
98 /// and allows simple creation of test visitors running matches on only a small
105 /// Any number of matches can be disallowed.
112 /// Any number of expected matches can be set by calling this repeatedly.
118 /// \brief Checks that all expected matches have been found.
128 /// \brief Checks an actual match against expected and disallowed matches.
138 EXPECT_FALSE(It->Matches(Name, FullLocation))
160 bool Matches(StringRef Name, FullSourceLoc const &Location) const {
190 if (Candidate.Matches(Name, Location)) {
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 10 // Implements an algorithm to efficiently search for matches on AST nodes.
11 // Uses memoization to support recursive matches like HasDescendant.
14 // calling the Matches(...) method of each matcher we are running on each
114 // Creates an AST visitor that matches 'matcher' on all children or
131 Matches(false) {}
151 return Matches;
190 Matches = false;
219 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node),
221 Matches = true;
235 if (Matcher->matches(ast_type_traits::DynTypedNode::create(Node)
[all...] |
| /external/regex-re2/re2/ |
| prog.h | 114 inline bool Matches(int c) {
190 // full matches.
195 kManyMatch // for SearchDFA, records set of matches
270 // If matches != NULL and kind == kManyMatch and there is a match,
271 // SearchDFA fills matches with the match IDs of the final matching state.
275 vector<int>* matches);
|
| /external/chromium/net/http/ |
| http_cache.cc | 173 bool Matches(Transaction* trans) const { return trans == trans_; }
964 if (pending_op->writer->Matches(trans)) {
973 if ((*it)->Matches(trans)) {
[all...] |
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-matchers.h | 68 // used by a matcher to explain why a value matches or doesn't match.
114 // Returns true iff the matcher matches x; also explains the match
193 // Returns true iff the matcher matches x; also explains the match
199 // Returns true iff this matcher matches x.
200 bool Matches(T x) const {
213 // Explains why x matches, or doesn't match, the matcher.
246 // object that can check whether a value of type T matches. The
449 // A<T>() returns a matcher that matches any value of type T.
475 // Matches the value against the given matcher, prints the value and explains
486 return matcher.Matches(value)
2109 const bool matches = inner_matcher_.MatchAndExplain(*it, &inner_listener); local
[all...] |
| /external/v8/src/ |
| isolate.h | 396 bool Matches(Isolate* isolate, ThreadId thread_id) const {
[all...] |
| liveobjectlist.cc | 172 // the general type, then we should reject the ones that matches the
259 inline bool Matches(HeapObject* obj) {
651 if (!filter->Matches(heap_obj)) {
692 if (!filter->Matches(heap_obj)) {
872 if (!filter->Matches(heap_obj)) {
1051 break; // No more matches. Let's move on.
[all...] |
| jsregexp.h | 481 // matches the given one.
482 bool Matches(NodeInfo* that) {
[all...] |
| /external/clang/lib/Sema/ |
| SemaExprCXX.cpp | [all...] |
| SemaTemplate.cpp | [all...] |
