Re-format PositionIterator.cpp to be PRESUBMIT friendly

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

 /*
  * Copyright (C) 2007, 2008 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 255 matching lines @@
                            ? 0
                            : Strategy::lastOffsetForEditing(m_anchorNode);
     // Decrement depth initializing with -1 because
     // |m_nodeAfterPositionInAnchor| is null so still unneeded.
     if (m_depthToAnchorNode >= m_offsetsInAnchorNode.size())
       m_offsetsInAnchorNode.push_back(kInvalidOffset);
     else
       m_offsetsInAnchorNode[m_depthToAnchorNode] = kInvalidOffset;
     ++m_depthToAnchorNode;
     return;
-  } else {
-    if (m_offsetInAnchor && m_anchorNode->layoutObject()) {
-      // Case #3-a. This is a reverse of increment()::Case#2.
-      // In this case |anchor| is a leaf(E,F,C,G or H) and
-      // |m_offsetInAnchor| is not on the beginning of |anchor|.
-      // Then just decrement |m_offsetInAnchor|.
-      m_offsetInAnchor =
-          previousGraphemeBoundaryOf(m_anchorNode, m_offsetInAnchor);
-      return;
-    } else {
-      // Case #3-b. This is a reverse of increment()::Case#1.
-      // In this case |anchor| is a leaf(E,F,C,G or H) and
-      // |m_offsetInAnchor| is on the beginning of |anchor|.
-      // Let |anchor| is E,
-      // next |anchor| is B and |child| is E.
-      m_nodeAfterPositionInAnchor = m_anchorNode;
-      m_anchorNode = Strategy::parent(*m_anchorNode);
-      if (!m_anchorNode)
-        return;
-      DCHECK_GT(m_depthToAnchorNode, 0u);
-      --m_depthToAnchorNode;
-      if (m_offsetsInAnchorNode[m_depthToAnchorNode] == kInvalidOffset)
-        m_offsetsInAnchorNode[m_depthToAnchorNode] =
-            Strategy::index(*m_nodeAfterPositionInAnchor);
-    }
   }
+
+  if (m_offsetInAnchor && m_anchorNode->layoutObject()) {
+    // Case #3-a. This is a reverse of increment()::Case#2.
+    // In this case |anchor| is a leaf(E,F,C,G or H) and
+    // |m_offsetInAnchor| is not on the beginning of |anchor|.
+    // Then just decrement |m_offsetInAnchor|.
+    m_offsetInAnchor =
+        previousGraphemeBoundaryOf(m_anchorNode, m_offsetInAnchor);
+    return;
+  }
+  // Case #3-b. This is a reverse of increment()::Case#1.
+  // In this case |anchor| is a leaf(E,F,C,G or H) and
+  // |m_offsetInAnchor| is on the beginning of |anchor|.
+  // Let |anchor| is E,
+  // next |anchor| is B and |child| is E.
+  m_nodeAfterPositionInAnchor = m_anchorNode;
+  m_anchorNode = Strategy::parent(*m_anchorNode);
+  if (!m_anchorNode)
+    return;
+  DCHECK_GT(m_depthToAnchorNode, 0u);
+  --m_depthToAnchorNode;
+  if (m_offsetsInAnchorNode[m_depthToAnchorNode] != kInvalidOffset)
+    return;
+  m_offsetsInAnchorNode[m_depthToAnchorNode] =
+      Strategy::index(*m_nodeAfterPositionInAnchor);
 }
 
 template <typename Strategy>
 bool PositionIteratorAlgorithm<Strategy>::atStart() const {
   DCHECK(isValid());
   if (!m_anchorNode)
     return true;
   if (Strategy::parent(*m_anchorNode))
     return false;
   return (!Strategy::hasChildren(*m_anchorNode) && !m_offsetInAnchor) ||
@@ skipping 31 matching lines @@
   if (m_nodeAfterPositionInAnchor)
     return false;
   return Strategy::hasChildren(*m_anchorNode) ||
          m_offsetInAnchor >= Strategy::lastOffsetForEditing(m_anchorNode);
 }
 
 template class PositionIteratorAlgorithm<EditingStrategy>;
 template class PositionIteratorAlgorithm<EditingInFlatTreeStrategy>;
 
 }  // namespace blink