reflow comments in wtf

third_party/WebKit/Source/wtf/HashSetTest.cpp

 /*
  * Copyright (C) 2012 Apple 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 40 matching lines @@
 
   // reserveCapacityForSize should respect minimumTableSize.
   EXPECT_GE(initialCapacity, minimumTableSize);
 
   // Adding items up to size should never change the capacity.
   for (size_t i = 0; i < size; ++i) {
     testSet.add(i + 1);  // Avoid adding '0'.
     EXPECT_EQ(initialCapacity, testSet.capacity());
   }
 
-  // Adding items up to less than half the capacity should not change the capacity.
+  // Adding items up to less than half the capacity should not change the
+  // capacity.
   unsigned capacityLimit = initialCapacity / 2 - 1;
   for (size_t i = size; i < capacityLimit; ++i) {
     testSet.add(i + 1);
     EXPECT_EQ(initialCapacity, testSet.capacity());
   }
 
   // Adding one more item increases the capacity.
   testSet.add(capacityLimit + 1);
   EXPECT_GT(testSet.capacity(), initialCapacity);
 
@@ skipping 196 matching lines @@
   set = std::move(other);
   EXPECT_EQ(0, counter);
 
   counter = 0;
   HashSet<CountCopy> yetAnother(std::move(set));
   EXPECT_EQ(0, counter);
 }
 
 class MoveOnly {
  public:
-  // kEmpty and kDeleted have special meanings when MoveOnly is used as the key of a hash table.
+  // kEmpty and kDeleted have special meanings when MoveOnly is used as the key
+  // of a hash table.
   enum { kEmpty = 0, kDeleted = -1, kMovedOut = -2 };
 
   explicit MoveOnly(int value = kEmpty, int id = 0)
       : m_value(value), m_id(id) {}
   MoveOnly(MoveOnly&& other) : m_value(other.m_value), m_id(other.m_id) {
     other.m_value = kMovedOut;
     other.m_id = 0;
   }
   MoveOnly& operator=(MoveOnly&& other) {
     m_value = other.m_value;
     m_id = other.m_id;
     other.m_value = kMovedOut;
     other.m_id = 0;
     return *this;
   }
 
   int value() const { return m_value; }
   // id() is used for distinguishing MoveOnlys with the same value().
   int id() const { return m_id; }
 
  private:
   MoveOnly(const MoveOnly&) = delete;
   MoveOnly& operator=(const MoveOnly&) = delete;
 
   int m_value;
   int m_id;
 };
 
 struct MoveOnlyHashTraits : public GenericHashTraits<MoveOnly> {
-  // This is actually true, but we pretend that it's false to disable the optimization.
+  // This is actually true, but we pretend that it's false to disable the
+  // optimization.
   static const bool emptyValueIsZero = false;
 
   static const bool hasIsEmptyValueFunction = true;
   static bool isEmptyValue(const MoveOnly& value) {
     return value.value() == MoveOnly::kEmpty;
   }
   static void constructDeletedValue(MoveOnly& slot, bool) {
     slot = MoveOnly(MoveOnly::kDeleted);
   }
   static bool isDeletedValue(const MoveOnly& value) {
@@ skipping 166 matching lines @@
   EXPECT_TRUE(oneTwoThree.contains(1));
   EXPECT_TRUE(oneTwoThree.contains(2));
   EXPECT_TRUE(oneTwoThree.contains(3));
 
   oneTwoThree = {3, 1, 1, 2, 1, 1, 3};
   EXPECT_EQ(3u, oneTwoThree.size());
   EXPECT_TRUE(oneTwoThree.contains(1));
   EXPECT_TRUE(oneTwoThree.contains(2));
   EXPECT_TRUE(oneTwoThree.contains(3));
 
-  // Other ways of construction: as a function parameter and in a return statement.
+  // Other ways of construction: as a function parameter and in a return
+  // statement.
   EXPECT_TRUE(isOneTwoThree({1, 2, 3}));
   EXPECT_TRUE(isOneTwoThree(returnOneTwoThree()));
 }
 
 }  // anonymous namespace
 
 }  // namespace WTF