Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(60)

Unified Diff: third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h

Issue 1489433002: Support the essential part of Shadow DOM v1 (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Revert Internals.* Created 5 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
Index: third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h
diff --git a/third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h b/third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h
index bb9d0e81c945060e544d7da42a819fa034784345..844f490a7c697e57ba88e162e36feb3c7dc255e6 100644
--- a/third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h
+++ b/third_party/WebKit/Source/core/dom/shadow/ComposedTreeTraversal.h
@@ -37,6 +37,7 @@
namespace blink {
class ContainerNode;
+class HTMLSlotElement;
class Node;
// Composed tree version of |NodeTraversal|.
@@ -139,6 +140,8 @@ private:
}
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);
@@ -150,11 +153,17 @@ private:
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&);

Powered by Google App Engine
This is Rietveld 408576698