{"push_id":882767562,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"85f1e01e97284f80606bcd37ccd0a49ca8b227cb","before":"ff2e2f9675a21b69d8b5c637d04bf3adec06f0fb","commits":[{"sha":"85f1e01e97284f80606bcd37ccd0a49ca8b227cb","author":{"email":"358f9ca79d27f14232713e8775299050ad0a1387@gmail.com","name":"Colin Marc"},"message":"Properly construct hash tables, sorted and with blank spaces\n\nWhile filling up the hash table entirely does actually work, we end up seeking\nonce for every entry in the worst case.","distinct":true,"url":"https://api.github.com/repos/colinmarc/cdb/commits/85f1e01e97284f80606bcd37ccd0a49ca8b227cb"}]}