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
|
/****************************************************************************
**
** Copyright (C) 1997-2015 by Dimitri van Heesch.
**
** Permission to use, copy, modify, and distribute this software and its
** documentation under the terms of the GNU General Public License is hereby
** granted. No representations are made about the suitability of this software
** for any purpose. It is provided "as is" without express or implied warranty.
** See the GNU General Public License for more details.
**
** Note: this is a reimplementation of the qcstring.h that came with
** an Qt version 2.2.3. For short strings it stores the string data inside
** the object. For long strings it uses a separate array with reference counting.
**
**********************************************************************/
#ifndef QCSTRING_H
#define QCSTRING_H
#ifndef QT_H
#include "qarray.h"
#endif // QT_H
#include <string>
#include <algorithm>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cstdint>
class QGString;
/*****************************************************************************
Safe and portable C string functions; extensions to standard string.h
*****************************************************************************/
void *qmemmove( void *dst, const void *src, uint len );
#if defined(_OS_WIN32_)
#define qsnprintf _snprintf
#else
#define qsnprintf snprintf
#endif
char *qstrdup( const char * );
inline uint cstrlen( const char *str )
{ return (uint)strlen(str); }
inline uint qstrlen( const char *str )
{ return str ? (uint)strlen(str) : 0; }
inline char *cstrcpy( char *dst, const char *src )
{ return strcpy(dst,src); }
inline char *qstrcpy( char *dst, const char *src )
{ return src ? strcpy(dst, src) : 0; }
char * qstrncpy(char *dst,const char *src, uint len);
inline int cstrcmp( const char *str1, const char *str2 )
{ return strcmp(str1,str2); }
inline int qstrcmp( const char *str1, const char *str2 )
{ return (str1 && str2) ? strcmp(str1,str2) : (int)((intptr_t)str2 - (intptr_t)str1); }
inline int cstrncmp( const char *str1, const char *str2, uint len )
{ return strncmp(str1,str2,len); }
inline int qstrncmp( const char *str1, const char *str2, uint len )
{ return (str1 && str2) ? strncmp(str1,str2,len) :
(int)((intptr_t)str2 - (intptr_t)str1); }
int qstricmp( const char *str1, const char *str2 );
int qstrnicmp( const char *str1, const char *str2, uint len );
/*****************************************************************************
QByteArray class
*****************************************************************************/
#if defined(Q_TEMPLATEDLL)
template class QArray<char>;
#endif
typedef QArray<char> QByteArray;
/*****************************************************************************
QByteArray stream functions
*****************************************************************************/
#ifndef QT_NO_DATASTREAM
QDataStream &operator<<( QDataStream &, const QByteArray & );
QDataStream &operator>>( QDataStream &, QByteArray & );
#endif
//class QRegExp;
/** This is an alternative implementation of QCString. It provides basically
* the same functions but uses std::string as the underlying string type
*/
class QCString
{
public:
QCString() = default;
~QCString() = default;
QCString( const QCString &s ) = default;
QCString &operator=( const QCString &s ) = default;
QCString( QCString &&s ) = default;
QCString &operator=( QCString &&s ) = default;
QCString( const std::string &s ) : m_rep(s) {}
/** creates a string with room for size characters
* @param[in] size the number of character to allocate (also counting the 0-terminator!)
*/
explicit QCString( uint size ) { m_rep.resize(size>0 ? size-1 : 0); }
/** creates a string from a plain C string.
* @param[in] str A zero terminated C string. When 0 an empty string is created.
*/
QCString( const char *str ) : m_rep(str?str:"") {}
/** creates a string from \a str and copies over the first \a maxlen characters. */
QCString( const char *str, uint maxlen ) : m_rep(str?str:"") { m_rep.resize(maxlen); }
/** replaces the contents by that of string \a s. */
/** replaces the contents by that of C string \a str. */
QCString &operator=( const char *str) { m_rep = str?str:""; return *this; }
/** Returns TRUE iff the string is empty. Equivalent to isEmpty(). */
bool isNull() const { return m_rep.empty(); }
/** Returns TRUE iff the string is empty */
bool isEmpty() const { return m_rep.empty(); }
/** Returns the length of the string, not counting the 0-terminator. Equivalent to size(). */
uint length() const { return (uint)m_rep.size(); }
/** Returns the length of the string, not counting the 0-terminator. */
uint size() const { return (uint)m_rep.size(); }
/** Returns a pointer to the contents of the string in the form of a 0-terminated C string */
const char *data() const { return m_rep.empty() ? 0 : m_rep.c_str(); }
/** Returns a writable pointer to the data.
* @warning if the string is shared it will modifying the string directly and
* this will overwrite all copies as well!
*/
char *rawData() const { return m_rep.empty() ? 0 : const_cast<char*>(&m_rep[0]); }
/** Resizes the string to hold \a newlen characters
* (this value should also count the 0-terminator).
* If the string is enlarged the contents will
* be left unmodified.
*/
bool resize( uint newlen ) { m_rep.resize( newlen>0 ? newlen-1 : 0 ); return TRUE; }
/** Truncates the string at position \a pos. */
bool truncate( uint pos ) { return resize( pos + 1 ); }
/** Fills a string with a predefined character
* @param[in] c the character used to fill the string with.
* @param[in] len the number of character to fill. Use -1 to fill the whole string.
* @note the string will be resized to contain \a len characters. The contents of the
* string will be lost.
*/
bool fill( char c, int len = -1 )
{
int l = len==-1 ? (int)m_rep.size() : len;
m_rep = std::string(l,c);
return TRUE;
}
/** Returns a deep copy of the string. */
QCString copy() const { return *this; }
QCString &sprintf( const char *format, ... );
int find( char c, int index=0, bool cs=TRUE ) const;
int find( const char *str, int index=0, bool cs=TRUE ) const;
int find( const QCString &str, int index=0, bool cs=TRUE ) const;
//int find( const QRegExp &rx, int index=0 ) const;
int findRev( char c, int index=-1, bool cs=TRUE) const;
int findRev( const char *str, int index=-1, bool cs=TRUE) const;
//int findRev( const QRegExp &rx, int index=-1 ) const;
int contains( char c, bool cs=TRUE ) const;
int contains( const char *str, bool cs=TRUE ) const;
//int contains( const QRegExp &rx ) const;
bool stripPrefix(const char *prefix)
{
if (prefix==0 || m_rep.empty()) return FALSE;
if (m_rep.rfind(prefix,0)==0) // string starts with prefix
{
m_rep.erase(0,qstrlen(prefix));
return TRUE;
}
return FALSE;
}
QCString left( uint len ) const
{
return m_rep.empty() ? QCString() : QCString(m_rep.substr(0,len));
}
QCString right( uint len ) const
{
return m_rep.empty() ? QCString() :
len<m_rep.size() ? QCString(m_rep.substr(m_rep.size()-len,len)) :
*this;
}
QCString mid( uint index, uint len=(uint)-1) const
{
uint slen = (uint)m_rep.size();
if (len==(uint)-1) len = slen-index;
return m_rep.empty() || index>slen || len==0 ? QCString() :
QCString(m_rep.substr(index,len));
}
QCString lower() const
{
std::string s = m_rep;
std::transform(s.begin(),s.end(),s.begin(),
[](unsigned char c){ return (unsigned char)std::tolower(c); });
return s;
}
QCString upper() const
{
std::string s = m_rep;
std::transform(s.begin(),s.end(),s.begin(),
[](unsigned char c){ return (unsigned char)std::toupper(c); });
return s;
}
QCString stripWhiteSpace() const
{
int sl = (uint)m_rep.size();
if (sl==0 || (!std::isspace(m_rep[0]) && !std::isspace(m_rep[sl-1]))) return *this;
int start=0,end=sl-1;
while (start<sl && std::isspace(m_rep[start])) start++;
if (start==sl) return QCString(); // only whitespace
while (end>start && std::isspace(m_rep[end])) end--;
return QCString(m_rep.substr(start,1+end-start));
}
QCString simplifyWhiteSpace() const;
QCString &insert( uint index, const char *s )
{
uint len = s ? qstrlen(s) : 0;
if (len>0)
{
uint ol = (uint)m_rep.size();
if (index>ol) // insert beyond end of string and fill gap with spaces
{
m_rep.resize(index+len);
std::memset(&m_rep[ol],' ',index-ol);
std::memcpy(&m_rep[index],s,len+1);
}
else // insert inside the string
{
m_rep.insert(index,s);
}
}
return *this;
}
QCString &insert( uint index, char c)
{
char s[2] = { c, '\0' };
return insert(index,s);
}
QCString &append( const char *s )
{
return operator+=(s);
}
QCString &prepend( const char *s )
{
return insert(0,s);
}
QCString &remove( uint index, uint len )
{
uint ol = (uint)m_rep.size();
if (index<ol && len>0) m_rep.erase(index,index+len>=ol ? std::string::npos : len);
return *this;
}
QCString &replace( uint index, uint len, const char *s);
//QCString &replace( const QRegExp &rx, const char *str );
short toShort( bool *ok=0, int base=10 ) const;
ushort toUShort( bool *ok=0, int base=10 ) const;
int toInt( bool *ok=0, int base=10 ) const;
uint toUInt( bool *ok=0, int base=10 ) const;
long toLong( bool *ok=0, int base=10 ) const;
ulong toULong( bool *ok=0, int base=10 ) const;
uint64 toUInt64( bool *ok=0, int base=10 ) const;
QCString &setNum(short n)
{
m_rep = std::to_string(n);
return *this;
}
QCString &setNum(ushort n)
{
m_rep = std::to_string(n);
return *this;
}
QCString &setNum(int n)
{
m_rep = std::to_string(n);
return *this;
}
QCString &setNum(uint n)
{
m_rep = std::to_string(n);
return *this;
}
QCString &setNum(long n)
{
m_rep = std::to_string(n);
return *this;
}
QCString &setNum(ulong n)
{
m_rep = std::to_string(n);
return *this;
}
bool startsWith( const char *s ) const
{
if (m_rep.empty() || s==0) return s==0;
return m_rep.rfind(s,0)==0; // looking "backward" starting and ending at index 0
}
/** Converts the string to a plain C string */
operator const char *() const
{
return data();
}
std::string str() const
{
return m_rep;
}
QCString &operator+=( const std::string &str)
{
m_rep+=str;
return *this;
}
/** Appends string \a str to this string and returns a reference to the result. */
QCString &operator+=( const char *str )
{
if (str) m_rep+=str;
return *this;
}
/** Appends character \a c to this string and returns a reference to the result. */
QCString &operator+=( char c )
{
m_rep+=c;
return *this;
}
/** Returns a reference to the character at index \a i. */
char &at( uint i) const
{
return const_cast<char&>(m_rep[i]);
}
/** Indexing operator. Equivalent to at(). */
char &operator[]( int i ) const
{
return const_cast<char&>(m_rep[i]);
}
private:
std::string m_rep;
};
/*****************************************************************************
QCString stream functions
*****************************************************************************/
#ifndef QT_NO_DATASTREAM
QDataStream &operator<<( QDataStream &, const QCString & );
QDataStream &operator>>( QDataStream &, QCString & );
#endif
/*****************************************************************************
QCString non-member operators
*****************************************************************************/
inline bool operator==( const QCString &s1, const QCString &s2 )
{ return qstrcmp(s1.data(),s2.data()) == 0; }
inline bool operator==( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) == 0; }
inline bool operator==( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) == 0; }
inline bool operator!=( const QCString &s1, const QCString &s2 )
{ return qstrcmp(s1.data(),s2.data()) != 0; }
inline bool operator!=( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) != 0; }
inline bool operator!=( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) != 0; }
inline bool operator<( const QCString &s1, const QCString& s2 )
{ return qstrcmp(s1.data(),s2.data()) < 0; }
inline bool operator<( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) < 0; }
inline bool operator<( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) < 0; }
inline bool operator<=( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) <= 0; }
inline bool operator<=( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) <= 0; }
inline bool operator>( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) > 0; }
inline bool operator>( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) > 0; }
inline bool operator>=( const QCString &s1, const char *s2 )
{ return qstrcmp(s1.data(),s2) >= 0; }
inline bool operator>=( const char *s1, const QCString &s2 )
{ return qstrcmp(s1,s2.data()) >= 0; }
inline QCString operator+( const QCString &s1, const QCString &s2 )
{
return QCString(s1.str()+s2.str());
}
inline QCString operator+( const QCString &s1, const QGString &s2 );
inline QCString operator+( const QGString &s1, const QCString &s2 );
inline QCString operator+( const QCString &s1, const char *s2 )
{
QCString tmp(s1);
tmp += s2;
return tmp;
}
inline QCString operator+( const char *s1, const QCString &s2 )
{
QCString tmp(s1);
tmp += s2;
return tmp;
}
inline QCString operator+( const QCString &s1, char c2 )
{
QCString tmp( s1.data() );
tmp += c2;
return tmp;
}
inline QCString operator+( char c1, const QCString &s2 )
{
QCString tmp;
tmp += c1;
tmp += s2;
return tmp;
}
inline const char *qPrint(const char *s)
{
if (s) return s; else return "";
}
inline const char *qPrint(const QCString &s)
{
if (!s.isEmpty()) return s.data(); else return "";
}
inline const char *qPrint(const std::string &s)
{
return s.c_str();
}
inline std::string toStdString(const QCString &s)
{
return s.str();
}
// helper functions
QCString substitute(const QCString &str,const QCString &find,const QCString &replace);
QCString substitute(const QCString &s,const QCString &src,const QCString &dst,int skip_seq);
inline QCString substitute(const QCString &s,char srcChar,char dstChar)
{
std::string ss = s.str();
std::replace(ss.begin(),ss.end(),srcChar,dstChar);
return ss;
}
#endif // QCSTRING_H
|