projects / platform / upstream / libSkiaSharp.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 4c6e47a) | patch
limit number of searched roots
authorcaryclark <caryclark@google.com>
Fri, 22 Jul 2016 17:56:26 +0000 (10:56 -0700)
committerCommit bot <commit-bot@chromium.org>
Fri, 22 Jul 2016 17:56:26 +0000 (10:56 -0700)
commit8a8accbcd1958c1646246b9b994fb47a3b5a6021
tree86353e74d8a7fd00c073746029ad0681a8376b25tree | snapshot
parent4c6e47a8a827077e36fa5feb4ab5ac7435d8276bcommit | diff
limit number of searched roots

Extreme numbers can generate more than
three found cubic roots when the roots
are found through a binary search.

Fail in this case.

TBR=reed@google.com
BUG=630649
GOLD_TRYBOT_URL= https://gold.skia.org/search?issue=2176733002

Review-Url: https://codereview.chromium.org/2176733002
src/pathops/SkPathOpsCubic.cpp diff | blob | history
tests/PathOpsOpTest.cpp diff | blob | history
Domain: Dotnet / API;