{"push_id":648868480,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"cb823bcef48e7e234eddb56e5c637f132ff8890e","before":"ac2d01a0f531bc904c055d60d229fb67d2df7982","commits":[{"sha":"7d2e9e6fe849b5fac0f0ec9bada3b2379ff9e578","author":{"email":"0d0fad2aee90ac419af4981eccdab0afd353ceb6@gmail.com","name":"Jakub Bukaj"},"message":"Use a Levenshtein distance implementation from the strsim crate","distinct":true,"url":"https://api.github.com/repos/docopt/docopt.rs/commits/7d2e9e6fe849b5fac0f0ec9bada3b2379ff9e578"},{"sha":"cb823bcef48e7e234eddb56e5c637f132ff8890e","author":{"email":"816d9d5b550360e0a4a4b626f349db7b98a5ef6b@gmail.com","name":"Andrew Gallant"},"message":"Merge pull request #120 from jakub-/strsim-levenshtein\n\nUse a Levenshtein distance implementation from the strsim crate","distinct":true,"url":"https://api.github.com/repos/docopt/docopt.rs/commits/cb823bcef48e7e234eddb56e5c637f132ff8890e"}]}