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
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- /home/espenr/tmp/qt-3.3.8-espenr-2499/qt-x11-free-3.3.8/include/ntqvaluevector.h:1 -->
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
<title>ntqvaluevector.h Include File</title>
<style type="text/css"><!--
fn { margin-left: 1cm; text-indent: -1cm; }
a:link { color: #004faf; text-decoration: none }
a:visited { color: #672967; text-decoration: none }
body { background: #ffffff; color: black; }
--></style>
</head>
<body>
<table border="0" cellpadding="0" cellspacing="0" width="100%">
<tr bgcolor="#E5E5E5">
<td valign=center>
<a href="index.html">
<font color="#004faf">Home</font></a>
| <a href="classes.html">
<font color="#004faf">All Classes</font></a>
| <a href="mainclasses.html">
<font color="#004faf">Main Classes</font></a>
| <a href="annotated.html">
<font color="#004faf">Annotated</font></a>
| <a href="groups.html">
<font color="#004faf">Grouped Classes</font></a>
| <a href="functions.html">
<font color="#004faf">Functions</font></a>
</td>
<td align="right" valign="center"><img src="logo32.png" align="right" width="64" height="32" border="0"></td></tr></table><h1 align=center>ntqvaluevector.h</h1>
<p>This is the verbatim text of the ntqvaluevector.h include file. It is provided only for illustration; the copyright remains with Trolltech.
<hr>
<pre>
/****************************************************************************
** $Id: qt/ntqvaluevector.h 3.3.8 edited Jan 11 14:38 $
**
** Definition of TQValueVector class
**
** Copyright (C) 1992-2007 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 file LICENSE.GPL 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 sales@trolltech.com.
**
** 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.
**
**********************************************************************/
#ifndef TQVALUEVECTOR_H
#define TQVALUEVECTOR_H
#ifndef QT_H
#include "ntqtl.h"
#include "ntqshared.h"
#include "ntqdatastream.h"
#endif // QT_H
#ifndef QT_NO_STL
#include <vector>
#endif
template <class T>
class TQValueVectorPrivate : public TQShared
{
public:
typedef T value_type;
typedef T* pointer;
TQValueVectorPrivate()
: start( 0 ), finish( 0 ), end( 0 )
{
}
TQValueVectorPrivate( const TQValueVectorPrivate<T>& x );
TQValueVectorPrivate( size_t size );
void derefAndDelete() // work-around for hp-cc
{
if ( deref() )
delete this;
}
#if defined(Q_TEMPLATEDLL)
// Workaround MS bug in memory de/allocation in DLL vs. EXE
virtual
#endif
~TQValueVectorPrivate()
{
delete[] start;
}
size_t size() const
{
return finish - start;
}
bool empty() const
{
return start == finish;
}
size_t capacity() const
{
return end - start;
}
void insert( pointer pos, const T& x );
void insert( pointer pos, size_t n, const T& x );
void reserve( size_t n );
void clear()
{
delete[] start;
start = 0;
finish = 0;
end = 0;
}
pointer start;
pointer finish;
pointer end;
private:
pointer growAndCopy( size_t n, pointer s, pointer f );
TQValueVectorPrivate<T>& operator=( const TQValueVectorPrivate<T>& x );
};
template <class T>
Q_INLINE_TEMPLATES TQValueVectorPrivate<T>::TQValueVectorPrivate( const TQValueVectorPrivate<T>& x )
: TQShared()
{
size_t i = x.size();
if ( i > 0 ) {
start = new T[ i ];
finish = start + i;
end = start + i;
#if defined(__xlC__) && __xlC__ < 0x400 // xlC 3.6 confused by const
tqCopy( (pointer)x.start, (pointer)x.finish, start );
#else
tqCopy( x.start, x.finish, start );
#endif
} else {
start = 0;
finish = 0;
end = 0;
}
}
template <class T>
Q_INLINE_TEMPLATES TQValueVectorPrivate<T>::TQValueVectorPrivate( size_t size )
{
if ( size > 0 ) {
start = new T[size];
finish = start + size;
end = start + size;
} else {
start = 0;
finish = 0;
end = 0;
}
}
template <class T>
Q_INLINE_TEMPLATES void TQValueVectorPrivate<T>::insert( pointer pos, const T& x )
{
const size_t lastSize = size();
const size_t n = lastSize !=0 ? 2*lastSize : 1;
const size_t offset = pos - start;
pointer newStart = new T[n];
pointer newFinish = newStart + offset;
tqCopy( start, pos, newStart );
*newFinish = x;
tqCopy( pos, finish, ++newFinish );
delete[] start;
start = newStart;
finish = newStart + lastSize + 1;
end = newStart + n;
}
template <class T>
Q_INLINE_TEMPLATES void TQValueVectorPrivate<T>::insert( pointer pos, size_t n, const T& x )
{
if ( size_t( end - finish ) >= n ) {
// enough room
const size_t elems_after = finish - pos;
pointer old_finish = finish;
if ( elems_after > n ) {
tqCopy( finish - n, finish, finish );
finish += n;
tqCopyBackward( pos, old_finish - n, old_finish );
tqFill( pos, pos + n, x );
} else {
pointer filler = finish;
size_t i = n - elems_after;
for ( ; i > 0; --i, ++filler )
*filler = x;
finish += n - elems_after;
tqCopy( pos, old_finish, finish );
finish += elems_after;
tqFill( pos, old_finish, x );
}
} else {
// not enough room
const size_t lastSize = size();
const size_t len = lastSize + TQMAX( lastSize, n );
pointer newStart = new T[len];
pointer newFinish = tqCopy( start, pos, newStart );
// fill up inserted space
size_t i = n;
for ( ; i > 0; --i, ++newFinish )
*newFinish = x;
newFinish = tqCopy( pos, finish, newFinish );
delete[] start;
start = newStart;
finish = newFinish;
end = newStart + len;
}
}
template <class T>
Q_INLINE_TEMPLATES void TQValueVectorPrivate<T>::reserve( size_t n )
{
const size_t lastSize = size();
pointer tmp = growAndCopy( n, start, finish );
start = tmp;
finish = tmp + lastSize;
end = start + n;
}
template <class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQValueVectorPrivate<T>::pointer TQValueVectorPrivate<T>::growAndCopy( size_t n, pointer s, pointer f )
{
pointer newStart = new T[n];
tqCopy( s, f, newStart );
delete[] start;
return newStart;
}
template <class T> class TQDeepCopy;
template <class T>
class TQValueVector
{
public:
typedef T value_type;
typedef value_type* pointer;
typedef const value_type* const_pointer;
typedef value_type* iterator;
typedef const value_type* const_iterator;
typedef value_type& reference;
typedef const value_type& const_reference;
typedef size_t size_type;
#ifndef QT_NO_STL
typedef ptrdiff_t difference_type;
#else
typedef int difference_type;
#endif
TQValueVector()
{
sh = new TQValueVectorPrivate<T>;
}
TQValueVector( const TQValueVector<T>& v )
{
sh = v.sh;
sh->ref();
}
TQValueVector( size_type n, const T& val = T() );
#ifndef QT_NO_STL
TQValueVector( std::vector<T>& v ) // ### remove in 4.0
{
sh = new TQValueVectorPrivate<T>( v.size() );
tqCopy( v.begin(), v.end(), begin() );
}
TQValueVector( const std::vector<T>& v )
{
sh = new TQValueVectorPrivate<T>( v.size() );
tqCopy( v.begin(), v.end(), begin() );
}
#endif
~TQValueVector()
{
sh->derefAndDelete();
}
TQValueVector<T>& operator= ( const TQValueVector<T>& v )
{
v.sh->ref();
sh->derefAndDelete();
sh = v.sh;
return *this;
}
#ifndef QT_NO_STL
TQValueVector<T>& operator= ( const std::vector<T>& v )
{
clear();
resize( v.size() );
tqCopy( v.begin(), v.end(), begin() );
return *this;
}
#endif
size_type size() const { return sh->size(); }
bool empty() const { return sh->empty(); }
size_type capacity() const
{
return size_type( sh->capacity() );
}
iterator begin()
{
detach();
return sh->start;
}
const_iterator begin() const
{
return sh->start;
}
const_iterator constBegin() const
{
return sh->start;
}
iterator end()
{
detach();
return sh->finish;
}
const_iterator end() const
{
return sh->finish;
}
const_iterator constEnd() const
{
return sh->finish;
}
reference at( size_type i, bool* ok = 0 )
{
detach();
if ( ok )
*ok = ( i < size() );
return *( begin() + i );
}
const_reference at( size_type i, bool* ok = 0 ) const
{
if ( ok )
*ok = ( i < size() );
return *( begin() + i );
}
reference operator[]( size_type i )
{
detach();
return *( begin() + i );
}
const_reference operator[]( size_type i ) const
{
return *( begin() + i );
}
reference front()
{
Q_ASSERT( !empty() );
detach();
return *begin();
}
const_reference front() const
{
Q_ASSERT( !empty() );
return *begin();
}
reference back()
{
Q_ASSERT( !empty() );
detach();
return *( end() - 1 );
}
const_reference back() const
{
Q_ASSERT( !empty() );
return *( end() - 1 );
}
void push_back( const T& x )
{
detach();
if ( sh->finish == sh->end ) {
sh->reserve( size()+size()/2+1 );
}
*sh->finish = x;
++sh->finish;
}
void pop_back()
{
detach();
if ( empty() )
return;
--sh->finish;
}
iterator insert( iterator pos, const T& x );
iterator insert( iterator pos, size_type n, const T& x );
void reserve( size_type n )
{
if ( capacity() < n ) {
detach();
sh->reserve( n );
}
}
void resize( size_type n, const T& val = T() )
{
if ( n < size() )
erase( begin() + n, end() );
else
insert( end(), n - size(), val );
}
void clear()
{
detach();
sh->clear();
}
iterator erase( iterator pos )
{
detach();
if ( pos + 1 != end() )
tqCopy( pos + 1, sh->finish, pos );
--sh->finish;
return pos;
}
iterator erase( iterator first, iterator last )
{
detach();
tqCopy( last, sh->finish, first );
sh->finish = sh->finish - ( last - first );
return first;
}
// ### remove in TQt 4.0
bool operator==( const TQValueVector<T>& x )
{
return size()==x.size() ? tqEqual( constBegin(), constEnd(), x.begin()) : FALSE;
}
bool operator==( const TQValueVector<T>& x ) const
{
return size()==x.size() ? tqEqual( begin(), end(), x.begin() ) : FALSE;
}
typedef T ValueType;
typedef ValueType *Iterator;
typedef const ValueType *ConstIterator;
size_type count() const { return size(); }
bool isEmpty() const { return empty(); }
reference first() { return front(); }
const_reference first() const { return front(); }
reference last() { return back(); }
const_reference last() const { return back(); }
void append( const T& x ) { push_back( x ); }
protected:
void detach()
{
if ( sh->count > 1 ) { detachInternal(); }
}
void detachInternal();
TQValueVectorPrivate<T>* sh;
private:
friend class TQDeepCopy< TQValueVector<T> >;
};
template <class T>
Q_INLINE_TEMPLATES TQValueVector<T>::TQValueVector( size_type n, const T& val )
{
sh = new TQValueVectorPrivate<T>( n );
tqFill( begin(), end(), val );
}
template <class T>
Q_INLINE_TEMPLATES void TQValueVector<T>::detachInternal()
{
sh->deref();
sh = new TQValueVectorPrivate<T>( *sh );
}
template <class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQValueVector<T>::iterator TQValueVector<T>::insert( iterator pos, const T& x )
{
size_type offset = pos - sh->start;
detach();
if ( pos == end() ) {
if ( sh->finish == sh->end )
push_back( x );
else {
*sh->finish = x;
++sh->finish;
}
} else {
if ( sh->finish == sh->end ) {
sh->insert( pos, x );
} else {
*sh->finish = *(sh->finish - 1);
++sh->finish;
tqCopyBackward( pos, sh->finish - 2, sh->finish - 1 );
*pos = x;
}
}
return begin() + offset;
}
template <class T>
Q_INLINE_TEMPLATES Q_TYPENAME TQValueVector<T>::iterator TQValueVector<T>::insert( iterator pos, size_type n, const T& x )
{
if ( n != 0 ) {
size_type offset = pos - sh->start;
detach();
pos = begin() + offset;
sh->insert( pos, n, x );
}
return pos;
}
#ifndef QT_NO_DATASTREAM
template<class T>
Q_INLINE_TEMPLATES TQDataStream& operator>>( TQDataStream& s, TQValueVector<T>& v )
{
v.clear();
Q_UINT32 c;
s >> c;
v.resize( c );
for( Q_UINT32 i = 0; i < c; ++i )
{
T t;
s >> t;
v[i] = t;
}
return s;
}
template<class T>
Q_INLINE_TEMPLATES TQDataStream& operator<<( TQDataStream& s, const TQValueVector<T>& v )
{
s << (Q_UINT32)v.size();
// ### use typename TQValueVector<T>::const_iterator once all supported
// ### compilers know about the 'typename' keyword.
const T* it = v.begin();
for( ; it != v.end(); ++it )
s << *it;
return s;
}
#endif // QT_NO_DATASTREAM
#define Q_DEFINED_QVALUEVECTOR
#include "ntqwinexport.h"
#endif // TQVALUEVECTOR_H
</pre>
<!-- eof -->
<p><address><hr><div align=center>
<table width=100% cellspacing=0 border=0><tr>
<td>Copyright © 2007
<a href="troll.html">Trolltech</a><td align=center><a href="trademarks.html">Trademarks</a>
<td align=right><div align=right>TQt 3.3.8</div>
</table></div></address></body>
</html>
|
