Introduce composed tree version of isFirstPositionAfterTable()

Source/core/editing/EditingUtilities.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007 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 844 matching lines @@
     if (!n)
         return pos;
     Position result = positionInParentAfterNode(*n);
     if (result.isNull() || result.anchorNode()->rootEditableElement() != pos.anchorNode()->rootEditableElement())
         return pos;
     if (containingSpecialElement)
         *containingSpecialElement = n;
     return result;
 }
 
+template <typename Strategy>
+static Element* isFirstPositionAfterTableAlgorithm(const VisiblePositionTemplate<Strategy>& visiblePosition)
+{
+    const PositionAlgorithm<Strategy> upstream(mostBackwardCaretPosition(visiblePosition.deepEquivalent()));
+    if (isRenderedTableElement(upstream.anchorNode()) && upstream.atLastEditingPositionForNode())
+        return toElement(upstream.anchorNode());
+
+    return nullptr;
+}
+
 Element* isFirstPositionAfterTable(const VisiblePosition& visiblePosition)
 {
-    Position upstream(mostBackwardCaretPosition(visiblePosition.deepEquivalent()));
-    if (isRenderedTableElement(upstream.anchorNode()) && upstream.atLastEditingPositionForNode())
-        return toElement(upstream.anchorNode());
+    return isFirstPositionAfterTableAlgorithm<EditingStrategy>(visiblePosition);
+}
 
-    return 0;
+Element* isFirstPositionAfterTable(const VisiblePositionInComposedTree& visiblePosition)
+{
+    return isFirstPositionAfterTableAlgorithm<EditingInComposedTreeStrategy>(visiblePosition);
 }
 
 Element* isLastPositionBeforeTable(const VisiblePosition& visiblePosition)
 {
     Position downstream(mostForwardCaretPosition(visiblePosition.deepEquivalent()));
     if (isRenderedTableElement(downstream.anchorNode()) && downstream.atFirstEditingPositionForNode())
         return toElement(downstream.anchorNode());
 
     return 0;
 }
@@ skipping 777 matching lines @@
     // if the selection starts just before a paragraph break, skip over it
     if (isEndOfParagraph(visiblePosition))
         return mostForwardCaretPosition(nextPositionOf(visiblePosition).deepEquivalent());
 
     // otherwise, make sure to be at the start of the first selected node,
     // instead of possibly at the end of the last node before the selection
     return mostForwardCaretPosition(visiblePosition.deepEquivalent());
 }
 
 } // namespace blink