| 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 18 matching lines...) Expand all Loading... |
| 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 ContainerNode; | 35 class ContainerNode; |
| 36 class RuleFeatureSet; | 36 class RuleFeatureSet; |
| 37 | 37 |
| 38 class TreeBoundaryCrossingRules { | 38 class TreeBoundaryCrossingRules { |
| 39 DISALLOW_ALLOCATION(); |
| 39 public: | 40 public: |
| 40 void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, A
ddRuleFlags); | 41 void addRule(StyleRule*, size_t selectorIndex, ContainerNode* scopingNode, A
ddRuleFlags); |
| 41 void clear() { m_treeBoundaryCrossingRuleSetMap.clear(); } | 42 void clear() { m_treeBoundaryCrossingRuleSetMap.clear(); } |
| 42 void reset(const ContainerNode* scopingNode); | 43 void reset(const ContainerNode* scopingNode); |
| 43 bool isEmpty() const { return m_treeBoundaryCrossingRuleSetMap.isEmpty(); } | 44 bool isEmpty() const { return m_treeBoundaryCrossingRuleSetMap.isEmpty(); } |
| 44 void collectFeaturesTo(RuleFeatureSet&); | 45 void collectFeaturesTo(RuleFeatureSet&); |
| 45 | 46 |
| 46 DocumentOrderedList::iterator begin() { return m_scopingNodes.begin(); } | 47 DocumentOrderedList::iterator begin() { return m_scopingNodes.begin(); } |
| 47 DocumentOrderedList::iterator end() { return m_scopingNodes.end(); } | 48 DocumentOrderedList::iterator end() { return m_scopingNodes.end(); } |
| 48 size_t size() const { return m_scopingNodes.size(); } | 49 size_t size() const { return m_scopingNodes.size(); } |
| 49 RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBo
undaryCrossingRuleSetMap.get(scopingNode); } | 50 RuleSet* ruleSetScopedBy(const ContainerNode* scopingNode) { return m_treeBo
undaryCrossingRuleSetMap.get(scopingNode); } |
| 50 | 51 |
| 52 void trace(Visitor* visitor) { visitor->trace(m_treeBoundaryCrossingRuleSetM
ap); } |
| 53 |
| 51 private: | 54 private: |
| 52 DocumentOrderedList m_scopingNodes; | 55 DocumentOrderedList m_scopingNodes; |
| 53 typedef WillBePersistentHeapHashMap<const ContainerNode*, OwnPtrWillBeMember
<RuleSet> > TreeBoundaryCrossingRuleSetMap; | 56 typedef WillBeHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<RuleSet>
> TreeBoundaryCrossingRuleSetMap; |
| 54 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; | 57 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; |
| 55 }; | 58 }; |
| 56 | 59 |
| 57 } // namespace WebCore | 60 } // namespace WebCore |
| 58 | 61 |
| 59 #endif // TreeBoundaryCrossingRules_h | 62 #endif // TreeBoundaryCrossingRules_h |
| OLD | NEW |