Compare commits
1
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
3d997d5c57 |
+6
-1
@@ -5631,6 +5631,9 @@ Node *firstGeqLogical(Node *n, const TrivialSpan key) {
|
|||||||
goto downLeftSpine;
|
goto downLeftSpine;
|
||||||
} else {
|
} else {
|
||||||
n = nextSibling(n);
|
n = nextSibling(n);
|
||||||
|
if (n == nullptr) {
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
goto downLeftSpine;
|
goto downLeftSpine;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -5928,7 +5931,9 @@ checkMaxVersion(Node *root, Node *node, InternalVersionT oldestVersion,
|
|||||||
expected = std::max(expected, child->entry.rangeVersion);
|
expected = std::max(expected, child->entry.rangeVersion);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
auto key = getSearchPath(root);
|
// Account for the range version of the first key after `node`'s subtree: a
|
||||||
|
// range write spanning the subtree is recorded there.
|
||||||
|
auto key = getSearchPath(node);
|
||||||
bool ok;
|
bool ok;
|
||||||
auto inc = strinc(key, ok);
|
auto inc = strinc(key, ok);
|
||||||
if (ok) {
|
if (ok) {
|
||||||
|
|||||||
Reference in new issue
Block a user