forked from Floorp-Projects/Floorp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTestTArray2.cpp
1169 lines (955 loc) · 31.8 KB
/
TestTArray2.cpp
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
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim:set ts=2 sw=2 sts=2 et cindent: */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include "mozilla/ArrayUtils.h"
#include "mozilla/Unused.h"
#include <stdlib.h>
#include <stdio.h>
#include <iostream>
#include "nsTArray.h"
#include "nsAutoPtr.h"
#include "nsString.h"
#include "nsDirectoryServiceDefs.h"
#include "nsDirectoryServiceUtils.h"
#include "nsComponentManagerUtils.h"
#include "nsXPCOM.h"
#include "nsIFile.h"
#include "gtest/gtest.h"
using namespace mozilla;
namespace TestTArray {
// Define this so we can use test_basic_array in test_comptr_array
template <class T>
inline bool operator<(const nsCOMPtr<T>& lhs, const nsCOMPtr<T>& rhs) {
return lhs.get() < rhs.get();
}
//----
template <class ElementType>
static bool test_basic_array(ElementType* data, size_t dataLen,
const ElementType& extra) {
nsTArray<ElementType> ary;
const nsTArray<ElementType>& cary = ary;
ary.AppendElements(data, dataLen);
if (ary.Length() != dataLen) {
return false;
}
if (!(ary == ary)) {
return false;
}
size_t i;
for (i = 0; i < ary.Length(); ++i) {
if (ary[i] != data[i]) return false;
}
for (i = 0; i < ary.Length(); ++i) {
if (ary.SafeElementAt(i, extra) != data[i]) return false;
}
if (ary.SafeElementAt(ary.Length(), extra) != extra ||
ary.SafeElementAt(ary.Length() * 10, extra) != extra)
return false;
// ensure sort results in ascending order
ary.Sort();
size_t j = 0, k = ary.IndexOfFirstElementGt(extra);
if (k != 0 && ary[k - 1] == extra) return false;
for (i = 0; i < ary.Length(); ++i) {
k = ary.IndexOfFirstElementGt(ary[i]);
if (k == 0 || ary[k - 1] != ary[i]) return false;
if (k < j) return false;
j = k;
}
for (i = ary.Length(); --i;) {
if (ary[i] < ary[i - 1]) return false;
if (ary[i] == ary[i - 1]) ary.RemoveElementAt(i);
}
if (!(ary == ary)) {
return false;
}
for (i = 0; i < ary.Length(); ++i) {
if (ary.BinaryIndexOf(ary[i]) != i) return false;
}
if (ary.BinaryIndexOf(extra) != ary.NoIndex) return false;
size_t oldLen = ary.Length();
ary.RemoveElement(data[dataLen / 2]);
if (ary.Length() != (oldLen - 1)) return false;
if (!(ary == ary)) return false;
if (ary.ApplyIf(
extra, []() { return true; }, []() { return false; }))
return false;
if (ary.ApplyIf(
extra, [](size_t) { return true; }, []() { return false; }))
return false;
// On a non-const array, ApplyIf's first lambda may use either const or non-
// const element types.
if (ary.ApplyIf(
extra, [](ElementType&) { return true; }, []() { return false; }))
return false;
if (ary.ApplyIf(
extra, [](const ElementType&) { return true; },
[]() { return false; }))
return false;
if (ary.ApplyIf(
extra, [](size_t, ElementType&) { return true; },
[]() { return false; }))
return false;
if (ary.ApplyIf(
extra, [](size_t, const ElementType&) { return true; },
[]() { return false; }))
return false;
if (cary.ApplyIf(
extra, []() { return true; }, []() { return false; }))
if (cary.ApplyIf(
extra, [](size_t) { return true; }, []() { return false; }))
// On a const array, ApplyIf's first lambda must only use const element
// types.
if (cary.ApplyIf(
extra, [](const ElementType&) { return true; },
[]() { return false; }))
if (cary.ApplyIf(
extra, [](size_t, const ElementType&) { return true; },
[]() { return false; }))
return false;
size_t index = ary.Length() / 2;
if (!ary.InsertElementAt(index, extra)) return false;
if (!(ary == ary)) return false;
if (ary[index] != extra) return false;
if (ary.IndexOf(extra) == ary.NoIndex) return false;
if (ary.LastIndexOf(extra) == ary.NoIndex) return false;
// ensure proper searching
if (ary.IndexOf(extra) > ary.LastIndexOf(extra)) return false;
if (ary.IndexOf(extra, index) != ary.LastIndexOf(extra, index)) return false;
if (!ary.ApplyIf(
extra,
[&](size_t i, const ElementType& e) {
return i == index && e == extra;
},
[]() { return false; }))
return false;
if (!cary.ApplyIf(
extra,
[&](size_t i, const ElementType& e) {
return i == index && e == extra;
},
[]() { return false; }))
return false;
nsTArray<ElementType> copy(ary);
if (!(ary == copy)) return false;
for (i = 0; i < copy.Length(); ++i) {
if (ary[i] != copy[i]) return false;
}
if (!ary.AppendElements(copy)) return false;
size_t cap = ary.Capacity();
ary.RemoveElementsAt(copy.Length(), copy.Length());
ary.Compact();
if (ary.Capacity() == cap) return false;
ary.Clear();
if (ary.IndexOf(extra) != ary.NoIndex) return false;
if (ary.LastIndexOf(extra) != ary.NoIndex) return false;
if (ary.ApplyIf(
extra, []() { return true; }, []() { return false; }))
return false;
if (cary.ApplyIf(
extra, []() { return true; }, []() { return false; }))
return false;
ary.Clear();
if (!ary.IsEmpty() || ary.Elements() == nullptr) return false;
if (!(ary == nsTArray<ElementType>())) return false;
if (ary == copy) return false;
if (ary.SafeElementAt(0, extra) != extra ||
ary.SafeElementAt(10, extra) != extra)
return false;
ary = copy;
if (!(ary == copy)) return false;
for (i = 0; i < copy.Length(); ++i) {
if (ary[i] != copy[i]) return false;
}
if (!ary.InsertElementsAt(0, copy)) return false;
if (ary == copy) return false;
ary.RemoveElementsAt(0, copy.Length());
for (i = 0; i < copy.Length(); ++i) {
if (ary[i] != copy[i]) return false;
}
// These shouldn't crash!
nsTArray<ElementType> empty;
ary.AppendElements(reinterpret_cast<ElementType*>(0), 0);
ary.AppendElements(empty);
// See bug 324981
ary.RemoveElement(extra);
ary.RemoveElement(extra);
return true;
}
TEST(TArray, test_int_array)
{
int data[] = {4, 6, 8, 2, 4, 1, 5, 7, 3};
ASSERT_TRUE(test_basic_array(data, ArrayLength(data), int(14)));
}
TEST(TArray, test_int64_array)
{
int64_t data[] = {4, 6, 8, 2, 4, 1, 5, 7, 3};
ASSERT_TRUE(test_basic_array(data, ArrayLength(data), int64_t(14)));
}
TEST(TArray, test_char_array)
{
char data[] = {4, 6, 8, 2, 4, 1, 5, 7, 3};
ASSERT_TRUE(test_basic_array(data, ArrayLength(data), char(14)));
}
TEST(TArray, test_uint32_array)
{
uint32_t data[] = {4, 6, 8, 2, 4, 1, 5, 7, 3};
ASSERT_TRUE(test_basic_array(data, ArrayLength(data), uint32_t(14)));
}
//----
class Object {
public:
Object() : mNum(0) {}
Object(const char* str, uint32_t num) : mStr(str), mNum(num) {}
Object(const Object& other) : mStr(other.mStr), mNum(other.mNum) {}
~Object() {}
Object& operator=(const Object& other) {
mStr = other.mStr;
mNum = other.mNum;
return *this;
}
bool operator==(const Object& other) const {
return mStr == other.mStr && mNum == other.mNum;
}
bool operator<(const Object& other) const {
// sort based on mStr only
return mStr.Compare(other.mStr.get()) < 0;
}
const char* Str() const { return mStr.get(); }
uint32_t Num() const { return mNum; }
private:
nsCString mStr;
uint32_t mNum;
};
TEST(TArray, test_object_array)
{
nsTArray<Object> objArray;
const char kdata[] = "hello world";
size_t i;
for (i = 0; i < ArrayLength(kdata); ++i) {
char x[] = {kdata[i], '\0'};
ASSERT_TRUE(objArray.AppendElement(Object(x, i)));
}
for (i = 0; i < ArrayLength(kdata); ++i) {
ASSERT_EQ(objArray[i].Str()[0], kdata[i]);
ASSERT_EQ(objArray[i].Num(), i);
}
objArray.Sort();
const char ksorted[] = "\0 dehllloorw";
for (i = 0; i < ArrayLength(kdata) - 1; ++i) {
ASSERT_EQ(objArray[i].Str()[0], ksorted[i]);
}
}
class Countable {
static int sCount;
public:
Countable() { sCount++; }
Countable(const Countable& aOther) { sCount++; }
static int Count() { return sCount; }
};
class Moveable {
static int sCount;
public:
Moveable() { sCount++; }
Moveable(const Moveable& aOther) { sCount++; }
Moveable(Moveable&& aOther) {
// Do not increment sCount
}
static int Count() { return sCount; }
};
/* static */
int Countable::sCount = 0;
/* static */
int Moveable::sCount = 0;
static nsTArray<int> returns_by_value() {
nsTArray<int> result;
return result;
}
TEST(TArray, test_return_by_value)
{
nsTArray<int> result = returns_by_value();
ASSERT_TRUE(true); // This is just a compilation test.
}
TEST(TArray, test_move_array)
{
nsTArray<Countable> countableArray;
uint32_t i;
for (i = 0; i < 4; ++i) {
ASSERT_TRUE(countableArray.AppendElement(Countable()));
}
ASSERT_EQ(Countable::Count(), 8);
const nsTArray<Countable>& constRefCountableArray = countableArray;
ASSERT_EQ(Countable::Count(), 8);
nsTArray<Countable> copyCountableArray(constRefCountableArray);
ASSERT_EQ(Countable::Count(), 12);
nsTArray<Countable>&& moveRefCountableArray = std::move(countableArray);
moveRefCountableArray.Length(); // Make compilers happy.
ASSERT_EQ(Countable::Count(), 12);
nsTArray<Countable> movedCountableArray(std::move(countableArray));
ASSERT_EQ(Countable::Count(), 12);
// Test ctor
FallibleTArray<Countable> differentAllocatorCountableArray(
std::move(copyCountableArray));
// operator=
copyCountableArray = std::move(differentAllocatorCountableArray);
differentAllocatorCountableArray = std::move(copyCountableArray);
// And the other ctor
nsTArray<Countable> copyCountableArray2(
std::move(differentAllocatorCountableArray));
// with auto
AutoTArray<Countable, 3> autoCountableArray(std::move(copyCountableArray2));
// operator=
copyCountableArray2 = std::move(autoCountableArray);
// Mix with FallibleTArray
FallibleTArray<Countable> differentAllocatorCountableArray2(
std::move(copyCountableArray2));
AutoTArray<Countable, 4> autoCountableArray2(
std::move(differentAllocatorCountableArray2));
differentAllocatorCountableArray2 = std::move(autoCountableArray2);
ASSERT_EQ(Countable::Count(), 12);
nsTArray<Moveable> moveableArray;
for (i = 0; i < 4; ++i) {
ASSERT_TRUE(moveableArray.AppendElement(Moveable()));
}
ASSERT_EQ(Moveable::Count(), 4);
const nsTArray<Moveable>& constRefMoveableArray = moveableArray;
ASSERT_EQ(Moveable::Count(), 4);
nsTArray<Moveable> copyMoveableArray(constRefMoveableArray);
ASSERT_EQ(Moveable::Count(), 8);
nsTArray<Moveable>&& moveRefMoveableArray = std::move(moveableArray);
moveRefMoveableArray.Length(); // Make compilers happy.
ASSERT_EQ(Moveable::Count(), 8);
nsTArray<Moveable> movedMoveableArray(std::move(moveableArray));
ASSERT_EQ(Moveable::Count(), 8);
// Test ctor
FallibleTArray<Moveable> differentAllocatorMoveableArray(
std::move(copyMoveableArray));
// operator=
copyMoveableArray = std::move(differentAllocatorMoveableArray);
differentAllocatorMoveableArray = std::move(copyMoveableArray);
// And the other ctor
nsTArray<Moveable> copyMoveableArray2(
std::move(differentAllocatorMoveableArray));
// with auto
AutoTArray<Moveable, 3> autoMoveableArray(std::move(copyMoveableArray2));
// operator=
copyMoveableArray2 = std::move(autoMoveableArray);
// Mix with FallibleTArray
FallibleTArray<Moveable> differentAllocatorMoveableArray2(
std::move(copyMoveableArray2));
AutoTArray<Moveable, 4> autoMoveableArray2(
std::move(differentAllocatorMoveableArray2));
differentAllocatorMoveableArray2 = std::move(autoMoveableArray2);
ASSERT_EQ(Moveable::Count(), 8);
AutoTArray<Moveable, 8> moveableAutoArray;
for (uint32_t i = 0; i < 4; ++i) {
ASSERT_TRUE(moveableAutoArray.AppendElement(Moveable()));
}
ASSERT_EQ(Moveable::Count(), 12);
const AutoTArray<Moveable, 8>& constRefMoveableAutoArray = moveableAutoArray;
ASSERT_EQ(Moveable::Count(), 12);
AutoTArray<Moveable, 8> copyMoveableAutoArray(constRefMoveableAutoArray);
ASSERT_EQ(Moveable::Count(), 16);
AutoTArray<Moveable, 8> movedMoveableAutoArray(std::move(moveableAutoArray));
ASSERT_EQ(Moveable::Count(), 16);
}
//----
TEST(TArray, test_string_array)
{
nsTArray<nsCString> strArray;
const char kdata[] = "hello world";
size_t i;
for (i = 0; i < ArrayLength(kdata); ++i) {
nsCString str;
str.Assign(kdata[i]);
ASSERT_TRUE(strArray.AppendElement(str));
}
for (i = 0; i < ArrayLength(kdata); ++i) {
ASSERT_EQ(strArray[i].CharAt(0), kdata[i]);
}
const char kextra[] = "foo bar";
size_t oldLen = strArray.Length();
ASSERT_TRUE(strArray.AppendElement(kextra));
strArray.RemoveElement(kextra);
ASSERT_EQ(oldLen, strArray.Length());
ASSERT_EQ(strArray.IndexOf("e"), size_t(1));
ASSERT_TRUE(strArray.ApplyIf(
"e", [](size_t i, nsCString& s) { return i == 1 && s == "e"; },
[]() { return false; }));
strArray.Sort();
const char ksorted[] = "\0 dehllloorw";
for (i = ArrayLength(kdata); i--;) {
ASSERT_EQ(strArray[i].CharAt(0), ksorted[i]);
if (i > 0 && strArray[i] == strArray[i - 1]) strArray.RemoveElementAt(i);
}
for (i = 0; i < strArray.Length(); ++i) {
ASSERT_EQ(strArray.BinaryIndexOf(strArray[i]), i);
}
auto no_index = strArray.NoIndex; // Fixes gtest compilation error
ASSERT_EQ(strArray.BinaryIndexOf(EmptyCString()), no_index);
nsCString rawArray[MOZ_ARRAY_LENGTH(kdata) - 1];
for (i = 0; i < ArrayLength(rawArray); ++i)
rawArray[i].Assign(kdata + i); // substrings of kdata
ASSERT_TRUE(
test_basic_array(rawArray, ArrayLength(rawArray), nsCString("foopy")));
}
//----
typedef nsCOMPtr<nsIFile> FilePointer;
class nsFileNameComparator {
public:
bool Equals(const FilePointer& a, const char* b) const {
nsAutoCString name;
a->GetNativeLeafName(name);
return name.Equals(b);
}
};
TEST(TArray, test_comptr_array)
{
FilePointer tmpDir;
NS_GetSpecialDirectory(NS_OS_TEMP_DIR, getter_AddRefs(tmpDir));
ASSERT_TRUE(tmpDir);
const char* kNames[] = {"foo.txt", "bar.html", "baz.gif"};
nsTArray<FilePointer> fileArray;
size_t i;
for (i = 0; i < ArrayLength(kNames); ++i) {
FilePointer f;
tmpDir->Clone(getter_AddRefs(f));
ASSERT_TRUE(f);
ASSERT_FALSE(NS_FAILED(f->AppendNative(nsDependentCString(kNames[i]))));
fileArray.AppendElement(f);
}
ASSERT_EQ(fileArray.IndexOf(kNames[1], 0, nsFileNameComparator()), size_t(1));
ASSERT_TRUE(fileArray.ApplyIf(
kNames[1], 0, nsFileNameComparator(), [](size_t i) { return i == 1; },
[]() { return false; }));
// It's unclear what 'operator<' means for nsCOMPtr, but whatever...
ASSERT_TRUE(
test_basic_array(fileArray.Elements(), fileArray.Length(), tmpDir));
}
//----
class RefcountedObject {
public:
RefcountedObject() : rc(0) {}
void AddRef() { ++rc; }
void Release() {
if (--rc == 0) delete this;
}
~RefcountedObject() {}
private:
int32_t rc;
};
TEST(TArray, test_refptr_array)
{
nsTArray<RefPtr<RefcountedObject> > objArray;
RefcountedObject* a = new RefcountedObject();
a->AddRef();
RefcountedObject* b = new RefcountedObject();
b->AddRef();
RefcountedObject* c = new RefcountedObject();
c->AddRef();
objArray.AppendElement(a);
objArray.AppendElement(b);
objArray.AppendElement(c);
ASSERT_EQ(objArray.IndexOf(b), size_t(1));
ASSERT_TRUE(objArray.ApplyIf(
b,
[&](size_t i, RefPtr<RefcountedObject>& r) { return i == 1 && r == b; },
[]() { return false; }));
a->Release();
b->Release();
c->Release();
}
//----
TEST(TArray, test_ptrarray)
{
nsTArray<uint32_t*> ary;
ASSERT_EQ(ary.SafeElementAt(0), nullptr);
ASSERT_EQ(ary.SafeElementAt(1000), nullptr);
uint32_t a = 10;
ary.AppendElement(&a);
ASSERT_EQ(*ary[0], a);
ASSERT_EQ(*ary.SafeElementAt(0), a);
nsTArray<const uint32_t*> cary;
ASSERT_EQ(cary.SafeElementAt(0), nullptr);
ASSERT_EQ(cary.SafeElementAt(1000), nullptr);
const uint32_t b = 14;
cary.AppendElement(&a);
cary.AppendElement(&b);
ASSERT_EQ(*cary[0], a);
ASSERT_EQ(*cary[1], b);
ASSERT_EQ(*cary.SafeElementAt(0), a);
ASSERT_EQ(*cary.SafeElementAt(1), b);
}
//----
// This test relies too heavily on the existence of DebugGetHeader to be
// useful in non-debug builds.
#ifdef DEBUG
TEST(TArray, test_autoarray)
{
uint32_t data[] = {4, 6, 8, 2, 4, 1, 5, 7, 3};
AutoTArray<uint32_t, MOZ_ARRAY_LENGTH(data)> array;
void* hdr = array.DebugGetHeader();
ASSERT_NE(hdr, nsTArray<uint32_t>().DebugGetHeader());
ASSERT_NE(hdr,
(AutoTArray<uint32_t, MOZ_ARRAY_LENGTH(data)>().DebugGetHeader()));
array.AppendElement(1u);
ASSERT_EQ(hdr, array.DebugGetHeader());
array.RemoveElement(1u);
array.AppendElements(data, ArrayLength(data));
ASSERT_EQ(hdr, array.DebugGetHeader());
array.AppendElement(2u);
ASSERT_NE(hdr, array.DebugGetHeader());
array.Clear();
array.Compact();
ASSERT_EQ(hdr, array.DebugGetHeader());
array.AppendElements(data, ArrayLength(data));
ASSERT_EQ(hdr, array.DebugGetHeader());
nsTArray<uint32_t> array2;
void* emptyHdr = array2.DebugGetHeader();
array.SwapElements(array2);
ASSERT_NE(emptyHdr, array.DebugGetHeader());
ASSERT_NE(hdr, array2.DebugGetHeader());
size_t i;
for (i = 0; i < ArrayLength(data); ++i) {
ASSERT_EQ(array2[i], data[i]);
}
ASSERT_TRUE(array.IsEmpty());
array.Compact();
array.AppendElements(data, ArrayLength(data));
uint32_t data3[] = {5, 7, 11};
AutoTArray<uint32_t, MOZ_ARRAY_LENGTH(data3)> array3;
array3.AppendElements(data3, ArrayLength(data3));
array.SwapElements(array3);
for (i = 0; i < ArrayLength(data); ++i) {
ASSERT_EQ(array3[i], data[i]);
}
for (i = 0; i < ArrayLength(data3); ++i) {
ASSERT_EQ(array[i], data3[i]);
}
}
#endif
//----
// IndexOf used to potentially scan beyond the end of the array. Test for
// this incorrect behavior by adding a value (5), removing it, then seeing
// if IndexOf finds it.
TEST(TArray, test_indexof)
{
nsTArray<int> array;
array.AppendElement(0);
// add and remove the 5
array.AppendElement(5);
array.RemoveElementAt(1);
// we should not find the 5!
auto no_index = array.NoIndex; // Fixes gtest compilation error.
ASSERT_EQ(array.IndexOf(5, 1), no_index);
ASSERT_FALSE(array.ApplyIf(
5, 1, []() { return true; }, []() { return false; }));
}
//----
template <class Array>
static bool is_heap(const Array& ary, size_t len) {
size_t index = 1;
while (index < len) {
if (ary[index] > ary[(index - 1) >> 1]) return false;
index++;
}
return true;
}
//----
// An array |arr| is using its auto buffer if |&arr < arr.Elements()| and
// |arr.Elements() - &arr| is small.
#define IS_USING_AUTO(arr) \
((uintptr_t) & (arr) < (uintptr_t)arr.Elements() && \
((ptrdiff_t)arr.Elements() - (ptrdiff_t)&arr) <= 16)
#define CHECK_IS_USING_AUTO(arr) \
do { \
ASSERT_TRUE(IS_USING_AUTO(arr)); \
} while (0)
#define CHECK_NOT_USING_AUTO(arr) \
do { \
ASSERT_FALSE(IS_USING_AUTO(arr)); \
} while (0)
#define CHECK_USES_SHARED_EMPTY_HDR(arr) \
do { \
nsTArray<int> _empty; \
ASSERT_EQ(_empty.Elements(), arr.Elements()); \
} while (0)
#define CHECK_EQ_INT(actual, expected) \
do { \
ASSERT_EQ((actual), (expected)); \
} while (0)
#define CHECK_ARRAY(arr, data) \
do { \
CHECK_EQ_INT((arr).Length(), (size_t)ArrayLength(data)); \
for (size_t _i = 0; _i < ArrayLength(data); _i++) { \
CHECK_EQ_INT((arr)[_i], (data)[_i]); \
} \
} while (0)
TEST(TArray, test_swap)
{
// Test nsTArray::SwapElements. Unfortunately there are many cases.
int data1[] = {8, 6, 7, 5};
int data2[] = {3, 0, 9};
// Swap two auto arrays.
{
AutoTArray<int, 8> a;
AutoTArray<int, 6> b;
a.AppendElements(data1, ArrayLength(data1));
b.AppendElements(data2, ArrayLength(data2));
CHECK_IS_USING_AUTO(a);
CHECK_IS_USING_AUTO(b);
a.SwapElements(b);
CHECK_IS_USING_AUTO(a);
CHECK_IS_USING_AUTO(b);
CHECK_ARRAY(a, data2);
CHECK_ARRAY(b, data1);
}
// Swap two auto arrays -- one whose data lives on the heap, the other whose
// data lives on the stack -- which each fits into the other's auto storage.
{
AutoTArray<int, 3> a;
AutoTArray<int, 3> b;
a.AppendElements(data1, ArrayLength(data1));
a.RemoveElementAt(3);
b.AppendElements(data2, ArrayLength(data2));
// Here and elsewhere, we assert that if we start with an auto array
// capable of storing N elements, we store N+1 elements into the array, and
// then we remove one element, that array is still not using its auto
// buffer.
//
// This isn't at all required by the TArray API. It would be fine if, when
// we shrink back to N elements, the TArray frees its heap storage and goes
// back to using its stack storage. But we assert here as a check that the
// test does what we expect. If the TArray implementation changes, just
// change the failing assertions.
CHECK_NOT_USING_AUTO(a);
// This check had better not change, though.
CHECK_IS_USING_AUTO(b);
a.SwapElements(b);
CHECK_IS_USING_AUTO(b);
CHECK_ARRAY(a, data2);
int expectedB[] = {8, 6, 7};
CHECK_ARRAY(b, expectedB);
}
// Swap two auto arrays which are using heap storage such that one fits into
// the other's auto storage, but the other needs to stay on the heap.
{
AutoTArray<int, 3> a;
AutoTArray<int, 2> b;
a.AppendElements(data1, ArrayLength(data1));
a.RemoveElementAt(3);
b.AppendElements(data2, ArrayLength(data2));
b.RemoveElementAt(2);
CHECK_NOT_USING_AUTO(a);
CHECK_NOT_USING_AUTO(b);
a.SwapElements(b);
CHECK_NOT_USING_AUTO(b);
int expected1[] = {3, 0};
int expected2[] = {8, 6, 7};
CHECK_ARRAY(a, expected1);
CHECK_ARRAY(b, expected2);
}
// Swap two arrays, neither of which fits into the other's auto-storage.
{
AutoTArray<int, 1> a;
AutoTArray<int, 3> b;
a.AppendElements(data1, ArrayLength(data1));
b.AppendElements(data2, ArrayLength(data2));
a.SwapElements(b);
CHECK_ARRAY(a, data2);
CHECK_ARRAY(b, data1);
}
// Swap an empty nsTArray with a non-empty AutoTArray.
{
nsTArray<int> a;
AutoTArray<int, 3> b;
b.AppendElements(data2, ArrayLength(data2));
CHECK_IS_USING_AUTO(b);
a.SwapElements(b);
CHECK_ARRAY(a, data2);
CHECK_EQ_INT(b.Length(), size_t(0));
CHECK_IS_USING_AUTO(b);
}
// Swap two big auto arrays.
{
const unsigned size = 8192;
AutoTArray<unsigned, size> a;
AutoTArray<unsigned, size> b;
for (unsigned i = 0; i < size; i++) {
a.AppendElement(i);
b.AppendElement(i + 1);
}
CHECK_IS_USING_AUTO(a);
CHECK_IS_USING_AUTO(b);
a.SwapElements(b);
CHECK_IS_USING_AUTO(a);
CHECK_IS_USING_AUTO(b);
CHECK_EQ_INT(a.Length(), size_t(size));
CHECK_EQ_INT(b.Length(), size_t(size));
for (unsigned i = 0; i < size; i++) {
CHECK_EQ_INT(a[i], i + 1);
CHECK_EQ_INT(b[i], i);
}
}
// Swap two arrays and make sure that their capacities don't increase
// unnecessarily.
{
nsTArray<int> a;
nsTArray<int> b;
b.AppendElements(data2, ArrayLength(data2));
CHECK_EQ_INT(a.Capacity(), size_t(0));
size_t bCapacity = b.Capacity();
a.SwapElements(b);
// Make sure that we didn't increase the capacity of either array.
CHECK_ARRAY(a, data2);
CHECK_EQ_INT(b.Length(), size_t(0));
CHECK_EQ_INT(b.Capacity(), size_t(0));
CHECK_EQ_INT(a.Capacity(), bCapacity);
}
// Swap an auto array with a TArray, then clear the auto array and make sure
// it doesn't forget the fact that it has an auto buffer.
{
nsTArray<int> a;
AutoTArray<int, 3> b;
a.AppendElements(data1, ArrayLength(data1));
a.SwapElements(b);
CHECK_EQ_INT(a.Length(), size_t(0));
CHECK_ARRAY(b, data1);
b.Clear();
CHECK_USES_SHARED_EMPTY_HDR(a);
CHECK_IS_USING_AUTO(b);
}
// Same thing as the previous test, but with more auto arrays.
{
AutoTArray<int, 16> a;
AutoTArray<int, 3> b;
a.AppendElements(data1, ArrayLength(data1));
a.SwapElements(b);
CHECK_EQ_INT(a.Length(), size_t(0));
CHECK_ARRAY(b, data1);
b.Clear();
CHECK_IS_USING_AUTO(a);
CHECK_IS_USING_AUTO(b);
}
// Swap an empty nsTArray and an empty AutoTArray.
{
AutoTArray<int, 8> a;
nsTArray<int> b;
a.SwapElements(b);
CHECK_IS_USING_AUTO(a);
CHECK_NOT_USING_AUTO(b);
CHECK_EQ_INT(a.Length(), size_t(0));
CHECK_EQ_INT(b.Length(), size_t(0));
}
// Swap empty auto array with non-empty AutoTArray using malloc'ed storage.
// I promise, all these tests have a point.
{
AutoTArray<int, 2> a;
AutoTArray<int, 1> b;
a.AppendElements(data1, ArrayLength(data1));
a.SwapElements(b);
CHECK_IS_USING_AUTO(a);
CHECK_NOT_USING_AUTO(b);
CHECK_ARRAY(b, data1);
CHECK_EQ_INT(a.Length(), size_t(0));
}
}
// Bug 1171296: Disabled on andoid due to crashes.
#if !defined(ANDROID)
TEST(TArray, test_fallible)
{
// Test that FallibleTArray works properly; that is, it never OOMs, but
// instead eventually returns false.
//
// This test is only meaningful on 32-bit systems. On a 64-bit system, we
// might never OOM.
if (sizeof(void*) > 4) {
ASSERT_TRUE(true);
return;
}
// Allocate a bunch of 128MB arrays. Larger allocations will fail on some
// platforms without actually hitting OOM.
//
// 36 * 128MB > 4GB, so we should definitely OOM by the 36th array.
const unsigned numArrays = 36;
FallibleTArray<char> arrays[numArrays];
bool oomed = false;
for (size_t i = 0; i < numArrays; i++) {
// SetCapacity allocates the requested capacity + a header, and we want to
// avoid allocating more than 128MB overall because of the size padding it
// will cause, which depends on allocator behavior, so use 128MB - an
// arbitrary size larger than the array header, so that chances are good
// that allocations will always be 128MB.
bool success = arrays[i].SetCapacity(128 * 1024 * 1024 - 1024, fallible);
if (!success) {
// We got our OOM. Check that it didn't come too early.
oomed = true;
# ifdef XP_WIN
// 32-bit Windows sometimes OOMs on the 6th, 7th, or 8th. To keep the
// test green, choose the lower of those: the important thing here is
// that some allocations fail and some succeed. We're not too
// concerned about how many iterations it takes.
const size_t kOOMIterations = 6;
# else
const size_t kOOMIterations = 8;
# endif
ASSERT_GE(i, kOOMIterations)
<< "Got OOM on iteration " << i << ". Too early!";
}
}
ASSERT_TRUE(oomed)
<< "Didn't OOM or crash? nsTArray::SetCapacity"
"must be lying.";
}
#endif
TEST(TArray, test_conversion_operator)
{
FallibleTArray<int> f;
const FallibleTArray<int> fconst;
InfallibleTArray<int> i;
const InfallibleTArray<int> iconst;
nsTArray<int> t;
const nsTArray<int> tconst;
AutoTArray<int, 8> tauto;
const AutoTArray<int, 8> tautoconst;