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) 2000 Frederik Holljen (frederik.holljen@hig.no) | 3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no) |
4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) | 4 * Copyright (C) 2001 Peter Kelly (pmk@post.com) |
5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) | 5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) |
6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. | 6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 192 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
203 if (willRemoveReferenceNodeAncestor) { | 203 if (willRemoveReferenceNodeAncestor) { |
204 while (node && node->isDescendantOf(&removedNode)) | 204 while (node && node->isDescendantOf(&removedNode)) |
205 node = NodeTraversal::previous(*node, root()); | 205 node = NodeTraversal::previous(*node, root()); |
206 } | 206 } |
207 if (node) | 207 if (node) |
208 referenceNode.node = node; | 208 referenceNode.node = node; |
209 } | 209 } |
210 } | 210 } |
211 } | 211 } |
212 | 212 |
213 void NodeIterator::trace(Visitor* visitor) | 213 DEFINE_TRACE(NodeIterator) |
214 { | 214 { |
215 visitor->trace(m_referenceNode); | 215 visitor->trace(m_referenceNode); |
216 visitor->trace(m_candidateNode); | 216 visitor->trace(m_candidateNode); |
217 NodeIteratorBase::trace(visitor); | 217 NodeIteratorBase::trace(visitor); |
218 } | 218 } |
219 | 219 |
220 } // namespace blink | 220 } // namespace blink |
OLD | NEW |