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 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
65 if (!node) | 65 if (!node) |
66 return false; | 66 return false; |
67 if (!isPointerBeforeNode) { | 67 if (!isPointerBeforeNode) { |
68 isPointerBeforeNode = true; | 68 isPointerBeforeNode = true; |
69 return true; | 69 return true; |
70 } | 70 } |
71 node = NodeTraversal::previous(node.get(), root); | 71 node = NodeTraversal::previous(node.get(), root); |
72 return node; | 72 return node; |
73 } | 73 } |
74 | 74 |
75 NodeIterator::NodeIterator(PassRefPtr<Node> rootNode, unsigned whatToShow, PassR
efPtr<NodeFilter> filter, bool expandEntityReferences) | 75 NodeIterator::NodeIterator(PassRefPtr<Node> rootNode, unsigned whatToShow, PassR
efPtr<NodeFilter> filter) |
76 : Traversal(rootNode, whatToShow, filter, expandEntityReferences) | 76 : Traversal(rootNode, whatToShow, filter) |
77 , m_referenceNode(root(), true) | 77 , m_referenceNode(root(), true) |
78 , m_detached(false) | 78 , m_detached(false) |
79 { | 79 { |
80 // Document type nodes may have a null document. But since they can't have c
hildren, there is no need to listen for modifications to these. | 80 // Document type nodes may have a null document. But since they can't have c
hildren, there is no need to listen for modifications to these. |
81 ASSERT(root()->document() || root()->nodeType() == Node::DOCUMENT_TYPE_NODE)
; | 81 ASSERT(root()->document() || root()->nodeType() == Node::DOCUMENT_TYPE_NODE)
; |
82 ScriptWrappable::init(this); | 82 ScriptWrappable::init(this); |
83 if (Document* ownerDocument = root()->document()) | 83 if (Document* ownerDocument = root()->document()) |
84 ownerDocument->attachNodeIterator(this); | 84 ownerDocument->attachNodeIterator(this); |
85 } | 85 } |
86 | 86 |
(...skipping 139 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
226 node = NodeTraversal::previous(node, root()); | 226 node = NodeTraversal::previous(node, root()); |
227 } | 227 } |
228 if (node) | 228 if (node) |
229 referenceNode.node = node; | 229 referenceNode.node = node; |
230 } | 230 } |
231 } | 231 } |
232 } | 232 } |
233 | 233 |
234 | 234 |
235 } // namespace WebCore | 235 } // namespace WebCore |
OLD | NEW |