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 |
(...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
49 Element* nextSkippingChildren(const ContainerNode&, const Node* stayWithin); | 49 Element* nextSkippingChildren(const ContainerNode&, const Node* stayWithin); |
50 | 50 |
51 // Pre-order traversal including the pseudo-elements. | 51 // Pre-order traversal including the pseudo-elements. |
52 Element* previousIncludingPseudo(const Node&, const Node* stayWithin = 0); | 52 Element* previousIncludingPseudo(const Node&, const Node* stayWithin = 0); |
53 Element* nextIncludingPseudo(const Node&, const Node* stayWithin = 0); | 53 Element* nextIncludingPseudo(const Node&, const Node* stayWithin = 0); |
54 Element* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin = 0); | 54 Element* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin = 0); |
55 | 55 |
56 // Utility function to traverse only the element and pseudo-element siblings of a node. | 56 // Utility function to traverse only the element and pseudo-element siblings of a node. |
57 Element* pseudoAwarePreviousSibling(const Node&); | 57 Element* pseudoAwarePreviousSibling(const Node&); |
58 | 58 |
59 // Next sibling. | |
60 Element* nextSibling(const Node&); | |
61 | |
59 template <class NodeType> | 62 template <class NodeType> |
60 inline Element* firstElementWithinTemplate(NodeType& current) | 63 inline Element* firstElementWithinTemplate(NodeType& current) |
61 { | 64 { |
62 // Except for the root containers, only elements can have element children. | 65 // Except for the root containers, only elements can have element children. |
63 Node* node = current.firstChild(); | 66 Node* node = current.firstChild(); |
64 while (node && !node->isElementNode()) | 67 while (node && !node->isElementNode()) |
65 node = node->nextSibling(); | 68 node = node->nextSibling(); |
66 return toElement(node); | 69 return toElement(node); |
67 } | 70 } |
68 inline Element* firstWithin(const ContainerNode& current) { return firstElementW ithinTemplate(current); } | 71 inline Element* firstWithin(const ContainerNode& current) { return firstElementW ithinTemplate(current); } |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
137 } | 140 } |
138 | 141 |
139 inline Element* pseudoAwarePreviousSibling(const Node& current) | 142 inline Element* pseudoAwarePreviousSibling(const Node& current) |
140 { | 143 { |
141 Node* node = current.pseudoAwarePreviousSibling(); | 144 Node* node = current.pseudoAwarePreviousSibling(); |
142 while (node && !node->isElementNode()) | 145 while (node && !node->isElementNode()) |
143 node = node->pseudoAwarePreviousSibling(); | 146 node = node->pseudoAwarePreviousSibling(); |
144 return toElement(node); | 147 return toElement(node); |
145 } | 148 } |
146 | 149 |
150 inline Element* nextSibling(const Node& current) | |
adamk
2014/02/13 21:42:58
This is an exact duplicate of Node::nextElementSib
Inactive
2014/02/13 21:51:37
Yes and ElementTraversal::firstWithin() is identic
| |
151 { | |
152 Node* node = current.nextSibling(); | |
153 while (node && !node->isElementNode()) | |
154 node = node->nextSibling(); | |
155 return toElement(node); | |
156 } | |
157 | |
147 } | 158 } |
148 | 159 |
149 } | 160 } |
150 | 161 |
151 #endif | 162 #endif |
OLD | NEW |