Avoid allocating temporary ranges in connection with text and character iterators.

Source/core/editing/TextIterator.h

 /*
  * Copyright (C) 2004, 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 92 matching lines @@
             ASSERT(length() == 1);
             output.append(&m_singleCharacterBuffer, 1);
         } else {
             string().appendTo(output, startOffset() + position, lengthToAppend);
         }
     }
 
     PassRefPtrWillBeRawPtr<Range> range() const;
     Node* node() const;
 
+    int startOffset() const;
+    int endOffset() const;
+    Node* startContainer() const;
+    Position startPosition() const;
+    Position endPosition() const;
+
     // Computes the length of the given range using a text iterator. The default
     // iteration behavior is to always emit object replacement characters for
     // replaced elements. When |forSelectionPreservation| is set to true, it
     // also emits spaces for other non-text nodes using the
     // |TextIteratorEmitsCharactersBetweenAllVisiblePosition| mode.
     static int rangeLength(const Range*, bool forSelectionPreservation = false);
     static PassRefPtrWillBeRawPtr<Range> subrange(Range* entireRange, int characterOffset, int characterCount);
 
 private:
     enum IterationProgress {
         HandledNone,
         HandledAuthorShadowRoots,
         HandledUserAgentShadowRoot,
         HandledNode,
         HandledChildren
     };
 
     void initialize(const Position& start, const Position& end);
 
-    int startOffset() const { return m_positionStartOffset; }
+    void flushPositionOffsets() const;
+    int positionStartOffset() const { return m_positionStartOffset; }
     const String& string() const { return m_text; }
     void exitNode();
     bool shouldRepresentNodeOffsetZero();
     bool shouldEmitSpaceBeforeAndAfterNode(Node*);
     void representNodeOffsetZero();
     bool handleTextNode();
     bool handleReplacedElement();
     bool handleNonTextNode();
     void handleTextBox();
     void handleTextNodeFirstLetter(RenderTextFragment*);
@@ skipping 96 matching lines @@
         if (!m_textLength)
             return;
         if (m_singleCharacterBuffer)
             output.prepend(&m_singleCharacterBuffer, 1);
         else
             m_textContainer.prependTo(output, m_textOffset, m_textLength);
     }
 
     PassRefPtrWillBeRawPtr<Range> range() const;
 
+    Node* startContainer() const;
+    int endOffset() const;
+    Position startPosition() const;
+
 private:
     void exitNode();
     bool handleTextNode();
     RenderText* handleFirstLetter(int& startOffset, int& offsetInNode);
     bool handleReplacedElement();
     bool handleNonTextNode();
     void emitCharacter(UChar, Node*, int startOffset, int endOffset);
     bool advanceRespectingRange(Node*);
 
     // Current position, not necessarily of the text being returned, but position
@@ skipping 58 matching lines @@
 
     int length() const { return m_textIterator.length() - m_runOffset; }
     UChar characterAt(unsigned index) const { return m_textIterator.characterAt(m_runOffset + index); }
 
     template<typename BufferType>
     void appendTextTo(BufferType& output) { m_textIterator.appendTextTo(output, m_runOffset); }
 
     int characterOffset() const { return m_offset; }
     PassRefPtrWillBeRawPtr<Range> range() const;
 
+    Node* startContainer() const;
+    int startOffset() const;
+    Position startPosition() const;
+    Position endPosition() const;
+
 private:
     void initialize();
 
     int m_offset;
     int m_runOffset;
     bool m_atBreak;
 
     TextIterator m_textIterator;
 };
 
 class BackwardsCharacterIterator {
     STACK_ALLOCATED();
 public:
     explicit BackwardsCharacterIterator(const Range*, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
 
     void advance(int);
 
     bool atEnd() const { return m_textIterator.atEnd(); }
 
     PassRefPtrWillBeRawPtr<Range> range() const;
 
+    Position endPosition() const;
+
 private:
     int m_offset;
     int m_runOffset;
     bool m_atBreak;
 
     SimplifiedBackwardsTextIterator m_textIterator;
 };
 
 // Very similar to the TextIterator, except that the chunks of text returned are "well behaved",
 // meaning they never end split up a word.  This is useful for spellcheck or (perhaps one day) searching.
 class WordAwareIterator {
     STACK_ALLOCATED();
 public:
     explicit WordAwareIterator(const Range*);
     ~WordAwareIterator();
 
     bool atEnd() const { return !m_didLookAhead && m_textIterator.atEnd(); }
     void advance();
 
     String substring(unsigned position, unsigned length) const;
     UChar characterAt(unsigned index) const;
     int length() const;
 
 private:
     Vector<UChar> m_buffer;
     // Did we have to look ahead in the textIterator to confirm the current chunk?
     bool m_didLookAhead;
-    RefPtrWillBeMember<Range> m_range;
     TextIterator m_textIterator;
 };
 
 }
 
 #endif