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) 2013 Google Inc. All rights reserved. | 4 * Copyright (C) 2013 Google Inc. All rights reserved. |
5 * | 5 * |
6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
10 * | 10 * |
(...skipping 19 matching lines...) Expand all Loading... |
30 #include "wtf/RefPtr.h" | 30 #include "wtf/RefPtr.h" |
31 #include "wtf/Vector.h" | 31 #include "wtf/Vector.h" |
32 | 32 |
33 namespace blink { | 33 namespace blink { |
34 | 34 |
35 class CSSStyleSheet; | 35 class CSSStyleSheet; |
36 class ContainerNode; | 36 class ContainerNode; |
37 class ElementRuleCollector; | 37 class ElementRuleCollector; |
38 class RuleFeatureSet; | 38 class RuleFeatureSet; |
39 | 39 |
40 class TreeBoundaryCrossingRules FINAL { | 40 class TreeBoundaryCrossingRules final { |
41 DISALLOW_ALLOCATION(); | 41 DISALLOW_ALLOCATION(); |
42 public: | 42 public: |
43 void addTreeBoundaryCrossingRules(const RuleSet&, CSSStyleSheet*, unsigned s
heetIndex, ContainerNode&); | 43 void addTreeBoundaryCrossingRules(const RuleSet&, CSSStyleSheet*, unsigned s
heetIndex, ContainerNode&); |
44 | 44 |
45 void reset(const ContainerNode* scopingNode); | 45 void reset(const ContainerNode* scopingNode); |
46 void collectFeaturesTo(RuleFeatureSet&); | 46 void collectFeaturesTo(RuleFeatureSet&); |
47 void collectTreeBoundaryCrossingRules(Element*, ElementRuleCollector&, bool
includeEmptyRules); | 47 void collectTreeBoundaryCrossingRules(Element*, ElementRuleCollector&, bool
includeEmptyRules); |
48 | 48 |
49 void trace(Visitor*); | 49 void trace(Visitor*); |
50 | 50 |
51 private: | 51 private: |
52 size_t size() const { return m_scopingNodes.size(); } | 52 size_t size() const { return m_scopingNodes.size(); } |
53 class RuleSubSet FINAL : public NoBaseWillBeGarbageCollected<RuleSubSet> { | 53 class RuleSubSet final : public NoBaseWillBeGarbageCollected<RuleSubSet> { |
54 public: | 54 public: |
55 static PassOwnPtrWillBeRawPtr<RuleSubSet> create(CSSStyleSheet* sheet, u
nsigned index, PassOwnPtrWillBeRawPtr<RuleSet> rules) | 55 static PassOwnPtrWillBeRawPtr<RuleSubSet> create(CSSStyleSheet* sheet, u
nsigned index, PassOwnPtrWillBeRawPtr<RuleSet> rules) |
56 { | 56 { |
57 return adoptPtrWillBeNoop(new RuleSubSet(sheet, index, rules)); | 57 return adoptPtrWillBeNoop(new RuleSubSet(sheet, index, rules)); |
58 } | 58 } |
59 | 59 |
60 CSSStyleSheet* parentStyleSheet; | 60 CSSStyleSheet* parentStyleSheet; |
61 unsigned parentIndex; | 61 unsigned parentIndex; |
62 OwnPtrWillBeMember<RuleSet> ruleSet; | 62 OwnPtrWillBeMember<RuleSet> ruleSet; |
63 | 63 |
(...skipping 11 matching lines...) Expand all Loading... |
75 void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&
); | 75 void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&
); |
76 | 76 |
77 DocumentOrderedList m_scopingNodes; | 77 DocumentOrderedList m_scopingNodes; |
78 typedef WillBeHeapHashMap<RawPtrWillBeMember<const ContainerNode>, OwnPtrWil
lBeMember<CSSStyleSheetRuleSubSet> > TreeBoundaryCrossingRuleSetMap; | 78 typedef WillBeHeapHashMap<RawPtrWillBeMember<const ContainerNode>, OwnPtrWil
lBeMember<CSSStyleSheetRuleSubSet> > TreeBoundaryCrossingRuleSetMap; |
79 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; | 79 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; |
80 }; | 80 }; |
81 | 81 |
82 } // namespace blink | 82 } // namespace blink |
83 | 83 |
84 #endif // TreeBoundaryCrossingRules_h | 84 #endif // TreeBoundaryCrossingRules_h |
OLD | NEW |