{"push_id":567745291,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"cdc7dd7a99b60720cbd0a1e663d5528f23baefab","before":"3890ed47786ce3d327cf0d1438764e778fb54ebb","commits":[{"sha":"cdc7dd7a99b60720cbd0a1e663d5528f23baefab","author":{"email":"5ee0edb9e2229c0838f1959779f1949031de0123@timbaumann.info","name":"Tim Baumann"},"message":"Refactor:\n\n* gallopLeft -> gallopingSearchLeftPBounds:\n  this new function performs a general search beginning at the left\n* rename variables\n\nSomehow, these changes improved performance. Timsort is now on par with\nmergesort on random inputs.","distinct":true,"url":"https://api.github.com/repos/timjb/haskell-timsort/commits/cdc7dd7a99b60720cbd0a1e663d5528f23baefab"}]}