{"push_id":1189670599,"size":2,"distinct_size":1,"ref":"refs/heads/master","head":"04be20500b6a7323effda3fd996315f4c7d6e4ec","before":"bc910acb678a9f3aeeec1b1d9e0d7d0964a8c349","commits":[{"sha":"d72abaa5b05e196be34b053ec63351248265576b","author":{"name":"Arthur O'Dwyer","email":"adc7c52b51d9cfce1f802b55e0e932a49bd503ff@gmail.com"},"message":"Rename SADD to ADD_INORDER, and _BY_HVAL to _BYHASHVALUE.\n\nThis is an API-breaking change.","distinct":false,"url":"https://api.github.com/repos/Quuxplusone/uthash/commits/d72abaa5b05e196be34b053ec63351248265576b"},{"sha":"04be20500b6a7323effda3fd996315f4c7d6e4ec","author":{"name":"Arthur O'Dwyer","email":"adc7c52b51d9cfce1f802b55e0e932a49bd503ff@gmail.com"},"message":"In HASH_FIND_IN_BKT, check for hash equality before key equality.\n\nKey equality (HASH_KEYCMP) is generally an expensive memcmp, whereas\nif the two keys have different hashes, we can find that out in a single\ninteger comparison.\n\nThis is a particularly big win if your hash table stores long strings\nall with the same length; for example, strings that started their life\nas SHA hashes.","distinct":true,"url":"https://api.github.com/repos/Quuxplusone/uthash/commits/04be20500b6a7323effda3fd996315f4c7d6e4ec"}]}
{"actor":{"display_login":"Quuxplusone"}}