Motown: wholesale clang-format

services/media/framework/graph.cc

 // Copyright 2016 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 "services/media/framework/graph.h"
 
 namespace mojo {
 namespace media {
 
 Graph::Graph() {
-  update_function_ = [this](Stage* stage) {
-    engine_.RequestUpdate(stage);
-  };
+  update_function_ = [this](Stage* stage) { engine_.RequestUpdate(stage); };
 }
 
 Graph::~Graph() {
   Reset();
 }
 
 void Graph::RemovePart(PartRef part) {
   DCHECK(part.valid());
 
   Stage* stage = part.stage_;
@@ skipping 31 matching lines @@
   if (input.connected()) {
     DisconnectInput(input);
   }
 
   output.actual().Connect(input);
   input.actual().Connect(output);
 
   return input.part();
 }
 
-PartRef Graph::ConnectParts(
-    PartRef upstream_part,
-    PartRef downstream_part) {
+PartRef Graph::ConnectParts(PartRef upstream_part, PartRef downstream_part) {
   DCHECK(upstream_part.valid());
   DCHECK(downstream_part.valid());
   Connect(upstream_part.output(), downstream_part.input());
   return downstream_part;
 }
 
-PartRef Graph::ConnectOutputToPart(
-    const OutputRef& output,
-    PartRef downstream_part) {
+PartRef Graph::ConnectOutputToPart(const OutputRef& output,
+                                   PartRef downstream_part) {
   DCHECK(output.valid());
   DCHECK(downstream_part.valid());
   Connect(output, downstream_part.input());
   return downstream_part;
 }
 
-PartRef Graph::ConnectPartToInput(
-    PartRef upstream_part,
-    const InputRef& input) {
+PartRef Graph::ConnectPartToInput(PartRef upstream_part,
+                                  const InputRef& input) {
   DCHECK(upstream_part.valid());
   DCHECK(input.valid());
   Connect(upstream_part.output(), input);
   return input.part();
 }
 
 void Graph::DisconnectOutput(const OutputRef& output) {
   DCHECK(output.valid());
 
   if (!output.connected()) {
@@ skipping 25 matching lines @@
     return;
   }
 
   mate.Disconnect();
   input.actual().Disconnect();
 }
 
 void Graph::RemovePartsConnectedToPart(PartRef part) {
   DCHECK(part.valid());
 
-  std::deque<PartRef> to_remove { part };
+  std::deque<PartRef> to_remove{part};
 
   while (!to_remove.empty()) {
     PartRef part = to_remove.front();
     to_remove.pop_front();
 
     for (size_t i = 0; i < part.input_count(); ++i) {
       to_remove.push_back(part.input(i).part());
     }
 
     for (size_t i = 0; i < part.output_count(); ++i) {
@@ skipping 75 matching lines @@
     sinks_.push_back(stage);
   }
 
   stage->SetUpdateCallback(update_function_);
 
   return PartRef(stage);
 }
 
 }  // namespace media
 }  // namespace mojo