diff options
author | halcanary <halcanary@google.com> | 2016-03-29 09:03:52 -0700 |
---|---|---|
committer | Commit bot <commit-bot@chromium.org> | 2016-03-29 09:03:53 -0700 |
commit | 9d524f22bfde5dc3dc8f48e1be39bdebd3bb0304 (patch) | |
tree | fc75ea6f8bc83b552d9ac9c9b4ac0d5a967ee5ac /tests/SubsetPath.h | |
parent | e577693b3be06d90c824538e7eac0b25b0e02a99 (diff) |
Style bikeshed - remove extraneous whitespace
GOLD_TRYBOT_URL= https://gold.skia.org/search2?unt=true&query=source_type%3Dgm&master=false&issue=1842753002
Review URL: https://codereview.chromium.org/1842753002
Diffstat (limited to 'tests/SubsetPath.h')
-rw-r--r-- | tests/SubsetPath.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/tests/SubsetPath.h b/tests/SubsetPath.h index 65067d1b0b..9e4d2316aa 100644 --- a/tests/SubsetPath.h +++ b/tests/SubsetPath.h @@ -11,15 +11,15 @@ #include "SkTDArray.h" /* Given a path, generate a the desired minimal subset of the original. - + This does a binary divide-and-conquer on the path, first splitting by contours, and then by verbs. The caller passes whether the previous subset behaved the same as the original. If not, the subset() call restores the prior state before returning a new subset. - + If a path fails a local test, this reduces the data to the minimal set that fails using a pattern like: - + bool testFailed = true; SkPath minimal; SubsetContours subsetContours(testPath); |