DRAFT: feat(core registry): Implement sort_early Pattern option. #1225
Conversation
This file contains 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
When scanning a document for patterns, resort patterns and set those with a sort_early property to the beginning of the initialization chain. NOTE: Only use when necessary. It's not guaranteed that a pattern with sort_early is set before another pattern with sort_early. Patterns which are registered later will have a higher chance to be sorted before others. Last come, first serve.
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.
When scanning a document for patterns, resort patterns and set those with a sort_early property to the beginning of the initialization chain.
NOTE: Only use when necessary. It's not guaranteed that a pattern with sort_early is set before another pattern with sort_early. Patterns which are registered later will have a higher chance to be sorted before others. Last come, first serve.
Note: This is an experiment. There was a use case for this which was solved differently. However, this can come in handy sometime. If so, we have a PR.