| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2007 Apple Inc. All rights reserved. | 2 * Copyright (C) 2007 Apple Inc. All rights reserved. |
| 3 * (C) 2008 Nikolas Zimmermann <zimmermann@kde.org> | 3 * (C) 2008 Nikolas Zimmermann <zimmermann@kde.org> |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 123 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 134 #endif | 134 #endif |
| 135 // Add the node to the list of nodes to be deleted. | 135 // Add the node to the list of nodes to be deleted. |
| 136 // Reuse the nextSibling pointer for this purpose. | 136 // Reuse the nextSibling pointer for this purpose. |
| 137 if (tail) | 137 if (tail) |
| 138 tail->setNextSibling(n); | 138 tail->setNextSibling(n); |
| 139 else | 139 else |
| 140 head = n; | 140 head = n; |
| 141 | 141 |
| 142 tail = n; | 142 tail = n; |
| 143 } else { | 143 } else { |
| 144 RefPtr<GenericNode> protect(n); // removedFromDocument may remov
e all references to this node. | 144 RefPtrWillBeRawPtr<GenericNode> protect(n); // removedFromDocume
nt may remove all references to this node. |
| 145 NodeRemovalDispatcher<GenericNode, GenericNodeContainer, ShouldD
ispatchRemovalNotification<GenericNode>::value>::dispatch(*n, container); | 145 NodeRemovalDispatcher<GenericNode, GenericNodeContainer, ShouldD
ispatchRemovalNotification<GenericNode>::value>::dispatch(*n, container); |
| 146 } | 146 } |
| 147 } | 147 } |
| 148 | 148 |
| 149 container.setLastChild(0); | 149 container.setLastChild(0); |
| 150 } | 150 } |
| 151 | 151 |
| 152 } // namespace Private | 152 } // namespace Private |
| 153 | 153 |
| 154 } // namespace WebCore | 154 } // namespace WebCore |
| 155 | 155 |
| 156 #endif // ContainerNodeAlgorithms_h | 156 #endif // ContainerNodeAlgorithms_h |
| OLD | NEW |