SortBench.cpp File Reference

#include "bench/Benchmark.h"
#include "include/core/SkString.h"
#include "include/private/base/SkTemplates.h"
#include "src/base/SkRandom.h"
#include "src/base/SkTSort.h"
#include <algorithm>
#include <stdlib.h>

Go to the source code of this file.

Classes
class	SortBench

Typedefs
typedef void(*	SortProc) (int array[N])

Enumerations
enum	Type {   kRand , kRandN , kFore , kBack ,   kSame }
enum	SortType { kSKQSort , kSKHeap , kQSort , kStdSort }

Functions
static void	rand_proc (int array[N])
static void	randN_proc (int array[N])
static void	forward_proc (int array[N])
static void	backward_proc (int array[N])
static void	same_proc (int array[N])
static void	skqsort_sort (int array[N])
static void	skheap_sort (int array[N])
static int	int_compare (const void *a, const void *b)
static void	qsort_sort (int array[N])
static void	stdsort_sort (int array[N])
static Benchmark *	NewSkQSort (Type t)
static Benchmark *	NewSkHeap (Type t)
static Benchmark *	NewQSort (Type t)
static Benchmark *	NewStdSort (Type t)

Variables
static const int	N = 1000
struct {
const char *   fName
SortProc   fProc
}	gRec []
struct {
const char *   fName
SortProc   fProc
}	gSorts []

Typedef Documentation

SortProc

typedef void(* SortProc) (int array[N])

Definition at line 54 of file SortBench.cpp.

Enumeration Type Documentation

SortType

enum SortType

Enumerator
kSKQSort
kSKHeap
kQSort
kStdSort

Definition at line 95 of file SortBench.cpp.

              {
    kSKQSort, kSKHeap, kQSort, kStdSort,
};

Type

enum Type

Enumerator
kRand
kRandN
kFore
kBack
kSame

Definition at line 56 of file SortBench.cpp.

          {
    kRand, kRandN, kFore, kBack, kSame
};

Function Documentation

backward_proc()

static void backward_proc ( int  array[N] )

static

Definition at line 42 of file SortBench.cpp.

                                        {
    for (int i = 0; i < N; ++i) {
        array[i] = -i;
    }
}

forward_proc()

static void forward_proc ( int  array[N] )

static

Definition at line 36 of file SortBench.cpp.

                                       {
    for (int i = 0; i < N; ++i) {
        array[i] = i;
    }
}

int_compare()

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

static

Definition at line 80 of file SortBench.cpp.

                                                         {
        const int ai = *(const int*)a;
        const int bi = *(const int*)b;
        return ai < bi ? -1 : (ai > bi);
    }

NewQSort()

static Benchmark * NewQSort ( Type  t )

static

Definition at line 160 of file SortBench.cpp.

                                   {
    return new SortBench(t, kQSort);
}

NewSkHeap()

static Benchmark * NewSkHeap ( Type  t )

static

Definition at line 157 of file SortBench.cpp.

                                    {
    return new SortBench(t, kSKHeap);
}

NewSkQSort()

static Benchmark * NewSkQSort ( Type  t )

static

Definition at line 154 of file SortBench.cpp.

                                     {
    return new SortBench(t, kSKQSort);
}

NewStdSort()

static Benchmark * NewStdSort ( Type  t )

static

Definition at line 163 of file SortBench.cpp.

                                     {
    return new SortBench(t, kStdSort);
}

qsort_sort()

static void qsort_sort ( int  array[N] )

static

Definition at line 87 of file SortBench.cpp.

                                     {
    qsort(array, N, sizeof(int), int_compare);
}

rand_proc()

static void rand_proc ( int  array[N] )

static

Definition at line 21 of file SortBench.cpp.

                                    {
    SkRandom rand;
    for (int i = 0; i < N; ++i) {
        array[i] = rand.nextS();
    }
}

randN_proc()

static void randN_proc ( int  array[N] )

static

Definition at line 28 of file SortBench.cpp.

                                     {
    SkRandom rand;
    int mod = N / 10;
    for (int i = 0; i < N; ++i) {
        array[i] = rand.nextU() % mod;
    }
}

same_proc()

static void same_proc ( int  array[N] )

static

Definition at line 48 of file SortBench.cpp.

                                    {
    for (int i = 0; i < N; ++i) {
        array[i] = N;
    }
}

skheap_sort()

static void skheap_sort ( int  array[N] )

static

Definition at line 75 of file SortBench.cpp.

                                      {
    SkTHeapSort<int>(array, N);
}

skqsort_sort()

static void skqsort_sort ( int  array[N] )

static

Definition at line 71 of file SortBench.cpp.

                                       {
    SkTQSort<int>(array, array + N);
}

stdsort_sort()

static void stdsort_sort ( int  array[N] )

static

Definition at line 91 of file SortBench.cpp.

                                       {
    std::sort(array, array+N);
}

Variable Documentation

fName

const char* fName

Definition at line 61 of file SortBench.cpp.

fProc

SortProc fProc

Definition at line 62 of file SortBench.cpp.

const struct { ... } gRec[]

Initial value:

= {
    { "rand", rand_proc },
    { "rand10", randN_proc },
    { "forward", forward_proc },
    { "backward", backward_proc },
    { "repeated", same_proc },
}

const struct { ... } gSorts[]

Initial value:

= {
    { "skqsort", skqsort_sort },
    { "skheap",   skheap_sort },
    { "qsort",     qsort_sort },
    { "stdsort", stdsort_sort },
}

N

const int N = 1000

static

Definition at line 19 of file SortBench.cpp.