split hash calc ancient slot boundary to allow for ancient shrinking … #33216
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
…to be behind
Problem
When ancient append vecs are shrinking, we can end up creating far too many chunks of cached hash data files for efficiency. We only want to cache individual append vecs when they are large. The other ones (that we haven't packed yet), we want to cache in slot ranges.
Summary of Changes
Modify the algorithm that splits ancient vs non ancient to ignore 'old' slots that haven't been packed yet (as evidenced by their smaller size).
Fixes #