Clang format pdf/

pdf/chunk_stream.cc

 // Copyright (c) 2010 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 "pdf/chunk_stream.h"
 
 #include <stddef.h>
 #include <string.h>
 
 #define __STDC_LIMIT_MACROS
 #ifdef _WIN32
 #include <limits.h>
 #else
 #include <stdint.h>
 #endif
 
 #include <algorithm>
 
 namespace chrome_pdf {
 
-ChunkStream::ChunkStream() : stream_size_(0) {
-}
+ChunkStream::ChunkStream() : stream_size_(0) {}
 
-ChunkStream::~ChunkStream() {
-}
+ChunkStream::~ChunkStream() {}
 
 void ChunkStream::Clear() {
   chunks_.clear();
   data_.clear();
   stream_size_ = 0;
 }
 
 void ChunkStream::Preallocate(size_t stream_size) {
   data_.reserve(stream_size);
   stream_size_ = stream_size;
@@ skipping 44 matching lines @@
 
 bool ChunkStream::ReadData(size_t offset, size_t size, void* buffer) const {
   if (!IsRangeAvailable(offset, size))
     return false;
 
   memcpy(buffer, &data_[offset], size);
   return true;
 }
 
 bool ChunkStream::GetMissedRanges(
-    size_t offset, size_t size,
-    std::vector<std::pair<size_t, size_t> >* ranges) const {
+    size_t offset,
+    size_t size,
+    std::vector<std::pair<size_t, size_t>>* ranges) const {
   if (IsRangeAvailable(offset, size))
     return false;
 
   ranges->clear();
   if (chunks_.empty()) {
     ranges->push_back(std::pair<size_t, size_t>(offset, size));
     return true;
   }
 
   std::map<size_t, size_t>::const_iterator start = chunks_.upper_bound(offset);
@@ skipping 16 matching lines @@
       size_t new_size = it->first - cur_offset;
       ranges->push_back(std::pair<size_t, size_t>(cur_offset, new_size));
       cur_offset = it->first + it->second;
     } else if (cur_offset < it->first + it->second) {
       cur_offset = it->first + it->second;
     }
   }
 
   // Add last chunk.
   if (cur_offset < offset + size)
-    ranges->push_back(std::pair<size_t, size_t>(cur_offset,
-        offset + size - cur_offset));
+    ranges->push_back(
+        std::pair<size_t, size_t>(cur_offset, offset + size - cur_offset));
 
   return true;
 }
 
 bool ChunkStream::IsRangeAvailable(size_t offset, size_t size) const {
   if (chunks_.empty())
     return false;
 
   if (SIZE_MAX - size < offset)
     return false;
@@ skipping 26 matching lines @@
 size_t ChunkStream::GetLastMissingByteInInterval(size_t offset) const {
   if (chunks_.empty())
     return stream_size_ - 1;
   std::map<size_t, size_t>::const_iterator it = chunks_.upper_bound(offset);
   if (it == chunks_.end())
     return stream_size_ - 1;
   return it->first - 1;
 }
 
 }  // namespace chrome_pdf