reflow comments in wtf

third_party/WebKit/Source/wtf/StringHasher.h

 /*
  * Copyright (C) 2005, 2006, 2008, 2010, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2010 Patrick Gansterer <paroga@paroga.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,
@@ skipping 17 matching lines @@
 namespace WTF {
 
 // Paul Hsieh's SuperFastHash
 // http://www.azillionmonkeys.com/qed/hash.html
 
 // LChar data is interpreted as Latin-1-encoded (zero extended to 16 bits).
 
 // NOTE: The hash computation here must stay in sync with
 // build/scripts/hasher.py.
 
-// Golden ratio. Arbitrary start value to avoid mapping all zeros to a hash value of zero.
+// Golden ratio. Arbitrary start value to avoid mapping all zeros to a hash
+// value of zero.
 static const unsigned stringHashingStartValue = 0x9E3779B9U;
 
 class StringHasher {
   DISALLOW_NEW();
 
  public:
   static const unsigned flagCount =
       8;  // Save 8 bits for StringImpl to use as flags.
 
   StringHasher()
       : m_hash(stringHashingStartValue),
         m_hasPendingCharacter(false),
         m_pendingCharacter(0) {}
 
-  // The hasher hashes two characters at a time, and thus an "aligned" hasher is one
-  // where an even number of characters have been added. Callers that always add
-  // characters two at a time can use the "assuming aligned" functions.
+  // The hasher hashes two characters at a time, and thus an "aligned" hasher is
+  // one where an even number of characters have been added. Callers that
+  // always add characters two at a time can use the "assuming aligned"
+  // functions.
   void addCharactersAssumingAligned(UChar a, UChar b) {
     ASSERT(!m_hasPendingCharacter);
     m_hash += a;
     m_hash = (m_hash << 16) ^ ((b << 11) ^ m_hash);
     m_hash += m_hash >> 11;
   }
 
   void addCharacter(UChar character) {
     if (m_hasPendingCharacter) {
       m_hasPendingCharacter = false;
@@ skipping 105 matching lines @@
     hasher.addCharactersAssumingAligned<T, Converter>(data, length);
     return hasher.hash();
   }
 
   template <typename T>
   static unsigned computeHash(const T* data, unsigned length) {
     return computeHash<T, defaultConverter>(data, length);
   }
 
   static unsigned hashMemory(const void* data, unsigned length) {
-    // FIXME: Why does this function use the version of the hash that drops the top 8 bits?
-    // We want that for all string hashing so we can use those bits in StringImpl and hash
-    // strings consistently, but I don't see why we'd want that for general memory hashing.
+    // FIXME: Why does this function use the version of the hash that drops the
+    // top 8 bits?  We want that for all string hashing so we can use those
+    // bits in StringImpl and hash strings consistently, but I don't see why
+    // we'd want that for general memory hashing.
     ASSERT(!(length % 2));
     return computeHashAndMaskTop8Bits<UChar>(static_cast<const UChar*>(data),
                                              length / sizeof(UChar));
   }
 
   template <size_t length>
   static unsigned hashMemory(const void* data) {
     static_assert(!(length % 2), "length must be a multiple of two");
     return hashMemory(data, length);
   }
@@ skipping 26 matching lines @@
   unsigned m_hash;
   bool m_hasPendingCharacter;
   UChar m_pendingCharacter;
 };
 
 }  // namespace WTF
 
 using WTF::StringHasher;
 
 #endif  // WTF_StringHasher_h