Move inRenderedText() to VisibleUnits.cpp from Position.cpp

Source/core/editing/Position.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 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 10 matching lines @@
  * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 #include "config.h"
 #include "core/editing/Position.h"
 
 #include "core/dom/shadow/ElementShadow.h"
 #include "core/editing/EditingUtilities.h"
-#include "core/editing/PositionIterator.h"
 #include "core/editing/TextAffinity.h"
 #include "core/editing/VisibleUnits.h"
-#include "core/layout/LayoutBlock.h"
-#include "core/layout/LayoutInline.h"
-#include "core/layout/LayoutText.h"
-#include "core/layout/line/InlineTextBox.h"
+#include "core/layout/LayoutObject.h"
 #include "wtf/text/CString.h"
 #include <stdio.h>
 
 namespace blink {
 
 #if ENABLE(ASSERT)
 static bool canBeAnchorNode(Node* node)
 {
     if (!node || node->isFirstLetterPseudoElement())
         return true;
@@ skipping 404 matching lines @@
     return mostForwardCaretPosition(*this, rule);
 }
 
 template <typename Strategy>
 PositionAlgorithm<Strategy> PositionAlgorithm<Strategy>::downstream(EditingBoundaryCrossingRule rule) const
 {
     return mostBackwardCaretPosition(*this, rule);
 }
 
 template <typename Strategy>
-static bool inRenderedTextAlgorithm(const PositionAlgorithm<Strategy>& position)
-{
-    Node* const anchorNode = position.anchorNode();
-    if (!anchorNode || !anchorNode->isTextNode())
-        return false;
-
-    LayoutObject* layoutObject = anchorNode->layoutObject();
-    if (!layoutObject)
-        return false;
-
-    const int offsetInNode = position.computeEditingOffset();
-    LayoutText* textLayoutObject = toLayoutText(layoutObject);
-    for (InlineTextBox *box = textLayoutObject->firstTextBox(); box; box = box->nextTextBox()) {
-        if (offsetInNode < static_cast<int>(box->start()) && !textLayoutObject->containsReversedText()) {
-            // The offset we're looking for is before this node
-            // this means the offset must be in content that is
-            // not laid out. Return false.
-            return false;
-        }
-        if (box->containsCaretOffset(offsetInNode)) {
-            // Return false for offsets inside composed characters.
-            return offsetInNode == 0 || offsetInNode == textLayoutObject->nextOffset(textLayoutObject->previousOffset(offsetInNode));
-        }
-    }
-
-    return false;
-}
-
-bool inRenderedText(const Position& position)
-{
-    return inRenderedTextAlgorithm<EditingStrategy>(position);
-}
-
-bool inRenderedText(const PositionInComposedTree& position)
-{
-    return inRenderedTextAlgorithm<EditingInComposedTreeStrategy>(position);
-}
-
-template <typename Strategy>
 void PositionAlgorithm<Strategy>::debugPosition(const char* msg) const
 {
     static const char* const anchorTypes[] = {
         "OffsetInAnchor",
         "BeforeAnchor",
         "AfterAnchor",
         "BeforeChildren",
         "AfterChildren",
         "Invalid",
     };
@@ skipping 162 matching lines @@
 
 void showTree(const blink::Position* pos)
 {
     if (pos)
         pos->showTreeForThis();
     else
         fprintf(stderr, "Cannot showTree for (nil)\n");
 }
 
 #endif