CANCELLED Merge SelectionAdjuster into VisibleSelection part 1

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

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 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 12 matching lines @@
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #include "core/editing/SelectionAdjuster.h"
 
 #include "core/editing/EditingUtilities.h"
 
 namespace blink {
 
+// TODO(xiaochengh): Move everything to VisibleSelection.cpp.
+
 namespace {
 
 Node* enclosingShadowHost(Node* node) {
   for (Node* runner = node; runner;
        runner = FlatTreeTraversal::parent(*runner)) {
     if (isShadowHost(runner))
       return runner;
   }
   return nullptr;
 }
@@ skipping 103 matching lines @@
   }
 
   if (Node* firstChild = treeScope.rootNode().firstChild())
     return Position::beforeNode(firstChild);
 
   return Position();
 }
 
 }  // namespace
 
-void SelectionAdjuster::adjustSelectionToAvoidCrossingShadowBoundaries(
-    VisibleSelection* selection) {
+std::pair<AdjustDirection, Position> adjustmentToAvoidCrossingShadowBoundaries(
+    const VisibleSelection& selection) {
   // Note: |m_selectionType| isn't computed yet.
-  DCHECK(selection->base().isNotNull());
-  DCHECK(selection->extent().isNotNull());
-  DCHECK(selection->start().isNotNull());
-  DCHECK(selection->end().isNotNull());
+  DCHECK(selection.base().isNotNull());
+  DCHECK(selection.extent().isNotNull());
+  DCHECK(selection.start().isNotNull());
+  DCHECK(selection.end().isNotNull());
 
   // TODO(hajimehoshi): Checking treeScope is wrong when a node is
   // distributed, but we leave it as it is for backward compatibility.
-  if (selection->start().anchorNode()->treeScope() ==
-      selection->end().anchorNode()->treeScope())
-    return;
+  if (selection.start().anchorNode()->treeScope() ==
+      selection.end().anchorNode()->treeScope())
+    return std::make_pair(AdjustDirection::kAdjustNone, Position());
 
-  if (selection->isBaseFirst()) {
+  if (selection.isBaseFirst()) {
     const Position& newEnd = adjustPositionForEnd(
-        selection->end(), selection->start().computeContainerNode());
-    selection->m_extent = newEnd;
-    selection->m_end = newEnd;
-    return;
+        selection.end(), selection.start().computeContainerNode());
+    return std::make_pair(AdjustDirection::kAdjustEnd, newEnd);
   }
 
   const Position& newStart = adjustPositionForStart(
-      selection->start(), selection->end().computeContainerNode());
-  selection->m_extent = newStart;
-  selection->m_start = newStart;
+      selection.start(), selection.end().computeContainerNode());
+  return std::make_pair(AdjustDirection::kAdjustStart, newStart);
 }
 
 // This function is called twice. The first is called when |m_start| and |m_end|
 // or |m_extent| are same, and the second when |m_start| and |m_end| are changed
 // after downstream/upstream.
-void SelectionAdjuster::adjustSelectionToAvoidCrossingShadowBoundaries(
-    VisibleSelectionInFlatTree* selection) {
-  Node* const shadowHostStart = enclosingShadowHostForStart(selection->start());
-  Node* const shadowHostEnd = enclosingShadowHostForEnd(selection->end());
+std::pair<AdjustDirection, PositionInFlatTree>
+adjustmentToAvoidCrossingShadowBoundaries(
+    const VisibleSelectionInFlatTree& selection) {
+  Node* const shadowHostStart = enclosingShadowHostForStart(selection.start());
+  Node* const shadowHostEnd = enclosingShadowHostForEnd(selection.end());
   if (shadowHostStart == shadowHostEnd)
-    return;
+    return std::make_pair(AdjustDirection::kAdjustNone, PositionInFlatTree());
 
-  if (selection->isBaseFirst()) {
+  if (selection.isBaseFirst()) {
     Node* const shadowHost = shadowHostStart ? shadowHostStart : shadowHostEnd;
     const PositionInFlatTree& newEnd =
-        adjustPositionInFlatTreeForEnd(selection->end(), shadowHost);
-    selection->m_extent = newEnd;
-    selection->m_end = newEnd;
-    return;
+        adjustPositionInFlatTreeForEnd(selection.end(), shadowHost);
+    return std::make_pair(AdjustDirection::kAdjustEnd, newEnd);
   }
   Node* const shadowHost = shadowHostEnd ? shadowHostEnd : shadowHostStart;
   const PositionInFlatTree& newStart =
-      adjustPositionInFlatTreeForStart(selection->start(), shadowHost);
-  selection->m_extent = newStart;
-  selection->m_start = newStart;
+      adjustPositionInFlatTreeForStart(selection.start(), shadowHost);
+  return std::make_pair(AdjustDirection::kAdjustStart, newStart);
 }
 
 }  // namespace blink