| 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 19 matching lines...) Expand all Loading... |
| 30 #include "core/dom/NodeIteratorBase.h" | 30 #include "core/dom/NodeIteratorBase.h" |
| 31 #include "platform/heap/Handle.h" | 31 #include "platform/heap/Handle.h" |
| 32 #include "wtf/PassRefPtr.h" | 32 #include "wtf/PassRefPtr.h" |
| 33 #include "wtf/RefCounted.h" | 33 #include "wtf/RefCounted.h" |
| 34 | 34 |
| 35 namespace blink { | 35 namespace blink { |
| 36 | 36 |
| 37 class ExceptionState; | 37 class ExceptionState; |
| 38 | 38 |
| 39 class NodeIterator FINAL : public RefCountedWillBeGarbageCollected<NodeIterator>
, public ScriptWrappable, public NodeIteratorBase { | 39 class NodeIterator FINAL : public RefCountedWillBeGarbageCollected<NodeIterator>
, public ScriptWrappable, public NodeIteratorBase { |
| 40 DEFINE_WRAPPERTYPEINFO(); |
| 40 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(NodeIterator); | 41 WILL_BE_USING_GARBAGE_COLLECTED_MIXIN(NodeIterator); |
| 41 public: | 42 public: |
| 42 static PassRefPtrWillBeRawPtr<NodeIterator> create(PassRefPtrWillBeRawPtr<No
de> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter) | 43 static PassRefPtrWillBeRawPtr<NodeIterator> create(PassRefPtrWillBeRawPtr<No
de> rootNode, unsigned whatToShow, PassRefPtrWillBeRawPtr<NodeFilter> filter) |
| 43 { | 44 { |
| 44 return adoptRefWillBeNoop(new NodeIterator(rootNode, whatToShow, filter)
); | 45 return adoptRefWillBeNoop(new NodeIterator(rootNode, whatToShow, filter)
); |
| 45 } | 46 } |
| 46 | 47 |
| 47 #if !ENABLE(OILPAN) | 48 #if !ENABLE(OILPAN) |
| 48 ~NodeIterator(); | 49 ~NodeIterator(); |
| 49 #endif | 50 #endif |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 84 | 85 |
| 85 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const; | 86 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const; |
| 86 | 87 |
| 87 NodePointer m_referenceNode; | 88 NodePointer m_referenceNode; |
| 88 NodePointer m_candidateNode; | 89 NodePointer m_candidateNode; |
| 89 }; | 90 }; |
| 90 | 91 |
| 91 } // namespace blink | 92 } // namespace blink |
| 92 | 93 |
| 93 #endif // NodeIterator_h | 94 #endif // NodeIterator_h |
| OLD | NEW |