| 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 14 matching lines...) Expand all Loading... |
| 25 | 25 |
| 26 #include "core/css/RuleSet.h" | 26 #include "core/css/RuleSet.h" |
| 27 #include "core/dom/DocumentOrderedList.h" | 27 #include "core/dom/DocumentOrderedList.h" |
| 28 | 28 |
| 29 #include "wtf/OwnPtr.h" | 29 #include "wtf/OwnPtr.h" |
| 30 #include "wtf/RefPtr.h" | 30 #include "wtf/RefPtr.h" |
| 31 #include "wtf/Vector.h" | 31 #include "wtf/Vector.h" |
| 32 | 32 |
| 33 namespace WebCore { | 33 namespace WebCore { |
| 34 | 34 |
| 35 class CSSStyleSheet; |
| 35 class ContainerNode; | 36 class ContainerNode; |
| 37 class ElementRuleCollector; |
| 36 class RuleFeatureSet; | 38 class RuleFeatureSet; |
| 37 | 39 |
| 38 class TreeBoundaryCrossingRules { | 40 class TreeBoundaryCrossingRules { |
| 39 DISALLOW_ALLOCATION(); | 41 DISALLOW_ALLOCATION(); |
| 40 public: | 42 public: |
| 41 void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, A
ddRuleFlags); | 43 void addTreeBoundaryCrossingRules(const RuleSet&, ContainerNode* scope, CSSS
tyleSheet*); |
| 42 void clear() { m_treeBoundaryCrossingRuleSetMap.clear(); } | 44 |
| 43 void reset(const ContainerNode* scopingNode); | 45 void reset(const ContainerNode* scopingNode); |
| 44 bool isEmpty() const { return m_treeBoundaryCrossingRuleSetMap.isEmpty(); } | |
| 45 void collectFeaturesTo(RuleFeatureSet&); | 46 void collectFeaturesTo(RuleFeatureSet&); |
| 46 | 47 void collectTreeBoundaryCrossingRules(Element*, ElementRuleCollector&, bool
includeEmptyRules); |
| 47 DocumentOrderedList::iterator begin() { return m_scopingNodes.begin(); } | |
| 48 DocumentOrderedList::iterator end() { return m_scopingNodes.end(); } | |
| 49 size_t size() const { return m_scopingNodes.size(); } | |
| 50 RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBo
undaryCrossingRuleSetMap.get(scopingNode); } | |
| 51 | 48 |
| 52 void trace(Visitor* visitor) { visitor->trace(m_treeBoundaryCrossingRuleSetM
ap); } | 49 void trace(Visitor* visitor) { visitor->trace(m_treeBoundaryCrossingRuleSetM
ap); } |
| 53 | 50 |
| 54 private: | 51 private: |
| 52 size_t size() const { return m_scopingNodes.size(); } |
| 53 typedef WillBeHeapVector<std::pair<CSSStyleSheet*, OwnPtr<RuleSet> > > CSSSt
yleSheetRuleSubSet; |
| 54 void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&
); |
| 55 |
| 55 DocumentOrderedList m_scopingNodes; | 56 DocumentOrderedList m_scopingNodes; |
| 56 typedef WillBeHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<RuleSet>
> TreeBoundaryCrossingRuleSetMap; | 57 typedef WillBeHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<CSSStyleS
heetRuleSubSet> > TreeBoundaryCrossingRuleSetMap; |
| 57 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; | 58 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; |
| 58 }; | 59 }; |
| 59 | 60 |
| 60 } // namespace WebCore | 61 } // namespace WebCore |
| 61 | 62 |
| 62 #endif // TreeBoundaryCrossingRules_h | 63 #endif // TreeBoundaryCrossingRules_h |
| OLD | NEW |