reflow comments in wtf

third_party/WebKit/Source/wtf/LinkedHashSet.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 226 matching lines @@
   void removeFirst();
 
   Value& last();
   const Value& last() const;
   void removeLast();
 
   iterator find(ValuePeekInType);
   const_iterator find(ValuePeekInType) const;
   bool contains(ValuePeekInType) const;
 
-  // An alternate version of find() that finds the object by hashing and comparing
-  // with some other type, to avoid the cost of type conversion.
+  // An alternate version of find() that finds the object by hashing and
+  // comparing with some other type, to avoid the cost of type conversion.
   // The HashTranslator interface is defined in HashSet.
   template <typename HashTranslator, typename T>
   iterator find(const T&);
   template <typename HashTranslator, typename T>
   const_iterator find(const T&) const;
   template <typename HashTranslator, typename T>
   bool contains(const T&) const;
 
   // The return value of add is a pair of a pointer to the stored value,
   // and a bool that is true if an new entry was added.
   template <typename IncomingValueType>
   AddResult add(IncomingValueType&&);
 
   // Same as add() except that the return value is an
   // iterator. Useful in cases where it's needed to have the
   // same return value as find() and where it's not possible to
   // use a pointer to the storedValue.
   template <typename IncomingValueType>
   iterator addReturnIterator(IncomingValueType&&);
 
   // Add the value to the end of the collection. If the value was already in
   // the list, it is moved to the end.
   template <typename IncomingValueType>
   AddResult appendOrMoveToLast(IncomingValueType&&);
 
-  // Add the value to the beginning of the collection. If the value was already in
-  // the list, it is moved to the beginning.
+  // Add the value to the beginning of the collection. If the value was already
+  // in the list, it is moved to the beginning.
   template <typename IncomingValueType>
   AddResult prependOrMoveToFirst(IncomingValueType&&);
 
   template <typename IncomingValueType>
   AddResult insertBefore(ValuePeekInType beforeValue,
                          IncomingValueType&& newValue);
   template <typename IncomingValueType>
   AddResult insertBefore(iterator it, IncomingValueType&& newValue) {
     return m_impl.template add<NodeHashFunctions>(
         std::forward<IncomingValueType>(newValue), it.getNode());
@@ skipping 579 matching lines @@
   swap(static_cast<Base&>(a), static_cast<Base&>(b));
   swap(a.m_value, b.m_value);
   Allocator::leaveGCForbiddenScope();
 }
 
 }  // namespace WTF
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */