`MinMaxPriorityQueue` is never needed. Also, when there is no threshold of the number of results, it's practically faster better to aggregate results in an `ArrayList` from the beginning and then sort in the end, than aggregate in a priority queue (because quick sort is considered faster than heap sort).
Also, I don't understand the meaning of `pagingIdentifiers` - it's not explained anywhere. Is it important for this Map to put entries in order? [ Full content available at: https://github.com/apache/incubator-druid/pull/6400 ] This message was relayed via gitbox.apache.org for [email protected]
