OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. | 3 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc.
All rights reserved. |
4 * | 4 * |
5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
9 * | 9 * |
10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
(...skipping 109 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
120 | 120 |
121 const MatchResult& matchedResult() const; | 121 const MatchResult& matchedResult() const; |
122 PassRefPtrWillBeRawPtr<StyleRuleList> matchedStyleRuleList(); | 122 PassRefPtrWillBeRawPtr<StyleRuleList> matchedStyleRuleList(); |
123 PassRefPtrWillBeRawPtr<CSSRuleList> matchedCSSRuleList(); | 123 PassRefPtrWillBeRawPtr<CSSRuleList> matchedCSSRuleList(); |
124 | 124 |
125 void collectMatchingRules(const MatchRequest&, CascadeOrder = ignoreCascadeO
rder, bool matchingTreeBoundaryRules = false); | 125 void collectMatchingRules(const MatchRequest&, CascadeOrder = ignoreCascadeO
rder, bool matchingTreeBoundaryRules = false); |
126 void collectMatchingShadowHostRules(const MatchRequest&, CascadeOrder = igno
reCascadeOrder, bool matchingTreeBoundaryRules = false); | 126 void collectMatchingShadowHostRules(const MatchRequest&, CascadeOrder = igno
reCascadeOrder, bool matchingTreeBoundaryRules = false); |
127 void sortAndTransferMatchedRules(); | 127 void sortAndTransferMatchedRules(); |
128 void clearMatchedRules(); | 128 void clearMatchedRules(); |
129 void addElementStyleProperties(const StylePropertySet*, bool isCacheable = t
rue); | 129 void addElementStyleProperties(const StylePropertySet*, bool isCacheable = t
rue); |
| 130 void finishAddingUARules() { m_result.finishAddingUARules(); } |
| 131 void finishAddingAuthorRulesForTreeScope() { m_result.finishAddingAuthorRule
sForTreeScope(); } |
130 | 132 |
131 private: | 133 private: |
132 template<typename RuleDataListType> | 134 template<typename RuleDataListType> |
133 void collectMatchingRulesForList(const RuleDataListType*, CascadeOrder, cons
t MatchRequest&); | 135 void collectMatchingRulesForList(const RuleDataListType*, CascadeOrder, cons
t MatchRequest&); |
134 | 136 |
135 void didMatchRule(const RuleData&, const SelectorChecker::MatchResult&, Casc
adeOrder, const MatchRequest&); | 137 void didMatchRule(const RuleData&, const SelectorChecker::MatchResult&, Casc
adeOrder, const MatchRequest&); |
136 | 138 |
137 template<class CSSRuleCollection> | 139 template<class CSSRuleCollection> |
138 CSSRule* findStyleRule(CSSRuleCollection*, StyleRule*); | 140 CSSRule* findStyleRule(CSSRuleCollection*, StyleRule*); |
139 void appendCSSOMWrapperForRule(CSSStyleSheet*, StyleRule*); | 141 void appendCSSOMWrapperForRule(CSSStyleSheet*, StyleRule*); |
(...skipping 19 matching lines...) Expand all Loading... |
159 | 161 |
160 // Output. | 162 // Output. |
161 RefPtrWillBeMember<StaticCSSRuleList> m_cssRuleList; | 163 RefPtrWillBeMember<StaticCSSRuleList> m_cssRuleList; |
162 RefPtrWillBeMember<StyleRuleList> m_styleRuleList; | 164 RefPtrWillBeMember<StyleRuleList> m_styleRuleList; |
163 MatchResult m_result; | 165 MatchResult m_result; |
164 }; | 166 }; |
165 | 167 |
166 } // namespace blink | 168 } // namespace blink |
167 | 169 |
168 #endif // ElementRuleCollector_h | 170 #endif // ElementRuleCollector_h |
OLD | NEW |