1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
|
/* ****************************************************************************
This file is part of KBabel
Copyright (C) 2001 by Matthias Kiefer <[email protected]>
2002 by Stanislav Visnovsky <[email protected]>
based on code of Andrea Rizzi <[email protected]>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
In addition, as a special exception, the copyright holders give
permission to link the code of this program with any edition of
the TQt library by Trolltech AS, Norway (or with modified versions
of TQt that use the same license as TQt), and distribute linked
combinations including the two. You must obey the GNU General
Public License in all respects for all of the code used other than
TQt. If you modify this file, you may extend this exception to
your version of the file, but you are not obligated to do so. If
you do not wish to do so, delete this exception statement from
your version.
**************************************************************************** */
#include "regexpextractor.h"
#include <kdebug.h>
#include <tqregexp.h>
using namespace KBabel;
RegExpExtractor::RegExpExtractor(const TQStringList& regexps) :
_regExpList( regexps )
{
_string=TQString();
_matches.setAutoDelete(true);
}
void RegExpExtractor::setString(TQString string)
{
_string=string;
processString();
}
uint RegExpExtractor::countMatches()
{
return _matches.count();
}
TQString RegExpExtractor::firstMatch()
{
MatchedEntryInfo *ti = _matches.first();
if(ti)
return ti->extracted;
return TQString();
}
TQString RegExpExtractor::nextMatch()
{
MatchedEntryInfo *ti=_matches.next();
if(!ti)
ti=_matches.first();
if(ti)
return ti->extracted;
return TQString();
}
TQString RegExpExtractor::match(uint tagnumber)
{
MatchedEntryInfo *ti=_matches.at(tagnumber);
if(ti)
return ti->extracted;
return TQString();
}
int RegExpExtractor::matchIndex(uint tagnumber)
{
MatchedEntryInfo *ti=_matches.at(tagnumber);
if(ti)
return ti->index;
return -1;
}
TQString RegExpExtractor::prevMatch()
{
MatchedEntryInfo *ti=_matches.prev();
if(ti)
return ti->extracted;
return TQString();
}
TQString RegExpExtractor::lastMatch()
{
MatchedEntryInfo *ti=_matches.last();
if(ti)
return ti->extracted;
return TQString();
}
TQStringList RegExpExtractor::matches()
{
TQStringList list;
MatchedEntryInfo *ti;
for(ti=_matches.first(); ti!=0; ti = _matches.next())
{
list.append(ti->extracted);
}
return list;
}
TQString RegExpExtractor::plainString(bool keepPos)
{
TQString tmp=_string;
MatchedEntryInfo *ti;
for(ti=_matches.first(); ti != 0; ti=_matches.next())
{
uint len=ti->extracted.length();
TQString s;
for(uint i=0; i<len; i++)
{
s+=' ';
}
tmp.replace(ti->index,len,s);
}
if(!keepPos)
{
tmp=tmp.simplifyWhiteSpace();
}
return tmp;
}
TQString RegExpExtractor::matchesReplaced(const TQString& replace)
{
TQString tmp=_string;
int posCorrection=0;
int replaceLen=replace.length();
MatchedEntryInfo *ti;
for(ti=_matches.first(); ti != 0; ti=_matches.next())
{
uint len=ti->extracted.length();
tmp.replace(ti->index + posCorrection,len,replace);
posCorrection+=(replaceLen-len);
}
return tmp;
}
void RegExpExtractor::processString()
{
_matches.clear();
// if there is no regexp to be matched, quit
if( regExpList().empty() ) return;
TQValueList<MatchedEntryInfo> tmpList;
bool found=false;
TQString tmp=_string;
do
{
found=false;
TQStringList::Iterator it;
for(it=_regExpList.begin();it!=_regExpList.end();++it)
{
int pos=-1;
TQString tag;
TQRegExp reg = TQRegExp((*it));
pos = reg.search(tmp);
int len=reg.matchedLength();
if(pos>=0)
{
tag=tmp.mid(pos,len);
}
if(pos >= 0)
{
found=true;
MatchedEntryInfo ti;
ti.index=pos;
ti.extracted=tag;
tmpList.append(ti);
TQString s;
for(uint i=0; i<tag.length(); i++)
{
s+=' ';
}
tmp.replace(pos,tag.length(),s);
break;
}
}
}
while( found );
uint num=tmpList.count();
for(uint i=0; i < num; i++)
{
uint n= 0;
uint min=_string.length();
uint counter=0;
TQValueList<MatchedEntryInfo>::Iterator it;
for(it=tmpList.begin();it!=tmpList.end();++it)
{
if((*it).index < min)
{
min=(*it).index;
n=counter;
}
counter++;
}
it=tmpList.at(n);
MatchedEntryInfo *ti = new MatchedEntryInfo;
ti->index=(*it).index;
ti->extracted=(*it).extracted;
_matches.append(ti);
tmpList.remove(it);
}
}
TQStringList RegExpExtractor::regExpList()
{
return _regExpList;
}
void RegExpExtractor::setRegExpList( const TQStringList& regexps )
{
_regExpList = regexps;
}
void RegExpExtractor::addRegExpIdentifier(TQString regExp)
{
_regExpList.append(regExp);
}
void RegExpExtractor::deleteRegExpIdentifier(TQString regExp)
{
_regExpList.remove(regExp);
}
|
