119 lines
3.9 KiB
C++
119 lines
3.9 KiB
C++
/*
|
|
* 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 }
|
|
}
|
|
|
|
namespace {
|
|
SkTArray<int>* make() {
|
|
typedef SkTArray<int> IntArray;
|
|
return SkNEW(IntArray);
|
|
}
|
|
|
|
template <int N> SkTArray<int>* make_s() {
|
|
typedef SkSTArray<N, int> IntArray;
|
|
return SkNEW(IntArray);
|
|
}
|
|
}
|
|
|
|
static void test_swap(skiatest::Reporter* reporter) {
|
|
typedef SkTArray<int>* (*ArrayMaker)();
|
|
ArrayMaker arrayMakers[] = {make, make_s<5>, make_s<10>, make_s<20>};
|
|
static int kSizes[] = {0, 1, 5, 10, 15, 20, 25};
|
|
for (size_t arrayA = 0; arrayA < SK_ARRAY_COUNT(arrayMakers); ++arrayA) {
|
|
for (size_t arrayB = arrayA; arrayB < SK_ARRAY_COUNT(arrayMakers); ++arrayB) {
|
|
for (size_t dataSizeA = 0; dataSizeA < SK_ARRAY_COUNT(kSizes); ++dataSizeA) {
|
|
for (size_t dataSizeB = 0; dataSizeB < SK_ARRAY_COUNT(kSizes); ++dataSizeB) {
|
|
int curr = 0;
|
|
SkTArray<int>* a = arrayMakers[arrayA]();
|
|
SkTArray<int>* b = arrayMakers[arrayB]();
|
|
for (int i = 0; i < kSizes[dataSizeA]; ++i) {
|
|
a->push_back(curr++);
|
|
}
|
|
for (int i = 0; i < kSizes[dataSizeB]; ++i) {
|
|
b->push_back(curr++);
|
|
}
|
|
a->swap(b);
|
|
REPORTER_ASSERT(reporter, kSizes[dataSizeA] == b->count());
|
|
REPORTER_ASSERT(reporter, kSizes[dataSizeB] == a->count());
|
|
curr = 0;
|
|
for (int i = 0; i < kSizes[dataSizeA]; ++i) {
|
|
REPORTER_ASSERT(reporter, curr++ == (*b)[i]);
|
|
}
|
|
for (int i = 0; i < kSizes[dataSizeB]; ++i) {
|
|
REPORTER_ASSERT(reporter, curr++ == (*a)[i]);
|
|
}
|
|
SkDELETE(b);
|
|
|
|
a->swap(a);
|
|
curr = kSizes[dataSizeA];
|
|
for (int i = 0; i < kSizes[dataSizeB]; ++i) {
|
|
REPORTER_ASSERT(reporter, curr++ == (*a)[i]);
|
|
}
|
|
SkDELETE(a);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
DEF_TEST(TArray, reporter) {
|
|
TestTSet_basic<true>(reporter);
|
|
TestTSet_basic<false>(reporter);
|
|
test_swap(reporter);
|
|
}
|