Home
last modified time | relevance | path

Searched refs:start (Results 1 – 19 of 19) sorted by relevance

/leveldb-1.20/util/
H A Dcomparator.cc30 std::string* start, in FindShortestSeparator() argument
33 size_t min_length = std::min(start->size(), limit.size()); in FindShortestSeparator()
36 ((*start)[diff_index] == limit[diff_index])) { in FindShortestSeparator()
43 uint8_t diff_byte = static_cast<uint8_t>((*start)[diff_index]); in FindShortestSeparator()
46 (*start)[diff_index]++; in FindShortestSeparator()
47 start->resize(diff_index + 1); in FindShortestSeparator()
48 assert(Compare(*start, limit) < 0); in FindShortestSeparator()
H A Dcoding_test.cc89 const char* start = p; in TEST() local
93 ASSERT_EQ(VarintLength(actual), p - start); in TEST()
124 const char* start = p; in TEST() local
128 ASSERT_EQ(VarintLength(actual), p - start); in TEST()
/leveldb-1.20/table/
H A Dfilter_block.cc98 uint32_t start = DecodeFixed32(offset_ + index*4); in KeyMayMatch() local
100 if (start <= limit && limit <= static_cast<size_t>(offset_ - data_)) { in KeyMayMatch()
101 Slice filter = Slice(data_ + start, limit - start); in KeyMayMatch()
103 } else if (start == limit) { in KeyMayMatch()
H A Dtable_test.cc49 std::string* start, in FindShortestSeparator() argument
51 std::string s = Reverse(*start); in FindShortestSeparator()
54 *start = Reverse(s); in FindShortestSeparator()
/leveldb-1.20/db/
H A Ddbformat.cc69 std::string* start, in FindShortestSeparator() argument
72 Slice user_start = ExtractUserKey(*start); in FindShortestSeparator()
81 assert(this->Compare(*start, tmp) < 0); in FindShortestSeparator()
83 start->swap(tmp); in FindShortestSeparator()
H A Dautocompact_test.cc42 uint64_t Size(const Slice& start, const Slice& limit) { in Size() argument
43 Range r(start, limit); in Size()
H A Ddb_bench.cc156 size_t start = 0; in TrimSpace() local
157 while (start < s.size() && isspace(s[start])) { in TrimSpace()
158 start++; in TrimSpace()
161 while (limit > start && isspace(s[limit-1])) { in TrimSpace()
164 return Slice(s.data() + start, limit - start); in TrimSpace()
297 bool start; member
568 while (!shared->start) { in ThreadBody()
592 shared.start = false; in RunBenchmark()
609 shared.start = true; in RunBenchmark()
H A Dc_test.c283 const char* start[2] = { "a", "k00000000000000010000" }; in main() local
295 leveldb_approximate_sizes(db, 2, start, start_len, limit, limit_len, sizes); in main()
H A Ddbformat.h121 std::string* start,
H A Ddb_test.cc422 uint64_t Size(const Slice& start, const Slice& limit) { in Size() argument
423 Range r(start, limit); in Size()
429 void Compact(const Slice& start, const Slice& limit) { in Compact() argument
430 db_->CompactRange(&start, &limit); in Compact()
1924 virtual void CompactRange(const Slice* start, const Slice* end) { in CompactRange() argument
2121 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply() local
2123 vbase.AddFile(2, fnum++, 1 /* file size */, start, limit); in BM_LogAndApply()
2132 InternalKey start(MakeKey(2*fnum), 1, kTypeValue); in BM_LogAndApply() local
2134 vedit.AddFile(2, fnum++, 1 /* file size */, start, limit); in BM_LogAndApply()
H A Ddb_impl.cc1461 InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek); in GetApproximateSizes()
1463 uint64_t start = versions_->ApproximateOffsetOf(v, k1); in GetApproximateSizes() local
1465 sizes[i] = (limit >= start ? limit - start : 0); in GetApproximateSizes()
H A Dc.cc260 ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]); in leveldb_approximate_sizes()
H A Dversion_set.cc509 InternalKey start(smallest_user_key, kMaxSequenceNumber, kValueTypeForSeek); in PickLevelForMemTableOutput() local
518 GetOverlappingInputs(level + 2, &start, &limit, &overlaps); in PickLevelForMemTableOutput()
/leveldb-1.20/include/leveldb/
H A Ddb.h34 Slice start; // Included in the range member
38 Range(const Slice& s, const Slice& l) : start(s), limit(l) { } in Range()
H A Dcomparator.h47 std::string* start,
/leveldb-1.20/doc/bench/
H A Ddb_bench_tree_db.cc119 int start = 0; in TrimSpace() local
120 while (start < s.size() && isspace(s[start])) { in TrimSpace()
121 start++; in TrimSpace()
124 while (limit > start && isspace(s[limit-1])) { in TrimSpace()
127 return Slice(s.data() + start, limit - start); in TrimSpace()
H A Ddb_bench_sqlite3.cc150 int start = 0; in TrimSpace() local
151 while (start < s.size() && isspace(s[start])) { in TrimSpace()
152 start++; in TrimSpace()
155 while (limit > start && isspace(s[limit-1])) { in TrimSpace()
158 return Slice(s.data() + start, limit - start); in TrimSpace()
/leveldb-1.20/doc/
H A Dtable_format.md69 Currently, "base" is 2KB. So for example, if blocks X and Y start in
H A Dindex.md159 [start,limit):
162 for (it->Seek(start);