| 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 * Copyright (C) 2012 Google Inc. All rights reserved. | 4 * Copyright (C) 2012 Google Inc. All rights reserved. |
| 5 * | 5 * |
| 6 * Redistribution and use in source and binary forms, with or without | 6 * Redistribution and use in source and binary forms, with or without |
| 7 * modification, are permitted provided that the following conditions | 7 * modification, are permitted provided that the following conditions |
| 8 * are met: | 8 * are met: |
| 9 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
| 10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
| (...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 52 } | 52 } |
| 53 | 53 |
| 54 const TreeScope& treeScope() const { return *m_scope; } | 54 const TreeScope& treeScope() const { return *m_scope; } |
| 55 ScopedStyleResolver* parent() const; | 55 ScopedStyleResolver* parent() const; |
| 56 | 56 |
| 57 StyleRuleKeyframes* keyframeStylesForAnimation(const StringImpl* animationNa
me); | 57 StyleRuleKeyframes* keyframeStylesForAnimation(const StringImpl* animationNa
me); |
| 58 | 58 |
| 59 void appendCSSStyleSheet(CSSStyleSheet&, const MediaQueryEvaluator&); | 59 void appendCSSStyleSheet(CSSStyleSheet&, const MediaQueryEvaluator&); |
| 60 void collectMatchingAuthorRules(ElementRuleCollector&, CascadeOrder = ignore
CascadeOrder); | 60 void collectMatchingAuthorRules(ElementRuleCollector&, CascadeOrder = ignore
CascadeOrder); |
| 61 void collectMatchingShadowHostRules(ElementRuleCollector&, CascadeOrder = ig
noreCascadeOrder); | 61 void collectMatchingShadowHostRules(ElementRuleCollector&, CascadeOrder = ig
noreCascadeOrder); |
| 62 void collectMatchingTreeBoundaryCrossingRules(ElementRuleCollector&, Cascade
Order); | 62 void collectMatchingTreeBoundaryCrossingRules(ElementRuleCollector&, Cascade
Order = ignoreCascadeOrder); |
| 63 void matchPageRules(PageRuleCollector&); | 63 void matchPageRules(PageRuleCollector&); |
| 64 void collectFeaturesTo(RuleFeatureSet&, WillBeHeapHashSet<RawPtrWillBeMember
<const StyleSheetContents>>& visitedSharedStyleSheetContents) const; | 64 void collectFeaturesTo(RuleFeatureSet&, WillBeHeapHashSet<RawPtrWillBeMember
<const StyleSheetContents>>& visitedSharedStyleSheetContents) const; |
| 65 void resetAuthorStyle(); | 65 void resetAuthorStyle(); |
| 66 void collectViewportRulesTo(ViewportStyleResolver*) const; | 66 void collectViewportRulesTo(ViewportStyleResolver*) const; |
| 67 bool hasDeepOrShadowSelector() const { return m_hasDeepOrShadowSelector; } | 67 bool hasDeepOrShadowSelector() const { return m_hasDeepOrShadowSelector; } |
| 68 | 68 |
| 69 DECLARE_TRACE(); | 69 DECLARE_TRACE(); |
| 70 | 70 |
| 71 private: | 71 private: |
| 72 explicit ScopedStyleResolver(TreeScope& scope) | 72 explicit ScopedStyleResolver(TreeScope& scope) |
| (...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 109 }; | 109 }; |
| 110 using CSSStyleSheetRuleSubSet = WillBeHeapVector<OwnPtrWillBeMember<RuleSubS
et>>; | 110 using CSSStyleSheetRuleSubSet = WillBeHeapVector<OwnPtrWillBeMember<RuleSubS
et>>; |
| 111 | 111 |
| 112 OwnPtrWillBeMember<CSSStyleSheetRuleSubSet> m_treeBoundaryCrossingRuleSet; | 112 OwnPtrWillBeMember<CSSStyleSheetRuleSubSet> m_treeBoundaryCrossingRuleSet; |
| 113 bool m_hasDeepOrShadowSelector = false; | 113 bool m_hasDeepOrShadowSelector = false; |
| 114 }; | 114 }; |
| 115 | 115 |
| 116 } // namespace blink | 116 } // namespace blink |
| 117 | 117 |
| 118 #endif // ScopedStyleResolver_h | 118 #endif // ScopedStyleResolver_h |
| OLD | NEW |