reflow comments in wtf

third_party/WebKit/Source/wtf/ListHashSet.h

 /*
- * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
+ * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights
+ * reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * 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
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
@@ skipping 402 matching lines @@
         !IsTriviallyDestructible<ValueArg>::value)
       this->m_prev = unlinkedNodePointer();
   }
 
   bool wasAlreadyDestructed() const {
     ASSERT(NodeAllocator::isGarbageCollected);
     return this->m_prev == unlinkedNodePointer();
   }
 
   static void finalize(void* pointer) {
-    ASSERT(
-        !IsTriviallyDestructible<ValueArg>::
-            value);  // No need to waste time calling finalize if it's not needed.
+    // No need to waste time calling finalize if it's not needed.
+    ASSERT(!IsTriviallyDestructible<ValueArg>::value);
     ListHashSetNode* self = reinterpret_cast_ptr<ListHashSetNode*>(pointer);
 
     // Check whether this node was already destructed before being unlinked
     // from the collection.
     if (self->wasAlreadyDestructed())
       return;
 
     self->m_value.~ValueArg();
   }
   void finalizeGarbageCollectedObject() { finalize(this); }
@@ skipping 663 matching lines @@
   // through the HashTable. That includes m_head and m_tail so we do not have
   // to explicitly trace them here.
   m_impl.trace(visitor);
 }
 
 }  // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif  // WTF_ListHashSet_h