| commit | 07ed41fa405fe5f22c85f2fc9935397bbaa9c13b | [log] [tgz] |
|---|---|---|
| author | mdempsky <mdempsky@chromium.org> | Tue Sep 22 10:32:02 2015 -0700 |
| committer | Commit bot <commit-bot@chromium.org> | Tue Sep 22 10:32:02 2015 -0700 |
| tree | db6b4f6887b20346140f40cc9ac1a83af2c1ceb9 | |
| parent | e73f1f6dfa665802a942e743a227b5c98bc958db [diff] |
Fix possible integer overflow in SkTSearch's midpoint calculation Probably unlikely to matter in practice, but SkTQSort calculates its midpoint correctly, so we might as well do it here too. For more background, see Joshua Bloch's "Nearly All Binary Searches and Mergesorts are Broken" post: http://googleresearch.blogspot.ru/2006/06/extra-extra-read-all-about-it-nearly.html This doesn't change any public API. TBR=reed@google.com Review URL: https://codereview.chromium.org/1362613002