| 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 |
| 11 * version 2 of the License, or (at your option) any later version. | 11 * version 2 of the License, or (at your option) any later version. |
| 12 * | 12 * |
| 13 * This library is distributed in the hope that it will be useful, | 13 * This library is distributed in the hope that it will be useful, |
| 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 16 * Library General Public License for more details. | 16 * Library General Public License for more details. |
| 17 * | 17 * |
| 18 * You should have received a copy of the GNU Library General Public License | 18 * You should have received a copy of the GNU Library General Public License |
| 19 * along with this library; see the file COPYING.LIB. If not, write to | 19 * along with this library; see the file COPYING.LIB. If not, write to |
| 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 21 * Boston, MA 02110-1301, USA. | 21 * Boston, MA 02110-1301, USA. |
| 22 * | 22 * |
| 23 */ | 23 */ |
| 24 | 24 |
| 25 #ifndef NodeIterator_h | 25 #ifndef NodeIterator_h |
| 26 #define NodeIterator_h | 26 #define NodeIterator_h |
| 27 | 27 |
| 28 #if USE(JSC) | |
| 29 #include "JSDOMBinding.h" | |
| 30 #endif | |
| 31 #include "NodeFilter.h" | 28 #include "NodeFilter.h" |
| 32 #include "Traversal.h" | 29 #include "Traversal.h" |
| 33 #include <wtf/PassRefPtr.h> | 30 #include <wtf/PassRefPtr.h> |
| 34 #include <wtf/RefCounted.h> | 31 #include <wtf/RefCounted.h> |
| 35 | 32 |
| 36 namespace WebCore { | 33 namespace WebCore { |
| 37 | 34 |
| 35 class ExceptionContext; |
| 36 |
| 38 typedef int ExceptionCode; | 37 typedef int ExceptionCode; |
| 39 | 38 |
| 40 class NodeIterator : public RefCounted<NodeIterator>, public Traversal { | 39 class NodeIterator : public RefCounted<NodeIterator>, public Traversal { |
| 41 public: | 40 public: |
| 42 static PassRefPtr<NodeIterator> create(PassRefPtr<Node> rootNode, unsign
ed whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences) | 41 static PassRefPtr<NodeIterator> create(PassRefPtr<Node> rootNode, unsign
ed whatToShow, PassRefPtr<NodeFilter> filter, bool expandEntityReferences) |
| 43 { | 42 { |
| 44 return adoptRef(new NodeIterator(rootNode, whatToShow, filter, expan
dEntityReferences)); | 43 return adoptRef(new NodeIterator(rootNode, whatToShow, filter, expan
dEntityReferences)); |
| 45 } | 44 } |
| 46 ~NodeIterator(); | 45 ~NodeIterator(); |
| 47 | 46 |
| 48 #if USE(JSC) | 47 PassRefPtr<Node> nextNode(ExceptionContext*, ExceptionCode&); |
| 49 PassRefPtr<Node> nextNode(KJS::ExecState*, ExceptionCode&); | 48 PassRefPtr<Node> previousNode(ExceptionContext*, ExceptionCode&); |
| 50 PassRefPtr<Node> previousNode(KJS::ExecState*, ExceptionCode&); | |
| 51 #endif | |
| 52 void detach(); | 49 void detach(); |
| 53 | 50 |
| 54 Node* referenceNode() const { return m_referenceNode.node.get(); } | 51 Node* referenceNode() const { return m_referenceNode.node.get(); } |
| 55 bool pointerBeforeReferenceNode() const { return m_referenceNode.isPoint
erBeforeNode; } | 52 bool pointerBeforeReferenceNode() const { return m_referenceNode.isPoint
erBeforeNode; } |
| 56 | 53 |
| 57 // This function is called before any node is removed from the document
tree. | 54 // This function is called before any node is removed from the document
tree. |
| 58 void nodeWillBeRemoved(Node*); | 55 void nodeWillBeRemoved(Node*); |
| 59 | 56 |
| 60 #if USE(JSC) | |
| 61 // For non-JS bindings. Silently ignores the JavaScript exception if any
. | 57 // For non-JS bindings. Silently ignores the JavaScript exception if any
. |
| 62 PassRefPtr<Node> nextNode(ExceptionCode& ec) { return nextNode(execState
FromNode(referenceNode()), ec); } | 58 PassRefPtr<Node> nextNode(ExceptionCode& ec); |
| 63 PassRefPtr<Node> previousNode(ExceptionCode& ec) { return previousNode(e
xecStateFromNode(referenceNode()), ec); } | 59 PassRefPtr<Node> previousNode(ExceptionCode& ec); |
| 64 #endif | |
| 65 | 60 |
| 66 private: | 61 private: |
| 67 NodeIterator(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilte
r>, bool expandEntityReferences); | 62 NodeIterator(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilte
r>, bool expandEntityReferences); |
| 68 | 63 |
| 69 struct NodePointer { | 64 struct NodePointer { |
| 70 RefPtr<Node> node; | 65 RefPtr<Node> node; |
| 71 bool isPointerBeforeNode; | 66 bool isPointerBeforeNode; |
| 72 NodePointer(); | 67 NodePointer(); |
| 73 NodePointer(PassRefPtr<Node>, bool); | 68 NodePointer(PassRefPtr<Node>, bool); |
| 74 void clear(); | 69 void clear(); |
| 75 bool moveToNext(Node* root); | 70 bool moveToNext(Node* root); |
| 76 bool moveToPrevious(Node* root); | 71 bool moveToPrevious(Node* root); |
| 77 }; | 72 }; |
| 78 | 73 |
| 79 void updateForNodeRemoval(Node* nodeToBeRemoved, NodePointer&) const; | 74 void updateForNodeRemoval(Node* nodeToBeRemoved, NodePointer&) const; |
| 80 | 75 |
| 81 NodePointer m_referenceNode; | 76 NodePointer m_referenceNode; |
| 82 NodePointer m_candidateNode; | 77 NodePointer m_candidateNode; |
| 83 bool m_detached; | 78 bool m_detached; |
| 84 }; | 79 }; |
| 85 | 80 |
| 86 } // namespace WebCore | 81 } // namespace WebCore |
| 87 | 82 |
| 88 #endif // NodeIterator_h | 83 #endif // NodeIterator_h |
| OLD | NEW |