SortTest.cpp File Reference

#include "src/base/SkRandom.h"
#include "src/base/SkTSort.h"
#include "tests/Test.h"
#include <cstdlib>
#include <cstring>
#include <string>

Go to the source code of this file.

Functions
static int	compare_int (const void *a, const void *b)
static void	rand_array (SkRandom &rand, int array[], int n)
static void	check_sort (skiatest::Reporter *reporter, const char label[], const int array[], const int reference[], int n)
	DEF_TEST (Sort, reporter)

Function Documentation

check_sort()

static void check_sort ( skiatest::Reporter *  reporter, const char  label[], const int  array[], const int  reference[], int  n  )

static

Definition at line 28 of file SortTest.cpp.

                                                                        {
    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]);
        }
    }
}

compare_int()

static int compare_int ( const void *  a, const void *  b  )

static

Definition at line 17 of file SortTest.cpp.

                                                         {
        return *(const int*)a - *(const int*)b;
    }

DEF_TEST()

DEF_TEST	(	Sort	,
		reporter
	)

An array of random numbers to be sorted.

The reference sort of the random numbers.

The random numbers are copied into this array, sorted by an SkSort, then this array is compared against the reference sort.

Definition at line 38 of file SortTest.cpp.

                         {
    /** 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<int>(workingArray, count);
        check_sort(reporter, "Heap", workingArray, sortedArray, count);
 
        memcpy(workingArray, randomArray, sizeof(randomArray));
        SkTQSort<int>(workingArray, workingArray + count);
        check_sort(reporter, "Quick", workingArray, sortedArray, count);
    }
}

rand_array()

static void rand_array ( SkRandom &  rand, int  array[], int  n  )

static

Definition at line 22 of file SortTest.cpp.

                                                           {
    for (int j = 0; j < n; j++) {
        array[j] = rand.nextS() & 0xFF;
    }
}