2009-11-18 14:09:32 +01:00
|
|
|
/****************************************************************************
|
|
|
|
|
**
|
2011-01-11 16:28:15 +01:00
|
|
|
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
|
2009-11-18 14:09:32 +01:00
|
|
|
** All rights reserved.
|
|
|
|
|
** Contact: Nokia Corporation (qt-info@nokia.com)
|
|
|
|
|
**
|
|
|
|
|
** This file is part of the QtDeclarative module of the Qt Toolkit.
|
|
|
|
|
**
|
|
|
|
|
** $QT_BEGIN_LICENSE:LGPL$
|
|
|
|
|
** No Commercial Usage
|
|
|
|
|
** This file contains pre-release code and may not be distributed.
|
|
|
|
|
** You may use this file in accordance with the terms and conditions
|
|
|
|
|
** contained in the Technology Preview License Agreement accompanying
|
|
|
|
|
** this package.
|
|
|
|
|
**
|
|
|
|
|
** GNU Lesser General Public License Usage
|
|
|
|
|
** Alternatively, this file may be used under the terms of the GNU Lesser
|
|
|
|
|
** General Public License version 2.1 as published by the Free Software
|
|
|
|
|
** Foundation and appearing in the file LICENSE.LGPL included in the
|
|
|
|
|
** packaging of this file. Please review the following information to
|
|
|
|
|
** ensure the GNU Lesser General Public License version 2.1 requirements
|
|
|
|
|
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
|
|
|
**
|
|
|
|
|
** In addition, as a special exception, Nokia gives you certain additional
|
|
|
|
|
** rights. These rights are described in the Nokia Qt LGPL Exception
|
|
|
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
|
|
|
**
|
|
|
|
|
** If you have questions regarding the use of this file, please contact
|
|
|
|
|
** Nokia at qt-info@nokia.com.
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
**
|
|
|
|
|
** $QT_END_LICENSE$
|
|
|
|
|
**
|
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
2009-11-24 11:29:43 +01:00
|
|
|
#include "changeset.h"
|
2009-11-18 14:09:32 +01:00
|
|
|
|
|
|
|
|
namespace Utils {
|
|
|
|
|
|
2009-11-24 11:29:43 +01:00
|
|
|
ChangeSet::ChangeSet()
|
2009-11-26 12:22:49 +01:00
|
|
|
: m_string(0), m_cursor(0), m_error(false)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static bool overlaps(int posA, int lengthA, int posB, int lengthB) {
|
2009-11-26 12:22:49 +01:00
|
|
|
if (lengthB > 0) {
|
|
|
|
|
return
|
|
|
|
|
// right edge of B contained in A
|
|
|
|
|
(posA < posB + lengthB && posA + lengthA >= posB + lengthB)
|
|
|
|
|
// left edge of B contained in A
|
|
|
|
|
|| (posA <= posB && posA + lengthA > posB)
|
|
|
|
|
// A contained in B
|
|
|
|
|
|| (posB < posA && posB + lengthB > posA + lengthA);
|
|
|
|
|
} else {
|
|
|
|
|
return (posB > posA && posB < posA + lengthA);
|
|
|
|
|
}
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
2009-11-24 11:29:43 +01:00
|
|
|
bool ChangeSet::hasOverlap(int pos, int length)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
QListIterator<EditOp> i(m_operationList);
|
|
|
|
|
while (i.hasNext()) {
|
|
|
|
|
const EditOp &cmd = i.next();
|
|
|
|
|
|
|
|
|
|
switch (cmd.type) {
|
|
|
|
|
case EditOp::Replace:
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos1, cmd.length1))
|
2009-11-18 14:09:32 +01:00
|
|
|
return true;
|
2009-11-26 12:22:49 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Move:
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos1, cmd.length1))
|
2009-11-26 12:22:49 +01:00
|
|
|
return true;
|
|
|
|
|
if (cmd.pos2 > pos && cmd.pos2 < pos + length)
|
2009-11-18 14:09:32 +01:00
|
|
|
return true;
|
2009-11-26 12:22:49 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Insert:
|
|
|
|
|
if (cmd.pos1 > pos && cmd.pos1 < pos + length)
|
|
|
|
|
return true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Remove:
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos1, cmd.length1))
|
2009-11-26 12:22:49 +01:00
|
|
|
return true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Flip:
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos1, cmd.length1))
|
2009-11-26 12:22:49 +01:00
|
|
|
return true;
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos2, cmd.length2))
|
2009-11-26 12:22:49 +01:00
|
|
|
return true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Copy:
|
2009-11-26 14:42:19 +01:00
|
|
|
if (overlaps(pos, length, cmd.pos1, cmd.length1))
|
2009-11-26 12:22:49 +01:00
|
|
|
return true;
|
|
|
|
|
if (cmd.pos2 > pos && cmd.pos2 < pos + length)
|
|
|
|
|
return true;
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Unset:
|
|
|
|
|
break;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-24 12:20:01 +01:00
|
|
|
bool ChangeSet::isEmpty() const
|
|
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
return m_operationList.isEmpty();
|
|
|
|
|
}
|
2009-11-24 12:20:01 +01:00
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
QList<ChangeSet::EditOp> ChangeSet::operationList() const
|
|
|
|
|
{
|
|
|
|
|
return m_operationList;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ChangeSet::clear()
|
|
|
|
|
{
|
|
|
|
|
m_string = 0;
|
|
|
|
|
m_cursor = 0;
|
|
|
|
|
m_operationList.clear();
|
|
|
|
|
m_error = false;
|
2009-11-24 12:20:01 +01:00
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
bool ChangeSet::replace_helper(int pos, int length, const QString &replacement)
|
2009-11-24 11:43:03 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (hasOverlap(pos, length))
|
|
|
|
|
m_error = true;
|
|
|
|
|
|
|
|
|
|
EditOp cmd(EditOp::Replace);
|
|
|
|
|
cmd.pos1 = pos;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length1 = length;
|
2009-11-26 12:22:49 +01:00
|
|
|
cmd.text = replacement;
|
|
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
2009-11-24 11:43:03 +01:00
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
bool ChangeSet::move_helper(int pos, int length, int to)
|
2009-11-24 11:43:03 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (hasOverlap(pos, length)
|
|
|
|
|
|| hasOverlap(to, 0)
|
|
|
|
|
|| overlaps(pos, length, to, 0))
|
|
|
|
|
m_error = true;
|
|
|
|
|
|
|
|
|
|
EditOp cmd(EditOp::Move);
|
|
|
|
|
cmd.pos1 = pos;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length1 = length;
|
2009-11-26 12:22:49 +01:00
|
|
|
cmd.pos2 = to;
|
|
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
2009-11-24 11:43:03 +01:00
|
|
|
}
|
|
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
bool ChangeSet::insert(int pos, const QString &text)
|
2009-11-24 12:20:01 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (hasOverlap(pos, 0))
|
|
|
|
|
m_error = true;
|
|
|
|
|
|
|
|
|
|
EditOp cmd(EditOp::Insert);
|
|
|
|
|
cmd.pos1 = pos;
|
|
|
|
|
cmd.text = text;
|
|
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
2009-11-24 12:20:01 +01:00
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:44:58 +02:00
|
|
|
bool ChangeSet::replace(const Range &range, const QString &replacement)
|
|
|
|
|
{ return replace(range.start, range.end, replacement); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::remove(const Range &range)
|
|
|
|
|
{ return remove(range.start, range.end); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::move(const Range &range, int to)
|
|
|
|
|
{ return move(range.start, range.end, to); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::flip(const Range &range1, const Range &range2)
|
|
|
|
|
{ return flip(range1.start, range1.end, range2.start, range2.end); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::copy(const Range &range, int to)
|
|
|
|
|
{ return copy(range.start, range.end, to); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::replace(int start, int end, const QString &replacement)
|
|
|
|
|
{ return replace_helper(start, end - start, replacement); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::remove(int start, int end)
|
|
|
|
|
{ return remove_helper(start, end - start); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::move(int start, int end, int to)
|
|
|
|
|
{ return move_helper(start, end - start, to); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::flip(int start1, int end1, int start2, int end2)
|
|
|
|
|
{ return flip_helper(start1, end1 - start1, start2, end2 - start2); }
|
|
|
|
|
|
|
|
|
|
bool ChangeSet::copy(int start, int end, int to)
|
|
|
|
|
{ return copy_helper(start, end - start, to); }
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
bool ChangeSet::remove_helper(int pos, int length)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (hasOverlap(pos, length))
|
|
|
|
|
m_error = true;
|
2009-11-18 14:09:32 +01:00
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
EditOp cmd(EditOp::Remove);
|
|
|
|
|
cmd.pos1 = pos;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length1 = length;
|
2009-11-26 12:22:49 +01:00
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
bool ChangeSet::flip_helper(int pos1, int length1, int pos2, int length2)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 14:42:19 +01:00
|
|
|
if (hasOverlap(pos1, length1)
|
|
|
|
|
|| hasOverlap(pos2, length2)
|
|
|
|
|
|| overlaps(pos1, length1, pos2, length2))
|
2009-11-26 12:22:49 +01:00
|
|
|
m_error = true;
|
2009-11-18 14:09:32 +01:00
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
EditOp cmd(EditOp::Flip);
|
|
|
|
|
cmd.pos1 = pos1;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length1 = length1;
|
2009-11-26 12:22:49 +01:00
|
|
|
cmd.pos2 = pos2;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length2 = length2;
|
2009-11-26 12:22:49 +01:00
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
bool ChangeSet::copy_helper(int pos, int length, int to)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (hasOverlap(pos, length)
|
|
|
|
|
|| hasOverlap(to, 0)
|
|
|
|
|
|| overlaps(pos, length, to, 0))
|
|
|
|
|
m_error = true;
|
|
|
|
|
|
|
|
|
|
EditOp cmd(EditOp::Copy);
|
|
|
|
|
cmd.pos1 = pos;
|
2009-11-26 14:42:19 +01:00
|
|
|
cmd.length1 = length;
|
2009-11-26 12:22:49 +01:00
|
|
|
cmd.pos2 = to;
|
|
|
|
|
m_operationList += cmd;
|
|
|
|
|
|
|
|
|
|
return !m_error;
|
|
|
|
|
}
|
|
|
|
|
|
2010-06-22 10:14:06 +02:00
|
|
|
void ChangeSet::doReplace(const EditOp &replace_helper, QList<EditOp> *replaceList)
|
2009-11-26 12:22:49 +01:00
|
|
|
{
|
2010-06-22 10:14:06 +02:00
|
|
|
Q_ASSERT(replace_helper.type == EditOp::Replace);
|
2009-11-26 12:22:49 +01:00
|
|
|
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
QMutableListIterator<EditOp> i(*replaceList);
|
2009-11-18 14:09:32 +01:00
|
|
|
while (i.hasNext()) {
|
2009-11-26 12:22:49 +01:00
|
|
|
EditOp &c = i.next();
|
2010-06-22 10:14:06 +02:00
|
|
|
if (replace_helper.pos1 <= c.pos1)
|
|
|
|
|
c.pos1 += replace_helper.text.size();
|
|
|
|
|
if (replace_helper.pos1 < c.pos1)
|
|
|
|
|
c.pos1 -= replace_helper.length1;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-24 12:20:01 +01:00
|
|
|
if (m_string) {
|
2010-06-22 10:14:06 +02:00
|
|
|
m_string->replace(replace_helper.pos1, replace_helper.length1, replace_helper.text);
|
2009-11-24 12:20:01 +01:00
|
|
|
} else if (m_cursor) {
|
2010-06-22 10:14:06 +02:00
|
|
|
m_cursor->setPosition(replace_helper.pos1);
|
|
|
|
|
m_cursor->setPosition(replace_helper.pos1 + replace_helper.length1, QTextCursor::KeepAnchor);
|
|
|
|
|
m_cursor->insertText(replace_helper.text);
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
void ChangeSet::convertToReplace(const EditOp &op, QList<EditOp> *replaceList)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
EditOp replace1(EditOp::Replace);
|
|
|
|
|
EditOp replace2(EditOp::Replace);
|
|
|
|
|
|
|
|
|
|
switch (op.type) {
|
|
|
|
|
case EditOp::Replace:
|
|
|
|
|
replaceList->append(op);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Move:
|
|
|
|
|
replace1.pos1 = op.pos1;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace1.length1 = op.length1;
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace1);
|
|
|
|
|
|
|
|
|
|
replace2.pos1 = op.pos2;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace2.text = textAt(op.pos1, op.length1);
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace2);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Insert:
|
|
|
|
|
replace1.pos1 = op.pos1;
|
|
|
|
|
replace1.text = op.text;
|
|
|
|
|
replaceList->append(replace1);
|
|
|
|
|
break;
|
2009-11-18 14:09:32 +01:00
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
case EditOp::Remove:
|
|
|
|
|
replace1.pos1 = op.pos1;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace1.length1 = op.length1;
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace1);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Flip:
|
|
|
|
|
replace1.pos1 = op.pos1;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace1.length1 = op.length1;
|
|
|
|
|
replace1.text = textAt(op.pos2, op.length2);
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace1);
|
|
|
|
|
|
|
|
|
|
replace2.pos1 = op.pos2;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace2.length1 = op.length2;
|
|
|
|
|
replace2.text = textAt(op.pos1, op.length1);
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace2);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Copy:
|
|
|
|
|
replace1.pos1 = op.pos2;
|
2009-11-26 14:42:19 +01:00
|
|
|
replace1.text = textAt(op.pos1, op.length1);
|
2009-11-26 12:22:49 +01:00
|
|
|
replaceList->append(replace1);
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case EditOp::Unset:
|
|
|
|
|
break;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
bool ChangeSet::hadErrors()
|
|
|
|
|
{
|
|
|
|
|
return m_error;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ChangeSet::apply(QString *s)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-24 12:20:01 +01:00
|
|
|
m_string = s;
|
2009-11-26 12:22:49 +01:00
|
|
|
apply_helper();
|
2009-11-24 12:20:01 +01:00
|
|
|
m_string = 0;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
void ChangeSet::apply(QTextCursor *textCursor)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-24 12:20:01 +01:00
|
|
|
m_cursor = textCursor;
|
2009-11-26 12:22:49 +01:00
|
|
|
apply_helper();
|
2009-11-24 12:20:01 +01:00
|
|
|
m_cursor = 0;
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
2009-11-26 12:22:49 +01:00
|
|
|
QString ChangeSet::textAt(int pos, int length)
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
if (m_string) {
|
|
|
|
|
return m_string->mid(pos, length);
|
|
|
|
|
} else if (m_cursor) {
|
|
|
|
|
m_cursor->setPosition(pos);
|
|
|
|
|
m_cursor->setPosition(pos + length, QTextCursor::KeepAnchor);
|
|
|
|
|
return m_cursor->selectedText();
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
2009-11-26 12:22:49 +01:00
|
|
|
return QString();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void ChangeSet::apply_helper()
|
|
|
|
|
{
|
|
|
|
|
// convert all ops to replace
|
|
|
|
|
QList<EditOp> replaceList;
|
2009-11-18 14:09:32 +01:00
|
|
|
{
|
2009-11-26 12:22:49 +01:00
|
|
|
while (!m_operationList.isEmpty()) {
|
|
|
|
|
const EditOp cmd(m_operationList.first());
|
|
|
|
|
m_operationList.removeFirst();
|
|
|
|
|
convertToReplace(cmd, &replaceList);
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
}
|
2009-11-26 12:22:49 +01:00
|
|
|
|
|
|
|
|
// execute replaces
|
|
|
|
|
if (m_cursor)
|
|
|
|
|
m_cursor->beginEditBlock();
|
|
|
|
|
|
|
|
|
|
while (!replaceList.isEmpty()) {
|
|
|
|
|
const EditOp cmd(replaceList.first());
|
|
|
|
|
replaceList.removeFirst();
|
|
|
|
|
doReplace(cmd, &replaceList);
|
|
|
|
|
}
|
|
|
|
|
|
2009-11-24 12:20:01 +01:00
|
|
|
if (m_cursor)
|
|
|
|
|
m_cursor->endEditBlock();
|
2009-11-18 14:09:32 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} // end namespace Utils
|