| Index: Source/core/css/TreeBoundaryCrossingRules.h
|
| diff --git a/Source/core/css/TreeBoundaryCrossingRules.h b/Source/core/css/TreeBoundaryCrossingRules.h
|
| index 9e391e228ffb98ab9677f85f0f6bdb591033258f..2cbabeb3e5a7289033734902345bad1967f07039 100644
|
| --- a/Source/core/css/TreeBoundaryCrossingRules.h
|
| +++ b/Source/core/css/TreeBoundaryCrossingRules.h
|
| @@ -37,7 +37,9 @@ class RuleFeatureSet;
|
|
|
| class TreeBoundaryCrossingRules {
|
| public:
|
| - void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, AddRuleFlags);
|
| + typedef HashMap<const CSSStyleSheet*, OwnPtrWillBeMember<RuleSet> > CSSStyleSheetRuleSubSet;
|
| +
|
| + void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, CSSStyleSheet* parentStyleSheet, AddRuleFlags);
|
| void clear() { m_treeBoundaryCrossingRuleSetMap.clear(); }
|
| void reset(const ContainerNode* scopingNode);
|
| bool isEmpty() const { return m_treeBoundaryCrossingRuleSetMap.isEmpty(); }
|
| @@ -46,11 +48,11 @@ public:
|
| DocumentOrderedList::iterator begin() { return m_scopingNodes.begin(); }
|
| DocumentOrderedList::iterator end() { return m_scopingNodes.end(); }
|
| size_t size() const { return m_scopingNodes.size(); }
|
| - RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBoundaryCrossingRuleSetMap.get(scopingNode); }
|
| + CSSStyleSheetRuleSubSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBoundaryCrossingRuleSetMap.get(scopingNode); }
|
|
|
| private:
|
| DocumentOrderedList m_scopingNodes;
|
| - typedef WillBePersistentHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<RuleSet> > TreeBoundaryCrossingRuleSetMap;
|
| + typedef WillBePersistentHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<CSSStyleSheetRuleSubSet> > TreeBoundaryCrossingRuleSetMap;
|
| TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap;
|
| };
|
|
|
|
|