{"push_id":1969288794,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"26345b9bb68af86b09b161bb0e272ce8af3a7395","before":"6727860e6bf0d3e6fa3b7c422ef7aa64bd6b4d18","commits":[{"sha":"26345b9bb68af86b09b161bb0e272ce8af3a7395","author":{"name":"Stephen","email":"1136b49be91e20768dcc59ea80261dcd3f92f01e@gmail.com"},"message":"Optimize Move/Rename Loop\n\nDictionary lookups can be costly. This commit changes the main loop of the find_duplicates method to iterate over the lists contained within the dictionary instead of the list of keys used to lookup the lists. The loop does, however, still return the hash value used as the key in the dictionary for use in the renaming procedure.","distinct":true,"url":"https://api.github.com/repos/XakNitram/DuplicateCheck/commits/26345b9bb68af86b09b161bb0e272ce8af3a7395"}]}
{"actor":{"display_login":"XakNitram"}}