blob: 2862fa920a2ff61ca3a1d802c424f9cdc514bb8a [file] [log] [blame]
 /* * Copyright 2011 Google Inc. * * Use of this source code is governed by a BSD-style license that can be * found in the LICENSE file. */ #include "include/utils/SkRandom.h" #include "src/core/SkTSort.h" #include "tests/Test.h" #include extern "C" { static int compare_int(const void* a, const void* b) { return *(const int*)a - *(const int*)b; } } static void rand_array(SkRandom& rand, int array[], int n) { for (int j = 0; j < n; j++) { array[j] = rand.nextS() & 0xFF; } } static void check_sort(skiatest::Reporter* reporter, const char label[], const int array[], const int reference[], int n) { for (int j = 0; j < n; ++j) { if (array[j] != reference[j]) { ERRORF(reporter, "%sSort [%d] failed %d %d", label, n, array[j], reference[j]); } } } DEF_TEST(Sort, reporter) { /** An array of random numbers to be sorted. */ int randomArray[500]; /** The reference sort of the random numbers. */ int sortedArray[std::size(randomArray)]; /** The random numbers are copied into this array, sorted by an SkSort, then this array is compared against the reference sort. */ int workingArray[std::size(randomArray)]; SkRandom rand; for (int i = 0; i < 10000; i++) { int count = rand.nextRangeU(1, std::size(randomArray)); rand_array(rand, randomArray, count); // Use qsort as the reference sort. memcpy(sortedArray, randomArray, sizeof(randomArray)); qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int); memcpy(workingArray, randomArray, sizeof(randomArray)); SkTHeapSort(workingArray, count); check_sort(reporter, "Heap", workingArray, sortedArray, count); memcpy(workingArray, randomArray, sizeof(randomArray)); SkTQSort(workingArray, workingArray + count); check_sort(reporter, "Quick", workingArray, sortedArray, count); } } // need tests for SkStrSearch