Reflow comments in core/dom/.

third_party/WebKit/Source/core/dom/NodeIterator.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)
  * Copyright (C) 2001 Peter Kelly (pmk@post.com)
  * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)
  * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 49 matching lines @@
   }
   node = NodeTraversal::previous(*node, root);
   return node;
 }
 
 NodeIterator::NodeIterator(Node* rootNode,
                            unsigned whatToShow,
                            NodeFilter* filter)
     : NodeIteratorBase(rootNode, whatToShow, filter),
       m_referenceNode(root(), true) {
-  // If NodeIterator target is Attr node, don't subscribe for nodeWillBeRemoved, as it would never have child nodes.
+  // If NodeIterator target is Attr node, don't subscribe for nodeWillBeRemoved,
+  // as it would never have child nodes.
   if (!root()->isAttributeNode())
     root()->document().attachNodeIterator(this);
 }
 
 Node* NodeIterator::nextNode(ExceptionState& exceptionState) {
   Node* result = nullptr;
 
   m_candidateNode = m_referenceNode;
   while (m_candidateNode.moveToNext(root())) {
     // NodeIterators treat the DOM tree as a flat list of nodes.
@@ skipping 45 matching lines @@
 
 void NodeIterator::nodeWillBeRemoved(Node& removedNode) {
   updateForNodeRemoval(removedNode, m_candidateNode);
   updateForNodeRemoval(removedNode, m_referenceNode);
 }
 
 void NodeIterator::updateForNodeRemoval(Node& removedNode,
                                         NodePointer& referenceNode) const {
   DCHECK_EQ(root()->document(), removedNode.document());
 
-  // Iterator is not affected if the removed node is the reference node and is the root.
-  // or if removed node is not the reference node, or the ancestor of the reference node.
+  // Iterator is not affected if the removed node is the reference node and is
+  // the root.  or if removed node is not the reference node, or the ancestor of
+  // the reference node.
   if (!removedNode.isDescendantOf(root()))
     return;
   bool willRemoveReferenceNode = removedNode == referenceNode.node.get();
   bool willRemoveReferenceNodeAncestor =
       referenceNode.node && referenceNode.node->isDescendantOf(&removedNode);
   if (!willRemoveReferenceNode && !willRemoveReferenceNodeAncestor)
     return;
 
   if (referenceNode.isPointerBeforeNode) {
     Node* node = NodeTraversal::next(removedNode, root());
@@ skipping 52 matching lines @@
   visitor->trace(m_referenceNode);
   visitor->trace(m_candidateNode);
   NodeIteratorBase::trace(visitor);
 }
 
 DEFINE_TRACE_WRAPPERS(NodeIterator) {
   NodeIteratorBase::traceWrappers(visitor);
 }
 
 }  // namespace blink