{"push_id":913858066,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"85b12a433526ef28ac7b23947ce0cb5b845820d9","before":"ae79d7ec2054d35b742c6a9071493eca7bd4f084","commits":[{"sha":"85b12a433526ef28ac7b23947ce0cb5b845820d9","author":{"email":"e4dbf84907d3b3691a50f0826e566a8d26f8fd7a@gmail.com","name":"Daniel Lemire"},"message":"Optimizing the basic shuffle.","distinct":true,"url":"https://api.github.com/repos/lemire/BatchHashMap/commits/85b12a433526ef28ac7b23947ce0cb5b845820d9"}]}