OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2011 Google Inc. | 2 * Copyright 2011 Google Inc. |
3 * | 3 * |
4 * Use of this source code is governed by a BSD-style license that can be | 4 * Use of this source code is governed by a BSD-style license that can be |
5 * found in the LICENSE file. | 5 * found in the LICENSE file. |
6 */ | 6 */ |
7 | 7 |
8 #include "SkRandom.h" | 8 #include "SkRandom.h" |
9 #include "SkTSort.h" | 9 #include "SkTSort.h" |
10 #include "Test.h" | 10 #include "Test.h" |
11 | 11 |
| 12 #include <stdlib.h> |
| 13 |
12 extern "C" { | 14 extern "C" { |
13 static int compare_int(const void* a, const void* b) { | 15 static int compare_int(const void* a, const void* b) { |
14 return *(const int*)a - *(const int*)b; | 16 return *(const int*)a - *(const int*)b; |
15 } | 17 } |
16 } | 18 } |
17 | 19 |
18 static void rand_array(SkRandom& rand, int array[], int n) { | 20 static void rand_array(SkRandom& rand, int array[], int n) { |
19 for (int j = 0; j < n; j++) { | 21 for (int j = 0; j < n; j++) { |
20 array[j] = rand.nextS() & 0xFF; | 22 array[j] = rand.nextS() & 0xFF; |
21 } | 23 } |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
53 SkTHeapSort<int>(workingArray, count); | 55 SkTHeapSort<int>(workingArray, count); |
54 check_sort(reporter, "Heap", workingArray, sortedArray, count); | 56 check_sort(reporter, "Heap", workingArray, sortedArray, count); |
55 | 57 |
56 memcpy(workingArray, randomArray, sizeof(randomArray)); | 58 memcpy(workingArray, randomArray, sizeof(randomArray)); |
57 SkTQSort<int>(workingArray, workingArray + count - 1); | 59 SkTQSort<int>(workingArray, workingArray + count - 1); |
58 check_sort(reporter, "Quick", workingArray, sortedArray, count); | 60 check_sort(reporter, "Quick", workingArray, sortedArray, count); |
59 } | 61 } |
60 } | 62 } |
61 | 63 |
62 // need tests for SkStrSearch | 64 // need tests for SkStrSearch |
OLD | NEW |