[Editing] Modify mostForward/BackwardCaretPosition naming confusion.

Source/core/editing/VisibleUnits.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
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 1679 matching lines @@
     if (!pos.node())
         return true;
 
     if (isAtomicNode(pos.node()))
         return true;
 
     return pos.atStartOfNode();
 }
 
 template <typename Strategy>
-static PositionAlgorithm<Strategy> mostForwardCaretPosition(const PositionAlgorithm<Strategy>& position, EditingBoundaryCrossingRule rule)
+static PositionAlgorithm<Strategy> mostBackwardCaretPosition(const PositionAlgorithm<Strategy>& position, EditingBoundaryCrossingRule rule)
 {
     TRACE_EVENT0("blink", "Position::upstream");
 
     Node* startNode = position.anchorNode();
     if (!startNode)
         return PositionAlgorithm<Strategy>();
 
     // iterate backward from there, looking for a qualified position
     Node* boundary = enclosingVisualBoundary<Strategy>(startNode);
     // FIXME: PositionIterator should respect Before and After positions.
@@ skipping 95 matching lines @@
                 }
 
                 if (continuesOnNextLine)
                     return currentPos.computePosition();
             }
         }
     }
     return lastVisible.deprecatedComputePosition();
 }
 
-Position mostForwardCaretPosition(const Position& position, EditingBoundaryCrossingRule rule)
+Position mostBackwardCaretPosition(const Position& position, EditingBoundaryCrossingRule rule)
 {
-    return mostForwardCaretPosition<EditingStrategy>(position, rule);
+    return mostBackwardCaretPosition<EditingStrategy>(position, rule);
 }
 
-PositionInComposedTree mostForwardCaretPosition(const PositionInComposedTree& position, EditingBoundaryCrossingRule rule)
+PositionInComposedTree mostBackwardCaretPosition(const PositionInComposedTree& position, EditingBoundaryCrossingRule rule)
 {
-    return mostForwardCaretPosition<EditingInComposedTreeStrategy>(position, rule);
+    return mostBackwardCaretPosition<EditingInComposedTreeStrategy>(position, rule);
 }
 
 template <typename Strategy>
-PositionAlgorithm<Strategy> mostBackwardCaretPosition(const PositionAlgorithm<Strategy>& position, EditingBoundaryCrossingRule rule)
+PositionAlgorithm<Strategy> mostForwardCaretPosition(const PositionAlgorithm<Strategy>& position, EditingBoundaryCrossingRule rule)
 {
     TRACE_EVENT0("blink", "Position::downstream");
 
     Node* startNode = position.anchorNode();
     if (!startNode)
         return PositionAlgorithm<Strategy>();
 
     // iterate forward from there, looking for a qualified position
     Node* boundary = enclosingVisualBoundary<Strategy>(startNode);
     // FIXME: PositionIterator should respect Before and After positions.
@@ skipping 97 matching lines @@
 
                 if (continuesOnNextLine)
                     return currentPos.computePosition();
             }
         }
     }
 
     return lastVisible.deprecatedComputePosition();
 }
 
-Position mostBackwardCaretPosition(const Position& position, EditingBoundaryCrossingRule rule)
+Position mostForwardCaretPosition(const Position& position, EditingBoundaryCrossingRule rule)
 {
-    return mostBackwardCaretPosition<EditingStrategy>(position, rule);
+    return mostForwardCaretPosition<EditingStrategy>(position, rule);
 }
 
-PositionInComposedTree mostBackwardCaretPosition(const PositionInComposedTree& position, EditingBoundaryCrossingRule rule)
+PositionInComposedTree mostForwardCaretPosition(const PositionInComposedTree& position, EditingBoundaryCrossingRule rule)
 {
-    return mostBackwardCaretPosition<EditingInComposedTreeStrategy>(position, rule);
+    return mostForwardCaretPosition<EditingInComposedTreeStrategy>(position, rule);
 }
 
 }