mirror of
https://github.com/apache/druid.git
synced 2025-02-20 17:11:47 +00:00
When the time extraction Top N algorithm is looking for aggregators, it makes 2 calls to hashCode on the key. Use Map#computeIfAbsent instead so that the hashCode is calculated only once