| 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 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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 typedef WillBeHeapVector<std::pair<CSSStyleSheet*, OwnPtrWillBeMember<RuleSe
t> > > CSSStyleSheetRuleSubSet; | 53 typedef WillBeHeapVector<std::pair<CSSStyleSheet*, OwnPtrWillBeMember<RuleSe
t> > > CSSStyleSheetRuleSubSet; |
| 54 void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&
); | 54 void collectFeaturesFromRuleSubSet(CSSStyleSheetRuleSubSet*, RuleFeatureSet&
); |
| 55 | 55 |
| 56 DocumentOrderedList m_scopingNodes; | 56 DocumentOrderedList m_scopingNodes; |
| 57 typedef WillBeHeapHashMap<const ContainerNode*, OwnPtrWillBeMember<CSSStyleS
heetRuleSubSet> > TreeBoundaryCrossingRuleSetMap; | 57 typedef WillBeHeapHashMap<RawPtrWillBeMember<const ContainerNode>, OwnPtrWil
lBeMember<CSSStyleSheetRuleSubSet> > TreeBoundaryCrossingRuleSetMap; |
| 58 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; | 58 TreeBoundaryCrossingRuleSetMap m_treeBoundaryCrossingRuleSetMap; |
| 59 }; | 59 }; |
| 60 | 60 |
| 61 } // namespace blink | 61 } // namespace blink |
| 62 | 62 |
| 63 #endif // TreeBoundaryCrossingRules_h | 63 #endif // TreeBoundaryCrossingRules_h |
| OLD | NEW |