Reformat comments in core/html/parser

third_party/WebKit/Source/core/html/parser/HTMLFormattingElementList.cpp

 /*
  * Copyright (C) 2010 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 14 matching lines @@
 
 #include "core/html/parser/HTMLFormattingElementList.h"
 
 #ifndef NDEBUG
 #include <stdio.h>
 #endif
 
 namespace blink {
 
 // Biblically, Noah's Ark only had room for two of each animal, but in the
-// Book of Hixie (aka http://www.whatwg.org/specs/web-apps/current-work/multipage/parsing.html#list-of-active-formatting-elements),
+// Book of Hixie (aka
+// http://www.whatwg.org/specs/web-apps/current-work/multipage/parsing.html#list-of-active-formatting-elements),
 // Noah's Ark of Formatting Elements can fit three of each element.
 static const size_t kNoahsArkCapacity = 3;
 
 HTMLFormattingElementList::HTMLFormattingElementList() {}
 
 HTMLFormattingElementList::~HTMLFormattingElementList() {}
 
 Element* HTMLFormattingElementList::closestElementInScopeWithName(
     const AtomicString& targetName) {
   for (unsigned i = 1; i <= m_entries.size(); ++i) {
@@ skipping 69 matching lines @@
 }
 
 void HTMLFormattingElementList::tryToEnsureNoahsArkConditionQuickly(
     HTMLStackItem* newItem,
     HeapVector<Member<HTMLStackItem>>& remainingCandidates) {
   ASSERT(remainingCandidates.isEmpty());
 
   if (m_entries.size() < kNoahsArkCapacity)
     return;
 
-  // Use a vector with inline capacity to avoid a malloc in the common case
-  // of a quickly ensuring the condition.
+  // Use a vector with inline capacity to avoid a malloc in the common case of a
+  // quickly ensuring the condition.
   HeapVector<Member<HTMLStackItem>, 10> candidates;
 
   size_t newItemAttributeCount = newItem->attributes().size();
 
   for (size_t i = m_entries.size(); i;) {
     --i;
     Entry& entry = m_entries[i];
     if (entry.isMarker())
       break;
 
     // Quickly reject obviously non-matching candidates.
     HTMLStackItem* candidate = entry.stackItem();
     if (newItem->localName() != candidate->localName() ||
         newItem->namespaceURI() != candidate->namespaceURI())
       continue;
     if (candidate->attributes().size() != newItemAttributeCount)
       continue;
 
     candidates.append(candidate);
   }
 
+  // There's room for the new element in the ark. There's no need to copy out
+  // the remainingCandidates.
   if (candidates.size() < kNoahsArkCapacity)
-    return;  // There's room for the new element in the ark. There's no need to copy out the remainingCandidates.
+    return;
 
   remainingCandidates.appendVector(candidates);
 }
 
 void HTMLFormattingElementList::ensureNoahsArkCondition(
     HTMLStackItem* newItem) {
   HeapVector<Member<HTMLStackItem>> candidates;
   tryToEnsureNoahsArkConditionQuickly(newItem, candidates);
   if (candidates.isEmpty())
     return;
 
   // We pre-allocate and re-use this second vector to save one malloc per
   // attribute that we verify.
   HeapVector<Member<HTMLStackItem>> remainingCandidates;
   remainingCandidates.reserveInitialCapacity(candidates.size());
 
   const Vector<Attribute>& attributes = newItem->attributes();
   for (size_t i = 0; i < attributes.size(); ++i) {
     const Attribute& attribute = attributes[i];
 
     for (size_t j = 0; j < candidates.size(); ++j) {
       HTMLStackItem* candidate = candidates[j];
 
-      // These properties should already have been checked by tryToEnsureNoahsArkConditionQuickly.
+      // These properties should already have been checked by
+      // tryToEnsureNoahsArkConditionQuickly.
       ASSERT(newItem->attributes().size() == candidate->attributes().size());
       ASSERT(newItem->localName() == candidate->localName() &&
              newItem->namespaceURI() == candidate->namespaceURI());
 
       Attribute* candidateAttribute =
           candidate->getAttributeItem(attribute.name());
       if (candidateAttribute &&
           candidateAttribute->value() == attribute.value())
         remainingCandidates.append(candidate);
     }
@@ skipping 20 matching lines @@
     if (entry.isMarker())
       LOG(INFO) << "marker";
     else
       LOG(INFO) << *entry.element();
   }
 }
 
 #endif
 
 }  // namespace blink