| 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 |
| 11 * contributors may be used to endorse or promote products derived from | 11 * contributors may be used to endorse or promote products derived from |
| 12 * this software without specific prior written permission. | 12 * this software without specific prior written permission. |
| 13 * | 13 * |
| 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 25 */ | 25 */ |
| 26 | 26 |
| 27 #ifndef ComposedTreeTraversal_h | 27 #ifndef ComposedTreeTraversal_h |
| 28 #define ComposedTreeTraversal_h | 28 #define ComposedTreeTraversal_h |
| 29 | 29 |
| 30 #include "core/CoreExport.h" |
| 30 #include "core/dom/Document.h" | 31 #include "core/dom/Document.h" |
| 31 #include "core/dom/NodeRenderingTraversal.h" | 32 #include "core/dom/NodeRenderingTraversal.h" |
| 32 #include "core/dom/shadow/InsertionPoint.h" | 33 #include "core/dom/shadow/InsertionPoint.h" |
| 33 #include "core/dom/shadow/ShadowRoot.h" | 34 #include "core/dom/shadow/ShadowRoot.h" |
| 34 | 35 |
| 35 namespace blink { | 36 namespace blink { |
| 36 | 37 |
| 37 class ContainerNode; | 38 class ContainerNode; |
| 38 class Node; | 39 class Node; |
| 39 | 40 |
| 40 // Composed tree version of |NodeTraversal|. | 41 // Composed tree version of |NodeTraversal|. |
| 41 // | 42 // |
| 42 // None of member functions takes a |ShadowRoot| or an active insertion point, | 43 // None of member functions takes a |ShadowRoot| or an active insertion point, |
| 43 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see | 44 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see |
| 44 // |InsertionPoint::isActive()| for details of active insertion points, since | 45 // |InsertionPoint::isActive()| for details of active insertion points, since |
| 45 // they aren't appeared in the composed tree. |assertPrecondition()| and | 46 // they aren't appeared in the composed tree. |assertPrecondition()| and |
| 46 // |assertPostCondition()| check this condition. | 47 // |assertPostCondition()| check this condition. |
| 47 // | 48 // |
| 48 // FIXME: Make some functions inline to optimise the performance. | 49 // FIXME: Make some functions inline to optimise the performance. |
| 49 // https://bugs.webkit.org/show_bug.cgi?id=82702 | 50 // https://bugs.webkit.org/show_bug.cgi?id=82702 |
| 50 class ComposedTreeTraversal { | 51 class CORE_EXPORT ComposedTreeTraversal { |
| 51 public: | 52 public: |
| 52 typedef NodeRenderingTraversal::ParentDetails ParentTraversalDetails; | 53 typedef NodeRenderingTraversal::ParentDetails ParentTraversalDetails; |
| 53 | 54 |
| 54 static Node* next(const Node&); | 55 static Node* next(const Node&); |
| 55 static Node* next(const Node&, const Node* stayWithin); | 56 static Node* next(const Node&, const Node* stayWithin); |
| 56 static Node* previous(const Node&); | 57 static Node* previous(const Node&); |
| 57 | 58 |
| 58 static Node* firstChild(const Node&); | 59 static Node* firstChild(const Node&); |
| 59 static Node* lastChild(const Node&); | 60 static Node* lastChild(const Node&); |
| 60 static bool hasChildren(const Node&); | 61 static bool hasChildren(const Node&); |
| (...skipping 230 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 291 } | 292 } |
| 292 | 293 |
| 293 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node) | 294 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node) |
| 294 { | 295 { |
| 295 return traverseChild(node, TraversalDirectionBackward); | 296 return traverseChild(node, TraversalDirectionBackward); |
| 296 } | 297 } |
| 297 | 298 |
| 298 } // namespace | 299 } // namespace |
| 299 | 300 |
| 300 #endif | 301 #endif |
| OLD | NEW |