DO NOT COMMIT: Results of running new (proposed) clang-format on Blink

third_party/WebKit/Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All
  * rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved.
  * (http://www.torchmobile.com/)
  *
@@ skipping 506 matching lines @@
     appendChild(node, exceptionState);
 }
 
 void Node::before(const HeapVector<NodeOrString>& nodes,
                   ExceptionState& exceptionState) {
   Node* parent = parentNode();
   if (!parent)
     return;
   Node* viablePreviousSibling = findViablePreviousSibling(*this, nodes);
   if (Node* node = convertNodesIntoNode(nodes, document(), exceptionState))
-    parent->insertBefore(node, viablePreviousSibling
-                                   ? viablePreviousSibling->nextSibling()
-                                   : parent->firstChild(),
+    parent->insertBefore(node,
+                         viablePreviousSibling
+                             ? viablePreviousSibling->nextSibling()
+                             : parent->firstChild(),
                          exceptionState);
 }
 
 void Node::after(const HeapVector<NodeOrString>& nodes,
                  ExceptionState& exceptionState) {
   Node* parent = parentNode();
   if (!parent)
     return;
   Node* viableNextSibling = findViableNextSibling(*this, nodes);
   if (Node* node = convertNodesIntoNode(nodes, document(), exceptionState))
@@ skipping 950 matching lines @@
            child = child->previousSibling()) {
         if (child == child1)
           return kDocumentPositionFollowing | connection;
       }
       return kDocumentPositionPreceding | connection;
     }
   }
 
   // There was no difference between the two parent chains, i.e., one was a
   // subset of the other.  The shorter chain is the ancestor.
-  return index1 < index2
-             ? kDocumentPositionFollowing | kDocumentPositionContainedBy |
-                   connection
-             : kDocumentPositionPreceding | kDocumentPositionContains |
-                   connection;
+  return index1 < index2 ? kDocumentPositionFollowing |
+                               kDocumentPositionContainedBy | connection
+                         : kDocumentPositionPreceding |
+                               kDocumentPositionContains | connection;
 }
 
 String Node::debugName() const {
   StringBuilder name;
   appendUnsafe(name, debugNodeName());
   if (isElementNode()) {
     const Element& thisElement = toElement(*this);
     if (thisElement.hasID()) {
       name.append(" id=\'");
       appendUnsafe(name, thisElement.getIdAttribute());
@@ skipping 1051 matching lines @@
   if (node) {
     std::stringstream stream;
     node->printNodePathTo(stream);
     LOG(INFO) << stream.str();
   } else {
     LOG(INFO) << "Cannot showNodePath for <null>";
   }
 }
 
 #endif