Searched refs:minHeap (Results 1 – 1 of 1) sorted by relevance
327 PriorityQueue<ResolverActivity.ResolvedComponentInfo> minHeap = new PriorityQueue<>(k, in topK() local333 minHeap.addAll(inputList.subList(size - k, size)); in topK()336 if (-mResolverComparator.compare(ci, minHeap.peek()) > 0) { in topK()339 inputList.set(pointer--, minHeap.poll()); in topK()340 minHeap.add(ci); in topK()350 while (!minHeap.isEmpty()) { in topK()351 inputList.set(pointer--, minHeap.poll()); in topK()