Introduce PositionAlgorithm<Strategy>::editingPositionOf()

Source/core/editing/VisiblePosition.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
  * Portions Copyright (c) 2011 Motorola Mobility, 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 230 matching lines @@
                     if (box->bidiLevel() == level)
                         break;
                     level = box->bidiLevel();
                 }
                 layoutObject = &box->layoutObject();
                 offset = primaryDirection == LTR ? box->caretMinOffset() : box->caretMaxOffset();
             }
             break;
         }
 
-        p = createLegacyEditingPosition(layoutObject->node(), offset);
+        p = Position::editingPositionOf(layoutObject->node(), offset);
 
         if ((p.isCandidate() && p.downstream() != downstreamStart) || p.atStartOfTree() || p.atEndOfTree())
             return p;
 
         ASSERT(p != m_deepPosition);
     }
 }
 
 VisiblePosition VisiblePosition::left() const
 {
@@ skipping 141 matching lines @@
                     if (box->bidiLevel() == level)
                         break;
                     level = box->bidiLevel();
                 }
                 layoutObject = &box->layoutObject();
                 offset = primaryDirection == LTR ? box->caretMaxOffset() : box->caretMinOffset();
             }
             break;
         }
 
-        p = createLegacyEditingPosition(layoutObject->node(), offset);
+        p = Position::editingPositionOf(layoutObject->node(), offset);
 
         if ((p.isCandidate() && p.downstream() != downstreamStart) || p.atStartOfTree() || p.atEndOfTree())
             return p;
 
         ASSERT(p != m_deepPosition);
     }
 }
 
 VisiblePosition VisiblePosition::right() const
 {
@@ skipping 341 matching lines @@
     else
         fprintf(stderr, "Cannot showTree for (nil) VisiblePosition.\n");
 }
 
 void showTree(const blink::VisiblePosition& vpos)
 {
     vpos.showTreeForThis();
 }
 
 #endif