c0bd9f9fe5
Current strategy: everything from the top
Things to look at first are the manual changes:
- added tools/rewrite_includes.py
- removed -Idirectives from BUILD.gn
- various compile.sh simplifications
- tweak tools/embed_resources.py
- update gn/find_headers.py to write paths from the top
- update gn/gn_to_bp.py SkUserConfig.h layout
so that #include "include/config/SkUserConfig.h" always
gets the header we want.
No-Presubmit: true
Change-Id: I73a4b181654e0e38d229bc456c0d0854bae3363e
Reviewed-on: https://skia-review.googlesource.com/c/skia/+/209706
Commit-Queue: Mike Klein <mtklein@google.com>
Reviewed-by: Hal Canary <halcanary@google.com>
Reviewed-by: Brian Osman <brianosman@google.com>
Reviewed-by: Florin Malita <fmalita@chromium.org>
25 lines
876 B
C++
25 lines
876 B
C++
// Copyright 2019 Google LLC.
|
|
// Use of this source code is governed by a BSD-style license that can be found in the LICENSE file.
|
|
#include "tools/fiddle/examples.h"
|
|
// HASH=6b97099acdae80b16df0c4241f593991
|
|
REG_FIDDLE(Path_IsCubicDegenerate, 256, 256, true, 0) {
|
|
void draw(SkCanvas* canvas) {
|
|
SkPoint points[] = {{1, 0}, {0, 0}, {0, 0}, {0, 0}};
|
|
SkScalar step = 1;
|
|
SkScalar prior, length = 0, degenerate = 0;
|
|
do {
|
|
prior = points[0].fX;
|
|
step /= 2;
|
|
if (SkPath::IsCubicDegenerate(points[0], points[1], points[2], points[3], false)) {
|
|
degenerate = prior;
|
|
points[0].fX += step;
|
|
} else {
|
|
length = prior;
|
|
points[0].fX -= step;
|
|
}
|
|
} while (prior != points[0].fX);
|
|
SkDebugf("%1.8g is degenerate\n", degenerate);
|
|
SkDebugf("%1.8g is length\n", length);
|
|
}
|
|
} // END FIDDLE
|