reflow comments in core/html/*.{cpp,h},core/html/imports

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 113 matching lines @@
 }
 
 void HTMLSlotElement::appendDistributedNodesFrom(const HTMLSlotElement& other) {
   size_t index = m_distributedNodes.size();
   m_distributedNodes.appendVector(other.m_distributedNodes);
   for (const auto& node : other.m_distributedNodes)
     m_distributedIndices.set(node.get(), index++);
 }
 
 void HTMLSlotElement::clearDistribution() {
-  // TODO(hayato): Figure out when to call lazyReattachDistributedNodesIfNeeded()
+  // TODO(hayato): Figure out when to call
+  // lazyReattachDistributedNodesIfNeeded()
   m_assignedNodes.clear();
   m_distributedNodes.clear();
   m_distributedIndices.clear();
 }
 
 void HTMLSlotElement::saveAndClearDistribution() {
   m_oldDistributedNodes.swap(m_distributedNodes);
   clearDistribution();
 }
 
@@ skipping 68 matching lines @@
 }
 
 Node::InsertionNotificationRequest HTMLSlotElement::insertedInto(
     ContainerNode* insertionPoint) {
   HTMLElement::insertedInto(insertionPoint);
   ShadowRoot* root = containingShadowRoot();
   if (root) {
     DCHECK(root->owner());
     root->owner()->setNeedsDistributionRecalc();
     // 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.
     if (root->isV1() && !wasInShadowTreeBeforeInserted(*this, *insertionPoint))
       root->ensureSlotAssignment().slotAdded(*this);
   }
 
   // We could have been distributed into in a detached subtree, make sure to
   // clear the distribution when inserted again to avoid cycles.
   clearDistribution();
 
   return InsertionDone;
 }
 
 static ShadowRoot* containingShadowRootBeforeRemoved(
     Node& removedDescendant,
     ContainerNode& insertionPoint) {
   if (ShadowRoot* root = removedDescendant.containingShadowRoot())
     return root;
   return insertionPoint.containingShadowRoot();
 }
 
 void HTMLSlotElement::removedFrom(ContainerNode* insertionPoint) {
   // `removedFrom` is called after the node is removed from the tree.
   // That means:
-  // 1. If this slot is still in a tree scope, it means the slot has been in a shadow tree. An inclusive shadow-including ancestor of the shadow host was originally removed from its parent.
-  // 2. Or (this slot is now not in a tree scope), this slot's inclusive ancestor was orginally removed from its parent (== insertion point). This slot and the originally removed node was in the same tree.
+  // 1. If this slot is still in a tree scope, it means the slot has been in a
+  // shadow tree. An inclusive shadow-including ancestor of the shadow host was
+  // originally removed from its parent.
+  // 2. Or (this slot is now not in a tree scope), this slot's inclusive
+  // ancestor was orginally removed from its parent (== insertion point). This
+  // slot and the originally removed node was in the same tree.
 
   ShadowRoot* root = containingShadowRootBeforeRemoved(*this, *insertionPoint);
   if (root) {
     if (ElementShadow* rootOwner = root->owner())
       rootOwner->setNeedsDistributionRecalc();
   }
 
-  // Since this insertion point is no longer visible from the shadow subtree, it need to clean itself up.
+  // Since this insertion point is no longer visible from the shadow subtree, it
+  // need to clean itself up.
   clearDistribution();
 
   if (root && root->isV1() && root == insertionPoint->treeScope().rootNode()) {
     // This slot was in a shadow tree and got disconnected from the shadow root.
     root->ensureSlotAssignment().slotRemoved(*this);
   }
 
   HTMLElement::removedFrom(insertionPoint);
 }
 
@@ skipping 37 matching lines @@
   if (!m_slotchangeEventEnqueued) {
     Microtask::enqueueMicrotask(WTF::bind(
         &HTMLSlotElement::dispatchSlotChangeEvent, wrapPersistent(this)));
     m_slotchangeEventEnqueued = true;
   }
 
   ShadowRoot* root = containingShadowRoot();
   DCHECK(root);
   DCHECK(root->isV1());
   root->owner()->setNeedsDistributionRecalc();
-  // Check slotchange recursively since this slotchange may cause another slotchange.
+  // Check slotchange recursively since this slotchange may cause another
+  // slotchange.
   checkSlotChange();
 }
 
 bool HTMLSlotElement::hasAssignedNodesSlow() const {
   ShadowRoot* root = containingShadowRoot();
   DCHECK(root);
   DCHECK(root->isV1());
   SlotAssignment& assignment = root->ensureSlotAssignment();
   if (assignment.findSlotByName(name()) != this)
     return false;
@@ skipping 14 matching lines @@
 
 DEFINE_TRACE(HTMLSlotElement) {
   visitor->trace(m_assignedNodes);
   visitor->trace(m_distributedNodes);
   visitor->trace(m_oldDistributedNodes);
   visitor->trace(m_distributedIndices);
   HTMLElement::trace(visitor);
 }
 
 }  // namespace blink