Support the essential part of Shadow DOM v1

third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Neither the name of Google Inc. nor the names of its
@@ skipping 19 matching lines @@
 #include "core/CoreExport.h"
 #include "core/dom/Document.h"
 #include "core/dom/LayoutTreeBuilderTraversal.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include "core/dom/shadow/ShadowRoot.h"
 #include "wtf/Allocator.h"
 
 namespace blink {
 
 class ContainerNode;
+class HTMLSlotElement;
 class Node;
 
 // Composed tree version of |NodeTraversal|.
 //
 // None of member functions takes a |ShadowRoot| or an active insertion point,
 // e.g. roughly speaking <content> and <shadow> in the shadow tree, see
 // |InsertionPoint::isActive()| for details of active insertion points, since
 // they aren't appeared in the composed tree. |assertPrecondition()| and
 // |assertPostCondition()| check this condition.
 //
@@ skipping 82 matching lines @@
 
     static void assertPostcondition(const Node* node)
     {
 #if ENABLE(ASSERT)
         if (node)
             assertPrecondition(*node);
 #endif
     }
 
     static Node* resolveDistributionStartingAt(const Node*, TraversalDirection);
+    static Node* v1ResolveDistributionStartingAt(const Node&, TraversalDirection);
+    static Node* v0ResolveDistributionStartingAt(const Node&, TraversalDirection);
 
     static Node* traverseNext(const Node&);
     static Node* traverseNext(const Node&, const Node* stayWithin);
     static Node* traverseNextSkippingChildren(const Node&, const Node* stayWithin);
     static Node* traversePrevious(const Node&);
 
     static Node* traverseFirstChild(const Node&);
     static Node* traverseLastChild(const Node&);
     static Node* traverseChild(const Node&, TraversalDirection);
 
     static ContainerNode* traverseParent(const Node&, ParentTraversalDetails* = 0);
+    // TODO(hayato): Make ParentTraversalDetails be aware of slot elements too.
+    static ContainerNode* v1TraverseParent(const Node&);
+    static ContainerNode* v0TraverseParent(const Node&, ParentTraversalDetails* = 0);
 
     static Node* traverseNextSibling(const Node&);
     static Node* traversePreviousSibling(const Node&);
 
     static Node* traverseSiblings(const Node&, TraversalDirection);
+    static Node* v1TraverseSiblings(const Node&, TraversalDirection);
+    static Node* v0TraverseSiblings(const Node&, TraversalDirection);
+
     static Node* traverseSiblingsOrShadowInsertionPointSiblings(const Node&, TraversalDirection);
 
     static ContainerNode* traverseParentOrHost(const Node&);
     static Node* traverseNextAncestorSibling(const Node&);
     static Node* traversePreviousAncestorSibling(const Node&);
 };
 
 inline ContainerNode* ComposedTreeTraversal::parent(const Node& node, ParentTraversalDetails* details)
 {
     assertPrecondition(node);
@@ skipping 132 matching lines @@
 }
 
 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node)
 {
     return traverseChild(node, TraversalDirectionBackward);
 }
 
 } // namespace
 
 #endif