/src/leveldb/util/comparator.cc
Line | Count | Source |
1 | | // Copyright (c) 2011 The LevelDB Authors. All rights reserved. |
2 | | // Use of this source code is governed by a BSD-style license that can be |
3 | | // found in the LICENSE file. See the AUTHORS file for names of contributors. |
4 | | |
5 | | #include "leveldb/comparator.h" |
6 | | |
7 | | #include <algorithm> |
8 | | #include <cstdint> |
9 | | #include <string> |
10 | | #include <type_traits> |
11 | | |
12 | | #include "leveldb/slice.h" |
13 | | #include "util/logging.h" |
14 | | #include "util/no_destructor.h" |
15 | | |
16 | | namespace leveldb { |
17 | | |
18 | 961k | Comparator::~Comparator() = default; |
19 | | |
20 | | namespace { |
21 | | class BytewiseComparatorImpl : public Comparator { |
22 | | public: |
23 | 1 | BytewiseComparatorImpl() = default; |
24 | | |
25 | 241k | const char* Name() const override { return "leveldb.BytewiseComparator"; } |
26 | | |
27 | 49.3M | int Compare(const Slice& a, const Slice& b) const override { |
28 | 49.3M | return a.compare(b); |
29 | 49.3M | } |
30 | | |
31 | | void FindShortestSeparator(std::string* start, |
32 | 20.6k | const Slice& limit) const override { |
33 | | // Find length of common prefix |
34 | 20.6k | size_t min_length = std::min(start->size(), limit.size()); |
35 | 20.6k | size_t diff_index = 0; |
36 | 678k | while ((diff_index < min_length) && |
37 | 678k | ((*start)[diff_index] == limit[diff_index])) { |
38 | 657k | diff_index++; |
39 | 657k | } |
40 | | |
41 | 20.6k | if (diff_index >= min_length) { |
42 | | // Do not shorten if one string is a prefix of the other |
43 | 16.3k | } else { |
44 | 16.3k | uint8_t diff_byte = static_cast<uint8_t>((*start)[diff_index]); |
45 | 16.3k | if (diff_byte < static_cast<uint8_t>(0xff) && |
46 | 16.3k | diff_byte + 1 < static_cast<uint8_t>(limit[diff_index])) { |
47 | 12.1k | (*start)[diff_index]++; |
48 | 12.1k | start->resize(diff_index + 1); |
49 | 12.1k | assert(Compare(*start, limit) < 0); |
50 | 12.1k | } |
51 | 16.3k | } |
52 | 20.6k | } |
53 | | |
54 | 73.1k | void FindShortSuccessor(std::string* key) const override { |
55 | | // Find first character that can be incremented |
56 | 73.1k | size_t n = key->size(); |
57 | 162k | for (size_t i = 0; i < n; i++) { |
58 | 140k | const uint8_t byte = (*key)[i]; |
59 | 140k | if (byte != static_cast<uint8_t>(0xff)) { |
60 | 50.8k | (*key)[i] = byte + 1; |
61 | 50.8k | key->resize(i + 1); |
62 | 50.8k | return; |
63 | 50.8k | } |
64 | 140k | } |
65 | | // *key is a run of 0xffs. Leave it alone. |
66 | 73.1k | } |
67 | | }; |
68 | | } // namespace |
69 | | |
70 | 703k | const Comparator* BytewiseComparator() { |
71 | 703k | static NoDestructor<BytewiseComparatorImpl> singleton; |
72 | 703k | return singleton.get(); |
73 | 703k | } |
74 | | |
75 | | } // namespace leveldb |