DO NOT SUBMIT results of new clang-format

third_party/WebKit/Source/platform/scheduler/base/work_queue_sets.cc

 // Copyright 2015 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 "platform/scheduler/base/work_queue_sets.h"
 
 #include "base/logging.h"
 
 namespace blink {
 namespace scheduler {
@@ skipping 43 matching lines @@
 }
 
 void WorkQueueSets::OnTaskPushedToEmptyQueue(WorkQueue* work_queue) {
   // NOTE if this function changes, we need to keep |WorkQueueSets::AddQueue| in
   // sync.
   DCHECK_EQ(this, work_queue->work_queue_sets());
   EnqueueOrder enqueue_order;
   bool has_enqueue_order = work_queue->GetFrontTaskEnqueueOrder(&enqueue_order);
   DCHECK(has_enqueue_order);
   size_t set_index = work_queue->work_queue_set_index();
-  DCHECK_LT(set_index, work_queue_heaps_.size()) << " set_index = "
-                                                 << set_index;
+  DCHECK_LT(set_index, work_queue_heaps_.size())
+      << " set_index = " << set_index;
   // |work_queue| should not be in work_queue_heaps_[set_index].
   DCHECK(!work_queue->heap_handle().IsValid());
   work_queue_heaps_[set_index].insert({enqueue_order, work_queue});
 }
 
 void WorkQueueSets::OnPopQueue(WorkQueue* work_queue) {
   // Assume that |work_queue| contains the lowest enqueue_order.
   size_t set_index = work_queue->work_queue_set_index();
   DCHECK_EQ(this, work_queue->work_queue_sets());
   DCHECK_LT(set_index, work_queue_heaps_.size());
@@ skipping 42 matching lines @@
   const OldestTaskEnqueueOrder& oldest = work_queue_heaps_[set_index].Min();
   *out_work_queue = oldest.value;
   *out_enqueue_order = oldest.key;
   EnqueueOrder enqueue_order;
   DCHECK(oldest.value->GetFrontTaskEnqueueOrder(&enqueue_order) &&
          oldest.key == enqueue_order);
   return true;
 }
 
 bool WorkQueueSets::IsSetEmpty(size_t set_index) const {
-  DCHECK_LT(set_index, work_queue_heaps_.size()) << " set_index = "
-                                                 << set_index;
+  DCHECK_LT(set_index, work_queue_heaps_.size())
+      << " set_index = " << set_index;
   return work_queue_heaps_[set_index].empty();
 }
 
 #if DCHECK_IS_ON() || !defined(NDEBUG)
 bool WorkQueueSets::ContainsWorkQueueForTest(
     const WorkQueue* work_queue) const {
   EnqueueOrder enqueue_order;
   bool has_enqueue_order = work_queue->GetFrontTaskEnqueueOrder(&enqueue_order);
 
   for (const IntrusiveHeap<OldestTaskEnqueueOrder>& heap : work_queue_heaps_) {
@@ skipping 12 matching lines @@
     return true;
   }
 
   return false;
 }
 #endif
 
 }  // namespace internal
 }  // namespace scheduler
 }  // namespace blink