Update the received slices vector when stream is written to disk

content/browser/download/parallel_download_utils.cc

 // Copyright 2017 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "content/browser/download/parallel_download_utils.h"
 
 #include "base/metrics/field_trial_params.h"
 #include "base/strings/string_number_conversions.h"
 #include "content/public/browser/download_save_info.h"
 #include "content/public/common/content_features.h"
@@ skipping 10 matching lines @@
 const int64_t kMinSliceSizeParallelDownload = 2097152;
 
 // Finch parameter key value for number of parallel requests in a parallel
 // download, including the original request.
 const char kParallelRequestCountFinchKey[] = "request_count";
 
 // Default value for |kParallelRequestCountFinchKey|, when no parameter is
 // specified.
 const int kParallelRequestCount = 2;
 
+bool compareReceivedSlices(const DownloadItem::ReceivedSlice& lhs,

[David Trainor- moved to gerrit, 2017/03/09 17:44:02]

Comparator operators on the DownloadItem::ReceivedSlice would work as well.  But
either way is ok with me.

[qinmin, 2017/03/09 21:44:58]

Added a TODO here. 

+                           const DownloadItem::ReceivedSlice& rhs) {
+  return lhs.offset < rhs.offset;
+}
+
 }  // namespace
 
 std::vector<DownloadItem::ReceivedSlice> FindSlicesToDownload(
     const std::vector<DownloadItem::ReceivedSlice>& received_slices) {
   std::vector<DownloadItem::ReceivedSlice> result;
   if (received_slices.empty()) {
     result.emplace_back(0, DownloadSaveInfo::kLengthFullContent);
     return result;
   }
 
@@ skipping 13 matching lines @@
     }
 
     DCHECK_GE(next->offset, offset);
     if (next->offset > offset)
       result.emplace_back(offset, next->offset - offset);
     iter = next;
   }
   return result;
 }
 
+size_t AddOrMergeReceivedSliceIntoSortedArray(
+    const DownloadItem::ReceivedSlice& new_slice,
+    std::vector<DownloadItem::ReceivedSlice>& received_slices) {
+  std::vector<DownloadItem::ReceivedSlice>::iterator it =
+      std::upper_bound(received_slices.begin(), received_slices.end(),
+                       new_slice, compareReceivedSlices);
+  if (it != received_slices.begin()) {
+    std::vector<DownloadItem::ReceivedSlice>::iterator prev = std::prev(it);
+    if (prev->offset + prev->received_bytes == new_slice.offset) {
+      prev->received_bytes += new_slice.received_bytes;
+      return static_cast<size_t>(std::distance(received_slices.begin(), prev));
+    }
+  }
+
+  it = received_slices.emplace(it, new_slice);
+  return static_cast<size_t>(std::distance(received_slices.begin(), it));
+}
+
 int64_t GetMinSliceSizeConfig() {
   std::string finch_value = base::GetFieldTrialParamValueByFeature(
       features::kParallelDownloading, kMinSliceSizeFinchKey);
   int64_t result;
   return !finch_value.empty() && base::StringToInt64(finch_value, &result)
              ? result
              : kMinSliceSizeParallelDownload;
 }
 
 int GetParallelRequestCountConfig() {
   std::string finch_value = base::GetFieldTrialParamValueByFeature(
       features::kParallelDownloading, kParallelRequestCountFinchKey);
   int result;
   return !finch_value.empty() && base::StringToInt(finch_value, &result)
              ? result
              : kParallelRequestCount;
 }
 
 }  // namespace content