OLD | NEW |
1 /* | 1 /* |
2 * Copyright 2013 Google Inc. | 2 * Copyright 2013 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 "Test.h" | |
9 #include "SkRandom.h" | 8 #include "SkRandom.h" |
10 #include "SkTSort.h" | 9 #include "SkTSort.h" |
| 10 #include "Test.h" |
11 | 11 |
12 static bool anderson_darling_test(double p[32]) { | 12 static bool anderson_darling_test(double p[32]) { |
13 // Min and max Anderson-Darling values allowable for k=32 | 13 // Min and max Anderson-Darling values allowable for k=32 |
14 const double kADMin32 = 0.202; // p-value of ~0.1 | 14 const double kADMin32 = 0.202; // p-value of ~0.1 |
15 const double kADMax32 = 3.89; // p-value of ~0.99 | 15 const double kADMax32 = 3.89; // p-value of ~0.99 |
16 | 16 |
17 // sort p values | 17 // sort p values |
18 SkTQSort<double>(p, p + 31); | 18 SkTQSort<double>(p, p + 31); |
19 | 19 |
20 // and compute Anderson-Darling statistic to ensure these are uniform | 20 // and compute Anderson-Darling statistic to ensure these are uniform |
(...skipping 162 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
183 test_random_byte(reporter, 8); | 183 test_random_byte(reporter, 8); |
184 test_random_byte(reporter, 16); | 184 test_random_byte(reporter, 16); |
185 test_random_byte(reporter, 24); | 185 test_random_byte(reporter, 24); |
186 | 186 |
187 test_random_float(reporter); | 187 test_random_float(reporter); |
188 | 188 |
189 test_gorilla(reporter); | 189 test_gorilla(reporter); |
190 | 190 |
191 test_range(reporter); | 191 test_range(reporter); |
192 } | 192 } |
OLD | NEW |