reflow comments in platform/

third_party/WebKit/Source/platform/Length.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller ( mueller@kde.org )
- * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
+ * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights
+ * reserved.
  * Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net)
  *
  * 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 18 matching lines @@
 class CalculationValueHandleMap {
   USING_FAST_MALLOC(CalculationValueHandleMap);
   WTF_MAKE_NONCOPYABLE(CalculationValueHandleMap);
 
  public:
   CalculationValueHandleMap() : m_index(1) {}
 
   int insert(PassRefPtr<CalculationValue> calcValue) {
     ASSERT(m_index);
     // FIXME calc(): https://bugs.webkit.org/show_bug.cgi?id=80489
-    // This monotonically increasing handle generation scheme is potentially wasteful
-    // of the handle space. Consider reusing empty handles.
+    // This monotonically increasing handle generation scheme is potentially
+    // wasteful of the handle space. Consider reusing empty handles.
     while (m_map.contains(m_index))
       m_index++;
 
     m_map.set(m_index, std::move(calcValue));
 
     return m_index;
   }
 
   void remove(int index) {
     ASSERT(m_map.contains(index));
     m_map.remove(index);
   }
 
   CalculationValue& get(int index) {
     ASSERT(m_map.contains(index));
     return *m_map.get(index);
   }
 
   void decrementRef(int index) {
     ASSERT(m_map.contains(index));
     CalculationValue* value = m_map.get(index);
     if (value->hasOneRef()) {
-      // Force the CalculationValue destructor early to avoid a potential recursive call inside HashMap remove().
+      // Force the CalculationValue destructor early to avoid a potential
+      // recursive call inside HashMap remove().
       m_map.set(index, nullptr);
       m_map.remove(index);
     } else {
       value->deref();
     }
   }
 
  private:
   int m_index;
   HashMap<int, RefPtr<CalculationValue>> m_map;
@@ skipping 94 matching lines @@
 }
 
 struct SameSizeAsLength {
   int32_t value;
   int32_t metaData;
 };
 static_assert(sizeof(Length) == sizeof(SameSizeAsLength),
               "length should stay small");
 
 }  // namespace blink