Go to the source code of this file.
◆ SortProc
typedef void(* SortProc) (int array[N]) |
◆ SortType
Enumerator |
---|
kSKQSort | |
kSKHeap | |
kQSort | |
kStdSort | |
Definition at line 95 of file SortBench.cpp.
◆ Type
Enumerator |
---|
kRand | |
kRandN | |
kFore | |
kBack | |
kSame | |
Definition at line 56 of file SortBench.cpp.
◆ backward_proc()
static void backward_proc |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 42 of file SortBench.cpp.
42 {
43 for (
int i = 0; i <
N; ++i) {
44 array[i] = -i;
45 }
46}
◆ forward_proc()
static void forward_proc |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 36 of file SortBench.cpp.
36 {
37 for (
int i = 0; i <
N; ++i) {
38 array[i] = i;
39 }
40}
◆ int_compare()
static int int_compare |
( |
const void * |
a, |
|
|
const void * |
b |
|
) |
| |
|
static |
Definition at line 80 of file SortBench.cpp.
80 {
81 const int ai = *(
const int*)
a;
82 const int bi = *(
const int*)
b;
83 return ai < bi ? -1 : (ai > bi);
84 }
◆ NewQSort()
◆ NewSkHeap()
◆ NewSkQSort()
◆ NewStdSort()
◆ qsort_sort()
static void qsort_sort |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 87 of file SortBench.cpp.
87 {
89}
static int int_compare(const void *a, const void *b)
◆ rand_proc()
static void rand_proc |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 21 of file SortBench.cpp.
21 {
23 for (
int i = 0; i <
N; ++i) {
24 array[i] = rand.
nextS();
25 }
26}
◆ randN_proc()
static void randN_proc |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 28 of file SortBench.cpp.
28 {
31 for (
int i = 0; i <
N; ++i) {
32 array[i] = rand.
nextU() % mod;
33 }
34}
◆ same_proc()
static void same_proc |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 48 of file SortBench.cpp.
48 {
49 for (
int i = 0; i <
N; ++i) {
51 }
52}
◆ skheap_sort()
static void skheap_sort |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 75 of file SortBench.cpp.
75 {
76 SkTHeapSort<int>(array,
N);
77}
◆ skqsort_sort()
static void skqsort_sort |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 71 of file SortBench.cpp.
71 {
72 SkTQSort<int>(array, array +
N);
73}
◆ stdsort_sort()
static void stdsort_sort |
( |
int |
array[N] | ) |
|
|
static |
Definition at line 91 of file SortBench.cpp.
91 {
92 std::sort(array, array+
N);
93}
◆ fName
◆ fProc
◆ [struct]
const struct { ... } gRec[] |
Initial value:= {
}
static void randN_proc(int array[N])
static void backward_proc(int array[N])
static void rand_proc(int array[N])
static void same_proc(int array[N])
static void forward_proc(int array[N])
◆ [struct]
const struct { ... } gSorts[] |
Initial value:= {
}
static void qsort_sort(int array[N])
static void skheap_sort(int array[N])
static void stdsort_sort(int array[N])
static void skqsort_sort(int array[N])