rocksdb/table/plain
Eli Pozniansky c2404d9928 Optimizing ApproximateSize to create index iterator just once (#5693)
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
2019-08-16 14:18:28 -07:00
..
plain_table_builder.cc Move some memory related files from util/ to memory/ (#5382) 2019-05-30 17:44:09 -07:00
plain_table_builder.h Organizing rocksdb/table directory by format 2019-05-30 14:51:11 -07:00
plain_table_factory.cc Organizing rocksdb/table directory by format 2019-05-30 14:51:11 -07:00
plain_table_factory.h Organizing rocksdb/table directory by format 2019-05-30 14:51:11 -07:00
plain_table_index.cc simplify include directive involving inttypes (#5402) 2019-06-06 13:56:07 -07:00
plain_table_index.h Move some memory related files from util/ to memory/ (#5382) 2019-05-30 17:44:09 -07:00
plain_table_key_coding.cc Move some memory related files from util/ to memory/ (#5382) 2019-05-30 17:44:09 -07:00
plain_table_key_coding.h Move some memory related files from util/ to memory/ (#5382) 2019-05-30 17:44:09 -07:00
plain_table_reader.cc Optimizing ApproximateSize to create index iterator just once (#5693) 2019-08-16 14:18:28 -07:00
plain_table_reader.h Optimizing ApproximateSize to create index iterator just once (#5693) 2019-08-16 14:18:28 -07:00