|
1 /**************************************************************************** |
|
2 ** |
|
3 ** Copyright (C) 2009 Nokia Corporation and/or its subsidiary(-ies). |
|
4 ** All rights reserved. |
|
5 ** Contact: Nokia Corporation (qt-info@nokia.com) |
|
6 ** |
|
7 ** This file is part of the qt3to4 porting application of the Qt Toolkit. |
|
8 ** |
|
9 ** $QT_BEGIN_LICENSE:LGPL$ |
|
10 ** No Commercial Usage |
|
11 ** This file contains pre-release code and may not be distributed. |
|
12 ** You may use this file in accordance with the terms and conditions |
|
13 ** contained in the Technology Preview License Agreement accompanying |
|
14 ** this package. |
|
15 ** |
|
16 ** GNU Lesser General Public License Usage |
|
17 ** Alternatively, this file may be used under the terms of the GNU Lesser |
|
18 ** General Public License version 2.1 as published by the Free Software |
|
19 ** Foundation and appearing in the file LICENSE.LGPL included in the |
|
20 ** packaging of this file. Please review the following information to |
|
21 ** ensure the GNU Lesser General Public License version 2.1 requirements |
|
22 ** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
23 ** |
|
24 ** In addition, as a special exception, Nokia gives you certain additional |
|
25 ** rights. These rights are described in the Nokia Qt LGPL Exception |
|
26 ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package. |
|
27 ** |
|
28 ** If you have questions regarding the use of this file, please contact |
|
29 ** Nokia at qt-info@nokia.com. |
|
30 ** |
|
31 ** |
|
32 ** |
|
33 ** |
|
34 ** |
|
35 ** |
|
36 ** |
|
37 ** |
|
38 ** $QT_END_LICENSE$ |
|
39 ** |
|
40 ****************************************************************************/ |
|
41 |
|
42 #include "textreplacement.h" |
|
43 |
|
44 QT_BEGIN_NAMESPACE |
|
45 |
|
46 bool TextReplacements::insert(QByteArray newText, int insertPosition, int currentLenght) |
|
47 { |
|
48 //bubble sort the new replacement into the list |
|
49 int i; |
|
50 for(i=0; i<textReplacementList.size(); ++i) { |
|
51 if (insertPosition == textReplacementList.at(i).insertPosition) |
|
52 return false; // multiple replacements on the same insertPosition is not allowed. |
|
53 if(insertPosition < textReplacementList.at(i).insertPosition) |
|
54 break; //we found the right position |
|
55 } |
|
56 //++i; |
|
57 // cout << "inserting new text " << newText.constData() << endl; |
|
58 // %s at %d overwriting %d bytes at list pos %d\n", newText.constData(), insertPosition, currentLenght, i); |
|
59 TextReplacement rep; |
|
60 rep.newText=newText; |
|
61 rep.insertPosition=insertPosition; |
|
62 rep.currentLenght=currentLenght; |
|
63 |
|
64 textReplacementList.insert(i, rep); |
|
65 return true; |
|
66 } |
|
67 |
|
68 void TextReplacements::clear() |
|
69 { |
|
70 textReplacementList.clear(); |
|
71 } |
|
72 |
|
73 QByteArray TextReplacements::apply(QByteArray current) |
|
74 { |
|
75 QByteArray newData=current; |
|
76 int i; |
|
77 int replacementOffset=0; |
|
78 |
|
79 for(i=0; i<textReplacementList.size(); ++i) { |
|
80 TextReplacement rep=textReplacementList.at(i); |
|
81 //printf("applying new text %s insert at %d overwriting %d bytes \n", rep.newText.constData(), rep.insertPosition, rep.currentLenght); |
|
82 newData.remove(rep.insertPosition+replacementOffset, rep.currentLenght); |
|
83 newData.insert(rep.insertPosition+replacementOffset, rep.newText); |
|
84 |
|
85 //modify all remaining replacements if we change the document length |
|
86 replacementOffset+=(rep.newText.size() - rep.currentLenght); |
|
87 } |
|
88 |
|
89 return newData; |
|
90 } |
|
91 |
|
92 TextReplacements &TextReplacements::operator+=(const TextReplacements &other) |
|
93 { |
|
94 foreach(TextReplacement rep, other.replacements()) { |
|
95 insert(rep.newText, rep.insertPosition, rep.currentLenght); |
|
96 } |
|
97 return *this; |
|
98 } |
|
99 |
|
100 QT_END_NAMESPACE |