Refactor special character trimming in SpellCheck. #9057
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
Replaced repetitive loops and conditions with a more concise approach using HashSet for trimming special characters from the current word. This change improves code readability and performance by simplifying the logic that determines prefixes and postfixes. Signed-off-by: Ivandro Jao <Ivandrofly@gmail.com>
Eliminate an unnecessary blank line to improve code readability. This change has no impact on functionality but aids in maintaining cleaner code formatting. Signed-off-by: Ivandro Jao <Ivandrofly@gmail.com>
Simplify the logic for updating the text of the current spell check word by condensing conditional checks into a single line operation. This change enhances code readability and maintainability by reducing redundancy and streamlining the initialization process. Signed-off-by: Ivandro Jao <Ivandrofly@gmail.com>
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.
Replaced repetitive loops and conditions with a more concise approach using HashSet for trimming special characters from the current word. This change improves code readability and performance by simplifying the logic that determines prefixes and postfixes.