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
|
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the QtQuick3D module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include "qarray.h"
#include <limits.h>
QT_BEGIN_NAMESPACE
/*!
\class QArray
\brief The QArray class is a template class that provides a dynamic array of simple types.
\since 4.8
\ingroup qt3d
\ingroup qt3d::arrays
QArray is similar to QVector except that it has much less overhead
when constructing large arrays by appending individual elements
one by one.
QArray instances have a preallocated data area for quickly
building small arrays on the stack without malloc overhead.
Once the array grows beyond the preallocated size, it is copied
to the heap. The size of the preallocated area, which defaults to 8,
can be specified with the second template parameter:
\code
QArray<QVector3D, 32> array;
\endcode
QArray uses implicit sharing and copy-on-write semantics to support
passing large arrays around an application with little overhead.
QArray is heavily optimized for copy-on-write and the case of
constructing an array by calling append(). It has a slight
performance penalty for random access using the non-const
version of operator[]().
*/
/*!
\fn QArray::QArray()
Constructs an empty array.
\sa reserve()
*/
/*!
\fn QArray::QArray(int size, const T &value)
Constructs an array of \a size elements, all initialized
to \a value.
\sa fill()
*/
/*!
\fn QArray::QArray(int size)
Constructs an array of \a size elements, all initialized
to their default-constructed values.
*/
/*!
\fn QArray::QArray(const T *values, int size)
Constructs an array of \a size elements, initialized
from \a values.
*/
/*!
\fn QArray::QArray(const QArray<T, PreallocSize> &other)
Constructs a copy of \a other.
\sa operator=()
*/
/*!
\fn QArray::~QArray()
Destroys the array.
*/
/*!
\fn QArray<T, PreallocSize> &QArray::operator=(const QArray<T, PreallocSize> &other)
Assigns \a other to this array and returns a reference
to this array.
*/
/*!
\fn int QArray::size() const
Returns the number of elements in this array.
\sa resize(), capacity(), isEmpty()
*/
/*!
\fn int QArray::count() const
\overload
Same as size(), provided for convenience.
*/
/*!
\fn int QArray::capacity() const
Returns the number of elements that can be stored in this
array before reallocation.
\sa reserve(), size()
*/
/*!
\fn bool QArray::isEmpty() const
Returns true if this array is empty; false otherwise.
\sa size(), clear()
*/
/*!
\fn bool QArray::isDetached() const
\internal
Returns true if this array has definitely been detached from all
other shared copies of the data; false otherwise.
It is possible for this function to return false if the
array was previously shared but no longer is. It is thus
an indication that a detach() will probably be required.
This function can be used to determine if functions that
write to this array such as append(), replace(),
and data(), will need to make a copy.
Raw data arrays that are created with fromRawData() are
never detached.
\sa detach()
*/
/*!
\fn void QArray::detach()
\internal
Detaches this array from all other shared copies of the data.
\sa isDetached()
*/
/*!
\fn void QArray::clear()
Clears all elements from this array and sets the size to zero.
This function will deallocate any memory that is used on the heap
to store the array's elements. To reuse the same memory
as before, call resize() with an argument of zero.
\sa resize(), isEmpty()
*/
/*!
\fn const T &QArray::at(int index) const
Returns the item at position \a index in the array.
\a index must be a valid index position in the array (i.e., 0 <= \a
index < size()).
\sa operator[](), constData(), value()
*/
/*!
\fn T &QArray::operator[](int index)
Returns the item at position \a index as a modifiable reference.
\a index must be a valid index position in the vector (i.e., 0 <= \a index
< size()).
Note that using non-const operators can cause QArray
to do a deep copy.
\sa at(), value()
*/
/*!
\fn const T &QArray::operator[](int index) const
\overload
Same as at(\a index).
*/
/*!
\fn T QArray::value(int index) const
Returns the value at position \a index in the vector.
If the \a index is out of bounds, the function returns
a default-constructed value. If you are certain that
\a index is within bounds, you can use at() instead,
which is slightly faster.
\sa at(), operator[]()
*/
/*!
\fn T QArray::value(int index, const T &defaultValue) const
\overload
If the \a index is out of bounds, the function returns
\a defaultValue.
*/
/*!
\fn T *QArray::extend(int size)
Extends this array by \a size elements and returns a pointer
to the storage, which is not initialized. The pointer is only
valid until the array is reallocated or destroyed.
The append() or resize() functions are recommended if T is a
complex type, with extend() only used for simple types.
Because the storage is not initialized, the caller should use
the in-place new operator to set elements:
\code
QArray<QRegExp> array;
QRegExp *space = array.extend(1);
new (space) QRegExp(QLatin1String("exp"));
\endcode
\sa append(), resize()
*/
/*!
\fn void QArray::append(const T &value)
Appends \a value to this array.
\sa prepend(), insert()
*/
/*!
\fn void QArray::append(const T &value1, const T &value2)
\overload
Appends \a value1 and \a value2 to this array.
*/
/*!
\fn void QArray::append(const T &value1, const T &value2, const T &value3)
\overload
Appends \a value1, \a value2, and \a value3 to this array.
*/
/*!
\fn void QArray::append(const T &value1, const T &value2, const T &value3, const T &value4)
\overload
Appends \a value1, \a value2, \a value3, and \a value4 to this array.
*/
/*!
\fn void QArray::append(const T *values, int count)
Appends the \a count elements of \a values to this array.
*/
/*!
\fn void QArray::append(const QArray<T, PreallocSize> &other)
Appends the elements of \a other to this array.
*/
/*!
\fn void QArray::prepend(const T &value)
Prepends \a value to this array.
\sa append(), insert()
*/
/*!
\fn void QArray::insert(int index, const T &value)
Inserts \a value at position \a index in this array.
If \a index is 0, then \a value is prepended to the array.
If \a index is size(), then \a value is appended to the array.
\sa append(), prepend()
*/
/*!
\fn void QArray::insert(int index, int count, const T &value)
\overload
Inserts \a count copies of \a value at position \a index
in this array.
*/
/*!
\fn QArray::iterator QArray::insert(iterator before, int count, const T &value)
Inserts \a count copies of \a value in front of the item
pointed to by the iterator \a before. Returns an iterator
pointing at the first of the inserted items.
*/
/*!
\fn QArray::iterator QArray::insert(iterator before, const T &value)
\overload
Inserts \a value in front of the item pointed to by the
iterator \a before. Returns an iterator pointing at the
inserted item.
*/
/*!
\fn void QArray::replace(int index, const T &value)
Replaces the element at \a index with \a value.
\sa operator[](), remove()
*/
/*!
\fn void QArray::replace(int index, const T *values, int count)
\overload
Replaces the \a count elements of this array with the
contents of \a values, starting at \a index.
If (\a index + \a count) is larger than the current size of this
array, the array will be extended to that size.
\sa append()
*/
/*!
\fn void QArray::remove(int index)
\overload
Removes the element at position \a index in this array.
*/
/*!
\fn void QArray::remove(int index, int count)
Removes the \a count elements starting at position \a index
in this array. If \a index or \a count is out of range,
the set of removed elements will be truncated to those that
are in range.
*/
/*!
\fn QArray::iterator QArray::erase(iterator begin, iterator end)
\overload
Removes all the items from \a begin up to (but not including) \a
end. Returns an iterator to the same item that \a end referred to
before the call.
*/
/*!
\fn QArray::iterator QArray::erase(iterator pos)
Removes the item pointed to by the iterator \a pos from the
vector, and returns an iterator to the next item in the vector
(which may be end()).
\sa insert(), remove()
*/
/*!
\fn void QArray::removeFirst()
Removes the first element from this array. Does nothing if
the array is empty.
\sa remove(), removeLast()
*/
/*!
\fn void QArray::removeLast()
Removes the last element from this array. Does nothing if
the array is empty.
\sa remove(), removeFirst()
*/
/*!
\fn int QArray::indexOf(const T &value, int from) const
Returns the index position of the first occurrence of
\a value in the array, searching forward from index
position \a from. Returns -1 if no item matched.
If \a from is negative, then it indicates an index position
relative to the end of the array, -1 being the last index
position.
This function requires the value type T to have an implementation
of \c operator==().
\sa lastIndexOf(), contains()
*/
/*!
\fn int QArray::lastIndexOf(const T &value, int from) const
Returns the index position of the last occurrence of
\a value in the array, searching backward from index
position \a from. Returns -1 if no item matched.
If \a from is negative, then it indicates an index position
relative to the end of the array, -1 being the last index
position. The default for \a from is -1.
This function requires the value type T to have an implementation
of \c operator==().
\sa indexOf(), contains()
*/
/*!
\fn bool QArray::contains(const T &value) const
Returns true if the array contains an occurrence of \a value;
false otherwise.
This function requires the value type T to have an implementation
of \c operator==().
\sa indexOf(), count()
*/
/*!
\fn int QArray::count(const T &value) const
Returns the number of occurrences of \a value in the array.
This function requires the value type T to have an implementation
of \c operator==().
\sa contains(), indexOf()
*/
/*!
\fn void QArray::resize(int size)
Sets the size of the array to \a size. If \a size is greater
than the current size, elements are added to the end and are
initialized to a default-constructed value. If \a size is less
than the current size, elements are removed from the end.
\sa size(), reserve(), squeeze()
*/
/*!
\fn void QArray::reserve(int size)
Increases the capacity of this array to reserve space for
at least \a size elements. If the capacity is already larger
than \a size, this function does nothing; in particular, it does
not remove elements from the array like resize() does.
This function can be useful when you know how roughly many elements
will be appended ahead of time. Reserving the space once can avoid
unnecessary realloc operations later.
\sa capacity(), resize(), squeeze()
*/
/*!
\fn void QArray::squeeze()
Releases any memory not required to store the array's elements
by reducing its capacity() to size().
This function is intended for reclaiming memory in an
array that is being used over and over with different contents.
As elements are added to an array, it will be constantly
expanded in size. This function can realloc the array
to a smaller size to reclaim unused memory.
\sa reserve(), capacity()
*/
/*!
\fn QArray<T, PreallocSize> &QArray::fill(const T &value, int size)
Assigns \a value to all items in the array. If \a size is
different from -1 (the default), the array is resized to
\a size beforehand. Returns a reference to the array.
\sa resize()
*/
/*!
\fn void QArray::reverse()
Reverses the order of this array in place.
\sa reversed()
*/
/*!
\fn QArray<T, PreallocSize> QArray::reversed() const
Returns a copy of this array with elements in the reverse order.
\sa reverse()
*/
/*!
\fn QArray<T, PreallocSize> QArray::mid(int index, int length) const
Returns an array containing the \a length elements of
this array, starting at \a index. If \a length is less
than zero, or extends further than the end of the array, then all
elements extending from \a index to the end of the array will be
included in the return value.
\sa left(), right()
*/
/*!
\fn QArray<T, PreallocSize> QArray::left(int length) const;
Returns an array containing the first \a length
elements of this array. If \a length is less than zero,
or greater than size(), then all elements in this array will
be included in the return value.
\sa mid(), right()
*/
/*!
\fn QArray<T, PreallocSize> QArray::right(int length) const;
Returns an array containing the last \a length
elements of this array. If \a length is less than zero,
or greater than size(), then all elements in this array
will be included in the return value.
\sa mid(), left()
*/
/*!
\fn T *QArray::data()
Returns a pointer to the data stored in the array. The pointer
can be used to access and modify the items in the array.
The pointer remains valid as long as the array isn't
reallocated.
This function is mostly useful to pass an array to a function
that accepts a plain C++ array. It may make a deep copy of the
array's elements if the array is implicitly shared.
\sa constData(), operator[]()
*/
/*!
\fn const T *QArray::data() const
\overload
*/
/*!
\fn const T *QArray::constData() const
Returns a const pointer to the data stored in the array.
The pointer can be used to access the items in the array.
The pointer remains valid as long as the array isn't
reallocated.
This function is mostly useful to pass an array to a function
that accepts a plain C++ array.
\sa data(), operator[]()
*/
/*!
\fn QArray<T, PreallocSize> QArray::fromRawData(const T *data, int size)
Returns an array consisting of the \a size elements from \a data.
This function takes a reference to \a data, but does not copy
the elements until the array is modified. The memory at \a data
must remain valid until the returned array is destroyed
or modified.
Use append() instead of fromRawData() to force a copy to be made
of the elements at \a data when the array is created:
\code
// Makes a copy of the data immediately.
QArray<float> array;
array.append(data, size);
// Does not make a copy of the data until the array is modified.
QArray<float> array;
array = QArray<float>::fromRawData(data, size);
\endcode
\sa fromWritableRawData(), append()
*/
/*!
\fn QArray<T, PreallocSize> QArray::fromWritableRawData(T *data, int size)
Returns an array consisting of the \a size elements from \a data.
This function takes a reference to \a data, but does not copy
the elements until the array is reallocated to a larger size.
The memory at \a data must remain valid until the returned
array is destroyed or reallocated.
The elements of \a data will be modified in-place. This differs
from fromRawData() which will make a copy of the elements
of \a data when the array is modified.
If the returned array is resized to less than \a size,
then a copy will not be made, and append() can be used to
append new items up to \a size. Further calls to append()
after \a size will force the array to be reallocated.
If the returned array is resized to more than \a size,
then a copy of the data will be made and further modifications
will not affect the elements at \a data.
\sa fromRawData()
*/
/*!
\fn bool QArray::operator==(const QArray<T, PreallocSize> &other) const
Returns true if \a other is equal to this array; otherwise
returns false.
Two arrays are considered equal if they contain the same values
in the same order.
This function requires the value type to have an implementation
of \c operator==().
\sa operator!=()
*/
/*!
\fn bool QArray::operator!=(const QArray<T, PreallocSize> &other) const
Returns true if \a other is not equal to this array; otherwise
returns false.
Two arrays are considered equal if they contain the same values
in the same order.
This function requires the value type to have an implementation
of \c operator==().
\sa operator==()
*/
/*!
\fn QArray<T, PreallocSize> &QArray::operator+=(const T &value)
\overload
Appends \a value to this array and returns a reference to
this array.
\sa operator<<(), append()
*/
/*!
\fn QArray<T, PreallocSize> &QArray::operator+=(const QArray<T, PreallocSize> &other)
Appends the elements of the \a other array to this array
and returns a reference to this array.
\sa operator<<(), append()
*/
/*!
\fn QArray<T, PreallocSize> &QArray::operator<<(const T &value)
\overload
Appends \a value to this array and returns a reference to
this array.
\sa operator+=(), append()
*/
/*!
\fn QArray<T, PreallocSize> &QArray::operator<<(const QArray<T, PreallocSize> &other)
Appends the elements of the \a other array to this array
and returns a reference to this array.
\sa operator+=(), append()
*/
/*!
\typedef QArray::iterator
The QArray::iterator typedef provides an STL-style non-const
iterator for QArray. The iterator is simply a typedef
for "T *" (pointer to T).
\sa QArray::begin(), QArray::const_iterator
*/
/*!
\typedef QArray::const_iterator
The QArray::iterator typedef provides an STL-style const
iterator for QArray. The iterator is simply a typedef
for "const T *" (pointer to const T).
\sa QArray::constBegin(), QArray::iterator
*/
/*!
\typedef QArray::Iterator
Qt-style synonym for QArray::iterator.
*/
/*!
\typedef QArray::ConstIterator
Qt-style synonym for QArray::const_iterator.
*/
/*!
\typedef QArray::const_pointer
Typedef for const T *. Provided for STL compatibility.
*/
/*!
\typedef QArray::const_reference
Typedef for T &. Provided for STL compatibility.
*/
/*!
\typedef QArray::difference_type
Typedef for ptrdiff_t. Provided for STL compatibility.
*/
/*!
\typedef QArray::pointer
Typedef for T *. Provided for STL compatibility.
*/
/*!
\typedef QArray::reference
Typedef for T &. Provided for STL compatibility.
*/
/*!
\typedef QArray::size_type
Typedef for int. Provided for STL compatibility.
*/
/*!
\typedef QArray::value_type
Typedef for T. Provided for STL compatibility.
*/
/*!
\fn QArray::iterator QArray::begin()
Returns an STL-style iterator pointing to the first item
in the array.
\sa end(), constBegin(), QArray::iterator
*/
/*!
\fn QArray::const_iterator QArray::begin() const
\overload
*/
/*!
\fn QArray::const_iterator QArray::constBegin() const
Returns a const STL-style iterator pointing to the first item
in the array.
\sa constEnd(), begin(), QArray::const_iterator
*/
/*!
\fn QArray::iterator QArray::end()
Returns an STL-style iterator pointing to the imaginary item
after the last item in the array.
\sa begin(), constEnd(), QArray::iterator
*/
/*!
\fn QArray::const_iterator QArray::end() const
\overload
*/
/*!
\fn QArray::const_iterator QArray::constEnd() const
Returns a const STL-style iterator pointing to the imaginary item
after the last item in the array.
\sa constBegin(), end(), QArray::const_iterator
*/
/*!
\fn T &QArray::first()
Returns a reference to the first item in the array. This
function assumes that the array isn't empty.
\sa last(), isEmpty()
*/
/*!
\fn const T &QArray::first() const
\overload
*/
/*!
\fn T &QArray::last()
Returns a reference to the last item in the array. This function
assumes that the array isn't empty.
\sa first(), isEmpty()
*/
/*!
\fn const T &QArray::last() const
\overload
*/
/*!
\fn bool QArray::startsWith(const T &value) const
Returns true if this array is not empty and its first
item is equal to \a value; otherwise returns false.
\sa isEmpty(), first()
*/
/*!
\fn bool QArray::endsWith(const T &value) const
Returns true if this array is not empty and its last
item is equal to \a value; otherwise returns false.
\sa isEmpty(), last()
*/
/*!
\fn void QArray::push_back(const T &value)
This function is provided for STL compatibility. It is equivalent
to append(\a value).
*/
/*!
\fn void QArray::push_front(const T &value)
This function is provided for STL compatibility. It is equivalent
to prepend(\a value).
*/
/*!
\fn void QArray::pop_front()
This function is provided for STL compatibility. It is equivalent
to removeFirst().
*/
/*!
\fn void QArray::pop_back()
This function is provided for STL compatibility. It is equivalent
to removeLast().
*/
/*!
\fn QArray::reference QArray::front()
This function is provided for STL compatibility. It is equivalent
to first().
*/
/*!
\fn QArray::const_reference QArray::front() const
\overload
*/
/*!
\fn QArray::reference QArray::back()
This function is provided for STL compatibility. It is equivalent
to last().
*/
/*!
\fn QArray::const_reference QArray::back() const
\overload
*/
/*!
\fn bool QArray::empty() const
This function is provided for STL compatibility. It is equivalent
to isEmpty(), returning true if the array is empty; otherwise
returns false.
*/
#ifndef QT_NO_DATASTREAM
/*!
\fn QDataStream& operator<<(QDataStream& stream, const QArray<T, PreallocSize>& array)
\relates QArray
Writes \a array to the given \a stream and returns a reference
to the \a stream.
*/
/*!
\fn QDataStream& operator>>(QDataStream& stream, QArray<T, PreallocSize>& array)
\relates QArray
Reads \a array from the given \a stream and returns a reference
to the \a stream.
*/
#endif
int qArrayAllocMore(int alloc, int extra, int sizeOfT)
{
if (alloc == 0 && extra == 0)
return 0;
const int page = 1 << 12;
int nalloc;
alloc += extra;
alloc *= sizeOfT;
// don't do anything if the loop will overflow signed int.
if (alloc >= INT_MAX/2)
return INT_MAX / sizeOfT;
nalloc = (alloc < page) ? 64 : page;
while (nalloc < alloc) {
if (nalloc <= 0)
return INT_MAX / sizeOfT;
nalloc *= 2;
}
return nalloc / sizeOfT;
}
QT_END_NAMESPACE
|