| 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 * Copyright (C) 2012 Google Inc. All rights reserved. | 8 * Copyright (C) 2012 Google Inc. All rights reserved. |
| 9 * | 9 * |
| 10 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
| 11 * modify it under the terms of the GNU Library General Public | 11 * modify it under the terms of the GNU Library General Public |
| 12 * License as published by the Free Software Foundation; either | 12 * License as published by the Free Software Foundation; either |
| 13 * version 2 of the License, or (at your option) any later version. | 13 * version 2 of the License, or (at your option) any later version. |
| 14 * | 14 * |
| 15 * This library is distributed in the hope that it will be useful, | 15 * This library is distributed in the hope that it will be useful, |
| 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 18 * Library General Public License for more details. | 18 * Library General Public License for more details. |
| 19 * | 19 * |
| 20 * You should have received a copy of the GNU Library General Public License | 20 * You should have received a copy of the GNU Library General Public License |
| 21 * along with this library; see the file COPYING.LIB. If not, write to | 21 * along with this library; see the file COPYING.LIB. If not, write to |
| 22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 23 * Boston, MA 02110-1301, USA. | 23 * Boston, MA 02110-1301, USA. |
| 24 */ | 24 */ |
| 25 | 25 |
| 26 #include "config.h" | 26 #include "config.h" |
| 27 #include "core/dom/ContainerNodeAlgorithms.h" | 27 #include "core/dom/ContainerNodeAlgorithms.h" |
| 28 | 28 |
| 29 #include "HTMLFrameOwnerElement.h" | |
| 30 #include "core/dom/Element.h" | 29 #include "core/dom/Element.h" |
| 31 #include "core/dom/ElementShadow.h" | 30 #include "core/dom/ElementShadow.h" |
| 31 #include "core/html/HTMLFrameOwnerElement.h" |
| 32 | 32 |
| 33 namespace WebCore { | 33 namespace WebCore { |
| 34 | 34 |
| 35 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN
ode* node) | 35 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN
ode* node) |
| 36 { | 36 { |
| 37 ChildNodesLazySnapshot snapshot(node); | 37 ChildNodesLazySnapshot snapshot(node); |
| 38 while (RefPtr<Node> child = snapshot.nextNode()) { | 38 while (RefPtr<Node> child = snapshot.nextNode()) { |
| 39 // If we have been removed from the document during this loop, then | 39 // If we have been removed from the document during this loop, then |
| 40 // we don't want to tell the rest of our children that they've been | 40 // we don't want to tell the rest of our children that they've been |
| 41 // inserted into the document because they haven't. | 41 // inserted into the document because they haven't. |
| (...skipping 98 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 140 // If we overcount it's safe, but not optimal because it means we'll travers
e | 140 // If we overcount it's safe, but not optimal because it means we'll travers
e |
| 141 // through the document in ChildFrameDisconnector looking for frames that ha
ve | 141 // through the document in ChildFrameDisconnector looking for frames that ha
ve |
| 142 // already been disconnected. | 142 // already been disconnected. |
| 143 ASSERT(node->connectedSubframeCount() == count); | 143 ASSERT(node->connectedSubframeCount() == count); |
| 144 | 144 |
| 145 return count; | 145 return count; |
| 146 } | 146 } |
| 147 #endif | 147 #endif |
| 148 | 148 |
| 149 } | 149 } |
| OLD | NEW |