Introduce isVisuallyEquivalentCandidate() as replacement of PositionAlgorithm::isCandidate()

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 89 matching lines @@
     while (previousNode && (!previousNode->layoutObject() || inSameLine(VisiblePosition(firstPositionInOrBeforeNode(previousNode)), visiblePosition)))
         previousNode = previousLeafWithSameEditability(previousNode, editableType);
 
     while (previousNode && !previousNode->isShadowRoot()) {
         if (highestEditableRoot(firstPositionInOrBeforeNode(previousNode), editableType) != highestRoot)
             break;
 
         Position pos = isHTMLBRElement(*previousNode) ? positionBeforeNode(previousNode) :
             Position::editingPositionOf(previousNode, caretMaxOffset(previousNode));
 
-        if (pos.isCandidate())
+        if (isVisuallyEquivalentCandidate(pos))
             return pos;
 
         previousNode = previousLeafWithSameEditability(previousNode, editableType);
     }
     return Position();
 }
 
 static Position nextRootInlineBoxCandidatePosition(Node* node, const VisiblePosition& visiblePosition, EditableType editableType)
 {
     ContainerNode* highestRoot = highestEditableRoot(visiblePosition.deepEquivalent(), editableType);
     Node* nextNode = nextLeafWithSameEditability(node, editableType);
     while (nextNode && (!nextNode->layoutObject() || inSameLine(VisiblePosition(firstPositionInOrBeforeNode(nextNode)), visiblePosition)))
         nextNode = nextLeafWithSameEditability(nextNode, ContentIsEditable);
 
     while (nextNode && !nextNode->isShadowRoot()) {
         if (highestEditableRoot(firstPositionInOrBeforeNode(nextNode), editableType) != highestRoot)
             break;
 
         Position pos;
         pos = Position::editingPositionOf(nextNode, caretMinOffset(nextNode));
 
-        if (pos.isCandidate())
+        if (isVisuallyEquivalentCandidate(pos))
             return pos;
 
         nextNode = nextLeafWithSameEditability(nextNode, editableType);
     }
     return Position();
 }
 
 class CachedLogicallyOrderedLeafBoxes {
 public:
     CachedLogicallyOrderedLeafBoxes();
@@ skipping 1445 matching lines @@
         if (isHTMLBRElement(*position1.anchorNode()))
             return false;
 
         if (position1.computeEditingOffset() == position2.computeEditingOffset())
             return false;
 
         if (!position1.anchorNode()->isTextNode() && !position2.anchorNode()->isTextNode())
             return true;
     }
 
-    if (isHTMLBRElement(*position1.anchorNode()) && position2.isCandidate())
+    if (isHTMLBRElement(*position1.anchorNode()) && isVisuallyEquivalentCandidate(position2))
         return true;
 
-    if (isHTMLBRElement(*position2.anchorNode()) && position1.isCandidate())
+    if (isHTMLBRElement(*position2.anchorNode()) && isVisuallyEquivalentCandidate(position1))
         return true;
 
     if (!inSameContainingBlockFlowElement(position1.anchorNode(), position2.anchorNode()))
         return true;
 
     if (position1.anchorNode()->isTextNode() && !inRenderedText(position1))
         return false;
 
     if (position2.anchorNode()->isTextNode() && !inRenderedText(position2))
         return false;
@@ skipping 334 matching lines @@
 {
     return mostBackwardCaretPosition<EditingStrategy>(position, rule);
 }
 
 PositionInComposedTree mostBackwardCaretPosition(const PositionInComposedTree& position, EditingBoundaryCrossingRule rule)
 {
     return mostBackwardCaretPosition<EditingInComposedTreeStrategy>(position, rule);
 }
 
 }