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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 if (!is_pointer_before_node) { | 57 if (!is_pointer_before_node) { |
58 is_pointer_before_node = true; | 58 is_pointer_before_node = true; |
59 return true; | 59 return true; |
60 } | 60 } |
61 node = NodeTraversal::Previous(*node, root); | 61 node = NodeTraversal::Previous(*node, root); |
62 return node; | 62 return node; |
63 } | 63 } |
64 | 64 |
65 NodeIterator::NodeIterator(Node* root_node, | 65 NodeIterator::NodeIterator(Node* root_node, |
66 unsigned what_to_show, | 66 unsigned what_to_show, |
67 NodeFilter* filter) | 67 V8NodeFilterCondition* filter) |
68 : NodeIteratorBase(this, root_node, what_to_show, filter), | 68 : NodeIteratorBase(this, root_node, what_to_show, filter), |
69 reference_node_(root(), true) { | 69 reference_node_(root(), true) { |
70 // If NodeIterator target is Attr node, don't subscribe for nodeWillBeRemoved, | 70 // If NodeIterator target is Attr node, don't subscribe for nodeWillBeRemoved, |
71 // as it would never have child nodes. | 71 // as it would never have child nodes. |
72 if (!root()->IsAttributeNode()) | 72 if (!root()->IsAttributeNode()) |
73 root()->GetDocument().AttachNodeIterator(this); | 73 root()->GetDocument().AttachNodeIterator(this); |
74 } | 74 } |
75 | 75 |
76 Node* NodeIterator::nextNode(ExceptionState& exception_state) { | 76 Node* NodeIterator::nextNode(ExceptionState& exception_state) { |
77 Node* result = nullptr; | 77 Node* result = nullptr; |
(...skipping 124 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
202 visitor->Trace(reference_node_); | 202 visitor->Trace(reference_node_); |
203 visitor->Trace(candidate_node_); | 203 visitor->Trace(candidate_node_); |
204 NodeIteratorBase::Trace(visitor); | 204 NodeIteratorBase::Trace(visitor); |
205 } | 205 } |
206 | 206 |
207 DEFINE_TRACE_WRAPPERS(NodeIterator) { | 207 DEFINE_TRACE_WRAPPERS(NodeIterator) { |
208 NodeIteratorBase::TraceWrappers(visitor); | 208 NodeIteratorBase::TraceWrappers(visitor); |
209 } | 209 } |
210 | 210 |
211 } // namespace blink | 211 } // namespace blink |
OLD | NEW |