Replace get_smallest_lexicographic_outpoint by LexMin#26
Merged
nymius merged 1 commit intoJul 16, 2025
Merged
Conversation
The new LexMin is a zero allocation cost struct that allows computing the minimal lexicographic outpoint in the same loop where other logic is contained, avoiding the intermediate step of extracting all the outpoints from their TxIn into a separated collection to sort them.
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.
Description
The new LexMin is a zero allocation cost struct that allows computing the minimal lexicographic outpoint in the same loop where other logic is contained, avoiding the intermediate step of extracting all the outpoints from their TxIn into a separated collection to sort them.
All Submissions:
just p(fmt, clippy and test) before committing