mirror of https://github.com/apache/druid.git
ea006dc72a
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 |
||
---|---|---|
.. | ||
src | ||
pom.xml |