weaselbot/conflict-set
1
Fork 0
forked from weaselab/conflict-set
Code Pull Requests Activity

Fixed missed usages of longestCommonPrefixPartialKey

Browse Source
This commit is contained in:
andrew
2024-02-22 16:24:26 -08:00
parent b5d5085fd5
commit 9a47f2d03a
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ConflictSet.cpp
+4 -2
View File
@@ -828,7 +828,8 @@ bool checkPointRead(Node *n, const std::span<const uint8_t> key,
if (n->partialKeyLen > 0) { if (n->partialKeyLen > 0) {
int commonLen = std::min<int>(n->partialKeyLen, remaining.size()); int commonLen = std::min<int>(n->partialKeyLen, remaining.size());
int i = longestCommonPrefix(n->partialKey, remaining.data(), commonLen); int i = longestCommonPrefixPartialKey(n->partialKey, remaining.data(),
commonLen);
if (i < commonLen) { if (i < commonLen) {
auto c = n->partialKey[i] <=> remaining[i]; auto c = n->partialKey[i] <=> remaining[i];
if (c > 0) { if (c > 0) {
@@ -1088,7 +1089,8 @@ struct CheckRangeLeftSide {
if (n->partialKeyLen > 0) { if (n->partialKeyLen > 0) {
int commonLen = std::min<int>(n->partialKeyLen, remaining.size()); int commonLen = std::min<int>(n->partialKeyLen, remaining.size());
int i = longestCommonPrefix(n->partialKey, remaining.data(), commonLen); int i = longestCommonPrefixPartialKey(n->partialKey, remaining.data(),
commonLen);
searchPathLen += i; searchPathLen += i;
if (i < commonLen) { if (i < commonLen) {
auto c = n->partialKey[i] <=> remaining[i]; auto c = n->partialKey[i] <=> remaining[i];