#include "config.h"
#include "TextIterator.h"
#include "Document.h"
#include "Element.h"
#include "HTMLNames.h"
#include "htmlediting.h"
#include "InlineTextBox.h"
#include "Position.h"
#include "Range.h"
#include "RenderTableCell.h"
#include "RenderTableRow.h"
using namespace std;
namespace WebCore {
using namespace HTMLNames;
const UChar nonBreakingSpace = 0xA0;
class CircularSearchBuffer {
public:
CircularSearchBuffer(const String& target, bool isCaseSensitive);
~CircularSearchBuffer() { fastFree(m_buffer); }
void clear() { m_cursor = m_buffer; m_bufferFull = false; }
void append(int length, const UChar* characters);
void append(UChar);
int neededCharacters() const;
bool isMatch() const;
int length() const { return m_target.length(); }
private:
String m_target;
bool m_isCaseSensitive;
UChar* m_buffer;
UChar* m_cursor;
bool m_bufferFull;
CircularSearchBuffer(const CircularSearchBuffer&);
CircularSearchBuffer &operator=(const CircularSearchBuffer&);
};
TextIterator::TextIterator() : m_endContainer(0), m_endOffset(0), m_positionNode(0), m_lastCharacter(0)
{
}
TextIterator::TextIterator(const Range *r, IteratorKind kind) : m_endContainer(0), m_endOffset(0), m_positionNode(0)
{
if (!r)
return;
ExceptionCode ec = 0;
Node *startContainer = r->startContainer(ec);
int startOffset = r->startOffset(ec);
Node *endContainer = r->endContainer(ec);
int endOffset = r->endOffset(ec);
if (ec != 0)
return;
m_endContainer = endContainer;
m_endOffset = endOffset;
m_node = r->startNode();
if (m_node == 0)
return;
m_offset = m_node == startContainer ? startOffset : 0;
m_handledNode = false;
m_handledChildren = false;
m_pastEndNode = r->pastEndNode();
m_needAnotherNewline = false;
m_textBox = 0;
m_lastTextNode = 0;
m_lastTextNodeEndedWithCollapsedSpace = false;
if (kind == RUNFINDER)
m_lastCharacter = 0;
else
m_lastCharacter = '\n';
#ifndef NDEBUG
m_positionNode = m_node;
#endif
advance();
}
void TextIterator::advance()
{
m_positionNode = 0;
m_textLength = 0;
if (m_needAnotherNewline) {
emitCharacter('\n', m_node->parentNode(), m_node, 1, 1);
m_needAnotherNewline = false;
return;
}
if (m_textBox) {
handleTextBox();
if (m_positionNode)
return;
}
while (m_node && m_node != m_pastEndNode && !(m_node == m_endContainer && m_endOffset == 0)) {
if (!m_handledNode) {
RenderObject *renderer = m_node->renderer();
if (renderer && renderer->isText() && m_node->nodeType() == Node::TEXT_NODE) {
if (renderer->style()->visibility() == VISIBLE)
m_handledNode = handleTextNode();
} else if (renderer && (renderer->isImage() || renderer->isWidget())) {
if (renderer->style()->visibility() == VISIBLE)
m_handledNode = handleReplacedElement();
} else
m_handledNode = handleNonTextNode();
if (m_positionNode)
return;
}
Node *next = m_handledChildren ? 0 : m_node->firstChild();
m_offset = 0;
if (!next) {
next = m_node->nextSibling();
if (!next) {
if (m_node->traverseNextNode() == m_pastEndNode)
break;
while (!next && m_node->parentNode()) {
m_node = m_node->parentNode();
exitNode();
if (m_positionNode) {
m_handledNode = true;
m_handledChildren = true;
return;
}
next = m_node->nextSibling();
}
}
}
m_node = next;
m_handledNode = false;
m_handledChildren = false;
if (m_positionNode)
return;
}
}
static inline bool compareBoxStart(const InlineTextBox *first, const InlineTextBox *second)
{
return first->start() < second->start();
}
bool TextIterator::handleTextNode()
{
m_lastTextNode = m_node;
RenderText *renderer = static_cast<RenderText *>(m_node->renderer());
String str = renderer->string();
if (!renderer->style()->collapseWhiteSpace()) {
int runStart = m_offset;
if (m_lastTextNodeEndedWithCollapsedSpace) {
emitCharacter(' ', m_node, 0, runStart, runStart);
return false;
}
int strLength = str.length();
int end = (m_node == m_endContainer) ? m_endOffset : LONG_MAX;
int runEnd = min(strLength, end);
if (runStart >= runEnd)
return true;
m_positionNode = m_node;
m_positionOffsetBaseNode = 0;
m_positionStartOffset = runStart;
m_positionEndOffset = runEnd;
m_textCharacters = str.characters() + runStart;
m_textLength = runEnd - runStart;
m_lastCharacter = str[runEnd - 1];
return true;
}
if (!renderer->firstTextBox() && str.length() > 0) {
m_lastTextNodeEndedWithCollapsedSpace = true; return true;
}
if (renderer->containsReversedText()) {
m_sortedTextBoxes.clear();
for (InlineTextBox * textBox = renderer->firstTextBox(); textBox; textBox = textBox->nextTextBox()) {
m_sortedTextBoxes.append(textBox);
}
std::sort(m_sortedTextBoxes.begin(), m_sortedTextBoxes.end(), compareBoxStart);
m_sortedTextBoxesPosition = 0;
}
m_textBox = renderer->containsReversedText() ? m_sortedTextBoxes[0] : renderer->firstTextBox();
handleTextBox();
return true;
}
void TextIterator::handleTextBox()
{
RenderText *renderer = static_cast<RenderText *>(m_node->renderer());
String str = renderer->string();
int start = m_offset;
int end = (m_node == m_endContainer) ? m_endOffset : LONG_MAX;
while (m_textBox) {
int textBoxStart = m_textBox->m_start;
int runStart = max(textBoxStart, start);
InlineTextBox *firstTextBox = renderer->containsReversedText() ? m_sortedTextBoxes[0] : renderer->firstTextBox();
bool needSpace = m_lastTextNodeEndedWithCollapsedSpace
|| (m_textBox == firstTextBox && textBoxStart == runStart && runStart > 0);
if (needSpace && !isCollapsibleWhitespace(m_lastCharacter) && m_lastCharacter) {
emitCharacter(' ', m_node, 0, runStart, runStart);
return;
}
int textBoxEnd = textBoxStart + m_textBox->m_len;
int runEnd = min(textBoxEnd, end);
InlineTextBox *nextTextBox = 0;
if (renderer->containsReversedText()) {
if (m_sortedTextBoxesPosition + 1 < m_sortedTextBoxes.size())
nextTextBox = m_sortedTextBoxes[m_sortedTextBoxesPosition + 1];
} else
nextTextBox = m_textBox->nextTextBox();
if (runStart < runEnd) {
if (str[runStart] == '\n') {
emitCharacter(' ', m_node, 0, runStart, runStart + 1);
m_offset = runStart + 1;
} else {
int subrunEnd = str.find('\n', runStart);
if (subrunEnd == -1 || subrunEnd > runEnd)
subrunEnd = runEnd;
m_offset = subrunEnd;
m_positionNode = m_node;
m_positionOffsetBaseNode = 0;
m_positionStartOffset = runStart;
m_positionEndOffset = subrunEnd;
m_textCharacters = str.characters() + runStart;
m_textLength = subrunEnd - runStart;
m_lastTextNodeEndedWithCollapsedSpace = false;
m_lastCharacter = str[subrunEnd - 1];
}
if (m_positionEndOffset < textBoxEnd)
return;
int nextRunStart = nextTextBox ? nextTextBox->m_start : str.length();
if (nextRunStart > runEnd)
m_lastTextNodeEndedWithCollapsedSpace = true; m_textBox = nextTextBox;
if (renderer->containsReversedText())
++m_sortedTextBoxesPosition;
return;
}
m_textBox = nextTextBox;
if (renderer->containsReversedText())
++m_sortedTextBoxesPosition;
}
}
bool TextIterator::handleReplacedElement()
{
if (m_lastTextNodeEndedWithCollapsedSpace) {
emitCharacter(' ', m_lastTextNode->parentNode(), m_lastTextNode, 1, 1);
return false;
}
m_positionNode = m_node->parentNode();
m_positionOffsetBaseNode = m_node;
m_positionStartOffset = 0;
m_positionEndOffset = 1;
m_textCharacters = 0;
m_textLength = 0;
m_lastCharacter = 0;
return true;
}
static bool isTableCell(Node* node)
{
RenderObject* r = node->renderer();
if (!r)
return node->hasTagName(tdTag) || node->hasTagName(thTag);
return r->isTableCell();
}
static bool shouldEmitTabBeforeNode(Node* node)
{
RenderObject* r = node->renderer();
if (!r || !isTableCell(node))
return false;
RenderTableCell* rc = static_cast<RenderTableCell*>(r);
RenderTable* t = rc->table();
return t && (t->cellBefore(rc) || t->cellAbove(rc));
}
static bool shouldEmitSpaceBeforeAndAfterNode(Node* node)
{
RenderObject* r = node->renderer();
return r && r->isTable() && r->isInline();
}
static bool shouldEmitNewlineForNode(Node* node)
{
RenderObject* r = node->renderer();
if (!r)
return node->hasTagName(brTag);
return r->isBR();
}
static bool shouldEmitNewlinesBeforeAndAfterNode(Node* node)
{
RenderObject* r = node->renderer();
if (!r) {
return (node->hasTagName(blockquoteTag)
|| node->hasTagName(ddTag)
|| node->hasTagName(divTag)
|| node->hasTagName(dlTag)
|| node->hasTagName(dtTag)
|| node->hasTagName(h1Tag)
|| node->hasTagName(h2Tag)
|| node->hasTagName(h3Tag)
|| node->hasTagName(h4Tag)
|| node->hasTagName(h5Tag)
|| node->hasTagName(h6Tag)
|| node->hasTagName(hrTag)
|| node->hasTagName(liTag)
|| node->hasTagName(listingTag)
|| node->hasTagName(olTag)
|| node->hasTagName(pTag)
|| node->hasTagName(preTag)
|| node->hasTagName(trTag)
|| node->hasTagName(ulTag));
}
if (isTableCell(node))
return false;
if (r->isTableRow()) {
RenderTable* t = static_cast<RenderTableRow*>(r)->table();
if (t && !t->isInline())
return true;
}
return !r->isInline() && r->isRenderBlock() && !r->isBody();
}
static bool shouldEmitExtraNewlineForNode(Node* node)
{
RenderObject* r = node->renderer();
if (!r)
return false;
if (node->hasTagName(h1Tag)
|| node->hasTagName(h2Tag)
|| node->hasTagName(h3Tag)
|| node->hasTagName(h4Tag)
|| node->hasTagName(h5Tag)
|| node->hasTagName(h6Tag)
|| node->hasTagName(pTag)) {
RenderStyle* style = r->style();
if (style) {
int bottomMargin = r->collapsedMarginBottom();
int fontSize = style->fontDescription().computedPixelSize();
if (bottomMargin * 2 >= fontSize)
return true;
}
}
return false;
}
bool TextIterator::handleNonTextNode()
{
if (shouldEmitNewlineForNode(m_node)) {
emitCharacter('\n', m_node->parentNode(), m_node, 0, 1);
} else if (m_lastCharacter != '\n' && m_lastTextNode) {
if (shouldEmitTabBeforeNode(m_node))
emitCharacter('\t', m_lastTextNode->parentNode(), m_lastTextNode, 0, 1);
else if (shouldEmitNewlinesBeforeAndAfterNode(m_node))
emitCharacter('\n', m_lastTextNode->parentNode(), m_lastTextNode, 0, 1);
else if (shouldEmitSpaceBeforeAndAfterNode(m_node))
emitCharacter(' ', m_lastTextNode->parentNode(), m_lastTextNode, 0, 1);
}
return true;
}
void TextIterator::exitNode()
{
if (m_lastTextNode && shouldEmitNewlinesBeforeAndAfterNode(m_node)) {
bool addNewline = shouldEmitExtraNewlineForNode(m_node);
if (m_lastCharacter != '\n') {
emitCharacter('\n', m_node->parentNode(), m_node, 1, 1);
assert(!m_needAnotherNewline);
m_needAnotherNewline = addNewline;
} else if (addNewline) {
emitCharacter('\n', m_node->parentNode(), m_node, 1, 1);
}
} else if (shouldEmitSpaceBeforeAndAfterNode(m_node))
emitCharacter(' ', m_node->parentNode(), m_node, 1, 1);
}
void TextIterator::emitCharacter(UChar c, Node *textNode, Node *offsetBaseNode, int textStartOffset, int textEndOffset)
{
m_positionNode = textNode;
m_positionOffsetBaseNode = offsetBaseNode;
m_positionStartOffset = textStartOffset;
m_positionEndOffset = textEndOffset;
m_singleCharacterBuffer = c;
m_textCharacters = &m_singleCharacterBuffer;
m_textLength = 1;
m_lastTextNodeEndedWithCollapsedSpace = false;
m_lastCharacter = c;
}
PassRefPtr<Range> TextIterator::range() const
{
if (m_positionNode) {
if (m_positionOffsetBaseNode) {
int index = m_positionOffsetBaseNode->nodeIndex();
m_positionStartOffset += index;
m_positionEndOffset += index;
m_positionOffsetBaseNode = 0;
}
return new Range(m_positionNode->document(), m_positionNode, m_positionStartOffset, m_positionNode, m_positionEndOffset);
}
if (m_endContainer)
return new Range(m_endContainer->document(), m_endContainer, m_endOffset, m_endContainer, m_endOffset);
return 0;
}
SimplifiedBackwardsTextIterator::SimplifiedBackwardsTextIterator() : m_positionNode(0)
{
}
SimplifiedBackwardsTextIterator::SimplifiedBackwardsTextIterator(const Range *r)
{
m_positionNode = 0;
if (!r)
return;
int exception = 0;
Node *startNode = r->startContainer(exception);
if (exception)
return;
Node *endNode = r->endContainer(exception);
if (exception)
return;
int startOffset = r->startOffset(exception);
if (exception)
return;
int endOffset = r->endOffset(exception);
if (exception)
return;
if (!startNode->offsetInCharacters()) {
if (startOffset >= 0 && startOffset < static_cast<int>(startNode->childNodeCount())) {
startNode = startNode->childNode(startOffset);
startOffset = 0;
}
}
if (!endNode->offsetInCharacters()) {
if (endOffset > 0 && endOffset <= static_cast<int>(endNode->childNodeCount())) {
endNode = endNode->childNode(endOffset - 1);
endOffset = endNode->hasChildNodes() ? endNode->childNodeCount() : endNode->maxOffset();
}
}
m_node = endNode;
m_offset = endOffset;
m_handledNode = false;
m_handledChildren = endOffset == 0;
m_startNode = startNode;
m_startOffset = startOffset;
#ifndef NDEBUG
m_positionNode = endNode;
#endif
m_lastTextNode = 0;
m_lastCharacter = '\n';
advance();
}
void SimplifiedBackwardsTextIterator::advance()
{
assert(m_positionNode);
m_positionNode = 0;
m_textLength = 0;
while (m_node) {
if (!m_handledNode) {
RenderObject *renderer = m_node->renderer();
if (renderer && renderer->isText() && m_node->nodeType() == Node::TEXT_NODE) {
if (renderer->style()->visibility() == VISIBLE && m_offset > 0)
m_handledNode = handleTextNode();
} else if (renderer && (renderer->isImage() || renderer->isWidget())) {
if (renderer->style()->visibility() == VISIBLE && m_offset > 0)
m_handledNode = handleReplacedElement();
} else
m_handledNode = handleNonTextNode();
if (m_positionNode)
return;
}
if (m_node == m_startNode)
return;
Node *next = 0;
if (!m_handledChildren) {
next = m_node->lastChild();
while (next && next->lastChild())
next = next->lastChild();
m_handledChildren = true;
}
if (!next && m_node != m_startNode) {
next = m_node->previousSibling();
if (next) {
exitNode();
while (next->lastChild())
next = next->lastChild();
}
else if (m_node->parentNode()) {
next = m_node->parentNode();
exitNode();
}
}
if (next && m_node->renderer() && m_node->renderer()->style()->visibility() == VISIBLE) {
Node *block = m_node->enclosingBlockFlowElement();
if (block) {
Node *nextBlock = next->enclosingBlockFlowElement();
if (nextBlock && nextBlock->isAncestor(block))
emitNewline();
}
}
m_node = next;
if (m_node)
m_offset = m_node->caretMaxOffset();
else
m_offset = 0;
m_handledNode = false;
if (m_positionNode)
return;
}
}
bool SimplifiedBackwardsTextIterator::handleTextNode()
{
m_lastTextNode = m_node;
RenderText *renderer = static_cast<RenderText *>(m_node->renderer());
String str = m_node->nodeValue();
if (!renderer->firstTextBox() && str.length() > 0)
return true;
m_positionEndOffset = m_offset;
m_offset = (m_node == m_startNode) ? m_startOffset : 0;
m_positionNode = m_node;
m_positionStartOffset = m_offset;
m_textLength = m_positionEndOffset - m_positionStartOffset;
m_textCharacters = str.characters() + m_positionStartOffset;
m_lastCharacter = str[m_positionEndOffset - 1];
return true;
}
bool SimplifiedBackwardsTextIterator::handleReplacedElement()
{
int offset = m_node->nodeIndex();
m_positionNode = m_node->parentNode();
m_positionStartOffset = offset;
m_positionEndOffset = offset + 1;
m_textCharacters = 0;
m_textLength = 0;
m_lastCharacter = 0;
return true;
}
bool SimplifiedBackwardsTextIterator::handleNonTextNode()
{
if (shouldEmitNewlineForNode(m_node) ||
shouldEmitNewlinesBeforeAndAfterNode(m_node) ||
shouldEmitTabBeforeNode(m_node))
emitNewline();
return true;
}
void SimplifiedBackwardsTextIterator::exitNode()
{
handleNonTextNode();
}
void SimplifiedBackwardsTextIterator::emitCharacter(UChar c, Node *node, int startOffset, int endOffset)
{
m_singleCharacterBuffer = c;
m_positionNode = node;
m_positionStartOffset = startOffset;
m_positionEndOffset = endOffset;
m_textCharacters = &m_singleCharacterBuffer;
m_textLength = 1;
m_lastCharacter = c;
}
void SimplifiedBackwardsTextIterator::emitNewline()
{
int offset;
if (m_lastTextNode) {
offset = m_lastTextNode->nodeIndex();
emitCharacter('\n', m_lastTextNode->parentNode(), offset, offset + 1);
} else {
offset = m_node->nodeIndex();
emitCharacter('\n', m_node->parentNode(), offset, offset + 1);
}
}
PassRefPtr<Range> SimplifiedBackwardsTextIterator::range() const
{
if (m_positionNode)
return new Range(m_positionNode->document(), m_positionNode, m_positionStartOffset, m_positionNode, m_positionEndOffset);
return new Range(m_startNode->document(), m_startNode, m_startOffset, m_startNode, m_startOffset);
}
CharacterIterator::CharacterIterator()
: m_offset(0), m_runOffset(0), m_atBreak(true)
{
}
CharacterIterator::CharacterIterator(const Range *r)
: m_offset(0), m_runOffset(0), m_atBreak(true), m_textIterator(r, RUNFINDER)
{
while (!atEnd() && m_textIterator.length() == 0) {
m_textIterator.advance();
}
}
PassRefPtr<Range> CharacterIterator::range() const
{
RefPtr<Range> r = m_textIterator.range();
if (!m_textIterator.atEnd()) {
if (m_textIterator.length() <= 1) {
assert(m_runOffset == 0);
} else {
int exception = 0;
Node *n = r->startContainer(exception);
assert(n == r->endContainer(exception));
int offset = r->startOffset(exception) + m_runOffset;
r->setStart(n, offset, exception);
r->setEnd(n, offset + 1, exception);
}
}
return r.release();
}
void CharacterIterator::advance(int count)
{
m_atBreak = false;
int remaining = m_textIterator.length() - m_runOffset;
if (count < remaining) {
m_runOffset += count;
m_offset += count;
return;
}
count -= remaining;
m_offset += remaining;
for (m_textIterator.advance(); !atEnd(); m_textIterator.advance()) {
int runLength = m_textIterator.length();
if (runLength == 0)
m_atBreak = true;
else {
if (count < runLength) {
m_runOffset = count;
m_offset += count;
return;
}
count -= runLength;
m_offset += runLength;
}
}
m_atBreak = true;
m_runOffset = 0;
}
DeprecatedString CharacterIterator::string(int numChars)
{
DeprecatedString result;
result.reserve(numChars);
while (numChars > 0 && !atEnd()) {
int runSize = min(numChars, length());
result.append(reinterpret_cast<const DeprecatedChar*>(characters()), runSize);
numChars -= runSize;
advance(runSize);
}
return result;
}
WordAwareIterator::WordAwareIterator()
: m_previousText(0), m_didLookAhead(false)
{
}
WordAwareIterator::WordAwareIterator(const Range *r)
: m_previousText(0), m_didLookAhead(false), m_textIterator(r)
{
m_didLookAhead = true; advance(); }
void WordAwareIterator::advance()
{
m_previousText = 0;
m_buffer = "";
if (!m_didLookAhead) {
assert(!m_textIterator.atEnd());
m_textIterator.advance();
}
m_didLookAhead = false;
while (!m_textIterator.atEnd() && m_textIterator.length() == 0) {
m_textIterator.advance();
}
m_range = m_textIterator.range();
if (m_textIterator.atEnd())
return;
while (1) {
if (DeprecatedChar(m_textIterator.characters()[m_textIterator.length() - 1]).isSpace())
return;
if (m_buffer.isEmpty()) {
m_previousText = m_textIterator.characters();
m_previousLength = m_textIterator.length();
}
m_textIterator.advance();
if (m_textIterator.atEnd() || m_textIterator.length() == 0 || DeprecatedChar(m_textIterator.characters()[0]).isSpace()) {
m_didLookAhead = true;
return;
}
if (m_buffer.isEmpty()) {
m_buffer.append(reinterpret_cast<const DeprecatedChar*>(m_previousText), m_previousLength);
m_previousText = 0;
}
m_buffer.append(reinterpret_cast<const DeprecatedChar*>(m_textIterator.characters()), m_textIterator.length());
int exception = 0;
m_range->setEnd(m_textIterator.range()->endContainer(exception), m_textIterator.range()->endOffset(exception), exception);
}
}
int WordAwareIterator::length() const
{
if (!m_buffer.isEmpty())
return m_buffer.length();
if (m_previousText)
return m_previousLength;
return m_textIterator.length();
}
const UChar* WordAwareIterator::characters() const
{
if (!m_buffer.isEmpty())
return reinterpret_cast<const UChar*>(m_buffer.unicode());
if (m_previousText)
return m_previousText;
return m_textIterator.characters();
}
CircularSearchBuffer::CircularSearchBuffer(const String& s, bool isCaseSensitive)
: m_target(s)
{
assert(!s.isEmpty());
if (!isCaseSensitive)
m_target = s.foldCase();
m_target.replace(nonBreakingSpace, ' ');
m_isCaseSensitive = isCaseSensitive;
m_buffer = static_cast<UChar*>(fastMalloc(s.length() * sizeof(UChar)));
m_cursor = m_buffer;
m_bufferFull = false;
}
void CircularSearchBuffer::append(UChar c)
{
if (m_isCaseSensitive)
*m_cursor++ = c == nonBreakingSpace ? ' ' : c;
else
*m_cursor++ = c == nonBreakingSpace ? ' ' : u_foldCase(c, U_FOLD_CASE_DEFAULT);
if (m_cursor == m_buffer + length()) {
m_cursor = m_buffer;
m_bufferFull = true;
}
}
void CircularSearchBuffer::append(int count, const UChar* characters)
{
int tailSpace = m_buffer + length() - m_cursor;
assert(!m_bufferFull);
assert(count <= tailSpace);
if (m_isCaseSensitive) {
for (int i = 0; i != count; ++i) {
UChar c = characters[i];
m_cursor[i] = c == nonBreakingSpace ? ' ' : c;
}
} else {
for (int i = 0; i != count; ++i) {
UChar c = characters[i];
m_cursor[i] = c == nonBreakingSpace ? ' ' : u_foldCase(c, U_FOLD_CASE_DEFAULT);
}
}
if (count < tailSpace)
m_cursor += count;
else {
m_bufferFull = true;
m_cursor = m_buffer;
}
}
int CircularSearchBuffer::neededCharacters() const
{
return m_bufferFull ? 0 : m_buffer + length() - m_cursor;
}
bool CircularSearchBuffer::isMatch() const
{
assert(m_bufferFull);
int headSpace = m_cursor - m_buffer;
int tailSpace = length() - headSpace;
return memcmp(m_cursor, m_target.characters(), tailSpace * sizeof(UChar)) == 0
&& memcmp(m_buffer, m_target.characters() + tailSpace, headSpace * sizeof(UChar)) == 0;
}
int TextIterator::rangeLength(const Range *r)
{
int length = 0;
for (TextIterator it(r); !it.atEnd(); it.advance()) {
length += it.length();
}
return length;
}
PassRefPtr<Range> TextIterator::rangeFromLocationAndLength(Document *doc, int rangeLocation, int rangeLength)
{
RefPtr<Range> resultRange = doc->createRange();
int docTextPosition = 0;
int rangeEnd = rangeLocation + rangeLength;
bool startRangeFound = false;
RefPtr<Range> textRunRange;
TextIterator it(rangeOfContents(doc).get());
if (rangeLocation == 0 && rangeLength == 0 && it.atEnd()) {
int exception = 0;
textRunRange = it.range();
resultRange->setStart(textRunRange->startContainer(exception), 0, exception);
assert(exception == 0);
resultRange->setEnd(textRunRange->startContainer(exception), 0, exception);
assert(exception == 0);
return resultRange.release();
}
for (; !it.atEnd(); it.advance()) {
int len = it.length();
textRunRange = it.range();
if (rangeLocation >= docTextPosition && rangeLocation <= docTextPosition + len) {
startRangeFound = true;
int exception = 0;
if (textRunRange->startContainer(exception)->isTextNode()) {
int offset = rangeLocation - docTextPosition;
resultRange->setStart(textRunRange->startContainer(exception), offset + textRunRange->startOffset(exception), exception);
} else {
if (rangeLocation == docTextPosition)
resultRange->setStart(textRunRange->startContainer(exception), textRunRange->startOffset(exception), exception);
else
resultRange->setStart(textRunRange->endContainer(exception), textRunRange->endOffset(exception), exception);
}
}
if (rangeEnd >= docTextPosition && rangeEnd <= docTextPosition + len) {
int exception = 0;
if (textRunRange->startContainer(exception)->isTextNode()) {
int offset = rangeEnd - docTextPosition;
resultRange->setEnd(textRunRange->startContainer(exception), offset + textRunRange->startOffset(exception), exception);
} else {
if (rangeEnd == docTextPosition)
resultRange->setEnd(textRunRange->startContainer(exception), textRunRange->startOffset(exception), exception);
else
resultRange->setEnd(textRunRange->endContainer(exception), textRunRange->endOffset(exception), exception);
}
if (!(rangeLength == 0 && rangeEnd == docTextPosition + len)) {
docTextPosition += len;
break;
}
}
docTextPosition += len;
}
if (!startRangeFound)
return 0;
if (rangeLength != 0 && rangeEnd > docTextPosition) { int exception = 0;
resultRange->setEnd(textRunRange->endContainer(exception), textRunRange->endOffset(exception), exception);
}
return resultRange.release();
}
DeprecatedString plainText(const Range* r)
{
DeprecatedString result("");
for (TextIterator it(r); !it.atEnd(); it.advance())
result.append(reinterpret_cast<const DeprecatedChar*>(it.characters()), it.length());
return result;
}
PassRefPtr<Range> findPlainText(const Range *r, const String& s, bool forward, bool caseSensitive)
{
if (s.isEmpty() || s.find('\n') != -1) {
int exception = 0;
RefPtr<Range> result = r->cloneRange(exception);
result->collapse(forward, exception);
return result.release();
}
CircularSearchBuffer buffer(s, caseSensitive);
bool found = false;
CharacterIterator rangeEnd;
{
CharacterIterator it(r);
while (1) {
while (int needed = buffer.neededCharacters()) {
if (it.atBreak()) {
if (it.atEnd())
goto done;
buffer.clear();
}
int available = it.length();
int runLength = min(needed, available);
buffer.append(runLength, it.characters());
it.advance(runLength);
}
while (1) {
if (buffer.isMatch()) {
found = true;
rangeEnd = it;
if (forward)
goto done;
}
if (it.atBreak())
break;
buffer.append(it.characters()[0]);
it.advance(1);
}
buffer.clear();
}
}
done:
int exception = 0;
RefPtr<Range> result = r->cloneRange(exception);
if (!found)
result->collapse(!forward, exception);
else {
CharacterIterator it(r);
it.advance(rangeEnd.characterOffset() - buffer.length());
result->setStart(it.range()->startContainer(exception), it.range()->startOffset(exception), exception);
it.advance(buffer.length() - 1);
result->setEnd(it.range()->endContainer(exception), it.range()->endOffset(exception), exception);
}
return result.release();
}
}