Introduce Position::nodeAsRangeLastNode

Source/core/dom/Position.h

 /*
  * Copyright (C) 2004, 2006, 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 123 matching lines @@
     }
 
     // These are convenience methods which are smart about whether the position is neighbor anchored or parent anchored
     Node* computeNodeBeforePosition() const;
     Node* computeNodeAfterPosition() const;
 
     // Returns node as |Range::firstNode()|. This position must be a
     // |PositionIs::OffsetInAhcor| to behave as |Range| boundary point.
     Node* nodeAsRangeFirstNode() const;
 
+    // Similar to |nodeAsRangeLastNode()|, but returns a node in a range.
+    Node* nodeAsRangeLastNode() const;
+
     // Returns a node as past last as same as |Range::pastLastNode()|. This
     // function is supposed to used in HTML serialization and plain text
     // iterator. This position must be a |PositionIs::OffsetInAhcor| to
     // behave as |Range| boundary point.
     Node* nodeAsRangePastLastNode() const;
 
     Node* commonAncestorContainer(const PositionType&) const;
 
     Node* anchorNode() const { return m_anchorNode.get(); }
 
@@ skipping 299 matching lines @@
 
 } // namespace blink
 
 #ifndef NDEBUG
 // Outside the WebCore namespace for ease of invocation from gdb.
 void showTree(const blink::Position&);
 void showTree(const blink::Position*);
 #endif
 
 #endif // Position_h