| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 if (!selector->isCompound()) | 102 if (!selector->isCompound()) |
| 103 return false; | 103 return false; |
| 104 } | 104 } |
| 105 | 105 |
| 106 return true; | 106 return true; |
| 107 } | 107 } |
| 108 | 108 |
| 109 static inline bool checkOneSelector(const CSSSelector* selector, const Vector<No
de*>& siblings, int nth) | 109 static inline bool checkOneSelector(const CSSSelector* selector, const Vector<No
de*>& siblings, int nth) |
| 110 { | 110 { |
| 111 Element* element = toElement(siblings[nth]); | 111 Element* element = toElement(siblings[nth]); |
| 112 SelectorChecker selectorChecker(&element->document(), SelectorChecker::Colle
ctingRules); | 112 SelectorChecker selectorChecker(element->document(), SelectorChecker::Collec
tingRules); |
| 113 SelectorChecker::SelectorCheckingContext context(selector, element, Selector
Checker::VisitedMatchEnabled); | 113 SelectorChecker::SelectorCheckingContext context(selector, element, Selector
Checker::VisitedMatchEnabled); |
| 114 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth); | 114 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth); |
| 115 PseudoId ignoreDynamicPseudo = NOPSEUDO; | 115 PseudoId ignoreDynamicPseudo = NOPSEUDO; |
| 116 return selectorChecker.match(context, ignoreDynamicPseudo, strategy) == Sele
ctorChecker::SelectorMatches; | 116 return selectorChecker.match(context, ignoreDynamicPseudo, strategy) == Sele
ctorChecker::SelectorMatches; |
| 117 } | 117 } |
| 118 | 118 |
| 119 bool HTMLContentElement::matchSelector(const Vector<Node*>& siblings, int nth) c
onst | 119 bool HTMLContentElement::matchSelector(const Vector<Node*>& siblings, int nth) c
onst |
| 120 { | 120 { |
| 121 for (const CSSSelector* selector = selectorList().first(); selector; selecto
r = CSSSelectorList::next(selector)) { | 121 for (const CSSSelector* selector = selectorList().first(); selector; selecto
r = CSSSelectorList::next(selector)) { |
| 122 if (checkOneSelector(selector, siblings, nth)) | 122 if (checkOneSelector(selector, siblings, nth)) |
| 123 return true; | 123 return true; |
| 124 } | 124 } |
| 125 return false; | 125 return false; |
| 126 } | 126 } |
| 127 | 127 |
| 128 } | 128 } |
| OLD | NEW |