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.
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.
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.
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.
28 #include "JSDOMBinding.h"
29 #include "NodeFilter.h"
30 #include "Traversal.h"
31 #include <wtf/PassRefPtr.h>
32 #include <wtf/RefCounted.h>
36 typedef int ExceptionCode
;
38 class TreeWalker
: public RefCounted
<TreeWalker
>, public Traversal
{
40 static PassRefPtr
<TreeWalker
> create(PassRefPtr
<Node
> rootNode
, unsigned whatToShow
, PassRefPtr
<NodeFilter
> filter
, bool expandEntityReferences
)
42 return adoptRef(new TreeWalker(rootNode
, whatToShow
, filter
, expandEntityReferences
));
45 Node
* currentNode() const { return m_current
.get(); }
46 void setCurrentNode(PassRefPtr
<Node
>, ExceptionCode
&);
48 Node
* parentNode(JSC::ExecState
*);
49 Node
* firstChild(JSC::ExecState
*);
50 Node
* lastChild(JSC::ExecState
*);
51 Node
* previousSibling(JSC::ExecState
*);
52 Node
* nextSibling(JSC::ExecState
*);
53 Node
* previousNode(JSC::ExecState
*);
54 Node
* nextNode(JSC::ExecState
*);
56 // For non-JS bindings. Silently ignores the JavaScript exception if any.
57 Node
* parentNode() { return parentNode(execStateFromNode(m_current
.get())); }
58 Node
* firstChild() { return firstChild(execStateFromNode(m_current
.get())); }
59 Node
* lastChild() { return lastChild(execStateFromNode(m_current
.get())); }
60 Node
* previousSibling() { return previousSibling(execStateFromNode(m_current
.get())); }
61 Node
* nextSibling() { return nextSibling(execStateFromNode(m_current
.get())); }
62 Node
* previousNode() { return previousNode(execStateFromNode(m_current
.get())); }
63 Node
* nextNode() { return nextNode(execStateFromNode(m_current
.get())); }
66 TreeWalker(PassRefPtr
<Node
>, unsigned whatToShow
, PassRefPtr
<NodeFilter
>, bool expandEntityReferences
);
68 Node
* setCurrent(PassRefPtr
<Node
>);
70 RefPtr
<Node
> m_current
;
73 } // namespace WebCore
75 #endif // TreeWalker_h