Support the essential part of Shadow DOM v1

third_party/WebKit/Source/core/html/HTMLSlotElement.cpp

 /*
  * Copyright (C) 2015 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.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 19 matching lines @@
 
 #include "config.h"
 #include "core/html/HTMLSlotElement.h"
 
 #include "core/HTMLNames.h"
 
 namespace blink {
 
 using namespace HTMLNames;
 
-PassRefPtrWillBeRawPtr<HTMLSlotElement> HTMLSlotElement::create(Document& document)
-{
-    return adoptRefWillBeNoop(new HTMLSlotElement(document));
-}
-
 inline HTMLSlotElement::HTMLSlotElement(Document& document)
     : HTMLElement(slotTag, document)
 {
 }
 
-HTMLSlotElement::~HTMLSlotElement()
+DEFINE_NODE_FACTORY(HTMLSlotElement);
+
+void HTMLSlotElement::appendAssignedNode(Node& node)
 {
+    m_assignedNodes.append(&node);
+}
+
+void HTMLSlotElement::appendDistributedNode(Node& node)
+{
+    m_distributedNodes.append(&node);
+}
+
+void HTMLSlotElement::appendDistributedNodes(const Vector<RefPtr<Node>>& nodes)
+{
+    m_distributedNodes.appendVector(nodes);
+}
+
+void HTMLSlotElement::clearDistribution()

[kochi, 2015/12/09 08:57:34]

Not to mix distribution and assignment, do we need to split this into 2 methods?
i.e. for clearing V0 distribution and for clearing V1 slot assignment?

[hayato, 2015/12/09 10:25:40]

I don't think we need to split this. That's bad.  We do't need to expose two
concepts to callers. I'm afraid that's confusing and not robust.
It's an implementation detail how distribution information are saved in
SlotAssignment.

+{
+    m_assignedNodes.clear();
+    m_distributedNodes.clear();
+}
+
+Node* HTMLSlotElement::distributedNodeNextTo(const Node& node) const
+{
+    size_t index = m_distributedNodes.find(&node);
+    if (index == kNotFound || index + 1 == m_distributedNodes.size())
+        return nullptr;
+    return m_distributedNodes[index + 1].get();
+}
+
+Node* HTMLSlotElement::distributedNodePreviousTo(const Node& node) const
+{
+    size_t index = m_distributedNodes.find(&node);
+    if (index == kNotFound || index == 0)
+        return nullptr;
+    return m_distributedNodes[index - 1].get();
+}
+
+void HTMLSlotElement::attach(const AttachContext& context)
+{
+    for (size_t i = 0; i < m_distributedNodes.size(); ++i) {
+        if (m_distributedNodes[i]->needsAttach())
+            m_distributedNodes[i]->attach(context);
+    }
+
+    HTMLElement::attach(context);
+}
+
+void HTMLSlotElement::detach(const AttachContext& context)
+{
+    for (size_t i = 0; i < m_distributedNodes.size(); ++i)
+        m_distributedNodes[i]->lazyReattachIfAttached();
+
+    HTMLElement::detach(context);
 }
 
 DEFINE_TRACE(HTMLSlotElement)
 {
     HTMLElement::trace(visitor);
 }
 
 }