Make ascend/descend + iter updates more consistent
This commit is contained in:
@@ -1079,8 +1079,8 @@ bool checkRangeRead(Node *n, const std::span<const uint8_t> begin,
|
||||
iter = iter->parent;
|
||||
} else {
|
||||
ascend(depth, lcp, iter, searchPath);
|
||||
auto *result = getChildExists(iter->parent, next);
|
||||
iter = result;
|
||||
iter = iter->parent;
|
||||
iter = getChildExists(iter, next);
|
||||
descend(depth, lcp, iter, end, searchPath);
|
||||
break;
|
||||
}
|
||||
|
Reference in New Issue
Block a user