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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller (mueller@kde.org)
* Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.
* Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
*
* 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 "core/dom/NodeTraversal.h"
#include "core/dom/ContainerNode.h"
namespace WebCore {
namespace NodeTraversal {
Node* previousIncludingPseudo(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (Node* previous = current.pseudoAwarePreviousSibling()) {
while (previous->pseudoAwareLastChild())
previous = previous->pseudoAwareLastChild();
return previous;
}
return current.parentNode();
}
Node* nextIncludingPseudo(const Node& current, const Node* stayWithin)
{
if (Node* next = current.pseudoAwareFirstChild())
return next;
if (current == stayWithin)
return 0;
if (Node* next = current.pseudoAwareNextSibling())
return next;
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent == stayWithin)
return 0;
if (Node* next = parent->pseudoAwareNextSibling())
return next;
}
return 0;
}
Node* nextIncludingPseudoSkippingChildren(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (Node* next = current.pseudoAwareNextSibling())
return next;
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent == stayWithin)
return 0;
if (Node* next = parent->pseudoAwareNextSibling())
return next;
}
return 0;
}
Node* nextAncestorSibling(const Node& current)
{
ASSERT(!current.nextSibling());
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent->nextSibling())
return parent->nextSibling();
}
return 0;
}
Node* nextAncestorSibling(const Node& current, const Node* stayWithin)
{
ASSERT(!current.nextSibling());
ASSERT(current != stayWithin);
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent == stayWithin)
return 0;
if (parent->nextSibling())
return parent->nextSibling();
}
return 0;
}
Node* previous(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (current.previousSibling()) {
Node* previous = current.previousSibling();
while (previous->lastChild())
previous = previous->lastChild();
return previous;
}
return current.parentNode();
}
Node* previousSkippingChildren(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (current.previousSibling())
return current.previousSibling();
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent == stayWithin)
return 0;
if (parent->previousSibling())
return parent->previousSibling();
}
return 0;
}
Node* nextPostOrder(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (!current.nextSibling())
return current.parentNode();
Node* next = current.nextSibling();
while (next->firstChild())
next = next->firstChild();
return next;
}
static Node* previousAncestorSiblingPostOrder(const Node& current, const Node* stayWithin)
{
ASSERT(!current.previousSibling());
for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) {
if (parent == stayWithin)
return 0;
if (parent->previousSibling())
return parent->previousSibling();
}
return 0;
}
Node* previousPostOrder(const Node& current, const Node* stayWithin)
{
if (current.lastChild())
return current.lastChild();
if (current == stayWithin)
return 0;
if (current.previousSibling())
return current.previousSibling();
return previousAncestorSiblingPostOrder(current, stayWithin);
}
Node* previousSkippingChildrenPostOrder(const Node& current, const Node* stayWithin)
{
if (current == stayWithin)
return 0;
if (current.previousSibling())
return current.previousSibling();
return previousAncestorSiblingPostOrder(current, stayWithin);
}
}
}
|
