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

Add some const's

Browse Source
This commit is contained in:
Andrew Noyes
2024-02-13 15:48:08 -08:00
parent eef3c9e8d0
commit 57585ba800
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
ConflictSet.cpp
View File

@@ -964,8 +964,8 @@ bool checkRangeRead(Node *n, const std::span<const uint8_t> begin,
const std::span<const uint8_t> end, int64_t readVersion,
Arena &arena) {
int cl = std::min(begin.size(), end.size());
int lcp = longestCommonPrefix(begin.data(), end.data(), cl);
int lcp = longestCommonPrefix(begin.data(), end.data(),
std::min(begin.size(), end.size()));
SearchStepWise search{n, begin.subspan(0, lcp)};
for (;;) {
@@ -984,7 +984,7 @@ bool checkRangeRead(Node *n, const std::span<const uint8_t> begin,
0);
// Check that we can start FirstGeq where Search left off
int consumed = lcp - search.remaining.size();
const int consumed = lcp - search.remaining.size();
assert(consumed >= 0);
auto left =
firstGeq(search.n, begin.subspan(consumed, int(begin.size()) - consumed));
@@ -1015,7 +1015,7 @@ bool checkRangeRead(Node *n, const std::span<const uint8_t> begin,
bool first = true;
for (auto *iter = left.n; iter != nullptr; first = false) {
int cl = std::min(searchPath.size(), end.size());
const int cl = std::min(searchPath.size(), end.size());
assert(depth == int(searchPath.size()));
assert(lcp == longestCommonPrefix(searchPath.data(), end.data(), cl));