Home
last modified time | relevance | path

Searched refs:range (Results 1 – 8 of 8) sorted by relevance

/leveldb-1.20/
H A DTODO12 After a range is completely deleted, what gets rid of the
13 corresponding files if we do no future changes to that range. Make
/leveldb-1.20/include/leveldb/
H A Ddb.h130 virtual void GetApproximateSizes(const Range* range, int n,
/leveldb-1.20/doc/
H A Dtable_format.md65 in a block whose file offset falls within the range
70 the range `[ 0KB .. 2KB-1 ]`, all of the keys in X and Y will be
H A Dimpl.md89 new output file when the key range of the current output file has grown enough
103 are no higher numbered levels that contain a file whose range overlaps the
116 Assuming a disk IO rate of 100MB/s (ballpark range for modern drives), the worst
H A Dindex.md158 The following variation shows how to process just the keys in the range
485 file system space used by the key range `[a..c)` and `sizes[1]` to the
486 approximate number of bytes used by the key range `[x..z)`.
/leveldb-1.20/db/
H A Ddb_impl.h42 virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes);
H A Ddb_bench.cc833 const int range = (FLAGS_num + 99) / 100; in ReadHot() local
836 const int k = thread->rand.Next() % range; in ReadHot()
H A Ddb_impl.cc1449 const Range* range, int n, in GetApproximateSizes() argument
1461 InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()
1462 InternalKey k2(range[i].limit, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()