| /* |
| * Copyright 2014 Google Inc. |
| * |
| * Use of this source code is governed by a BSD-style license that can be |
| * found in the LICENSE file. |
| */ |
| |
| #include "SkTArray.h" |
| #include "Test.h" |
| |
| // Tests the SkTArray<T> class template. |
| |
| template <bool MEM_COPY> |
| static void TestTSet_basic(skiatest::Reporter* reporter) { |
| SkTArray<int, MEM_COPY> a; |
| |
| // Starts empty. |
| REPORTER_ASSERT(reporter, a.empty()); |
| REPORTER_ASSERT(reporter, a.count() == 0); |
| |
| // { }, add a default constructed element |
| a.push_back() = 0; |
| REPORTER_ASSERT(reporter, !a.empty()); |
| REPORTER_ASSERT(reporter, a.count() == 1); |
| |
| // { 0 }, removeShuffle the only element. |
| a.removeShuffle(0); |
| REPORTER_ASSERT(reporter, a.empty()); |
| REPORTER_ASSERT(reporter, a.count() == 0); |
| |
| // { }, add a default, add a 1, remove first |
| a.push_back() = 0; |
| REPORTER_ASSERT(reporter, a.push_back() = 1); |
| a.removeShuffle(0); |
| REPORTER_ASSERT(reporter, !a.empty()); |
| REPORTER_ASSERT(reporter, a.count() == 1); |
| REPORTER_ASSERT(reporter, a[0] == 1); |
| |
| // { 1 }, replace with new array |
| int b[5] = { 0, 1, 2, 3, 4 }; |
| a.reset(b, SK_ARRAY_COUNT(b)); |
| REPORTER_ASSERT(reporter, a.count() == SK_ARRAY_COUNT(b)); |
| REPORTER_ASSERT(reporter, a[2] == 2); |
| REPORTER_ASSERT(reporter, a[4] == 4); |
| |
| // { 0, 1, 2, 3, 4 }, removeShuffle the last |
| a.removeShuffle(4); |
| REPORTER_ASSERT(reporter, a.count() == SK_ARRAY_COUNT(b) - 1); |
| REPORTER_ASSERT(reporter, a[3] == 3); |
| |
| // { 0, 1, 2, 3 }, remove a middle, note shuffle |
| a.removeShuffle(1); |
| REPORTER_ASSERT(reporter, a.count() == SK_ARRAY_COUNT(b) - 2); |
| REPORTER_ASSERT(reporter, a[0] == 0); |
| REPORTER_ASSERT(reporter, a[1] == 3); |
| REPORTER_ASSERT(reporter, a[2] == 2); |
| |
| // {0, 3, 2 } |
| } |
| |
| static void test_swap(skiatest::Reporter* reporter) { |
| SkTArray<int> arr; |
| SkSTArray< 5, int> arr5; |
| SkSTArray<10, int> arr10; |
| SkSTArray<20, int> arr20; |
| |
| SkTArray<int>* arrays[] = { &arr, &arr5, &arr10, &arr20 }; |
| int sizes[] = {0, 1, 5, 10, 15, 20, 25}; |
| |
| for (auto a : arrays) { |
| for (auto b : arrays) { |
| if (a == b) { |
| continue; |
| } |
| |
| for (auto sizeA : sizes) { |
| for (auto sizeB : sizes) { |
| a->reset(); |
| b->reset(); |
| |
| int curr = 0; |
| for (int i = 0; i < sizeA; i++) { a->push_back(curr++); } |
| for (int i = 0; i < sizeB; i++) { b->push_back(curr++); } |
| |
| a->swap(b); |
| REPORTER_ASSERT(reporter, b->count() == sizeA); |
| REPORTER_ASSERT(reporter, a->count() == sizeB); |
| |
| curr = 0; |
| for (int x : *b) { REPORTER_ASSERT(reporter, x == curr++); } |
| for (int x : *a) { REPORTER_ASSERT(reporter, x == curr++); } |
| |
| a->swap(a); |
| curr = sizeA; |
| for (int x : *a) { REPORTER_ASSERT(reporter, x == curr++); } |
| }} |
| }} |
| } |
| |
| DEF_TEST(TArray, reporter) { |
| TestTSet_basic<true>(reporter); |
| TestTSet_basic<false>(reporter); |
| test_swap(reporter); |
| } |