Repository navigation
Compose bounded repairs for indexed record copies - #7
Merged
Merged
Conversation
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
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.
Repeated indexed-record copies could miss existing repairs because they use nested global records, conversion macros and candidate-owned volatile words. Add a finite composition of declared-stride rebasing, retained word reads, conversion placement, ordinary field-store ordering, byte captures and index carriers. The library only proposes complete C candidates; it never compiles or supplies a match verdict.
Raw MIPS bases, declared scalar widths, disjoint fields, pure indices and private declaration spans gate proposals. Existing volatile access order is retained; unknown layouts, observable line macros, effectful accesses and unsupported macros decline. The recipe is capped at 64 alternatives and does not exclude a large function solely for exceeding 512 instructions. Bump the library to 0.5.2 for the app integration.
Validation: ruff passes; 120 tests passed, 1 skipped. A copied ROM-backed development replay starts only with the frozen original source/header/target/compiler: the integrated app selector improves score 9772 to 150 on trial 18 within 64 trials; the previous selector stays at 9772 under the same budget. This recovers a prior 99.8% near match, not an exact match or new game progress. No manual intermediate is supplied to the search. Public tests use homemade records and words only; private game data/source and the running app are untouched.