Introduce PositionAlgorithm<Strategy>::editingPositionOf()

Source/core/editing/iterators/CharacterIterator.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2005 Alexey Proskuryakov.
  *
  * 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 89 matching lines @@
     return m_textIterator.endOffsetInCurrentContainer();
 }
 
 template <typename Strategy>
 PositionAlgorithm<Strategy> CharacterIteratorAlgorithm<Strategy>::startPosition() const
 {
     if (!m_textIterator.atEnd()) {
         if (m_textIterator.length() > 1) {
             Node* n = m_textIterator.currentContainer();
             int offset = m_textIterator.startOffsetInCurrentContainer() + m_runOffset;
-            return PositionAlgorithm<Strategy>::createLegacyEditingPosition(n, offset);
+            return PositionAlgorithm<Strategy>::editingPositionOf(n, offset);
         }
         ASSERT(!m_runOffset);
     }
     return m_textIterator.startPositionInCurrentContainer();
 }
 
 template <typename Strategy>
 PositionAlgorithm<Strategy> CharacterIteratorAlgorithm<Strategy>::endPosition() const
 {
     if (!m_textIterator.atEnd()) {
         if (m_textIterator.length() > 1) {
             Node* n = m_textIterator.currentContainer();
             int offset = m_textIterator.startOffsetInCurrentContainer() + m_runOffset;
-            return PositionAlgorithm<Strategy>::createLegacyEditingPosition(n, offset + 1);
+            return PositionAlgorithm<Strategy>::editingPositionOf(n, offset + 1);
         }
         ASSERT(!m_runOffset);
     }
     return m_textIterator.endPositionInCurrentContainer();
 }
 
 template <typename Strategy>
 void CharacterIteratorAlgorithm<Strategy>::advance(int count)
 {
     if (count <= 0) {
@@ skipping 53 matching lines @@
 EphemeralRange calculateCharacterSubrange(const EphemeralRange& range, int characterOffset, int characterCount)
 {
     CharacterIterator entireRangeIterator(range, TextIteratorEmitsObjectReplacementCharacter);
     return entireRangeIterator.calculateCharacterSubrange(characterOffset, characterCount);
 }
 
 template class CORE_TEMPLATE_EXPORT CharacterIteratorAlgorithm<EditingStrategy>;
 template class CORE_TEMPLATE_EXPORT CharacterIteratorAlgorithm<EditingInComposedTreeStrategy>;
 
 } // namespace blink