OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
All rights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
All rights reserved. |
6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
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 NodeTraversal_h | 25 #ifndef NodeTraversal_h |
26 #define NodeTraversal_h | 26 #define NodeTraversal_h |
27 | 27 |
28 #include "core/dom/Node.h" | 28 #include "core/dom/Node.h" |
| 29 #include "wtf/TreeNode.h" |
29 | 30 |
30 namespace WebCore { | 31 namespace WebCore { |
31 | 32 |
32 namespace NodeTraversal { | 33 namespace NodeTraversal { |
33 | 34 |
34 // Does a pre-order traversal of the tree to find the next node after this one. | 35 // Does a pre-order traversal of the tree to find the next node after this one. |
35 // This uses the same order that tags appear in the source file. If the stayWith
in | 36 // This uses the same order that tags appear in the source file. If the stayWith
in |
36 // argument is non-null, the traversal will stop once the specified node is reac
hed. | 37 // argument is non-null, the traversal will stop once the specified node is reac
hed. |
37 // This can be used to restrict traversal to a particular sub-tree. | 38 // This can be used to restrict traversal to a particular sub-tree. |
38 Node* next(const Node&); | 39 Node* next(const Node&); |
(...skipping 21 matching lines...) Expand all Loading... |
60 Node* previousSkippingChildrenPostOrder(const Node&, const Node* stayWithin = 0)
; | 61 Node* previousSkippingChildrenPostOrder(const Node&, const Node* stayWithin = 0)
; |
61 | 62 |
62 // Pre-order traversal including the pseudo-elements. | 63 // Pre-order traversal including the pseudo-elements. |
63 Node* previousIncludingPseudo(const Node&, const Node* stayWithin = 0); | 64 Node* previousIncludingPseudo(const Node&, const Node* stayWithin = 0); |
64 Node* nextIncludingPseudo(const Node&, const Node* stayWithin = 0); | 65 Node* nextIncludingPseudo(const Node&, const Node* stayWithin = 0); |
65 Node* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin =
0); | 66 Node* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin =
0); |
66 | 67 |
67 Node* nextAncestorSibling(const Node&); | 68 Node* nextAncestorSibling(const Node&); |
68 Node* nextAncestorSibling(const Node&, const Node* stayWithin); | 69 Node* nextAncestorSibling(const Node&, const Node* stayWithin); |
69 | 70 |
70 template <class NodeType> | 71 inline Node* next(const Node& current) { return traverseNext(current); } |
71 inline Node* traverseNextTemplate(NodeType& current) | 72 inline Node* next(const ContainerNode& current) { return traverseNext<Node>(curr
ent); } |
72 { | |
73 if (current.firstChild()) | |
74 return current.firstChild(); | |
75 if (current.nextSibling()) | |
76 return current.nextSibling(); | |
77 return nextAncestorSibling(current); | |
78 } | |
79 inline Node* next(const Node& current) { return traverseNextTemplate(current); } | |
80 inline Node* next(const ContainerNode& current) { return traverseNextTemplate(cu
rrent); } | |
81 | 73 |
82 template <class NodeType> | 74 inline Node* next(const Node& current, const Node* stayWithin) { return traverse
Next(current, stayWithin); } |
83 inline Node* traverseNextTemplate(NodeType& current, const Node* stayWithin) | 75 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return
traverseNext<Node>(current, stayWithin); } |
84 { | |
85 if (current.firstChild()) | |
86 return current.firstChild(); | |
87 if (current == stayWithin) | |
88 return 0; | |
89 if (current.nextSibling()) | |
90 return current.nextSibling(); | |
91 return nextAncestorSibling(current, stayWithin); | |
92 } | |
93 inline Node* next(const Node& current, const Node* stayWithin) { return traverse
NextTemplate(current, stayWithin); } | |
94 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return
traverseNextTemplate(current, stayWithin); } | |
95 | 76 |
96 template <class NodeType> | 77 inline Node* nextSkippingChildren(const Node& current) { return traverseNextSkip
pingChildren(current); } |
97 inline Node* traverseNextSkippingChildrenTemplate(NodeType& current) | 78 inline Node* nextSkippingChildren(const ContainerNode& current) { return travers
eNextSkippingChildren<Node>(current); } |
98 { | |
99 if (current.nextSibling()) | |
100 return current.nextSibling(); | |
101 return nextAncestorSibling(current); | |
102 } | |
103 inline Node* nextSkippingChildren(const Node& current) { return traverseNextSkip
pingChildrenTemplate(current); } | |
104 inline Node* nextSkippingChildren(const ContainerNode& current) { return travers
eNextSkippingChildrenTemplate(current); } | |
105 | 79 |
106 template <class NodeType> | 80 inline Node* nextSkippingChildren(const Node& current, const Node* stayWithin) {
return traverseNextSkippingChildren(current, stayWithin); } |
107 inline Node* traverseNextSkippingChildrenTemplate(NodeType& current, const Node*
stayWithin) | 81 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stay
Within) { return traverseNextSkippingChildren<Node>(current, stayWithin); } |
108 { | |
109 if (current == stayWithin) | |
110 return 0; | |
111 if (current.nextSibling()) | |
112 return current.nextSibling(); | |
113 return nextAncestorSibling(current, stayWithin); | |
114 } | |
115 inline Node* nextSkippingChildren(const Node& current, const Node* stayWithin) {
return traverseNextSkippingChildrenTemplate(current, stayWithin); } | |
116 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stay
Within) { return traverseNextSkippingChildrenTemplate(current, stayWithin); } | |
117 | 82 |
118 } | 83 } |
119 | 84 |
120 } | 85 } |
121 | 86 |
122 #endif | 87 #endif |
OLD | NEW |