OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
98 | 98 |
99 static Node* traverseNextSibling(const Node*); | 99 static Node* traverseNextSibling(const Node*); |
100 static Node* traversePreviousSibling(const Node*); | 100 static Node* traversePreviousSibling(const Node*); |
101 | 101 |
102 static Node* traverseSiblingOrBackToInsertionPoint(const Node*, TraversalDir
ection); | 102 static Node* traverseSiblingOrBackToInsertionPoint(const Node*, TraversalDir
ection); |
103 static Node* traverseSiblingInCurrentTree(const Node*, TraversalDirection); | 103 static Node* traverseSiblingInCurrentTree(const Node*, TraversalDirection); |
104 | 104 |
105 static Node* traverseSiblings(const Node*, TraversalDirection); | 105 static Node* traverseSiblings(const Node*, TraversalDirection); |
106 static Node* traverseDistributedNodes(const Node*, const InsertionPoint*, Tr
aversalDirection); | 106 static Node* traverseDistributedNodes(const Node*, const InsertionPoint*, Tr
aversalDirection); |
107 | 107 |
108 static Node* traverseBackToYoungerShadowRoot(const Node*, TraversalDirection
); | |
109 | |
110 Node* traverseParentOrHost(const Node*) const; | 108 Node* traverseParentOrHost(const Node*) const; |
111 | 109 |
112 RawPtr<const Node> m_node; | 110 RawPtr<const Node> m_node; |
113 }; | 111 }; |
114 | 112 |
115 inline ComposedTreeWalker::ComposedTreeWalker(const Node* node, StartPolicy star
tPolicy) | 113 inline ComposedTreeWalker::ComposedTreeWalker(const Node* node, StartPolicy star
tPolicy) |
116 : m_node(node) | 114 : m_node(node) |
117 { | 115 { |
118 #if ENABLE(ASSERT) | 116 #if ENABLE(ASSERT) |
119 if (m_node && startPolicy == CannotStartFromShadowBoundary) | 117 if (m_node && startPolicy == CannotStartFromShadowBoundary) |
(...skipping 86 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
206 | 204 |
207 inline Node* ComposedTreeWalker::traverseLastChild(const Node* node) const | 205 inline Node* ComposedTreeWalker::traverseLastChild(const Node* node) const |
208 { | 206 { |
209 ASSERT(node); | 207 ASSERT(node); |
210 return traverseChild(node, TraversalDirectionBackward); | 208 return traverseChild(node, TraversalDirectionBackward); |
211 } | 209 } |
212 | 210 |
213 } // namespace | 211 } // namespace |
214 | 212 |
215 #endif // SKY_ENGINE_CORE_DOM_SHADOW_COMPOSEDTREEWALKER_H_ | 213 #endif // SKY_ENGINE_CORE_DOM_SHADOW_COMPOSEDTREEWALKER_H_ |
OLD | NEW |