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 10 matching lines...) Expand all Loading... |
21 * Boston, MA 02110-1301, USA. | 21 * Boston, MA 02110-1301, USA. |
22 * | 22 * |
23 */ | 23 */ |
24 | 24 |
25 #ifndef TreeWalker_h | 25 #ifndef TreeWalker_h |
26 #define TreeWalker_h | 26 #define TreeWalker_h |
27 | 27 |
28 #include "bindings/v8/ScriptWrappable.h" | 28 #include "bindings/v8/ScriptWrappable.h" |
29 #include "core/dom/NodeFilter.h" | 29 #include "core/dom/NodeFilter.h" |
30 #include "core/dom/NodeIteratorBase.h" | 30 #include "core/dom/NodeIteratorBase.h" |
| 31 #include "platform/heap/Handle.h" |
31 #include "wtf/PassRefPtr.h" | 32 #include "wtf/PassRefPtr.h" |
32 #include "wtf/RefCounted.h" | 33 #include "wtf/RefCounted.h" |
33 | 34 |
34 namespace WebCore { | 35 namespace WebCore { |
35 | 36 |
36 class ExceptionState; | 37 class ExceptionState; |
37 | 38 |
38 class TreeWalker : public ScriptWrappable, public RefCounted<TreeWalker>, public
NodeIteratorBase { | 39 class TreeWalker FINAL : public RefCountedWillBeGarbageCollectedFinalized<TreeWa
lker>, public ScriptWrappable, public NodeIteratorBase { |
| 40 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(TreeWalker); |
39 public: | 41 public: |
40 static PassRefPtr<TreeWalker> create(PassRefPtr<Node> rootNode, unsigned wha
tToShow, PassRefPtr<NodeFilter> filter) | 42 static PassRefPtrWillBeRawPtr<TreeWalker> create(PassRefPtrWillBeRawPtr<Node
> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter) |
41 { | 43 { |
42 return adoptRef(new TreeWalker(rootNode, whatToShow, filter)); | 44 return adoptRefWillBeNoop(new TreeWalker(rootNode, whatToShow, filter)); |
43 } | 45 } |
44 | 46 |
45 Node* currentNode() const { return m_current.get(); } | 47 Node* currentNode() const { return m_current.get(); } |
46 void setCurrentNode(PassRefPtr<Node>, ExceptionState&); | 48 void setCurrentNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); |
47 | 49 |
48 Node* parentNode(ExceptionState&); | 50 Node* parentNode(ExceptionState&); |
49 Node* firstChild(ExceptionState&); | 51 Node* firstChild(ExceptionState&); |
50 Node* lastChild(ExceptionState&); | 52 Node* lastChild(ExceptionState&); |
51 Node* previousSibling(ExceptionState&); | 53 Node* previousSibling(ExceptionState&); |
52 Node* nextSibling(ExceptionState&); | 54 Node* nextSibling(ExceptionState&); |
53 Node* previousNode(ExceptionState&); | 55 Node* previousNode(ExceptionState&); |
54 Node* nextNode(ExceptionState&); | 56 Node* nextNode(ExceptionState&); |
55 | 57 |
| 58 void trace(Visitor*); |
| 59 |
56 private: | 60 private: |
57 TreeWalker(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>); | 61 TreeWalker(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefPtrWill
BeRawPtr<NodeFilter>); |
58 | 62 |
59 Node* setCurrent(PassRefPtr<Node>); | 63 Node* setCurrent(PassRefPtrWillBeRawPtr<Node>); |
60 | 64 |
61 RefPtr<Node> m_current; | 65 RefPtrWillBeMember<Node> m_current; |
62 }; | 66 }; |
63 | 67 |
64 } // namespace WebCore | 68 } // namespace WebCore |
65 | 69 |
66 #endif // TreeWalker_h | 70 #endif // TreeWalker_h |
OLD | NEW |