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
|
<HTML>
<HEAD>
<TITLE> DwString Man Page </TITLE>
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H2>
<FONT COLOR="navy"> NAME </FONT>
</H2>
<P>
DwString -- String class
<H2>
<FONT COLOR="navy"> SYNOPSIS </FONT>
</H2>
<PRE>class DW_EXPORT DwString {
public:
static const size_t <A HREF="string.html#npos">npos</A>;
<A HREF="string.html#DwString">DwString</A>();
<A HREF="string.html#DwString">DwString</A>(const DwString& aStr, size_t aPos=0, size_t aLen=npos);
<A HREF="string.html#DwString">DwString</A>(const char* aBuf, size_t aLen);
<A HREF="string.html#DwString">DwString</A>(const char* aCstr);
<A HREF="string.html#DwString">DwString</A>(size_t aLen, char aChar);
<A HREF="string.html#DwString">DwString</A>(char* aBuf, size_t aSize, size_t aStart, size_t aLen);
virtual ~DwString();
DwString& <A HREF="string.html#op_eq">operator =</A> (const DwString& aStr);
DwString& <A HREF="string.html#op_eq">operator =</A> (const char* aCstr);
DwString& <A HREF="string.html#op_eq">operator =</A> (char aChar);
size_t <A HREF="string.html#size">size</A>() const;
size_t <A HREF="string.html#length">length</A>() const;
size_t <A HREF="string.html#max_size">max_size</A>() const;
void <A HREF="string.html#resize">resize</A>(size_t aLen, char aChar);
void <A HREF="string.html#resize">resize</A>(size_t aLen);
size_t <A HREF="string.html#capacity">capacity</A>() const;
void <A HREF="string.html#reserve">reserve</A>(size_t aSize);
void <A HREF="string.html#clear">clear</A>();
DwBool <A HREF="string.html#empty">empty</A>() const;
const char& <A HREF="string.html#op_brackets">operator []</A> (size_t aPos) const;
char& <A HREF="string.html#op_brackets">operator []</A> (size_t aPos);
const char& <A HREF="string.html#at">at</A>(size_t aPos) const;
char& <A HREF="string.html#at">at</A>(size_t aPos);
DwString& <A HREF="string.html#op_plus_eq">operator +=</A> (const DwString& aStr);
DwString& <A HREF="string.html#op_plus_eq">operator +=</A> (const char* aCstr);
DwString& <A HREF="string.html#op_plus_eq">operator +=</A> (char aChar);
DwString& <A HREF="string.html#append">append</A>(const DwString& aStr);
DwString& <A HREF="string.html#append">append</A>(const DwString& aStr, size_t aPos, size_t aLen);
DwString& <A HREF="string.html#append">append</A>(const char* aBuf, size_t aLen);
DwString& <A HREF="string.html#append">append</A>(const char* aCstr);
DwString& <A HREF="string.html#append">append</A>(size_t aLen, char aChar);
DwString& <A HREF="string.html#assign">assign</A>(const DwString& aStr);
DwString& <A HREF="string.html#assign">assign</A>(const DwString& aStr, size_t aPos, size_t aLen);
DwString& <A HREF="string.html#assign">assign</A>(const char* aBuf, size_t aLen);
DwString& <A HREF="string.html#assign">assign</A>(const char* aCstr);
DwString& <A HREF="string.html#assign">assign</A>(size_t aLen, char aChar);
DwString& <A HREF="string.html#insert">insert</A>(size_t aPos1, const DwString& aStr);
DwString& <A HREF="string.html#insert">insert</A>(size_t aPos1, const DwString& aStr, size_t aPos2,
size_t aLen2);
DwString& <A HREF="string.html#insert">insert</A>(size_t aPos1, const char* aBuf, size_t aLen2);
DwString& <A HREF="string.html#insert">insert</A>(size_t aPos1, const char* aCstr);
DwString& <A HREF="string.html#insert">insert</A>(size_t aPos1, size_t aLen2, char aChar);
DwString& <A HREF="string.html#erase">erase</A>(size_t aPos=0, size_t aLen=npos);
DwString& <A HREF="string.html#replace">replace</A>(size_t aPos1, size_t aLen1, const DwString& aStr);
DwString& <A HREF="string.html#replace">replace</A>(size_t aPos1, size_t aLen1, const DwString& aStr,
size_t aPos2, size_t aLen2);
DwString& <A HREF="string.html#replace">replace</A>(size_t aPos1, size_t aLen1, const char* aBuf,
size_t aLen2);
DwString& <A HREF="string.html#replace">replace</A>(size_t aPos1, size_t aLen1, const char* aCstr);
DwString& <A HREF="string.html#replace">replace</A>(size_t aPos1, size_t aLen1, size_t aLen2, char aChar);
size_t <A HREF="string.html#copy">copy</A>(char* aBuf, size_t aLen, size_t aPos=0) const;
void <A HREF="string.html#swap">swap</A>(DwString& aStr);
const char* <A HREF="string.html#c_str">c_str</A>() const;
const char* <A HREF="string.html#data">data</A>() const;
size_t <A HREF="string.html#find">find</A>(const DwString& aStr, size_t aPos=0) const;
size_t <A HREF="string.html#find">find</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#find">find</A>(const char* aCstr, size_t aPos=0) const;
size_t <A HREF="string.html#find">find</A>(char aChar, size_t aPos=0) const;
size_t <A HREF="string.html#rfind">rfind</A>(const DwString& aStr, size_t aPos=npos) const;
size_t <A HREF="string.html#rfind">rfind</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#rfind">rfind</A>(const char* aCstr, size_t aPos=npos) const;
size_t <A HREF="string.html#rfind">rfind</A>(char aChar, size_t aPos=npos) const;
size_t <A HREF="string.html#find_first_of">find_first_of</A>(const DwString& aStr, size_t aPos=0) const;
size_t <A HREF="string.html#find_first_of">find_first_of</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#find_first_of">find_first_of</A>(const char* aCstr, size_t aPos=0) const;
size_t <A HREF="string.html#find_last_of">find_last_of</A>(const DwString& aStr, size_t aPos=npos) const;
size_t <A HREF="string.html#find_last_of">find_last_of</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#find_last_of">find_last_of</A>(const char* aCstr, size_t aPos=npos) const;
size_t <A HREF="string.html#find_first_not_of">find_first_not_of</A>(const DwString& aStr, size_t aPos=0) const;
size_t <A HREF="string.html#find_first_not_of">find_first_not_of</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#find_first_not_of">find_first_not_of</A>(const char* aCstr, size_t aPos=0) const;
size_t <A HREF="string.html#find_last_not_of">find_last_not_of</A>(const DwString& aStr, size_t aPos=npos) const;
size_t <A HREF="string.html#find_last_not_of">find_last_not_of</A>(const char* aBuf, size_t aPos, size_t aLen) const;
size_t <A HREF="string.html#find_last_not_of">find_last_not_of</A>(const char* aCstr, size_t aPos=npos) const;
DwString <A HREF="string.html#substr">substr</A>(size_t aPos=0, size_t aLen=npos) const;
int <A HREF="string.html#compare">compare</A>(const DwString& aStr) const;
int <A HREF="string.html#compare">compare</A>(size_t aPos1, size_t aLen1, const DwString& aStr) const;
int <A HREF="string.html#compare">compare</A>(size_t aPos1, size_t aLen1, const DwString& aStr,
size_t aPos2, size_t aLen2) const;
int <A HREF="string.html#compare">compare</A>(const char* aCstr) const;
int <A HREF="string.html#compare">compare</A>(size_t aPos1, size_t aLen1, const char* aBuf,
size_t aLen2=npos) const;
virtual const char* <A HREF="string.html#ClassName">ClassName</A>() const;
int <A HREF="string.html#ObjectId">ObjectId</A>() const;
void <A HREF="string.html#ConvertToLowerCase">ConvertToLowerCase</A>();
void <A HREF="string.html#ConvertToUpperCase">ConvertToUpperCase</A>();
void <A HREF="string.html#Trim">Trim</A>();
void <A HREF="string.html#WriteTo">WriteTo</A>(ostream& aStrm) const;
int <A HREF="string.html#RefCount">RefCount</A>() const;
void <A HREF="string.html#TakeBuffer">TakeBuffer</A>(char* aBuf, size_t aSize, size_t aStart, size_t aLen);
void <A HREF="string.html#ReleaseBuffer">ReleaseBuffer</A>(char** aBuf, size_t* aSize, size_t* aStart, size_t* aLen);
void <A HREF="string.html#CopyTo">CopyTo</A>(DwString* aStr) const;
protected:
DwStringRep* mRep;
size_t mStart;
size_t mLength;
void _copy();
void _replace(size_t aPos1, size_t aLen1, const char* aBuf, size_t aLen2);
void _replace(size_t aPos1, size_t aLen1, size_t aLen2, char aChar);
friend void mem_free(char*);
public:
virtual void <A HREF="string.html#PrintDebugInfo">PrintDebugInfo</A>(ostream& aStrm) const;
virtual void <A HREF="string.html#CheckInvariants">CheckInvariants</A>() const;
};
</PRE>
<H2>
<FONT COLOR="navy"> DESCRIPTION </FONT>
</H2>
<P>
<B><TT>DwString</TT></B> is the workhorse of the MIME++ library. Creating,
parsing, or otherwise manipulating MIME messages is basically a matter of
manipulating strings. <B><TT>DwString</TT></B> provides all the basic
functionality required of a string object, including copying, comparing,
concatenating, and so on.
<P>
<B><TT>DwString</TT></B> is similar to the <B><TT>string</TT></B> class that
is part of the proposed ANSI standard C++ library. Some of the member functions
present in the ANSI <B><TT>string</TT></B> are not present in
<B><TT>DwString</TT></B>: mostly these are the functions that deal with
iterators. <B><TT>DwString</TT></B> also includes some member functions and
class utility functions that are not a part of the ANSI
<B><TT>string</TT></B> class. These non-ANSI functions are easy to distinguish:
they all begin with upper-case letters, and all ANSI functions begin with
lower-case letters. The library classes themselves use only the ANSI
<B><TT>string</TT></B> functions. At some point in the future, MIME++ will
probably allow the option to substitute the ANSI <B><TT>string</TT></B> class
for <B><TT>DwString</TT></B>.
<P>
<B><TT>DwString</TT></B> makes extensive use of copy-on-write, even when
extracting substrings. It is this feature that distiguishes
<B><TT>DwString</TT></B> from most other string classes.
<B><TT>DwString</TT></B> also handles binary data, which can contain embedded
NUL characters.
<H2>
<FONT COLOR="navy"> Public Member Functions </FONT>
</H2>
<P>
<FONT COLOR="teal"><B> <A NAME="DwString">DwString</A>() <BR>
DwString(const DwString& aStr, size_t aPos=0, size_t aLen=npos) <BR>
DwString(const char* aBuf, size_t aLen) <BR>
DwString(const char* aCstr) <BR>
DwString(size_t aLen, char aChar) <BR>
DwString(char* aBuf, size_t aSize, size_t aStart, size_t aLen) </B></FONT>
<P>
The first constructor is the default constructor, which sets the
<B><TT>DwString</TT></B> object's contents to be empty.
<P>
The second constructor is the copy constructor, which copies at most
<B><TT>aLen</TT></B> characters beginning at position
<B><TT>aPos</TT></B> from <B><TT>aStr</TT></B> to the new
<B><TT>DwString</TT></B> object. It will not copy more characters than what
are available in <B><TT>aStr</TT></B>. <B><TT>aPos</TT></B> must be less
than or equal to <B><TT>aStr.size()</TT></B>.
<P>
The third constructor copies <B><TT>aLen</TT></B> characters from the buffer
<B><TT>aBuf</TT></B> into the new <B><TT>DwString</TT></B> object.
<B><TT>aBuf</TT></B> need not be NUL-terminated and may contain NUL characters.
<P>
The fourth constructor copies the contents of the NUL-terminated string
<B><TT>aCstr</TT></B> into the new <B><TT>DwString</TT></B> object.
<P>
The fifth constructor sets the contents of the new
<B><TT>DwString</TT></B> object to be the character <B><TT>aChar</TT></B>
repeated <B><TT>aLen</TT></B> times.
<P>
The sixth constructor is an <I>advanced</I> constructor that sets the contents
of the new <B><TT>DwString</TT></B> object to the <B><TT>aLen</TT></B> characters
starting at offset <B><TT>aStart</TT></B> in the buffer
<B><TT>aBuf</TT></B>. <B><TT>aSize</TT></B> is the allocated size of
<B><TT>aBuf</TT></B>. This constructor is provided for efficiency in setting
a new <B><TT>DwString</TT></B>'s contents from a large buffer. It is efficient
because no copying takes place. Instead, <B><TT>aBuf</TT></B> becomes the
buffer used internally by the <B><TT>DwString</TT></B> object, which takes
responsibility for deleting the buffer. Because <B><TT>DwString</TT></B>
will free the buffer using <B><TT>delete []</TT></B>, the buffer should have
been allocated using <B><TT>new</TT></B>. See also: TakeBuffer(), and
ReleaseBuffer().
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="op_eq">operator =</A> (const
DwString& aStr) <BR>
DwString& operator = (const char* aCstr) <BR>
DwString& operator = (char aChar) </B></FONT>
<P>
Assigns the contents of the operand to this string. <B><TT>aCstr</TT></B>
must point to a NUL-terminated array of characters (a C string). Returns
<B><TT>*this</TT></B>.
<P>
<FONT COLOR="teal"><B> <A NAME="size">size</A>_t size() const </B></FONT>
<P>
Returns the number of characters in this string's contents. This member function
is identical to <B><TT>length()</TT></B>
<P>
<FONT COLOR="teal"><B> size_t <A NAME="length">length</A>() const </B></FONT>
<P>
Returns the number of characters in this string's contents. This member function
is identical to <B><TT>size()</TT></B>
<P>
<FONT COLOR="teal"><B> size_t <A NAME="max_size">max_size</A>() const
</B></FONT>
<P>
Returns the maximum length that this string can ever attain.
<P>
<FONT COLOR="teal"><B> void <A NAME="resize">resize</A>(size_t aLen, char
aChar) <BR>
void resize(size_t aLen) </B></FONT>
<P>
Changes the length of this string. If the string shortened, the final characters
are truncated. If the string is expanded, the added characters will be NULs
or the character specified by <B><TT>aChar</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="capacity">capacity</A>() const
</B></FONT>
<P>
Returns the size of the internal buffer used for this string, which will
always be greater than or equal to the length of the string.
<P>
<FONT COLOR="teal"><B> void <A NAME="reserve">reserve</A>(size_t aSize)
</B></FONT>
<P>
If <B><TT>aSize</TT></B> is greater than the current capacity of this string,
this member function will increase the capacity to be at least
<B><TT>aSize</TT></B>.
<P>
<FONT COLOR="teal"><B> void <A NAME="clear">clear</A>() </B></FONT>
<P>
Sets this string's contents to be empty.
<P>
<FONT COLOR="teal"><B> DwBool <A NAME="empty">empty</A>() const </B></FONT>
<P>
Returns a true value if and only if the contents of this string are empty.
<P>
<FONT COLOR="teal"><B> const char& <A NAME="op_brackets">operator []</A>
(size_t aPos) const <BR>
char& operator [] (size_t aPos) </B></FONT>
<P>
Returns <B><TT>DwString::at(aPos) const</TT></B> or
<B><TT>DwString::at(aPos)</TT></B>. Note that the non-const version always
assumes that the contents will be modified and therefore always copies a
shared internal buffer before it returns.
<P>
<FONT COLOR="teal"><B> const char& <A NAME="at">at</A>(size_t aPos) const
<BR>
char& at(size_t aPos) </B></FONT>
<P>
Returns the character at position <B><TT>aPos</TT></B> in the string's contents.
The non-const version returns an lvalue that may be assigned to. Note that
the non-const version always assumes that the contents will be modified and
therefore always copies a shared internal buffer before it returns.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="op_plus_eq">operator +=</A>
(const DwString& aStr) <BR>
DwString& operator += (const char* aCstr) <BR>
DwString& operator += (char aChar) </B></FONT>
<P>
Appends the contents of the operand to this string. <B><TT>aCstr</TT></B>
must point to a NUL-terminated array of characters (a C string). Returns
<B><TT>*this</TT></B>.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="append">append</A>(const
DwString& aStr) <BR>
DwString& append(const DwString& aStr, size_t aPos, size_t aLen)
<BR>
DwString& append(const char* aBuf, size_t aLen) <BR>
DwString& append(const char* aCstr) <BR>
DwString& append(size_t aLen, char aChar) </B></FONT>
<P>
Appends characters to (the end of) this string. Returns
<B><TT>*this</TT></B>.
<P>
The first version appends all of the characters from
<B><TT>aStr</TT></B>.
<P>
The second version appends at most <B><TT>aLen</TT></B> characters from
<B><TT>aStr</TT></B> beginning at position <B><TT>aPos</TT></B>.
<B><TT>aPos</TT></B> must be less than or equal to
<B><TT>aStr.size()</TT></B>. The function will not append more characters
than what are available in <B><TT>aStr</TT></B>.
<P>
The third version appends <B><TT>aLen</TT></B> characters from
<B><TT>aBuf</TT></B>, which is not assumed to be NUL-terminated and can contain
embedded NULs.
<P>
The fourth version appends characters from the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fifth version appends <B><TT>aChar</TT></B> repeated
<B><TT>aLen</TT></B> times.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="assign">assign</A>(const
DwString& aStr) <BR>
DwString& assign(const DwString& aStr, size_t aPos, size_t aLen)
<BR>
DwString& assign(const char* aBuf, size_t aLen) <BR>
DwString& assign(const char* aCstr) <BR>
DwString& assign(size_t aLen, char aChar) </B></FONT>
<P>
Assigns characters to this string. Returns <B><TT>*this</TT></B>.
<P>
The first version assigns all of the characters from
<B><TT>aStr</TT></B>.
<P>
The second version assigns at most <B><TT>aLen</TT></B> characters from
<B><TT>aStr</TT></B> beginning at position <B><TT>aPos</TT></B>.
<B><TT>aPos</TT></B> must be less than or equal to
<B><TT>aStr.size()</TT></B>. The function will not assign more characters
than what are available in <B><TT>aStr</TT></B>.
<P>
The third version assigns <B><TT>aLen</TT></B> characters from
<B><TT>aBuf</TT></B>, which is not assumed to be NUL-terminated and can contain
embedded NULs.
<P>
The fourth version assigns characters from the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fifth version assigns <B><TT>aChar</TT></B> repeated
<B><TT>aLen</TT></B> times.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="insert">insert</A>(size_t aPos1,
const DwString& aStr) <BR>
DwString& insert(size_t aPos1, const DwString& aStr, size_t aPos2,
size_t aLen2) <BR>
DwString& insert(size_t aPos1, const char* aBuf, size_t aLen2) <BR>
DwString& insert(size_t aPos1, const char* aCstr) <BR>
DwString& insert(size_t aPos1, size_t aLen2, char aChar) </B></FONT>
<P>
Inserts characters into this string beginning at position
<B><TT>aPos1</TT></B>. Returns <B><TT>*this</TT></B>.
<P>
The first version inserts all of the characters from
<B><TT>aStr</TT></B>.
<P>
The second version inserts at most <B><TT>aLen2</TT></B> characters from
<B><TT>aStr</TT></B> beginning at position <B><TT>aPos2</TT></B>.
<B><TT>aPos1</TT></B> must be less than or equal to
<B><TT>aStr.size()</TT></B>. The function will not assign more characters
than what are available in <B><TT>aStr</TT></B>.
<P>
The third version inserts <B><TT>aLen2</TT></B> characters from
<B><TT>aBuf</TT></B>, which is not assumed to be NUL-terminated and can contain
embedded NULs.
<P>
The fourth version inserts characters from the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fifth version inserts <B><TT>aChar</TT></B> repeated
<B><TT>aLen2</TT></B> times.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="erase">erase</A>(size_t aPos=0,
size_t aLen=npos) </B></FONT>
<P>
Erases (removes) at most <B><TT>aLen</TT></B> characters beginning at position
<B><TT>aPos</TT></B> from this string. The function will not erase more
characters than what are available. Returns <B><TT>*this</TT></B>.
<P>
<FONT COLOR="teal"><B> DwString& <A NAME="replace">replace</A>(size_t
aPos1, size_t aLen1, const DwString& aStr) <BR>
DwString& replace(size_t aPos1, size_t aLen1, const DwString& aStr,
size_t aPos2, size_t aLen2) <BR>
DwString& replace(size_t aPos1, size_t aLen1, const char* aBuf, size_t
aLen2) <BR>
DwString& replace(size_t aPos1, size_t aLen1, const char* aCstr) <BR>
DwString& replace(size_t aPos1, size_t aLen1, size_t aLen2, char aChar)
</B></FONT>
<P>
Removes <B><TT>aLen1</TT></B> characters beginning at position
<B><TT>aPos1</TT></B> and inserts other characters. Returns
<B><TT>*this</TT></B>.
<P>
The first version inserts all of the characters from
<B><TT>aStr</TT></B>.
<P>
The second version inserts at most <B><TT>aLen2</TT></B> characters from
<B><TT>aStr</TT></B> beginning at position <B><TT>aPos2</TT></B>.
<B><TT>aPos1</TT></B> must be less than or equal to
<B><TT>aStr.size()</TT></B>. The function will not assign more characters
than what are available in <B><TT>aStr</TT></B>.
<P>
The third version inserts <B><TT>aLen2</TT></B> characters from
<B><TT>aBuf</TT></B>, which is not assumed to be NUL-terminated and can contain
embedded NULs.
<P>
The fourth version inserts characters from the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fifth version inserts <B><TT>aChar</TT></B> repeated
<B><TT>aLen2</TT></B> times.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="copy">copy</A>(char* aBuf, size_t
aLen, size_t aPos=0) const </B></FONT>
<P>
Copies at most <B><TT>aLen</TT></B> characters beginning at position
<B><TT>aPos</TT></B> from this string to the buffer pointed to by
<B><TT>aBuf</TT></B>. Returns the number of characters copied.
<P>
<FONT COLOR="teal"><B> void <A NAME="swap">swap</A>(DwString& aStr)
</B></FONT>
<P>
Swaps the contents of this string and <B><TT>aStr</TT></B>.
<P>
<FONT COLOR="teal"><B> const char* <A NAME="c_str">c_str</A>() const
</B></FONT>
<P>
<P>
<FONT COLOR="teal"><B> const char* <A NAME="data">data</A>() const
</B></FONT>
<P>
These member functions permit access to the internal buffer used by the
<B><TT>DwString</TT></B> object. <B><TT>c_str()</TT></B> returns a NUL-terminated
string suitable for use in C library functions. <B><TT>data()</TT></B> returns
a pointer to the internal buffer, which may not be NUL-terminated.
<P>
<B><TT>c_str()</TT></B> may copy the internal buffer in order to place the
terminating NUL. This is not a violation of the const declaration: it is
a logical const, not a bit-representation const. It could have the side effect
of invalidating a pointer previously returned by <B><TT>c_str()</TT></B>
or <B><TT>data()</TT></B>.
<P>
The characters in the returned string should not be modified, and should
be considered invalid after any call to a non-const member function or another
call to <B><TT>c_str()</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="find">find</A>(const DwString&
aStr, size_t aPos=0) const <BR>
size_t find(const char* aBuf, size_t aPos, size_t aLen) const <BR>
size_t find(const char* aCstr, size_t aPos=0) const <BR>
size_t find(char aChar, size_t aPos=0) const </B></FONT>
<P>
Performs a forward search for a sequence of characters in the
<B><TT>DwString</TT></B> object. The return value is the position of the
sequence in the string if found, or <B><TT>DwString::npos</TT></B> if not
found.
<P>
The first version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of characters in <B><TT>aStr</TT></B>.
<P>
The second version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of <B><TT>aLen</TT></B> characters in <B><TT>aBuf</TT></B>,
which need not be NUL-terminated and can contain embedded NULs.
<P>
The third version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of characters in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fourth version searches beginning at position <B><TT>aPos</TT></B> for
the character <B><TT>aChar</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="rfind">rfind</A>(const DwString&
aStr, size_t aPos=npos) const <BR>
size_t rfind(const char* aBuf, size_t aPos, size_t aLen) const <BR>
size_t rfind(const char* aCstr, size_t aPos=npos) const <BR>
size_t rfind(char aChar, size_t aPos=npos) const </B></FONT>
<P>
Performs a reverse search for a sequence of characters in the
<B><TT>DwString</TT></B> object. The return value is the position of the
sequence in the string if found, or <B><TT>DwString::npos</TT></B> if not
found.
<P>
The first version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of characters in <B><TT>aStr</TT></B>.
<P>
The second version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of <B><TT>aLen</TT></B> characters in <B><TT>aBuf</TT></B>,
which need not be NUL-terminated and can contain embedded NULs.
<P>
The third version searches beginning at position <B><TT>aPos</TT></B> for
the sequence of characters in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
The fourth version searches beginning at position <B><TT>aPos</TT></B> for
the character <B><TT>aChar</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="find_first_of">find_first_of</A>(const
DwString& aStr, size_t aPos=0) const <BR>
size_t find_first_of(const char* aBuf, size_t aPos, size_t aLen) const <BR>
size_t find_first_of(const char* aCstr, size_t aPos=0) const </B></FONT>
<P>
Performs a forward search beginning at position <B><TT>aPos</TT></B> for
the first occurrence of any character from a specified set of characters.
The return value is the position of the character if found, or
<B><TT>DwString::npos</TT></B> if not found.
<P>
The first version searches for any character in the string
<B><TT>aStr</TT></B>.
<P>
The second version searches for any of the <B><TT>aLen</TT></B> characters
in <B><TT>aBuf</TT></B>.
<P>
The third version searches for any character in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t <A NAME="find_last_of">find_last_of</A>(const
DwString& aStr, size_t aPos=npos) const <BR>
size_t find_last_of(const char* aBuf, size_t aPos, size_t aLen) const <BR>
size_t find_last_of(const char* aCstr, size_t aPos=npos) const </B></FONT>
<P>
Performs a reverse search beginning at position <B><TT>aPos</TT></B> for
the first occurrence of any character from a specified set of characters.
If <B><TT>aPos</TT></B> is greater than or equal to the number of characters
in the string, then the search starts at the end of the string. The return
value is the position of the character if found, or
<B><TT>DwString::npos</TT></B> if not found.
<P>
The first version searches for any character in the string
<B><TT>aStr</TT></B>.
<P>
The second version searches for any of the <B><TT>aLen</TT></B> characters
in <B><TT>aBuf</TT></B>.
<P>
The third version searches for any character in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t
<A NAME="find_first_not_of">find_first_not_of</A>(const DwString& aStr,
size_t aPos=0) const <BR>
size_t find_first_not_of(const char* aBuf, size_t aPos, size_t aLen) const
<BR>
size_t find_first_not_of(const char* aCstr, size_t aPos=0) const </B></FONT>
<P>
Performs a forward search beginning at position <B><TT>aPos</TT></B> for
the first occurrence of any character <I>not</I> in a specified set of
characters. The return value is the position of the character if found, or
<B><TT>DwString::npos</TT></B> if not found.
<P>
The first version searches for any character not in the string
<B><TT>aStr</TT></B>.
<P>
The second version searches for any character not among the
<B><TT>aLen</TT></B> characters in <B><TT>aBuf</TT></B>.
<P>
The third version searches for any character not in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
<FONT COLOR="teal"><B> size_t
<A NAME="find_last_not_of">find_last_not_of</A>(const DwString& aStr,
size_t aPos=npos) const <BR>
size_t find_last_not_of(const char* aBuf, size_t aPos, size_t aLen) const
<BR>
size_t find_last_not_of(const char* aCstr, size_t aPos=npos) const
</B></FONT>
<P>
Performs a reverse search beginning at position <B><TT>aPos</TT></B> for
the first occurrence of any character <I>not</I> in a specified set of
characters. If <B><TT>aPos</TT></B> is greater than or equal to the number
of characters in the string, then the search starts at the end of the string.
The return value is the position of the character if found, or
<B><TT>DwString::npos</TT></B> if not found.
<P>
The first version searches for any character not in the string
<B><TT>aStr</TT></B>.
<P>
The second version searches for any character not among the
<B><TT>aLen</TT></B> characters in <B><TT>aBuf</TT></B>.
<P>
The third version searches for any character not in the NUL-terminated string
<B><TT>aCstr</TT></B>.
<P>
<FONT COLOR="teal"><B> DwString <A NAME="substr">substr</A>(size_t aPos=0,
size_t aLen=npos) const </B></FONT>
<P>
Returns a string that contains at most <B><TT>aLen</TT></B> characters from
the <B><TT>DwString</TT></B> object beginning at position
<B><TT>aPos</TT></B>. The returned substring will not contain more characters
than what are available in the superstring <B><TT>DwString</TT></B> object.
<P>
<FONT COLOR="teal"><B> int <A NAME="compare">compare</A>(const DwString&
aStr) const <BR>
int compare(size_t aPos1, size_t aLen1, const DwString& aStr) const <BR>
int compare(size_t aPos1, size_t aLen1, const DwString& aStr, size_t
aPos2, size_t aLen2) const <BR>
int compare(const char* aCstr) const <BR>
int compare(size_t aPos1, size_t aLen1, const char* aBuf, size_t aLen2=npos)
const </B></FONT>
<P>
These member functions compare a sequence of characters to this
<B><TT>DwString</TT></B> object, or a segment of this
<B><TT>DwString</TT></B> object. They return -1, 0, or 1, depending on whether
this <B><TT>DwString</TT></B> object is less than, equal to, or greater than
the compared sequence of characters, respectively.
<P>
The first version compares <B><TT>aStr</TT></B> to this string.
<P>
The second version compares <B><TT>aStr</TT></B> to the segment of this string
of length <B><TT>aLen</TT></B> beginning at position
<B><TT>aPos</TT></B>.
<P>
The third version compares the {tt aLen2} characters beginning at position
<B><TT>aPos2</TT></B> in <B><TT>aStr</TT></B> with the
<B><TT>aLen1</TT></B> characters beginning at position
<B><TT>aPos1</TT></B> in this <B><TT>DwString</TT></B> object.
<P>
The fourth version compares the NUL-terminated string
<B><TT>aCstr</TT></B> to this <B><TT>DwString</TT></B>.
<P>
The fifth version compares the <B><TT>aLen2</TT></B> characters in
<B><TT>aBuf</TT></B> with this <B><TT>DwString</TT></B>.
<P>
<FONT COLOR="teal"><B> virtual const char*
<A NAME="ClassName">ClassName</A>() const </B></FONT>
<P>
This virtual function returns the name of the class as a NUL-terminated char
string.
<P>
<FONT COLOR="teal"><B> int <A NAME="ObjectId">ObjectId</A>() const
</B></FONT>
<P>
Returns the unique object id for this <B><TT>DwString</TT></B>.
<P>
<FONT COLOR="teal"><B> void
<A NAME="ConvertToLowerCase">ConvertToLowerCase</A>() <BR>
void <A NAME="ConvertToUpperCase">ConvertToUpperCase</A>() </B></FONT>
<P>
Converts this <B><TT>DwString</TT></B> object's characters to all lower case
or all upper case.
<P>
<FONT COLOR="teal"><B> void <A NAME="Trim">Trim</A>() </B></FONT>
<P>
Removes all white space from the beginning and the end of this
<B><TT>DwString</TT></B> object. White space characters include ASCII HT,
LF, and SPACE.
<P>
<FONT COLOR="teal"><B> void <A NAME="WriteTo">WriteTo</A>(ostream& aStrm)
const </B></FONT>
<P>
Writes the contents of this <B><TT>DwString</TT></B> object to the stream
<B><TT>aStrm</TT></B>.
<P>
<FONT COLOR="teal"><B> int <A NAME="RefCount">RefCount</A>() const
</B></FONT>
<P>
This <I>advanced</I> member function returns the number of references to
the internal buffer used by the <B><TT>DwString</TT></B> object.
<P>
<FONT COLOR="teal"><B> void <A NAME="TakeBuffer">TakeBuffer</A>(char* aBuf,
size_t aSize, size_t aStart, size_t aLen) </B></FONT>
<P>
This <I>advanced</I> member function sets the contents of the
<B><TT>DwString</TT></B> object to the <B><TT>aLen</TT></B> characters starting
at offset <B><TT>aStart</TT></B> in the buffer <B><TT>aBuf</TT></B>.
<B><TT>aSize</TT></B> is the allocated size of <B><TT>aBuf</TT></B>. This
member function is provided for efficiency in setting a
<B><TT>DwString</TT></B>'s contents from a large buffer. It is efficient
because no copying takes place. Instead, <B><TT>aBuf</TT></B> becomes the
buffer used internally by the <B><TT>DwString</TT></B> object, which takes
responsibility for deleting the buffer. Because DwString will free the buffer
using <B><TT>delete []</TT></B>, the buffer should have been allocated using
<B><TT>new</TT></B>. See also: ReleaseBuffer().
<P>
<FONT COLOR="teal"><B> void <A NAME="ReleaseBuffer">ReleaseBuffer</A>(char**
aBuf, size_t* aSize, size_t* aStart, size_t* aLen) </B></FONT>
<P>
This <I>advanced</I> member function is the symmetric opposite of
<B><TT>TakeBuffer()</TT></B>, to the extent that such an opposite is possible.
It provides a way to ``export'' the buffer used internally by the
<B><TT>DwString</TT></B> object. Note, however, that because of the
copy-on-modify feature of <B><TT>DwString</TT></B>, the
<B><TT>DwString</TT></B> object may not have sole ownership of its internal
buffer. When that is case, <B><TT>ReleaseBuffer()</TT></B> will return a
copy of the buffer. You can check to see if the internal buffer is shared
by calling <B><TT>RefCount()</TT></B>. On return from this member function,
the <B><TT>DwString</TT></B> object will have valid, but empty, contents.
It is recommended that you use this function only on rare occasions where
you need to export efficiently a large buffer.
<P>
<FONT COLOR="teal"><B> void <A NAME="CopyTo">CopyTo</A>(DwString* aStr) const
</B></FONT>
<P>
This <I>advanced</I> member function copies this <B><TT>DwString</TT></B>
object to <B><TT>aStr</TT></B>. This member function is different from the
assignment operator, because it physically copies the buffer instead of just
duplicating a reference to it.
<P>
<FONT COLOR="teal"><B> virtual void
<A NAME="PrintDebugInfo">PrintDebugInfo</A>(ostream& aStrm) const
</B></FONT>
<P>
Prints debugging information about the object to <B><TT>aStrm</TT></B>.
<P>
This member function is available only in the debug version of the library.
<P>
<FONT COLOR="teal"><B> virtual void
<A NAME="CheckInvariants">CheckInvariants</A>() const </B></FONT>
<P>
Aborts if one of the invariants of the object fails. Use this member function
to track down bugs.
<P>
This member function is available only in the debug version of the library.
<H2>
<FONT COLOR="navy"> Public Data Members </FONT>
</H2>
<P>
<FONT COLOR="teal"><B> static const size_t <A NAME="npos">npos</A>
</B></FONT>
<P>
<B><TT>npos</TT></B> is assigned the value (size_t)-1.
</BODY></HTML>
|
