| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| SelectorChecker.cpp | 138 SelectorChecker::Match SelectorChecker::match(const SelectorCheckingContext& context, PseudoId& dynamicPseudo, const SiblingTraversalStrategy& siblingTraversalStrategy) const function in class:WebCore::SelectorChecker
140 // first selector has to match
165 // The rest of the selectors has to match
186 // Disable :visited matching when we see the first link or try to match anything else than an ancestors.
205 Match match = this->match(nextContext, ignoreDynamicPseudo, siblingTraversalStrategy); local
206 if (match == SelectorMatches || match == SelectorFailsCompletely
246 Match match = this->match(nextContext, ignoreDynamicPseudo, siblingTraversalStrategy); local
[all...] |
| /external/chromium_org/third_party/libphonenumber/src/phonenumbers/ |
| regexp_adapter_re2.cc | 121 virtual bool Match(const string& input_string,
|
| /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/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/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/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/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/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/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
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/ |
| ASTTreeParser.stg | 64 /** match ^(root children) in tree parser; override here to
88 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
90 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
93 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
95 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
155 /** Match ^(label+=TOKEN ...) auto construct */
161 /** Match . wildcard and auto dup the node/subtree */
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/ |
| ASTTreeParser.stg | 65 /** match ^(root children) in tree parser; override here to
89 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
91 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
94 Match(input, TokenTypes.Down, null); <checkRuleBacktrackFailure()>
96 Match(input, TokenTypes.Up, null); <checkRuleBacktrackFailure()>
156 /** Match ^(label+=TOKEN ...) auto construct */
162 /** Match . wildcard and auto dup the node/subtree */
|
| /external/chromium_org/jingle/glue/ |
| thread_wrapper.cc | 99 if (it->second.Match(handler, id)) {
116 if ((*it)->message.Match(handler, id)) {
|
| /external/chromium_org/third_party/re2/doc/ |
| mksyntaxgo | 27 facilities of package regexp (such as Compile and Match) instead of this package.
|
| /external/chromium_org/v8/src/ |
| arguments.cc | 37 static bool Match(void* a, void* b) {
52 CallbackTable::CallbackTable(): map_(Match, 64) {}
|
| interface.cc | 35 static bool Match(void* key1, void* key2) {
93 *map = new ZoneHashMap(Match, ZoneHashMap::kDefaultHashMapCapacity,
|
| /external/regex-re2/doc/ |
| mksyntaxgo | 27 facilities of package regexp (such as Compile and Match) instead of this package.
|
| /external/v8/src/ |
| interface.cc | 35 static bool Match(void* key1, void* key2) {
88 if (*map == NULL) *map = new ZoneHashMap(Match, 8);
|
| /external/chromium_org/chrome/browser/extensions/api/web_request/ |
| form_data_parser.cc | 89 // The pattern to match a single name-value pair. This could be even static,
207 // Produces a regexp to match the string "--" + |literal|. The idea is to
439 return pattern.Match(input, 0, input.size(), RE2::ANCHOR_START, NULL, 0);
582 if (!name_pattern().Match(header,
590 if (value_pattern().Match(header,
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| AMDILISelDAGToDAG.cpp | 327 bool Match = false;
341 Match = true;
346 return Match;
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDILISelDAGToDAG.cpp | 327 bool Match = false;
341 Match = true;
346 return Match;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| MoveHandler.java | 211 List<Match> horizontalMatches = findClosest(edge, mHorizontalEdges);
216 List<Match> verticalMatches = findClosest(edge, mVerticalEdges);
220 // Match center
226 // Match baseline
249 Match match = pickBestMatch(mHorizontalSuggestions); local
250 if (match != null) {
251 if (mHorizontalDeps.contains(match.edge.node)) {
252 match.cycle = true;
262 snapHorizontal(match.with, match.edge.at, mBounds)
[all...] |
| /external/chromium/chrome/browser/autofill/ |
| name_field.cc | 35 if (Match(field, l10n_util::GetStringUTF16(IDS_AUTOFILL_USERNAME_RE), false))
90 // so we match "initials" here (and just fill in a first name there,
93 string16 match = l10n_util::GetStringUTF16(IDS_AUTOFILL_FIRST_NAME_RE); local
94 if (!ParseText(&q, match, &v->first_name_))
102 match = l10n_util::GetStringUTF16(IDS_AUTOFILL_MIDDLE_INITIAL_RE);
103 if (ParseText(&q, match, &v->middle_name_)) {
106 match = l10n_util::GetStringUTF16(IDS_AUTOFILL_MIDDLE_NAME_RE);
107 ParseText(&q, match, &v->middle_name_);
111 match = l10n_util::GetStringUTF16(IDS_AUTOFILL_LAST_NAME_RE);
112 if (!ParseText(&q, match, &v->last_name_)
[all...] |
| /external/chromium/chrome/browser/history/ |
| text_database_manager.h | 154 // This function will return more than one match per URL if there is more than
158 std::vector<TextDatabase::Match>* results,
|
| /external/chromium/chrome/browser/renderer_host/ |
| gtk_key_bindings_handler_unittest.cc | 78 ASSERT_TRUE(handler_->Match(event, &result));
|
