lucasbru opened a new pull request, #20120:
URL: https://github.com/apache/kafka/pull/20120

   This is a very mechanical and obvious change that is making most accessors 
in ProcessState constant time O(1), instead of linear time O(n), by computing 
the collections and aggregations at insertion time, instead of every time the 
value is accessed. 
   
   Since the accessors are used in deeply nested loops, this reduces the 
runtime of our worst case benchmarks by ~14x.
   


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: jira-unsubscr...@kafka.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org

Reply via email to