| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
| 4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
| 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) | 5 * (C) 2006 Alexey Proskuryakov (ap@webkit.org) |
| 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All |
| 7 * rights reserved. | 7 * rights reserved. |
| 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. |
| 9 * (http://www.torchmobile.com/) | 9 * (http://www.torchmobile.com/) |
| 10 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) | 10 * Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies) |
| (...skipping 222 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 233 unsigned minDirectAdjacent); | 233 unsigned minDirectAdjacent); |
| 234 void scheduleInvalidationsForInsertedSibling(Element* beforeElement, | 234 void scheduleInvalidationsForInsertedSibling(Element* beforeElement, |
| 235 Element& insertedElement); | 235 Element& insertedElement); |
| 236 void scheduleInvalidationsForRemovedSibling(Element* beforeElement, | 236 void scheduleInvalidationsForRemovedSibling(Element* beforeElement, |
| 237 Element& removedElement, | 237 Element& removedElement, |
| 238 Element& afterElement); | 238 Element& afterElement); |
| 239 void scheduleNthPseudoInvalidations(ContainerNode&); | 239 void scheduleNthPseudoInvalidations(ContainerNode&); |
| 240 void scheduleInvalidationsForRuleSets(TreeScope&, | 240 void scheduleInvalidationsForRuleSets(TreeScope&, |
| 241 const HeapHashSet<Member<RuleSet>>&); | 241 const HeapHashSet<Member<RuleSet>>&); |
| 242 | 242 |
| 243 void elementWillBeRemoved(Element& element) { |
| 244 m_styleInvalidator.rescheduleSiblingInvalidationsAsDescendants(element); |
| 245 } |
| 246 |
| 243 unsigned styleForElementCount() const { return m_styleForElementCount; } | 247 unsigned styleForElementCount() const { return m_styleForElementCount; } |
| 244 void incStyleForElementCount() { m_styleForElementCount++; } | 248 void incStyleForElementCount() { m_styleForElementCount++; } |
| 245 | 249 |
| 246 StyleResolverStats* stats() { return m_styleResolverStats.get(); } | 250 StyleResolverStats* stats() { return m_styleResolverStats.get(); } |
| 247 void setStatsEnabled(bool); | 251 void setStatsEnabled(bool); |
| 248 | 252 |
| 249 PassRefPtr<ComputedStyle> findSharedStyle(const ElementResolveContext&); | 253 PassRefPtr<ComputedStyle> findSharedStyle(const ElementResolveContext&); |
| 250 | 254 |
| 251 void applyRuleSetChanges(TreeScope&, | 255 void applyRuleSetChanges(TreeScope&, |
| 252 const ActiveStyleSheetVector& oldStyleSheets, | 256 const ActiveStyleSheetVector& oldStyleSheets, |
| (...skipping 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 369 | 373 |
| 370 std::unique_ptr<StyleResolverStats> m_styleResolverStats; | 374 std::unique_ptr<StyleResolverStats> m_styleResolverStats; |
| 371 unsigned m_styleForElementCount = 0; | 375 unsigned m_styleForElementCount = 0; |
| 372 | 376 |
| 373 friend class StyleEngineTest; | 377 friend class StyleEngineTest; |
| 374 }; | 378 }; |
| 375 | 379 |
| 376 } // namespace blink | 380 } // namespace blink |
| 377 | 381 |
| 378 #endif | 382 #endif |
| OLD | NEW |