Reflow comments in core/dom/.

third_party/WebKit/Source/core/dom/shadow/SlotAssignment.cpp

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "core/dom/shadow/SlotAssignment.h"
 
 #include "core/HTMLNames.h"
 #include "core/dom/ElementTraversal.h"
 #include "core/dom/NodeTraversal.h"
 #include "core/dom/shadow/ElementShadow.h"
 #include "core/dom/shadow/InsertionPoint.h"
 #include "core/dom/shadow/ShadowRoot.h"
 #include "core/html/HTMLSlotElement.h"
 
 namespace blink {
 
 void SlotAssignment::slotAdded(HTMLSlotElement& slot) {
   // Relevant DOM Standard:
   // https://dom.spec.whatwg.org/#concept-node-insert
-  // 6.4:  Run assign slotables for a tree with node's tree and a set containing each inclusive descendant of node that is a slot.
+  // 6.4:  Run assign slotables for a tree with node's tree and a set containing
+  // each inclusive descendant of node that is a slot.
 
   ++m_slotCount;
   m_needsCollectSlots = true;
 
   if (!m_slotMap->contains(slot.name())) {
     m_slotMap->add(slot.name(), &slot);
     return;
   }
 
   HTMLSlotElement& oldActive = *findSlotByName(slot.name());
   DCHECK_NE(oldActive, slot);
   m_slotMap->add(slot.name(), &slot);
   if (findSlotByName(slot.name()) == oldActive)
     return;
   // |oldActive| is no longer an active slot.
   if (oldActive.findHostChildWithSameSlotName())
     oldActive.enqueueSlotChangeEvent();
   // TODO(hayato): We should not enqeueue a slotchange event for |oldActive|
   // if |oldActive| was inserted together with |slot|.
-  // This could happen if |oldActive| and |slot| are descendants of the inserted node, and
-  // |oldActive| is preceding |slot|.
+  // This could happen if |oldActive| and |slot| are descendants of the inserted
+  // node, and |oldActive| is preceding |slot|.
 }
 
 void SlotAssignment::slotRemoved(HTMLSlotElement& slot) {
   DCHECK_GT(m_slotCount, 0u);
   --m_slotCount;
   m_needsCollectSlots = true;
 
   DCHECK(m_slotMap->contains(slot.name()));
   HTMLSlotElement* oldActive = findSlotByName(slot.name());
   m_slotMap->remove(slot.name(), &slot);
   HTMLSlotElement* newActive = findSlotByName(slot.name());
   if (newActive && newActive != oldActive) {
     // |newActive| slot becomes an active slot.
     if (newActive->findHostChildWithSameSlotName())
       newActive->enqueueSlotChangeEvent();
     // TODO(hayato): Prevent a false-positive slotchange.
-    // This could happen if more than one slots which have the same name are descendants of the removed node.
+    // This could happen if more than one slots which have the same name are
+    // descendants of the removed node.
   }
 }
 
 bool SlotAssignment::findHostChildBySlotName(
     const AtomicString& slotName) const {
   // TODO(hayato): Avoid traversing children every time.
   for (Node& child : NodeTraversal::childrenOf(m_owner->host())) {
     if (!child.isSlotable())
       continue;
     if (child.slotName() == slotName)
       return true;
   }
   return false;
 }
 
 void SlotAssignment::slotRenamed(const AtomicString& oldSlotName,
                                  HTMLSlotElement& slot) {
-  // |slot| has already new name. Thus, we can not use slot.hasAssignedNodesSynchronously.
+  // |slot| has already new name. Thus, we can not use
+  // slot.hasAssignedNodesSynchronously.
   bool hasAssignedNodesBefore = (findSlotByName(oldSlotName) == &slot) &&
                                 findHostChildBySlotName(oldSlotName);
 
   m_slotMap->remove(oldSlotName, &slot);
   m_slotMap->add(slot.name(), &slot);
 
   bool hasAssignedNodesAfter = slot.hasAssignedNodesSlow();
 
   if (hasAssignedNodesBefore || hasAssignedNodesAfter)
     slot.enqueueSlotChangeEvent();
@@ skipping 43 matching lines @@
   }
 }
 
 void SlotAssignment::resolveDistribution() {
   resolveAssignment();
   const HeapVector<Member<HTMLSlotElement>>& slots = this->slots();
 
   for (auto slot : slots)
     slot->resolveDistributedNodes();
 
-  // Update each slot's distribution in reverse tree order so that a child slot is visited before its parent slot.
+  // Update each slot's distribution in reverse tree order so that a child slot
+  // is visited before its parent slot.
   for (auto slot = slots.rbegin(); slot != slots.rend(); ++slot) {
     (*slot)->updateDistributedNodesWithFallback();
     (*slot)->lazyReattachDistributedNodesIfNeeded();
   }
 }
 
 const HeapVector<Member<HTMLSlotElement>>& SlotAssignment::slots() {
   if (m_needsCollectSlots)
     collectSlots();
   return m_slots;
@@ skipping 20 matching lines @@
   DCHECK_EQ(m_slots.size(), m_slotCount);
 }
 
 DEFINE_TRACE(SlotAssignment) {
   visitor->trace(m_slots);
   visitor->trace(m_slotMap);
   visitor->trace(m_owner);
 }
 
 }  // namespace blink