Rename unchecked functions to appropriate name.

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

 /*
  * Copyright (C) 2007, 2008 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 140 matching lines @@
             m_offsetsInAnchorNode[m_depthToAnchorNode] = 0;
         return;
     }
 
     if (m_anchorNode->layoutObject() && !Strategy::hasChildren(*m_anchorNode) && m_offsetInAnchor < Strategy::lastOffsetForEditing(m_anchorNode)) {
         // Case #2. This is the next of Case #1 or #2 itself.
         // Position is (|anchor|, |m_offsetInAchor|).
         // In this case |anchor| is a leaf(E,F,C,G or H) and
         // |m_offsetInAnchor| is not on the end of |anchor|.
         // Then just increment |m_offsetInAnchor|.
-        m_offsetInAnchor = uncheckedNextOffset(m_anchorNode, m_offsetInAnchor);
+        m_offsetInAnchor = nextGraphemeBoundaryOf(m_anchorNode, m_offsetInAnchor);
     } else {
         // Case #3. This is the next of Case #2 or #3.
         // Position is the end of |anchor|.
         // 3-a. If |anchor| has next sibling (let E),
         //      next |anchor| is B and |child| is F (next is Case #1.)
         // 3-b. If |anchor| doesn't have next sibling (let F),
         //      next |anchor| is B and |child| is null. (next is Case #3.)
         m_nodeAfterPositionInAnchor = m_anchorNode;
         m_anchorNode = Strategy::parent(*m_nodeAfterPositionInAnchor);
         if (!m_anchorNode)
@@ skipping 85 matching lines @@
         else
             m_offsetsInAnchorNode[m_depthToAnchorNode] = kInvalidOffset;
         ++m_depthToAnchorNode;
         return;
     } else {
         if (m_offsetInAnchor && m_anchorNode->layoutObject()) {
             // Case #3-a. This is a reverse of increment()::Case#2.
             // In this case |anchor| is a leaf(E,F,C,G or H) and
             // |m_offsetInAnchor| is not on the beginning of |anchor|.
             // Then just decrement |m_offsetInAnchor|.
-            m_offsetInAnchor = uncheckedPreviousOffset(m_anchorNode, m_offsetInAnchor);
+            m_offsetInAnchor = previousGraphemeBoundaryOf(m_anchorNode, m_offsetInAnchor);
             return;
         } else {
             // Case #3-b. This is a reverse of increment()::Case#1.
             // In this case |anchor| is a leaf(E,F,C,G or H) and
             // |m_offsetInAnchor| is on the beginning of |anchor|.
             // Let |anchor| is E,
             // next |anchor| is B and |child| is E.
             m_nodeAfterPositionInAnchor = m_anchorNode;
             m_anchorNode = Strategy::parent(*m_anchorNode);
             if (!m_anchorNode)
@@ skipping 47 matching lines @@
         return true;
     if (m_nodeAfterPositionInAnchor)
         return false;
     return Strategy::hasChildren(*m_anchorNode) || m_offsetInAnchor >= Strategy::lastOffsetForEditing(m_anchorNode);
 }
 
 template class PositionIteratorAlgorithm<EditingStrategy>;
 template class PositionIteratorAlgorithm<EditingInFlatTreeStrategy>;
 
 } // namespace blink