本文整理汇总了Java中java.util.PriorityQueue.toArray方法的典型用法代码示例。如果您正苦于以下问题：Java PriorityQueue.toArray方法的具体用法？Java PriorityQueue.toArray怎么用？Java PriorityQueue.toArray使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类java.util.PriorityQueue的用法示例。
在下文中一共展示了PriorityQueue.toArray方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: testToArray
import java.util.PriorityQueue; //导入方法依赖的package包/类
/**
* toArray contains all elements
*/
public void testToArray() {
PriorityQueue q = populatedQueue(SIZE);
Object[] o = q.toArray();
Arrays.sort(o);
for (int i = 0; i < o.length; i++)
assertSame(o[i], q.poll());
}
示例2: testToArray2
import java.util.PriorityQueue; //导入方法依赖的package包/类
/**
* toArray(a) contains all elements
*/
public void testToArray2() {
PriorityQueue<Integer> q = populatedQueue(SIZE);
Integer[] ints = new Integer[SIZE];
Integer[] array = q.toArray(ints);
assertSame(ints, array);
Arrays.sort(ints);
for (int i = 0; i < ints.length; i++)
assertSame(ints[i], q.poll());
}
示例3: getK
import java.util.PriorityQueue; //导入方法依赖的package包/类
public static ValueIndexPair[] getK(final ValueIndexPair[] array,
final int k, final Comparator<ValueIndexPair> comparator) {
if (k < 1) {
throw new IllegalArgumentException("k must be greater than zero!");
}
if (k > array.length) {
throw new IllegalArgumentException(
"k must be smaller or equal to the length of the array!");
}
// heapComp induces the opposite ordering to comparator
final Comparator<ValueIndexPair> heapComp =
new Comparator<ValueIndexPair>() {
@Override
public int compare(final ValueIndexPair o1,
final ValueIndexPair o2) {
return -comparator.compare(o1, o2);
}
};
// heap structure to keep first k elements
final PriorityQueue<ValueIndexPair> heap =
new PriorityQueue<ValueIndexPair>(k, heapComp);
for (int i = 0; i < array.length; i++) {
// fill heap
if (i < k) {
heap.add(array[i]);
} else {
// check if head of heap is larger than new element
if (comparator.compare(array[i], heap.peek()) == -1) {
// remove head
heap.poll();
// add new element and restore heap structure
heap.add(array[i]);
}
}
}
return heap.toArray(new ValueIndexPair[heap.size()]);
}