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
|
/***************************************************************************
* Copyright (C) 2007 by Albert Astals Cid, [email protected] *
* Please do not use email address above for bug reports; see *
* the README file *
* *
* 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. *
***************************************************************************/
#include <qdir.h>
#include "qt34.h"
LIBCHMCString::LIBCHMCString()
{
}
LIBCHMCString::LIBCHMCString(const char *string)
{
#if defined (USE_QT_4)
cs = QByteArray(string);
#else
cs = QCString(string);
#endif
}
const char *LIBCHMCString::toCString() const
{
return cs.data();
}
void LIBCHMCString::clear()
{
#if defined (USE_QT_4)
cs = QByteArray();
#else
cs = QCString();
#endif
}
bool LIBCHMCString::operator==(const QString &string) const
{
return QString(cs) == string;
}
uint LIBCHMCString::length() const
{
return cs.length();
}
bool LIBCHMCString::isEmpty() const
{
return cs.isEmpty();
}
void LIBCHMCString::prepend(char c)
{
cs = c + cs;
}
char LIBCHMCString::at(uint i) const
{
return cs.at(i);
}
void LIBCHMCString::replace(uint index, uint len, const char *str)
{
cs.replace(index, len, str);
}
void LIBCHMCString::remove(uint index, uint len)
{
cs.remove(index, len);
}
LIBCHMCString LIBCHMCString::lower()
{
#if defined (USE_QT_4)
return cs.toLower().data();
#else
return cs.lower().data();
#endif
}
LIBCHMRegExp::LIBCHMRegExp(const QString ®exp)
{
re = QRegExp(regexp);
}
int LIBCHMRegExp::search(const QString &str, int offset)
{
#if defined (USE_QT_4)
return re.indexIn(str, offset);
#else
return re.search(str, offset);
#endif
}
QString LIBCHMRegExp::cap(int nth)
{
return re.cap(nth);
}
void LIBCHMRegExp::setMinimal(bool minimal)
{
return re.setMinimal(minimal);
}
int LIBCHMRegExp::matchedLength() const
{
return re.matchedLength();
}
LIBCHMString::LIBCHMString()
{
}
LIBCHMString::LIBCHMString(const QString &string)
{
s = string;
}
LIBCHMString::LIBCHMString(const char *string)
{
s = QString(string);
}
QString LIBCHMString::lower() const
{
#if defined (USE_QT_4)
return s.toLower();
#else
return s.lower();
#endif
}
const char *LIBCHMString::ascii() const
{
#if defined (USE_QT_4)
return s.toAscii();
#else
return s.ascii();
#endif
}
int LIBCHMString::find(char c, int index) const
{
#if defined (USE_QT_4)
return s.indexOf(c, index);
#else
return s.find(c, index);
#endif
}
int LIBCHMString::find(const QChar &c, int index) const
{
#if defined (USE_QT_4)
return s.indexOf(c, index);
#else
return s.find(c, index);
#endif
}
int LIBCHMString::find(const QString &string, int index, bool cs) const
{
#if defined (USE_QT_4)
Qt::CaseSensitivity cse;
if (cs) cse = Qt::CaseSensitive;
else cse = Qt::CaseInsensitive;
return s.indexOf(string, index, cse);
#else
return s.find(string, index, cs);
#endif
}
int LIBCHMString::findRev(char c) const
{
#if defined (USE_QT_4)
return s.lastIndexOf(c);
#else
return s.findRev(c);
#endif
}
QChar LIBCHMString::at(uint i) const
{
return s.at(i);
}
QString LIBCHMString::left(uint len) const
{
return s.left(len);
}
LIBCHMString LIBCHMString::mid(uint index, uint len) const
{
return s.mid(index, len);
}
bool LIBCHMString::isEmpty() const
{
return s.isEmpty();
}
QString LIBCHMString::toString() const
{
return s;
}
bool LIBCHMString::operator==(const QString &string) const
{
return s == string;
}
QString LIBCHMDir::cleanDirPath(const QString &dir)
{
#if defined (USE_QT_4)
return QDir::cleanPath(dir);
#else
return QDir::cleanDirPath(dir);
#endif
}
bool LIBCHMStringList::contains(const QStringList &list, const QString &string)
{
return list.contains(string);
}
QStringList LIBCHMStringList::split(const QRegExp ®exp, const QString &string)
{
#if defined (USE_QT_4)
return string.split(regexp, QString::SkipEmptyParts);
#else
return QStringList::split(regexp, string);
#endif
}
|
