Reduce indentation in TraverseInternalAlgorithm() for {Left,Right}PositionOf()

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

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 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
@@ skipping 324 matching lines @@
         line_layout_item = box->GetLineLayoutItem();
         offset = Traversal::CaretEndOffsetOf(*box);
         if (box->BidiLevel() > level) {
           do {
             prev_box = Traversal::ForwardLeafChildOf(*prev_box);
           } while (prev_box && prev_box->BidiLevel() > level);
 
           if (!prev_box || prev_box->BidiLevel() < level)
             continue;
         }
-      } else {
-        // Trailing edge of a secondary run. Set to the leading edge of
-        // the entire run.
-        while (true) {
-          box = Traversal::FindBackwardBoundaryOfEntireBidiRun(*box, level);
-          if (box->BidiLevel() == level)
-            break;
-          level = box->BidiLevel();
-          box = Traversal::FindForwardBoundaryOfEntireBidiRun(*box, level);
-          if (box->BidiLevel() == level)
-            break;
-          level = box->BidiLevel();
-        }
-        line_layout_item = box->GetLineLayoutItem();
-        offset = Traversal::CaretMinOffsetOf(primary_direction, *box);
+        break;
       }
+      // Trailing edge of a secondary run. Set to the leading edge of
+      // the entire run.
+      while (true) {
+        box = Traversal::FindBackwardBoundaryOfEntireBidiRun(*box, level);
+        if (box->BidiLevel() == level)
+          break;
+        level = box->BidiLevel();
+        box = Traversal::FindForwardBoundaryOfEntireBidiRun(*box, level);
+        if (box->BidiLevel() == level)
+          break;
+        level = box->BidiLevel();
+      }
+      line_layout_item = box->GetLineLayoutItem();
+      offset = Traversal::CaretMinOffsetOf(primary_direction, *box);
       break;
     }
 
     p = PositionTemplate<Strategy>::EditingPositionOf(
         line_layout_item.GetNode(), offset);
 
     if ((IsVisuallyEquivalentCandidate(p) &&
          MostForwardCaretPosition(p) != downstream_start) ||
         p.AtStartOfTree() || p.AtEndOfTree())
       return p;
@@ skipping 40 matching lines @@
 }
 
 VisiblePositionInFlatTree RightPositionOf(
     const VisiblePositionInFlatTree& visible_position) {
   return TraverseAlgorithm<EditingInFlatTreeStrategy,
                            TraversalRight<EditingInFlatTreeStrategy>>(
       visible_position);
 }
 
 }  // namespace blink