{"push_id":1229854291,"size":6,"distinct_size":1,"ref":"refs/heads/master","head":"33478a9e49ff7f7879d4243512f231a03c69e127","before":"daaa1bd06f2e3170a49c6025a2a27e8cc0452fdc","commits":[{"sha":"44235274cd9417486a218632cac4d6d6aadfb69f","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"Remove variable that was used once.","distinct":false,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/44235274cd9417486a218632cac4d6d6aadfb69f"},{"sha":"6d811003ed0e4208bc1e24efce21c49f4d07e0f7","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"Add specialization of split_cubic_into_n() for n=4\n\n...by calling split_cubic_into_two() twice.  Gives another 5% speedup.","distinct":false,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/6d811003ed0e4208bc1e24efce21c49f4d07e0f7"},{"sha":"96eb3baa158e1965b346d58d04f06ae650a5f591","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"Add specialization of split_cubic_into_n() for n=6\n\n...by calling split_cubic_into_three() twice.  Gives another 5..9%\nspeedup.  The thing is, while higher n values are lower-frequency,\nthe savings are also bigger.  So the two offset out.","distinct":false,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/96eb3baa158e1965b346d58d04f06ae650a5f591"},{"sha":"06eb980a0ce8c2ebc9e081690dd8fc02aa98e987","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"Split off case of n=1 into its own function\n\nLooks like changes like this don't have measurable performance\npenalty, but they do help with analyzing profile output to see\nwhich branch (n=1 or n!=1) takes more time.","distinct":false,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/06eb980a0ce8c2ebc9e081690dd8fc02aa98e987"},{"sha":"17b034c90424ac7acf72b668d41608c975d83719","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"In curves_to_quadratic(), avoid some more work\n\nWhen a curve fails to convert at a certain n, keep increasing n for\nthis curve until a fit found.  Saves another 7% in the benchmark.","distinct":false,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/17b034c90424ac7acf72b668d41608c975d83719"},{"sha":"33478a9e49ff7f7879d4243512f231a03c69e127","author":{"name":"Behdad Esfahbod","email":"96048909009fe930a273b391ee7707e6dc74c5b0@behdad.org"},"message":"Merge pull request #40 from googlei18n/never-say-never\n\nNever say never","distinct":true,"url":"https://api.github.com/repos/googlei18n/cu2qu/commits/33478a9e49ff7f7879d4243512f231a03c69e127"}]}
{"actor":{"display_login":"behdad"}}