| 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 23 matching lines...) Expand all Loading... |
| 34 class Node; | 34 class Node; |
| 35 class NodeFilter; | 35 class NodeFilter; |
| 36 | 36 |
| 37 class NodeIteratorBase : public WillBeGarbageCollectedMixin { | 37 class NodeIteratorBase : public WillBeGarbageCollectedMixin { |
| 38 DECLARE_EMPTY_VIRTUAL_DESTRUCTOR_WILL_BE_REMOVED(NodeIteratorBase); | 38 DECLARE_EMPTY_VIRTUAL_DESTRUCTOR_WILL_BE_REMOVED(NodeIteratorBase); |
| 39 public: | 39 public: |
| 40 Node* root() const { return m_root.get(); } | 40 Node* root() const { return m_root.get(); } |
| 41 unsigned whatToShow() const { return m_whatToShow; } | 41 unsigned whatToShow() const { return m_whatToShow; } |
| 42 NodeFilter* filter() const { return m_filter.get(); } | 42 NodeFilter* filter() const { return m_filter.get(); } |
| 43 | 43 |
| 44 virtual void trace(Visitor*); | 44 DECLARE_VIRTUAL_TRACE(); |
| 45 | 45 |
| 46 protected: | 46 protected: |
| 47 NodeIteratorBase(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefP
trWillBeRawPtr<NodeFilter>); | 47 NodeIteratorBase(PassRefPtrWillBeRawPtr<Node>, unsigned whatToShow, PassRefP
trWillBeRawPtr<NodeFilter>); |
| 48 short acceptNode(Node*, ExceptionState&) const; | 48 short acceptNode(Node*, ExceptionState&) const; |
| 49 | 49 |
| 50 private: | 50 private: |
| 51 RefPtrWillBeMember<Node> m_root; | 51 RefPtrWillBeMember<Node> m_root; |
| 52 unsigned m_whatToShow; | 52 unsigned m_whatToShow; |
| 53 RefPtrWillBeMember<NodeFilter> m_filter; | 53 RefPtrWillBeMember<NodeFilter> m_filter; |
| 54 }; | 54 }; |
| 55 | 55 |
| 56 } // namespace blink | 56 } // namespace blink |
| 57 | 57 |
| 58 #endif // NodeIteratorBase_h | 58 #endif // NodeIteratorBase_h |
| OLD | NEW |