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 13 matching lines...) Expand all Loading... |
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
25 */ | 25 */ |
26 | 26 |
27 #include "config.h" | 27 #include "config.h" |
28 #include "core/dom/shadow/ContentSelectorQuery.h" | 28 #include "core/dom/shadow/ContentSelectorQuery.h" |
29 | 29 |
30 #include "core/css/CSSSelectorList.h" | 30 #include "core/css/CSSSelectorList.h" |
31 #include "core/css/SelectorChecker.h" | 31 #include "core/css/SelectorChecker.h" |
32 #include "core/css/SiblingTraversalStrategies.h" | 32 #include "core/css/SiblingTraversalStrategies.h" |
33 #include "core/dom/shadow/InsertionPoint.h" | 33 #include "core/dom/shadow/InsertionPoint.h" |
34 #include "core/dom/shadow/ShadowRoot.h" | |
35 | 34 |
36 namespace WebCore { | 35 namespace WebCore { |
37 | 36 |
38 bool ContentSelectorDataList::checkContentSelector(const CSSSelector* selector,
const Vector<RefPtr<Node> >& siblings, int nth) | 37 bool ContentSelectorDataList::checkContentSelector(const CSSSelector* selector,
const Vector<RefPtr<Node> >& siblings, int nth) |
39 { | 38 { |
40 Element* element = toElement(siblings[nth].get()); | 39 Element* element = toElement(siblings[nth].get()); |
41 SelectorChecker selectorChecker(element->document(), SelectorChecker::Collec
tingRules); | 40 SelectorChecker selectorChecker(element->document(), SelectorChecker::Collec
tingRules); |
42 SelectorChecker::SelectorCheckingContext context(selector, element, Selector
Checker::VisitedMatchEnabled); | 41 SelectorChecker::SelectorCheckingContext context(selector, element, Selector
Checker::VisitedMatchEnabled); |
43 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth); | 42 ShadowDOMSiblingTraversalStrategy strategy(siblings, nth); |
44 PseudoId ignoreDynamicPseudo = NOPSEUDO; | 43 PseudoId ignoreDynamicPseudo = NOPSEUDO; |
(...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
79 return false; | 78 return false; |
80 case InsertionPoint::HasToMatchSelector: | 79 case InsertionPoint::HasToMatchSelector: |
81 return node->isElementNode() && m_selectors.matches(siblings, nth); | 80 return node->isElementNode() && m_selectors.matches(siblings, nth); |
82 default: | 81 default: |
83 ASSERT_NOT_REACHED(); | 82 ASSERT_NOT_REACHED(); |
84 return false; | 83 return false; |
85 } | 84 } |
86 } | 85 } |
87 | 86 |
88 } | 87 } |
OLD | NEW |