Hal Canary | 8751512 | 2019-03-15 14:22:51 -0400 | [diff] [blame] | 1 | // Copyright 2019 Google LLC. |
| 2 | // Use of this source code is governed by a BSD-style license that can be found in the LICENSE file. |
Mike Klein | c0bd9f9 | 2019-04-23 12:05:21 -0500 | [diff] [blame] | 3 | #include "tools/fiddle/examples.h" |
Hal Canary | 8751512 | 2019-03-15 14:22:51 -0400 | [diff] [blame] | 4 | // HASH=6c9688008cea8937ad5cc188b38ecf16 |
Hal Canary | a7181e7c | 2019-03-18 16:06:34 -0400 | [diff] [blame] | 5 | REG_FIDDLE(Path_Iter_setPath, 256, 256, true, 0) { |
Hal Canary | 8751512 | 2019-03-15 14:22:51 -0400 | [diff] [blame] | 6 | void draw(SkCanvas* canvas) { |
| 7 | auto debugster = [](const char* prefix, SkPath::Iter& iter) -> void { |
| 8 | SkDebugf("%s:\n", prefix); |
| 9 | const char* verbStr[] = { "Move", "Line", "Quad", "Conic", "Cubic", "Close", "Done" }; |
| 10 | const int pointCount[] = { 1 , 2 , 3 , 3 , 4 , 1 , 0 }; |
| 11 | SkPath::Verb verb; |
| 12 | do { |
| 13 | SkPoint points[4]; |
| 14 | verb = iter.next(points); |
| 15 | SkDebugf("k%s_Verb ", verbStr[(int) verb]); |
| 16 | for (int i = 0; i < pointCount[(int) verb]; ++i) { |
| 17 | SkDebugf("{%g, %g}, ", points[i].fX, points[i].fY); |
| 18 | } |
| 19 | if (SkPath::kConic_Verb == verb) { |
| 20 | SkDebugf("weight = %g", iter.conicWeight()); |
| 21 | } |
| 22 | SkDebugf("\n"); |
| 23 | } while (SkPath::kDone_Verb != verb); |
| 24 | SkDebugf("\n"); |
| 25 | }; |
| 26 | SkPath path; |
| 27 | path.quadTo(10, 20, 30, 40); |
| 28 | SkPath::Iter iter(path, false); |
| 29 | debugster("quad open", iter); |
| 30 | SkPath path2; |
| 31 | path2.conicTo(1, 2, 3, 4, .5f); |
| 32 | iter.setPath(path2, true); |
| 33 | debugster("conic closed", iter); |
| 34 | } |
| 35 | } // END FIDDLE |