blob: b3898c349c351bea2d123d235cbf1b7185480335 [file] [log] [blame]
Hal Canary87515122019-03-15 14:22:51 -04001// 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 Kleinc0bd9f92019-04-23 12:05:21 -05003#include "tools/fiddle/examples.h"
Hal Canary87515122019-03-15 14:22:51 -04004// HASH=9bc86efda08cbcd9c6f7c5f220294a24
Hal Canarya7181e7c2019-03-18 16:06:34 -04005REG_FIDDLE(Path_getPoints, 256, 256, true, 0) {
Hal Canary87515122019-03-15 14:22:51 -04006void draw(SkCanvas* canvas) {
7 auto debugster = [](const char* prefix, const SkPath& path, SkPoint* points, int max) -> void {
8 int count = path.getPoints(points, max);
9 SkDebugf("%s point count: %d ", prefix, count);
Brian Osman788b9162020-02-07 10:36:46 -050010 for (int i = 0; i < std::min(count, max) && points; ++i) {
Hal Canary87515122019-03-15 14:22:51 -040011 SkDebugf("(%1.8g,%1.8g) ", points[i].fX, points[i].fY);
12 }
13 SkDebugf("\n");
14 };
15 SkPath path;
16 path.lineTo(20, 20);
17 path.lineTo(-10, -10);
18 SkPoint points[3];
19 debugster("no points", path, nullptr, 0);
20 debugster("zero max", path, points, 0);
21 debugster("too small", path, points, 2);
22 debugster("just right", path, points, path.countPoints());
23}
24} // END FIDDLE