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 "SkBitmap.h" | 8 #include "SkBitmap.h" |
10 #include "SkCanvas.h" | 9 #include "SkCanvas.h" |
11 #include "SkPathUtils.h" | 10 #include "SkPathUtils.h" |
12 #include "SkRandom.h" | 11 #include "SkRandom.h" |
13 #include "SkTime.h" | 12 #include "SkTime.h" |
| 13 #include "Test.h" |
14 | 14 |
15 const int kNumIt = 100; | 15 const int kNumIt = 100; |
16 | 16 |
17 static void fill_random_bits(int chars, char* bits){ | 17 static void fill_random_bits(int chars, char* bits){ |
18 SkRandom rand(SkTime::GetMSecs()); | 18 SkRandom rand(SkTime::GetMSecs()); |
19 | 19 |
20 for (int i = 0; i < chars; ++i){ | 20 for (int i = 0; i < chars; ++i){ |
21 bits[i] = rand.nextU(); | 21 bits[i] = rand.nextU(); |
22 } | 22 } |
23 } | 23 } |
(...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
145 for (unsigned int i = 0; i < SK_ARRAY_COUNT(w); ++i) { | 145 for (unsigned int i = 0; i < SK_ARRAY_COUNT(w); ++i) { |
146 // generate truth bitmap | 146 // generate truth bitmap |
147 SkBitmap bmpTruth; | 147 SkBitmap bmpTruth; |
148 binary_to_skbitmap(binBmp, &bmpTruth, w[i], h, rowBytes); | 148 binary_to_skbitmap(binBmp, &bmpTruth, w[i], h, rowBytes); |
149 | 149 |
150 test_path(reporter, &bmpTruth, binBmp, w[i], h, rowBytes); | 150 test_path(reporter, &bmpTruth, binBmp, w[i], h, rowBytes); |
151 test_region(reporter, &bmpTruth, binBmp, w[i], h, rowBytes); | 151 test_region(reporter, &bmpTruth, binBmp, w[i], h, rowBytes); |
152 } | 152 } |
153 } | 153 } |
154 } | 154 } |
OLD | NEW |