Searched refs:minHeap (Results 1 – 1 of 1) sorted by relevance
357 PriorityQueue<ResolverActivity.ResolvedComponentInfo> minHeap = new PriorityQueue<>(k, in topK() local363 minHeap.addAll(inputList.subList(size - k, size)); in topK()366 if (-mResolverComparator.compare(ci, minHeap.peek()) > 0) { in topK()369 inputList.set(pointer--, minHeap.poll()); in topK()370 minHeap.add(ci); in topK()380 while (!minHeap.isEmpty()) { in topK()381 inputList.set(pointer--, minHeap.poll()); in topK()