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

third_party/WebKit/Source/core/editing/EditingUtilities.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007 Apple Inc. All rights reserved.
  *
  * 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
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 1200 matching lines @@
 VisiblePosition visiblePositionAfterNode(Node& node) {
   DCHECK(!needsLayoutTreeUpdate(node));
   if (node.hasChildren())
     return createVisiblePosition(lastPositionInOrAfterNode(&node));
   DCHECK(node.parentNode()) << node.parentNode();
   DCHECK(!node.parentNode()->isShadowRoot()) << node.parentNode();
   return VisiblePosition::inParentAfterNode(node);
 }
 
 bool isHTMLListElement(Node* n) {
-  return (n && (isHTMLUListElement(*n) || isHTMLOListElement(*n) ||
-                isHTMLDListElement(*n)));
+  return (n &&
+          (isHTMLUListElement(*n) || isHTMLOListElement(*n) ||
+           isHTMLDListElement(*n)));
 }
 
 bool isListItem(const Node* n) {
   return n && n->layoutObject() && n->layoutObject()->isListItem();
 }
 
 bool isPresentationalHTMLElement(const Node* node) {
   if (!node->isHTMLElement())
     return false;
 
@@ skipping 229 matching lines @@
   DCHECK(!needsLayoutTreeUpdate(*firstList));
   DCHECK(!needsLayoutTreeUpdate(*secondList));
   return firstList->hasTagName(
              secondList
                  ->tagQName())  // make sure the list types match (ol vs. ul)
          && hasEditableStyle(*firstList) &&
          hasEditableStyle(*secondList)  // both lists are editable
          &&
          rootEditableElement(*firstList) ==
              rootEditableElement(*secondList)  // don't cross editing boundaries
-         && isVisiblyAdjacent(Position::inParentAfterNode(*firstList),
-                              Position::inParentBeforeNode(*secondList));
+         &&
+         isVisiblyAdjacent(Position::inParentAfterNode(*firstList),
+                           Position::inParentBeforeNode(*secondList));
   // Make sure there is no visible content between this li and the previous list
 }
 
 bool isDisplayInsideTable(const Node* node) {
   if (!node || !node->isElementNode())
     return false;
 
   LayoutObject* layoutObject = node->layoutObject();
   return (layoutObject && layoutObject->isTable());
 }
@@ skipping 645 matching lines @@
         return InputType::DeleteWordBackward;
       if (granularity == LineBoundary)
         return InputType::DeleteLineBackward;
       return InputType::DeleteContentBackward;
     default:
       return InputType::None;
   }
 }
 
 }  // namespace blink