{"push_id":1206709058,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"8ad4d743169ce996d9e759cf2e53a2cf184d9f14","before":"aee2a7de952e894a1e7610fae9d0414dee7e9d33","commits":[{"sha":"392dd94bf7b5dc56bf81b71552886909011450f0","author":{"name":"NikolaiHampton","email":"0807db747bcd1f674f2956fb55c05d094befc719@3583bytesready.net"},"message":"Optimisation of Levenshtein calc in radiff2 -s\n\n- Optimised the distance calculation for radiff -s\n- Fixed a bug in radiff.c that where verbose was always true.\n- Added check that calloc() was successful.\n- Shuffled code around to minimise use of free()\n- Added some comments.\n\nSpeeds up the radiff2 statistical diff. Drastically reduced the ‘edit\ndistance search space’ by ignoring ranges that can’t affect the edit\ndistance. Improves search for similar files (common use case?), can\nreduce the search space significantly:\n\nOne file tested went from two unknown versions of httpd, on MacBook has\na 28 hours processing time, down to ~13 minutes. Results will vary based\non file differences the more similar the files, the faster it'll run.","distinct":true,"url":"https://api.github.com/repos/radare/radare2/commits/392dd94bf7b5dc56bf81b71552886909011450f0"},{"sha":"8ad4d743169ce996d9e759cf2e53a2cf184d9f14","author":{"name":"Álvaro Felipe Melchor","email":"e451e2f7f46d03c7fc89294db8a0de71fff7327c@gmail.com"},"message":"fix off by one when diffing","distinct":true,"url":"https://api.github.com/repos/radare/radare2/commits/8ad4d743169ce996d9e759cf2e53a2cf184d9f14"}]}
{"actor":{"display_login":"alvarofe"}}