| 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 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo
bile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 2013 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2024 return; | 2024 return; |
| 2025 | 2025 |
| 2026 for (Node* node = parentNode(); node; node = node->parentNode()) { | 2026 for (Node* node = parentNode(); node; node = node->parentNode()) { |
| 2027 if (WillBeHeapVector<OwnPtrWillBeMember<MutationObserverRegistration>>*
registry = node->mutationObserverRegistry()) { | 2027 if (WillBeHeapVector<OwnPtrWillBeMember<MutationObserverRegistration>>*
registry = node->mutationObserverRegistry()) { |
| 2028 const size_t size = registry->size(); | 2028 const size_t size = registry->size(); |
| 2029 for (size_t i = 0; i < size; ++i) | 2029 for (size_t i = 0; i < size; ++i) |
| 2030 registry->at(i)->observedSubtreeNodeWillDetach(*this); | 2030 registry->at(i)->observedSubtreeNodeWillDetach(*this); |
| 2031 } | 2031 } |
| 2032 | 2032 |
| 2033 if (WillBeHeapHashSet<RawPtrWillBeMember<MutationObserverRegistration>>*
transientRegistry = node->transientMutationObserverRegistry()) { | 2033 if (WillBeHeapHashSet<RawPtrWillBeMember<MutationObserverRegistration>>*
transientRegistry = node->transientMutationObserverRegistry()) { |
| 2034 for (WillBeHeapHashSet<RawPtrWillBeMember<MutationObserverRegistrati
on>>::iterator iter = transientRegistry->begin(); iter != transientRegistry->end
(); ++iter) | 2034 for (auto& registration : *transientRegistry) |
| 2035 (*iter)->observedSubtreeNodeWillDetach(*this); | 2035 registration->observedSubtreeNodeWillDetach(*this); |
| 2036 } | 2036 } |
| 2037 } | 2037 } |
| 2038 } | 2038 } |
| 2039 | 2039 |
| 2040 void Node::handleLocalEvents(Event& event) | 2040 void Node::handleLocalEvents(Event& event) |
| 2041 { | 2041 { |
| 2042 if (!hasEventTargetData()) | 2042 if (!hasEventTargetData()) |
| 2043 return; | 2043 return; |
| 2044 | 2044 |
| 2045 if (isDisabledFormControl(this) && event.isMouseEvent()) | 2045 if (isDisabledFormControl(this) && event.isMouseEvent()) |
| (...skipping 414 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2460 node->showTreeForThis(); | 2460 node->showTreeForThis(); |
| 2461 } | 2461 } |
| 2462 | 2462 |
| 2463 void showNodePath(const blink::Node* node) | 2463 void showNodePath(const blink::Node* node) |
| 2464 { | 2464 { |
| 2465 if (node) | 2465 if (node) |
| 2466 node->showNodePathForThis(); | 2466 node->showNodePathForThis(); |
| 2467 } | 2467 } |
| 2468 | 2468 |
| 2469 #endif | 2469 #endif |
| OLD | NEW |