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
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
|
/**
* This file is part of the DOM implementation for KDE.
*
* Copyright (C) 1999-2003 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001-2003 Dirk Mueller ( mueller@kde.org )
* (C) 2002 Apple Computer, Inc.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "dom_stringimpl.h"
#include <kdebug.h>
#include <string.h>
#include <tqstringlist.h>
using namespace DOM;
using namespace khtml;
DOMStringImpl::DOMStringImpl(const char *str)
{
if(str && *str)
{
l = strlen(str);
s = QT_ALLOC_QCHAR_VEC( l );
int i = l;
TQChar* ptr = s;
while( i-- )
*ptr++ = *str++;
}
else
{
s = QT_ALLOC_QCHAR_VEC( 1 ); // crash protection
s[0] = 0x0; // == TQChar::null;
l = 0;
}
}
// FIXME: should be a cached flag maybe.
bool DOMStringImpl::containsOnlyWhitespace() const
{
if (!s)
return true;
for (uint i = 0; i < l; i++) {
TQChar c = s[i];
if (c.tqunicode() <= 0x7F) {
if (c.tqunicode() > ' ')
return false;
} else {
if (c.direction() != TQChar::DirWS)
return false;
}
}
return true;
}
void DOMStringImpl::append(DOMStringImpl *str)
{
if(str && str->l != 0)
{
int newlen = l+str->l;
TQChar *c = QT_ALLOC_QCHAR_VEC(newlen);
memcpy(c, s, l*sizeof(TQChar));
memcpy(c+l, str->s, str->l*sizeof(TQChar));
if(s) QT_DELETE_QCHAR_VEC(s);
s = c;
l = newlen;
}
}
void DOMStringImpl::insert(DOMStringImpl *str, unsigned int pos)
{
if(pos > l)
{
append(str);
return;
}
if(str && str->l != 0)
{
int newlen = l+str->l;
TQChar *c = QT_ALLOC_QCHAR_VEC(newlen);
memcpy(c, s, pos*sizeof(TQChar));
memcpy(c+pos, str->s, str->l*sizeof(TQChar));
memcpy(c+pos+str->l, s+pos, (l-pos)*sizeof(TQChar));
if(s) QT_DELETE_QCHAR_VEC(s);
s = c;
l = newlen;
}
}
void DOMStringImpl::truncate(int len)
{
if(len > (int)l) return;
int nl = len < 1 ? 1 : len;
TQChar *c = QT_ALLOC_QCHAR_VEC(nl);
memcpy(c, s, nl*sizeof(TQChar));
if(s) QT_DELETE_QCHAR_VEC(s);
s = c;
l = len;
}
void DOMStringImpl::remove(unsigned int pos, int len)
{
if(pos >= l ) return;
if(pos+len > l)
len = l - pos;
uint newLen = l-len;
TQChar *c = QT_ALLOC_QCHAR_VEC(newLen);
memcpy(c, s, pos*sizeof(TQChar));
memcpy(c+pos, s+pos+len, (l-len-pos)*sizeof(TQChar));
if(s) QT_DELETE_QCHAR_VEC(s);
s = c;
l = newLen;
}
DOMStringImpl *DOMStringImpl::split(unsigned int pos)
{
if( pos >=l ) return new DOMStringImpl();
uint newLen = l-pos;
DOMStringImpl *str = new DOMStringImpl(s + pos, newLen);
truncate(pos);
return str;
}
DOMStringImpl *DOMStringImpl::substring(unsigned int pos, unsigned int len)
{
if( pos >=l ) return new DOMStringImpl();
if(pos+len > l)
len = l - pos;
return new DOMStringImpl(s + pos, len);
}
// Collapses white-space according to CSS 2.1 rules
DOMStringImpl *DOMStringImpl::collapseWhiteSpace(bool preserveLF, bool preserveWS)
{
if (preserveLF && preserveWS) return this;
// Notice we are likely allocating more space than needed (worst case)
TQChar *n = QT_ALLOC_QCHAR_VEC(l);
unsigned int pos = 0;
bool collapsing = false; // collapsing white-space
bool collapsingLF = false; // collapsing around linefeed
bool changedLF = false;
for(unsigned int i=0; i<l; i++) {
TQChar ch = s[i];
// We act on \r as we would on \n because CSS uses it to indicate new-line
if (ch == '\r') ch = '\n';
else
// ### The XML parser lets \t through, for now treat them as spaces
if (ch == '\t') ch = ' ';
if (!preserveLF && ch == '\n') {
// ### Not strictly correct according to CSS3 text-module.
// - In ideographic languages linefeed should be ignored
// - and in Thai and Khmer it should be treated as a zero-width space
ch = ' '; // Treat as space
changedLF = true;
}
if (collapsing) {
if (ch == ' ')
continue;
if (ch == '\n') {
collapsingLF = true;
continue;
}
n[pos++] = (collapsingLF) ? '\n' : ' ';
collapsing = false;
collapsingLF = false;
}
else
if (!preserveWS && ch == ' ') {
collapsing = true;
continue;
}
else
if (!preserveWS && ch == '\n') {
collapsing = true;
collapsingLF = true;
continue;
}
n[pos++] = ch;
}
if (collapsing)
n[pos++] = ((collapsingLF) ? '\n' : ' ');
if (pos == l && !changedLF) {
QT_DELETE_QCHAR_VEC(n);
return this;
}
else {
DOMStringImpl* out = new DOMStringImpl();
out->s = n;
out->l = pos;
return out;
}
}
static Length parseLength(const TQChar *s, unsigned int l)
{
if (l == 0) {
return Length(1, Relative);
}
unsigned i = 0;
while (i < l && s[i].isSpace())
++i;
if (i < l && (s[i] == '+' || s[i] == '-'))
++i;
while (i < l && s[i].isDigit())
++i;
bool ok;
int r = TQConstString(s, i).string().toInt(&ok);
/* Skip over any remaining digits, we are not that accurate (5.5% => 5%) */
while (i < l && (s[i].isDigit() || s[i] == '.'))
++i;
/* IE Quirk: Skip any whitespace (20 % => 20%) */
while (i < l && s[i].isSpace())
++i;
if (ok) {
if (i == l) {
return Length(r, Fixed);
} else {
const TQChar* next = s+i;
if (*next == '%')
return Length(r, Percent);
if (*next == '*')
return Length(r, Relative);
}
return Length(r, Fixed);
} else {
if (i < l) {
const TQChar* next = s+i;
if (*next == '*')
return Length(1, Relative);
if (*next == '%')
return Length(1, Relative);
}
}
return Length(0, Relative);
}
khtml::Length* DOMStringImpl::toCoordsArray(int& len) const
{
TQString str(s, l);
for(unsigned int i=0; i < l; i++) {
TQChar cc = s[i];
if (cc > TQChar('9') || (cc < TQChar('0') && cc != '-' && cc != '*' && cc != '.'))
str[i] = ' ';
}
str = str.simplifyWhiteSpace();
len = str.contains(' ') + 1;
khtml::Length* r = new khtml::Length[len];
int i = 0;
int pos = 0;
int pos2;
while((pos2 = str.find(' ', pos)) != -1) {
r[i++] = parseLength((TQChar *) str.tqunicode()+pos, pos2-pos);
pos = pos2+1;
}
r[i] = parseLength((TQChar *) str.tqunicode()+pos, str.length()-pos);
return r;
}
khtml::Length* DOMStringImpl::toLengthArray(int& len) const
{
TQString str(s, l);
str = str.simplifyWhiteSpace();
len = str.contains(',') + 1;
// If we have no commas, we have no array.
if( len == 1 )
return 0L;
khtml::Length* r = new khtml::Length[len];
int i = 0;
int pos = 0;
int pos2;
while((pos2 = str.find(',', pos)) != -1) {
r[i++] = parseLength((TQChar *) str.tqunicode()+pos, pos2-pos);
pos = pos2+1;
}
/* IE Quirk: If the last comma is the last char skip it and reduce len by one */
if (str.length()-pos > 0)
r[i] = parseLength((TQChar *) str.tqunicode()+pos, str.length()-pos);
else
len--;
return r;
}
bool DOMStringImpl::isLower() const
{
unsigned int i;
for (i = 0; i < l; i++)
if (s[i].lower() != s[i])
return false;
return true;
}
DOMStringImpl *DOMStringImpl::lower() const
{
DOMStringImpl *c = new DOMStringImpl;
if(!l) return c;
c->s = QT_ALLOC_QCHAR_VEC(l);
c->l = l;
for (unsigned int i = 0; i < l; i++)
c->s[i] = s[i].lower();
return c;
}
DOMStringImpl *DOMStringImpl::upper() const
{
DOMStringImpl *c = new DOMStringImpl;
if(!l) return c;
c->s = QT_ALLOC_QCHAR_VEC(l);
c->l = l;
for (unsigned int i = 0; i < l; i++)
c->s[i] = s[i].upper();
return c;
}
DOMStringImpl *DOMStringImpl::capitalize(bool noFirstCap) const
{
bool canCapitalize= !noFirstCap;
DOMStringImpl *c = new DOMStringImpl;
if(!l) return c;
c->s = QT_ALLOC_QCHAR_VEC(l);
c->l = l;
for (unsigned int i=0; i<l; i++)
{
if (s[i].isLetterOrNumber() && canCapitalize)
{
c->s[i]=s[i].upper();
canCapitalize=false;
}
else
{
c->s[i]=s[i];
if (s[i].isSpace())
canCapitalize=true;
}
}
return c;
}
TQString DOMStringImpl::string() const
{
return TQString(s, l);
}
int DOMStringImpl::toInt(bool* ok) const
{
// match \s*[+-]?\d*
unsigned i = 0;
while (i < l && s[i].isSpace())
++i;
if (i < l && (s[i] == '+' || s[i] == '-'))
++i;
while (i < l && s[i].isDigit())
++i;
return TQConstString(s, i).string().toInt(ok);
}
static const unsigned short amp[] = {'&', 'a', 'm', 'p', ';'};
static const unsigned short lt[] = {'&', 'l', 't', ';'};
static const unsigned short gt[] = {'&', 'g', 't', ';'};
DOMStringImpl *DOMStringImpl::escapeHTML()
{
unsigned outL = 0;
for (unsigned int i = 0; i < l; ++i ) {
if ( s[i] == '&' )
outL += 5; //&
else if (s[i] == '<' || s[i] == '>')
outL += 4; //>/<
else
++outL;
}
if (outL == l)
return this;
DOMStringImpl* toRet = new DOMStringImpl();
toRet->s = QT_ALLOC_QCHAR_VEC(outL);
toRet->l = outL;
unsigned outP = 0;
for (unsigned int i = 0; i < l; ++i ) {
if ( s[i] == '&' ) {
memcpy(&toRet->s[outP], amp, sizeof(amp));
outP += 5;
} else if (s[i] == '<') {
memcpy(&toRet->s[outP], lt, sizeof(lt));
outP += 4;
} else if (s[i] == '>') {
memcpy(&toRet->s[outP], gt, sizeof(gt));
outP += 4;
} else {
toRet->s[outP] = s[i];
++outP;
}
}
return toRet;
}
|