mirror of
https://github.com/flutter/flutter.git
synced 2026-02-20 02:29:02 +08:00
I used do-webcore-rename from Blink/WebKit which is very good at doing this kind of search-replace. Also removed toRefPrtNativeArray after conversion since it previously had two separate flavors. Both versions are no longer used so I've removed the code until we need one again. https://www.irccloud.com/pastebin/5C16p5cE is the diff I used to do-webcore-rename TBR=abarth@chromium.org
354 lines
12 KiB
C++
354 lines
12 KiB
C++
/*
|
|
* 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
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
|
|
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
|
|
* 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.
|
|
*/
|
|
|
|
#ifndef TextIterator_h
|
|
#define TextIterator_h
|
|
|
|
#include "core/dom/Range.h"
|
|
#include "core/editing/FindOptions.h"
|
|
#include "platform/heap/Handle.h"
|
|
#include "wtf/Vector.h"
|
|
|
|
namespace blink {
|
|
|
|
class InlineTextBox;
|
|
class RenderText;
|
|
|
|
enum TextIteratorBehavior {
|
|
TextIteratorDefaultBehavior = 0,
|
|
TextIteratorEmitsCharactersBetweenAllVisiblePositions = 1 << 0,
|
|
TextIteratorIgnoresStyleVisibility = 1 << 2,
|
|
TextIteratorEmitsOriginalText = 1 << 3,
|
|
TextIteratorEmitsImageAltText = 1 << 5,
|
|
TextIteratorEntersAuthorShadowRoots = 1 << 6,
|
|
TextIteratorEmitsObjectReplacementCharacter = 1 << 7
|
|
};
|
|
typedef unsigned TextIteratorBehaviorFlags;
|
|
|
|
String plainText(const Range*, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
PassRefPtr<Range> findPlainText(const Range*, const String&, FindOptions);
|
|
void findPlainText(const Position& inputStart, const Position& inputEnd, const String&, FindOptions, Position& resultStart, Position& resultEnd);
|
|
|
|
class BitStack {
|
|
public:
|
|
BitStack();
|
|
~BitStack();
|
|
|
|
void push(bool);
|
|
void pop();
|
|
|
|
bool top() const;
|
|
unsigned size() const;
|
|
|
|
private:
|
|
unsigned m_size;
|
|
Vector<unsigned, 1> m_words;
|
|
};
|
|
|
|
// Iterates through the DOM range, returning all the text, and 0-length boundaries
|
|
// at points where replaced elements break up the text flow. The text comes back in
|
|
// chunks so as to optimize for performance of the iteration.
|
|
|
|
class TextIterator {
|
|
STACK_ALLOCATED();
|
|
public:
|
|
explicit TextIterator(const Range*, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
// [start, end] indicates the document range that the iteration should take place within (both ends inclusive).
|
|
TextIterator(const Position& start, const Position& end, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
~TextIterator();
|
|
|
|
bool atEnd() const { return !m_positionNode; }
|
|
void advance();
|
|
bool isInsideReplacedElement() const;
|
|
|
|
int length() const { return m_textLength; }
|
|
UChar characterAt(unsigned index) const;
|
|
String substring(unsigned position, unsigned length) const;
|
|
void appendTextToStringBuilder(StringBuilder&, unsigned position = 0, unsigned maxLength = UINT_MAX) const;
|
|
|
|
template<typename BufferType>
|
|
void appendTextTo(BufferType& output, unsigned position = 0)
|
|
{
|
|
ASSERT_WITH_SECURITY_IMPLICATION(position <= static_cast<unsigned>(length()));
|
|
unsigned lengthToAppend = length() - position;
|
|
if (!lengthToAppend)
|
|
return;
|
|
if (m_singleCharacterBuffer) {
|
|
ASSERT(!position);
|
|
ASSERT(length() == 1);
|
|
output.append(&m_singleCharacterBuffer, 1);
|
|
} else {
|
|
string().appendTo(output, startOffset() + position, lengthToAppend);
|
|
}
|
|
}
|
|
|
|
PassRefPtr<Range> range() const;
|
|
Node* node() 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 PassRefPtr<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; }
|
|
const String& string() const { return m_text; }
|
|
void exitNode();
|
|
bool shouldRepresentNodeOffsetZero();
|
|
bool shouldEmitSpaceBeforeAndAfterNode(Node*);
|
|
void representNodeOffsetZero();
|
|
bool handleTextNode();
|
|
bool handleReplacedElement();
|
|
bool handleNonTextNode();
|
|
void handleTextBox();
|
|
bool hasVisibleTextNode(RenderText*);
|
|
void emitCharacter(UChar, Node* textNode, Node* offsetBaseNode, int textStartOffset, int textEndOffset);
|
|
void emitText(Node* textNode, RenderText* renderer, int textStartOffset, int textEndOffset);
|
|
|
|
// Current position, not necessarily of the text being returned, but position
|
|
// as we walk through the DOM tree.
|
|
RawPtr<Node> m_node;
|
|
int m_offset;
|
|
IterationProgress m_iterationProgress;
|
|
BitStack m_fullyClippedStack;
|
|
int m_shadowDepth;
|
|
|
|
// The range.
|
|
RawPtr<Node> m_startContainer;
|
|
int m_startOffset;
|
|
RawPtr<Node> m_endContainer;
|
|
int m_endOffset;
|
|
RawPtr<Node> m_pastEndNode;
|
|
|
|
// The current text and its position, in the form to be returned from the iterator.
|
|
RawPtr<Node> m_positionNode;
|
|
mutable RawPtr<Node> m_positionOffsetBaseNode;
|
|
mutable int m_positionStartOffset;
|
|
mutable int m_positionEndOffset;
|
|
int m_textLength;
|
|
String m_text;
|
|
|
|
// Used when there is still some pending text from the current node; when these
|
|
// are false and 0, we go back to normal iterating.
|
|
bool m_needsAnotherNewline;
|
|
InlineTextBox* m_textBox;
|
|
|
|
// Used to do the whitespace collapsing logic.
|
|
RawPtr<Text> m_lastTextNode;
|
|
bool m_lastTextNodeEndedWithCollapsedSpace;
|
|
UChar m_lastCharacter;
|
|
|
|
// Used for whitespace characters that aren't in the DOM, so we can point at them.
|
|
// If non-zero, overrides m_text.
|
|
UChar m_singleCharacterBuffer;
|
|
|
|
// Used when text boxes are out of order (Hebrew/Arabic w/ embeded LTR text)
|
|
Vector<InlineTextBox*> m_sortedTextBoxes;
|
|
size_t m_sortedTextBoxesPosition;
|
|
|
|
// Used when deciding whether to emit a "positioning" (e.g. newline) before any other content
|
|
bool m_hasEmitted;
|
|
|
|
// Used by selection preservation code. There should be one character emitted between every VisiblePosition
|
|
// in the Range used to create the TextIterator.
|
|
// FIXME <rdar://problem/6028818>: This functionality should eventually be phased out when we rewrite
|
|
// moveParagraphs to not clone/destroy moved content.
|
|
bool m_emitsCharactersBetweenAllVisiblePositions;
|
|
|
|
// Used in pasting inside password field.
|
|
bool m_emitsOriginalText;
|
|
|
|
// Used when the visibility of the style should not affect text gathering.
|
|
bool m_ignoresStyleVisibility;
|
|
|
|
bool m_emitsImageAltText;
|
|
|
|
bool m_entersAuthorShadowRoots;
|
|
|
|
bool m_emitsObjectReplacementCharacter;
|
|
};
|
|
|
|
// Iterates through the DOM range, returning all the text, and 0-length boundaries
|
|
// at points where replaced elements break up the text flow. The text comes back in
|
|
// chunks so as to optimize for performance of the iteration.
|
|
class SimplifiedBackwardsTextIterator {
|
|
STACK_ALLOCATED();
|
|
public:
|
|
explicit SimplifiedBackwardsTextIterator(const Range*, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
|
|
bool atEnd() const { return !m_positionNode; }
|
|
void advance();
|
|
|
|
int length() const { return m_textLength; }
|
|
|
|
Node* node() const { return m_node; }
|
|
|
|
template<typename BufferType>
|
|
void prependTextTo(BufferType& output)
|
|
{
|
|
if (!m_textLength)
|
|
return;
|
|
if (m_singleCharacterBuffer)
|
|
output.prepend(&m_singleCharacterBuffer, 1);
|
|
else
|
|
m_textContainer.prependTo(output, m_textOffset, m_textLength);
|
|
}
|
|
|
|
PassRefPtr<Range> range() const;
|
|
|
|
private:
|
|
void exitNode();
|
|
bool handleTextNode();
|
|
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
|
|
// as we walk through the DOM tree.
|
|
RawPtr<Node> m_node;
|
|
int m_offset;
|
|
bool m_handledNode;
|
|
bool m_handledChildren;
|
|
BitStack m_fullyClippedStack;
|
|
|
|
// End of the range.
|
|
RawPtr<Node> m_startNode;
|
|
int m_startOffset;
|
|
// Start of the range.
|
|
RawPtr<Node> m_endNode;
|
|
int m_endOffset;
|
|
|
|
// The current text and its position, in the form to be returned from the iterator.
|
|
RawPtr<Node> m_positionNode;
|
|
int m_positionStartOffset;
|
|
int m_positionEndOffset;
|
|
|
|
String m_textContainer; // We're interested in the range [m_textOffset, m_textOffset + m_textLength) of m_textContainer.
|
|
int m_textOffset;
|
|
int m_textLength;
|
|
|
|
// Used to do the whitespace logic.
|
|
RawPtr<Text> m_lastTextNode;
|
|
UChar m_lastCharacter;
|
|
|
|
// Used for whitespace characters that aren't in the DOM, so we can point at them.
|
|
UChar m_singleCharacterBuffer;
|
|
|
|
// Whether m_node has advanced beyond the iteration range (i.e. m_startNode).
|
|
bool m_havePassedStartNode;
|
|
};
|
|
|
|
// Builds on the text iterator, adding a character position so we can walk one
|
|
// character at a time, or faster, as needed. Useful for searching.
|
|
class CharacterIterator {
|
|
STACK_ALLOCATED();
|
|
public:
|
|
explicit CharacterIterator(const Range*, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
CharacterIterator(const Position& start, const Position& end, TextIteratorBehaviorFlags = TextIteratorDefaultBehavior);
|
|
|
|
void advance(int numCharacters);
|
|
|
|
bool atBreak() const { return m_atBreak; }
|
|
bool atEnd() const { return m_textIterator.atEnd(); }
|
|
|
|
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; }
|
|
PassRefPtr<Range> range() 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(); }
|
|
|
|
PassRefPtr<Range> range() 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;
|
|
RefPtr<Range> m_range;
|
|
TextIterator m_textIterator;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|