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 21 matching lines...) Expand all Loading... |
32 #include "core/dom/NodeTraversal.h" | 32 #include "core/dom/NodeTraversal.h" |
33 | 33 |
34 namespace blink { | 34 namespace blink { |
35 | 35 |
36 TreeWalker::TreeWalker(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToSho
w, PassRefPtrWillBeRawPtr<NodeFilter> filter) | 36 TreeWalker::TreeWalker(PassRefPtrWillBeRawPtr<Node> rootNode, unsigned whatToSho
w, PassRefPtrWillBeRawPtr<NodeFilter> filter) |
37 : NodeIteratorBase(rootNode, whatToShow, filter) | 37 : NodeIteratorBase(rootNode, whatToShow, filter) |
38 , m_current(root()) | 38 , m_current(root()) |
39 { | 39 { |
40 } | 40 } |
41 | 41 |
42 void TreeWalker::setCurrentNode(PassRefPtrWillBeRawPtr<Node> node, ExceptionStat
e& exceptionState) | 42 void TreeWalker::setCurrentNode(PassRefPtrWillBeRawPtr<Node> node) |
43 { | 43 { |
44 if (!node) { | 44 ASSERT(node); |
45 exceptionState.throwDOMException(NotSupportedError, ExceptionMessages::a
rgumentNullOrIncorrectType(1, "Node")); | |
46 return; | |
47 } | |
48 m_current = node; | 45 m_current = node; |
49 } | 46 } |
50 | 47 |
51 inline Node* TreeWalker::setCurrent(PassRefPtrWillBeRawPtr<Node> node) | 48 inline Node* TreeWalker::setCurrent(PassRefPtrWillBeRawPtr<Node> node) |
52 { | 49 { |
53 m_current = node; | 50 m_current = node; |
54 return m_current.get(); | 51 return m_current.get(); |
55 } | 52 } |
56 | 53 |
57 Node* TreeWalker::parentNode(ExceptionState& exceptionState) | 54 Node* TreeWalker::parentNode(ExceptionState& exceptionState) |
(...skipping 218 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
276 return 0; | 273 return 0; |
277 } | 274 } |
278 | 275 |
279 DEFINE_TRACE(TreeWalker) | 276 DEFINE_TRACE(TreeWalker) |
280 { | 277 { |
281 visitor->trace(m_current); | 278 visitor->trace(m_current); |
282 NodeIteratorBase::trace(visitor); | 279 NodeIteratorBase::trace(visitor); |
283 } | 280 } |
284 | 281 |
285 } // namespace blink | 282 } // namespace blink |
OLD | NEW |