blob: 4c504bf75c2d76258aeda16eb2f7ae80e1f5b46c [file] [log] [blame]
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +01001/*
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
4 * Copyright (C) 2001 Peter Kelly (pmk@post.com)
5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)
6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.
7 *
8 * This library is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Library General Public
10 * License as published by the Free Software Foundation; either
11 * version 2 of the License, or (at your option) any later version.
12 *
13 * This library is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * Library General Public License for more details.
17 *
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
20 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
21 * Boston, MA 02110-1301, USA.
22 *
23 */
24
25#ifndef NodeIterator_h
26#define NodeIterator_h
27
28#include "bindings/v8/ScriptWrappable.h"
29#include "core/dom/NodeFilter.h"
30#include "core/dom/Traversal.h"
Ben Murdoche69819b2013-07-17 14:56:49 +010031#include "wtf/PassRefPtr.h"
32#include "wtf/RefCounted.h"
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010033
34namespace WebCore {
35
Ben Murdochdf957042013-08-06 11:01:27 +010036class ExceptionState;
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010037
Ben Murdochdf957042013-08-06 11:01:27 +010038class NodeIterator : public ScriptWrappable, public RefCounted<NodeIterator>, public Traversal {
39public:
40 static PassRefPtr<NodeIterator> create(PassRefPtr<Node> rootNode, unsigned whatToShow, PassRefPtr<NodeFilter> filter)
41 {
42 return adoptRef(new NodeIterator(rootNode, whatToShow, filter));
43 }
44 ~NodeIterator();
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010045
Ben Murdochdf957042013-08-06 11:01:27 +010046 PassRefPtr<Node> nextNode(ScriptState*, ExceptionState&);
47 PassRefPtr<Node> previousNode(ScriptState*, ExceptionState&);
48 void detach();
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010049
Ben Murdochdf957042013-08-06 11:01:27 +010050 Node* referenceNode() const { return m_referenceNode.node.get(); }
51 bool pointerBeforeReferenceNode() const { return m_referenceNode.isPointerBeforeNode; }
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010052
Ben Murdochdf957042013-08-06 11:01:27 +010053 // This function is called before any node is removed from the document tree.
54 void nodeWillBeRemoved(Node*);
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010055
Ben Murdochdf957042013-08-06 11:01:27 +010056private:
57 NodeIterator(PassRefPtr<Node>, unsigned whatToShow, PassRefPtr<NodeFilter>);
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010058
Ben Murdochdf957042013-08-06 11:01:27 +010059 struct NodePointer {
60 RefPtr<Node> node;
61 bool isPointerBeforeNode;
62 NodePointer();
63 NodePointer(PassRefPtr<Node>, bool);
64 void clear();
65 bool moveToNext(Node* root);
66 bool moveToPrevious(Node* root);
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010067 };
68
Ben Murdochdf957042013-08-06 11:01:27 +010069 void updateForNodeRemoval(Node* nodeToBeRemoved, NodePointer&) const;
70
71 NodePointer m_referenceNode;
72 NodePointer m_candidateNode;
73 bool m_detached;
74};
75
Torne (Richard Coles)53e740f2013-05-09 18:38:43 +010076} // namespace WebCore
77
78#endif // NodeIterator_h