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

Update stale comments

Browse Source
This commit is contained in:
andrew
2024-09-05 10:06:02 -07:00
parent e2234be10f
commit 56893f9702
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ConflictSet.cpp
+3 -3
View File
@@ -2705,8 +2705,8 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
auto remaining = begin.subspan(0, lcp); auto remaining = begin.subspan(0, lcp);
Arena arena; Arena arena;
// If the common prefix isn't a prefix of any physical entry in the tree, we
// can go to "downLeftSpine" // Advance down common prefix, but stay on a physical path in the tree
for (;; ++tls->range_read_iterations_accum) { for (;; ++tls->range_read_iterations_accum) {
assert(getSearchPath(arena, n) <=> assert(getSearchPath(arena, n) <=>
begin.subspan(0, lcp - remaining.size()) == begin.subspan(0, lcp - remaining.size()) ==
@@ -2750,7 +2750,7 @@ bool checkRangeRead(Node *n, std::span<const uint8_t> begin,
return checkRangeRightSide(n, end, lcp, readVersion, tls); return checkRangeRightSide(n, end, lcp, readVersion, tls);
} }
// This makes it safe to check maxVersion within CheckRangeLeftSide. If this // This makes it safe to check maxVersion within checkRangeLeftSide. If this
// were false, then we would have returned above since lcp == begin.size(). // were false, then we would have returned above since lcp == begin.size().
assert(!(n->parent == nullptr && begin.size() == 0)); assert(!(n->parent == nullptr && begin.size() == 0));