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 28 matching lines...) Expand all Loading... |
39 class TreeWalker final : public RefCountedWillBeGarbageCollected<TreeWalker>, pu
blic ScriptWrappable, public NodeIteratorBase { | 39 class TreeWalker final : public RefCountedWillBeGarbageCollected<TreeWalker>, pu
blic ScriptWrappable, public NodeIteratorBase { |
40 DEFINE_WRAPPERTYPEINFO(); | 40 DEFINE_WRAPPERTYPEINFO(); |
41 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(TreeWalker); | 41 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(TreeWalker); |
42 public: | 42 public: |
43 static PassRefPtrWillBeRawPtr<TreeWalker> create(PassRefPtrWillBeRawPtr<Node
> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter) | 43 static PassRefPtrWillBeRawPtr<TreeWalker> create(PassRefPtrWillBeRawPtr<Node
> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter) |
44 { | 44 { |
45 return adoptRefWillBeNoop(new TreeWalker(rootNode, whatToShow, filter)); | 45 return adoptRefWillBeNoop(new TreeWalker(rootNode, whatToShow, filter)); |
46 } | 46 } |
47 | 47 |
48 Node* currentNode() const { return m_current.get(); } | 48 Node* currentNode() const { return m_current.get(); } |
49 void setCurrentNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); | 49 void setCurrentNode(PassRefPtrWillBeRawPtr<Node>); |
50 | 50 |
51 Node* parentNode(ExceptionState&); | 51 Node* parentNode(ExceptionState&); |
52 Node* firstChild(ExceptionState&); | 52 Node* firstChild(ExceptionState&); |
53 Node* lastChild(ExceptionState&); | 53 Node* lastChild(ExceptionState&); |
54 Node* previousSibling(ExceptionState&); | 54 Node* previousSibling(ExceptionState&); |
55 Node* nextSibling(ExceptionState&); | 55 Node* nextSibling(ExceptionState&); |
56 Node* previousNode(ExceptionState&); | 56 Node* previousNode(ExceptionState&); |
57 Node* nextNode(ExceptionState&); | 57 Node* nextNode(ExceptionState&); |
58 | 58 |
59 DECLARE_TRACE(); | 59 DECLARE_TRACE(); |
60 | 60 |
61 private: | 61 private: |
62 TreeWalker(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefPtrWill
BeRawPtr<NodeFilter>); | 62 TreeWalker(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefPtrWill
BeRawPtr<NodeFilter>); |
63 | 63 |
64 Node* setCurrent(PassRefPtrWillBeRawPtr<Node>); | 64 Node* setCurrent(PassRefPtrWillBeRawPtr<Node>); |
65 | 65 |
66 RefPtrWillBeMember<Node> m_current; | 66 RefPtrWillBeMember<Node> m_current; |
67 }; | 67 }; |
68 | 68 |
69 } // namespace blink | 69 } // namespace blink |
70 | 70 |
71 #endif // TreeWalker_h | 71 #endif // TreeWalker_h |
OLD | NEW |