Introduce composed tree version of endOfDocument()

Source/core/editing/VisibleUnits.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 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 1551 matching lines @@
         return VisiblePosition();
 
     return createVisiblePosition(firstPositionInNode(node->document().documentElement()));
 }
 
 VisiblePosition startOfDocument(const VisiblePosition& c)
 {
     return startOfDocument(c.deepEquivalent().anchorNode());
 }
 
-VisiblePosition endOfDocument(const Node* node)
+template <typename Strategy>
+static VisiblePositionTemplate<Strategy> endOfDocumentAlgorithm(const VisiblePositionTemplate<Strategy>& visiblePosition)
 {
+    Node* node = visiblePosition.deepEquivalent().anchorNode();
     if (!node || !node->document().documentElement())
-        return VisiblePosition();
+        return VisiblePositionTemplate<Strategy>();
 
     Element* doc = node->document().documentElement();
-    return createVisiblePosition(lastPositionInNode(doc));
+    return createVisiblePosition(PositionAlgorithm<Strategy>::lastPositionInNode(doc));
 }
 
 VisiblePosition endOfDocument(const VisiblePosition& c)
 {
-    return endOfDocument(c.deepEquivalent().anchorNode());
+    return endOfDocumentAlgorithm<EditingStrategy>(c);
+}
+
+VisiblePositionInComposedTree endOfDocument(const VisiblePositionInComposedTree& c)
+{
+    return endOfDocumentAlgorithm<EditingInComposedTreeStrategy>(c);
 }
 
 bool isStartOfDocument(const VisiblePosition& p)
 {
     return p.isNotNull() && previousPositionOf(p, CanCrossEditingBoundary).isNull();
 }
 
 bool isEndOfDocument(const VisiblePosition& p)
 {
     return p.isNotNull() && nextPositionOf(p, CanCrossEditingBoundary).isNull();
@@ skipping 1414 matching lines @@
         return honorEditingBoundaryAtOrBefore(prev, visiblePosition.deepEquivalent());
     case CanSkipOverEditingBoundary:
         return skipToStartOfEditingBoundary(prev, visiblePosition.deepEquivalent());
     }
 
     ASSERT_NOT_REACHED();
     return honorEditingBoundaryAtOrBefore(prev, visiblePosition.deepEquivalent());
 }
 
 } // namespace blink