reflow comments in core/html/*.{cpp,h},core/html/imports

third_party/WebKit/Source/core/html/TimeRanges.cpp

 /*
  * Copyright (C) 2007, 2009, 2010 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 114 matching lines @@
   return m_ranges[index].m_end;
 }
 
 void TimeRanges::add(double start, double end) {
   DCHECK_LE(start, end);
   unsigned overlappingArcIndex;
   Range addedRange(start, end);
 
   // For each present range check if we need to:
   // - merge with the added range, in case we are overlapping or contiguous
-  // - Need to insert in place, we we are completely, not overlapping and not contiguous
-  // in between two ranges.
+  // - Need to insert in place, we we are completely, not overlapping and not
+  //   contiguous in between two ranges.
   //
-  // TODO: Given that we assume that ranges are correctly ordered, this could be optimized.
+  // TODO: Given that we assume that ranges are correctly ordered, this could be
+  // optimized.
 
   for (overlappingArcIndex = 0; overlappingArcIndex < m_ranges.size();
        overlappingArcIndex++) {
     if (addedRange.isOverlappingRange(m_ranges[overlappingArcIndex]) ||
         addedRange.isContiguousWithRange(m_ranges[overlappingArcIndex])) {
       // We need to merge the addedRange and that range.
       addedRange = addedRange.unionWithOverlappingOrContiguousRange(
           m_ranges[overlappingArcIndex]);
       m_ranges.remove(overlappingArcIndex);
       overlappingArcIndex--;
     } else {
       // Check the case for which there is no more to do
       if (!overlappingArcIndex) {
         if (addedRange.isBeforeRange(m_ranges[0])) {
-          // First index, and we are completely before that range (and not contiguous, nor overlapping).
-          // We just need to be inserted here.
+          // First index, and we are completely before that range (and not
+          // contiguous, nor overlapping).  We just need to be inserted here.
           break;
         }
       } else {
         if (m_ranges[overlappingArcIndex - 1].isBeforeRange(addedRange) &&
             addedRange.isBeforeRange(m_ranges[overlappingArcIndex])) {
-          // We are exactly after the current previous range, and before the current range, while
-          // not overlapping with none of them. Insert here.
+          // We are exactly after the current previous range, and before the
+          // current range, while not overlapping with none of them. Insert
+          // here.
           break;
         }
       }
     }
   }
 
   // Now that we are sure we don't overlap with any range, just add it.
   m_ranges.insert(overlappingArcIndex, addedRange);
 }
 
@@ skipping 28 matching lines @@
     if (delta < bestDelta ||
         (delta == bestDelta &&
          std::abs(currentPlaybackPosition - match) <
              std::abs(currentPlaybackPosition - bestMatch))) {
       bestDelta = delta;
       bestMatch = match;
     }
   }
   return bestMatch;
 }