weaselab/conflict-set
2
0
Fork 0
Code Issues 4 Packages Releases 13 Activity

Unnest some in checkPointRead

Browse Source
This commit is contained in:
Andrew Noyes
2024-02-22 15:43:13 -08:00
parent c16feda9f8
commit 3c93b9a3ce
1 changed files with 12 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
ConflictSet.cpp
View File

@@ -808,12 +808,10 @@ bool checkPointRead(Node *n, const std::span<const uint8_t> key,
assert(c >= 0); assert(c >= 0);
n = getChildExists(n, c); n = getChildExists(n, c);
goto downLeftSpine; goto downLeftSpine;
} else { }
int c = getChildGeq(n, remaining[0]); int c = getChildGeq(n, remaining[0]);
if (c == remaining[0]) { if (c != remaining[0]) {
n = getChildExists(n, c);
remaining = remaining.subspan(1, remaining.size() - 1);
} else {
if (c >= 0) { if (c >= 0) {
n = getChildExists(n, c); n = getChildExists(n, c);
goto downLeftSpine; goto downLeftSpine;
@@ -822,7 +820,10 @@ bool checkPointRead(Node *n, const std::span<const uint8_t> key,
goto downLeftSpine; goto downLeftSpine;
} }
} }
}
n = getChildExists(n, c);
remaining = remaining.subspan(1, remaining.size() - 1);
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 = longestCommonPrefix(n->partialKey, remaining.data(), commonLen);