mirror of https://github.com/facebook/rocksdb.git
c2404d9928
Summary: VersionSet::ApproximateSize doesn't need to create two separate index iterators and do binary search for each in BlockBasedTable. So BlockBasedTable::ApproximateSize was added that creates the iterator once and uses it to calculate the data size between start and end keys. Pull Request resolved: https://github.com/facebook/rocksdb/pull/5693 Differential Revision: D16774056 Pulled By: elipoz fbshipit-source-id: 53ce262e1a057788243bf30cd9b8aa6581df1a18 |
||
|---|---|---|
| .. | ||
| plain_table_builder.cc | ||
| plain_table_builder.h | ||
| plain_table_factory.cc | ||
| plain_table_factory.h | ||
| plain_table_index.cc | ||
| plain_table_index.h | ||
| plain_table_key_coding.cc | ||
| plain_table_key_coding.h | ||
| plain_table_reader.cc | ||
| plain_table_reader.h | ||