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
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
|
/****************************************************************************
**
** Implementation of extended char array operations, and TQByteArray and
** TQCString classes
**
** Created : 920722
**
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the tools module of the TQt GUI Toolkit.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at [email protected].
**
** This file may be used under the terms of the Q Public License as
** defined by Trolltech ASA and appearing in the file LICENSE.TQPL
** included in the packaging of this file. Licensees holding valid TQt
** Commercial licenses may use this file in accordance with the TQt
** Commercial License Agreement provided with the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#include "ntqstring.h"
#include "ntqregexp.h"
#include "ntqdatastream.h"
#ifdef QT_THREAD_SUPPORT
# include <private/qmutexpool_p.h>
#endif // QT_THREAD_SUPPORT
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <ctype.h>
#include <limits.h>
#ifndef QT_NO_COMPRESS
#include "../3rdparty/zlib/zlib.h"
#endif
/*****************************************************************************
Safe and portable C string functions; extensions to standard string.h
*****************************************************************************/
/*!
\relates TQCString
This function is normally part of the C library. TQt implements
memmove() for platforms that do not provide it.
memmove() copies \a len bytes from \a src into \a dst. The data
is copied correctly even if \a src and \a dst overlap.
*/
void *tqmemmove( void *dst, const void *src, uint len )
{
register char *d;
register char *s;
if ( dst > src ) {
d = (char *)dst + len - 1;
s = (char *)src + len - 1;
while ( len-- )
*d-- = *s--;
} else if ( dst < src ) {
d = (char *)dst;
s = (char *)src;
while ( len-- )
*d++ = *s++;
}
return dst;
}
/*!
\relates TQCString
Returns a duplicate string.
Allocates space for a copy of \a src, copies it, and returns a
pointer to the copy. If \a src is 0, it immediately returns 0.
The returned string must be deleted using \c delete[].
*/
char *tqstrdup( const char *src )
{
if ( !src )
return 0;
char *dst = new char[strlen(src)+1];
TQ_CHECK_PTR( dst );
return strcpy( dst, src );
}
/*!
\fn char *qstrcpy( char *dst, const char *src )
\relates TQCString
A safe strcpy() function.
Copies all characters up to and including the '\0' from \a src
into \a dst and returns a pointer to \a dst.
*/
/*!
\relates TQCString
A safe strncpy() function.
Copies at most \a len bytes from \a src (stopping at \a len or the
terminating '\0' whichever comes first) into \a dst and returns a
pointer to \a dst. Guarantees that \a dst is '\0'-terminated. If
\a src or \a dst is 0, returns 0 immediately.
\sa qstrcpy()
*/
char *tqstrncpy( char *dst, const char *src, uint len )
{
if ( !src || !dst )
return 0;
strncpy( dst, src, len );
if ( len > 0 )
dst[len-1] = '\0';
return dst;
}
/*!
\fn uint tqstrlen( const char *str );
\relates TQCString
A safe strlen function.
Returns the number of characters that precede the terminating '\0'.
or 0 if \a str is 0.
*/
/*!
\fn int qstrcmp( const char *str1, const char *str2 );
\relates TQCString
A safe strcmp() function.
Compares \a str1 and \a str2. Returns a negative value if \a str1
is less than \a str2, 0 if \a str1 is equal to \a str2 or a
positive value if \a str1 is greater than \a str2.
Special case I: Returns 0 if \a str1 and \a str2 are both 0.
Special case II: Returns a random nonzero value if \a str1 is 0
or \a str2 is 0 (but not both).
\sa tqstrncmp() tqstricmp() tqstrnicmp()
\link #asciinotion Note on character comparisons \endlink
*/
/*!
\fn int tqstrncmp( const char *str1, const char *str2, uint len );
\relates TQCString
A safe strncmp() function.
Compares at most \a len bytes of \a str1 and \a str2.
Returns a negative value if \a str1 is less than \a str2, 0 if \a
str1 is equal to \a str2 or a positive value if \a str1 is greater
than \a str2.
Special case I: Returns 0 if \a str1 and \a str2 are both 0.
Special case II: Returns a random nonzero value if \a str1 is 0
or \a str2 is 0 (but not both).
\sa qstrcmp(), tqstricmp(), tqstrnicmp()
\link #asciinotion Note on character comparisons \endlink
*/
/*!
\relates TQCString
A safe stricmp() function.
Compares \a str1 and \a str2 ignoring the case.
Returns a negative value if \a str1 is less than \a str2, 0 if \a
str1 is equal to \a str2 or a positive value if \a str1 is greater
than \a str2.
Special case I: Returns 0 if \a str1 and \a str2 are both 0.
Special case II: Returns a random nonzero value if \a str1 is 0
or \a str2 is 0 (but not both).
\sa qstrcmp(), tqstrncmp(), tqstrnicmp()
\link #asciinotion Note on character comparisons \endlink
*/
int tqstricmp( const char *str1, const char *str2 )
{
register const uchar *s1 = (const uchar *)str1;
register const uchar *s2 = (const uchar *)str2;
int res;
uchar c;
if ( !s1 || !s2 )
return s1 ? 1 : ( s2 ? -1 : 0 );
for ( ; !(res = (c=tolower(*s1)) - tolower(*s2)); s1++, s2++ )
if ( !c ) // strings are equal
break;
return res;
}
/*!
\relates TQCString
A safe strnicmp() function.
Compares at most \a len bytes of \a str1 and \a str2 ignoring the case.
Returns a negative value if \a str1 is less than \a str2, 0 if \a str1
is equal to \a str2 or a positive value if \a str1 is greater than \a
str2.
Special case I: Returns 0 if \a str1 and \a str2 are both 0.
Special case II: Returns a random nonzero value if \a str1 is 0
or \a str2 is 0 (but not both).
\sa qstrcmp(), tqstrncmp() tqstricmp()
\link #asciinotion Note on character comparisons \endlink
*/
int tqstrnicmp( const char *str1, const char *str2, uint len )
{
register const uchar *s1 = (const uchar *)str1;
register const uchar *s2 = (const uchar *)str2;
int res;
uchar c;
if ( !s1 || !s2 )
return s1 ? 1 : ( s2 ? -1 : 0 );
for ( ; len--; s1++, s2++ ) {
if ( (res = (c=tolower(*s1)) - tolower(*s2)) )
return res;
if ( !c ) // strings are equal
break;
}
return 0;
}
static TQ_UINT16 crc_tbl[16];
static bool crc_tbl_init = FALSE;
static void createCRC16Table() // build CRC16 lookup table
{
register uint i;
register uint j;
uint v0, v1, v2, v3;
for ( i = 0; i < 16; i++ ) {
v0 = i & 1;
v1 = ( i >> 1 ) & 1;
v2 = ( i >> 2 ) & 1;
v3 = ( i >> 3 ) & 1;
j = 0;
#undef SET_BIT
#define SET_BIT(x, b, v) (x) |= (v) << (b)
SET_BIT( j, 0, v0 );
SET_BIT( j, 7, v0 );
SET_BIT( j, 12, v0 );
SET_BIT( j, 1, v1 );
SET_BIT( j, 8, v1 );
SET_BIT( j, 13, v1 );
SET_BIT( j, 2, v2 );
SET_BIT( j, 9, v2 );
SET_BIT( j, 14, v2 );
SET_BIT( j, 3, v3 );
SET_BIT( j, 10, v3 );
SET_BIT( j, 15, v3 );
crc_tbl[i] = j;
}
}
/*!
\relates TQMemArray
Returns the CRC-16 checksum of \a len bytes starting at \a data.
The checksum is independent of the byte order (endianness).
*/
TQ_UINT16 tqChecksum( const char *data, uint len )
{
if ( !crc_tbl_init ) { // create lookup table
#ifdef QT_THREAD_SUPPORT
TQMutexLocker locker( tqt_global_mutexpool ?
tqt_global_mutexpool->get( &crc_tbl_init ) : 0 );
#endif // QT_THREAD_SUPPORT
if ( !crc_tbl_init ) {
createCRC16Table();
crc_tbl_init = TRUE;
}
}
register TQ_UINT16 crc = 0xffff;
uchar c;
uchar *p = (uchar *)data;
while ( len-- ) {
c = *p++;
crc = ( (crc >> 4) & 0x0fff ) ^ crc_tbl[((crc ^ c) & 15)];
c >>= 4;
crc = ( (crc >> 4) & 0x0fff ) ^ crc_tbl[((crc ^ c) & 15)];
}
return ~crc & 0xffff;
}
/*!
\fn TQByteArray tqCompress( const TQByteArray& data )
\relates TQByteArray
Compresses the array \a data and returns the compressed byte
array using zlib.
\sa tqUncompress()
*/
/*!
\relates TQByteArray
\overload
Compresses the array \a data which is \a nbytes long and returns the
compressed byte array.
*/
#ifndef QT_NO_COMPRESS
TQByteArray tqCompress( const uchar* data, int nbytes )
{
if ( nbytes == 0 ) {
TQByteArray tmp( 4 );
tmp.fill( 0 );
return tmp;
}
if ( !data ) {
#if defined(QT_CHECK_RANGE)
tqWarning( "qCompress: data is NULL." );
#endif
return TQByteArray();
}
ulong len = nbytes + nbytes / 100 + 13;
TQByteArray bazip;
int res;
do {
bazip.resize( len + 4 );
res = ::compress( (uchar*)bazip.data()+4, &len, (uchar*)data, nbytes );
switch ( res ) {
case Z_OK:
bazip.resize( len + 4 );
bazip[0] = ( nbytes & 0xff000000 ) >> 24;
bazip[1] = ( nbytes & 0x00ff0000 ) >> 16;
bazip[2] = ( nbytes & 0x0000ff00 ) >> 8;
bazip[3] = ( nbytes & 0x000000ff );
break;
case Z_MEM_ERROR:
#if defined(QT_CHECK_RANGE)
tqWarning( "qCompress: Z_MEM_ERROR: Not enough memory." );
#endif
bazip.resize( 0 );
break;
case Z_BUF_ERROR:
len *= 2;
break;
}
} while ( res == Z_BUF_ERROR );
return bazip;
}
#endif
/*!
\fn TQByteArray tqUncompress( const TQByteArray& data )
\relates TQByteArray
Uncompresses the array \a data and returns the uncompressed byte
array.
Returns an empty TQByteArray if the input data was corrupt.
\omit
ADD THE FOLLOWING FOR TQt 4.0
This function will uncompress data compressed with tqCompress()
from this and any earlier TQt version, back to TQt 3.1 when this
feature was added.
\endomit
\sa tqCompress()
*/
/*!
\relates TQByteArray
\overload
Uncompresses the array \a data which is \a nbytes long and returns
the uncompressed byte array.
*/
#ifndef QT_NO_COMPRESS
TQByteArray tqUncompress( const uchar* data, int nbytes )
{
if ( !data ) {
#if defined(QT_CHECK_RANGE)
tqWarning( "qUncompress: data is NULL." );
#endif
return TQByteArray();
}
if ( nbytes <= 4 ) {
#if defined(QT_CHECK_RANGE)
if ( nbytes < 4 || ( data[0]!=0 || data[1]!=0 || data[2]!=0 || data[3]!=0 ) )
tqWarning( "qUncompress: Input data is corrupted." );
#endif
return TQByteArray();
}
ulong expectedSize = ( data[0] << 24 ) | ( data[1] << 16 ) | ( data[2] << 8 ) | data[3];
ulong len = TQMAX( expectedSize, 1 );
TQByteArray baunzip;
int res;
do {
if ( baunzip.resize( len ) ) {
res = ::uncompress( (uchar*)baunzip.data(), &len,
(uchar*)data+4, nbytes-4 );
} else {
res = Z_MEM_ERROR;
}
switch ( res ) {
case Z_OK:
if ( len != baunzip.size() )
baunzip.resize( len );
break;
case Z_MEM_ERROR:
#if defined(QT_CHECK_RANGE)
tqWarning( "qUncompress: Z_MEM_ERROR: Not enough memory." );
#endif
break;
case Z_BUF_ERROR:
len *= 2;
break;
case Z_DATA_ERROR:
#if defined(QT_CHECK_RANGE)
tqWarning( "qUncompress: Z_DATA_ERROR: Input data is corrupted." );
#endif
break;
}
} while ( res == Z_BUF_ERROR );
if ( res != Z_OK )
baunzip = TQByteArray();
return baunzip;
}
#endif
/*****************************************************************************
TQByteArray documentation
*****************************************************************************/
/*!
\class TQByteArray
\reentrant
\brief The TQByteArray class provides an array of bytes.
\ingroup collection
\ingroup tools
The TQByteArray class provides an explicitly shared array of bytes.
It is useful for manipulating memory areas with custom data.
TQByteArray is implemented as a TQMemArray\<char\>. See the \l
TQMemArray documentation for further information.
*/
/*!
\fn TQByteArray::TQByteArray()
Constructs an empty TQByteArray.
*/
/*!
\fn TQByteArray::TQByteArray( int size )
Constructs a TQByteArray of size \a size.
*/
/*****************************************************************************
TQByteArray stream functions
*****************************************************************************/
/*!
\relates TQMemArray
Writes byte array \a a to the stream \a s and returns a reference
to the stream.
\sa \link datastreamformat.html Format of the TQDataStream operators \endlink
*/
#ifndef QT_NO_DATASTREAM
TQDataStream &operator<<( TQDataStream &s, const TQByteArray &a )
{
return s.writeBytes( a.data(), a.size() );
}
/*!
\relates TQMemArray
Reads a byte array into \a a from the stream \a s and returns a
reference to the stream.
\sa \link datastreamformat.html Format of the TQDataStream operators \endlink
*/
TQDataStream &operator>>( TQDataStream &s, TQByteArray &a )
{
TQ_UINT32 len;
s >> len; // read size of array
if ( len == 0 || s.eof() ) { // end of file reached
a.resize( 0 );
return s;
}
if ( !a.resize( (uint)len ) ) { // resize array
#if defined(QT_CHECK_NULL)
tqWarning( "TQDataStream: Not enough memory to read TQByteArray" );
#endif
len = 0;
}
if ( len > 0 ) // not null array
s.readRawBytes( a.data(), (uint)len );
return s;
}
#endif //QT_NO_DATASTREAM
/*****************************************************************************
TQCString member functions
*****************************************************************************/
/*!
\class TQCString ntqcstring.h
\reentrant
\brief The TQCString class provides an abstraction of the classic C
zero-terminated char array (char *).
\ingroup text
\ingroup collection
\ingroup tools
\ingroup shared
TQCString inherits TQByteArray, which is defined as
TQMemArray\<char\>. Since TQCString is a TQMemArray, it uses \link
shclass.html explicit sharing\endlink with a reference count.
TQCString tries to behave like a more convenient \c{const char *}.
The price of doing this is that some algorithms will perform
badly. For example, append() is O(length()) since it scans for a
null terminator. Although you might use TQCString for text that is
never exposed to the user, for most purposes, and especially for
user-visible text, you should use TQString. TQString provides
implicit sharing, Unicode and other internationalization support,
and is well optimized.
Note that for the TQCString methods that take a \c{const char *}
parameter the \c{const char *} must either be 0 (null) or not-null
and '\0' (NUL byte) terminated; otherwise the results are
undefined.
A TQCString that has not been assigned to anything is \e null, i.e.
both the length and the data pointer is 0. A TQCString that
references the empty string ("", a single '\0' char) is \e empty.
Both null and empty TQCStrings are legal parameters to the methods.
Assigning \c{const char *} 0 to TQCString produces a null TQCString.
The length() function returns the length of the string; resize()
resizes the string and truncate() truncates the string. A string
can be filled with a character using fill(). Strings can be left
or right padded with characters using leftJustify() and
rightJustify(). Characters, strings and regular expressions can be
searched for using find() and findRev(), and counted using
contains().
Strings and characters can be inserted with insert() and appended
with append(). A string can be prepended with prepend().
Characters can be removed from the string with remove() and
replaced with replace().
Portions of a string can be extracted using left(), right() and
mid(). Whitespace can be removed using stripWhiteSpace() and
simplifyWhiteSpace(). Strings can be converted to uppercase or
lowercase with upper() and lower() respectively.
Strings that contain numbers can be converted to numbers with
toShort(), toInt(), toLong(), toULong(), toFloat() and toDouble().
Numbers can be converted to strings with setNum().
Many operators are overloaded to work with TQCStrings. TQCString
also supports some more obscure functions, e.g. sprintf(),
setStr() and setExpand().
\target asciinotion
\sidebar Note on Character Comparisons
In TQCString the notion of uppercase and lowercase and of which
character is greater than or less than another character is locale
dependent. This affects functions which support a case insensitive
option or which compare or lowercase or uppercase their arguments.
Case insensitive operations and comparisons will be accurate if
both strings contain only ASCII characters. (If \c $LC_CTYPE is
set, most Unix systems do "the right thing".) Functions that this
affects include contains(), find(), findRev(), \l operator<(), \l
operator<=(), \l operator>(), \l operator>=(), lower() and
upper().
This issue does not apply to \l{TQString}s since they represent
characters using Unicode.
\endsidebar
Performance note: The TQCString methods for TQRegExp searching are
implemented by converting the TQCString to a TQString and performing
the search on that. This implies a deep copy of the TQCString data.
If you are going to perform many TQRegExp searches on a large
TQCString, you will get better performance by converting the
TQCString to a TQString yourself, and then searching in the TQString.
*/
/*!
\fn TQCString::TQCString()
Constructs a null string.
\sa isNull()
*/
/*!
\fn TQCString::TQCString( const TQCString &s )
Constructs a shallow copy \a s.
\sa assign()
*/
/*!
Constructs a string with room for \a size characters, including
the '\0'-terminator. Makes a null string if \a size == 0.
If \a size \> 0, then the first and last characters in the string
are initialized to '\0'. All other characters are uninitialized.
\sa resize(), isNull()
*/
TQCString::TQCString( int size )
: TQByteArray( size )
{
if ( size > 0 ) {
*data() = '\0'; // set terminator
*(data()+(size-1)) = '\0';
}
}
/*!
Constructs a string that is a deep copy of \a str.
If \a str is 0 a null string is created.
\sa isNull()
*/
TQCString::TQCString( const char *str )
{
duplicate( str, tqstrlen(str) + 1 );
}
/*!
Constructs a string that is a deep copy of \a str. The copy will
be at most \a maxsize bytes long including the '\0'-terminator.
Example:
\code
TQCString str( "helloworld", 6 ); // assigns "hello" to str
\endcode
If \a str contains a 0 byte within the first \a maxsize bytes, the
resulting TQCString will be terminated by this 0. If \a str is 0 a
null string is created.
\sa isNull()
*/
TQCString::TQCString( const char *str, uint maxsize )
{
if ( str == 0 )
return;
uint len; // index of first '\0'
for ( len = 0; len < maxsize - 1; len++ ) {
if ( str[len] == '\0' )
break;
}
TQByteArray::resize( len + 1 );
memcpy( data(), str, len );
data()[len] = 0;
}
/*!
\reimp
*/
TQCString::~TQCString()
{
}
/*!
\fn TQCString &TQCString::operator=( const TQCString &s )
Assigns a shallow copy of \a s to this string and returns a
reference to this string.
*/
/*!
\overload TQCString &TQCString::operator=( const char *str )
Assigns a deep copy of \a str to this string and returns a
reference to this string.
If \a str is 0 a null string is created.
\sa isNull()
*/
/*!
\fn bool TQCString::isNull() const
Returns TRUE if the string is null, i.e. if data() == 0; otherwise
returns FALSE. A null string is also an empty string.
Example:
\code
TQCString a; // a.data() == 0, a.size() == 0, a.length() == 0
TQCString b == ""; // b.data() == "", b.size() == 1, b.length() == 0
a.isNull(); // TRUE because a.data() == 0
a.isEmpty(); // TRUE because a.length() == 0
b.isNull(); // FALSE because b.data() == ""
b.isEmpty(); // TRUE because b.length() == 0
\endcode
\sa isEmpty(), length(), size()
*/
/*!
\fn bool TQCString::isEmpty() const
Returns TRUE if the string is empty, i.e. if length() == 0;
otherwise returns FALSE. An empty string is not always a null
string.
See example in isNull().
\sa isNull(), length(), size()
*/
/*!
\fn uint TQCString::length() const
Returns the length of the string, excluding the '\0'-terminator.
Equivalent to calling \c strlen(data()).
Null strings and empty strings have zero length.
\sa size(), isNull(), isEmpty()
*/
/*!
\fn bool TQCString::truncate( uint pos )
Truncates the string at position \a pos.
Equivalent to calling \c resize(pos+1).
Example:
\code
TQCString s = "truncate this string";
s.truncate( 5 ); // s == "trunc"
\endcode
\sa resize()
*/
/*!
Extends or shrinks the string to \a len bytes, including the
'\0'-terminator.
A '\0'-terminator is set at position \c{len - 1} unless
\c{len == 0}.
Example:
\code
TQCString s = "resize this string";
s.resize( 7 ); // s == "resize"
\endcode
\sa truncate()
*/
bool TQCString::resize( uint len )
{
detach();
uint wasNull = isNull();
if ( !TQByteArray::resize(len) )
return FALSE;
if ( len )
data()[len - 1] = '\0';
if ( len > 0 && wasNull )
data()[0] = '\0';
return TRUE;
}
/*!
Implemented as a call to the native vsprintf() (see the manual for
your C library).
If the string is shorter than 256 characters, this sprintf() calls
resize(256) to decrease the chance of memory corruption. The
string is resized back to its actual length before sprintf()
returns.
Example:
\code
TQCString s;
s.sprintf( "%d - %s", 1, "first" ); // result < 256 chars
TQCString big( 25000 ); // very long string
big.sprintf( "%d - %s", 2, longString ); // result < 25000 chars
\endcode
\warning All vsprintf() implementations will write past the end of
the target string (*this) if the \a format specification and
arguments happen to be longer than the target string, and some
will also fail if the target string is longer than some arbitrary
implementation limit.
Giving user-supplied arguments to sprintf() is risky: Sooner or
later someone will paste a huge line into your application.
*/
TQCString &TQCString::sprintf( const char *format, ... )
{
detach();
va_list ap;
va_start( ap, format );
if ( size() < 256 )
TQByteArray::resize( 256 ); // make string big enough
#ifdef QT_VSNPRINTF
QT_VSNPRINTF( data(), size(), format, ap );
#else
vsprintf( data(), format, ap );
#endif
resize( tqstrlen(data()) + 1 ); // truncate
va_end( ap );
return *this;
}
/*!
Fills the string with \a len bytes of character \a c, followed by
a '\0'-terminator.
If \a len is negative, then the current string length is used.
Returns FALSE is \a len is nonnegative and there is not enough
memory to resize the string; otherwise returns TRUE.
*/
bool TQCString::fill( char c, int len )
{
detach();
if ( len < 0 )
len = length();
if ( !TQByteArray::fill(c,len+1) )
return FALSE;
*(data()+len) = '\0';
return TRUE;
}
/*!
\fn TQCString TQCString::copy() const
Returns a deep copy of this string.
\sa detach()
*/
/*!
Finds the first occurrence of the character \a c, starting at
position \a index.
The search is case sensitive if \a cs is TRUE, or case insensitive
if \a cs is FALSE.
Returns the position of \a c, or -1 if \a c could not be found.
\sa \link #asciinotion Note on character comparisons \endlink
*/
int TQCString::find( char c, int index, bool cs ) const
{
if ( (uint)index >= size() ) // index outside string
return -1;
register const char *d;
if ( cs ) { // case sensitive
d = strchr( data()+index, c );
} else {
d = data()+index;
c = tolower( (uchar) c );
while ( *d && tolower((uchar) *d) != c )
d++;
if ( !*d && c ) // not found
d = 0;
}
return d ? (int)(d - data()) : -1;
}
#define REHASH( a ) \
if ( sl_minus_1 < sizeof(uint) * CHAR_BIT ) \
hashHaystack -= (a) << sl_minus_1; \
hashHaystack <<= 1
/*!
\overload
Finds the first occurrence of the string \a str, starting at
position \a index.
The search is case sensitive if \a cs is TRUE, or case insensitive
if \a cs is FALSE.
Returns the position of \a str, or -1 if \a str could not be
found.
\sa \link #asciinotion Note on character comparisons \endlink
*/
int TQCString::find( const char *str, int index, bool cs ) const
{
return find( str, index, cs, length() );
}
int TQCString::find( const char *str, int index, bool cs, uint l ) const
{
if ( (uint)index >= size() )
return -1;
if ( !str )
return -1;
if ( !*str )
return index;
const uint sl = tqstrlen( str );
if ( sl + index > l )
return -1;
if ( sl == 1 )
return find( *str, index, cs );
/*
See TQString::find() for details.
*/
const char* needle = str;
const char* haystack = data() + index;
const char* end = data() + (l-sl);
const uint sl_minus_1 = sl-1;
uint hashNeedle = 0, hashHaystack = 0,i;
if ( cs ) {
for ( i = 0; i < sl; ++i ) {
hashNeedle = ((hashNeedle<<1) + needle[i] );
hashHaystack = ((hashHaystack<<1) + haystack[i] );
}
hashHaystack -= *(haystack+sl_minus_1);
while ( haystack <= end ) {
hashHaystack += *(haystack+sl_minus_1);
if ( hashHaystack == hashNeedle && *needle == *haystack
&& tqstrncmp( needle, haystack, sl ) == 0 )
return haystack - data();
REHASH( *haystack );
++haystack;
}
} else {
for ( i = 0; i < sl; ++i ) {
hashNeedle = ((hashNeedle<<1) +
tolower( needle[i] ) );
hashHaystack = ((hashHaystack<<1) +
tolower( haystack[i] ) );
}
hashHaystack -= tolower(*(haystack+sl_minus_1));
while ( haystack <= end ) {
hashHaystack += tolower(*(haystack+sl_minus_1));
if ( hashHaystack == hashNeedle
&& tqstrnicmp( needle, haystack, sl ) == 0 )
return haystack - data();
REHASH( tolower(*haystack) );
++haystack;
}
}
return -1;
}
/*!
Finds the first occurrence of the character \a c, starting at
position \a index and searching backwards.
The search is case sensitive if \a cs is TRUE, or case insensitive
if \a cs is FALSE.
Returns the position of \a c, or -1 if \a c could not be found.
\sa \link #asciinotion Note on character comparisons \endlink
*/
int TQCString::findRev( char c, int index, bool cs ) const
{
register const char *b = data();
register const char *d;
if ( index < 0 )
index = length();
if ( (uint)index >= size() )
return -1;
d = b + index;
if ( cs ) {
while ( d >= b && *d != c )
d--;
} else {
c = tolower( (uchar) c );
while ( d >= b && tolower((uchar) *d) != c )
d--;
}
return d >= b ? (int)(d - b) : -1;
}
/*!
\overload
Finds the first occurrence of the string \a str, starting at
position \a index and searching backwards.
The search is case sensitive if \a cs is TRUE, or case insensitive
if \a cs is FALSE.
Returns the position of \a str, or -1 if \a str could not be
found.
\sa \link #asciinotion Note on character comparisons \endlink
*/
int TQCString::findRev( const char *str, int index, bool cs ) const
{
/*
See TQString::find() for explanations.
*/
const uint sl = tqstrlen( str );
const uint l = length();
int delta = l-sl;
if ( index < 0 )
index = delta;
if ( index < 0 || index > (int)l )
return -1;
if ( index > delta )
index = delta;
if ( sl == 1 )
return findRev( *str, index, cs );
const char* needle = str;
const char* haystack = data() + index;
const char* end = data();
const uint sl_minus_1 = sl-1;
const char* n = needle+sl_minus_1;
const char* h = haystack+sl_minus_1;
uint hashNeedle = 0, hashHaystack = 0, i;
if ( cs ) {
for ( i = 0; i < sl; ++i ) {
hashNeedle = ((hashNeedle<<1) + *(n-i) );
hashHaystack = ((hashHaystack<<1) + *(h-i) );
}
hashHaystack -= *haystack;
while ( haystack >= end ) {
hashHaystack += *haystack;
if ( hashHaystack == hashNeedle && tqstrncmp( needle, haystack, sl ) == 0 )
return haystack-data();
--haystack;
REHASH( *(haystack+sl) );
}
} else {
for ( i = 0; i < sl; ++i ) {
hashNeedle = ((hashNeedle<<1) + tolower( *(n-i) ) );
hashHaystack = ((hashHaystack<<1) + tolower( *(h-i) ) );
}
hashHaystack -= tolower(*haystack);
while ( haystack >= end ) {
hashHaystack += tolower(*haystack);
if ( hashHaystack == hashNeedle && tqstrnicmp( needle, haystack, sl ) == 0 )
return haystack-data();
--haystack;
REHASH( tolower(*(haystack+sl)) );
}
}
return -1;
}
/*!
Returns the number of times the character \a c occurs in the
string.
The match is case sensitive if \a cs is TRUE, or case insensitive
if \a cs if FALSE.
\sa \link #asciinotion Note on character comparisons \endlink
*/
int TQCString::contains( char c, bool cs ) const
{
int count = 0;
char *d = data();
if ( !d )
return 0;
if ( cs ) { // case sensitive
while ( *d )
if ( *d++ == c )
count++;
} else { // case insensitive
c = tolower( (uchar) c );
while ( *d ) {
if ( tolower((uchar) *d) == c )
count++;
d++;
}
}
return count;
}
/*!
\overload
Returns the number of times \a str occurs in the string.
The match is case sensitive if \a cs is TRUE, or case insensitive
if \a cs if FALSE.
This function counts overlapping substrings, for example, "banana"
contains two occurrences of "ana".
\sa findRev()
\link #asciinotion Note on character comparisons \endlink
*/
int TQCString::contains( const char *str, bool cs ) const
{
int count = 0;
int i = -1;
uint l = length();
// use find for the faster hashing algorithm
while ( ( i = find ( str, i+1, cs, l ) ) != -1 )
count++;
return count;
}
/*!
Returns a substring that contains the \a len leftmost characters
of the string.
The whole string is returned if \a len exceeds the length of the
string.
Example:
\code
TQCString s = "Pineapple";
TQCString t = s.left( 4 ); // t == "Pine"
\endcode
\sa right(), mid()
*/
TQCString TQCString::left( uint len ) const
{
if ( isEmpty() ) {
TQCString empty;
return empty;
} else if ( len >= size() ) {
TQCString same( data() );
return same;
} else {
TQCString s( len+1 );
strncpy( s.data(), data(), len );
*(s.data()+len) = '\0';
return s;
}
}
/*!
Returns a substring that contains the \a len rightmost characters
of the string.
The whole string is returned if \a len exceeds the length of the
string.
Example:
\code
TQCString s = "Pineapple";
TQCString t = s.right( 5 ); // t == "apple"
\endcode
\sa left(), mid()
*/
TQCString TQCString::right( uint len ) const
{
if ( isEmpty() ) {
TQCString empty;
return empty;
} else {
uint l = length();
if ( len > l )
len = l;
char *p = data() + (l - len);
return TQCString( p );
}
}
/*!
Returns a substring that contains at most \a len characters from
this string, starting at position \a index.
Returns a null string if the string is empty or if \a index is out
of range. Returns the whole string from \a index if \a index+len
exceeds the length of the string.
Example:
\code
TQCString s = "Two pineapples";
TQCString t = s.mid( 4, 3 ); // t == "pin"
\endcode
\sa left(), right()
*/
TQCString TQCString::mid( uint index, uint len ) const
{
uint slen = tqstrlen( data() );
if ( isEmpty() || index >= slen ) {
TQCString empty;
return empty;
} else {
if ( len > slen-index )
len = slen - index;
register char *p = data()+index;
TQCString s( len+1 );
strncpy( s.data(), p, len );
*(s.data()+len) = '\0';
return s;
}
}
/*!
Returns a string of length \a width (plus one for the terminating
'\0') that contains this string padded with the \a fill character.
If the length of the string exceeds \a width and \a truncate is
FALSE (the default), then the returned string is a copy of the
string. If the length of the string exceeds \a width and \a
truncate is TRUE, then the returned string is a left(\a width).
Example:
\code
TQCString s("apple");
TQCString t = s.leftJustify(8, '.'); // t == "apple..."
\endcode
\sa rightJustify()
*/
TQCString TQCString::leftJustify( uint width, char fill, bool truncate ) const
{
TQCString result;
int len = tqstrlen(data());
int padlen = width - len;
if ( padlen > 0 ) {
result.TQByteArray::resize( len+padlen+1 );
memcpy( result.data(), data(), len );
memset( result.data()+len, fill, padlen );
result[len+padlen] = '\0';
} else {
if ( truncate )
result = left( width );
else
result = copy();
}
return result;
}
/*!
Returns a string of length \a width (plus one for the terminating
'\0') that contains zero or more of the \a fill character followed
by this string.
If the length of the string exceeds \a width and \a truncate is
FALSE (the default), then the returned string is a copy of the
string. If the length of the string exceeds \a width and \a
truncate is TRUE, then the returned string is a left(\a width).
Example:
\code
TQCString s("pie");
TQCString t = s.rightJustify(8, '.'); // t == ".....pie"
\endcode
\sa leftJustify()
*/
TQCString TQCString::rightJustify( uint width, char fill, bool truncate ) const
{
TQCString result;
int len = tqstrlen(data());
int padlen = width - len;
if ( padlen > 0 ) {
result.TQByteArray::resize( len+padlen+1 );
memset( result.data(), fill, padlen );
memcpy( result.data()+padlen, data(), len );
result[len+padlen] = '\0';
} else {
if ( truncate )
result = left( width );
else
result = copy();
}
return result;
}
/*!
Returns a new string that is a copy of this string converted to lower
case.
Example:
\code
TQCString s("Credit");
TQCString t = s.lower(); // t == "credit"
\endcode
\sa upper()
\link #asciinotion Note on character comparisons \endlink
*/
TQCString TQCString::lower() const
{
TQCString s( data() );
register char *p = s.data();
if ( p ) {
while ( *p ) {
*p = tolower( (uchar) *p );
p++;
}
}
return s;
}
/*!
Returns a new string that is a copy of this string converted to upper case.
Example:
\code
TQCString s( "Debit" );
TQCString t = s.upper(); // t == "DEBIT"
\endcode
\sa lower()
\link #asciinotion Note on character comparisons \endlink
*/
TQCString TQCString::upper() const
{
TQCString s( data() );
register char *p = s.data();
if ( p ) {
while ( *p ) {
*p = toupper(*p);
p++;
}
}
return s;
}
/*!
Returns a new string that has white space removed from the start
and the end.
White space means the decimal ASCII codes 9, 10, 11, 12, 13 and
32.
Example:
\code
TQCString s = " space ";
TQCString t = s.stripWhiteSpace(); // t == "space"
\endcode
\sa simplifyWhiteSpace()
*/
TQCString TQCString::stripWhiteSpace() const
{
if ( isEmpty() ) // nothing to do
return copy();
register char *s = data();
TQCString result = s;
int reslen = result.length();
if ( !isspace((uchar) s[0]) && !isspace((uchar) s[reslen-1]) )
return result; // returns a copy
s = result.data();
int start = 0;
int end = reslen - 1;
while ( isspace((uchar) s[start]) ) // skip white space from start
start++;
if ( s[start] == '\0' ) { // only white space
result.resize( 1 );
return result;
}
while ( end && isspace((uchar) s[end]) ) // skip white space from end
end--;
end -= start - 1;
memmove( result.data(), &s[start], end );
result.resize( end + 1 );
return result;
}
/*!
Returns a new string that has white space removed from the start
and the end, plus any sequence of internal white space replaced
with a single space (ASCII 32).
White space means the decimal ASCII codes 9, 10, 11, 12, 13 and
32.
\code
TQCString s = " lots\t of\nwhite space ";
TQCString t = s.simplifyWhiteSpace(); // t == "lots of white space"
\endcode
\sa stripWhiteSpace()
*/
TQCString TQCString::simplifyWhiteSpace() const
{
if ( isEmpty() ) // nothing to do
return copy();
TQCString result( size() );
char *from = data();
char *to = result.data();
char *first = to;
for ( ;; ) {
while ( isspace((uchar) *from) )
from++;
while ( *from && !isspace((uchar) *from) )
*to++ = *from++;
if ( *from )
*to++ = 0x20; // ' '
else
break;
}
if ( to > first && *(to-1) == 0x20 )
to--;
*to = '\0';
result.resize( (int)(to - result.data()) + 1 );
return result;
}
/*!
\overload
Inserts string \a s into the string at position \a index.
If \a index is beyond the end of the string, the string is
padded with spaces (ASCII 32) to length \a index and then \a s
is appended.
\code
TQCString s = "I like fish";
s.insert( 2, "don't "); // s == "I don't like fish"
s = "x"; // index 01234
s.insert( 3, "yz" ); // s == "x yz"
\endcode
*/
TQCString &TQCString::insert( uint index, const char *s )
{
int len = tqstrlen(s);
if ( len == 0 )
return *this;
uint olen = length();
int nlen = olen + len;
if ( index >= olen ) { // insert after end of string
detach();
if ( TQByteArray::resize(nlen+index-olen+1, TQByteArray::SpeedOptim ) ) {
memset( data()+olen, ' ', index-olen );
memcpy( data()+index, s, len+1 );
}
} else {
detach();
if ( TQByteArray::resize(nlen+1, TQByteArray::SpeedOptim ) ) { // normal insert
memmove( data()+index+len, data()+index, olen-index+1 );
memcpy( data()+index, s, len );
}
}
return *this;
}
/*!
Inserts character \a c into the string at position \a index and
returns a reference to the string.
If \a index is beyond the end of the string, the string is
padded with spaces (ASCII 32) to length \a index and then \a c
is appended.
Example:
\code
TQCString s = "Yes";
s.insert( 3, '!'); // s == "Yes!"
\endcode
\sa remove(), replace()
*/
TQCString &TQCString::insert( uint index, char c ) // insert char
{
char buf[2];
buf[0] = c;
buf[1] = '\0';
return insert( index, buf );
}
/*!
\fn TQCString &TQCString::prepend( const char *s )
Prepend \a s to the string. Equivalent to insert(0, s).
\sa insert()
*/
/*!
Removes \a len characters from the string, starting at position \a
index, and returns a reference to the string.
If \a index is out of range, nothing happens. If \a index is
valid, but \a index + \a len is larger than the length of the
string, the string is truncated at position \a index.
\code
TQCString s = "Montreal";
s.remove( 1, 4 ); // s == "Meal"
\endcode
\sa insert(), replace()
*/
TQCString &TQCString::remove( uint index, uint len )
{
uint olen = length();
if ( index + len >= olen ) { // range problems
if ( index < olen ) { // index ok
detach();
resize( index+1 );
}
} else if ( len != 0 ) {
detach();
memmove( data()+index, data()+index+len, olen-index-len+1 );
TQByteArray::resize(olen-len+1, TQByteArray::SpeedOptim );
}
return *this;
}
/*!
Replaces \a len characters from the string, starting at position
\a index, with \a str, and returns a reference to the string.
If \a index is out of range, nothing is removed and \a str is
appended at the end of the string. If \a index is valid, but \a
index + \a len is larger than the length of the string, \a str
replaces the rest of the string from position \a index.
\code
TQCString s = "Say yes!";
s.replace( 4, 3, "NO" ); // s == "Say NO!"
\endcode
\sa insert(), remove()
*/
TQCString &TQCString::replace( uint index, uint len, const char *str )
{
remove( index, len );
insert( index, str );
return *this;
}
/*! \overload
Replaces every occurrence of the character \a c in the string
with \a after. Returns a reference to the string.
Example:
\code
TQCString s = "a,b,c";
s.replace( ',', " or " );
// s == "a or b or c"
\endcode
*/
TQCString &TQCString::replace( char c, const char *after )
{
char str[2];
str[0] = c;
str[1] = '\0';
return replace( str, after );
}
/*! \overload
Replaces every occurrence of the string \a before in the string
with the string \a after. Returns a reference to the string.
Example:
\code
TQCString s = "Greek is Greek";
s.replace( "Greek", "English" );
// s == "English is English"
\endcode
*/
TQCString &TQCString::replace( const char *before, const char *after )
{
if ( before == after || isNull() )
return *this;
detach();
int index = 0;
const int bl = before ? int(strlen( before )) : 0;
const int al = after ? int(strlen( after )) : 0;
char *d = data();
uint len = length();
if ( bl == al ) {
if ( bl ) {
while( (index = find( before, index, TRUE, len ) ) != -1 ) {
memcpy( d+index, after, al );
index += bl;
}
}
} else if ( al < bl ) {
uint to = 0;
uint movestart = 0;
uint num = 0;
while( (index = find( before, index, TRUE, len ) ) != -1 ) {
if ( num ) {
int msize = index - movestart;
if ( msize > 0 ) {
memmove( d + to, d + movestart, msize );
to += msize;
}
} else {
to = index;
}
if ( al ) {
memcpy( d + to, after, al );
to += al;
}
index += bl;
movestart = index;
num++;
}
if ( num ) {
int msize = len - movestart;
if ( msize > 0 )
memmove( d + to, d + movestart, msize );
resize( len - num*(bl-al) + 1 );
}
} else {
// the most complex case. We don't want to loose performance by doing repeated
// copies and reallocs of the string.
while( index != -1 ) {
uint indices[4096];
uint pos = 0;
while( pos < 4095 ) {
index = find(before, index, TRUE, len);
if ( index == -1 )
break;
indices[pos++] = index;
index += bl;
// avoid infinite loop
if ( !bl )
index++;
}
if ( !pos )
break;
// we have a table of replacement positions, use them for fast replacing
int adjust = pos*(al-bl);
// index has to be adjusted in case we get back into the loop above.
if ( index != -1 )
index += adjust;
uint newlen = len + adjust;
int moveend = len;
if ( newlen > len ) {
resize( newlen + 1 );
len = newlen;
}
d = data();
while( pos ) {
pos--;
int movestart = indices[pos] + bl;
int insertstart = indices[pos] + pos*(al-bl);
int moveto = insertstart + al;
memmove( d + moveto, d + movestart, (moveend - movestart) );
if ( after )
memcpy( d + insertstart, after, al );
moveend = movestart - bl;
}
}
}
return *this;
}
/*! \overload
Replaces every occurrence of \a c1 with the char \a c2.
Returns a reference to the string.
*/
TQCString &TQCString::replace( char c1, char c2 )
{
detach();
uint i = 0;
char *d = data();
uint len = length();
while ( i < len ) {
if ( d[i] == c1 )
d[i] = c2;
i++;
}
return *this;
}
#ifndef QT_NO_REGEXP_CAPTURE
/*!
\overload
Finds the first occurrence of the regular expression \a rx,
starting at position \a index.
Returns the position of the next match, or -1 if \a rx was not
found.
\warning If you want to apply this function repeatedly to the same
string it is more efficient to convert the string to a TQString and
apply the function to that.
*/
int TQCString::find( const TQRegExp& rx, int index ) const
{
TQString d = TQString::fromAscii( data() );
return d.find( rx, index );
}
/*!
\overload
Finds the first occurrence of the regular expression \a rx,
starting at position \a index and searching backwards.
Returns the position of the next match (backwards), or -1 if \a rx
was not found.
\warning If you want to apply this function repeatedly to the same
string it is more efficient to convert the string to a TQString and
apply the function to that.
*/
int TQCString::findRev( const TQRegExp& rx, int index ) const
{
TQString d = TQString::fromAscii( data() );
return d.findRev( rx, index );
}
/*!
\overload
Counts the number of overlapping occurrences of \a rx in the string.
Example:
\code
TQString s = "banana and panama";
TQRegExp r = TQRegExp( "a[nm]a", TRUE, FALSE );
s.contains( r ); // 4 matches
\endcode
\sa find(), findRev()
\warning If you want to apply this function repeatedly to the same
string it is more efficient to convert the string to a TQString and
apply the function to that.
*/
int TQCString::contains( const TQRegExp &rx ) const
{
TQString d = TQString::fromAscii( data() );
return d.contains( rx );
}
/*!
\overload
Replaces every occurrence of \a rx in the string with \a str.
Returns a reference to the string.
Example:
\code
TQString s = "banana";
s.replace( TQRegExp("a.*a"), "" ); // becomes "b"
s = "banana";
s.replace( TQRegExp("^[bn]a"), "X" ); // becomes "Xnana"
s = "banana";
s.replace( TQRegExp("^[bn]a"), "" ); // becomes "nana"
\endcode
\warning If you want to apply this function repeatedly to the same
string it is more efficient to convert the string to a TQString and
apply the function to that.
*/
TQCString &TQCString::replace( const TQRegExp &rx, const char *str )
{
TQString d = TQString::fromAscii( data() );
TQString r = TQString::fromAscii( str );
d.replace( rx, r );
setStr( d.ascii() );
return *this;
}
#endif //QT_NO_REGEXP
/*!
Returns the string converted to a \c long value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
long TQCString::toLong( bool *ok ) const
{
char *p = data();
long val=0;
const long max_mult = LONG_MAX / 10;
bool is_ok = FALSE;
int neg = 0;
if ( !p )
goto bye;
while ( isspace((uchar) *p) ) // skip leading space
p++;
if ( *p == '-' ) {
p++;
neg = 1;
} else if ( *p == '+' ) {
p++;
}
if ( !isdigit((uchar) *p) )
goto bye;
while ( isdigit((uchar) *p) ) {
if ( val > max_mult || (val == max_mult && (*p-'0') > 7+neg) )
goto bye;
val = 10*val + (*p++ - '0');
}
if ( neg )
val = -val;
while ( isspace((uchar) *p) ) // skip trailing space
p++;
if ( *p == '\0' )
is_ok = TRUE;
bye:
if ( ok )
*ok = is_ok;
return is_ok ? val : 0;
}
/*!
Returns the string converted to an \c{unsigned long} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
ulong TQCString::toULong( bool *ok ) const
{
char *p = data();
ulong val=0;
const ulong max_mult = ULONG_MAX / 10;
bool is_ok = FALSE;
if ( !p )
goto bye;
while ( isspace((uchar) *p) ) // skip leading space
p++;
if ( *p == '+' )
p++;
if ( !isdigit((uchar) *p) )
goto bye;
while ( isdigit((uchar) *p) ) {
if ( val > max_mult || (val == max_mult && (*p-'0') > 5) )
goto bye;
val = 10*val + (*p++ - '0');
}
while ( isspace((uchar) *p) ) // skip trailing space
p++;
if ( *p == '\0' )
is_ok = TRUE;
bye:
if ( ok )
*ok = is_ok;
return is_ok ? val : 0;
}
/*!
Returns the string converted to a \c{short} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, is out of range, or if it has trailing garbage; otherwise
\a *ok is set to TRUE.
*/
short TQCString::toShort( bool *ok ) const
{
long v = toLong( ok );
if ( v < SHRT_MIN || v > SHRT_MAX ) {
if ( ok )
*ok = FALSE;
v = 0;
}
return (short)v;
}
/*!
Returns the string converted to an \c{unsigned short} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, is out of range, or if it has trailing garbage; otherwise
\a *ok is set to TRUE.
*/
ushort TQCString::toUShort( bool *ok ) const
{
ulong v = toULong( ok );
if ( v > USHRT_MAX ) {
if ( ok )
*ok = FALSE;
v = 0;
}
return (ushort)v;
}
/*!
Returns the string converted to a \c{int} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
int TQCString::toInt( bool *ok ) const
{
long v = toLong( ok );
if ( v < INT_MIN || v > INT_MAX ) {
if ( ok )
*ok = FALSE;
v = 0;
}
return (int)v;
}
/*!
Returns the string converted to an \c{unsigned int} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
uint TQCString::toUInt( bool *ok ) const
{
ulong v = toULong( ok );
if ( v > UINT_MAX ) {
if ( ok )
*ok = FALSE;
v = 0;
}
return (uint)v;
}
/*!
Returns the string converted to a \c{double} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
double TQCString::toDouble( bool *ok ) const
{
char *end;
double val = strtod( data() ? data() : "", &end );
if ( ok )
*ok = ( data() && *data() && ( end == 0 || *end == '\0' ) );
return val;
}
/*!
Returns the string converted to a \c{float} value.
If \a ok is not 0: \a *ok is set to FALSE if the string is not a
number, or if it has trailing garbage; otherwise \a *ok is set to
TRUE.
*/
float TQCString::toFloat( bool *ok ) const
{
return (float)toDouble( ok );
}
/*!
Makes a deep copy of \a str. Returns a reference to the string.
*/
TQCString &TQCString::setStr( const char *str )
{
detach();
if ( str ) // valid string
store( str, tqstrlen(str)+1 );
else // empty
resize( 0 );
return *this;
}
/*!
\overload
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
TQCString &TQCString::setNum( long n )
{
detach();
char buf[20];
register char *p = &buf[19];
bool neg;
if ( n < 0 ) {
neg = TRUE;
n = -n;
} else {
neg = FALSE;
}
*p = '\0';
do {
*--p = ((int)(n%10)) + '0';
n /= 10;
} while ( n );
if ( neg )
*--p = '-';
store( p, tqstrlen(p)+1 );
return *this;
}
/*!
\overload
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
TQCString &TQCString::setNum( ulong n )
{
detach();
char buf[20];
register char *p = &buf[19];
*p = '\0';
do {
*--p = ((int)(n%10)) + '0';
n /= 10;
} while ( n );
store( p, tqstrlen(p)+1 );
return *this;
}
/*!
\overload TQCString &TQCString::setNum( int n )
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
/*!
\overload TQCString &TQCString::setNum( uint n )
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
/*!
\overload TQCString &TQCString::setNum( short n )
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
/*!
\overload TQCString &TQCString::setNum( ushort n )
Sets the string to the string representation of the number \a n
and returns a reference to the string.
*/
/*!
Sets the string to the string representation of the number \a n
and returns a reference to the string.
The format of the string representation is specified by the format
character \a f, and the precision (number of digits after the
decimal point) is specified with \a prec.
The valid formats for \a f are 'e', 'E', 'f', 'g' and 'G'. The
formats are the same as for sprintf(); they are explained in \l
TQString::arg().
*/
TQCString &TQCString::setNum( double n, char f, int prec )
{
#if defined(QT_CHECK_RANGE)
if ( !(f=='f' || f=='F' || f=='e' || f=='E' || f=='g' || f=='G') )
tqWarning( "TQCString::setNum: Invalid format char '%c'", f );
#endif
char format[20];
register char *fs = format; // generate format string
*fs++ = '%'; // "%.<prec>l<f>"
if ( prec > 99 )
prec = 99;
*fs++ = '.';
if ( prec >= 10 ) {
*fs++ = prec / 10 + '0';
*fs++ = prec % 10 + '0';
} else {
*fs++ = prec + '0';
}
*fs++ = 'l';
*fs++ = f;
*fs = '\0';
return sprintf( format, n );
}
/*! \overload TQCString &TQCString::setNum( float n, char f, int prec ) */
/*!
Sets the character at position \a index to \a c and expands the
string if necessary, padding with spaces.
Returns FALSE if \a index was out of range and the string could
not be expanded; otherwise returns TRUE.
*/
bool TQCString::setExpand( uint index, char c )
{
detach();
uint oldlen = length();
if ( index >= oldlen ) {
if ( !TQByteArray::resize( index+2 ) ) // no memory
return FALSE;
if ( index > oldlen )
memset( data() + oldlen, ' ', index - oldlen );
*(data() + index+1) = '\0'; // terminate padded string
}
*(data() + index) = c;
return TRUE;
}
/*!
\fn TQCString::operator const char *() const
Returns the string data.
*/
/*!
\fn TQCString& TQCString::append( const char *str )
Appends string \a str to the string and returns a reference to the
string. Equivalent to operator+=().
*/
/*!
Appends string \a str to the string and returns a reference to the string.
*/
TQCString& TQCString::operator+=( const char *str )
{
if ( !str )
return *this; // nothing to append
detach();
uint len1 = length();
uint len2 = tqstrlen(str);
if ( !TQByteArray::resize( len1 + len2 + 1, TQByteArray::SpeedOptim ) )
return *this; // no memory
memcpy( data() + len1, str, len2 + 1 );
return *this;
}
/*!
\overload
Appends character \a c to the string and returns a reference to the string.
*/
TQCString &TQCString::operator+=( char c )
{
detach();
uint len = length();
if ( !TQByteArray::resize( len + 2, TQByteArray::SpeedOptim ) )
return *this; // no memory
*(data() + len) = c;
*(data() + len+1) = '\0';
return *this;
}
/*****************************************************************************
TQCString stream functions
*****************************************************************************/
#ifndef QT_NO_DATASTREAM
/*!
\relates TQCString
Writes string \a str to the stream \a s.
\sa \link datastreamformat.html Format of the TQDataStream operators \endlink
*/
TQDataStream &operator<<( TQDataStream &s, const TQCString &str )
{
return s.writeBytes( str.data(), str.size() );
}
/*!
\relates TQCString
Reads a string into \a str from the stream \a s.
\sa \link datastreamformat.html Format of the TQDataStream operators \endlink
*/
TQDataStream &operator>>( TQDataStream &s, TQCString &str )
{
str.detach();
TQ_UINT32 len;
s >> len; // read size of string
if ( len == 0 || s.eof() ) { // end of file reached
str.resize( 0 );
return s;
}
if ( !str.TQByteArray::resize( (uint)len )) {// resize string
#if defined(QT_CHECK_NULL)
tqWarning( "TQDataStream: Not enough memory to read TQCString" );
#endif
len = 0;
}
if ( len > 0 ) // not null array
s.readRawBytes( str.data(), (uint)len );
return s;
}
#endif //QT_NO_DATASTREAM
/*****************************************************************************
Documentation for related functions
*****************************************************************************/
/*!
\fn bool operator==( const TQCString &s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are equal; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) == 0.
*/
/*!
\overload bool operator==( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are equal; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) == 0.
*/
/*!
\overload bool operator==( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are equal; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) == 0.
*/
/*!
\fn bool operator!=( const TQCString &s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are different; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) != 0.
*/
/*!
\overload bool operator!=( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are different; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) != 0.
*/
/*!
\overload bool operator!=( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 and \a s2 are different; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) != 0.
*/
/*!
\fn bool operator<( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 is less than \a s2; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \< 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\overload bool operator<( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 is less than \a s2; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \< 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\fn bool operator<=( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 is less than or equal to \a s2; otherwise
returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \<= 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\overload bool operator<=( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 is less than or equal to \a s2; otherwise
returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \<= 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\fn bool operator>( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 is greater than \a s2; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \> 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\overload bool operator>( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 is greater than \a s2; otherwise returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \> 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\fn bool operator>=( const TQCString &s1, const char *s2 )
\relates TQCString
Returns TRUE if \a s1 is greater than or equal to \a s2; otherwise
returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \>= 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\overload bool operator>=( const char *s1, const TQCString &s2 )
\relates TQCString
Returns TRUE if \a s1 is greater than or equal to \a s2; otherwise
returns FALSE.
Equivalent to qstrcmp(\a s1, \a s2) \>= 0.
\sa \link #asciinotion Note on character comparisons \endlink
*/
/*!
\fn const TQCString operator+( const TQCString &s1, const TQCString &s2 )
\relates TQCString
Returns a string which consists of the concatenation of \a s1 and
\a s2.
*/
/*!
\overload const TQCString operator+( const TQCString &s1, const char *s2 )
\relates TQCString
Returns a string which consists of the concatenation of \a s1 and \a s2.
*/
/*!
\overload const TQCString operator+( const char *s1, const TQCString &s2 )
\relates TQCString
Returns a string which consists of the concatenation of \a s1 and \a s2.
*/
/*!
\overload const TQCString operator+( const TQCString &s, char c )
\relates TQCString
Returns a string which consists of the concatenation of \a s and \a c.
*/
/*!
\overload const TQCString operator+( char c, const TQCString &s )
\relates TQCString
Returns a string which consists of the concatenation of \a c and \a s.
*/
|