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 19 matching lines...) Expand all Loading... |
30 #include "core/CoreExport.h" | 30 #include "core/CoreExport.h" |
31 #include "core/dom/Document.h" | 31 #include "core/dom/Document.h" |
32 #include "core/dom/LayoutTreeBuilderTraversal.h" | 32 #include "core/dom/LayoutTreeBuilderTraversal.h" |
33 #include "core/dom/shadow/InsertionPoint.h" | 33 #include "core/dom/shadow/InsertionPoint.h" |
34 #include "core/dom/shadow/ShadowRoot.h" | 34 #include "core/dom/shadow/ShadowRoot.h" |
35 #include "wtf/Allocator.h" | 35 #include "wtf/Allocator.h" |
36 | 36 |
37 namespace blink { | 37 namespace blink { |
38 | 38 |
39 class ContainerNode; | 39 class ContainerNode; |
40 class HTMLSlotElement; | |
41 class Node; | 40 class Node; |
42 | 41 |
43 // Flat tree version of |NodeTraversal|. | 42 // Flat tree version of |NodeTraversal|. |
44 // | 43 // |
45 // None of member functions takes a |ShadowRoot| or an active insertion point, | 44 // None of member functions takes a |ShadowRoot| or an active insertion point, |
46 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see | 45 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see |
47 // |InsertionPoint::isActive()| for details of active insertion points, since | 46 // |InsertionPoint::isActive()| for details of active insertion points, since |
48 // they aren't appeared in the flat tree. |assertPrecondition()| and | 47 // they aren't appeared in the flat tree. |assertPrecondition()| and |
49 // |assertPostCondition()| check this condition. | 48 // |assertPostCondition()| check this condition. |
50 // | 49 // |
(...skipping 242 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
293 return traverseChild(node, TraversalDirectionForward); | 292 return traverseChild(node, TraversalDirectionForward); |
294 } | 293 } |
295 | 294 |
296 inline Node* FlatTreeTraversal::traverseLastChild(const Node& node) { | 295 inline Node* FlatTreeTraversal::traverseLastChild(const Node& node) { |
297 return traverseChild(node, TraversalDirectionBackward); | 296 return traverseChild(node, TraversalDirectionBackward); |
298 } | 297 } |
299 | 298 |
300 } // namespace blink | 299 } // namespace blink |
301 | 300 |
302 #endif | 301 #endif |
OLD | NEW |