{"push_id":650253744,"size":3,"distinct_size":0,"ref":"refs/heads/master","head":"dddceefe5efe5d9038f19f399d8a4ca7eefcf688","before":"7246ad34d05dc4a29aadd80b378a607885c2edb2","commits":[{"sha":"fd96b554026d5c1d4278d4b2fef7ba09a7fc8d83","author":{"email":"b74673f3c990e809b0211cc26cf8ff8cc1ef0907@fb.com","name":"Igor Canadi"},"message":"Making GetOptions() comment better (#597)","distinct":false,"url":"https://api.github.com/repos/norton/rocksdb/commits/fd96b554026d5c1d4278d4b2fef7ba09a7fc8d83"},{"sha":"d4540654e9815fb7c79cfe854a802a8fcb821287","author":{"email":"d046245a5851310b17dbc43de443633846271935@fb.com","name":"krad"},"message":"Optimize GetApproximateSizes() to use lesser CPU cycles.\n\nSummary:\nCPU profiling reveals GetApproximateSizes as a bottleneck for performance. The current implementation is sub-optimal, it scans every file in every level to compute the result.\n\nWe can take advantage of the fact that all levels above 0 are sorted in the increasing order of key ranges and use binary search to locate the starting index. This can reduce the number of comparisons required to compute the result.\n\nTest Plan: We have good test coverage. Run the tests.\n\nReviewers: sdong, igor, rven, dynamike\n\nSubscribers: dynamike, maykov, dhruba, leveldb\n\nDifferential Revision: https://reviews.facebook.net/D37755","distinct":false,"url":"https://api.github.com/repos/norton/rocksdb/commits/d4540654e9815fb7c79cfe854a802a8fcb821287"},{"sha":"dddceefe5efe5d9038f19f399d8a4ca7eefcf688","author":{"email":"b74673f3c990e809b0211cc26cf8ff8cc1ef0907@fb.com","name":"Igor Canadi"},"message":"Fix clang build\n\nSummary: fix build\n\nTest Plan: works\n\nReviewers: kradhakrishnan\n\nSubscribers: dhruba, leveldb\n\nDifferential Revision: https://reviews.facebook.net/D37911","distinct":false,"url":"https://api.github.com/repos/norton/rocksdb/commits/dddceefe5efe5d9038f19f399d8a4ca7eefcf688"}]}