Move implementation of Range::firstNode and Range::pastLastNode to Position

Source/core/dom/Position.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 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 213 matching lines @@
     if (!m_anchorNode->offsetInCharacters()
         && (m_anchorType == PositionIsAfterAnchor || m_anchorType == PositionIsAfterChildren || static_cast<unsigned>(m_offset) == m_anchorNode->countChildren())
         && (editingIgnoresContent(m_anchorNode.get()) || isRenderedHTMLTableElement(m_anchorNode.get()))
         && containerNode()) {
         return positionInParentAfterNode(*m_anchorNode);
     }
 
     return Position(containerNode(), computeOffsetInContainerNode(), PositionIsOffsetInAnchor);
 }
 
+Position Position::toOffsetInAnchor() const
+{
+    if (isNull())
+        return Position();
+
+    return Position(containerNode(), computeOffsetInContainerNode(), Position::PositionIsOffsetInAnchor);
+}
+
 Node* Position::computeNodeBeforePosition() const
 {
     if (!m_anchorNode)
         return 0;
     switch (anchorType()) {
     case PositionIsBeforeChildren:
         return 0;
     case PositionIsAfterChildren:
         return m_anchorNode->lastChild();
     case PositionIsOffsetInAnchor:
@@ skipping 21 matching lines @@
         return NodeTraversal::childAt(*m_anchorNode, m_offset);
     case PositionIsBeforeAnchor:
         return m_anchorNode.get();
     case PositionIsAfterAnchor:
         return m_anchorNode->nextSibling();
     }
     ASSERT_NOT_REACHED();
     return 0;
 }
 
+// An implementation of |Range::firstNode()|.
+Node* Position::nodeAsRangeFirstNode() const
+{
+    ASSERT(m_anchorType == PositionIsOffsetInAnchor);
+    if (!m_anchorNode)
+        return nullptr;
+    if (m_anchorNode->offsetInCharacters())
+        return m_anchorNode.get();
+    if (Node* child = NodeTraversal::childAt(*m_anchorNode, m_offset))
+        return child;
+    if (!m_offset)
+        return m_anchorNode.get();
+    return NodeTraversal::nextSkippingChildren(*m_anchorNode);
+}
+
+// An implementation of |Range::pastLastNode()|.
+Node* Position::nodeAsRangePastLastNode() const
+{
+    ASSERT(m_anchorType == PositionIsOffsetInAnchor);
+    if (!m_anchorNode)
+        return nullptr;
+    if (m_anchorNode->offsetInCharacters())
+        return NodeTraversal::nextSkippingChildren(*m_anchorNode);
+    if (Node* child = NodeTraversal::childAt(*m_anchorNode, m_offset))
+        return child;
+    return NodeTraversal::nextSkippingChildren(*m_anchorNode);
+}
+
 Position::AnchorType Position::anchorTypeForLegacyEditingPosition(Node* anchorNode, int offset)
 {
     if (anchorNode && editingIgnoresContent(anchorNode)) {
         if (offset == 0)
             return Position::PositionIsBeforeAnchor;
         return Position::PositionIsAfterAnchor;
     }
     return Position::PositionIsOffsetInAnchor;
 }
 
@@ skipping 1028 matching lines @@
     pos.showTreeForThis();
 }
 
 void showTree(const blink::Position* pos)
 {
     if (pos)
         pos->showTreeForThis();
 }
 
 #endif