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

third_party/WebKit/Source/core/xml/XPathPath.cpp

 /*
  * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
  * Copyright (C) 2006, 2009 Apple Inc.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1. Redistributions of source code must retain the above copyright
@@ skipping 115 matching lines @@
         (step->getAxis() != Step::ChildAxis &&
          step->getAxis() != Step::SelfAxis &&
          step->getAxis() != Step::DescendantAxis &&
          step->getAxis() != Step::DescendantOrSelfAxis &&
          step->getAxis() != Step::AttributeAxis);
 
     if (needToCheckForDuplicateNodes)
       resultIsSorted = false;
 
     // This is a simplified check that can be improved to handle more cases.
-    if (nodes.subtreesAreDisjoint() && (step->getAxis() == Step::ChildAxis ||
-                                        step->getAxis() == Step::SelfAxis))
+    if (nodes.subtreesAreDisjoint() &&
+        (step->getAxis() == Step::ChildAxis ||
+         step->getAxis() == Step::SelfAxis))
       newNodes->markSubtreesDisjoint(true);
 
     for (const auto& inputNode : nodes) {
       NodeSet* matches = NodeSet::create();
       step->evaluate(context, inputNode, *matches);
 
       if (!matches->isSorted())
         resultIsSorted = false;
 
       for (const auto& node : *matches) {
@@ skipping 46 matching lines @@
 
   NodeSet& nodes = v.modifiableNodeSet(context);
   m_path->evaluate(context, nodes);
 
   return v;
 }
 
 }  // namespace XPath
 
 }  // namespace blink