[
https://issues.apache.org/jira/browse/GROOVY-11904?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Daniel Sun updated GROOVY-11904:
--------------------------------
Description: Refactored 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. (was: binary search)
> Lookup table: O(1) 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
>
> Refactored 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)
