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
|
/****************************************************************************
**
** 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 test suite of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, 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.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#include <QtTest/QtTest>
#include <qvector.h>
//TESTED_CLASS=
//TESTED_FILES=corelib/tools/qregexp.h corelib/tools/qregexp.cpp
class tst_QVector : public QObject
{
Q_OBJECT
public:
tst_QVector() {}
virtual ~tst_QVector() {}
private slots:
void constructors() const;
void append() const;
void at() const;
void capacity() const;
void clear() const;
void constData() const;
void contains() const;
void count() const;
void data() const;
void empty() const;
void endsWith() const;
void fill() const;
void first() const;
void fromList() const;
void fromStdVector() const;
void indexOf() const;
void insert() const;
void isEmpty() const;
void last() const;
void lastIndexOf() const;
void mid() const;
void prepend() const;
void remove() const;
void size() const;
void startsWith() const;
void swap() const;
void toList() const;
void toStdVector() const;
void value() const;
void testOperators() const;
void outOfMemory();
void QTBUG6416_reserve();
void initializeList();
};
void tst_QVector::constructors() const
{
// pre-reserve capacity
{
QVector<int> myvec(5);
QVERIFY(myvec.capacity() == 5);
}
// default-initialise items
{
QVector<int> myvec(5, 42);
QVERIFY(myvec.capacity() == 5);
// make sure all items are initialised ok
foreach (int meaningoflife, myvec) {
QCOMPARE(meaningoflife, 42);
}
}
}
void tst_QVector::append() const
{
QVector<int> myvec;
myvec.append(42);
myvec.append(43);
myvec.append(44);
QVERIFY(myvec.size() == 3);
QCOMPARE(myvec, QVector<int>() << 42 << 43 << 44);
}
void tst_QVector::at() const
{
QVector<QString> myvec;
myvec << "foo" << "bar" << "baz";
QVERIFY(myvec.size() == 3);
QCOMPARE(myvec.at(0), QLatin1String("foo"));
QCOMPARE(myvec.at(1), QLatin1String("bar"));
QCOMPARE(myvec.at(2), QLatin1String("baz"));
// append an item
myvec << "hello";
QVERIFY(myvec.size() == 4);
QCOMPARE(myvec.at(0), QLatin1String("foo"));
QCOMPARE(myvec.at(1), QLatin1String("bar"));
QCOMPARE(myvec.at(2), QLatin1String("baz"));
QCOMPARE(myvec.at(3), QLatin1String("hello"));
// remove an item
myvec.remove(1);
QVERIFY(myvec.size() == 3);
QCOMPARE(myvec.at(0), QLatin1String("foo"));
QCOMPARE(myvec.at(1), QLatin1String("baz"));
QCOMPARE(myvec.at(2), QLatin1String("hello"));
}
void tst_QVector::capacity() const
{
QVector<QString> myvec;
// TODO: is this guarenteed? seems a safe assumption, but I suppose preallocation of a
// few items isn't an entirely unforseeable possibility.
QVERIFY(myvec.capacity() == 0);
// test it gets a size
myvec << "aaa" << "bbb" << "ccc";
QVERIFY(myvec.capacity() >= 3);
// make sure it grows ok
myvec << "aaa" << "bbb" << "ccc";
QVERIFY(myvec.capacity() >= 6);
// let's try squeeze a bit
myvec.remove(3);
myvec.remove(3);
myvec.remove(3);
// TODO: is this a safe assumption? presumably it won't release memory until shrink(), but can we asser that is true?
QVERIFY(myvec.capacity() >= 6);
myvec.squeeze();
QVERIFY(myvec.capacity() >= 3);
myvec.remove(0);
myvec.remove(0);
myvec.remove(0);
// TODO: as above note
QVERIFY(myvec.capacity() >= 3);
myvec.squeeze();
QVERIFY(myvec.capacity() == 0);
}
void tst_QVector::clear() const
{
QVector<QString> myvec;
myvec << "aaa" << "bbb" << "ccc";
QVERIFY(myvec.size() == 3);
myvec.clear();
QVERIFY(myvec.size() == 0);
QVERIFY(myvec.capacity() == 0);
}
void tst_QVector::constData() const
{
int arr[] = { 42, 43, 44 };
QVector<int> myvec;
myvec << 42 << 43 << 44;
QVERIFY(memcmp(myvec.constData(), reinterpret_cast<const int *>(&arr), sizeof(int) * 3) == 0);
}
void tst_QVector::contains() const
{
QVector<QString> myvec;
myvec << "aaa" << "bbb" << "ccc";
QVERIFY(myvec.contains(QLatin1String("aaa")));
QVERIFY(myvec.contains(QLatin1String("bbb")));
QVERIFY(myvec.contains(QLatin1String("ccc")));
QVERIFY(!myvec.contains(QLatin1String("I don't exist")));
// add it and make sure it does :)
myvec.append(QLatin1String("I don't exist"));
QVERIFY(myvec.contains(QLatin1String("I don't exist")));
}
void tst_QVector::count() const
{
// total size
{
// zero size
QVector<int> myvec;
QVERIFY(myvec.count() == 0);
// grow
myvec.append(42);
QVERIFY(myvec.count() == 1);
myvec.append(42);
QVERIFY(myvec.count() == 2);
// shrink
myvec.remove(0);
QVERIFY(myvec.count() == 1);
myvec.remove(0);
QVERIFY(myvec.count() == 0);
}
// count of items
{
QVector<QString> myvec;
myvec << "aaa" << "bbb" << "ccc";
// initial tests
QVERIFY(myvec.count(QLatin1String("aaa")) == 1);
QVERIFY(myvec.count(QLatin1String("pirates")) == 0);
// grow
myvec.append(QLatin1String("aaa"));
QVERIFY(myvec.count(QLatin1String("aaa")) == 2);
// shrink
myvec.remove(0);
QVERIFY(myvec.count(QLatin1String("aaa")) == 1);
}
}
void tst_QVector::data() const
{
QVector<int> myvec;
myvec << 42 << 43 << 44;
// make sure it starts off ok
QCOMPARE(*(myvec.data() + 1), 43);
// alter it
*(myvec.data() + 1) = 69;
// check it altered
QCOMPARE(*(myvec.data() + 1), 69);
int arr[] = { 42, 69, 44 };
QVERIFY(memcmp(myvec.data(), reinterpret_cast<int *>(&arr), sizeof(int) * 3) == 0);
}
void tst_QVector::empty() const
{
QVector<int> myvec;
// starts empty
QVERIFY(myvec.empty());
// not empty
myvec.append(1);
QVERIFY(!myvec.empty());
// empty again
myvec.remove(0);
QVERIFY(myvec.empty());
}
void tst_QVector::endsWith() const
{
QVector<int> myvec;
// empty vector
QVERIFY(!myvec.endsWith(1));
// add the one, should work
myvec.append(1);
QVERIFY(myvec.endsWith(1));
// add something else, fails now
myvec.append(3);
QVERIFY(!myvec.endsWith(1));
// remove it again :)
myvec.remove(1);
QVERIFY(myvec.endsWith(1));
}
void tst_QVector::fill() const
{
QVector<int> myvec;
// resize
myvec.resize(5);
myvec.fill(69);
QCOMPARE(myvec, QVector<int>() << 69 << 69 << 69 << 69 << 69);
// make sure it can resize itself too
myvec.fill(42, 10);
QCOMPARE(myvec, QVector<int>() << 42 << 42 << 42 << 42 << 42 << 42 << 42 << 42 << 42 << 42);
}
void tst_QVector::first() const
{
QVector<int> myvec;
myvec << 69 << 42 << 3;
// test it starts ok
QCOMPARE(myvec.first(), 69);
// test removal changes
myvec.remove(0);
QCOMPARE(myvec.first(), 42);
// test prepend changes
myvec.prepend(23);
QCOMPARE(myvec.first(), 23);
}
void tst_QVector::fromList() const
{
QList<QString> list;
list << "aaa" << "bbb" << "ninjas" << "pirates";
QVector<QString> myvec;
myvec = QVector<QString>::fromList(list);
// test it worked ok
QCOMPARE(myvec, QVector<QString>() << "aaa" << "bbb" << "ninjas" << "pirates");
QCOMPARE(list, QList<QString>() << "aaa" << "bbb" << "ninjas" << "pirates");
}
void tst_QVector::fromStdVector() const
{
// stl = :(
std::vector<QString> svec;
svec.push_back(QLatin1String("aaa"));
svec.push_back(QLatin1String("bbb"));
svec.push_back(QLatin1String("ninjas"));
svec.push_back(QLatin1String("pirates"));
QVector<QString> myvec = QVector<QString>::fromStdVector(svec);
// test it converts ok
QCOMPARE(myvec, QVector<QString>() << "aaa" << "bbb" << "ninjas" << "pirates");
}
void tst_QVector::indexOf() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C" << "B" << "A";
QVERIFY(myvec.indexOf("B") == 1);
QVERIFY(myvec.indexOf("B", 1) == 1);
QVERIFY(myvec.indexOf("B", 2) == 3);
QVERIFY(myvec.indexOf("X") == -1);
QVERIFY(myvec.indexOf("X", 2) == -1);
// add an X
myvec << "X";
QVERIFY(myvec.indexOf("X") == 5);
QVERIFY(myvec.indexOf("X", 5) == 5);
QVERIFY(myvec.indexOf("X", 6) == -1);
// remove first A
myvec.remove(0);
QVERIFY(myvec.indexOf("A") == 3);
QVERIFY(myvec.indexOf("A", 3) == 3);
QVERIFY(myvec.indexOf("A", 4) == -1);
}
void tst_QVector::insert() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// first position
QCOMPARE(myvec.at(0), QLatin1String("A"));
myvec.insert(0, QLatin1String("X"));
QCOMPARE(myvec.at(0), QLatin1String("X"));
QCOMPARE(myvec.at(1), QLatin1String("A"));
// middle
myvec.insert(1, QLatin1String("Z"));
QCOMPARE(myvec.at(0), QLatin1String("X"));
QCOMPARE(myvec.at(1), QLatin1String("Z"));
QCOMPARE(myvec.at(2), QLatin1String("A"));
// end
myvec.insert(5, QLatin1String("T"));
QCOMPARE(myvec.at(5), QLatin1String("T"));
QCOMPARE(myvec.at(4), QLatin1String("C"));
// insert a lot of garbage in the middle
myvec.insert(2, 2, QLatin1String("infinity"));
QCOMPARE(myvec, QVector<QString>() << "X" << "Z" << "infinity" << "infinity"
<< "A" << "B" << "C" << "T");
}
void tst_QVector::isEmpty() const
{
QVector<QString> myvec;
// starts ok
QVERIFY(myvec.isEmpty());
// not empty now
myvec.append(QLatin1String("hello there"));
QVERIFY(!myvec.isEmpty());
// empty again
myvec.remove(0);
QVERIFY(myvec.isEmpty());
}
void tst_QVector::last() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// test starts ok
QCOMPARE(myvec.last(), QLatin1String("C"));
// test it changes ok
myvec.append(QLatin1String("X"));
QCOMPARE(myvec.last(), QLatin1String("X"));
// and remove again
myvec.remove(3);
QCOMPARE(myvec.last(), QLatin1String("C"));
}
void tst_QVector::lastIndexOf() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C" << "B" << "A";
QVERIFY(myvec.lastIndexOf("B") == 3);
QVERIFY(myvec.lastIndexOf("B", 2) == 1);
QVERIFY(myvec.lastIndexOf("X") == -1);
QVERIFY(myvec.lastIndexOf("X", 2) == -1);
// add an X
myvec << "X";
QVERIFY(myvec.lastIndexOf("X") == 5);
QVERIFY(myvec.lastIndexOf("X", 5) == 5);
QVERIFY(myvec.lastIndexOf("X", 3) == -1);
// remove first A
myvec.remove(0);
QVERIFY(myvec.lastIndexOf("A") == 3);
QVERIFY(myvec.lastIndexOf("A", 3) == 3);
QVERIFY(myvec.lastIndexOf("A", 2) == -1);
}
void tst_QVector::mid() const
{
QVector<QString> list;
list << "foo" << "bar" << "baz" << "bak" << "buck" << "hello" << "kitty";
QCOMPARE(list.mid(3, 3), QVector<QString>() << "bak" << "buck" << "hello");
QCOMPARE(list.mid(4), QVector<QString>() << "buck" << "hello" << "kitty");
}
void tst_QVector::prepend() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// starts ok
QVERIFY(myvec.size() == 3);
QCOMPARE(myvec.at(0), QLatin1String("A"));
// add something
myvec.prepend(QLatin1String("X"));
QCOMPARE(myvec.at(0), QLatin1String("X"));
QCOMPARE(myvec.at(1), QLatin1String("A"));
QVERIFY(myvec.size() == 4);
// something else
myvec.prepend(QLatin1String("Z"));
QCOMPARE(myvec.at(0), QLatin1String("Z"));
QCOMPARE(myvec.at(1), QLatin1String("X"));
QCOMPARE(myvec.at(2), QLatin1String("A"));
QVERIFY(myvec.size() == 5);
// clear and append to an empty vector
myvec.clear();
QVERIFY(myvec.size() == 0);
myvec.prepend(QLatin1String("ninjas"));
QVERIFY(myvec.size() == 1);
QCOMPARE(myvec.at(0), QLatin1String("ninjas"));
}
void tst_QVector::remove() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// remove middle
myvec.remove(1);
QCOMPARE(myvec, QVector<QString>() << "A" << "C");
// remove rest
myvec.remove(0, 2);
QCOMPARE(myvec, QVector<QString>());
}
// ::reserve() is really hard to think of tests for, so not doing it.
// ::resize() is tested in ::capacity().
void tst_QVector::size() const
{
// total size
{
// zero size
QVector<int> myvec;
QVERIFY(myvec.size() == 0);
// grow
myvec.append(42);
QVERIFY(myvec.size() == 1);
myvec.append(42);
QVERIFY(myvec.size() == 2);
// shrink
myvec.remove(0);
QVERIFY(myvec.size() == 1);
myvec.remove(0);
QVERIFY(myvec.size() == 0);
}
}
// ::squeeze() is tested in ::capacity().
void tst_QVector::startsWith() const
{
QVector<int> myvec;
// empty vector
QVERIFY(!myvec.startsWith(1));
// add the one, should work
myvec.prepend(1);
QVERIFY(myvec.startsWith(1));
// add something else, fails now
myvec.prepend(3);
QVERIFY(!myvec.startsWith(1));
// remove it again :)
myvec.remove(0);
QVERIFY(myvec.startsWith(1));
}
void tst_QVector::swap() const
{
QVector<int> v1, v2;
v1 << 1 << 2 << 3;
v2 << 4 << 5 << 6;
v1.swap(v2);
QCOMPARE(v1,QVector<int>() << 4 << 5 << 6);
QCOMPARE(v2,QVector<int>() << 1 << 2 << 3);
}
void tst_QVector::toList() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// make sure it converts and doesn't modify the original vector
QCOMPARE(myvec.toList(), QList<QString>() << "A" << "B" << "C");
QCOMPARE(myvec, QVector<QString>() << "A" << "B" << "C");
}
void tst_QVector::toStdVector() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
std::vector<QString> svec = myvec.toStdVector();
QCOMPARE(svec.at(0), QLatin1String("A"));
QCOMPARE(svec.at(1), QLatin1String("B"));
QCOMPARE(svec.at(2), QLatin1String("C"));
QCOMPARE(myvec, QVector<QString>() << "A" << "B" << "C");
}
void tst_QVector::value() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
// valid calls
QCOMPARE(myvec.value(0), QLatin1String("A"));
QCOMPARE(myvec.value(1), QLatin1String("B"));
QCOMPARE(myvec.value(2), QLatin1String("C"));
// default calls
QCOMPARE(myvec.value(-1), QString());
QCOMPARE(myvec.value(3), QString());
// test calls with a provided default, valid calls
QCOMPARE(myvec.value(0, QLatin1String("default")), QLatin1String("A"));
QCOMPARE(myvec.value(1, QLatin1String("default")), QLatin1String("B"));
QCOMPARE(myvec.value(2, QLatin1String("default")), QLatin1String("C"));
// test calls with a provided default that will return the default
QCOMPARE(myvec.value(-1, QLatin1String("default")), QLatin1String("default"));
QCOMPARE(myvec.value(3, QLatin1String("default")), QLatin1String("default"));
}
void tst_QVector::testOperators() const
{
QVector<QString> myvec;
myvec << "A" << "B" << "C";
QVector<QString> myvectwo;
myvectwo << "D" << "E" << "F";
QVector<QString> combined;
combined << "A" << "B" << "C" << "D" << "E" << "F";
// !=
QVERIFY(myvec != myvectwo);
// +
QCOMPARE(myvec + myvectwo, combined);
QCOMPARE(myvec, QVector<QString>() << "A" << "B" << "C");
QCOMPARE(myvectwo, QVector<QString>() << "D" << "E" << "F");
// +=
myvec += myvectwo;
QCOMPARE(myvec, combined);
// ==
QVERIFY(myvec == combined);
// []
QCOMPARE(myvec[0], QLatin1String("A"));
QCOMPARE(myvec[1], QLatin1String("B"));
QCOMPARE(myvec[2], QLatin1String("C"));
QCOMPARE(myvec[3], QLatin1String("D"));
QCOMPARE(myvec[4], QLatin1String("E"));
QCOMPARE(myvec[5], QLatin1String("F"));
}
int fooCtor;
int fooDtor;
struct Foo
{
int *p;
Foo() { p = new int; ++fooCtor; }
Foo(const Foo &other) { Q_UNUSED(other); p = new int; ++fooCtor; }
void operator=(const Foo & /* other */) { }
~Foo() { delete p; ++fooDtor; }
};
void tst_QVector::outOfMemory()
{
fooCtor = 0;
fooDtor = 0;
const int N = 0x7fffffff / sizeof(Foo);
{
QVector<Foo> a;
QSKIP("This test crashes on many of our machines.", SkipSingle);
a.resize(N);
if (a.size() == N) {
QVERIFY(a.capacity() >= N);
QCOMPARE(fooCtor, N);
QCOMPARE(fooDtor, 0);
for (int i = 0; i < N; i += 35000)
a[i] = Foo();
} else {
// this is the case we're actually testing
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(fooCtor, 0);
QCOMPARE(fooDtor, 0);
a.resize(5);
QCOMPARE(a.size(), 5);
QVERIFY(a.capacity() >= 5);
QCOMPARE(fooCtor, 5);
QCOMPARE(fooDtor, 0);
const int Prealloc = a.capacity();
a.resize(Prealloc + 1);
QCOMPARE(a.size(), Prealloc + 1);
QVERIFY(a.capacity() >= Prealloc + 1);
QCOMPARE(fooCtor, Prealloc + 6);
QCOMPARE(fooDtor, 5);
a.resize(0x10000000);
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(fooCtor, Prealloc + 6);
QCOMPARE(fooDtor, Prealloc + 6);
}
}
fooCtor = 0;
fooDtor = 0;
{
QVector<Foo> a(N);
if (a.size() == N) {
QVERIFY(a.capacity() >= N);
QCOMPARE(fooCtor, N);
QCOMPARE(fooDtor, 0);
for (int i = 0; i < N; i += 35000)
a[i] = Foo();
} else {
// this is the case we're actually testing
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(fooCtor, 0);
QCOMPARE(fooDtor, 0);
}
}
Foo foo;
fooCtor = 0;
fooDtor = 0;
{
QVector<Foo> a(N, foo);
if (a.size() == N) {
QVERIFY(a.capacity() >= N);
QCOMPARE(fooCtor, N);
QCOMPARE(fooDtor, 0);
for (int i = 0; i < N; i += 35000)
a[i] = Foo();
} else {
// this is the case we're actually testing
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(fooCtor, 0);
QCOMPARE(fooDtor, 0);
}
}
fooCtor = 0;
fooDtor = 0;
{
QVector<Foo> a;
a.resize(10);
QCOMPARE(fooCtor, 10);
QCOMPARE(fooDtor, 0);
QVector<Foo> b(a);
QCOMPARE(fooCtor, 10);
QCOMPARE(fooDtor, 0);
a.resize(N);
if (a.size() == N) {
QCOMPARE(fooCtor, N + 10);
} else {
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(fooCtor, 10);
QCOMPARE(fooDtor, 0);
QCOMPARE(b.size(), 10);
QVERIFY(b.capacity() >= 10);
}
}
{
QVector<int> a;
a.resize(10);
QVector<int> b(a);
a.resize(N);
if (a.size() == N) {
for (int i = 0; i < N; i += 60000)
a[i] = i;
} else {
QCOMPARE(a.size(), 0);
QCOMPARE(a.capacity(), 0);
QCOMPARE(b.size(), 10);
QVERIFY(b.capacity() >= 10);
}
b.resize(N - 1);
if (b.size() == N - 1) {
for (int i = 0; i < N - 1; i += 60000)
b[i] = i;
} else {
QCOMPARE(b.size(), 0);
QCOMPARE(b.capacity(), 0);
}
}
}
void tst_QVector::QTBUG6416_reserve()
{
fooCtor = 0;
fooDtor = 0;
{
QVector<Foo> a;
a.resize(2);
QVector<Foo> b(a);
b.reserve(1);
}
QCOMPARE(fooCtor, fooDtor);
}
void tst_QVector::initializeList()
{
#ifdef Q_COMPILER_INITIALIZER_LISTS
QVector<int> v1{2,3,4};
QCOMPARE(v1, QVector<int>() << 2 << 3 << 4);
QCOMPARE(v1, (QVector<int>{2,3,4}));
QVector<QVector<int>> v2{ v1, {1}, QVector<int>(), {2,3,4} };
QVector<QVector<int>> v3;
v3 << v1 << (QVector<int>() << 1) << QVector<int>() << v1;
QCOMPARE(v3, v2);
#endif
}
QTEST_APPLESS_MAIN(tst_QVector)
#include "tst_qvector.moc"
|