CANCEL Untemplatize PositionAlgorithm<Strategy>::rendersInDifferentPosition()

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 125 matching lines @@
     //   - BeforeAnchor    0
     //   - AfterChildren   last editing offset in anchor node
     //   - AfterAnchor     last editing offset in anchor node
     // Editing operations will change in anchor node rather than nodes around
     // anchor node.
     int computeEditingOffset() const;
 
     // New code should not use this function.
     int deprecatedEditingOffset() const;
 
+    // |deprecatedEditingOffset()| is used only for layout object related
+    // functions, |isRenderedCharacter()|, |inRenderedText()|, and
+    // |rendersInDifferentPosition()|.
+    // New code should not use this function.
+    int deprecatedOffset() const { return m_offset; }
+
     // 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
     // |PositionAnchorType::OffsetInAhcor| to behave as |Range| boundary point.
     Node* nodeAsRangeFirstNode() const;
 
     // Similar to |nodeAsRangeLastNode()|, but returns a node in a range.
     Node* nodeAsRangeLastNode() const;
@@ skipping 47 matching lines @@
     bool atStartOfTree() const;
     bool atEndOfTree() const;
 
     // These return useful visually equivalent positions.
     PositionAlgorithm<Strategy> upstream(EditingBoundaryCrossingRule = CannotCrossEditingBoundary) const;
     PositionAlgorithm<Strategy> downstream(EditingBoundaryCrossingRule = CannotCrossEditingBoundary) const;
 
     bool isCandidate() const;
     bool inRenderedText() const;
     bool isRenderedCharacter() const;
-    bool rendersInDifferentPosition(const PositionAlgorithm<Strategy>&) const;
 
     InlineBoxPosition computeInlineBoxPosition(EAffinity) const;
     InlineBoxPosition computeInlineBoxPosition(EAffinity, TextDirection primaryDirection) const;
 
     TextDirection primaryDirection() const;
 
     static bool hasRenderedNonAnonymousDescendantsWithHeight(LayoutObject*);
     static bool nodeIsUserSelectNone(Node*);
     static bool nodeIsUserSelectAll(const Node*);
     static Node* rootUserSelectAllForNode(Node*);
@@ skipping 22 matching lines @@
     {
         visitor->trace(m_anchorNode);
     }
 
 private:
     bool isAfterAnchorOrAfterChildren() const
     {
         return isAfterAnchor() || isAfterChildren();
     }
 
-    int renderedOffset() const;
-
     RefPtrWillBeMember<Node> m_anchorNode;
     // m_offset can be the offset inside m_anchorNode, or if editingIgnoresContent(m_anchorNode)
     // returns true, then other places in editing will treat m_offset == 0 as "before the anchor"
     // and m_offset > 0 as "after the anchor node".  See parentAnchoredEquivalent for more info.
     int m_offset;
     PositionAnchorType m_anchorType;
     bool m_isLegacyEditingPosition;
 };
 
 extern template class CORE_EXTERN_TEMPLATE_EXPORT PositionAlgorithm<EditingStrategy>;
 extern template class CORE_EXTERN_TEMPLATE_EXPORT PositionAlgorithm<EditingInComposedTreeStrategy>;
 
 using Position = PositionAlgorithm<EditingStrategy>;
 using PositionInComposedTree = PositionAlgorithm<EditingInComposedTreeStrategy>;
 
+bool rendersInDifferentPosition(const Position&, const Position&);
+
 inline Position createLegacyEditingPosition(PassRefPtrWillBeRawPtr<Node> node, int offset)
 {
     return Position::createLegacyEditingPosition(node, offset);
 }
 
 template <typename Strategy>
 bool operator==(const PositionAlgorithm<Strategy>& a, const PositionAlgorithm<Strategy>& b)
 {
     if (a.isNull())
         return b.isNull();
@@ skipping 184 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