Repository navigation
Fix recursive Sequence decoding on supported Python 3.10 - #14
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.
On Python 3.10, nested
Sequence["Node"]declarations left child mappings undecoded and allowed undeclared child fields. Decoder and validator now share annotation_types declaration resolution, preserving declaring-module namespaces, Literal values, Annotated metadata, and typed members. Version 0.2.1 is a distinct patch declaration; v0.2.0 is unchanged.Closes #13
Validation: actual CPython 3.10.22 baseline 3 RED / 29 PASS; corrected full suite 145 PASS on Python 3.10 and 145 PASS on Python 3.12. Added boundary coverage checks metadata values, direct nested validation, and inherited cross-module name collisions. Receiving details. Shared installed dependencies are unchanged; no wheel publication or performance claim.