| 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 25 matching lines...) Expand all Loading... |
| 36 | 36 |
| 37 class TreeWalker final : public GarbageCollected<TreeWalker>, | 37 class TreeWalker final : public GarbageCollected<TreeWalker>, |
| 38 public ScriptWrappable, | 38 public ScriptWrappable, |
| 39 public NodeIteratorBase { | 39 public NodeIteratorBase { |
| 40 DEFINE_WRAPPERTYPEINFO(); | 40 DEFINE_WRAPPERTYPEINFO(); |
| 41 USING_GARBAGE_COLLECTED_MIXIN(TreeWalker); | 41 USING_GARBAGE_COLLECTED_MIXIN(TreeWalker); |
| 42 | 42 |
| 43 public: | 43 public: |
| 44 static TreeWalker* Create(Node* root_node, | 44 static TreeWalker* Create(Node* root_node, |
| 45 unsigned what_to_show, | 45 unsigned what_to_show, |
| 46 NodeFilter* filter) { | 46 V8NodeFilterCondition* filter) { |
| 47 return new TreeWalker(root_node, what_to_show, filter); | 47 return new TreeWalker(root_node, what_to_show, filter); |
| 48 } | 48 } |
| 49 | 49 |
| 50 Node* currentNode() const { return current_.Get(); } | 50 Node* currentNode() const { return current_.Get(); } |
| 51 void setCurrentNode(Node*); | 51 void setCurrentNode(Node*); |
| 52 | 52 |
| 53 Node* parentNode(ExceptionState&); | 53 Node* parentNode(ExceptionState&); |
| 54 Node* firstChild(ExceptionState&); | 54 Node* firstChild(ExceptionState&); |
| 55 Node* lastChild(ExceptionState&); | 55 Node* lastChild(ExceptionState&); |
| 56 Node* previousSibling(ExceptionState&); | 56 Node* previousSibling(ExceptionState&); |
| 57 Node* nextSibling(ExceptionState&); | 57 Node* nextSibling(ExceptionState&); |
| 58 Node* previousNode(ExceptionState&); | 58 Node* previousNode(ExceptionState&); |
| 59 Node* nextNode(ExceptionState&); | 59 Node* nextNode(ExceptionState&); |
| 60 | 60 |
| 61 DECLARE_TRACE(); | 61 DECLARE_TRACE(); |
| 62 | 62 |
| 63 DECLARE_VIRTUAL_TRACE_WRAPPERS(); | 63 DECLARE_VIRTUAL_TRACE_WRAPPERS(); |
| 64 | 64 |
| 65 private: | 65 private: |
| 66 TreeWalker(Node*, unsigned what_to_show, NodeFilter*); | 66 TreeWalker(Node*, unsigned what_to_show, V8NodeFilterCondition*); |
| 67 | 67 |
| 68 Node* SetCurrent(Node*); | 68 Node* SetCurrent(Node*); |
| 69 | 69 |
| 70 Member<Node> current_; | 70 Member<Node> current_; |
| 71 }; | 71 }; |
| 72 | 72 |
| 73 } // namespace blink | 73 } // namespace blink |
| 74 | 74 |
| 75 #endif // TreeWalker_h | 75 #endif // TreeWalker_h |
| OLD | NEW |