test(cache): cover large and unreadable entries#556
Closed
wan9chi wants to merge 1 commit into
Closed
Conversation
Member
Author
|
Warning This pull request is not mergeable via GitHub because a downstack PR is open. Once all requirements are satisfied, merge this PR as a stack on Graphite.
This stack of pull requests is managed by Graphite. Learn more about stacking. |
This was referenced Jul 21, 2026
Co-authored-by: GPT-5.6 Codex <codex@openai.com>
wan9chi
force-pushed
the
agent/cache-regression-coverage
branch
from
July 21, 2026 03:56
f9d2ab5 to
a5e544a
Compare
wan9chi
force-pushed
the
agent/cache-row-recovery
branch
from
July 21, 2026 03:56
a159706 to
ffed460
Compare
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Motivation
The preallocation failure appears only after a large inferred-input cardinality. Unreadable-row recovery also depends on exact deletion and concurrency behavior that is easy to regress.
Changes