[
https://issues.apache.org/jira/browse/GROOVY-11904?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=18071171#comment-18071171
]
ASF GitHub Bot commented on GROOVY-11904:
-----------------------------------------
daniellansun closed pull request #2435: GROOVY-11904: O(1) Lookup table instead
of O(log n) binary search modifiers
URL: https://github.com/apache/groovy/pull/2435
> O(1) Lookup table instead of O(log n) binary search modifiers
> -------------------------------------------------------------
>
> Key: GROOVY-11904
> URL: https://issues.apache.org/jira/browse/GROOVY-11904
> Project: Groovy
> Issue Type: Improvement
> Reporter: Daniel Sun
> Priority: Major
>
> Currently, the parser relies on a binary search algorithm to find modifiers,
> which operates at an O(log n) time complexity. Refactor the modifier
> resolution process to use a pre-computed lookup table instead of a binary
> search. This optimization reduces the lookup time complexity from O(log n) to
> O(1), enhancing performance during high-frequency modifier retrievals.
--
This message was sent by Atlassian Jira
(v8.20.10#820010)
