You are viewing a plain text version of this content. The canonical link for it is here.

Posted to notifications@groovy.apache.org by "ASF GitHub Bot (Jira)" <ji...@apache.org> on 2026/04/04 17:17:00 UTC

[jira] [Commented] (GROOVY-11904) O(1) Lookup table instead of O(log n) binary search modifiers

    [ https://issues.apache.org/jira/browse/GROOVY-11904?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=18071096#comment-18071096 ] 

ASF GitHub Bot commented on GROOVY-11904:
-----------------------------------------

daniellansun opened a new pull request, #2435:
URL: https://github.com/apache/groovy/pull/2435

   https://issues.apache.org/jira/browse/GROOVY-11904




> 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
>
> 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)