{"push_id":827803729,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"c2c5138f3c3a4e3904e0cd8db4d764baa81cdd6b","before":"0d85ec5931d333c58832f6142bf6921a053f18bc","commits":[{"sha":"c2c5138f3c3a4e3904e0cd8db4d764baa81cdd6b","author":{"email":"bbd05ff7733346880a29a25d7fa9511d5154c4a4@163.com","name":"lzueclipse"},"message":"Rewriting Chapter 2 Finger Print cache, use slab allocator to manage memory, use linked list | binary search tree | skip list as different search algorithm.","distinct":true,"url":"https://api.github.com/repos/lzueclipse/learning/commits/c2c5138f3c3a4e3904e0cd8db4d764baa81cdd6b"}]}