make declaration order stable when generating bindings#212
Merged
dicej merged 2 commits intobytecodealliance:mainfrom Apr 8, 2026
Merged
make declaration order stable when generating bindings#212dicej merged 2 commits intobytecodealliance:mainfrom
dicej merged 2 commits intobytecodealliance:mainfrom
Conversation
Previously, the binding generator was non-deterministic in that it would generate different output for the same input across several runs due to the use of randomly-seeded `HashMap`s and `HashSet`s. Now we ensure the iteration order over those maps and sets is deterministic by first converting them to `BTreeMap`s and `BTreeSet`s, respectively. Also, the `Raises` clause we were adding to docstrings had not been updated to point to `componentize_py_types.Err`, so I fixed that as well.
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.
Previously, the binding generator was non-deterministic in that it would generate different output for the same input across several runs due to the use of randomly-seeded
HashMaps andHashSets. Now we ensure the iteration order over those maps and sets is deterministic by first converting them toBTreeMaps andBTreeSets, respectively.Also, the
Raisesclause we were adding to docstrings had not been updated to point tocomponentize_py_types.Err, so I fixed that as well.