1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/*
* Copyright (C) 2006, 2008 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "config.h"
#include "JSNodeIterator.h"
#include "JSNode.h"
#include "Node.h"
#include "NodeFilter.h"
#include "NodeIterator.h"
using namespace KJS;
namespace WebCore {
void JSNodeIterator::mark()
{
if (NodeFilter* filter = m_impl->filter())
filter->mark();
DOMObject::mark();
}
JSValue* JSNodeIterator::nextNode(ExecState* exec, const List& args)
{
ExceptionCode ec = 0;
JSValue* exception = 0;
Node* node = impl()->nextNode(ec, exception);
if (ec) {
setDOMException(exec, ec);
return jsUndefined();
}
if (exception) {
exec->setException(exception);
return jsUndefined();
}
return toJS(exec, node);
}
JSValue* JSNodeIterator::previousNode(ExecState* exec, const List& args)
{
ExceptionCode ec = 0;
JSValue* exception = 0;
Node* node = impl()->previousNode(ec, exception);
if (ec) {
setDOMException(exec, ec);
return jsUndefined();
}
if (exception) {
exec->setException(exception);
return jsUndefined();
}
return toJS(exec, node);
}
}
|
